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

Communications and Network 2012年第1期4卷 18-29页

作者： Nasreen Khan Madhumangal Pal Anita Pal Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore India.Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore India.Department of Mathematics National Institute of Technology Durgapur Durgapur India.

An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an L(0,1)-labelling is the maximum label number assigned to any vertex of G. The L(0,1)-labelling number of a graph G, denoted by λ_0.1(G) is the least integer k such that G has an L(0,1)-labelling of span k. This labelling has an application to a computer code assignment problem. The task is to assign integer control codes to a network of computer stations with distance restrictions. A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label the vertices of a cactus graph by L(0,1)-labelling and have shown that, △-1≤λ_0.1(G)≤△ for a cactus graph, where △ is the degree of the graph G.

关键词： Graph Labelling Code Assignment L(0 1)-Labelling Cactus Graph

来源：评论

学校读者我要写书评

暂无评论

Network virtualization for military application: Review and initial development of conceptual design

Network virtualization for military application: Review and ...

引用

International Conference on Advanced Communication technology (ICACT)

作者： Jiradett Kerdsri Komwut Wipusitwarkun Computer and Programming Laboratory Defense Technology Institute Thailand School of Information Computer and Communication Technology (ICT) Sirindhorn International Institute of Technology Thailand

Networking technology, undoubtedly, plays a vital role in modern warfare especially in Network Centric Operations (NCOs) and Global Information Grid (GIG) concept. However, the current popular network infrastructure, mainly TCP/IP architecture, is in fact unsuitable with advanced military communication especially in tactical operation networks. The key characteristics of military communications are classified as delay/disruption/disconnection tolerant networks (DTNs) which are long and variable delays, high error rates and greatly heterogeneous. As a result a call for new type of network architecture emerges to support such peculiar characteristics of military communication network. This paper reviews the current approaches in network technology of military communication and proposes the conceptual design of Virtualization Network (VN) for military communication to address the limitation of current network infrastructure. The implementation of Military Network Virtualization Environment (MVNE) introduces the crucial two new key features of military tactical network: information classification and movable nodes. These features along with essential research challenges must be analyzed to realize a viable virtualization network for military communications.

关键词： Military communication Security Delay Protocols Routing IP networks Network topology

来源：评论

学校读者我要写书评

暂无评论

<i>L</i>(0, 1)-Labelling of Cactus Graphs

引用

Communications and Network 2012年第1期4卷 18-29页

作者： Nasreen Khan Madhumangal Pal Anita Pal Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore India Department of Mathematics National Institute of Technology Durgapur Durgapur India

An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an L(0,1)-labelling is the maximum label number assigned to any vertex of G. The L(0,1)-labelling number of a graph G, denoted by λ0.1(G) is the least integer k such that G has an L(0,1)-labelling of span k. This labelling has an application to a computer code assignment problem. The task is to assign integer control codes to a network of computer stations with distance restrictions. A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label the vertices of a cactus graph by L(0,1)-labelling and have shown that, △-1≤λ0.1(G)≤△ for a cactus graph, where △ is the degree of the graph G.

关键词： Graph Labelling Code Assignment L(0 1)-Labelling Cactus Graph

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to ‘A single period inventory model with imperfect production and stochastic demand under chance and imprecise constraints’ [Eur. J. Oper. Res. 188 (2008) 121–139]

引用

European Journal of Operational Research 2013年第3期230卷 703-703页

作者： D. Panda S. Kar K. Maity M. Maiti Department of Engineering Science Haldia Institute of Technology Haldia Purba Medinipur Haldia West Bengal 721 657 India Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore 721 102 India

来源：评论

学校读者我要写书评

暂无评论

Promoter recognition with machine learning algorithms keREM, RULSE-3 and ANN

Promoter recognition with machine learning algorithms keREM,...

引用

IEEE International Symposium on Innovations in Intelligent Systems and Applications (INISTA)

作者： Günay Karli Ahmet Nayir Faculty of Engineering and Information Technology International Burch University Sarajevo Bosnia and Herzegovina Department of Computer Programming Fatih University Istanbul Turkey

Data mining has become an important and active area of research because of theoretical challenges and practical applications associated with the problem of discovering interesting and previously unknown knowledge from very large real world database. These databases contain potential gold mine of valuable information, but it is beyond human ability to analyze massive amount of data and elicit meaningful patterns by using conventional techniques. In this study, DNA sequence was analyzed to locate promoter which is a regulatory region of DNA located upstream of a gene, providing a control point for regulated gene transcription. In this study, some supervised learning algorithms such as artificial neural network (ANN), RULES-3 and newly developed keREM rule induction algorithm were used to analyse to DNA sequence. In the experiments different option of keREM, RULES-3 and ANN were used, and according to the empirical comparisons, the algorithms appeared to be comparable to well-known algorithms in terms of the accuracy of the extracted rule in classifying unseen data.

关键词： Artificial neural networks DNA Classification algorithms Machine learning algorithms Neurons Algorithm design and analysis Biological neural networks

来源：评论

学校读者我要写书评

暂无评论

A dynamic accelerator-cluster architecture

A dynamic accelerator-cluster architecture

引用

41st International Conference on Parallel Processing Workshops, ICPPW 2012

作者： Rinke, Sebastian Becker, Daniel Lippert, Thomas Prabhakaran, Suraj Westphal, Lidia Wolf, Felix Laboratory for Parallel Programming German Research School for Simulation Sciences 52062 Aachen Germany Department of Computer Science RWTH Aachen University 52062 Aachen Germany Corporate Technology Siemens AG 81739 München Germany Jülich Supercomputing Centre 52428 Jülich Germany MAGMA Giessereitechnologie GmbH 52072 Aachen Germany

ISBN: (纸本)9780769547954

Accelerators such as graphics processing units (GPUs) provide an inexpensive way of improving the performance of cluster systems. In such an arrangement, the individual nodes of the cluster are directly connected to one or more accelerator devices via PCI Express. This results in a static mapping of accelerators onto compute nodes, where each accelerator can only be accessed from exactly one compute node. While this static mapping enables efficient data transfers between a given accelerator and the compute node it belongs to, differing computational demands across jobs may, however, produce either underutilized accelerators or nodes whose computational demands cannot be satisfied with the number of accelerators available to them. In particular, smaller numbers of GPUs available per node may enforce explicit MPI parallelism across compute nodes where it is not necessary. To address this limitation, we propose a novel accelerator-cluster architecture in which network-attached accelerators are dynamically assigned to compute nodes. This allows not only their optimal utilization but also a more precise match between application requirements and accelerator hardware. We outline the general concept of our dynamic architecture and show that it can offer substantial benefits to certain classes of applications without significantly harming the performance of others. © 2012 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Resource-aware programming and simulation of MPSoC architectures through extension of X10 11

Resource-aware programming and simulation of MPSoC architect...

引用

Proceedings of the 14th International Workshop on Software and Compilers for Embedded Systems

作者： Hannig, Frank Roloff, Sascha Snelting, Gregor Teich, Jürgen Zwinkau, Andreas Hardware/Software Co-Design Department of Computer Science University of Erlangen Nuremberg Germany Programming Paradigms Group Karlsruhe Institute of Technology - KIT Germany

ISBN: (纸本)9781450307635

The efficient use of future MPSoCs with f 000 or more processor cores requires new means of resource-aware programming to deal with increasing imperfections such as process variation, fault rates, aging effects, and power as well as thermal problems. In this paper, we apply a new approach called invasive computing that enables an application programmer to spread computations to processors deliberately and on purpose at certain points of the program. Such decisions can be made depending on the degree of application parallelism and the state of the underlying resources such as utilization, load, and temperature. The introduced programming constructs for resource-aware programming are embedded into the parallel computing language X10 as developed by IBM using a library-based approach. Moreover, we show how individual heterogeneous MPSoC architectures may be modeled for subsequent functional simulation by defining compute resources such as processors themselves by lightweight threads that are executed in parallel together with the application threads by the X10 run-time system. Thus, the state changes of each hardware resource may be simulated including temperature, aging, and other useful monitor functionality to provide a first high-level programming test-bed for invasive computing. Copyright © 2011 ACM.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Security goals assurance based on software active monitoring

Security goals assurance based on software active monitoring

引用

International Conference on Secure Software Integration and Reliability Improvement

作者： Zhao, Changzhi Dong, Wei Leucker, Martin Qi, Zhichang Department of Computer Science National University of Defense Technology Changsha 410073 China Institute of Software Technology and Programming Languages University of Lubeck Germany

ISBN: (纸本)9780769544533

Access control is a vital security mechanism in today's operating systems and the security policies dictating the security relevant behaviors is lengthy and complex for example in Security-Enhanced Linux (SELinux). It is extremely difficult to verify the consistency between the security policies and the security goals desired by applications. In this paper we present how to predict whether the information flow security goal is violated or not during runtime how to generate the corresponding control actions on-line when divergence is detected and how to apply these actions in time based on software active monitoring technique. The symbolic security information flow model of SElinux is generated from a formalization of the access control mechanism which can be used to generate the N-step ahead projection of the future behavior. Information flow security goals are expressed in linear temporal logic (LTL) which provides clear description of the objectives desired by applications. Anticipatory monitor is generated from LTL formula automatically. We consider an on-line scheme where after the occurrence of an event, the next control action is determined on the basis of the N-step ahead projection of the future behavior. This procedure is repeated after the occurrence of next security relevant event. Thus a closed-loop system is generated that all behavior sequences will satisfy the security goals. © 2011 IEEE.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Information System for Administrative Services of Educational Process

引用

computer technology and Application 2011年第5期2卷 354-357页

作者： Lyudmilla Yordanova Stoyanova Department of Programming and Computer Technology Faculty of Computer Systems and Control Technical University of SofiaSofia 1000 Bulgaria

The goal of this paper is to analyze and propose a reconstruction of functional possibilities and database requirements of a Web based Educational Information system. For the research the Information system of the technology School ＂electronic Systems＂（TUES） associated with the Technical University of Sofia is on focus. The modules for admission of students, specialty classification, and graduation of students, management of the student＇s work in computer classrooms and lecturers＇ data management have been analyzed, developed and implemented. The additionally developed modules concern mainly the management of educational process and do not affect the e-learning or the official part modules. That led to the idea that the functionality for managing educational process has to be organized in a separate module defined as module for administrative services of educational process. Such restructuring of the system will bring flexibility in further growth of the system--for example students＇ admission or selection for different purposes.

关键词： Information systems functional structure database education.

来源：评论

学校读者我要写书评

暂无评论

Security Goals Assurance Based on Software Active Monitoring

Security Goals Assurance Based on Software Active Monitoring

引用

International Conference on Secure System Integration and Reliability Improvement, SSIRI

作者： Changzhi Zhao Wei Dong Martin Leucker Zhichang Qi Department of Computer Science National University of Defense Technology Changsha China Institute of Software Technology and Programming Languages University of Lübeck Germany

Access control is a vital security mechanism in today's operating systems, and the security policies dictating the security relevant behaviors is lengthy and complex, for example in Security-Enhanced Linux (SELinux). It is extremely difficult to verify the consistency between the security policies and the security goals desired by applications. In this paper, we present how to predict whether the information flow security goal is violated or not during runtime, how to generate the corresponding control actions on-line when divergence is detected and how to apply these actions in time based on software active monitoring technique. The symbolic security information flow model of SElinux is generated from a formalization of the access control mechanism which can be used to generate the N-step ahead projection of the future behavior. Information flow security goals are expressed in linear temporal logic (LTL) which provides clear description of the objectives desired by applications. Anticipatory monitor is generated from LTL formula automatically. We consider an on-line scheme where after the occurrence of an event, the next control action is determined on the basis of the N-step ahead projection of the future behavior. This procedure is repeated after the occurrence of next security relevant event. Thus, a closed-loop system is generated that all behavior sequences will satisfy the security goals.

关键词： Context Monitoring Semantics Access control Cost accounting Syntactics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：