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

2nd International Conference on Intelligent Systems Design and Engineering Applications, ISDEA 2012

作者： Mao, Jianhui Chen, Liqian National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769546087

Cyber-Physical Systems (CPS) involve deep interactions between computation cores, communication networks, and physical environments. These systems are inherently complex and highly nondeterministic. This makes the traditional formal verification technology impractical to verify the complete system behavior, and testing alone is insufficient to guarantee correctness. Runtime monitoring, known as a lightweight verification technique, provides a practical way to monitor and verify such systems at runtime. In this paper, we present a case study for runtime monitoring of the Cooperative Adaptive Cruise Control systems (CACC) in automobile CPS systems. We build a hybrid automaton-based model for the CACC system using the CHARON modeling language and construct an event-based runtime monitoring framework. The synthesized monitor observes the running of CACC and checks whether it works correctly against the temporal logic safety specification. Experimental results obtained through this case study provide evidence for the efficacy of runtime monitoring of CPS systems. © 2012 IEEE.

关键词： Cyber Physical System

来源：评论

学校读者我要写书评

暂无评论

Transfer learning for deep neural network-based partial differential equations solving

引用

Advances in Aerodynamics 2021年第1期3卷 635-648页

作者： Xinhai Chen Chunye Gong Qian Wan Liang Deng Yunbo Wan Yang Liu Bo Chen Jie Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense TechnologyChangshaChina China Aerodynamics Research and Development Center MianyangChina.

Deep neural networks(DNNs)have recently shown great potential in solving partial differential equations(PDEs).The success of neural network-based surrogate models is attributed to their ability to learn a rich set of solution-related ***,learning DNNs usually involves tedious training iterations to converge and requires a very large number of training data,which hinders the application of these models to complex physical *** address this problem,we propose to apply the transfer learning approach to DNN-based PDE solving *** our work,we create pairs of transfer experiments on Helmholtz and Navier-Stokes equations by constructing subtasks with different source terms and Reynolds *** also conduct a series of experiments to investigate the degree of generality of the features between different *** results demonstrate that despite differences in underlying PDE systems,the transfer methodology can lead to a significant improvement in the accuracy of the predicted solutions and achieve a maximum performance boost of 97.3%on widely used surrogate models.

关键词： Deep neural network Partial differential equation Surrogate model Transfer learning

来源：评论

学校读者我要写书评

暂无评论

A Compact Model for Multi-Island Single Electron Transistors

A Compact Model for Multi-Island Single Electron Transistors

引用

3rd IEEE International NanoElectronics Conference (INEC)/Symposium on Nanoscience and Nanotechnology in China

作者： Chi, Yaqing Zhong, Haiqin Zhang, Chao Fang, Liang National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Hunan 410073 China

ISBN: (纸本)9781424435449

Multi-island single electron transistor is an important kind of the single electron transistor, which is convenient to realize the controllable room temperature operation. A novel semi-empirical compact model for the Multi-island single electron transistor is proposed. The new approach combines the orthodox theory of the single electron tunneling through single coulomb island and a novel empirical analysis procedure for the chain of multi coulomb islands to solve the current of the whole multi-island single electron transistor. The tunneling rates are calculated based on the orthodox theory for the single electron tunneling. The tunneling currents representing the first splitted peaks in the coulomb oscillation curves are calculated according to the assumption that the currents through all the coulomb islands are equal to each other at the stable states, while the currents representing the other splitted peaks are constructed and merged together according to the empirical analysis. The model is verified by the traditional SET simulator SIMON and shows much faster calculation speed than SIMON. Therefore, the novel compact model is suitable for the large scale MISET circuit simulation.

关键词： Single Electron Transistor Coulomb Island Coulomb Oscillation Splitted Peak

来源：评论

学校读者我要写书评

暂无评论

An Efficient Identity-Based Key Agreement Protocol in a Multiple PKG Environment

引用

Wuhan University Journal of Natural Sciences 2014年第5期19卷 455-460页

作者： ZHOU Huan WANG Xiaofeng SU Jinshu School of Computer National University of Defense Technology National Laboratory for Parallel and Distributed Processing National University of Defense Technology

Identity-based key agreement protocol affords a natural way to combine the participant＇s identity with its public key. However, most of them just consider the key agreement in a single private key generator （PKG） environment. In addition, the existing key agreement protocols have a great computing overhead for mobile computing which is more and more popular today. This paper proposes a new identity based key agreement protocol. With the help of mathematical tools, we make our protocol applied in multiple PKG environment. It also satisfies all the security properties which is set for key agreement protocol. Moreover, some of its time-consuming operations can be delivered to untrusted public computation resources, so its computing complexity can be greatly reduced.

关键词： key agreement identity based public computation multiple PKG environment

来源：评论

学校读者我要写书评

暂无评论

A logistic regression model for Semantic Web service matchmaking

引用

Science China(Information Sciences) 2012年第7期55卷 1715-1720页

作者： WEI DengPing 1 ,WANG Ting 1 & WANG Ji 2 1 School of Computer,National University of Defense Technology,Changsha 410073,China 2 National laboratory for parallel and distributed processing,Changsha 410073,China 1. School of Computer National University of Defense Technology Changsha 410073 China2. National Laboratory for Parallel and Distributed Processing Changsha 410073 China

Semantic Web service matchmaking,as one of the most challenging problems in Semantic Web services (SWS),aims to filter and rank a set of services with respect to a service query by using a certain matching *** this paper,we propose a logistic regression based method to aggregate several matching strategies instead of a fixed integration (e.g.,the weighted sum) for SWS *** logistic regression model is trained on training data derived from binary relevance assessments of existing test collections,and then used to predict the probability of relevance between a new pair of query and service according to their matching values obtained from various matching *** are then ranked according to the probabilities of relevance with respect to each *** method is evaluated on two main test collections,SAWSDL-TC2 and Jena Geography Dataset(JGD).Experimental results show that the logistic regression model can effectively predict the relevance between a query and a service,and hence can improve the effectiveness of service matchmaking.

关键词： Semantic Web service matchmaking logistic regression

来源：评论

学校读者我要写书评

暂无评论

A scalable architecture for supporting interactive games on the internet 16

A scalable architecture for supporting interactive games on ...

引用

16th Workshop on parallel and distributed Simulation, PADS 2002

作者： Cai, Wentong Xavier, P. Turner, S.J. Lee, Bu-Sung Parallel and Distributed Processing Laboratory School of Computer Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)0769516084

This paper presents a scalable architecture for supporting large-scale interactive Internet games. In order to support a large number of participants and to divide the workload, the virtual world is divided into partitions. Each partition is then assigned to a server. A client (i.e., a player or a participant) will join a server according to the position of the avatar it controls. Compared to a centralized architecture, this distributed client-server architecture is more scalable. In addition, compared to a fully distributed, peer-to-peer architecture, it also provides a means for detecting cheating in distributed games. Since interactions and accounting information must be forwarded directly to one of the servers for qualification and verification, cheating amongst distributed players of the game will be minimized. To support secured communication for interactions and accounting information as well as to speedup periodic update messages (e.g., position updates), a hybrid communication scheme using both TCP and IP multicast is used between clients and the associated server. The communication among servers is enabled by the Run-Time Infrastructure (RTI) services. The High Level Architecture (HLA) Data Distribution Management (DDM) is employed to limit the amount of communication between the servers. In addition, the Ownership Management (OM) is also employed to implement the need for transferring the avatars between servers. In this paper, the design detail of the architecture will be presented. An experimental interactive Internet game realized using the architecture will be also described in the paper. © 2002 IEEE.

关键词： distributed Client-Server Architecture High Level Architecture (HLA) Large-scale Interactiv eGames Ownership and Data Distribution Management Run-Time Infrastructure (RTI) Scalability

来源：评论

学校读者我要写书评

暂无评论

Adaptive Linearized Alternating Direction Method of Multipliers for Non-Convex Compositely Regularized Optimization Problems

引用

Tsinghua Science and Technology 2017年第3期22卷 328-341页

作者： Linbo Qiao Bofeng Zhang Xicheng Lu Jinshu Su College of Computer National University of Defense Technologyand National Laboratory for Parallel and Distributed ProcessingNational University of Defense TechnologyChangsha 410073China College of Computer National University of Defense TechnologyChangsha 410073China

We consider a wide range of non-convex regularized minimization problems, where the non-convex regularization term is composite with a linear function engaged in sparse learning. Recent theoretical investigations have demonstrated their superiority over their convex counterparts. The computational challenge lies in the fact that the proximal mapping associated with non-convex regularization is not easily obtained due to the imposed linear composition. Fortunately, the problem structure allows one to introduce an auxiliary variable and reformulate it as an optimization problem with linear constraints, which can be solved using the Linearized Alternating Direction Method of Multipliers （LADMM）. Despite the success of LADMM in practice, it remains unknown whether LADMM is convergent in solving such non-convex compositely regularized optimizations. In this research, we first present a detailed convergence analysis of the LADMM algorithm for solving a non-convex compositely regularized optimization problem with a large class of non-convex penalties. Furthermore, we propose an Adaptive LADMM （AdaLADMM） algorithm with a line-search criterion. Experimental results on different genres of datasets validate the efficacy of the proposed algorithm.

关键词： adaptive linearized alternating direction method of multipliers non-convex compositely regularizedoptimization cappled-ll regularized logistic regression

来源：评论

学校读者我要写书评

暂无评论

Applying active measurement in the rate adaptation for 802.11 wireless networks 4

Applying active measurement in the rate adaptation for 802.1...

引用

4th Annual International Conference on Wireless Internet, WICON 2008

作者： Lv, Shaohe Wang, Xiaodong Zhou, Xingming National Laboratory of Parallel and Distributed Processing National University of Defense Technology ChangSha Hunan410073 China

Rate Adaptation (RA) is a mechanism to choose transmission rate based on the dynamic channel quality in wireless networks. The adaptation algorithm run solely at the sender side in 802.11 networks is studied. The key insight is the inference discrepancy in inferring the relative order of the expected performance of candidate rate, which argues that one can not always reach the correct order based on the channel state information collected exclusively by the sender itself. The consequence is wrong rate decision and significant performance loss. Therefore, a new RA structure is proposed to mitigate such effect by a novel component, rate testing. By embracing the active measurement, a lightweight and effective testing mechanism SFB, short frame burst, is proposed to detect and filter out the unsuitable transmission rate. Finally, an active measurement-based rate adaptation mechanism (AMRA) is designed and implemented. The experiments show that AMRA outperforms many other well-known RA solutions in most scenarios. Copyright © 2008 ICST.

关键词： Channel state information

来源：评论

学校读者我要写书评

暂无评论

Data storage optimization of application-level checkpointing on heterogeneous systems

Data storage optimization of application-level checkpointing...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Jia, Jia Song, Wei National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781479916603

General purpose GPU's (GPGPU) appearance made it possible that heterogeneous computing can be used by human beings. And it's also produce a reform for GPU's general purpose computing and parallel computing. Heterogeneous Systems has been adopted by large-scale of high-performance computers. Nowadays, fault tolerance technique is necessary among these large-scale kinds of scientific computing, but in a few years of GPGPU and heterogeneous system appearance, there is not an effective fault tolerance method come out, therefore, towards this situation, this paper will apply the traditional fault tolerance technique - application-level checkpointing to heterogeneous system. Cause the main solution of reducing overhead of the application-level checkpointing is reducing checkpoint data size, so after analyzing the heterogeneous system and GPGPU program, we propose a method to optimize the data storage of application-level checkpointing technique and validate its optimization by experiments. © 2013 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Global EDF-based online, energy-efficient real-time scheduling in multi-core platform

Global EDF-based online, energy-efficient real-time scheduli...

引用

IEEE International Conference on Computer Science and Automation Engineering

作者： Zhang, Dongsong Chen, Fangyuan Jin, Shiyao National Laboratory of Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781424487257

As the energy consumption becomes increasingly prominent, how to meet time constraints while reducing the energy consumption as much as possible is a fundamental problem of the real-time scheduling in multi-core systems. Most of the existing energy-efficient scheduling approaches make assumptions on the properties of the scheduled tasks. In general, the properties of a task are unknown in advance until the task arrives. Thus, these approaches for deterministic tasks are not suitable to the general tasks. To schedule general tasks without prior knowledge of their properties, we propose an online and energy-efficient scheduling algorithm, based on Global Earliest Deadline First, for hard real-time tasks in multi-core processor platform. We propose a novel approach to decrease the execution frequency of tasks, and achieve a reasonable compromise between the time constraint and saved energy. This is ensured by utilizing the slack time of tasks and the dynamic voltage/frequency scaling techniques. The evaluation results show that our algorithm is well applied to the two types of dynamic voltage/frequency scaling techniques, and out-performs the Global EDF algorithm in terms of the saved energy. Specifically, our algorithm improves the saved energy of the Global EDF algorithm by at most 10% to 15% under real discrete dynamic voltage/frequency scaling levels. © 2011 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：