ppxscal/embedding_network huggingface dataset:
Cost Reduction in High Power Computing Using a Deferred Repair Strategy: A Simulation Study
Authors: Altan Koçyigit, Orhan Gemikonakli, Enver Ever
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Fault-tolerant systems with repair-upon-failure strategy can become expensive in terms of labour and time. Especially for homogeneous multi-server systems, if no control hierarchy exists, postponing non essential repairs can reduce these costs without affecting the availability of the whole system significantly. Of course, while postponing these repairs, it is essential to keep the whole system capable to deal with user requests. For this purpose, usually, a threshold value is defined which represents the minimum number of servers the system administrator should keep operative. Performability evaluation of such systems is very important since the systems are fault tolerant. In this paper, the simulation of large scale multi-server systems, with identical servers, serving a stream of arriving jobs is considered. The cost of running such systems with various deferred repair strategies has been calculated and compared to the cost of using a repair-upon failure strategy.
Enterprise Master Data Management: An SOA Approach to Managing Core Information, 1 edition
Authors: Allen Dreibelbis, Eberhard Hechler, Ivan Milman, Martin Oberhofer, Paul van Run, Dan Wolfson
Venue:  (2008)

The Only Complete Technical Primer for MDM Planners, Architects, and ImplementersCompanies moving toward flexible SOA architectures often face difficult information management and integration challenges. The master data they rely on is often stored and managed in ways that are redundant, inconsistent, inaccessible, non-standardized, and poorly governed. Using Master Data Management (MDM), organizations can regain control of their master data, improve corresponding business processes, and maximize its value in SOA environments.Enterprise Master Data Management provides an authoritative, vendor-independent MDM technical reference for practitioners: architects, technical analysts, consultants, solution designers, and senior IT decisionmakers. Written by the IBM data management innovators who are pioneering MDM, this book systematically introduces MDMs key concepts and technical themes, explains its business case, and illuminates how it interrelates with and enables SOA.Drawing on their experience with cutting-edge projects, the authors introduce MDM patterns, blueprints, solutions, and best practices published nowhere elseeverything you need to establish a consistent, manageable set of master data, and use it for competitive advantage.Coverage includesHow MDM and SOA complement each otherUsing the MDM Reference Architecture to position and design MDM solutions within an enterpriseAssessing the value and risks to master data and applying the right security controlsUsing PIM-MDM and CDI-MDM Solution Blueprints to address industry-specific information management challengesExplaining MDM patterns as enablers to accelerate consistent MDM deploymentsIncorporating MDM solutions into existing IT landscapes via MDM Integration BlueprintsLeveraging master data as an enterprise assetbringing people, processes, and technology together with MDM and data governanceBest practices in MDM deployment, including data warehouse and SAP integration
Evolutionary functional testing
Authors: Oliver Bühler, Joachim Wegener
Venue: Computers and Operations Research (2008)

The development and testing of software-based systems is an essential activity for the automotive industry. The 50-70 software-based systems with different complexities and developed by various suppliers are installed in today's premium vehicles, communicating with each other via different bus systems. The integration and testing of systems of this complexity is a very challenging task. The aim of testing is to detect faults in the systems under test and to convey confidence in the correct functioning of the systems if no faults are found during comprehensive testing. Faults not found in the different testing phases could have significant consequences that range from customer dissatisfaction to damage of physical property or, in safety-relevant areas, even to the endangering of human lives. Therefore, the thorough testing of developed systems is essential. Evolutionary testing tries to improve the effectiveness and efficiency of the testing process by transforming testing objectives into search problems, and applying evolutionary computation in order to solve them. The most important class of testing methods is functional testing. However, functional testing is difficult to automate by evolutionary testing. This work will describe how evolutionary testing could be applied to automate functional testing in general and the testing of complex automotive systems in particular. It presents two case studies and shows how evolutionary testing is effective at finding faults in the functional behaviour of these systems. In addition, a quantitative comparison with manual and random test case selection is done for one application.
SEMI-AUTOMATED ANNOTATION AND RETRIEVAL OF DANCE MEDIA OBJECTS
Authors: Balakrishnan Ramadoss, Kannan Rajkumar
Venue: Cybernetics and Systems (2007)

This article considers a system for the semiautomatic annotation of an audio-visual media of dance domain, DMAR (Dance Media Annotation, authoring and Retrieval system). We present the architecture of the system, a manual annotation tool, a semiautomatic authoring tool and a search engine for the choreographers, dancers and students to demonstrate how the dance media can be semantically annotated and how this information can be used for the retrieval of the dance media objects. This article then outlines the underlying XML Schema based content description structures of DMAR and discusses the merits and demerits of our approach of evolving semantic network as the basis for the audio-visual content description. Further, this article proposes a quality metric, fidelity to evaluate the expressive power of the dance annotations. Finally, evaluation results are presented to depict the performance of the dance video queries in terms of precision and recall.
Collaborative information retrieval
Authors: Jeremy Pickens, Gene Golovchinsky, Meredith Ringel Morris
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The goal of the workshop is to bring together researchers interested in various aspects of small-team collaborative search to share ideas, to stimulate research in the area, and to increase the visibility of this emerging area. We expect to identify promising directions for further exploration and to establish collaborative links among research groups.
ARM and Intel Battle over the Mobile Chip's Future
Authors: Brad Smith
Venue: Computer (2008)

ARM and its partners are trying to build more powerful handheld computing devices, while Intel is trying to make a handheld PC based on the company's x86 architecture.
Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter
Authors: S. Istrail
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A generalized version of universal traversing sequences is constructed. The generalization preserves the features of the universal traversing sequences that make them attractive for applications to derandomizations and space-bounded computation. For every n, there is constructed a sequence that is used by a finite automaton with O(1) states in order to traverse all the n-vertex labeled undirected graphs. The automaton walks on the graph; when it is at a certain vertex, it uses the edge labels and the sequence in order to decide which edge to follow. When it is walking on an edge, the automaton can see the edge labeling. As a corollary, polynomial-size generalized universal traversing sequences constructible in DSpace(log n) are obtained for certain classes of graphs.
Releasing the power of digital metadata: examining large networks of co-related publications
Authors: David Tarrant, Les Carr, Terry Payne
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Bibliographic metadata plays a key role in scientific literature, not only to summarise and establish the facts of the publication record, but also to track citations between publications and hence to establish the impact of individual articles within the literature. Commercial secondary publishers have typically taken on the role of rekeying, mining and analysing this huge corpus of linked data, but as the primary literature has moved to the world of the digital repository, this task is now undertaken by new services such as Citeseer, Citebase or Google Scholar. As institutional and subject-based repositories proliferate and Open Access mandates increase, more of the literature will become openly available in well managed data islands containing a much greater amount of detailed bibliometric metadata in formats such as RDF. Through the use of efficient extraction and inference techniques, complex relations between data items can be established. In this paper we explain the importance of the co-relation in enabling new techniques to rate the impact of a paper or author within a large corpus of publications.
Path specialization: reducing phased execution overheads
Authors: Filip Pizlo, Erez Petrank, Bjarne Steensgaard
Venue: Proceedings of the 7th international symposium on Memory management (2008)

As garbage collected languages become widely used, the quest for reducing collection overheads becomes essential. In this paper, we propose a compiler optimization called path specialization that shrinks the cost of memory barriers for a wide variety of garbage collectors including concurrent, incremental, and real-time collectors. Path specialization provides a non-trivial decrease in write-barrier overheads and a drastic reduction of read-barrier overheads. It is effective when used with collectors that go through various phases each employing a different barrier behavior, and is most effective for collectors that have an idle phase, in which no barrier activity is required. We have implemented path specialization in the Bartok compiler and runtime for C# and tested it with state-of-the-art concurrent and real-time collectors, demonstrating its efficacy.
Efficient and Secure Content Processing and Distribution by Cooperative Intermediaries
Authors: Yunhua Koglin, Danfeng Yao, Elisa Bertino
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Content services such as content filtering and transcoding, adapt contents to meet system requirements, display capacities, or user preferences. Data security in such a framework is an important problem, and crucial for many web applications. In this paper, we propose an approach that addresses data integrity and confidentiality in content adaptation and caching by intermediaries. Our approach permits multiple intermediaries to simultaneously perform content services on different portions of the data. Our protocol supports decentralized proxy and key managements and flexible delegation of services. Our experimental results show that our approach is efficient and minimizes the amount of data transmitted across the network.
Towards a theory of schema-mapping optimization
Authors: Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Lucian Popa
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data exchange and data integration, an extensive investigation of the foundations of schema mappings has been carried out in recent years. Even though several different aspects of schema mappings have been explored in considerable depth, the study of schema-mapping optimization remains largely uncharted territory to date. In this paper, we lay the foundation for the development of a theory of schema-mapping optimization. Since schema mappings are constructs that live at the logical level of information integration systems, the first step is to introduce concepts and to develop techniques for transforming schema mappings to "equivalent" ones that are more manageable from the standpoint of data exchange or of some other data interoperability task. In turn, this has to start by introducing and studying suitable notions of "equivalence" between schema mappings. To this effect, we introduce the concept of data-exchange equivalence and the concept of conjunctive-query equivalence. These two concepts of equivalence are natural relaxations of the classical notion of logical equivalence; the first captures indistinguishability for data-exchange purposes, while the second captures indistinguishability for conjunctive-query-answering purposes. Moreover, they coincide with logical equivalence on schema mappings specified by source-to-target tuple-generating dependencies (s-t tgds), but differ on richer classes of dependencies, such as second-order tuple-generating dependencies (SO tgds) and sets of s-t tgds and target tuple-generating dependencies (target tgds). After exploring the basic properties of these three notions of equivalence between schema mappings, we focus on the following question: under what conditions is a schema mapping conjunctive-query equivalent to a schema mapping specified by a finite set of s-t tgds? We answer this question by obtaining complete characterizations for schema mappings that are specified by an SO tgd and for schema mappings that are specified by a finite set of s-t tgds and target tgds, and have terminating chase. These characterizations involve boundedness properties of the cores of universal solutions.
Primary Study on Dielectric Property Detection for Cerebral Haematoma
Authors: Wang Chao, Zhang Ming, Wang Xiang-yu, Wu Dong-yue, Wang Hua-xiang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

It’s found that the distinction of permittivity of different tissues is more obvious, according to analyzing the changing regularity of the conductivity and permittivity of the head tissue at different frequency. A capacitance measuring method based on dielectric property is presented, which aims at detecting the haematoma as well as its development expediently. According to the head structure, a multi-layer head model is built up with ANSYS analysis software. The different states of haematoma such as the position, size and the extent of approaching the measuring electrode are analyzed in two-dimension model. The feasibility of the measurement is proved.
PKM: knowledge management tool for environments centered on the concept of the experience factory
Authors: Emanuele Danovaro, Tadas Remencius, Alberto Sillitti, Giancarlo Succi
Venue: Companion of the 30th international conference on Software engineering (2008)

This paper presents PKM - a web-based tool for knowledge management in an environment centered on the concept of the experience factory. The tool focuses on managing explicit knowledge, most of which is collected in an automated way using non-invasive plug-ins and probes. It provides customizable metric views, metric interpretation and abstraction capabilities, helps in extraction and evaluation of metric progress models.
Intradisciplinary differences in database coverage and the consequences for bibliometric research
Authors: Tove Faber Frandsen, Jeppe Nicolaisen
Venue: Journal of the American Society for Information Science and Technology (2008)

Bibliographic databases (including databases based on open access) are routinely used for bibliometric research. The value of a specific database depends to a large extent on the coverage of the discipline(s) under study. A number of studies have determined the coverage of databases in specific disciplines focusing on interdisciplinary differences; however, little is known about the potential existence of intradisciplinary differences in database coverage. Focusing on intradisciplinary differences, the article documents large database-coverage differences within two disciplines (economics and psychology). The point extends to include both the uneven coverage of specialties and research traditions. The implications for bibliometric research are discussed, and precautions which need to be taken are outlined. &copy; 2008 Wiley Periodicals, Inc.
The Effect of Pairs in Program Design Tasks
Authors: Kim Man Lui, Keith C. C. Chan, John Nosek
Venue: IEEE Transactions on Software Engineering (2008)

Pair programming consists of two developers who collaborate with each other on the same programming task to design and code a solution. Previous pair programming experiments did not explore the efficacy of pairs in program design separately from coding, and most suffered from using students who were not full-time, professional programmers. Aptitude tests relevant to program design tasks have been shown to correlate with future programming performance and do not require skill in a particular computer language. Variations in programmer skill in a particular language or integrated development environment can interfere with interpreting results in pair programming experiments and mask the skill of subjects in program design related tasks. Two experiments were conducted with full-time professional programmers as subjects who worked on increasingly complex aptitude tasks related to problem solving and algorithmic design. In both experiments, pairs significantly outperformed solos, providing evidence of the value of pairs in program design related tasks.
Carleman estimates for the Lamé system with stress boundary condition
Authors: Oleg Yu. Imanuvilov, Masahiro Yamamoto
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

In this paper, for functions without compact supports, we established Carleman estimates for the two-dimensional non-stationary Lamé system with the stress boundary condition.
Comparing different approaches for solving optimizing models with significant nonlinearities
Authors: Peter J. Stemp, Ric D. Herbert
Venue: Mathematics and Computers in Simulation (2008)

The property of saddle-path instability often arises in economic models derived from optimizing behavior by individual agents. In the case when underlying functional forms are nonlinear, it is likely that the stable and unstable arms defining the saddle-path dynamics will also have nonlinear properties. While closed-form analytic solutions can always be derived for linearized deterministic versions of these models, it will be necessary to use numerical techniques to derive the dynamic properties of calibrated versions of the associated nonlinear models. There are a range of different approaches by which it is possible to solve the dynamics of nonlinear models with the saddle-path property. Alternative solution methods using numerical techniques are discussed. In all cases, the success of the solution can be assessed by evaluating whether or not the chosen solution gives a time-path for each variable that goes from the chosen initial condition to (a small neighborhood of) the steady-state. Unfortunately, however, there is generally no way of evaluating whether intermediate points on the path between the initial condition and the steady-state are close approximations to the ''true'' solution. In order to evaluate the ''goodness-of-fit'' along the entire dynamic path, it is necessary to have a closed-form solution of the entire solution path. This can only be achieved in special cases. For one special case, we demonstrate how it is possible to construct a model with complex-valued eigenvalues with large imaginary parts and hence significant cycles. Such a model can be employed as a benchmark to compare the properties of solutions derived using a range of solution algorithms.
Debugging Distributed-Shared-Memory Communication at Multiple Granularities in Networks on Chip
Authors: Bart Vermeulen, Kees Goossens, Siddharth Umrani
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

We present a methodology to debug a SOC by concentrating on its communication. Our extended communication model includes a) multiple signal groups per interface protocol at each IP port, b) the handshakes per signal group (e.g. for command), and c) the handshakes within a signal group (e.g. for write and read data elements). As a result, our debug methodology is the first to offer debug control at three communication granularities: individual data elements in a message, messages (i.e. requests or responses), and entire transactions. Communication to distributed shared memories is supported in networks on chip (NOC) by transparently (de)multiplexing different master-slave channels based on the memory address, also called narrowcast. In this paper, we extend previous work on NOC debug that allowed per-connection debug (i.e. a master without differentiating between its slaves) to also support per-channel (i.e. per master-slave pair) debugging, also for narrowcast connections. This enables essential fine-grained debug control for multi-processor SOCs that use distributed-shared-memory communication. The debug infrastructure consists of hardware components, and a software API and library. We define the hard-ware infrastructure and the required changes to a NOC. Our architecture cleanly separates the monitoring and distribution of events from how they are interpreted and used, in terms of hardware and programming. We define a high-level software API for run-time user control. The debug methodology offers run-time programmable breakpoints, stopping, continuing, and single-stepping of distributed-shared memory communication at three granularities, at the cost of 2.5% NOC area increase and no speed penalty.
A Constraint-Based Autonomous 3D Camera System
Authors: Owen Bourne, Abdul Sattar, Scott Goodwin
Venue: Constraints (2008)

Camera control techniques for interactive digital entertainment (IDE) are reaching their limits in terms of capabilities. To enable future growth, new methods must be derived to address these new challenges. Existing academic research into camera control is typically devoted to cinematography and guided exploration tasks, and is not directly applicable to IDE. This paper describes a novel application of constraint satisfaction in the design of a camera system that addresses the unique and difficult challenges of IDE. It demonstrates a specialized constraint solver that exploits the spatial structure of the problem, enabling the real-time use of the camera system. The merit of our solution is highlighted by demonstrating the computational efficiency and ability to extend the cameras capabilities in a simple and effective manner.
Fourth-order two-step iterative methods for determining multiple zeros of non-linear equations
Authors: N. A. Mir, Naila Rafiq
Venue: International Journal of Computer Mathematics (2007)

In this paper, we describe and analyse two two-step iterative methods for finding multiple zeros of non-linear equations. We prove that the methods have fourth-order convergence. The methods calculate the multiple zeros with high accuracy. These are the first two-step multiple zero finding methods. The numerical tests show their better performance in the case of algebraic as well as non-algebraic equations