ppxscal/embedding_network huggingface dataset:
Animation of Linux Processor Scheduling Algorithm
Authors: Kevin K. Leung, Du Zhang
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper, we describe a visualization tool for the Linux processor scheduling algorithm. The tool is developed for use by operating system learners to gain insight on the Linux scheduling algorithm. Through its graphical environment, a user selects a set of predefined processes as input to the tool. Each process selected possesses a specific characteristic geared toward effectively coercing the Linux scheduling algorithm to behave in a particular manner. By running the selected processes and gathering their runtime information, the tool is able to generate diagrams that reveal the intimate knowledge of the Linux scheduler such as dynamic priority assignment of processes, time quantum changes, scheduling sequence of the processes, classification of processes based upon projected CPU cycle requirements, and favoritism in scheduling toward I/O processes over CPU processes. In addition, the tool can be extended to serve as the basis for process performance measuring or optimization purpose.
Short minority carrier response time in HfO2/Ge metal-insulator-semiconductor capacitors
Authors: A. Dimoulas, G. Vellianitis, G. Mavrou, E. K. Evangelou, K. Argyropoulos, M. Houssa
Venue: Microelectronic Engineering (2005)

article-9abstract
Constrained controlled coverage of surfaces embedded in three dimensions
Authors: Howie Choset, Alfred A. Rizzi
Venue:  (2005)

In this thesis, we develop procedures to automate the task of trajectory generation for material deposition applications, such as robotic spray painting. Such applications require that the robot end effector deposits an acceptably uniform layer of material at each point on a curved surface. Apart from satisfying the uniformity constraint, it is desirable that the time required to cover the surface, as well as the amount of material wasted, are both minimized; we term such a task as optimal uniform coverage problem. Optimal uniform coverage is a challenging task because the material deposition pattern emitted from an atomizer has typically a non-trivial form. This complexity is further confounded on curved surfaces as the deposition pattern &ldquo;warps&rdquo; according to the surface curvature, thus making the task of satisfying uniformity more challenging. The presence of holes in the surface has a strong impact on the cycle time and the paint waste, and thus trajectory generation for curved surfaces with holes becomes even more challenging. To solve the optimal uniform coverage problem in a practical and efficient manner, we decompose the problem into five relatively decoupled sub-problems. These subproblems are: (i) segmentation of the surface into geometrically as well as topologically simple (i.e., with no holes) patches, (ii) selection of a seed curve on each patch, (iii) selection of end effector speed along a pass, (iv) selection of the spacing between the passes, and (v) stitching the trajectories on multiple patches together to ensure uniform coverage. By employing tools from differential geometry, topology and optimization, we obtain effective solutions to the first four sub-problems, where these solutions are also in grounded in rules of thumb that encode the relationships between the coverage variables and output characteristics. Finally, we demonstrate the effectiveness of our algorithms on a number of automotive surfaces for robotic spray painting application, in simulation as well as experimentally. We also provide a few ideas on how to solve the problem of stitching the trajectories on multiple patches together.
Optimal agent cooperation with local information
Authors: Jan De Mot
Venue:  (2005)

Multi-agent systems are in general believed to be more efficient, robust, and versatile than their single-agent equivalents. However, it is not an easy task to design strategies that fully exploit the multi-agent benefits, and with this in mind we address several multi-agent system design issues. Specifically, it is of central importance to determine the optimal agent group composition, which involves a trade-off between the cost and performance increase per additional agent. Further, truly autonomous agents solely rely on on-board environment measurements, the design of which requires quantifying the multi-agent performance as a function of the locally observed environment areas. In this thesis, we focus on the collaborative search for individually rewarding resources, i.e. it is possible for multiple agents to incur the same reward. The system objective is to maximize the aggregate rewards incurred. Motivated by a cooperative surveillance context, we formulate a graph traversal problem on an unbounded structured graph, and restrain the agent motion spatially so that only the lateral agent separation is controlled. We model the problem mathematically as a discrete, infinite state, infinite horizon Dynamic Program and convert it using standard techniques to an equivalent Linear Program (LP) with infinitely many constraints. The graph spatial invariance allows to decompose the LP into a set of infinitely many coupled LPs, each with finitely many constraints. We establish that the unique bounded function that simultaneously satisfies the latter LPs is the problem optimal value function. Based on this, we compute the two-agent optimal value function explicitly as the solution of an LP with finitely many constraints for small agent separations, and implicitly in the form of a recursion for large agent separations, satisfying adequate connection constraints. Finally, we propose a similar method to compute the state probability distribution in steady state under an optimal policy, summarizing the agent behavior at large separations in a set of connection constraints, which is sufficient to compute the probability distribution at small separations. We analyze and compare the optimal performance of various problem instances. We confirm and quantify the intuition that the performance increases with the group size. Some results stand out: for cone-shaped local observation, two agents incur 25% less cost than a single agent in a mine field type environment (scarce though high costs); further, for some environment specifics, a third agent provides little to no performance increase. Then, we compare various local observation zones, and quantify their effect on the overall group performance. Finally, we study the agent spatial distribution under an optimal policy, and observe that as rewards are scarcer, the agents tend to spread in order to gather information on a larger environment part. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
New Enhancement Scheme for Secure Routing Protocol in Mobile Ad Hoc Networks
Authors: Rui Jun Yang, Qi Xia, Qun Hua Pan, Ming Lu Li, Wei Nong Wang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Though security protocols in mobile ad hoc networks are becoming widely studied, only a few issues have been developed from the point of view in the attack's impacts on the network performance. We firstly analyze some attacks in the context of secure routing protocols and then investigate their incentive factors in detail. Based on the description of distribution of possible existing attacks and future potential attacks' possibility, we present a new secure enhancement mechanism (SEM) and introduce the whole process of its implementation. We also provide some presentations of certain functions about extension route table. Simulation results confirm the robustness and scalability of SEM in improving routing protocols performance and demonstrate its superiority in future application.
Autocalibration of an Electronic Compass for Augmented Reality
Authors: Xiaoming Hu, Yue Liu, Yongtian Wang, Yanling Hu, Dayuan Yan
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

Electronic compass is often used to provide the absolute heading reference for tracking the user's head and hands in Virtual Reality (VR) and Augmented Reality (AR), especially for outdoor AR applications. However, compass is vulnerable to environment magnetism disturbance. Existing compass calibration methods require complex steps and true heading reference which is often impossible to be obtained in outdoor AR applications, and is useful only when compass is in horizontal plane. An autocalibration method without the need of heading reference and redundant sensors is proposed in this paper. First the compass error model based on physical principle is presented, then the algorithm to calculate the compensation coefficients with a set of sample measurements of the sensors in the compass is described. Because the influence of the environmental disturbance has been effectively compensated, the calibrated compass can provided accurate heading even when it is under large tilt attitude.
Data Updating Between the Operational and Analytical Databases Through DW-Log Algorithm
Authors: Bianka M. M. T. Goncalves, Isabel Cristina Italiano, Joao Eduardo Ferreira
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Data Warehouse Systems (DWS) make use of storage techniques for efficient end user accessing and query facilities. DWS applications have implemented classic data synchronism operations that do not support an immediate data update. With the evolution of semantic data representation in the operational database environment, the accomplished analysis in DWS demands new synchronism ways. Hence, there is a growing interest in DWS that can rapidly absorb the operational database updates, without compromising the operational query processes. Our research aims at the characterization of the synchronous and asynchronous algorithms limits for data updating in a DWS. This research proposes another way for update propagations of asynchronous transactions in DWS, the dw-log algorithm. The dw-log algorithm implementation is supported by the process algebra approach.
Constructs for the specifications of models and experimental frames
Authors: Bernard P. Zeigler
Venue: ACM SIGSIM Simulation Digest (1977)

There is increasing recognition that simulation modelling of multifaceted systems cannot be accomplished successfully within the framework of a "oneshot" finite lifetime simulation project but must rather be viewed as an ongoing activity supported by the appropriate computational facilities [1]. The latter view requires the development of <u>advanced modelling concepts</u> [2], and the theory on which to base them [3]. Such developments should be coordinated with the software engineering design of <u>integrated modelling systems</u> to implement such advanced concepts [4,5].
Universal Communication Format for Multimedia Data
Authors: Yukio Hiranaka, Hitoshi Sakakibara, Toshihiro Taketa
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Various intelligent equipments and software are gradually designed to communicate with other equipment or software. However, any data format that can be considered as universal and almost eternally usable is not available. In this paper, we present UCF as a candidate bi-directional communication data format, and show its typical application for multimedia data. UCF is formed with the object address and the data to be forwarded. Communications can be simply performed by sending UCF data in required directions.
Event-driven response architecture for event-based computing
Authors: Vijay Dheap, Paul A. S. Ward
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

Service-based computing is rapidly replacing the more-traditional approaches to architecting distributed systems. The critical advantage of service-based architectures is that they require only a specification of protocol, and not of API. As such, they engender a significantly looser coupling than prior techniques, thus facilitating seamless collaboration across systems and across administrative domains.A Service-Oriented Architecture (SOA) is a middleware platform that provides a service-based computing environment. The "publish-find-bind" paradigm at the core of SOA enables the development of service-provision software separately from the development of service-consumption software. Closer observation of each aspect in this paradigm reveals that significant developer involvement is still required to assist the interaction between service provider and consumer. Developers of service-consumer software make the decision to employ a set of service providers at development time. Some SOAs provide facilities to programmatically search, bind, and even invoke services dynamically. However, it is still assumed that knowledge of both service providers and the service provided is known at development time, or the client must supply highly-detailed information about services they wish to use. This severely limits the possibility of dynamic run-time interactions among service providers and service consumers.In this paper we introduce EDRA, the Event-Driven Response Architecture for service-based computing. EDRA is a software framework that provides an infrastructure to dynamically select client-relevant service providers during run-time. Information services selected by EDRA on behalf of clients may send notification events in case of changes in the service. In such cases, our runtime will automatically process the notification based on a selection of user-choice, system defaults, and available action services. We have implemented a prototype of our framework, and show its operation in the domain of airline services.
A Binary XML for Scientific Applications
Authors: Kenneth Chiu, Tharaka Devadithya, Wei Lu, Aleksander Slominski
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

XML provides flexible, extensible data models and type systems for structured data, and has found wide-acceptance in many domains. XML processing can be slow, however, especially for scientific data, thus leading to the conventional wisdom that XML is not appropriate for such data. Instead, data is stored in specialized binary formats, and is transmitted via work-arounds such as attachments and base64 encoding. Though these work-arounds can be useful, they nonetheless relegate scientific data to second-class status within the web services framework; and they generally require yet another API, data model, and type system. An alternative solution is to use more efficient encodings of XML, often known as "binary XML". Using XML uniformly throughout an application simplifies and unifies design and development. In this paper we present a binary XML format and implementation for scientific data called Binary XML for Scientific Applications (BXSA). We show that performance is comparable to that of commonly used scientific data formats such as netCDF. These results challenge the prevailing practice of handling control and data separately in scientific applications, with web services for control and specialized binary formats for data.
Test of Interconnection Opens Considering Coupling Signals
Authors: Roberto Gomez, Alejandro Giron, Victor Champac
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

In this work a strategy to improve the detectability of interconnection open defects applying proper logic levels at the coupled lines is proposed. A framework called OPVEG which uses layout information and a commercial ATPG under the stuck-at model has been developed. Those signal values at the coupled lines which favor the detection of the opens using a boolean based test are attempted to be generated. The strategy is applied to four ISCAS¿85 benchmark circuits. It has been found that a significant number of considered coupled signals can be forced to a proper logic value. Hence, the likelihood of detection of interconnection opens is increased. Furthermore, those lines di?cult to test are identified.
Modeling gaze behavior for a 3D ECA in a dialogue situation
Authors: Gaspard Breton, Danielle Pelé, Christophe Garcia
Venue: Proceedings of the 11th international conference on Intelligent user interfaces (2006)

This paper presents an approach to model the gaze behavior of an Embodied Conversational Agent in a real time multimodal dialogue interaction with users. The ECA's gaze control results from the fusion of a rational dialogue engine based on natural language interaction and a multi-users face tracker.
OCR Based Slide Retrieval
Authors: N. Daddaoua, J. M. Odobez, A. Vinciarelli
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This work addresses the problem of acquiring, indexing and retrieving slides in the context of automatic oral presentation processing. Since the most suitable acquisition technique, in such a context, is the use of a framegrabber (a device capturing as images the slides displayed on a screen), the slides must be transcribed with an Optical Character Recognition system. Retrieval experiments performed on a corpus of 570 slides (26 presentations) gathered at a workshop show that performance obtained with the OCR transcriptions are close to those obtained by extracting the text from the electronic version (pdf or ppt) of the slides (through apposite API's).
The Pump: A Decade of Covert Fun
Authors: Myong H. Kang, Ira S. Moskowitz, Stanley Chincheck
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

This paper traces the ten plus year history of the Naval Research Laboratory's Pump idea. The Pump was theorized, designed, and built at the Naval Research Laboratory's Center for High Assurance Computer Systems. The reason for the Pump is the need to send messages from a "Low" enclave to a "High" enclave, in a secure and reliable manner. In particular, the Pump was designed to minimize the covert channel threat from the necessary message acknowledgements, without penalizing system performance and reliability. We review the need for the Pump, the design of the Pump, the variants of the Pump, and the current status of the Pump, along with manufacturing and certification difficulties.
Orthogonalized Communication Architecture for MP-SoC with Global Bus
Authors: Jin Lee, Sin-Chong Park
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In platform based SoC design, the computational part and communication part of the system are required to be orthogonalized. In this paper, we propose the fully orthogonalized communication architecture of multi-processor SoC (MP-SoC) which has a global bus architecture. In order to orthognalize communication and computation, we use the central arbiter which not only performs arbitration of transactions, but generates of transaction information. Each master has a transactor which translate the information from the central arbiter, so that the master doesn¿t need to synchronize with other processors. This paper also provides the transaction level modeling(TLM) methodology at timed functional (TF) level with SystemC 2.0.1 and Master-Slave Library.
Carbon hard masks for etching sub-90nm structures
Authors: Kevin A. Pears, Momtchil Stavrev, Alessia Scire, Ralf Koepe, Matthias Markert, Ulrich Egger, Lee Donohue
Venue: Microelectronic Engineering (2005)

Carbon hard mask structures have been used to etch a variety of materials typically used in sub 90nm DRAM manufacture. The results indicate that carbon hard masks can be used very effectively to structure oxide, nitride and metal films giving the CD performance required for the technologies being investigated.
Review of "Statistical Methods for Engineers and Scientists, by Robert M. Bethea, Benjamin S. Duran, and Thomas L. Boullion", Marcel Dekker, Inc., 1975
Venue: ACM SIGSIM Simulation Digest (1976)

Here is an introductory text in basic statistics that is original in its format and different from the many others in its sequence and treatment of the various basic topics in statistical analysis. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Case Study on the Extensibility of Network Processor Based Systems
Authors: B. K. Ng, Safi Uddin, Asaad A. Y. Malik Abusin, David Chieng
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

As the use of Internet become increasingly popular, diverse range of network applications which perform different functions are needed to serve user's requirements. However, network system developers face problem to incorporate these new services in their products since the conventional network equipment architectures are monolithic, inflexible, costly and induce long development time. Thus, many developers begin to build their products based on network processor technology that promises more flexibility and therefore, an extensible system. In this paper, we study on the issues and considerations that involved in performing extension on network processor based system. In particular, we address this issue by adding a new building block into the existing router design using Intel IXP2400 network processor.
A natural language processing system to assess user needs in information retrieval
Authors: Stephen B. Johnson
Venue:  (2005)

An important goal of Biomedical Informatics is the delivery of information to health care providers that can positively influence the health care process. The biomedical literature is a significant source of such information but it is difficult to access at the point-of-care. Information retrieval (IR) systems can deliver this information, but do not assist the clinician in understanding his or her information need. Our new approach to clinical IR specifies the information a clinician requires before formulating IR queries by analyzing relevant text documents with a new Medical Language Processing (MLP) system. We have designed a MLP system that can structure natural language for both representing contextual information and for conceptual IR. The system was designed specifically to require the minimum amount of human engineering. The system uses existing language resources, specifically the Unified Medical Language System's definitions for semantic types and relationships, to structure text into conceptual graphs. Our MLP system differs from existing MLP systems through its use of computerized learning techniques. Our system is capable of generating its knowledge structures solely from positive training examples. Furthermore, the system is robust and will never fail to generate a parse and therefore will always be able to pass a parse along to an IR system. The system uses a machine learned syntactic grammar as the foundation for a semantic one. Our results showed that using syntactic analysis prior to semantic parsing improved the system's ability to identify semantic relationships. This MLP system has been integrated into an existing information needs identification system. The system is able to generate information needs based on selected user text. This shifts the burden of articulating information needs away from the user; the user need only select a region of interesting text and the system will generate reasonable information needs based on that selection. When compared to human generated graphs, the system as a whole performed comparably in identifying user needs, although it still requires clinical evaluation to confirm that the generated needs are can be utilized in IR tasks.