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

A clustering-based approach for mining dockerfile evolutionary trajectories

Science China(Information Sciences) 2019年第1期62卷 211-213页

作者： Yang ZHANG Huaimin WANG Vladimir FILKOV Key Laboratory of Parallel and Distributed Computing National University of Defense Technology College of Computer National University of Defense Technology DECAL Lab University of California Computer Science Department University of California

Dear editor,Docker1), as a de-facto industry standard [1], enables the packaging of an application with all its dependencies and execution environment in a light-weight, self-contained unit, i.e., *** launching the container from Docker image, developers can easily share the same operating system, libraries, and binaries [2]. As the configuration file, the dockerfile plays an important role,

关键词： A clustering-based approach for mining dockerfile evolutionary trajectories

来源：评论

学校读者我要写书评

暂无评论

Using JIT compilation and configurable runtime systems for efficient deployment of java programs on ubiquitous devices

引用

International Conference on Ubiquitous computing, Ubicomp 2001

作者： Teodorescu, Radu Pandey, Raju Parallel and Distributed Computing Laboratory Computer Science Department University of California Davis United States

ISBN: (纸本)3540426140

As the proliferation of ubiquitous devices moves computation away from the conventional desktop computer boundaries, distributed systems design is being exposed to new challenges. A distributed system supporting a ubiquitous computing application must deal with a wider spectrum of hardware architectures featuring structural and functional differences, and resources limitations. Due to its architecture independent infrastructure and object-oriented programming model, the Java programming environment can support flexible solutions for addressing the diversity among these devices. Unfortunately, Java solutions are often associated with high costs in terms of resource consumption, which limits the range of devices that can benefit from this approach. In this paper, we present an architecture that deals with the cost and complexity of running Java programs by partitioning the process of Java program execution between system nodes and remote devices. The system nodes prepare a Java application for execution on a remote device by generating device-specific native code and application-specific runtime system on the fly. The resulting infrastructure provides the flexibility of a high-level programming model and the architecture independence specific to Java. At the same time the amount of resources consumed by an application on the targeted device are comparable to that of a native implementation. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A testing framework for OWL-DL reasoning

A testing framework for OWL-DL reasoning

引用

4th International Conference on Semantics, Knowledge, and Grid, SKG 2008

作者： Babik, Marian Hluchy, Ladislav Department of Parallel and Distributed Computing Institute of Informatics Slovak Academy of Sciences Dubravska cesta 9 84507 Bratislava Slovakia

ISBN: (纸本)9780769534015

OWL and RDF/RDFS are ontological languages developed by the World Wide Web Consortium (W3C), which have become a de facto standard for the ontological descriptions in various domains. The evolution of these standards was influenced by the numerous advances in the research of knowledge representation and reasoning. Although support for reasoning and standardized representation is the key benefit of these technologies, there is a lack of existing test frameworks, which would be capable of addressing many crucial aspects of the Semantic Web applications. In this paper we propose a methodology for automated testing of OWL reasoners based on the real-world ontologies. This specification covers both terminological and assertional reasoning as well as checking of the correctness of the answers. An opensource implementation of such framework is described and a study of initial results is provided. The tests cover an extensive set of reasoners and ontologies and provide a state-of-the-art insight into the field of OWL reasoning. © 2008 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Deep integration of python with Web ontology language

Deep integration of python with Web ontology language

引用

2nd International Workshop on Scripting for the Semantic Web, SFSW 2006 - Co-located with 3rd European Semantic Web Conference

作者： Babik, Marian Hluchy, Ladislav Intelligent and Knowledge-based Technologies Group Department of Parallel and Distributed Computing Institute of Informatics Slovak Academy of Sciences Slovakia

The Semantic Web is a vision for the future of the Web in which information is given explicit meaning, making it easier for machines to automatically process and integrate information available on the Web. Semantic Web will build on the well known Semantic Web language stack, part of which is the Web Ontology Language (OWL). Python is an interpreted, object-oriented, extensible programming language, which provides an excellent combination of clarity and versatility. The deep integration of both languages is one of the novel approaches for enabling free and interoperable data [1]. In this article we present a metaclass-based implementation of the deep integration ideas. The implementation is an early Python prototype supporting in-line class and properties declaration, instance creation and simple triple-based queries. The implementation is backed up by a well known OWL-DL reasoner Pellet [3]. The integration of the Python and OWL-DL through meta-class programming provides a unique approach, which can be implemented with any metaclass enabled scripting language.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

Integration of secure agents with a secure communication infrastructure for crisis management

Integration of secure agents with a secure communication inf...

引用

2011 12th International Conference on Collaboration Technologies and Systems, CTS 2011

作者： Balogh, Z. Gatial, E. Hluchý, L. Hudek, V. Konecny, M. Institute of Informatics Slovak Academy of Sciences Department of Parallel and Distributed Computing Bratislava Slovakia Ardaco A.s. Bratislava Slovakia

ISBN: (纸本)9781612846378

This paper proposes integration of secure agents with a secure communication infrastructure in order to provide rapid information gathering platform from various information sources and actors participating in a crisis situation. The role of agents is primarily a coordinated collection of information. The secure communication infrastructure (SCI) provides communication services for voice and data exchange between users and systems. A special type of agent called User Communication Agent is described. The communication with users is enacted through dynamically generated XForms-based questionnaires integrated with the user interface of the SCI. Although security and trust aspects are important part of both secure agents and SCI, we concentrate more on integration aspects between these two systems. The presented work is being developed in scope of the SECRICOM 7th FP integrated project. © 2011 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel algorithms on interval graphs 4th

Efficient parallel algorithms on interval graphs

引用

4th International parallel Architectures and Languages Europe Conference, PARLE 1992

作者： Das, Sajal K. Chen, Calvin C. -Y. Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas DentonTX76203 United States

ISBN: (纸本)9783540555995

We design efficient parallel algorithms for solving several problems on interval graphs. The problems include finding a BFS-tree and DFS-tree, articulation points and bridges, and minimum coloring. Each of our algorithms requires O(log n) time employing O(n) processors on the EREW PRAM model, where n is the number of vertices. The proposed algorithms for computing articulation points and bridges have better performance in terms of the cost (i.e, processor-time product) than the existing algorithms in [RR90], yet having the same time complexity. Our novel approach to the construction of BFS tree is based on elegantly capturing the structure of a given collection of intervals. This structure reveals important properties of the corresponding interval graph, and is found to be instrumental in solving many other problems on such graphs. Although the time- and processor-complexities of the proposed DFS-tree construction or minimum-coloring is comparable with the best-known ones [KI89], our approach to these problems are new. For example, the approach to the construction of a DFS tree is based on reducing the problem into an all dominating neighbors (ADN) problem;while that to the minimum coloring is by transforming this problem into a linked list ranking problem. © Springer-Verlag Berlin Heidelberg 1992.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Managing a parallel heap efficiently 3rd

Managing a parallel heap efficiently

引用

3rd International Conference on parallel Architectures and Languages Europe, PARLE 1991

作者： Das, Sajal K. Horng, Wen-Bing Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas DentonTX76203-3886 United States

ISBN: (纸本)9783540541516

We design a cost-optimal algorithm for managing a parallel heap on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. This is an improvement in space and time over the one recently proposed by Deo and Prasad [4]. Our approach efficiently employs p processors in the range 1 ≤ p ≤ n, where n is the maximum number of items in a parallel heap. It is assumed that a delete-think-insert cycle is repeatedly performed, and each processor requires an arbitrary but the same amount of time (called the think time) for processing an item which in turn generates at most α (a constant) new items. The time required for deleting p items of the highest priority from the parallel heap is O(l), while that for inserting at most αp new items is 0(logn). With or without incorporating the think time, the speedup of our algorithm is proved to be linear, i.e. 0(p). Using a global, working data structure for each level of the heap, it is shown that the additional memory space required for our parallel heap is much less than that for the existing one [4]. Furthermore, the proposed algorithm retains the strict priority ordering of a sequential heap. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Cost-optimal parallel algorithms for finitely inductive sequences 26

Cost-optimal parallel algorithms for finitely inductive sequ...

引用

26th Hawaii International Conference on System Sciences, HICSS 1993

作者： Das, S.K. Fisher, P.S. Zhang, H. Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas DentonTX76203-3886 United States

ISBN: (纸本)0818632305

Finitely inductive (FI) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. Pattern recognition using the FI technique first transforms known patterns into function table(s) by factoring, and then uses the function iable(s) to match an input pattern by following. Factoring is done off line and only once for each pattern. The sequential time for matching two sequences depends only upon the length of the input sequence. In this paper, we propose cost-optimal (i.e., efficient) parallel algorithms for FI sequence processing. These algorithms include parallel factoring and following by bucket packing and by hashing on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. © 1993 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems 5

Performance of parallel spanning tree algorithms on linear a...

引用

5th International parallel Processing Symposium, IPPS 1991

作者： Das, Sajal K. Yang, Cui-Qing Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas DentonTX76203-3886 United States

ISBN: (纸本)0818691670

This paper presents empirical performance of parallel algorithms for computing a spanning tree (SPT) and a minimum spanning tree (MST) of connected graphs on the Transputer and Unix systems, where processors are configured as a onedimensional array. The parallel MST algorithm uses a weight matrix data structure;and three implementations of the SPT algorithm are presented with unordered edge-list, linked adjacency list and adjacency matrix as data structures. The experiments are conducted with a wide range of random graphs, generated for various edge-densities (d) for a given number (n) of vertices. The edge-density is varied between 0.1 and 0.9, and the maximum number of vertices (or edges) considered are 300 (or 40,000) and 500 (or 110,000) for transputer and Unix systems, respectively. A maximum speed-up of 2.98 is achieved on the transputer network of 8 processors, and that for the Unix system is 3.0 with 4 processes. © 1991 IEEE.

关键词： Transputers

来源：评论

学校读者我要写书评

暂无评论

An interface theory based approach to verification of web services

An interface theory based approach to verification of web se...

引用

30th Annual International Computer Software and Applications Conference, COMPSAC 2006

作者： Zhenbang, Chen Ji, Wang Wei, Dong Zhichang, Qi Yeung, W.L. National Laboratory for Parallel and Distributed Processing Changsha China Department of Computing and Decision Sciences Lingnan University Hong Kong Hong Kong

ISBN: (纸本)0769526551

The verification of web services becomes a challenge in software verification. This paper presents a framework for verification of web service interfaces at various abstraction levels. Its foundation is the interface theory for web services, in which transaction features are incorporated. Within the framework, one may check non mutual invocation, compatibility and refinement of web services at signature, conversation and protocol levels. At protocol level, we present a model checking approach to verifying the protocol properties in Action Set Computation Tree Logic(ASCTL). The paper also discusses the integration of our framework into the web service development. © 2006 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：