Results 61 to 70 of about 103,948 (265)
Delay constraint minimum interruption routing algorithm for mobile satellite network
Tongxin xuebao, 2006 By the analysis of the characteristics of mobile satellite network,such as a long delay and a topological time-varying,a novel satellite network delay constraint optimal path（SDCOP）algorithm,which could obtain a path to sat-isfy the delay constraint ...
ZHANG Tao, LIU Zhong-kan, ZHANG Jun
doaj +2 more sources
Optimal time reuse strategy-based dynamic multi-AGV path planning method
Complex & Intelligent SystemsThe window strategy, known for its flexibility and efficiency, is extensively used in dynamic path planning. To further enhance the performance of the Automated Guided Vehicles (AGVs) sorting system, the two processes of AGV movement and path planning ...
Ke Wang +4 more
doaj +1 more source
Memristive Crossbar Arrays for Storage and Computing Applications
Advanced Intelligent Systems, 2021 The emergence of memristors with potential applications in data storage and artificial intelligence has attracted wide attentions. Memristors are assembled in crossbar arrays with data bits encoded by the resistance of individual cells.
Huihan Li +10 more
doaj +1 more source
Recent insights into the molecular mechanism of ubiquinol oxidation by cytochrome bc1
FEBS Open Bio, EarlyView.The review reflects on the mechanism of the catalytic reaction in cytochrome bc1: the electron bifurcation that involves the separation of two electrons derived from the quinol oxidation to opposite sides of the enzyme across the membrane. This review summarizes the long‐standing effort to understand the mechanism of quinol oxidation catalyzed by ...
Anna Wójcik‐Augustyn +2 more
wiley +1 more source
FEBS Open Bio, EarlyView.Functional screening identified PcSyn14890, a cyanobacteria‐specific protein that enhances growth and stress resistance in E. coli and Synechocystis PCC6803. Although we expected it to function as a molecular chaperone, it was unable to protect against thermal aggregation of GAPDH.
Akiyo Yamada +7 more
wiley +1 more source
A Global Path Planning Algorithm Based on Bidirectional SVGA
Journal of Robotics, 2017 For path planning algorithms based on visibility graph, constructing a visibility graph is very time-consuming. To reduce the computing time of visibility graph construction, this paper proposes a novel global path planning algorithm, bidirectional SVGA (
Taizhi Lv, Chunxia Zhao, Jiancheng Bao
doaj +1 more source
Shortest path computation with no information leakage [PDF]
Proceedings of the VLDB Endowment, 2012 Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences ...
Kyriakos Mouratidis, Man Lung Yiu
openaire +5 more sources
Using fluorescence fluctuation spectroscopy to quantify molecular dynamics within cells
FEBS Open Bio, EarlyView.Microscopy techniques like fluorescence correlation spectroscopy (FCS) and number and brightness analysis (N&B) allow to quantify concentrations, diffusion rates, and oligomerization of fluorescently labeled molecules in the living cell. In this protocol the principles of how to set up these types of experiments are described including calibration ...
Mark A. Hink
wiley +1 more source
Extending SQL for Computing Shortest Paths [PDF]
Proceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems, 2017 Reachability and shortest paths are among two of the most common queries realized on graphs. While graph frameworks and property graph databases provide an extensive and convenient built-in support for these operations, it is still both clunky and inefficient to perform on standard SQL DBMSs.
D. De Leo (Dean), P.A. Boncz (Peter)
openaire +3 more sources