ppxscal/embedding_network huggingface dataset:
Sharing Methodological Knowledge with REGAL: "Requirements Engineering Guide for All"
Authors: Laure-Helene Jean-Baptiste, Camille Salinesi, Gauthier Fanmuy
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

This paper presents a repository-based tool for sharing RE (empirical or theoretical) methodological knowledge, and improving it collaboratively. Methods are documented in our tool with methodological patterns. The originality of our tool is threefold: (i) the structure of methodological patterns can evolve, (ii) it is also possible to adapt the structure of the pattern repository, and (iii) configuration management features are proposed to enrich the content of the repository collaboratively.
A population based approach to model network lifetime in wireless sensor networks
Authors: Krishna K. Ramachandran, Biplab Sikdar
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

The physical constraints of battery-powered sensors impose limitations on their processing capacity and longetivity. As battery power in the nodes decays, certain parts of the network may become disconnected or the coverage may shrink, thereby reducing the reliability and the potency of the sensor network. Since sensor networks operate unattended and without maintainence, it is imperative that network failures are detected early enough so that corrective measures can be taken.Existing research has primarily concentrated on developing algorithms, be it distributed or centralized, to optimize network longetivity metrics. For instance, [4, 5] propose MAC layer optimizations to prolong longetivity, while [7, 6] look at the problem from a Layer 3 perspective. Works along the lines of actually building network models for energy consumption are addressed in [2], [3], but these models fail to capture the interplay between a node's spatial location and it's energy consumption.In our current work, we develop an unifying framework to characterize the lifetime of such energy constrained networks, and obtain insights into their working. In particular, we employ a framework similar to population models for biological systems, to model the network lifetime. We consider both spatial scenarios, where a node's power consumption is governed by it's position in space as well as non spatial scenarios, where the node's location and power consumption model are independent entities.
A Community Of Practice? The Toshiba Ambassador Programme in the UK
Authors: Bob Harrison
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

This paper explores the notion of Communities of Practice with reference to educationalists involved in implementing wireless and portable technologies in the UK.
Genericity and the &#x03c0;-calculus
Authors: Martin Berger, Kohei Honda, Nobuko Yoshida
Venue: Acta Informatica (2005)

Types in processes delineate specific classes of interactive behaviour in a compositional way. Key elements of process theory, in particular behavioural equivalences, are deeply affected by types, leading to applications in the description and analysis of diverse forms of computing. As one of the examples of types for processes, this paper introduces a second-order polymorphic &#x03c0;-calculus based on duality principles, building on type structures coming from typed &#x03c0;-calculi, Linear Logic and game semantics. Of various extensions of first-order typed &#x03c0;-calculi with polymorphism, the present paper focusses on the linear polymorphic &#x03c0;-calculus, extending its first-order counterpart [46]. Fundamental elements of the theory of linear polymorphic processes are studied, including establishment of their strong normalisability using Girard's &#x201c;candidates,&#x201d; introduction of a behavioural theory of polymorphic labelled transitions which strengthens Pierce-Sangiorgi's polymorphic bisimulation via duality, and a fully abstract embedding of System F in polymorphic processes, establishing a precise connection between the universe of polymorphic functions and the universe of polymorphic processes. The proof combines process-theoretic reasoning with techniques from game semantics. The abstract nature of polymorphic labelled transitions plays an essential role in full abstraction, elucidating subtle aspects of polymorphism in functions and interaction.
A Desktop 3D Scanner Exploiting Rotation and Visual Rectification of Laser Profiles
Authors: C. Colombo, D. Comanducci, A. Del Bimbo
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

We describe a low cost system for metric 3D scanning from uncalibrated images based on rotational kinematic constraints. The system is composed by a turntable, an offthe- shelf camera and a laser stripe illuminator. System operation is based on the construction of the virtual image of a surface of revolution (SOR), from which two imaged SOR cross-sections are obtained in an automatic way, and internal camera calibration is performed by exploiting the same object being scanned. Shape acquisition is finally obtained by laser profile rectification and collation. Experiments with real data are shown, providing an insight into both camera calibration and shape reconstruction performance. System accuracy appears to be adequate for desktop applications.
Proving the Safety of SQL Queries
Authors: Stefan Brass, Christian Goldberg
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Many programs need to access data in a relational database. This is usually done by means of queries written in SQL. Although the language SQL is declarative, certain runtime errors are possible. Since the occurrence of these errors depend on the data, they are not easily found during testing. The question whether a query is safe can be reduced to a consistency check. It is well known that consistency is in general undecidable, and that this applies also to SQL queries. However, in this paper, we propose a consistency check that can handle a surprisingly large subset of SQL (it uses Skolemization with sorted Skolem functions, and a few other tricks). This consistency check is also the basis for generating other semantic warnings. Furthermore, it can be used to generate test data for SQL queries.
Experimenting with Software Architecture Flexibility Using an Implementation of the Tactical Separation Assisted Flight Environment
Authors: Bettina Anders, Jorg Fellmann, Mikael Lindvall, Ioana Rus
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

At NASA, more and more functionality is implemented in software. Change requests tend to arrive late, making software flexibility an important aspect. However, such changes present a high risk and are more likely to introduce defects and to violate flexibility properties of the software, causing its "degeneration." In this paper, we present some preliminary results from a recent study of Software Architecture Flexibility. The study was conducted as an experiment with students using the TSAFE experimental testbed. The main conclusion is that constructs for flexibility are not automatically understood, used, and followed by new developers. Better ways to describe the intention with certain constructs in combination with assigning responsibility for making sure that the implementation adheres to the intended architecture and its design rationale could provide a successful approach for avoiding degeneration of built-in flexibility.
Printed Thai Character Recognition Using the Hierarchical Cross-Correlation ARTMAP
Authors: Arit Thammano, Pruegsa Duangphasuk
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Traditionally, Thai characters are composed of circle, zigzag line, curve, and head. However, many new Thai fonts, which are now gaining in popularity, do not follow the traditional writing rule; the head has been omitted from the characters. Without the head, it is very difficult to segregate the characters. Even the best commercial Thai OCR software has difficulty in recognizing this kind of character. Therefore, the hierarchical cross-correlation ARTMAP is proposed in this paper to recognize the no-head Thai characters.
Building Verification Condition Generators by Compositional Extensions
Authors: I. S. W. B. Prasetya, A. Azurat, T. E. J. Vos, A. Van Leeuwen
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

This paper describes a technique that combines algebraic datatypes and monads to build derivative verification condition generators (VCGs) by extending a base VCG. Extensions are compositional and can be stacked while the base VCG is left unchanged. The technique can be used to build a set of weaker VCGs to do light weight verification. Moreover, it enables us to add an ability to generate validation traces. The paper explains the technique through an example that extends a simple language L0 with new constructs to handle exceptions. To deal with exceptions, not only the logic of L0 has to be extended with new rules, its structure also needs to be changed. We show that using our technique the extension can be implemented in a simple and compositional way, without any change to the underlying logic.
Improved Thermal Management with Reliability Banking
Authors: Zhijian Lu, John Lach, Mircea R. Stan, Kevin Skadron
Venue: IEEE Micro (2005)

Most existing integrated circuit (IC) reliability models assume a uniform, typically worst-case, operating temperature, but temporal and spatial temperature variations affect expected device lifetime. As a result, design decisions and dynamic thermal management (DTM) techniques using worst-case models are pessimistic and result in excessive design margins and unnecessary runtime engagement of cooling mechanisms (and associated performance penalties). By leveraging a reliability model that accounts for temperature gradients (dramatically improving interconnect lifetime prediction accuracy) and modeling expected lifetime as a resource that is consumed over time at a temperature-and voltage-dependent rate, substantial design margin can be reclaimed and runtime penalties avoided while meeting expected lifetime requirements. In this paper, we evaluate the potential benefits and implementations of this technique by tracking the expected lifetime of a system under different workloads while accounting for the impact of dynamic voltage and temperature variations. Simulation results show that our dynamic reliability management (DRM) techniques provide a 40% performance penalty reduction over that incurred by pessimistic DTM in general-purpose computing and a 10% increase in quality of service (QoS) for servers, all while preserving the expected IC lifetime reliability.
BRDF-Shop: Creating Physically Correct Bidirectional Reflectance Distribution Functions
Authors: Mark Colbert, Sumanta Pattanaik, Jaroslav Krivanek
Venue: IEEE Computer Graphics and Applications (2006)

This articles presents an interface for quick and intuitive development of arbitrary, but physically correct, bidirectional reflectance distribution functions, or BRDFs. The interface, referred to as BRDF-Shop, gives artists the ability to create a BRDF through positioning and manipulating highlights on a spherical canvas. The authors develop a novel mapping between painted highlights and specular lobes of an extended Ward BRDF model. The implementation of BRDF Shop uses programmable graphics hardware to provide a real-time visualization of the material on a complex object in environment lighting.
On Convergence of the Additive Schwarz Preconditioned Inexact Newton Method
Authors: Heng-Bin An
Venue: SIAM Journal on Numerical Analysis (2005)

The additive Schwarz preconditioned inexact Newton (ASPIN) method was recently introduced [X.-C. Cai and D. E.\ Keyes, {\it SIAM J. Sci.\ Comput.}, 24 (2002), pp. 183--200] to solve the systems of nonlinear equations with nonbalanced nonlinearities. Although the ASPIN method has successfully been used to solve some difficult nonlinear equations, its convergence property has not been studied since it was proposed. In this paper, the convergence property of the ASPIN method is studied, and the obtained result shows that this method is locally convergent. Furthermore, the convergence rate for the ASPIN method is discussed and the obtained result is similar to that of the inexact Newton method.
Application-specific buffer space allocation for networks-on-chip router design
Authors: Jingcao Hu, R. Marculescu
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

We present a system-level buffer planning algorithm that can be used to customize the router design in networks-on-chip (NoCs). More precisely, given the traffic characteristics of the target application and the buffering space budget, our algorithm automatically assigns the buffer depth for each input channel, in different routers across the chip, to match the communication pattern, such that the overall performance is maximized. This is in deep contrast with the uniform assignment of buffering resources (currently used in NoC design) which can significantly degrade the overall system performance. For instance, for a complex audio/video application, about 85% savings in buffering resources can be achieved by smart buffer allocation using our algorithm without any reduction in performance.
An simple and efficient fault tolerance mechanism for divide-and-conquer systems
Authors: G. Wrzesinska, R. V. van Nieuwpoort, J. Maassen, H. E. Bal
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Summary form only given. We study if fault tolerance can be made simpler and more efficient by exploiting the structure of the application. More specifically, we study divide-and-conquer parallelism, which is a popular and effective paradigm for writing parallel Grid applications. We have designed a novel fault tolerance mechanism for divide-and-conquer applications that reduces the amount of redundant computation by storing results of the discarded in a global (replicated) table. These results can later be reused, thereby minimizing the amount of work lost as a result of a crash. The execution time overhead of our mechanism is close to zero. Our mechanism can handle crashes of multiple processors or entire clusters at the same time.. It can also handle crashes of the root node that initially started the parallel computation. We have incorporated our fault tolerance mechanism in Satin, which is a Java-based divide-and-conquer system. Satin is implemented on top of the Ibis communication library. The core of Ibis is implemented in pure Java, without using any native libraries. The Satin runtime system and our fault tolerance extension also are written entirely in Java. The resulting system therefore is highly portable allowing the software to run unmodified on a heterogeneous Grid. We evaluated the performance of our fault tolerance scheme on a cluster of the Distributed ASCI Supercomputer 2 (DAS-2). In the first part of our tests, we show that the execution time overhead of our mechanism is close to zero. The results of the second part of our tests show that our algorithm salvages most of the work done by alive processors. Finally, we carried out tests on the European GridLab testbed. We ran one of our applications on a set of six heterogeneous parallel machines (four different operating systems, four different architectures) located in four different European countries. After manually killing one of the sites, the program recovered and finished normally.
Design and Evaluation of a Decentralized System for Grid-wide Fairshare Scheduling
Authors: Erik Elmroth, Peter Gardfjall
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

This contribution presents a decentralized architecture for a Grid-wide fairshare scheduling system and demonstrates its potential in a simulated environment. The system, which preserves local site autonomy, enforces locally and globally scoped share policies, allowing local resource capacity as well as global Grid capacity to be logically divided across different groups of users. The policy model is hierarchical and subpolicy definition can be delegated so that, e.g., a VO that has been granted a resource share can partition its share across its projects, which in turn can divide their shares between project members. There is no need for a central coordinator as policies are enforced collectively by the resource schedulers. Each local scheduler adopts a Grid-wide view on utilization in order to steer local resource utilization to not only maintain local resource shares but also to contribute to maintaining global shares across the entire set of Grid resources. Share enforcement is addressed by an algorithm that calculates simple priority values, thus simplifying integration with local schedulers, which can remain unaware of the hierarchical share policy structure.
A Form Dropout Method based on Line-elimination and Image-subtraction
Authors: Yoshihiro Shima, Hiroshi Ohya, Michio Yasuda
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A method of preprint elimination for form images is proposed. Form images have fixed parts, such as character strings and lines. These fixed parts are called as preprint, which are not used for data entry. This dropout method is based on image subtraction and line elimination for distorted images. The location, rotation and magnification are modified for distorted form images.Character patterns and short ruled lines are eliminated by subtraction of bitmap template images. Long ruled lines are extracted and directly eliminated by using run data.
A Resampling Test for the Total Independence of Stationary Time Series: Application to the Performance Evaluation of ICA Algorithms
Authors: Juha Karvanen
Venue: Neural Processing Letters (2005)

This paper addresses the independence testing of stationary time series. We develop a resampling test based on the Kankainen---Ushakov test of total independence. The resampling test, contrary to the original test, can be also applied to the data with a time-structure. The simulation studies demonstrate the good performance of the proposed test even with strongly autocorrelated time series. As an application, we consider biomedical signal processing and independent component analysis (ICA). The independence test can be used as a performance criterion for ICA algorithms. The practical example of performance evaluation deals with the ICA of electroencephalogram (EEG) data.
Comparative study of monolingual and multilingual search models for use with asian languages
Authors: Jacques Savoy
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2005)

Based on the NTCIR-4 test-collection, our first objective is to present an overview of the retrieval effectiveness of nine vector-space and two probabilistic models that perform monolingual searches in the Chinese, Japanese, Korean, and English languages. Our second goal is to analyze the relative merits of the various automated and freely available toolsto translate the English-language topics into Chinese, Japanese, or Korean, and then submit the resultant query in order to retrieve pertinent documents written in one of the three Asian languages. We also demonstrate how bilingual searches could be improved by applying both the combined query translation strategies and data-fusion approaches. Finally, we address basic problems related to multilingual searches, in which queries written in English are used to search documents written in the English, Chinese, Japanese, and Korean languages.
A Wideband Frequency-Shift Keying Demodulator for Wireless Neural Stimulation Microsystems
Authors: Mian Dong, Chun Zhang, Songping Mai, Zhihua Wang, Dongmei Li
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper presents a wideband frequency-shift keying (FSK) demodulator which is suitable for a digital data transmission chain of wireless neural stimulation microsystems such as cochlear implants and retinal prostheses. The demodulator circuit derives a constant frequency clock directly from a FSK carrier, and uses this clock to sample the data bits. The circuit occupies 0.03 mm2 in a 0.6 µm, 2M/2P, standard CMOS process, and consumes 0.25mW at 5V. This demodulator circuit is experimentally tested at the transmission speed up to 2.5Mbps while receiving a 5/10 MHz FSK carrier signal in a cochlear implant system.
Computer-assisted modeling and simulation for time oriented systems
Authors: Johannes Retti
Venue: ACM SIGSIM Simulation Digest (1982)

Most simulation systems are able to cope with large 'white box' problems, but their application proves to be difficult in case of 'grey box' and 'black box' problems in the social sciences. Even recently developed interactive tools for simulation and structural modeling cannot manage large scale models without difficulties. A computer-aided method is missing for the modeling and simulation of large-scale real-world problems. At the Department of Medical Cybernetics of the University of Vienna Medical School simulation languages and 'modeling tools' are applied in different non-technical fields. First our experience with four systems (CSMP, QSIM3, SPIN, SISSY) is described. A methodological concept is presented for computer-assisted modeling and simulation of time oriented systems. It provides among other features: user defined types of structural elements and relations by means of a meta-definition language; relational networks for the structural representation; defined interfaces between structural representation and processes; support of top-down and bottom-up approaches by incorporation of ordering relationships within the model entities; communication, useability and documentation for the novice and advanced modeler. The aim of the proposed new system is to encourage experimental modeling and simulation of comlex real world problems and to gain an appropriate level of detail. The concepts for the realization are presented.
REPARE: The Requirements Engineering Patterns Repository
Authors: Lars Hagge, Kathrin Lappe, Tobias Schmidt
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

REPARE, a Web-based RE pattern repository, is being developed as a platform for RE knowledge transfer. The repository aims at making good RE practices available for project teams on the job. It targets practitioners from small and medium organizations without dedicated RE resources. The paper exemplifies the improved accessibility of RE experience through the repository.
An introduction to CAPS: computer-aided programming for simulation
Authors: G. K. Hutchinson
Venue: ACM SIGSIM Simulation Digest (1975)

This paper describes CAPS, a simulation system which enables an analyst without programming experience to quickly produce (in hours) guaranteed executable programs through the use of an interactive dialog. The result is a substantial reduction in both time and effort from the point of problem definition to the availability of model output for decision making. CAPS was developed by Dr. A. T. Clementson of the University of Birmingham and this paper draws heavily upon his work. (See Ref. 1) The user dialog with CAPS is described and examples of the ease of use are given, including an actual model.