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

Beyond Program Slicing 2005

作者： Kalleberg, Karl Trygve Hall, Tracy Ettinger, Ran Institutt for Informatikk Universitetet i Bergen PB 7800 NorwayN-5020 Norway Department of Computer Science Hertfordshire University HertfordshireAL10 9LB United Kingdom Programming Tools Group Computing Laboratory Oxford University OxfordOX1 3QD United Kingdom

By now, the concept of program slicing has been known in the research community for around 25 years. As a research topic, it has enjoyed a fair share of popularity, evidenced by the number of articles published on the topic following Mark Weiser’s seminal paper. However, outside research circles, program slicing appears to be virtually unknown. In this report, we take the premise that program slicing is both technically relevant, and has a sufficient theoretical foundation, to be applied in practice within the software industry. With this premise in mind, we ask ourselves, "what are the mechanisms by which we as a community could make program slicing mainstream"? © 2006 Dagstuhl Seminar Proceedings. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cyber-Physical-Social System Self-Organization: Ontology-Based Multi-level Approach and Case Study

Cyber-Physical-Social System Self-Organization: Ontology-Bas...

引用

International Conference on Self-Adaptive and Self-Organizing Systems (SASO)

作者： Alexander Smirnov Alexey Kashevnik Nikolay Shilov Information technology and programming department ITMO University St.Petersburg Russia Laboratory of Computer Aided Integrated Systems SPIIRAS St.Petersburg Russia

This paper presents a multi-level approach for self-organization of in cyber-physical system resources. Cyber-physical system consists of physical part and cyber part. For implementation of joint actions by devices in physical part, they have to interact in cyber part. It is proposed to use the smart space technology for exchange information between these devices in cyber part of cyber-physical system. Smart Space -- is a computational environment consisting of multiple heterogeneous services (electronic and computational devices, Internet pages, data based, etc.) which has intelligent behavior, can proactively provide information taking into account current situation. Smart spaces allow unifying different levels of services, implement self-organization of services in each level, and providing politics from upper to lower level. Self-organization on every level is implemented based on ontology-based context management techniques and ontology matching method that provides semantic interoperability between interacted robots. Discussed in the paper case study solve the task of self-organization three types of robots based on politics from operation planning services and context situation in smart space. For the scenario implementation the Smart-M3 information sharing platform is used. It provides easy-to-use interfaces for information sharing through the RDF ontologies and publish / subscribe mechanism for connected services.

关键词： Ontologies Robots Semantics Information management Organizations Interoperability Pipelines

来源：评论

学校读者我要写书评

暂无评论

EkSarva: an intelligent collaboration framework

EkSarva: an intelligent collaboration framework

引用

International IEEE Conference on Intelligent Systems, IS

作者： R. Reddy S. Selliah V. Bharadwaj Jinqiao Yu S. Kankanahalli S. Reddy Smart Internet Programming Laboratory Concurrent Engineering Research Center Lane Department of Computer Science and Electrical Engineering West Virginia University Morgantown WV USA

Ubiquitous computing and universal network connectivity have given rise to expectations of building a Digital Society, where many aspects of business and social activities may be accomplished by remote participants. Intelligent, context-aware, and workflow-centric collaboration is an essential prerequisite to fulfill that expectation. EkSarva is a framework, which enables realization of such collaborations in diverse domains. This is accomplished by identifying the key concepts and their inter-relationships (dubbed the PPP/SST paradigm), which form the foundation of this framework. The key concepts include: (a) Project, (b) Person, (c) Place, (d) Signal, (e) Situation, and (f) Transcript. This paper describes how these concepts collectively can give rise to an intelligent collaboration environment.

关键词： Collaboration Collaborative work Internet Java computer networks Intelligent networks Signal processing Intelligent structures Intelligent agent Laboratories

来源：评论

学校读者我要写书评

暂无评论

WIP: An Engaging Undergraduate Intro to Model Checking in Software Engineering Using TLA+

arXiv

引用

arXiv 2024年

作者： Läufer, Konstantin Mertin, Gunda Thiruvathukal, George K. Software and Systems Laboratory Department of Computer Science Loyola University Chicago United States Institute for Software Engineering and Programming Languages University of Lübeck Germany

Background: In this Innovative Practice Work in Progress, we present our initial efforts to integrate formal methods, with a focus on model-checking specifications written in Temporal Logic of Actions (TLA+), into computer science education, targeting undergraduate juniors/seniors and graduate students. Many safety-critical systems and services crucially depend on correct and reliable behavior. Formal methods can play a key role in ensuring correct and safe system behavior, yet remain underutilized in educational and industry contexts. Aims: We aim to (1) qualitatively assess the state of formal methods in computer science programs, (2) construct level-appropriate examples that could be included midway into one’s undergraduate studies, (3) demonstrate how to address successive "failures" through progressively stringent safety and liveness requirements, and (4) establish an ongoing framework for assessing interest and relevance among students. Methods: We detail our pedagogical strategy for embedding TLA+ into an intermediate course on formal methods at our institution. After starting with a refresher on mathematical logic, students specify the rules of simple puzzles in TLA+ and use its included model checker (known as TLC) to find a solution. We gradually escalate to more complex, dynamic, event-driven systems, such as the control logic of a microwave oven, where students will study safety and liveness requirements. We subsequently discuss explicit concurrency, along with thread safety and deadlock avoidance, by modeling bounded counters and buffers. Results: Our initial findings suggest that through careful curricular design and choice of examples and tools, it is possible to inspire and cultivate a new generation of software engineers proficient in formal methods. Conclusions: Our initial efforts suggest that 84% of our students had a positive experience in our formal methods course. Our future plans include a longitudinal analysis within our own institution and

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Using the Topological Characterization of Synchronous Models 1

引用

Electronic Notes in Theoretical computer Science 2003年 81卷 36-47页

作者： Giovanni Adagio Distributed Programming Laboratory School of Computer Science and Communication Systems Swiss Federal Institute of Technology in Lausanne (EPFL) Institute of Mathematics School of Basic Sciences Swiss Federal Institute of Technology in Lausanne (EPFL) Switzerland

This paper contributes to the characterization of synchronous models of distributed computing using topological techniques. We consider a generic synchronous model with send-omission failures and use a topological structure corresponding to a bounded number of rounds of the model. We observe some nice properties of the structure and derive from these properties necessary and sufficient conditions to solve consensus in this model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Synchronizing the timestamps of concurrent events in traces of hybrid MPI/OpenMP applications

Synchronizing the timestamps of concurrent events in traces ...

引用

作者： Becker, Daniel Geimer, Markus Rabenseifner, Rolf Wolf, Felix German Research School for Simulation Sciences Laboratory for Parallel Programming 52062 Aachen Germany RWTH Aachen University Department of Computer Science 52056 Aachen Germany Forschungszentrum Jülich Jülich Supercomputing Centre 52428 Jülich Germany University of Stuttgart High Performance Computing-Center 70550 Stuttgart Germany

ISBN: (纸本)9780769542201

Event traces are helpful in understanding the performance behavior of parallel applications since they allow the indepth analysis of communication and synchronization patterns. However, the absence of synchronized clocks on most cluster systems may render the analysis ineffective because inaccurate relative event timings may misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors or confuse the users of time-line visualization tools by showing messages flowing backward in time. In our earlier work, we have developed a scalable algorithm that eliminates inconsistent inter-process timings postmortem in traces of pure MPI applications. Since hybrid programming, the combination of MPI and OpenMP in a single application, is becoming more popular on clusters in response to rising numbers of cores per chip and widening shared-memory nodes, we present an extended version of the algorithm that in addition to message-passing event semantics also preserves and restores shared-memory event semantics. © 2010 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Emerging technologies for improving embryo selection: a systematic review

引用

Advanced Health Care Technologies 2015年 1卷 55-64页

作者： Sengul, Yasemin Bener, Ayse Uyar, Asli 1 Computer Programming Program Advanced Vocational Studies Dogus University Acibadem Kadikoy Istanbul Turkey 2 Data Science Laboratory Department of Mechanical and Industrial Engineering Ryerson University Toronto ON Canada 3 Department of Computer Engineering Okan University Tuzla Istanbul Turkey

Background: Embryo selection procedure is one of the critical success factors in in vitro fertilization treatment. Various embryo selection technologies have emerged within the past decade. These technologies are either used in combination with morphology or introduced to replace the conventional morphological evaluation. This review aims at investigating the effect of these novel embryo selection technologies on in vitro fertilization success rates. Methods: A systematic review of the literature was performed among full-text English articles in the PubMed database. Study selection was based on the predefined inclusion and exclusion criteria. Clinical effectiveness of the selected studies was measured in terms of implantation, pregnancy, live birth, and multiple pregnancy rates. Results: Five studies were identified that fitted the inclusion criteria. In these studies, researchers used aneuploidy screening, metabolomic profiling, and time-lapse imaging analysis as the new technologies. Among these studies, the one that conducted a randomized controlled trial of a commercial time-lapse imaging system demonstrated significant improvement in implantation rate. Conclusion: Studies using emerging technologies for embryo assessment provide promising results in retrospective analysis. On the other hand, randomized controlled trial studies that test the efficacy of novel embryo selection techniques in clinical practice failed to demonstrate a consistent improvement in the resulting success rates. This review provides a snapshot of the most recent literature on embryo assessment and embryo selection studies. Our findings show that there is a lack of comparative measurements and analyses that are able to assess benefits of the novel technologies in the field of embryo selection.

关键词： embryo selection in vitro fertilization IVF

来源：评论

学校读者我要写书评

暂无评论

Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Provers

arXiv

引用

arXiv 2022年

作者： Daggitt, Matthew L. Kokke, Wen Atkey, Robert Arnaboldi, Luca Komendantskya, Ekaterina Department of Computer Science Heriot-Watt University Edinburgh United Kingdom Mathematically Structured Programming Group University of Strathclyde Glasgow United Kingdom Laboratory for Foundations of Computer Science University of Edinburgh Edinburgh United Kingdom

Verification of neural networks is currently a hot topic in automated theorem proving. Progress has been rapid and there are now a wide range of tools available that can verify properties of networks with hundreds of thousands of nodes. In theory this opens the door to the verification of larger control systems that make use of neural network components. However, although work has managed to incorporate the results of these verifiers to prove larger properties of individual systems, there is currently no general methodology for bridging the gap between verifiers and interactive theorem provers (ITPs). In this paper we present Vehicle, our solution to this problem. Vehicle is equipped with an expressive domain specific language for stating neural network specifications which can be compiled to both verifiers and ITPs. It overcomes previous issues with maintainability and scalability in similar ITP formalisations by using a standard ONNX file as the single canonical representation of the network. We demonstrate its utility by using it to connect the neural network verifier Marabou to Agda and then formally verifying that a car steered by a neural network never leaves the road, even in the face of an unpredictable cross wind and imperfect sensors. The network has over 20,000 nodes, and therefore this proof represents an improvement of 3 orders of magnitude over prior proofs about neural network enhanced systems in ITPs. © 2022, CC BY.

关键词： Problem oriented languages

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

COMPOzE-intention-based music composition through constraint programming

COMPOzE-intention-based music composition through constraint...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： M. Henz S. Lauer D. Zimmermann Programming Systems Laboratory University of Saarland Saarbruecken Germany Computer Science Department University of Saarland Saarbruecken Germany Graduate School for Cognitive Science University of Saarland Saarbruecken Germany

We goal of the work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.

关键词： Multiple signal classification Application software computer science Cognitive science Electronic mail Libraries Automatic programming Music Concrete Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：