检索结果-内蒙古大学图书馆

CdS Nanocrystallines: Synthesis, Structure and Nonlinear Optical Properties

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yanchuk, Oleksandr Marchuk, Oleg V. Myronchuk, Galyna Moroz, Iryna A. Andrushchak, Nazariy Vyshnevskyi, Oleksii A. Kityk, Iwan V. Kityk, Andriy V. Ozga, Katarzyna Jedryka, Jaroslaw Wojciechowski, Artur Andrushchak, Anatoliy Department of Inorganic and Physical Chemistry Lesya Ukrainka Eastern European National University Lutsk Ukraine Department of Materials Science Lutsk National Technical University Lutsk Ukraine Department of Computer-Aided Design Systems Lviv Polytechnic National University Lviv Ukraine M.P.Semenenko Institute of Geochemistry Mineralogy and Ore Formation NAS of Ukraine Kyiv Ukraine Faculty of Electrical Engineering Czestochowa University of Technology Czestochowa Poland Department of Telecommunication Lviv Polytechnic National University Lviv Ukraine

We report the synthesis, structure and nonlinear optical properties of cadmium sulphide (CdS) nanocrystallines (NCs) synthesized electrochemically both with and without detergent ATLAS G3300. Relevant structural and morphological features are explored by X-ray diffraction and scanning electron microscopy (SEM) techniques. The efficiency of the second harmonic generation (SHG) appears to be strongly dependent on the energy density of the incident fundamental laser radiation and NC sizes. © 2022, CC BY.

关键词： Cadmium sulfide

Energy optimal set-points for coupled systems using their topology*

学校读者我要写书评

暂无评论

Energy optimal set-points for coupled systems using their to...

International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Gregor Thiele Rico Clauß Theresa Johanni Jörg Krüger Fraunhofer Institute for Production Systems and Design Technology Berlin Germany Faculty of Electrical Engineering and Computer Science Technical University of Berlin Germany Institute for Machine Tools and Factory Management Technical University of Berlin Germany

ISBN: (数字)9781728159539

ISBN: (纸本)9781728159546

Energy efficiency is an emerging topic for companies in the industrial sector. The optimization of existing machines by advanced control is increasingly approached. For interconnected systems, we present a general procedure to include topology knowledge in an automated set-point optimization routine. This paper demonstrates an exemplary algorithm, applied to a parallel connection of two chillers for test purposes.

关键词： Optimization Mathematical model Topology Hysteresis Data models Interconnected systems Information technology

Flow and elastic networks on the N-torus: Geometry, analysis, and computation

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Jafarpour, Saber Huang, Elizabeth Y. Smith, Kevin D. Bullo, Francesco Center for Control Dynamical Systems and Computation Departments of Mechanical Engineering and of Electrical and Computer Engineering University of California Santa Barbara

Networks with phase-valued nodal variables are central in modeling several important societal and physical systems, including power grids, biological systems, and coupled oscillator networks. One of the distinctive features of phase-valued networks is the existence of multiple operating conditions corresponding to critical points of an energy function or feasible flows of a balance equation. For a network with phase-valued states, it is not yet fully understood how many operating conditions exist, how to characterize them, and how to compute them efficiently. A deeper understanding of feasible operating conditions, including their dependence upon network structures, may lead to more reliable and efficient network systems. This paper introduces flow and elastic network problems on the n-torus and provides a rigorous and comprehensive framework for their study. Based on a monotonicity assumption, this framework localizes the solutions, bounds their number, and leads to an algorithm to compute them. Our analysis is based on a novel winding partition of the n-torus into winding cells, induced by Kirchhoff's angle law for undirected graphs. The winding partition has several useful properties, including notably that, each winding cell contains at most one solution. The proposed algorithm is based on a novel contraction mapping and is guaranteed to compute all solutions. Finally, we apply our results to numerically study the active power flow equations in several test cases and estimate power capacity and congestion of a power network. Copyright © 2019, The Authors. All rights reserved.

关键词： Winding

Privacy-preserving Intelligent Traffic Light Control

学校读者我要写书评

暂无评论

Privacy-preserving Intelligent Traffic Light Control

GLOBECOM 2020 - 2020 IEEE Global Communications Conference

作者： Zuobin Ying Shuanglong Cao Shengmin Xu Ximeng Liu Maode Ma School of Electrical&Electronic Engineering Nanyang Technological University Singapore School of Computer Science&Technology Anhui University Hefei China Information Systems Technology and Design Singapore University of Technology and Design Singapore College of Mathernatics&Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728182988

ISBN: (纸本)9781728182995

A new trend of using deep reinforcement learning for traffic light control has become a spotlight in the Intelligent Transportation System (ITS). Meanwhile, some promising accomplishments have also been made. However, the traditional intelligent traffic signal control system always collects and transmits vehicle information (e.g., vehicle location, speed, etc.) in the form of plaintext, which would result in the leakage of commuters' privacy. Privacy leaks cause unnecessary trouble for users. For example, the personal interests and health information of the commuter can be inferred based on the driving route of the vehicle, or receive harassment advertisements for surrounding services, etc. In this paper, we propose a privacy-preserving intelligent traffic light control (PTLC) system with Deep Q-network. To achieve practicality and confidentiality simultaneously, a series of secure and efficient interactive protocols is designed depending on additive secret sharing to perform the DQN. Moreover, the security of PTLC is testified, meanwhile, the system effectiveness, and the overall efficiency of PTLC is demonstrated through theoretical analysis and simulation experiments.

关键词： Privacy Additives Reinforcement learning Control systems Routing protocols Cryptography Task analysis

Advanced Software for User Interface, User Control, Data/Image Input, and Test Automation for Infrared Led Scene Projectors

学校读者我要写书评

暂无评论

Advanced Software for User Interface, User Control, Data/Ima...

IEEE Research and Applications of Photonics In Defense Conference (RAPID)

作者： Casey Campbell Peyman Barakhshan Aaron Landwehr Jeffrey Volz Fouad Kiamilev Department of Electrical and Computer Engineering University of Delaware Chip Design Systems DE USA

In order to adequately control, test, and analyze Infrared Scene Projectors (IRSP), a user interface needed to be developed to maximize user efficiency. The IRSP control interface was developed for high performance im... 详细信息

关键词： Light emitting diodes Chip scale packaging User interfaces Image processing Testing Superlattices

RAN slicing for massive IoT and bursty URLLC service multiplexing: Analysis and optimization

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Yang, Peng Xi, Xing Quek, Tony Q.S. Chen, Jingxuan Cao, Xianbin Wu, Dapeng The Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore The School of Electronic and Information Engineering Beihang University Beijing100083 China Ministry of Industry and Information Technology of China Beijing100083 China The Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States

Future wireless networks are envisioned to serve massive Internet of things (mIoT) via some radio access technologies, where the random access channel (RACH) procedure should be exploited for IoT devices to access the networks. However, the theoretical analysis of the RACH procedure for massive IoT devices is challenging. To address this challenge, we first correlate the RACH request of an IoT device with the status of its maintained queue and analyze the evolution of the queue status. Based on the analysis result, we then derive the closed-form expression of the random access (RA) success probability, which is a significant indicator characterizing the RACH procedure of the device. Besides, considering the agreement on converging different services onto a shared infrastructure, we investigate the RAN slicing for mIoT and bursty ultra-reliable and low latency communications (URLLC) service multiplexing. Specifically, we formulate the RAN slicing problem as an optimization one to maximize the total RA success probabilities of all IoT devices and provide URLLC services for URLLC devices in an energy-efficient way. A slice resource optimization (SRO) algorithm exploiting relaxation and approximation with provable tightness and error bound is then proposed to mitigate the optimization problem. Simulation results demonstrate that the proposed SRO algorithm can effectively implement the service multiplexing of mIoT and bursty URLLC traffic. Copyright © 2020, The Authors. All rights reserved.

关键词： Internet of things

Multicast eMBB and Bursty URLLC Service Multiplexing in a CoMP-Enabled RAN

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Yang, Peng Xi, Xing Fu, Yaru Quek, Tony Q.S. Cao, Xianbin Wu, Dapeng Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore School of Electronic and Information Engineering Beihang University Beijing100083 China Ministry of Industry and Information Technology of China Beijing100083 China Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States

—This paper is concerned with slicing a radio access network (RAN) for simultaneously serving two typical 5G and beyond use cases, i.e., enhanced mobile broadband (eMBB) and ultra-reliable and low latency communications (URLLC). Although many researches have been conducted to tackle this issue, few of them have considered the impact of bursty URLLC. The bursty characteristic of URLLC traffic may significantly increase the difficulty of RAN slicing on the aspect of ensuring a ultra-low packet blocking probability. To reduce the packet blocking probability, we re-visit the structure of physical resource blocks (PRBs) orchestrated for bursty URLLC traffic in the time-frequency plane based on our theoretical results. Meanwhile, we formulate the problem of slicing a RAN enabling coordinated multi-point (CoMP) transmissions for multicast eMBB and bursty URLLC service multiplexing as a multi-timescale optimization problem. The goal of this problem is to maximize multicast eMBB and bursty URLLC slice utilities, subject to physical resource constraints. To mitigate this thorny multi-timescale problem, we transform it into multiple single timescale problems by exploring the fundamental principle of a sample average approximation (SAA) technique. Next, an iterative algorithm with provable performance guarantees is developed to obtain solutions to these single timescale problems and aggregate the obtained solutions into those of the multi-timescale problem. We also design a prototype for the CoMP-enabled RAN slicing system incorporating with multicast eMBB and bursty URLLC traffic and compare the proposed iterative algorithm with the state-of-the-art algorithm to verify the effectiveness of the algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Multicasting

Mirrorlabs - creating accessible Digital Twins of robotic production environment with Mixed Reality

学校读者我要写书评

暂无评论

Mirrorlabs - creating accessible Digital Twins of robotic pr...

IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)

作者： Doris Aschenbrenner Jonas S.I. Rieder Daniëlle van Tol Joris van Dam Zoltan Rusak Jan Olaf Blech Mohammad Azangoo Salo Panu Karl Kruusamäe Houman Masnavi Igor Rybalskii Alvo Aabloo Marcelo Petry Gustavo Teixeira Bastian Thiede Paolo Pedrazzoli Andrea Ferrario Michele Foletti Matteo Confalonieri Daniele Bertaggia Thodoris Togias Sotiris Makris Industrial Design Engineering TU Delft Delft Netherlands Electrical Engineering and Automation Aalto University Espoo Finland Intelligent Materials and Systems Lab University Tartu Tartu Estonia CRIIS INESC TEC - Institute for Systems and Computer Engineering Technology and Science Porto Portugal TU Braunschweig Braunschweig Germany SUPSI Manno Switzerland LMS University of Patras Patras Greece

ISBN: (数字)9781728174631

ISBN: (纸本)9781728174648

How to visualize recorded production data in Virtual Reality? How to use state of the art Augmented Reality displays that can show robot data? This paper introduces an opensource ICT framework approach for combining Unity-based Mixed Reality applications with robotic production equipment using ROS Industrial. This publication gives details on the implementation and demonstrates the use as a data analysis tool in the context of scientific exchange within the area of Mixed Reality enabled human-robot co-production.

关键词： Robots Service robots Robot sensing systems Production Mixed reality Hardware Software

Improved List-Decodability of Reed-Solomon Codes via Tree Packings

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Guo, Zeyu Li, Ray Shangguan, Chong Tamo, Itzhak Wootters, Mary Department of Computer Science UT Austin United States Department of Computer Science Stanford University United States Research Center for Mathematics and Interdisciplinary Sciences Shandong University Qingdao266237 China Frontiers Science Center for Nonlinear Expectations Ministry of Education Qingdao266237 China Department of Electrical Engineering - Systems Tel Aviv University Departments of Computer Science and Electrical Engineering Stanford University United States

This paper shows that there exist Reed–Solomon (RS) codes, over exponentially large finite fields in the code length, that are combinatorially list-decodable well beyond the Johnson radius, in fact almost achieving the list-decoding capacity. In particular, we show that for any Ε ∈ (0, 1] there exist RS codes with rate Ω(log(1Ε/Ε)+1 ) that are list-decodable from radius of 1 − Ε. We generalize this result to list-recovery, showing that there exist (1 − Ε, , O(/Ε))-list-recoverable RS codes with rate Ω (formula presented) . Along the way we use our techniques to give a new proof of a result of Blackburn on optimal linear perfect hash matrices, and strengthen it to obtain a construction of strongly perfect hash matrices. To derive the results in this paper we show a surprising connection of the above problems to graph theory, and in particular to the tree packing theorem of Nash-Williams and Tutte. We also state a new conjecture that generalizes the tree-packing theorem to hypergraphs, and show that if this conjecture holds, then there would exist RS codes that are optimally (non-asymptotically) list-decodable. Copyright © 2020, The Authors. All rights reserved.

关键词： Reed-Solomon codes