ppxscal/embedding_network huggingface dataset:
An Aspect-Oriented Approach to the Modularisation of Context
Authors: Jennifer Munnelly, Serena Fritsch, Siobhan Clarke
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

Handling context is required for applications to dynamically and appropriately adapt to their changing environment. Incorporating context into applications involves the consideration of a set of concerns related to the handling of various context types and the adaptation of the application behaviour relative to the current context. These concerns are usually heavily tangled with the base code of the applications, resulting in code that is badly modularised and therefore is hard to understand, manage and modify. We propose a modularised design for the handling of different kinds of context using aspect-oriented programming techniques. We demonstrate that a context-aware application built in this manner exhibits improved modularity, with corresponding improvements in comprehensibility, manageability and maintainability. The proposed aspect-oriented modularisation is evaluated against traditional object-oriented techniques, and also against a popular context framework, using metrics indicating coupling, cohesion and complexity. The results show the positive effect of modular code on context-aware applications by quantitatively illustrating the improvements in modularisation quality factors.
An Architectural Style for Ajax
Authors: Ali Mesbah, Arie van Deursen
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

A new breed of web application, dubbed AJAX, is emerging in response to a limited degree of interactivity in large-grain stateless Web interactions. At the heart of this new approach lies a single page interaction model that facilitates rich interactivity. We have studied and experimented with several AJAX frameworks trying to understand their architectural properties. In this paper, we summarize three of these frameworks and examine their properties and introduce the SPIAR architectural style. We describe the guiding software engineering principles and the constraints chosen to induce the desired properties. The style emphasizes user interface component development, and intermediary delta-communication between client/server components, to improve user interactivity and ease of development. In addition, we use the concepts and principles to discuss various open issues in AJAX frameworks and application development.
Architecture for Web Services Filtering and Clustering
Authors: Witold Abramowicz, Konstanty Haniewicz, Monika Kaczmarek, Dominik Zyskowski
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

The need for filtering of services results from the ever growing number of available Web services which offer similar functionalities. The filtering process is based not only on the functional aspects of services, but also on non-functional ones. One of the weaknesses of the filtering process is lack of high efficiency and its complexity as processing ontological descriptions and reasoning on them is extremely time-consuming. In order to speed-up the filtering process, clustering techniques that would narrow the set of potential services which meet user's preferences may be introduced. In this article the architecture for Semantic Web services filtering and clustering system is shortly discussed.
The Concept of Complex Events as Suitable Means for Biometric System Implementation
Authors: Kornelije Rabuzin, Miroslav Baca, Markus Schatten
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

Generally speaking, a user (person) can be authorised in three different ways (or their combinations): one can use something that a user knows, something that a user possesses or by measuring some physical or psychological characteristics which are immanent and unique to each person i.e. biometric characteristics. In this paper we are going to put accent on this third possibility. We are going to show how active databases could be used in order to implement multimodal biometric systems, and, due to some capabilities which they possess, reduce the time needed for authorisation (identification). Especially, we will put accent on complex events and show how they can be used for identification (authorisation) purposes.
Reduction of detected acceptable faults for yield improvement via error-tolerance
Authors: Tong-Yu Hsieh, Kuen-Jong Lee, Melvin A. Breuer
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Error-tolerance is an innovative way to enhance the effective yield of IC products. Previously a test methodology based on error-rate estimation to support error-tolerance was proposed. Without violating the system error-rate constraint specified by the user, this methodology identifies a set of faults that can be ignored during testing, thereby leading to a significant improvement in yield. However, usually the patterns detecting all of the unacceptable faults also detect a large number of acceptable faults, resulting in a degradation in achievable yield improvement. In this paper, we first provide a probabilistic analysis of this problem and show that a conventional ATPG procedure cannot adequately address this problem. We then present a novel test pattern selection procedure and an output masking technique to deal with this problem. The selection process generates a test set aimed to detect all unacceptable faults but as few acceptable faults as possible. The masking technique then examines the generated test patterns and identifies a list of output lines that can be masked (not observed) during testing so as to further avoid the detection of acceptable faults. Experimental results show that by employing the proposed techniques, only a small number of acceptable faults are still detected. In many cases the actual yield improvement approaches the optimal value that can be achieved.
Modelling in Manufacturing Industry: Parameters Selection Using Regression Analysis
Authors: Abdul Talib Bon, Jean Marc Ogier, Ahmad Mahir Razali
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The manufacturing industries are forced to meet the demand of the end users in many different aspects especially to reduce the number of defects. Since then, the manufacturers have adopted many strategies in order to achieve zero defect end products. Therefore, this research is an early attempt to present a proper method for manufacturers to achieve their goal starting from parameters selection and then optimization to control the belt line moulding production process. We apply regression analysis to make parameters selection and then used the best variables selected to optimize or in this case to minimize defects in belt line moulding process. The findings from this study will serve as a useful evidence and applicability of the proposed methodology.
A Calculus of Components with Dynamic Type-Checking
Authors: Sonia Fagorzi, Elena Zucca
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We present a simple module calculus modeling software composition in an open environment, where some components can be provided from the outside after execution has started. Operators for combining software components are as in previous module calculi; here, we focus on the new problems posed by the fact that components are not all available at compile time. In particular, we want to be able to statically check internal consistency of local code, by only specifying a required type for missing components, and then to perform dynamic checks which ensure that code received from the outside, which is assumed to travel with its type, can be successfully accepted, without requiring to type-check the whole code again. We consider two alternative solutions. The former uses simple dynamic checks based on standard subtyping, that is, a component can be safely combined with local code if it provides the expected features, and all additional features are hidden, thus avoiding conflict problems. The latter preserves the semantics we would get having all components statically available, but requires a more involved type system based on constraints, where dynamic checks prevent conflicts.
On the software virtual machine for the real hardware stack machine
Authors: Takashi Aoki, Takeshi Eto
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

Several technologies for Java [1] program execution have been reported, e.g., Just-In-Time (JIT) compilation, pre-compilation engine, etc., to improve its running speed. Bytecode engine is another approach by taking advantage of the hardware acceleration. This paper is concerned with the brief introduction to the picoJava-II core technology and its implementation at Fujitsu. Then, we will present our software mapping approach onto the hardware stack machine, focusing on Fujitsu's picoJava-II implementation, MB86799. Finally, we will report some benchmark results of Java virtual machine execution on the real stack machine and discuss yet unresolved problems.
Modeling Dynamic Structure of Human Verbal and Nonverbal Communication
Authors: Takashi Matsuyama, Hiroaki Kawashima
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

In human communication, dynamics of communication, i.e. timing structure of utterances, nodding, gesture, pause and so on, plays a crucial role to realize smooth natural communication. We proposed a computational scheme named Interval-based Linear Hybrid Dynamical System (ILHDS, in short) for modeling complex dynamic events and conducted several experiments to explore characteristics of dynamic structures of human verbal and nonverbal communication based on ILHDS. In the paper, we describe the theoretical scheme of ILHDS followed by its practical applications.
An infrastructure for remote virtual exploration on PDAs
Authors: Rosario De Chiara, Ugo Erra, Andrea Petta, Vittorio Scarano, Luigi Serra
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

In this paper we present a prototyped system to enable the virtual exploration of a complex virtual environment. Our approach exploits Quest3D as main rendering engine, its output is conveyed toward users PDAs to allow them to explore using the PDA as a (mobile) interface to the virtual environment. An important aspect of the system is that it relies on an off-the-shelf PC and low end wireless network. Some early results showed that the prototype is able to easily manage 5 PDAs. Suggested fields of use of our system are virtual cultural heritage, educational virtual environments, videogames.
Seismic data compression using GULLOTS
Authors: L. C. Duval
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Previous work has shown that GenLOT coding is a very effective technique for compressing seismic data. The role of a transform in a coder is to concentrate information and reduce statistical redundancy. When used with embedded zerotree coding, GenLOTs often provide superior performance to traditional block oriented algorithms or to wavelets. In this work we investigate the use of generalized unequal length lapped orthogonal transforms (GULLOT). Their shorter bases for high-frequency components are suitable for reducing ringing artifacts in images. While GULLOTs yield comparable performance to GenLOTs on smooth seismic signals like stacked sections, they achieve improved performance on less smooth signals such as shot gathers.
Reduction and Conversion Strategies for the Calculus of (co)Inductive Constructions: Part I
Authors: Claudio Sacerdoti Coen
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We compare several reduction and conversion strategies for the Calculus of (co)Inductive Constructions by running benchmarks from the library of the Coq proof assistant. All the strategies have been implemented in an independent verifier for the proof objects of Coq that is part of the Matita proof assistant.
Soft iterative channel estimation for turbo equalization: comparison of channel estimation algorithms
Authors: R. Otnes, M. Tuchler
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

In a receiver employing turbo equalization for an unknown, time-varying, frequency-selective channel, the channel estimate can be improved for each iteration by using soft information fed back from the decoder. The reference signal to the channel estimator is then the expected value of each transmitted symbol and not the symbol itself. Therefore, classical channel estimation theory must be applied carefully. Four different channel estimation algorithms for soft iterative channel estimation are compared through simulations, showing that the LMS algorithm is the best choice among the considered algorithms, because it is simplest without performing significantly worse than any other algorithm.
Instruction level power profiling
Authors: H. Mehta, R. M. Owens, M. J. Irwin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper describes a method to model the software component of energy dissipation from an architectural description of an embedded system. An embedded system is characterized by a dedicated processor (a DSP processor or an "off the shelf" microprocessor) and the application specific software that runs on it. The hardware model of the system consists of several interacting modules (e.g. ALU, register file, controller etc.). A black box model of a cell from each module is built which consists of a table of switching capacitances (from IRSIM-CAP) for each combination of previous to present input transitions. Using this black box cell model and the past and present inputs to the module it is possible to accurately calculate the energy dissipation of the module. By performing a simple "bookkeeping" operation of all the modules activated during the instruction, it is possible to exactly estimate the energy dissipation of an instruction. A power profiler (PPROF) is built which takes as an input the program and the model of the basic units of each module and profiles the energy for each instruction of the program. In addition, it also outputs the energy consumption statistics for each type of instruction and for each module. A programmable microprocessor with sixteen instructions has been designed, and programs written for this machine are analysed using PPROF. The results of the estimated instruction energy are within 8% maximum error when compared with IRSIM-CAP.
Reference model based RTL verification: an integrated approach
Authors: W. N. N. Hung, N. Narasimhan
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

We present an approach that makes reference model based formal verification both complete and practical in an industrial setting. This paper describes a novel approach to conduct this exercise, by seamlessly integrating formal equivalence verification (FEV) techniques within a verification flow suited to formal property verification (FPV). This enables us to take full advantage of the rich expressive power of temporal specification languages and help guide the FEV tools so as to enable reference model verification to an extent that was never attempted before. We have successfully applied our approach to challenging verification problems at Intel/spl reg/.
On the local structure of doubly laced crystals
Authors: Philip Sternberg
Venue: Journal of Combinatorial Theory Series A (2007)

Let g be a Lie algebra all of whose regular subalgebras of rank 2 are type A"1xA"1, A"2, or C"2, and let B be a crystal graph corresponding to a representation of g. We explicitly describe the local structure of B, confirming a conjecture of Stembridge.
Multitasking and Innovation in Virtual Teams
Authors: Karen Sobel Lojeski, Richard Reilly, Peter Dominick
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The limits of human multitasking capabilities in intense conditions are well understood. However, little is known about how increasing and continuous multitasking impacts innovation in virtual teams. During this investigation, we developed a construct called Virtual Distance to understand how both perceived and physical distance impacts innovation on virtual teams and applied it to 223 individuals and mangers at seventeen organizations. We then explored Virtual Distance as a moderator of the relationship between Multitasking and Innovation. Our results showed that Virtual Distance has a significant and negative relationship to Innovation. We further found that Virtual Distance significantly moderated the relationship between Multitasking and Innovation. When Virtual Distance is low, there is a positive relationship and when Virtual Distance is high, there is a significant curvilinear relationship. The results have implications for the selection of virtual team members and virtual project management activities when critical project outcomes include Innovation.
HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast
Authors: Joao Leitao, Jose Pereira, Luis Rodrigues
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly scalable and resilient reliable broadcast primitives. Due to scalability reasons, each participant in a gossip protocol maintains a partial view of the system. The reliability of the gossip protocol depends upon some critical properties of these views, such as degree distribution and clustering coefficient. Several algorithms have been proposed to maintain partial views for gossip protocols. In this paper, we show that under a high number of faults, these algorithms take a long time to restore the desirable view properties. To address this problem, we present HyParView, a new membership protocol to support gossip-based broadcast that ensures high levels of reliability even in the presence of high rates of node failure. The HyParView protocol is based on a novel approach that relies in the use of two distinct partial views, which are maintained with different goals by different strategies.
Optimization and evaluation of shortest path queries
Authors: Edward P. Chan, Heechul Lim
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2007)

We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortest path query efficiently, we introduce two pruning algorithms. These algorithms differ on the extent of materialization of shortest path cost and on how the search space is pruned. By grouping shortest path queries properly, batch processing improves the performance of shortest path query evaluation. Extensive study is also done on fragment sizes, cache sizes and query types that we show that affect the performance of a disk-based shortest path algorithm. The performance and scalability of proposed techniques are evaluated with large road systems in the Eastern United States. To demonstrate that the proposed disk-based algorithms are viable, we show that their search times are significant better than that of main-memory Dijkstra's algorithm.
Probabilistic counting of large digital signature collections
Authors: Markus G. Kuhn
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

A large number of people digitally sign the same document. The signature collectors want to use only a small amount of memory to demonstrate to any third party approximately how many persons have signed it. The scheme described in this paper uses a non-uniform secure hash function to select a small subset of signatures that the collectors store. The size of this subset becomes a verifiable estimate for the logarithm of the number of signers. Applications for this scheme range from Web page metering, through ranking mechanisms for electronic discussion systems, to the distributed verifiable and scalable delegation of power in jointly-administrated systems.
Operator Performance and Intelligent Aiding in Unmanned Aerial Vehicle Scheduling
Authors: Mary L. Cummings, Amy S. Brzezinski, John D. Lee
Venue: IEEE Intelligent Systems (2007)

Interest is increasing in designing systems for controlling unmanned vehicles that will invert the current many-to-one ratio ofoperators to UVs. Instead of the lower-level tasks that today's UV teams perform, a single operator would focus on high-level supervisorycontrol. A key challenge in designing such single-operator systems is to minimize periods of excessive workload that arise when criticaltasks for several UVs occur simultaneously. So, we need decision support that helps the operator evaluate different action alternativesfor managing a multiple-UV mission schedule in real time. Two decision support experiments have attempted to provide operators ofunmanned aerial vehicles with multivariate scheduling assistance, with mixed results. Those automated decision support tools thatprovided more local, as opposed to global, visual recommendations performed better. This result suggests that meta-information displayscould saturate operators and reduce performance. This article is part of a special issue on Interacting with Autonomy.
Resonant Quantum Phenomena for an rf-SQUID: Moderate Underdamped and Extreme Underdamped Limit
Authors: S. Rombetto, Yu. N. Ovchinnikov, V. Corato, P. Silvestrini, E. Esposito, C. Granata, M. Russo, R. Russo, B. Ruggiero
Venue: Open Systems Information Dynamics (2007)

We study the resonant quantum behaviour of a macroscopic superconducting system interacting with an external field. First we consider the resonant tunneling assisted by microwave frequency in the moderate underdamped quantum regime. Then we consider the resonant process in the extreme underdamped limit. In both regimes we have investigated a small frequency range, where resonant phenomena take place. The transition probability W from the left to the right potential well has been numerically calculated for an rf-SQUID as function of the external flux ¿ x for both regimes. Results indicate that, in a proper frequency and ¿ x range, the transition probability W can present two or three resonant peaks, depending on the damping regime.