ppxscal/embedding_network huggingface dataset:
Evaluation of Non-Quasi-Static Effects during SEU in Deep-Submicron MOS Devices and Circuits
Authors: Palkesh Jain, D. V. Kumar, J. M. Vasi, M. B. Patil
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this paper, for the first time, we analyze non-quasistatic (NQS) effects during single-event upsets (SEUs) in deep-submicron (DSM) MOS devices, using extensive 2D device, BSIM4 and Look-Up Table (LUT) simulations. We know that even for DSM transistors and circuits, the quasi-static approximation is valid for most digital applications. However, a single-event particle strike in a memory cell is capable of causing NQS effects which can result in erroneous logic-state prediction. The anomalous effect is attributed to the fast-varying transient (produced during particle-strike), which is able to initiate NQS effects in the transistors of the memory cell. Thus, it becomes important for a circuit designer to incorporate NQS effects during SEU simulation.
Graphical simulation of the dynamic evolution of the software architectures specified in Z
Authors: Riadh Ben Halima, Mohamed Jmaiel, Khalil Drira
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

This paper provides a graphical simulator that enables to apprehend the dynamic of components-based software architectures based on their formal specification. The simulator initially accepts (as an input) an already validated Z specification using the Z/EVES tool. Then, it generates graphical entities, according to the UML notation, representing software's components and their connectors. Thereafter, the user may generate architecture instances by adding components and connections between them. Architecture instances can be updated by destroying components/ connections or by modifying their interconnections. The user actions are checked through the formal specification of the architectural style.
Multi-template GAT Correlation for Character Recognition with a Limited Quantity of Data
Authors: Toru Wakahara
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper addresses the problem of how to construct a robust character classifier when statistical pattern recognition techniques fail because of a limited quantity of data. The key ideas are two ways. One is to adopt a distortion-tolerant shape matching technique. Here, we use an affine-invariant matching technique of global affine transformation (GAT) correlation to absorb linear distortion between grayscale images. The other is to prepare multiple templates for dealing with nonlinear distortion or topologically different shapes. For this purpose K-means clustering is applied to a given limited data in a simple gradient feature space. Recognition experiments using the handwritten numeral database IPTP CDROM1B show that the proposed method achieves a much higher recognition rate of 97.2% as compared to that of 85.8% obtained by the conventional, simple correlation matching with a single template per category.
Implementation and Verification of Implicit-Invocation Systems Using Source Transformation
Authors: Hongyu Zhang, Jeremy S. Bradbury, James R. Cordy, Juergen Dingel
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

In this paper we present a source transformation-based framework to support uniform testing and model checking of implicit-invocation software systems. The framework includes a new domain-specific programming language, the Implicit-Invocation Language (IIL), explicitly designed for directly expressing implicit-invocation software systems, and a set of formal rule-based source transformation tools that allow automatic generation of both executable and formal verification artifacts. We provide details of these transformation tools, evaluate the framework in practice, and discuss the benefits of formal automatic transformation in this context. Our approach is designed not only to advance the stateof- the-art in validating implicit-invocation systems, but also to further explore the use of automated source transformation as a uniform vehicle to assist in the implementation, validation and verification of programming languages and software systems in general.
Software certificate management (SoftCeMent'05)
Authors: Ewen Denney, Bernd Fischer, Dieter Hutter, Mark Jones
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

The goal of this workshop is to explore new technologies, underlying principles, and general methodologies for supporting software certificate management. Software certification demonstrates the reliability, safety, or security of software systems in such a way that it can be checked by an independent authority with minimal trust in the techniques and tools used in the certification process itself. It can build on existing validation and verification (V&V) techniques but introduces the notion of explicit software certificates, which contain all the information necessary for an independent assessment of the demonstrated properties. Software certificates support a product-oriented assurance approach, combining different techniques and forms of evidence (e.g., fault trees, "sign-offs", safety cases, formal proofs, ...) and linking them to the details of the underlying software. A software certificate management system provides the infrastructure to create, maintain, and analyze software certificates. It combines functionalities of a database (e.g., storing and retrieving certificates) and a make-tool (e.g., incremental re-certification). It can also maintain links between system artifacts (e.g., design documents, engineering data sets, or programs) and different varieties of certificates, check the validity of certificates, provide access to explicit audit trails, enable browsing of certification histories, and enforce system-wide certification and release policies. It can at any time provide current information about the certification status of each component in the system, check whether certificates have been audited, compute which certificates remain valid after a system modification, or even automatically start an incremental recertification.
Filtering Features for a Composite Event Definition Language
Authors: Susan D. Urban, Ingrid Biswas, Suzanne W. Dietrich
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

This research has enhanced a distributed, rule-based application integration environment with a composite event definition language (CEDL) and detection system. CEDL builds on existing composite event operators and selection modes, adding features to support the filtering of primitive and composite events. The filtering features include basic parameter filtering on primitive and composite events, aggregate and quantifier filters on cumulative event parameters, and time filters for defining the lifetime of the composite event detection process. This paper presents examples of CEDL, illustrating the expression of application-oriented events through the aggregation and correlation of distributed events.
A learning-based model in clickstream-based collaborative filtering
Authors: Dong-Ho Kim
Venue:  (2005)

Clickstream-based Collaborative Filtering (CCF) is an area that has been well studied in research and widely adopted in industry due to its scalability. The commonly used prediction models for CCF are Markov models, sequential association rules, association rules, and clustering. These models have shown varying performance depending on the data set used and/or the parameters such as number of pages (or items) in recommendation, window size, minimum confidence and support. In order to increase recommendation effectiveness by addressing the trade-off relationship between precision and recall, some studies have combined two or more different models or applied multiorder models. The increase of recommendation effectiveness by these models, however, is at best marginal in that they mainly focus on precision and there is room for improving recall because of their first order (one model type) application. To increase recall while minimizing the loss of precision and therefore to increase overall performance, measured by the F value, we build a sequentially applied model (SAM) applying the individual models in an order determined through a learning process. We evaluate SAM over the individual models with both an objective measure and a subjective measure. For the objective measure, we tested SAM with the log data of several sites and it shows that SAM excels in the performance of recall and the F measure over the individual models, while its precision is comparable to the highest precision from the models. The subjective measure also shows that SAM is preferred to a model with the highest precision. With the individual models and SAM, we propose also a novel model integration scheme (MIS) where a user selectively chooses a model, either an individual model or SAM, based on the user's utility function. The scheme MIS is open to any current and future optimized individual models so that they can be readily plugged into the scheme. The scheme is embodied into lookup tables in a batch process for efficient real-time recommendation.
Operational Semantics of Ambient Calculus
Authors: Zhang Jing, Jin Ying, Guo De-Gui, Liu Lei, Jin Cheng-Zhi
Venue: Proceedings of the IEEE International Workshop (2005)

Mobile ambients is a process calculus for modeling mobile agents in wide-area networks. It has important theoretical and practical values in studying concurrent and mobile computation as well as the security of interactive systems. In this paper a frame structure is given for Mobile Ambients. First we introduce the concept of ambient calculus frame. Then we propose a construction method for translating an ambient definition into the frame definition, a transformation function is given based on the method. Next the movement and interaction of the code are discussed based on the frame structure.Finally an operating semantics is developed basing on the frame structure, an example of a frame and its execution are given. Introducing frame structure for ambient calculus is an attempt to provide languages support for asynchronous, distributed, and mobile programming. The ideas and methods in this paper can also be applied to other calculi with concurrency and mobility.
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems
Authors: Sanjoy Baruah, Nathan Fisher
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst-case performance is provided in terms of resource augmentation: it is shown that any set of sporadic tasks that can be partitioned among the processors of an m-processor identical multiprocessor platform will be partitioned by this algorithm on an m-processor platform in which each processor is (4 - 2/m) times as fast.
Closed-Loop Driver/Vehicle Model for Automotive Control
Authors: T. A. Wenzel, K. J. Burnham, R. A. Williams, M. V. Blundell
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

This paper demonstrates the implementation of a comprehensive vehicle model combined with a driver model in closed loop for the purpose of developing and testing of vehicle stability systems. As an example of such a stability system a model of an active front steering controller is considered. The operation of this controller is based on vehicle states available my means of a state estimator. The functional efficiency of these combined models is demonstrated using a double-lane change manoeuvre. The use of the stability controller shows clear improvement in terms of the vehicle dynamical stability.
Leveraging the subtleties of location
Authors: Simon Dobson
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Virtually all pervasive computing systems use location as a major parameter governing their behaviour. Simple models of location ignore the richness that arises from humans' perception of location which - if leveraged - can greatly improve a system's ability to reason with location information. We explore how this richness arises, how it can be used to improve reasoning, and the challenges that this gives rise to.
Tuk-tuk: a unified account of similarity judgment and analogical mapping
Authors: Levi Benjamin Larkey
Venue:  (2005)

While similarity and analogy have traditionally been viewed as involving distinct psychological processes, the thesis of this dissertation is that similarity and analogy invoke the same mapping process. This thesis is supported by a growing body of evidence (Markman Gentner, 1993a, 1993b, 1996; Gentner Markman, 1997; Goldstone, 1994; Goldstone Medin, 1994; Larkey Markman; 2004). The main contribution of this dissertation is a unified account of similarity judgment and analogical mapping. This account is instantiated as Tuk-Tuk, a localist connectionist model of similarity and analogy that determines a mapping between representations via a dynamic process of interactive activation among feature, object, and relation correspondences. Tuk-Tuk differs from extant models of similarity and analogy in its ability to account for both patterns of similarity ratings and benchmark phenomena of analogy. In this dissertation, T'uk-Tuk's performance is tested and contrasted with other models using a broad set of simulations, including simulations of a behavioral study of my own design.
Statistical audio watermarking algorithm based on perceptual analysis
Authors: Xiaomei Quan, Hongbin Zhang
Venue: Proceedings of the 5th ACM workshop on Digital rights management (2005)

In this paper, we describe a novel statistical audio watermarking scheme. Under the control of the masking thresholds, watermark is embedded adaptively and transparently in the perceptual significant portions in wavelet packet domain by a statistical method. Watermark detection can be done without access to the original signal. Experimental results show the proposed scheme can survive common signal manipulations and malicious attacks.
A simulation approach to the design of dynamic feedback scheduling algorithms for time-shared computer systems
Authors: Madeline J. Bauer
Venue: ACM SIGSIM Simulation Digest (1974)

The goal of a scheduling algorithm for a time-shared computer system is to provide acceptable request response time and resource utilization through effective resource allocation. In order to do this, it is necessary for the algorithm to be capable of adjusting itself to handle the various situations, precipitated by the set of active user requests and the computing system's status, which may occur. An effort is now underway to design the structural framework of a scheduling algorithm which will dynamically formulate its resource allocation policies and adjust its policy formulation depending on the success or failure of those policies. Once designed, the framework will then be used to construct the scheduling algorithm for a given time-shared computer system.The approach chosen for determining the practicability of the algorithm design is the inclusion of the algorithm in the simulation of a swapping time-shared computer system model. The simulation contains four basic activities: processor, input/output, swapper, each of which contains a resource allocation policy for determining a priority ordering among those requests which have asked for the respective resource, and the user activity. User activities follow one of a number of simulated scripts which may be composed of several types of requests. Each request is given behavioral traits dependent on its type.While the complete algorithm is not yet implemented within the simulation, preliminary results suggest that some improvement in response time may be possible.
Identity-Based Cryptography for Grid Security
Authors: Hoon Wei Lim, Kenneth G. Paterson
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The majority of current security architectures for grid systems use public key infrastructure (PKI) to authenticate identities of grid members and to secure resource allocation to these members. Identity-based cryptography (IBC) has some attractive properties which seem to align well with the demands of grid computing. This paper presents a comprehensive investigation of the use of identity-based techniques to provide an alternative grid security architecture. We propose a customised identity-based key agreement protocol which fits nicely with the Grid Security Infrastructure (GSI) and provides a more lightweight secure job submission environment for grid users. Single sign-on and delegation services are also supported in a very natural way in our identity-based architecture.
Identification of Document Structure and Table of Content in Magazine Archives
Authors: Sherif Yacoub, Jose Abad Peiro
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we present a generic approach for reliable identification of the table of content (TOC) pages in scanned documents. We use multiple sources of information to obtain a reliable assessment of the TOC pages and the position of articles. These sources are produced by using three methods: title matching, section keyword matching, and numeric content. Finally a combination component is used to score potential TOC pages and select the best candidates. The system is used to identify the table of content, locate the beginning of articles, aid the process of advertisement identification (where present), and in general, identify the structure of scanned documents for the process of article extraction and online deployment of digital content. Results of applying the algorithms to an 80-years archive of Time weekly magazine are presented.
Users Make a Beeline for ZigBee Technology
Authors: David Geer
Venue: Computer (2005)

Users are increasingly working with the ZigBee wireless technology, built on the IEEE 802.15.4 low-rate, wireless, personal area network standard, to monitor their environment.
Training Cost-Sensitive Neural Networks with Methods Addressing the Class Imbalance Problem
Authors: Zhi-Hua Zhou
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

This paper studies empirically the effect of sampling and threshold-moving in training cost-sensitive neural networks. Both oversampling and undersampling are considered. These techniques modify the distribution of the training data such that the costs of the examples are conveyed explicitly by the appearances of the examples. Threshold-moving tries to move the output threshold toward inexpensive classes such that examples with higher costs become harder to be misclassified. Moreover, hard-ensemble and soft-ensemble, i.e., the combination of above techniques via hard or soft voting schemes, are also tested. Twenty-one UCI data sets with three types of cost matrices and a real-world cost-sensitive data set are used in the empirical study. The results suggest that cost-sensitive learning with multiclass tasks is more difficult than with two-class tasks, and a higher degree of class imbalance may increase the difficulty. It also reveals that almost all the techniques are effective on two-class tasks, while most are ineffective and even may cause negative effect on multiclass tasks. Overall, threshold-moving and soft-ensemble are relatively good choices in training cost-sensitive neural networks. The empirical study also suggests that some methods that have been believed to be effective in addressing the class imbalance problem may, in fact, only be effective on learning with imbalanced two-class data sets.
Automated Design and Programming of a Microfluidic DNA Computer
Authors: Michael S. Livstone, Ron Weiss, Laura F. Landweber
Venue: Natural Computing: an international journal (2006)

Previously, we described ways to implement the functions AND and OR in a DNA computer consisting of microreactors with attached heating elements that control annealing of DNA. Based on these findings, we have devised a similar device that can solve a satisfiability problem in any form. The device occupies linear space and operates in quadratic time, while a previously described competing device is built in quadratic space and operates in quadratic time or greater. Reducing the number of reactors in a DNA computer reduces the loss of DNA through binding to the surfaces of the system.
Battery Sensing for Energy-Aware System Design
Authors: Roberto Casas, Oscar Casas
Venue: Computer (2005)

The battery lifetime of small, powerful, portable devices can determine their viability. Developers can use mathematical models derived from battery energy measurements to infer a battery's state-of-charge (SoC) and then use the results to implement fuel gauging techniques in real electronic designs.
Orchestrating output devices: planning multimedia presentations for home entertainment with ambient intelligence
Authors: Christian Elting
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

In this paper we motivate the use of personalized multimedia presentations involving multiple output devices in a home entertainment environment. First we illustrate our vision and analyze the requirements. Afterwards we present the architecture of our system focusing on the output coordination strategy, which achieves a coordination of multiple output devices by means of an AI planning approach.Then we present our prototype implementation, which generates movie-related. The implementation consists of a TV set displaying an animated character, a PDA, which acts as a remote control and a 17" digital picture frame, which displays pictures and renders speech. We conclude with an overview over related work.
Quantitative Generalized Bertini-Sard Theorem for Smooth Affine Varieties
Authors: Zbigniew Jelonek, Krzysztof Kurdyka
Venue: Discrete Computational Geometry (2005)

Let X &#x2282; &#x2102;n be a smooth affine variety of dimension n &#x2013; r and let f = (f1,..., fm): X &#x2192; &#x2102;m be a polynomial dominant mapping. We prove that the set K(f) of generalized critical values of f (which always contains the bifurcation set B(f) of f) is a proper algebraic subset of &#x2102;m. We give an explicit upper bound for the degree of a hypersurface containing K(f). If I(X)&#x2014;the ideal of X&#x2014;is generated by polynomials of degree at most D and deg fi &#x2264; d, then K(f) is contained in an algebraic hypersurface of degree at most (d + (m &#x2013; 1)(d &#x2013; 1)+(D &#x2013; 1)r)n-rDr. In particular if X is a hypersurface of degree D and f: X &#x2192; &#x2102; is a polynomial of degree d, then f has at most (d + D &#x2013; 1)n-1D generalized critical values. This bound is asymptotically optimal for f linear. We give an algorithm to compute the set K(f) effectively. Moreover, we obtain similar results in the real case.