دانلود و نمایش مقالات مرتبط با Transition::صفحه 1
بلافاصله پس از پرداخت دانلود کنید

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - Transition

تعداد مقالات یافته شده: 339
ردیف عنوان نوع
1 Deep Reinforcement Learning With Quantum-Inspired Experience Replay
یادگیری تقویتی عمیق با تکرار تجربه کوانتومی-2022
In this article, a novel training paradigm inspired by quantum computation is proposed for deep reinforcement learning (DRL) with experience replay. In contrast to the traditional experience replay mechanism in DRL, the proposed DRL with quantum-inspired experience replay (DRL-QER) adaptively chooses experiences from the replay buffer according to the complexity and the replayed times of each experience (also called transition), to achieve a balance between exploration and exploitation. In DRL-QER, transitions are first formulated in quantum representations and then the preparation operation and depreciation operation are performed on the transitions. In this process, the preparation operation reflects the relationship between the temporal-difference errors (TD-errors) and the importance of the experiences, while the depreciation operation is taken into account to ensure the diversity of the transitions. The experimental results on Atari 2600 games show that DRL-QER outperforms state-of-the-art algorithms, such as DRL-PER and DCRL on most of these games with improved training efficiency and is also applicable to such memory-based DRL approaches as double network and dueling network.
Index Terms: Deep reinforcement learning (DRL) | quantum computation | quantum-inspired experience replay (QER) | quantum reinforcement learning.
مقاله انگلیسی
2 Evolution of Quantum Computing: Theoretical and Innovation Management Implications for Emerging Quantum Industry
تکامل محاسبات کوانتومی: مفاهیم مدیریت نظری و نوآوری برای صنعت کوانتومی در حال ظهور-2022
Quantum computing is a vital research field in science and technology. One of the fundamental questions hardly known is how quantum computing research is developing to support scientific advances and the evolution of path-breaking technologies for economic, industrial, and social change. This study confronts the question here by applying methods of computational scientometrics for publication analyses to explain the structure and evolution of quantum computing research and technologies over a 30-year period. Results reveal that the evolution of quantum computing from 1990 to 2020 has a considerable average increase of connectivity in the network (growth of degree centrality measure), a moderate increase of the average influence of nodes on the flow between nodes (little growth of betweenness centrality measure), and a little reduction of the easiest access of each node to all other nodes (closeness centrality measure). This evolutionary dynamics is due to the increase in size and complexity of the network in quantum computing research over time. This study also suggests that the network of quantum computing has a transition from hardware to software research that supports accelerated evolution of technological pathways in quantum image processing, quantum machine learning, and quantum sensors. Theoretical implications of this study show the morphological evolution of the network in quantum computing from a symmetric to an asymmetric shape driven by new inter-related research fields and emerging technological trajectories. Findings here suggest best practices of innovation management based on R&D investments in new technological directions of quantum computing having a high potential for growth and impact in science and markets.
Index Terms: Innovation management | quantum algorithms | quantum computing (QC) | quantum network | technological change | technological paradigm | technological trajectories.
مقاله انگلیسی
3 High-Stability Cryogenic System for Quantum Computing With Compact Packaged Ion Traps
سیستم برودتی با پایداری بالا برای محاسبات کوانتومی با تله های یونی بسته بندی شده فشرده-2022
Cryogenic environments benefit ion trapping experiments by offering lower motional heating rates, collision energies, and an ultrahigh vacuum (UHV) environment for maintaining long ion chains for extended periods of time. Mechanical vibrations caused by compressors in closed-cycle cryostats can introduce relative motion between the ion and the wavefronts of lasers used to manipulate the ions. Here, we present a novel ion trapping system where a commercial low-vibration closed-cycle cryostat is used in a custom monolithic enclosure. We measure mechanical vibrations of the sample stage using an optical interferometer, and observe a root-mean-square relative displacement of 2.4 nm and a peak-to-peak displacement of 17 nm between free-space beams and the trapping location. We packaged a surface ion trap in a cryopackage assembly that enables easy handling while creating a UHV environment for the ions. The trap cryopackage contains activated carbon getter material for enhanced sorption pumping near the trapping location, and source material for ablation loading. Using 171Yb+ as our ion, we estimate the operating pressure of the trap as a function of package temperature using phase transitions of zig-zag ion chains as a probe. We measured the radial mode heating rate of a single ion to be 13 quanta/s on average. The Ramsey coherence measurements yield 330-ms coherence time for counter-propagating Raman carrier transitions using a 355-nm mode-locked pulse laser, demonstrating the high optical stability.
INDEX TERMS: Optomechanical design | quantum computing | trapped ions.
مقاله انگلیسی
4 Measurement-Induced Boolean Dynamics for Open Quantum Networks
دینامیک بولی ناشی از اندازه گیری برای شبکه های کوانتومی باز-2022
In this paper, we study the recursion corresponding to the measurement outcomes for open quantum networks under sequential measurements. Open quantum networks are networked quantum subsystems (e.g., qubits) with the state evolutions described by a continuous Lindblad master equation. When measurements are performed sequentially along such continuous dynamics, the quantum network states undergo probabilistic jumps and the corresponding measurement outcomes can be described by a vector of probabilistic Boolean variables. The induced recursion of the Boolean vectors forms a probabilistic Boolean network. First of all, we show that the state transition of the induced Boolean network can be explicitly represented through a real version of the master equation. Next, when the open quantum dynamics are relaxing in the sense that they possess a unique equilibrium as a global attractor, structural properties including absorbing states, reducibility, and periodicity for the induced Boolean network are direct consequences of this relaxing property. Particularly, we show that generically, relaxing quantum dynamics lead to irreducible and aperiodic chains for the measurement outcomes. Finally, we show that for quantum consensus networks which are a type of non-relaxing open quantum network dynamics, the communication classes of the measurement-induced Boolean networks are encoded in the quantum Laplacian of the underlying interaction graph.
Index Terms: quantum networks | open quantum systems | quantum measurements | Boolean networks
مقاله انگلیسی
5 Annealing-based Quantum Computing for Combinatorial Optimal Power Flow
محاسبات کوانتومی مبتنی بر بازپخت برای جریان قدرت بهینه ترکیبی-2022
This paper proposes the use of annealing-based quantum computing for solving combinatorial optimal power flow problems. Quantum annealers provide a physical com- puting platform which utilises quantum phase transitions to solve specific classes of combinatorial problems. These devices have seen rapid increases in scale and performance, and are now approaching the point where they could be valuable for industrial applications. This paper shows how an optimal power flow problem incorporating linear multiphase network modelling, discrete sources of energy flexibility, renewable generation place- ment/sizing and network upgrade decisions can be formulated as a quadratic unconstrained binary optimisation problem, which can be solved by quantum annealing. Case studies with these components integrated with the ieee European Low Voltage Test Feeder are implemented using D-Wave Systems’ 5,760 qubit Advantage quantum processing unit and hybrid quantum- classical solver.
Index Terms— Distribution Network | D-Wave | Electric Vehicle | Optimal Power Flow | Power System Planning | Quantum Annealing | Quantum Computing | Smart Charging.
مقاله انگلیسی
6 An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters
یک مسیر تکاملی برای اینترنت کوانتومی با تکیه بر تکرارکننده های کلاسیک ایمن-2022
Until quantum repeaters become mature, quantum networks remain restricted either to limited areas of directly connected nodes or to nodes connected to a common node. We circumvent this limitation by conceiving quantum networks using secure classical repeaters combined with the quantum secure direct communication (QSDC) principle, which is a compelling form of quantum communication that directly transmits information over a quantum channel. The final component of this promising solution is our classical quantum-resistant algorithm. Explicitly, in these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes, where it is read out by one node and then transmitted to the next node. At the repeaters, the information is protected by our quantum-resistant algorithm, which is secure even in the face of a quantum computer. Hence, our solution offers secure end-to-end communication across the entire network, since it is capable of both eavesdropping detection and prevention in the emerging quantum Internet. It is compatible with operational networks, and will enjoy the compelling services of the popular Internet, including authentication. Hence, it smoothens the transition from the classical Internet to the quantum Internet (Qinternet) by following a gradual evolutionary upgrade. It will act as an alternative network in quantum computing networks in the future. We have presented the first experimental demonstration of a secure classical-repeater-based hybrid quantum network constructed by a serial concatenation of an optical fiber and freespace communication link. In conclusion, secure repeater networks may indeed be constructed using existing technology and continue to support a seamless evolutionary pathway to the future Qinternet of quantum computers.
مقاله انگلیسی
7 An R-Convolution Graph Kernel Based on Fast Discrete-Time Quantum Walk
یک هسته گراف R-Convolution بر اساس راه رفتن کوانتومی سریع زمان گسسته -2022
In this article, a novel R-convolution kernel, named the fast quantum walk kernel (FQWK), is proposed for unattributed graphs. In FQWK, the similarity of the neighborhood-pair substructure between two nodes is measured via the superposition amplitude of quantum walks between those nodes. The quantum interference in this kind of local substructures provides more information on the substructures so that FQWK can capture finer-grained local structural features of graphs. In addition, to efficiently compute the transition amplitudes of multistep discrete-time quantum walks, a fast recursive method is designed. Thus, compared with all the existing kernels based on the quantum walk, FQWK has the highest computation speed. Extensive experiments demonstrate that FQWK outperforms state-of-the-art graph kernels in terms of classification accuracy for unattributed graphs. Meanwhile, it can be applied to distinguish a larger family of graphs, including cospectral graphs, regular graphs, and even strong regular graphs, which are not distinguishable by classical walk-based methods.
Index Terms: Discrete-time quantum walk (DTQW) | graph classification | graph kernel | R-convolution kernel.
مقاله انگلیسی
8 Dfinder — An efficient differencing algorithm for incremental programming of constrained IoT devices
Dfinder - یک الگوریتم افتراق کارآمد برای برنامه‌ریزی تدریجی دستگاه‌های محدود شده اینترنت اشیاء-2022
Internet of Things (IoT) proliferation has been remarkably, interconnecting a vast number of devices for the support of complex data-driven applications in a variety of domains. The ability to remotely update these devices is of paramount importance, as it allows the integration of additional functionality into their firmware, the resolution of code errors, the fixing of security vulnerabilities, or even their complete re-purpose, without physically accessing them. Such Over-the-Air Programming (OTAP) solutions require the reduction of the required transmitted data during a network update, in order to minimize devices’ energy consumption due to the communication overhead.
In this paper, we present the design and evaluation of Dfinder, a differencing algorithm that operates at byte-level and is able to generate small patches based on delta encoding that makes feasible the transition from a current firmware version to a new one. The algorithm runs in ????(????????????????????) time and ????(????) space complexity, utilising enhanced suffix arrays and state-of-the-art construction techniques that enable the efficient detection of common segments between two firmware versions. Additionally, we propose an extension of the algorithm, which halves the storage requirements at the IoT device side (compared to other state-of-the-art approaches), so that devices with limited storage can also be efficiently re-programmed over-the-air. Moreover, we evaluate its performance, comparing it with other differencing algorithms, and by integrating it in a complete IoT OTAP system.
keywords: اینترنت اشیا | الگوریتم های افتراق | دلتا اسکریپت | به روز رسانی سیستم عامل | استفاده از حافظه | زمان اجرا | Internet of Things | Differencing algorithms | Delta script | Firmware update | Memory utilization | Execution time
مقاله انگلیسی
9 FANETs in Agriculture - A routing protocol survey
FANETs در کشاورزی - مرور پروتکل مسیریابی-2022
Breakthrough advances on communication technology, electronics and sensors have led to integrated commercialized products ready to be deployed in several domains. Agriculture is and has always been a domain that adopts state of the art technologies in time, in order to optimize productivity, cost, convenience, and environmental protection. The deployment of Unmanned Aerial Vehicles (UAVs) in agriculture constitutes a recent example. A timely topic in UAV deployment is the transition from a single UAV system to a multi-UAV system. Collaboration and coordination of multiple UAVs can build a system that far exceeds the capabilities of a single UAV. However, one of the most important design problems multi- UAV systems face is choosing the right routing protocol which is prerequisite for the co- operation and collaboration among UAVs. In this study, an extensive review of Flying Ad- hoc network (FANET) routing protocols is performed, where their different strategies and routing techniques are thoroughly described. A classification of UAV deployment in agri- culture is conducted resulting in six (6) different applications: Crop Scouting, Crop Survey- ing and Mapping, Crop Insurance, Cultivation Planning and Management, Application of Chemicals,and Geofencing. Finally, a theoretical analysis is performed that suggests which routing protocol can serve better each agriculture application, depending on the mobility models and the agricultural-specific application requirements.
keywords: کشاورزی هوشمند | کشاورزی دقیق | وسایل نقلیه هوایی بدون سرنشین (UAV) | شبکه های ادوک پرنده (FANET) | پروتکل های مسیریابی | مدل های تحرک | smart farming | precision agriculture | unmanned aerial vehicles (UAVs) | flying adhoc networks (FANETs) | routing protocols | mobility models
مقاله انگلیسی
10 The adoption of circular economy practices in supply chains – An assessment of European Multi-National Enterprises
The adoption of circular economy practices in supply chains – An assessment of European Multi-National Enterprises-2021
The European Commission Circular Economy Action Plan aims at fostering a society based on sustainable pro- duction and consumption. Within this context, industrial organisations are called to implement a wide set of practices to drive this transition: manufacturing easy-to-repair and sustainable products, adopting solutions aimed at extending product lifetime, and promoting remanufacturing and materials’ recycling. A major contribution is expected from Multi-National Enterprises (MNEs), as these organizations dominate the European economy and coordinate resource-intensive global supply networks. As such, this study assesses the Circular Economy-inspired initiatives promoted by the largest European MNEs. The content of sustainability reports is scrutinised, through a template analysis technique, in order to create a database of Circular Economy practices. Key findings include the degree of implementation, the level of involvement of supply chain partners, and the drivers behind the implementation of such practices. Furthermore, a conceptual framework is proposed, in order to describe the adoption of Circular Economy practices as a supply chain process. A theoretical discussion explores the role of institutional pressures and supply chain integration to shape the transition towards the adoption of Circular Economy practices in global supply chains.
Keywords: Circular economy | Fortune 500 | Sustainability | MNEs | Supply chain integration | Institutional theory
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 2506 :::::::: بازدید دیروز: 3097 :::::::: بازدید کل: 36773 :::::::: افراد آنلاین: 46