Results 81 to 90 of about 151,418 (244)

Quantum Emitters in Hexagonal Boron Nitride: Principles, Engineering and Applications

open access: yesAdvanced Functional Materials, EarlyView.
Quantum emitters in hexagonal boron nitride have emerged as a promising candidate for quantum information science. This review examines the fundamentals of these quantum emitters, including their level structures, defect engineering, and their possible chemical structures.
Thi Ngoc Anh Mai   +8 more
wiley   +1 more source

An Optimal Adaptive Network Coding Scheme for Minimizing Decoding Delay in Broadcast Erasure Channels

open access: yesEURASIP Journal on Wireless Communications and Networking, 2010
We are concerned with designing feedback-based adaptive network coding schemes with the aim of minimizing decoding delay in each transmission in packet-based erasure networks.
Parastoo Sadeghi   +2 more
doaj   +2 more sources

Evaluation of Algorithms for Identification of Minimal Cut Vectors and Minimal Path Vectors in Multi-State Systems

open access: yesCommunications, 2015
Minimal Cut Vectors (MCVs) and Minimal Path Vectors (MPVs) are one of the key concepts of reliability analysis. They allow us to estimate system availability or to analyze influence of individual system components on the entire system.
Miroslav Kvassay, Jozef Kostolny
doaj   +1 more source

Synchrotron Radiation for Quantum Technology

open access: yesAdvanced Functional Materials, EarlyView.
Materials and interfaces underpin quantum technologies, with synchrotron and FEL methods key to understanding and optimizing them. Advances span superconducting and semiconducting qubits, 2D materials, and topological systems, where strain, defects, and interfaces govern performance.
Oliver Rader   +10 more
wiley   +1 more source

Optimal Ordering of Conflicting Objects and the Traveling Salesman Problem

open access: yesТруды Института системного программирования РАН, 2018
The paper presents the setting of the problem of optimal ordering of conflicting objects related to the Travelling Salesman Problem (TSP). The problem of optimal ordering of conflicting objects appears in sociology, in graph analysis and finding in them ...
Alexey Voevodin, Semen Kosyachenko
doaj  

Fast and Accurate Direct Position Estimation Using Low-Complexity Correlation and Swarm Intelligence Optimization

open access: yesRemote Sensing
Direct Position Estimation (DPE) is an alternative GNSS positioning method that models received satellite signals as a function of the receiver’s navigation state, allowing for the direct estimation of position, velocity, and time within the navigation ...
Yuze Duan   +4 more
doaj   +1 more source

Machine Learning‐Enabled Polymer Discovery for Enhanced Pulmonary siRNA Delivery

open access: yesAdvanced Functional Materials, EarlyView.
This study provides an efficient approach to train a machine learning model by merging heterogeneous literature data to predict suitable polymers for siRNA delivery. Without the need for extensive laboratory synthesis, the machine learning enabled a virtual screening and successfully predicted a polymer that is validated for effective gene silencing in
Felix Sieber‐Schäfer   +10 more
wiley   +1 more source

Optimal entanglement distribution within a multi-ring topology

open access: yesScientific Reports
Entanglement distribution networks are essential for enabling secure, reliable, and sustained communication through the future Quantum Internet. Multi-ring network topologies offer improved scalability and redundancy, but also introduce additional ...
B. C. Ciobanu   +4 more
doaj   +1 more source

Efficient Data Gathering Methods in Wireless Sensor Networks Using GBTR Matrix Completion

open access: yesSensors, 2016
To obtain efficient data gathering methods for wireless sensor networks (WSNs), a novel graph based transform regularized (GBTR) matrix completion algorithm is proposed.
Donghao Wang   +4 more
doaj   +1 more source

An extended analysis of approximation algorithms for k-median problems on complex networks

open access: yesApplied Network Science
Abstract Finding the k-median in a network involves identifying a subset of k vertices that minimize the total distance to all other vertices in a graph. This problem has been extensively studied in computer science, graph theory, operations research, and numerous areas due to its significance in a wide range of applications.
openaire   +2 more sources

Home - About - Disclaimer - Privacy