Zobrazeno 1 - 10
of 1 587
pro vyhledávání: '"Loop (graph theory)"'
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 41:2929-2942
Coarse-grained reconfigurable architecture (CGRA) is a promising programmable hardware with high power-efficiency and high performance. However, compiling and optimizing loops with irregular branches on CGRAs is a challenge to fulfill the performance
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a60d1dac9f1d77195c965ca371d33f29
https://doi.org/10.1109/tcad.2021.3121346
https://doi.org/10.1109/tcad.2021.3121346
Publikováno v:
IEEE Transactions on Automatic Control, 67(7), 3494-3506. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
While it is widely used to represent hysteresis phenomena with unidirectional-oriented loops, we study in this article the use of Preisach operator for describing hysteresis behavior with multidirectional-oriented loops. This complex hysteresis behav
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc07eac06fd31782b71b347a2ddfd9bf
https://doi.org/10.1109/tac.2021.3109533
https://doi.org/10.1109/tac.2021.3109533
Publikováno v:
IEEE Transactions on Automation Science and Engineering. 19:1707-1718
Deadlocks are a highly undesirable situation in flexible manufacturing systems (FMSs). This article presents a direct and novel method to detect such markings by constructing the resource flow graph of a Petri net that models an FMS and to recover su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ff3ca8c8709eace312152402fa32ae0
https://doi.org/10.1109/tase.2021.3114498
https://doi.org/10.1109/tase.2021.3114498
Publikováno v:
IEEE Transactions on Intelligent Transportation Systems. 23:7332-7342
This paper proposes a parallel recommendation engine, PRECOM, for traffic control operations to mitigate congestion of road traffic in the metropolitan area. The recommendation engine can provide, in real-time, effective and optimal control plans to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::193e87952f208d866f3d1ba5aef7bf7f
https://doi.org/10.1109/tits.2021.3068874
https://doi.org/10.1109/tits.2021.3068874
Publikováno v:
IEEE Transactions on Cybernetics. 52:5088-5097
In this article, we present a multiagent framework for real-time large-scale 3-D reconstruction applications. In SLAM, researchers usually build and update a 3-D map after applying nonlinear pose graph optimization techniques. Moreover, many multiage
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35f7bd6dd07477d552de437170cfb8d5
https://doi.org/10.1109/tcyb.2020.3027307
https://doi.org/10.1109/tcyb.2020.3027307
Publikováno v:
IEEE Transactions on Geoscience and Remote Sensing. 60:1-11
To date, accurate building footprint delineation in the surveying, mapping and geographic information system (GIS) communities has been dependent on human labor. In this paper, to address this issue, we propose a concentric loop convolutional neural
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b70580c4345cb4a1a2d7c69ce3966b3
https://doi.org/10.1109/tgrs.2021.3126704
https://doi.org/10.1109/tgrs.2021.3126704
Publikováno v:
IEEE Transactions on Geoscience and Remote Sensing. 60:1-14
To register multiview, unordered point clouds from forest scenes, we must establish how scans are associated. The proposed method, called RegisMUF, can register arbitrary forest point clouds from aiming scenarios without knowledge of initial position
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c404d14de2479830e752f9fc24a8b309
https://doi.org/10.1109/tgrs.2021.3057643
https://doi.org/10.1109/tgrs.2021.3057643
Publikováno v:
IEEE Transactions on NanoBioscience. 21:75-85
The Family Traveling Salesperson Problem (FTSP) is a variant of the Traveling Salesperson Problem (TSP), in which all vertices are divided into several different families, and the goal of the problem is to find a loop that concatenates a specified nu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0eb0c706e706d8a516eb28a779a2fe34
https://doi.org/10.1109/tnb.2021.3109067
https://doi.org/10.1109/tnb.2021.3109067
Publikováno v:
MEJ. Mansoura Engineering Journal. 26:14-21
This paper presents an efficient line-offset algorithm for general polygonal shapes with islands. A developed sweep-line algorithm (SL) is introduced to find all sell-intersection points accurately and quickly. The previous work is limited to handle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa968a1026a1fc1b181c003003b8eac3
https://doi.org/10.21608/bfemu.2021.146094
https://doi.org/10.21608/bfemu.2021.146094
Autor:
Hemmo Meyer, Johannes van den Boom, Maike Giesing, Markus Kaiser, Dongqing Pan, Anja F Kueck, Farnusch Kaschani, Andrea Musacchio, Bojana Kravic, Helen Müschenborn
Publikováno v:
Nature Structural & Molecular Biology. 28:964-971
The AAA-ATPase VCP/p97/Cdc48 unfolds proteins by threading them through its central pore, but how substrates are recognized and inserted into the pore in diverse pathways has remained controversial. Here, we show that p97, with its adapter p37, binds
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13ea5df46659cf9616ab7e5d5c1125d3
https://doi.org/10.1038/s41594-021-00684-5
https://doi.org/10.1038/s41594-021-00684-5