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

Proceedings of the 30th Annual international conference on Computer Science and Software Engineering

作者： Mehdi Bozzo-Rey Robert Loredo Hausi A. Müller Ulrike Stege Cambridge Quantum Computing Ltd. Toronto Ontario Canada IBM Quantum University of Victoria Victoria British Columbia Canada

Quantum computing has evolved from a field of scientific research to a quantum technology industry. Much progress is still needed to solve real-world problems with quantum technology and achieve quantum advantage. Industries, governments, and universities are experimenting with advanced quantum computing technologies to become quantum ready. One way forward is to combine quantum and classical approaches to form hybrid models, algorithms, and architectures to overcome the limitations of NISQ systems for near-term quantum computations. CASCON 2020 features a 2-day quantum computing workshop. this workshop discusses synergies and challenges in workforce training and opportunities in quantum computing applications featuring speakers from IBM, start-up companies, and academic research programs. the key goal of this workshop is to discuss synergies and opportunities in quantum computing along three dimensions:• Existing and emerging quantum ecosystems across Canada• Hybrid quantum-classical problem-solving and applications• Vibrant quantum start-up companies

关键词： engagement education IBM Quantum training quantum start-ups quantum computing qiskit cryptography programming machine learning computing with nature chemistry hybrid computing applications finance algorithms

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Analysis of Network Availability

Probabilistic Analysis of Network Availability

引用

international conference on Network Protocols

作者： Yunmo Zhang Hong Xu Chun Jason Xue Tei-Wei Kuo Department of Computer Science City University of Hong Kong Department of Computer Science and Engineering Chinese University of Hong Kong Department of Computer Science and Information Engineering National Taiwan University

ISBN: (数字)9781665482349

ISBN: (纸本)9781665482356

In recent years, quantitative verification concerning network availability has received increasing attention due to its practical importance in network management. Existing work extends upon qualitative verification and tries to answer whether a network would have any link overload under failures and dynamic traffic. the simple yes-or-no question falls short of accurately characterizing the robustness of a network under uncertainties, which the operators are in dire need of. thus, we argue that it is necessary to design a probabilistic framework to analyze network availability comprehensively. We propose Pita, a novel network analysis framework that outputs the overall probability of the network being unavailable under a range of failure scenarios and traffic demands. We formalize the problem and show that it is #P-hard which does not admit deterministic approximation solutions. We further develop an improved randomized approximation that exploits the structural property of our problem to reduce the computational cost of the so-called boundary oracle procedure, a key bottleneck of the approximation, without any accuracy loss. Evaluation with real topologies shows that Pita provides up to 2.25x speedup over state-of-the-art solutions, and can be effectively used in many network management tasks such as identifying high-risk failure scenarios, and aiding robust traffic engineering design.

关键词： Uncertainty Protocols Statistical analysis Network analyzers Complex networks Probabilistic logic Robustness

来源：评论

学校读者我要写书评

暂无评论

Study on Architecture of Smart Home Management System and Key Devices

Study on Architecture of Smart Home Management System and Ke...

引用

international conference on Computer Science and Network Technology

作者： Chunlai Zhou Wenhui Huang Xiaoyun Zhao Commun. Univ. of China Beijing Beijing China

ISBN: (纸本)9781479905607

the architecture of smart home management system and key devices are studied according to the specifications on smart home gateway, socket and terminal issued by State power grid corp. in Nov. 30th, 2011, and smart home gateway, smart jack and smart terminal software are developed. Several communication technologies are used, including Zigbee, used to acquire data of wireless sensor network;TCP, used for video monitor;DALI, used to control lamps;Modbus, used to operate actuators, Wi-Fi, used between the terminal device and the gateway;as well as SOAP used for web services. the architecture and devices developed in this paper work well, and satisfy the needs of smart home management.

关键词： Web services Zigbee home automation home networks internetworking service-oriented architecture transport protocols wireless LAN wireless sensor networks DALI Modbus SOAP TCP WiFi communication technology control lamps key devices smart home gateway smart home management system smart jack smart terminal software state power grid corp video monitor wireless sensor network Computer architecture Lifting equipment logic gates Protocols Smart homes Wireless sensor networks Smart home WSN Wi-Fi architecture ZigBee Smart homes Wireless sensor networks Wi-Fi Web Service Soaps video monitoring Communication technology Building construction ARCHITECTURE granite pegmatite internetworking home automation Computer Architecture transport protocols

来源：评论

学校读者我要写书评

暂无评论

A green framework for energy efficient management in TDMA-based Wireless Mesh Networks 12

A green framework for energy efficient management in TDMA-ba...

引用

international conference on Network and Service Management

作者： Ahmed Amokrane Rami Langar Raouf Boutaba Guy Pujolle LIP 6 UPMC-University of Paris 6 Paris France School of Computer Science University of Waterloo Waterloo ONT Canada

ISBN: (纸本)9781450322102

Due to the increasing of energy consumption in Information and Communication Technology (ICT), green computing has recently drawn a lot of attention. However, the application of green networking to Wireless Mesh Networks (WMN) has seldom been reported in the literature. In this paper, we propose a new framework for energy management in TDMA-based WMNs to support energy efficient communications. Our proposed framework aims at finding an optimal tradeoff between the achieved network throughput and energy consumption. To do so, we use resource planning through green routing and link scheduling. Specifically, we first propose an Optimal approach, called O-GRLS, by formulating the problem as an integer linear program (ILP). As this problem is known to be NP-hard, we then propose a simple yet efficient Ant Colony-based approach, called AC-GRLS to solve the formulated ILP problem. through extensive simulations, we show that our green framework is able to achieve significant gains in terms of energy consumption as well as achieved network throughput, compared to the Shortest Path (SP) routing. Specifically, we show that the same performance as SP can be attained with minimum energy consumption. On the other hand, with the same energy cost, our proposed framework enhances the achieved throughput by up to 30% compared to SP routing.

关键词： throughput Routing logic gates Energy consumption Green products Interference Linear programming

来源：评论

学校读者我要写书评

暂无评论

CONST: Exploiting Spatial-Temporal Correlation for Multi-Gateway based Reliable LoRa Reception

CONST: Exploiting Spatial-Temporal Correlation for Multi-Gat...

引用

international conference on Network Protocols

作者： Zeyu Zhang Weiwei Chen Junwen Wang Shuai Wang Tian He Southeast University

ISBN: (数字)9781665482349

ISBN: (纸本)9781665482356

As a representative technology of low power wide area network, LoRa has been widely adopted to many applications. A fundamental question in LoRa is how to improve its reception quality in ultra-low SNR scenarios. Different from existing studies that exploit either spatial or temporal correlation for LoRa reception recovery, this paper jointly leverages the fine-grained spatial-temporal correlation among multiple gateways. We exploit the spatial and temporal correlation in LoRa packets to jointly process received signals so that the fine-grained offsets including Central Frequency Offset (CFO), Sampling Time Offset (STO) and Sampling Frequency Offset (SFO) are well compensated, and signals from multiple gateways are combined coherently. Moreover, a deep learning based soft decoding scheme is developed to integrate the energy distribution of each symbol into the decoder to further enhance the coding gain in a LoRa packet. We evaluate our work with commodity LoRa devices (i.e., Semtech SX1278) and gateways (i.e., USRP-B210) in both indoor and outdoor environments. Extensive experiment results show that our work achieves 4.6dB higher signal-to-noise ratio (SNR) and 1.5× lower bit error rate (BER) compared with existing approaches.

关键词： Wide area networks Time-frequency analysis Correlation Protocols Bit error rate Symbols logic gates

来源：评论

学校读者我要写书评

暂无评论

Centralized Network Utility Maximization with Accelerated Gradient Method

Centralized Network Utility Maximization with Accelerated Gr...

引用

international conference on Network Protocols

作者： Ying Tian Zhiliang Wang Xia Yin Xingang Shi Jiahai Yang Han Zhang Department of Computer Science and Technology BNRist Tsinghua University Beijing China Institute for Network Sciences and Cyberspace BNRist Tsinghua University Beijing China Zhongguancun Lab Beijing China

ISBN: (数字)9781665482349

ISBN: (纸本)9781665482356

Network utility maximization (NUM) is a well-studied problem for network traffic management and resource allocation. Because of the inherent decentralization and complexity of networks, most researches develop decentralized NUM algorithms. In recent years, the Software Defined Networking (SDN) architecture has been widely used, especially in cloud networks and inter-datacenter networks managed by large enterprises, promoting the design of centralized NUM algorithms. To cope with the large and increasing number of flows in such SDN networks, existing researches about centralized NUM focus on the scalability of the algorithm with respect to the number of flows, however the efficiency is ignored. In this paper, we focus on the SDN scenario, and derive a centralized, efficient and scalable algorithm for the NUM problem. By the designing of a smooth utility function and a smooth penalty function, we formulate the NUM problem with a smooth objective function, which enables the use of Nesterov's accelerated gradient method. We prove that the proposed method has $O(d/t^{2})$ convergence rate, which is the fastest with respect to the number of iterations $t$ , and our method is scalable with respect to the number of flows $d$ in the network. Experiments show that our method obtains accurate solutions with less iterations, and achieves close-to-optimal network utility.

关键词： Gradient methods Protocols Scalability Software algorithms Telecommunication traffic Linear programming Complexity theory

来源：评论

学校读者我要写书评

暂无评论

INT-Segment: MTU-Adaptive Single-Path In-Band Network-Wide Telemetry

INT-Segment: MTU-Adaptive Single-Path In-Band Network-Wide T...

引用

international conference on Network Protocols

作者： Qianchen Yuan Fuliang Li Tian Pan Yuhua Lai Yetao Gu Xingwei Wang Northeastern University Shenyang China Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9781665482349

ISBN: (纸本)9781665482356

In-band network telemetry (INT) enables hop-by-hop fine-grained network monitoring without interacting with the controller at every hop. Existing INT-based network-wide telemetry systems achieve low-overhead monitoring with the non-overlapped path planning algorithms. However, they do not bound the length of the generated probing paths, which may lead to packet loss when the collected telemetry data exceeds the MTU limit. In this paper, we propose an MTU-adaptive path segmentation algorithm to solve this problem. First, we provide two single-path planning algorithms: the INT-optimize algorithm produces a single path that covers the entire network with the lowest southbound communication overhead, and the INT-low-cost algorithm further improves the path planning efficiency of the INT-optimize. By taking the MTU limit into account, we further propose INT-Segment, a novel path segmentation algorithm to split the single long path produced from the previous step into multiple path segments. Extensive evaluations show that the proposed INT-Segment can realize sub-second network-wide telemetry for large-scale networks. It takes less than 2.9ms to calculate the probing paths for an 18-pod FatTree. Compared with the state-of-the-art INT-path, our solution makes the probing path well adapted to the network MTU limit and improves the telemetry efficiency by 10%-94%.

关键词： Data centers Protocols Packet loss Data collection Path planning Planning Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Framework for a Decentralized Web

Framework for a Decentralized Web

引用

Australasian Telecommunication Networks and Applications conference, ATNAC

作者： Raman Singh Andrew Donegan Hitesh Tewari School of Comp Sci & Stats Trinity College Dublin Dublin Ireland Thapar Institute of Engineering & Technology Patiala India

ISBN: (数字)9781728188270

ISBN: (纸本)9781728188287

Over the past decade, we have witnessed the Internet becoming increasingly centralized in the hands of a small number of giant technology firms, that control many of the most popular applications and the content they host on their platforms. In addition, in the majority of instances today, access to the Internet is usually provided through local internet service providers (ISPs) in each country. Governments in different jurisdictions can exert pressure on these technology firms and ISPs to enforce restrictions on Internet usage by their citizens, such as the blocking access to certain sites and/or content. In this paper, we present a promising new approach to circumventing some of these issues. Our decentralized web (DWeb) proposal makes use of a mesh network to connect community based routers. In addition, objects on the DWeb are indexed using blockchain technology, which allows for secure storage of immutable object references, and integrity checking of the data being served to users. Our DWeb design is also capable of operating during network partitions, and is able to quickly re-synchronize with the larger network once connectivity has been restored. the proposed concept is simulated using ns-3, Multichain and Docker technologies. the performance of the system is analysed for different cache replacement strategies with a varying number of gateway nodes. the Popularity-based cache replacement algorithm outperforms the other studied strategies, which show it is the best-suited strategy for the DWeb architecture. In summary, DWeb solves issues like data integrity, centralization and controlled access to the Internet, and the overall framework exhibits fair performance in the studied simulated environment.

关键词： Internet Blockchain logic gates Routing Routing protocols Mesh networks IP networks

来源：评论

学校读者我要写书评

暂无评论

Is LoRaWAN Really Wide? Fine-grained LoRa Link-level Measurement in An Urban Environment

Is LoRaWAN Really Wide? Fine-grained LoRa Link-level Measure...

引用

international conference on Network Protocols

作者： Yidong Ren Li Liu Chenning Li Zhichao Cao Shigang Chen Michigan State University University of Florida

ISBN: (数字)9781665482349

ISBN: (纸本)9781665482356

Internet-of-things (IoT) aims to connect billions of low-date rate and energy-constrained end-devices in the near future. Although many IoT systems have been commercialized, most of them focus on home and body scale applications. To establish a low-cost IoT at the city scale, LoRa Wide Area Networks (LoRaWAN) have become attractive in recent years due to their desirable kilometer or even longer communication distance with low energy consumption. However, due to the expensive cost of densely deploying end-nodes, the understanding of LoRa link behavior is still coarse-grained, and hard to fully realize the link dynamics, networking coverage, and localization accuracy of LoRaWAN in an urban environment. this paper shows a fine-grained LoRa link-level measurement via mobile end-nodes. We deploy two gateways and six mobile end-nodes and collect data packets over four months at a $6\times 6\ km^{2}$ urban area. the evaluation mainly focuses on answering three questions: 1) Does a LoRa link stably perform in both spatial and temporal dimensions? 2) How large area can be covered for reliable communication by each gateway in the urban environment? 3) What accuracy can be achieved to localize an end-node through LoRa links? According to our measurement, our key findings are 1) the spatial and temporal behavior of LoRa links is quite dynamic due to the different types of land covers and the frequent micro-environment changes in the urban areas; 2) Each gateway can cover about 11.3 km 2 area and marginal SNR gains (e.g., 2 dB) of LoRa links are efficient enough to enlarge 32.6% coverage area of a gateway; and 3). the median localization error is about 400 m. Without densely deployed LoRa gateways, the SOTA LoRa localization can support road-level localization, even when an end node is close to one of the gateways.

关键词： Location awareness Wide area networks Protocols Urban areas logic gates Gain measurement Behavioral sciences

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the XCSP3 Competition 2024

arXiv

引用

arXiv 2024年

作者： Audemard, Gilles Lecoutre, Christophe Lonca, Emmanuel Cherif, Mohamed Sami Habet, Djamal Jégou, Philippe Kanso, Hélène Terrioux, Cyril Prud’homme, Charles Guns, Tias Vanroose, Wout Sergeys, thomas Bleukx, Ignace Devriendt, Jo Tsouros, Dimos Verhaeghe, Hélène Lester, Martin Mariusz Soh, Takehide Le Berre, Daniel Nabeshima, Hidetomo Banbara, Mutsunori Tamura, Naoyuki Glorian, Gaël Zhou, Neng-Fa Cherif, Mohamed Sami Habet, Djamal Terrioux, Cyril Falque, thibault Wallon, Romain Allouche, David Beldjilali, Abdelkader Buchet, Samuel Defresne, Marianne Durante, Valentin de Givry, Simon Katsirelos, George Montalbano, Pierre Schiex, thomas Trösser, Fulya Zytnicki, Matthias CRIL University of Artois CNRS France Laboratoire MIS UR 4290 Université de Picardie Jules Verne Amiens France Aix Marseille Univ CNRS LIS Marseille France Effat University Jeddah Saudi Arabia LS2N IMT-Atlantique Nantes France Department of Computer Science KU Leuven Belgium Nonfiction Software Belgium Department of Computer Science University of Reading United Kingdom Kobe University Japan CRIL-CNRS Université d’Artois France University of Yamanashi Japan Nagoya University Japan France CUNY Brooklyn College Graduate Center United States University of Luxembourg Luxembourg CRIL Univ Artois CNRS France Université Fédérale de Toulouse ANITI INRAE UR 875 Toulouse31326 France

this document represents the proceedings of the 2024 XCSP3 Competition. the results of this competition of constraint solvers were presented at CP'24 (30th international conference on Principles and Practice of Co... 详细信息

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：