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

Completion time-a ware flow scheduling in heterogenous networks 1

15th International Conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： He, Shiming Xie, Kun Zhang, Dafang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Hunan Province Engineering Research Center of Electric Transportation and Smart Distributed Network Changsha University of Science and Technology Changsha410114 China College of Computer Science and Electronics Engineering Hunan University Changsha410082 China Department of Electrical and Computer Engineering State University of New York at Stony Brook NY United States

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

In China, the expressway isn’t free. When a vehicle exits, the exit toll station needs to calculate the toll according to the vehicle trajectory obtained by sending a trajectory query task to the trajectory center remotely. For the accurate of toll and keep the exit smoothly, transmitting the trajectory result reliably and in time is a key issue. There are three heterogenous networks in expressway, Fibernet, Telecommunications Network and 3G. We concurrently exploit three heterogenous networks by allocating the trajectory result into three sub-flows where each sub-flow is transmitted in one kind of networks. But existing multipath transfer solution(FMTCP) doesn’t consider the difference of completed time among all sub-flows and can’t make sure the completed time in time. Therefore, we formulate the sub-flows schedule as a integer programming problem, which is proved to be NP-hard problem, and propose a Completion time-aware Flow Scheduling scheme (CaFS) which calculates the size of sub-flows. For the reliably, it exploits generation-based network coding. For the transmission in time, CaFS allocates the size of sub-flow into suitable generation and scheduling the generations. The simulation results demonstrate that, comparing with the FMTCP, CaFS improves 31. 9% in completion time and 30% in task finished rate. © Springer International Publishing Switzerland 2015.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

A Unique Vertex Deleting Algorithm for Graph Isomorphism

A Unique Vertex Deleting Algorithm for Graph Isomorphism

引用

International Symposium on Image and Data Fusion (ISIDF)

作者： Baida Zhang Yuhua Tang Junjie Wu Linqi Huang National laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan P. R. China School of Resources and Safety Engineering Central South University Changsha P. R. China

Graph isomorphism problem has applications in many fields, such as chemistry, computer science, electronics, and network theory. But the exponential complexity of the algorithm makes the testing is time consuming. In this paper, a new algorithm named Unique Vertex Delete (UVD for short) is presented to speed up the process of isomorphic testing. The main idea of UVD algorithm is deleting vertex continuously to reduce the scale of the problem, and new field is added for each vertex to indicate the information of deleted neighbor vertices. Theoretical analysis and experiments show that the UVD algorithm consistently and significantly outperforms existing state-of-the-art approaches.

关键词： Algorithm design and analysis Testing Educational institutions Polynomials Software algorithms Complexity theory Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

TRANSDUCTIVE NONNEGATIVE MATRIX FACTORIZATION FOR SEMI-SUPERVISED HIGH-PERFORMANCE SPEECH SEPARATION

TRANSDUCTIVE NONNEGATIVE MATRIX FACTORIZATION FOR SEMI-SUPER...

引用

IEEE International Conference on Acoustics, Speech and Signal processing

作者： Naiyang Guan Long Lan Dacheng Tao Zhigang Luo Xuejun Yang Science and Technology on Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Changsha Hunan 410073 China Centre for Quantum Computation and Intelligent Systems FEIT University of Technology Sydney Sydney NSW 2007 Australia State Key Laboratory of High Performance Computing National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9781479928941

Regarding the non-negativity property of the magnitude spectrogram of speech signals, nonnegative matrix factorization (NMF) has obtained promising performance for speech separation by independently learning a dictionary on the speech signals of each known speaker. However, traditional NM-F fails to represent the mixture signals accurately because the dictionaries for speakers are learned in the absence of mixture signals. In this paper, we propose a new transductive NMF algorithm (TNMF) to jointly learn a dictionary on both speech signals of each speaker and the mixture signals to be separated. Since TNMF learns a more descriptive dictionary by encoding the mixture signals than that learned by NMF, it significantly boosts the separation performance. Experiments results on a popular TIMIT dataset show that the proposed TNMF-based methods outperform traditional NMF-based methods for separating the monophonic mixtures of speech signals of known speakers.

关键词： Speech Dictionaries as Topic Loudspeakers NMF protocol signals mixtures factorization HIGH-PERFORMANCE

来源：评论

学校读者我要写书评

暂无评论

Energy Management for Zones-Based Isolated DC Multi-microgrids 3rd

Energy Management for Zones-Based Isolated DC Multi-microgri...

引用

3rd EAI International Conference on Smart Grid and Internet of Things, SGIoT 2019

作者： Nawaz, Arshad Wu, Jing Long, Chengnian Lin, Yi Bing Department of Automation School of Electronic Information and Electrical Engineering Key Laboratory of System Control and Information Processing Ministry of China Shanghai Jiao Tong University Shanghai China Department of Computer Science and Information Engineering National Chiao Tung University Hsinchu300 Taiwan

ISBN: (纸本)9783030496098

In this paper, zones based distributed energy management for isolated multi-microgrids is proposed. Loads are categorized into different zones to form zonal multi-microgrids. Each microgrid has own energy management system which can locally manages the supply and demand of its zonal load and minimize the operational cost. distributed Network Operator (DNO) act as central controller to facilitate the energy exchange between zonal microgrids and balancing the overall system-wide supply and demand in economic way. Demand Response Program (DRP) is also utilized for peak load shifting within the scheduling horizon. In addition to minimization of operation cost, the utilization of DR will also assure the reliability of supply. In the proposed distributed energy management, each microgrid balances its supply and demand locally and exchange surplus and deficit power with other microgrids through DNO. The performance of proposed scheme is demonstrated through case study simulation of radial multi-microgrid structure. © 2020, ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Energy management

来源：评论

学校读者我要写书评

暂无评论

Optimization approaches of organizing streams on imagine processor

引用

Jisuanji Xuebao/Chinese Journal of computers 2008年第7期31卷 1092-1100页

作者： Yang, Xue-Jun Zeng, Li-Fang Deng, Yu Tang, Yu-Hua National Key Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Jiangnan Remote Sensing Institute Shanghai 200072 China

Due to the characteristics of stream applications and the insufficiency of conventional processors when running stream programs, stream processors which support data-level parallelism become the research hotspot. This paper presents two means, stream partition (SP) and stream compression (SC), to optimize streams on Imagine. The results of simulation show that SP and SC can make stream applications take full advantage of the parallel clusters, pipelines and three-level memory hierarchy of the Imagine processor, and then reduce the execution time of stream programs.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

VisionEmbedder: Bit-Level-Compact key-Value Storage with Constant Lookup, Rapid Updates, and Rare Failure

VisionEmbedder: Bit-Level-Compact Key-Value Storage with Con...

引用

International Conference on Data Engineering

作者： Yuhan Wu Feiyu Wang Yifan Zhu Zhuochen Fan Zhiting Xiong Tong Yang Bin Cui National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University Beijing China College of Computer National University of Defense Technology Changsha China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

In key-value storage scenarios where storage space is at a premium, our focus is on a class of solutions that only store the value, which is highly space-efficient. While these solutions have proven their worth in distributed storage, networking, and bioinformatics, they still face two significant issues: one is that their space cost could be further reduced; the other is their are vulnerable to update failures, which can necessitate a complete table reconstruction. To address these issues, we introduce VisionEmbedder, a compact key-value embedder with constant-time lookup, fast dynamic updates, and a near-zero risk of reconstruction. VisionEmbedder cuts down the storage requirement from 2.2L bits to just 1.6L bits per key-value pair with an L-bit value, and it significantly reduces the chance of update failures by a factor of n, where $n$ is the number of keys (for instance, 1 million or more). The compromise with VisionEmbedder comes with a minor reduction in query throughput on certain data sizes. The enhancements offered by VisionEmbedder have been theoretically validated and are effective across any dataset. Additionally, we have implemented VisionEmbedder on both FPGA and CPU platforms, with all codes made available as open-source.

关键词： Costs Codes Mathematical analysis Throughput Data engineering Bioinformatics Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Multi-replica clustering management method based on limited-coding

引用

Ruan Jian Xue Bao/Journal of Software 2007年第6期18卷 1456-1467页

作者： Zhou, Jing Wang, Yi-Jie Li, Si-Kun School of Computer National University of Defense Technology Changsha 410073 China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

In this paper, according to the resource management problems brought by a large number of replicas, a multi-replica clustering management method based on limited-coding is proposed. In this method, according to the process of creating new replicas from existent single replica, replicas are partitioned into different hierarchies and clusters. Then replicas are coded and managed based on the user-defined limited-coding rule consisting of replica hierarchy and replica sequence, which can also dispose the alteration of clusters caused by dynamic adjustments on replicas (replica addition or replica removal) effectively. After that, a management model of centralization in local and peer to peer in wide area is adopted to organize replicas, and the cost of reconciling consistency can be greatly depressed combining with defined minimal-time of update propagation. The relevance between the coding rule and the number of replicas, and the solutions to replica failure and replica recover are discussed. The results of the performance evaluation show that the clustering method is an efficient way to manage a large number of replicas, achieving good scalability, not sensitive to moderate node failure, and adapting well to applications with frequent updates.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

A review on the churn character of P2P networks

引用

Jisuanji Xuebao/Chinese Journal of computers 2011年第9期34卷 1563-1577页

作者： Fu, Zhi-Peng Wang, Huai-Min Shi, Dian-Xi Zou, Peng School of Computer Science National University of Defense Technology Changsha 410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

P2P application is one of the most popular applications in the Internet, but its performance is badly influenced by the churn character-the nodes continuous arrival and departure. On the basis of introducing the origin of the churn, the definition of it and its influences to the P2P system performance, we minutely describe the research on the statistical properties, and discover some dynamic law including nodes' session time generally obey the heavy-tailed distribution. Then we detail the measurement methods. For passive monitoring, active monitoring, sample and so on, we present the advantages and disadvantages of each method, and explain the corresponding improving method to enhance the accuracy of the measurement. After that we elaborate the resilience strategies to the churn. Towards the neighbor selection, failure recovery, replica maintenance, link lifetime maintenance and so on, we present also the advantage and disadvantage of each strategy, and present our view to each of aspects. Finally, the summary and prospect of the future research are given.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Mitigate the obstructing effect of vehicles on the propagation of VANETs safety-related information

Mitigate the obstructing effect of vehicles on the propagati...

引用

作者： Huang, Rui Wu, Jing Long, Chengnian Zhu, Yanmin Li, Bo Lin, Yi-Bing Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Department of Computer Science School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong China Department of Computer Science and Information Engineering National Chiao Tung University Taiwan

As physical obstacles, vehicles have significant impacts on the efficient propagations of safety-related information in vehicular ad hoc networks (VANETs) by frequently obstructing the LOS links between transmitters and receivers. Obstructing effect will diminish the effective coverage of safety-related information and incur severe impact on road safety. However, this impact has not been addressed effectively. In this paper, we first present the definition of broadcast efficiency as the metric for quantizing the obstructing effect. We investigate the optimization issue for mitigating the impact of obstructing effect on the propagation of safety-related information and propose a graph theory-based optimization algorithm. For a distributed implementation of this optimization in VANETs, we further propose the maximum broadcast efficiency relaying (MBER) algorithm. MBER maximizes the effective coverage of information, meanwhile, meets delay and reliability constraints by incorporating broadcast efficiency and propagation distance in relay contention. Simulation results demonstrate that MBER promotes the effective coverage of safety-related information in VANETs with varying vehicular distribution. © 1967-2012 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Simulation of Nuclear Reactor Accident Scenarios using Physics-Informed Neural Networks and Transfer-Learning 4

Simulation of Nuclear Reactor Accident Scenarios using Physi...

引用

4th International Conference on Electronic Information Engineering and computer science, EIECS 2024

作者： Yu, Yang Xie, Yufei Wang, Wenlin Wu, Guohua Lan, Haitao Lin, Enbo An, Ping Sun, Zibin Zhang, Haichuan Wu, Yixian National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing Changsha China Nuclear Power Institute of China Science and Technology on Reactor System Design Technology Laboratory Chengdu China School of Automation Wuhan University of Technology Wuhan China Sino-German College of Intelligent Manufacturing Shenzhen Technology University Shenzhen China Institute of Automotive Engineers Hubei University of Automotive Technology Shiyan China Nuclear Power Institute of China Chengdu China

ISBN: (纸本)9798331531409

In a Loss of Coolant Accident (LOCA), reactor core temperatures can rise rapidly, leading to potential fuel damage and radioactive material release. This research presents a groundbreaking method that combines the power of Monte Carlo Sampling and Physics-Informed Neural Networks (PINNs) to simulate and effectively address the challenging Loss of Coolant Accidents (LOCA) in nuclear reactors. In the event of a LOCA, reactor core temperatures can soar rapidly, posing a significant threat to fuel integrity and potentially leading to the release of radioactive materials. By leveraging the strengths of both Monte Carlo Sampling and PINNs, this approach aims to provide a comprehensive and accurate simulation framework for assessing and mitigating the consequences of such accidents. The method yields high prediction accuracy (MAE: 0.033, RMSE: 0.098, R2: 0.814) and demonstrates robustness through transfer learning, maintaining strong performance (MAE: 0.064, RMSE: 0.163, R2: 0.735). © 2024 IEEE.

关键词： Coolants

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：