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

作者： Chen, Shimin Kozuch, Michael Gibbons, Phillip B. Ryan, Michael Strigkos, Theodoros Mowry, Todd C. Ruwase, Olatunji Vlachos, Evangelos Falsafi, Babak Ramachandran, Vijaya Intel Research Pittsburgh 4720 Forbes Ave. Pittsburgh PA 15213 United States Computer Science Department Carnegie Mellon University Pittsburgh PA United States Parallel Systems Architecture Laboratory École Polytechnique Fédérale de Lausanne Lausanne Switzerland Deartment of Computer Science University of Texas at Austin Austin TX United States

Instruction-grain lifeguards monitor executing programs at the granularity of individual instructions to quickly detect bugs and security attacks, but their fine-grain nature incurs high monitoring overheads. This article identifies three common sources of these overheads and proposes three techniques that together constitute a general-purpose hardware acceleration framework for lifeguards. © 2009 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Improving Task-driven Software Development Approaches for Creating Service-Based Interactive Applications by Using Annotated Web Services

Improving Task-driven Software Development Approaches for Cr...

引用

International Conference on Next Generation Web Services Practices (NWeSP)

作者： Marius Feldmann Gerald Hubsch Thomas Springer Alexander Schill Department of Computer Science Institute of Systems Architecture Computer Networks Group Technische Universität Dresden Dresden Germany

The aspect of human interaction becomes more and more relevant for service-oriented applications. On one hand, current development approaches support the composition of services but neglect the creation of user interfaces. On the other hand, task-based modeling of user interactions is well established but poorly integrated into service-oriented development. In this paper we propose an integrated modelling approach for the task-driven development of interactive service-oriented applications. Our central concept is the introduction of annotations as part of the Web service description. These annotations cover information relevant for the semi-automatic generation of task models and user interfaces. We present the annotation concept as well as concepts for the integration of the annotations into a task-driven software development methodology.

关键词： Programming Application software Web services Logic User interfaces Skeleton Inference mechanisms Next generation networking computer science computer architecture

来源：评论

学校读者我要写书评

暂无评论

Adaptive resource allocation for streaming applications

Adaptive resource allocation for streaming applications

引用

International Conference on Embedded computer systems: architectures, Modeling and Simulation (IC-SAMOS)

作者： Timon D. ter Braak Hermen A. Toersche André B. J. Kokkeler Gerard J. M. Smit Computer Architecture for Embedded Systems Group Department of Electrical Engineering Mathematics and Computer Science University of Twente Enschede Netherlands

Streaming applications often have latency and throughput requirements due to timing critical signal processing, or the time critical interaction with their environment. Mapping such applications to a multi-core architecture is commonly done at design-time to be able to analyze the complex design-space. However, such design-flows cannot deal with a dynamic platform or a dynamic set of applications. Hardware faults and resources claimed by other applications may render the assumed available resources inaccessible. To avoid the assumptions posed on the state of the platform by a fixed resource allocation, applications should be designed with location transparency in mind. Applications must be analyzed at design-time to determine the required resource budget, independent of which specific resources will be allocated. Sufficient performance can be guaranteed when such applications are mapped onto an architecture in which each resource is arbitrated using a budget scheduler. Within the Cutting edge Reconfigurable ICs for Stream Processing (CRISP) project, a many-core platform is developed that adheres to these requirements. Using the configuration features of the platform, the system is able to control at run-time what resources are being used by the applications. This paper shows that run-time resource allocation can effectively adapt to the available set of resources, providing partial distribution transparency to the user. As an example, a GNSS receiver is mapped to the platform containing faulty hardware components. A few resources remain critical, but in most cases the faulty components can be circumvented, such that adequate resources can be allocated to the application at run-time.

关键词： Hardware Routing Resource management Global Navigation Satellite systems Receivers Tiles Radio frequency

来源：评论

学校读者我要写书评

暂无评论

A heuristic algorithm for mapping communicating tasks on heterogeneous resources

A heuristic algorithm for mapping communicating tasks on het...

引用

Heterogeneous Computing Workshop

作者： K. Taura A. Chien Computer Systems and Architecture Group Computer Science and Engineering University of California San Diego USA Department of Information Science University of Tokyo

A heuristic algorithm that maps data processing tasks onto heterogeneous resources (i.e. processors and links of various capacities) is presented. The algorithm tries to achieve a good throughput of the whole data processing pipeline, taking both parallelism (load balance) and communication volume (locality) into account. It performs well both under computationally intensive and communication-intensive conditions. When all tasks/processors are of the same size and communication is negligible, it quickly distributes the computation load over the processors and finds the optimal mapping. As communication becomes significant and reveals a bottleneck, it trades parallelism for reduction of communication traffic. Experimental results using a topology generator that models the Internet show that it performs significantly better than communication-ignorant schedulers.

关键词： Heuristic algorithms Data processing parallel processing Throughput Pipelines Distributed computing Traffic control Topology Internet Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a Python implementation of the new LEDBAT congestion control algorithm

Performance evaluation of a Python implementation of the new...

引用

IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR

作者： Mugurel Ionuţ Andreica Nicolae Ţăpuş Johan Pouwelse Computer Science Department Politehnica University of Bucharest Romania Parallel and Distributed Systems Group Delft University of Technology Netherlands

LEDBAT is a new congestion control algorithm which was proposed in an IETF draft in March 2009. LEDBAT's goal is to provide a less-than-best-effort data transport service, i.e. a LEDBAT flow should back-off in the presence of other competing flows (TCP flows in particular). Because of its intended friendliness to competing flows, LEDBAT has already been implemented in the popular Bittorrent client uTorrent. In this paper we present performance evaluation results for our Python implementation of LEDBAT. We ran tests both in emulated networks as well as in real world networks. One of the tests involved approximately 300 volunteers spread throughout the world.

关键词： Peer to peer computing Testing Control systems Delay estimation Delay effects Streaming media computer science Radio access networks Performance evaluation Time measurement

来源：评论

学校读者我要写书评

暂无评论

On the Design of RNA Sequences for Realizing Extended Shapes

On the Design of RNA Sequences for Realizing Extended Shapes

引用

International Joint Conference on Bioinformatics, systems Biology and Intelligent Computing, IJCBS

作者： Marc Hellmuth Daniel Merkle Martin Middendorf Interdisciplinary Centre of Bioinformatics Department of Computer Science University of Leipzig Leipzig Germany Department of Mathematics and Computer Science University of Southern Denmark Odense Denmark Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Leipzig Germany

It is known that for two given secondary structures (defined by position of base pairings) an RNA string can easily be found that can fold into both structures. But for more than two secondary structures this is not necessarily possible. Moreover, when four or more secondary structures are given the problem to determine the least number of positions, such that after the removal of all incident base pairs, a compatible RNA sequence can be found, is known to be NP-complete (\cite{real_shapes}). In this paper we introduce pseudo edges that are used to forbid that certain base pairs can bind and therefore can be used to define the properties of possible RNA secondary structures. We study the complexity of the problem to design an RNA sequence that can fold into different secondary structures each of them is described by a set of required and forbidden base pairs. We refine the NP-completeness results of \cite{real_shapes} and show an analoguous NP-completeness result for the realization problem concerning the removal of (pseudo) edges. We also present a polynomial time method for checking the realizability of extended shape graphs. Furthermore, we empirically analyze the influence of pseudo edges on the realizability for sets of random RNA sequences and for sets of aptamers.

关键词： RNA Shape Switches computer science Bioinformatics Sequences systems biology Intelligent systems Biology computing Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Game theory basis for control of long-lived lunar/planetary surface robots

Game theory basis for control of long-lived lunar/planetary ...

引用

作者： Huntsberger, Terry L. Sengupta, Abhijit Jet Propulsion Laboratory 4800 Oak Grove Drive Pasadena CA 91109 Advanced Robotic Controls Group NASA's Jet Propulsion Laboratory Pasadena CA Intelligent Systems Laboratory Department of Computer Science University of South Carolina SPIE ACM IEEE Computer Society INNS Advanced Concepts and Architecture Group Jet Propulsion Laboratory Pasadena CA

Current and future NASA robotic missions to planetary surfaces are tending toward longer duration and are becoming more ambitious for rough terrain access. For a higher level of autonomy in such missions, the rovers will require behavior that must also adapt to declining health and unknown environmental conditions. The MER (Mars Exploration Rovers) called Spirit and Opportunity have both passed 600 days of life on the Martian surface, with extensions to 1000 days and beyond depending on rover health. Changes in navigational planning due to degradation of the drive motors as they reach their lifetime are currently done on Earth for the Spirit rover. The upcoming 2009 MSL (Mars science Laboratory) and 2013 AFL (Astrobiology Field Laboratory) missions are planned to last 300-500 days, and will possibly involve traverses on the order of multiple kilometers over challenging terrain. This paper presents a unified coherent framework called SMART (System for Mobility and Access to Rough Terrain) that uses game theoretical algorithms running onboard a planetary surface rover to safeguard rover health during rough terrain access. SMART treats rover motion, task planning, and resource management as a Two Person Zero Sum Game (TPZSG), where the rover is one player opposed by the other player called "nature" representing uncertainty in sensing and prediction of the internal and external environments. We also present preliminary results of some field studies.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Neurocomputation in Remote Sensing Data Analysis 1

引用

1000年

作者： Ioannis Kanellopoulos Graeme G. Wilkinson Fabio Roli James Austin

ISBN: (数字)9783642590412

ISBN: (纸本)9783540633167;9783642638282

Since 1994 the European Commission has been supporting activities under the Environment and Climate programme of research and technological de velopment, with the aim of developing cost-effective applications of satellite Earth observation (EO) for both environmental monitoring and research. This action has included support to methodological research, aimed at the development and evaluation of new techniques forming part ofthe chain of processing needed to transform data into useful information. Wherever appropriate, the Commission has emphasised the coordination of ongoing research funded at the national level, through the mechanism of concerted actions. Concerted actions are flexible and efficient means to marshal efforts at the European level for a certain period. They are proposed by groups of researchers active in a given field who have identified the added value to be gained by European cooperation, whilst continuing to pursue their own individual projects. In view of the rapid developments in the field of neural network over the last 10 years, together with the growing interest ofthe Earth observation community in this approach as a tool for data interpretation, the Commission decided in 1995 to support the concerted action COMPARES, following a proposal from a group of acknowledged European experts.

关键词： Artificial Intelligence Economic Geology Regional/Spatial science Pattern Recognition Geography, general Earth sciences, general

来源：评论

学校读者我要写书评

暂无评论

Exploring the Use of WebAssembly in HPC

arXiv

引用

arXiv 2023年

作者： Chadha, Mohak Krueger, Nils John, Jophin Jindal, Anshul Gerndt, Michael Benedict, Shajulin Chair of Computer Architecture and Parallel Systems Technische Universität München Germany Department of Computer Science and Engg. Indian Institute of Information Technology Kerala Kottayam India

Containerization approaches based on namespaces offered by the Linux kernel have seen an increasing popularity in the HPC community both as a means to isolate applications and as a format to package and distribute them. However, their adoption and usage in HPC systems faces several challenges. These include difficulties in unprivileged running and building of scientific application container images directly on HPC resources, increasing heterogeneity of HPC architectures, and access to specialized networking libraries available only on HPC systems. These challenges of container-based HPC application development closely align with the several advantages that a new universal intermediate binary format called WebAssembly (Wasm) has to offer. These include a lightweight userspace isolation mechanism and portability across operating systems and processor architectures. In this paper, we explore the usage of Wasm as a distribution format for MPI-based HPC applications. To this end, we present MPIWasm, a novel Wasm embedder for MPI-based HPC applications that enables high-performance execution of Wasm code, has low-overhead for MPI calls, and supports high-performance networking interconnects present on HPC systems. We evaluate the performance and overhead of MPIWasm on a production HPC system and AWS Graviton2 nodes using standardized HPC benchmarks. Results from our experiments demonstrate that MPIWasm delivers competitive native application performance across all scenarios. Moreover, we observe that Wasm binaries are 139.5x smaller on average as compared to the statically-linked binaries for the different standardized benchmarks. Copyright © 2023, The Authors. All rights reserved.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Fast subgraph isomorphism detection for graph-based retrieval

Fast subgraph isomorphism detection for graph-based retrieva...

引用

19th International Conference on Case-Based Reasoning, ICCBR 2011

作者： Weber, Markus Langenhan, Christoph Roth-Berghofer, Thomas Liwicki, Marcus Dengel, Andreas Petzold, Frank GmbH Trippstadter Straße 122 67663 Kaiserslautern Germany Knowledge-Based Systems Group Department of Computer Science University of Kaiserslautern P.O. Box 3049 67653 Kaiserslautern Germany Department of Architectural Informatics Faculty of Architecture Technical University of Munich Arcisstrasse 21 80333 Munich Germany Explanation-aware Computing Systems Institute of Computer Science University of Hildesheim Marienburger Platz 22 31141 Hildesheim Germany

ISBN: (纸本)9783642232909

In this paper we present a method for a graph-based retrieval and its application in architectural floor plan retrieval. The proposed method is an extension of a well-known method for subgraph matching. This extension significantly reduces the storage amount and indexing time for graphs where the nodes are labeled with a rather small amount of different classes. In order to reduce the number of possible permutations, a weight function for labeled graphs is introduced and a well-founded total order is defined on the weights of the labels. Inversions which violate the order are not allowed. A computational complexity analysis of the new preprocessing is given and its completeness is proven. Furthermore, in a number of practical experiments with randomly generated graphs the improvement of the new approach is shown. In experiments performed on random sample graphs, the number of permutations has been decreased to a fraction of 10-18 in average compared to the original approach by Messmer. This makes indexing of larger graphs feasible, allowing for fast detection of subgraphs. © 2011 Springer-Verlag.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：