ppxscal/embedding_network huggingface dataset:
Improving the adaptability of multi-mode systems via program steering
Authors: Lee Lin, Michael D. Ernst
Venue: ACM SIGSOFT Software Engineering Notes (2004)

A multi-mode software system contains several distinct modes of operation and a controller for deciding when to switch between modes. Even when developers rigorously test a multi-mode system before deployment, they cannot foresee and test for every possible usage scenario. As a result, unexpected situations in which the program fails or underperforms (for example, by choosing a non-optimal mode) may arise. This research aims to mitigate such problems by creating a new mode selector that examines the current situation, then chooses a mode that has been successful in the past, in situations like the current one. The technique, called program steering, creates a new mode selector via machine learning from good behavior in testing or in successful operation. Such a strategy, which generalizes the knowledge that a programmer has built into the system, may select an appropriate mode even when the original controller cannot. We have performed experiments on robot control programs written in a month-long programming competition. Augmenting these programs via our program steering technique had a substantial positive effect on their performance in new environments.
A Wide Bandwidth Isolation Amplifier Design Using Current Conveyors
Authors: An Sang Hou
Venue: Analog Integrated Circuits and Signal Processing (2004)

In this paper, the dual-channel optocoupler and current conveyors are employed to achieve the wide bandwidth isolation amplifier. The high gain feedback technique and pole-zero compensation are applied to overcome the inherent nonlinear characteristics of optocouplers and to obtain a good transient response. Its bandwidth is up to 570 kHz with linear transfer characteristics. The maximum noise signal level in the frequency range up to 1.25 MHz is less than 31.6 &mu;V. The mathematical model of proposed isolation amplifier is verified with experimental and simulation results. The dynamic responses and static characteristics are also demonstrated with experimental results.
A functional correspondence between call-by-need evaluators and lazy abstract machines
Authors: Mads Sig Ager, Olivier Danvy, Jan Midtgaard
Venue: Information Processing Letters (2004)

We bridge the gap between compositional evaluators and abstract machines for the lambda-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization of continuations. This article is a followup of our article at PPDP 2003, where we consider call by name and call by value. Here, however, we consider call by need.We derive a lazy abstract machine from an ordinary call-by-need evaluator that threads a heap of updatable cells. In this resulting abstract machine, the continuation fragment for updating a heap cell naturally appears as an 'update marker', an implementation technique that was invented for the Three Instruction Machine and subsequently used to construct lazy variants of Krivine's abstract machine. Tuning the evaluator leads to other implementation techniques such as unboxed values. The correctness of the resulting abstract machines is a corollary of the correctness of the original evaluators and of the program transformations used in the derivation.
New concept of high-k integration in MOSFET's by a deposition through contact holes
Authors: S. Harrison, P. Coronel, F. Wacquant, C. Regnier, F. Leverd, A. Beverina, J. Bustos, B. Tavel, T. Skotnicki
Venue: Microelectronic Engineering (2004)

We report on a new concept for realization of transistors with high-k oxide by deposition through the contact holes. This new integration allows low thermal budget for the high-k film (deposited after source and drain anneal), no particular contamination issues (back-end steps) and easy dual gate and/or dual gate oxide realization for CMOS application.
Exploiting Temporal Coherence in Final Gathering for Dynamic Scenes
Authors: T. Tawara, K. Myszkowski, H.-P. Seidel
Venue: Proceedings of the Computer Graphics International (2004)

Efficient global illumination computation in dynamicallychanging environments is an important practical problem.In high-quality animation rendering costly "final gathering"technique is commonly used. We extend this techniqueinto temporal domain by exploiting coherence betweenthe subsequent frames. For this purpose we store previouslycomputed incoming radiance samples and refreshthem evenly in space and time using some aging criteria.The approach is based upon a two-pass photon mapping algorithmwith irradiance cache, but it can be applied alsoin other gathering methods. The algorithm significantly reducesthe cost of expensive indirect lighting computationand suppresses temporal aliasing with respect to the stateof the art frame-by-frame rendering techniques.
Reconfiguration-based QoS Management in Multimedia Streaming Applications
Authors: Oussama Layaida, Slim Ben Atallah, Daniel Hagimont
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Multimedia applications are currently being deployed over dynamic and heterogeneous environments. They operate on devices with diverse computation capabilities in terms of processing, storage and display capabilities. In such environments, resource availability is subject to unexpected fluctuations (such as network bandwidth, battery life-time, CPU, etc.). This obliges applications to reconfigure their behavior accordingly in order to maintain an acceptable Quality of Service (QoS). This paper addresses this aspect and describes a framework for a reconfiguration-based QoS management in multimedia streaming applications. Our objective is to relieve developers from dealing with the complexity of multimedia applications and their reconfiguration requirements. The framework provides a high-level specification language enabling an easy description of applications and their reconfiguration policies. A powerful component-based implementation is used for mapping specifications into run-time applications. Several experiments in different scenarios are reported to argue our design choices, and to show the impact of reconfigurations on the perceived QoS.
A Hybrid Physics-Based Subdivision Technique Using Coupled Dynamic and Subdivision Parameters
Authors: Sumantro Ray, Hong Qin
Venue: Proceedings of the Computer Graphics International (2004)

The last few decades have seen enormous progress inboth geometric subdivision, and physics-based simulationtechniques. Mesh-based dynamic systems often require bothsubdivision and physical simulation for realistic and accurateresults. However, the simulation parameters have beenindependent of the subdivision parameters, and vice-versa.This paper attempts to bridge this gap. We propose a hybridapproach that combines the physics-based simulation techniquesand geometric subdivision algorithms, and demonstratea mass-spring based system with physics-based butterflysubdivision. The initial subdivision coefficients areextracted using the physical properties of the base (L_0)mesh. Latter subdivision steps generate both the geometricand physical properties of the subdivided (L_k) mesh. Thisapproach conserves mass, center of gravity, linear momentumand external force, and minimizes the distance betweenthe L_k and L_k+1 meshes, at any time step. Our approach isgeneral, efficient, and will serve as a foundation for manyapplications in many fields.
Selection of Putative Cis-Regulatory Motifs through Regional and Global Conservation
Authors: Youlian Pan, Brandon Smith, Hung Fang, Fazel A. Famili, Marianna Sikorska, Roy Walker
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Cis-regulatory motifs are often over-represented in promoters and may exhibit frequency biases in sub-promoter regions (SPRs). Many probabilistic algorithms have been used to predict such motifs, but they tend to generate many false positives. We devised a novel algorithm, MotifFilter, that computes Representation Indices (RIs) for putative motifs. MotifFilterýs RI is a ratio of the actual over expected frequency of a motif in promoters, SPRs or random genomic DNA that takes into account of the nucleotide probability distributions in these regions. This approach was applied to a genome-wide survey of putative cAMP-response elements (CREs) for motifs generated by a profile hidden Markov model. Twenty of 144 putative CRE motifs found in the survey were retained by the MotifFilter.
Memories: A Survey of Their Secure Uses in Smart Cards
Venue: Proceedings of the Second IEEE International Security in Storage Workshop (2003)

Smart cards are widely known for their tamperresistance, but only contain a small amount of memory. Thoughvery small, this memory often contains highly valuable information(identification data, cryptographic key, etc). This is why itis subject to many attacks, as the other parts of the smart card,and thus requires appropriately chosen protections.The use of memories in smart cards induces security problems,but also other more particular ones. The main constraint isnaturally the limited physical expansion and integration, but faultlevel, aging and power consumption are not to be discarded.Indeed, deducing the context of a ROM using a microscopehas been proven to work. Interactions with light or eddycurrent on silicon can produce faults that might reveal importantinformation, as well.This article details the role of memory in smart card industries,in current context and future perspectives of smart cards andtheir applications. It then gives a survey of published physicalattacks targeting memory and all the existing techniques tocounter them.Great efforts are undertaken by industries and academicsto tackle specific memory problems introducing hardware andsoftware countermeasures in the designs. This struggle betweensecurity and hackers permits in the one hand tremendousbreakthroughs in research but in the other hand makes ratherdifficult for manufacturers to maintain cost effectiveness, that isone important factor for smart card.
A kernel-independent adaptive fast multipole algorithm in two and three dimensions
Authors: Lexing Ying, George Biros, Denis Zorin
Venue: Journal of Computational Physics (2004)

We present a new fast multipole method for particle simulations. The main feature of our algorithm is that it does not require the implementation of multipole expansions of the underlying kernel, and it is based only on kernel evaluations. Instead of using analytic expansions to represent the potential generated by sources inside a box of the hierarchical FMM tree, we use a continuous distribution of an equivalent density on a surface enclosing the box. To find this equivalent density, we match its potential to the potential of the original sources at a surface, in the far field, by solving local Dirichlet-type boundary value problems. The far-field evaluations are sparsified with singular value decomposition in 2D or fast Fourier transforms in 3D. We have tested the new method on the single and double layer operators for the Laplacian, the modified Laplacian, the Stokes, the modified Stokes, the Navier, and the modified Navier operators in two and three dimensions. Our numerical results indicate that our method compares very well with the best known implementations of the analytic FMM method for both the Laplacian and modified Laplacian kernels. Its advantage is the (relative) simplicity of the implementation and its immediate extension to more general kernels.
A Default Extension to Distributed Description Logics
Authors: Yinglong Ma, Jun Wei
Venue: Proceedings of the Intelligent Agent Technology, IEEE/WIC/ACM International Conference (2004)

Description Logic is now an active research area, which is applied universally to knowledge representation, Semantic Web and Ontology language. Compared with Description Logic, Distributed Description Logic can be used to better establish distributed ontologies from distributed information sources. But little attention has been paid to the problem of endowing Distributed Description Logic with default reasoning capabilities to deal with incomplete or conflict information. In this paper we present a default extension to Distributed Description Logics to handle the heterogeneity and incompleteness of different information sources. We extend Distributed Description Logics by adding default information into a distributed knowledge base, and discuss the default satisfiability based on Distributed Description Logics with default rules. To perform default reasoning, a default Tableau algorithm is developed to check satisfiability of complex concepts and subsumption assertions.
Evaluation of Component Technologies with Respect to Industrial Requirements
Authors: Anders Moller, Mikael Akerholm, Johan Fredriksson, Mikael Nolin
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

We compare existing component technologies for embeddedsystems with respect to industrial requirements. The requirements are collected from the vehicular industry, but our findings are applicable to similar industries developing resource constrained safety critical embedded distributed real-time computer systems. One of our conclusions is that none of the studied technologies is a perfect match for the industrial requirements. Furthermore, no single technology stands out as being a significantly better choice than the others; each technology has its own pros and cons. The results of our evaluation can be used to guide modifications or extensions to existing technologies, making them better suited for industrial deployment. Companies that want to make use of component-based software engineering as available today can use this evaluation to select a suitable technology.
FOCUS: a system for searching for multi-colored objects in a diverse image database
Authors: M. Das, E. M. Riseman
Venue: Computer Vision and Image Understanding (2004)

We describe a new muli-phase, color-based image retrieval system (FOCUS) which is capable of identifying multi-colored query objects in an image in the presence of significant, interfering backgrounds. The query object may occur in arbitrary sizes, orientations, and locations in the database images. Scale and rotation invariant color features have been developed to describe an image, such that the matching process is fast even in the case of complex images. The first phase of processing matches the query object color with the color content of an image computed as the peaks in the color histogram of the image. The second phase matches the spatial relationships between color regions in the image with the query using a spatial proximity graph (SPG) structure designed for the purpose. Processing at coarse granularity is preferred over pixel-level processing to produce simpler graphs, which significantly reduces computation time during matching. The speed of the system and the small storage overhead make it suitable for use in large databases with online user interfaces. Test results with multi-colored query objects from man-made and natural domains show that FOCUS is quite effective in handling interfering backgrounds and large variations in scale. The experimental results on a database of diverse images highlights the capabilities of the system.
An Integrated Metadata Model for Statistical Data Collection and Processing
Authors: Maria Vardaki, H. Papgeorgiou
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

An integrated, semantically rich statistical metadatamodel is designed to cover the major stages of thestatistical information processing (data collection andanalysis including harmonization, processing of data andmetadata and dissemination/output phases), which canminimize complexity of data warehousing environmentsand compatibility problems between distributedStatistical Information Systems (SIS). The semantics ofthe model are analyzed, describing each part of thestatistical processing. In addition, process metadata(operators) for automatic manipulation of both data andmetadata are also defined over their common domain aswell as logistic metadata for the location and format ofdata. Furthermore, we discuss how the proposedframework can facilitate actual information entry andanalysis into a SIS. Finally, we demonstrate in a casestudy how the suggested metadata model can beimplemented and integrated into a modern metadata-enabled SIS, thus standardizing the processing environment and assuring the quality of statistical results.
Incorporating Cost of Control into the Design of a Load Balancing Controller
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Load balancing is widely used in computing systems as away to optimize performance by reducing bottleneck utilizations,such as adjusting the size of buffer pools to balanceresource demands in a database management system. Loadbalancing is generally approached as a constrained optimizationproblem in which only the benefits of load balancingare considered. However, the costs of control are importantas well. Herein, we study the value of including in controllerdesign the trade-off between the cost of transient imbalancesin resource utilizations and the cost of changingresource allocations. An example of the latter are actionssuch as resizing buffer pools that can reduce throughputs.This is because requests for data in pools whose memory isreduced immediately have longer access times whereas requestsfor data in pools whose memory is increased must fillthis memory with data from disk before accessed times arereduced. We frame our study of control costs in terms of thewidely used linear quadratic regulator (LQR). We develop acost model that allows us to specify the LQR Q and R matricesbased on the impact on system performance of changingresource allocations and transient load imbalances. Ourstudies of a DB2 Universal Database Server using benchmarksfor online transaction processing and decision supportworkloads show that incorporating our cost model intothe MIMO LQR controller results in a 14% improvement inperformance beyond that achieved by dynamically allocatingthe size of buffers without properly considering the costof control.
An Economic Model for Resource Exchange in Mobile Peer to Peer Networks
Authors: Ouri Wolfson, Bo Xu, A. Prasad Sistla
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Consider an urban area with hundreds of thousands ofvehicles. Drivers and passengers in these vehicles areinterested in information relevant to their trip. Forexample, a driver would like his/her vehicle to continuouslydisplay on a map the available parking spaces around thecurrent location. Or, the driver may be interested in thetraffic conditions (e.g. average speed) one mile ahead.In this paper we examine the dissemination ofinformation about resources in mobile peer-to-peernetworks, where vehicles and sensors communicate witheach other via short-range wireless transmission. Eachdisseminated resource represents information about aspatial-temporal event, such as the availability of a parkingslot at a particular time. We propose an opportunisticdissemination paradigm, in which a moving objecttransmits the resources it carries to encountered vehiclesand obtains new resources in exchange. We develop andanalyze a family of economic models that provide incentivefor collaboration in data dissemination. The proposedsystem has the potential to create a completely newinformation marketplace.
A best practice advice system to support automotive engineering analysis processes
Authors: A. McMahon, Y. Liu, R. Crossland, D. Brown, D. Leal, J. Devlukia
Venue: Engineering with Computers (2004)

Engineering design teams today are often widely distributed, and design authority is shared between collaborating companies. Technology is changing rapidly, and understanding of the most appropriate approach to the application of engineering assessment tools is developing accordingly. There is therefore a need to support coordination and auditing of engineering processes, and to provide best practice advice. This paper describes a computing approach to the provision of best practice advice within a workflow-enabled engineering computing environment. The engineering context is described using a formal information model for automotive engineering analysis processes, embedded in an object database. This same model is used to associate best practice advice documents with the engineering context. The best practice adviser (BPA) system assembles four types of information: general information that is pertinent to a particular activity, irrespective of the context in which it is taking place; context-specific information that is pertinent to the particular circumstance in which an activity is taking place; errors and warnings that may be encountered in the activity, especially when software is being used, and examples of previous application of the activity in related contexts. The BPA is implemented in a three-tier architecture using server pages technology. In the absence of any suitable matching information for a particular context in the BPA database, the BPA Server can execute a &#x201c;close-match&#x201d; algorithm which searches the database for information that is provided on contexts that are close to the user&#x2019;s interest. The paper describes the initial implementation and population of the BPA, and presents some early feedback from prototype trials.
Scheduling Distributable Real-Time Threads in Tempus Middleware
Authors: Peng Li, Binoy Ravindran, Hyeonjoong Cho, E. Douglas Jensen
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

This paper presents the Tempus real-time middleware, which supports Real-Time CORBA 2.0'sdistributable threads (DTs) as an end-to-end programming abstraction for distributed real-timesystems. DTs in Tempus can have time constraints, including time/utility functions (TUFs),can have resource constraints, including mutual exclusion, and can be scheduled according to utility accrual (UA) disciplines. Tempus propagates the scheduling parameters of DT's as they transit objects and hence perhaps node boundaries. Node-local instances of a UA scheduling algorithm use the propagated parameters to construct local schedules and resolve resource dependencies for local timeliness optimization, towardapproximate, system-wide timeliness optimality. Tempus uses an application-level schedulingframework for node-local TUF/UA scheduling on real-time POSIX-compliant operatingsystems. Our experimental measurements demonstrate the effectiveness of the middleware inscheduling DTs.
PROTON: A Policy-based Solution for Future 4G devices
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

We present PROTON, a policy-based solution for 4Gmobile devices - it allows users to seamlessly connect tohighly integrated heterogeneous wireless networks. The keymotivation behind PROTON stems from the statement thathandover process complexity will increase in 4G systems,creating the need for augmented knowledge about context,as well as more flexibility. This paper demonstrates (1) howa flexible policy-based approach is suitable for 4G scenarios,and (2) how to incorporate richer context into policiesand still maintain a light weight solution appropriate formobile devices.