ppxscal/embedding_network huggingface dataset:
Controlling the Memory During Manipulation of Word-Level Decision Diagrams
Authors: Sebastian Kinder, Gorschwin Fey, Rolf Drechsler
Venue: Proceedings of the 35th International Symposium on Multiple-Valued Logic (2005)

Decision Diagrams (DDs) are efficient data structures that are frequently used for formal verification, test or synthesis of circuits and systems. The main drawback of the data structure is the potential memory blow-up caused by certain functions. Therefore streaming has been proposed as a technique to efficiently evaluate operations on Binary DDs (BDDs). The maximal memory usage can be controlled and therefore calculations can be carried out with a small amount of memory. In this paper we show how streaming can be extended to Word-Level Decision Diagrams (WLDDs) and for which type of diagrams streaming is applicable. A detailed description of streaming forMulti-Terminal BDDs (MTBDDs) is given. Experiments show the efficiency and the small memory needs for operations on MTBDDs.
A combined hardware and software architecture for secure computing
Authors: Jürg Platte, Edwin Naroska
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Remote code execution becomes more and more important as can be seen by Grid computing or distributed computing projects like SETI@home. However, executing programs on foreign computers leads to security risks if the program contains sensitive data or algorithms. Current operating systems can protect user programs from other malicious programs running on the same host. But this does not prevent attacks from a system administrator or a malicious operating system. Further, even if the operating system is trusted it is possible to physically intercept communication between main memory and processor to gather information about the executed programs. As a result, these security risks prevent the execution of sensitive algorithms or programs computing on sensitive data on not trustworthy remote systemsIn this paper we present a combined hardware and software architecture to provide a secure and tamper resistant computing environment without relying on trusted system administrators and a fully trusted operating system. Our proposed architecture provides a security enhancement implemented on top of a standard processor. Compared to external co-processor solutions, our architecture does not suffer from memory, functionality and performance limitations. Furthermore, normal and protected programs can be run concurrently in a multitasking environment
Rider's net moment estimation using control force of motion system for bicycle simulator
Authors: Jae-Cheol Shin, Chong-Won Lee
Venue: Journal of Robotic Systems (2004)

One of the challenging problems with bicycle simulators is to deal with the virtual bicycle dynamics that is coupled with rider's motion. For the virtual bicycle dynamics calculation and the real time simulation, it is necessary to identify the control inputs from the rider as well as the virtual environments. The steering, pedaling, and braking torques can be easily measured by using torque sensors and the virtual environments can be generated and provided by a visual system. However, direct measurement of the rider's net moment that significantly affects the bicycle motion is not practical. In this work, it is shown that six control forces of the Stewart platform-based motion system can be used for effective estimation of the rider's net moment, incorporated with the sliding mode controller with perturbation estimation. &copy; 2004 Wiley Periodicals, Inc.
MegaProto: A Low-Power and Compact Cluster for High-Performance Computing
Authors: Hiroshi Nakashima, Hiroshi Nakamura, Mitsuhisa Sato, Taisuke Boku, Satoshi Matsuoka, Daisuke Takahashi, Yoshihiko Hotta
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 11 - Volume 12 (2005)

"MegaProto" is a proof-of-concept prototype for our project "Mega-Scale Computing Based on Low-Power Technology and Workload Modeling", implementing our key idea that a million-scale parallel system should be built with densely mounted low-power commodity processors. It also serves as a platformto implement and evaluate our new technologies such as power conscious compilation, highly reliable and high performance networking, highly dependable cluster management, and multi-level scalable parallel programming. The building block of the MegaProto is a 1U-high 19 inch-rack mountable motherboard unit on which 16 low-power, one-dollar note-sized, commodity PCarchitecture daughterboards are mounted with a high bandwidth, 2Gbps per processor network based on Gigabit Ethernet. The peak performance of each unit is 14.4GFlops for the first version and will improve to 38.4GFlops in the second version through a processor/daughterboard upgrade. The intra- and inter-unit network bandwidths are 32Gbps and 16Gbps respectively. As for power consumption, the entire unit idles at less than 150W and consumes 300-330W maximum under extreme computational stress; this is comparable to or better than conventional 1U servers comprised of dual high-performance, power hungry processors, while benchmarks exhibit up to 279% superior performance for some NPB programs. This demonstrates that higher performance can be achieved with low-power, densely populated architectures with commodity components.
Invariant spaces and cosine transforms DCT - 2 and DCT - 6
Authors: Bozhan Zhechev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In paper two types of the discrete cosine (and sine) transforms (DCT/DST) are analyzed. These transforms are useful for many applications. It is shown that if an operator, connected with the Discrete Fourier Transform (DFT), is referred to an appropriate basis it takes block-diagonal form. These blocks coincide with DCT-2/DST-2 for even dimensions of the signals' space and with DCT-6/DST-6 for odd ones. These results complete investigating the full structure of the DCT/DST. The other transforms DCT-3/DST-3 and DCT-7/DST-7 have simple connection with these one -- they are transposed to them.
A Formal Representation of Hybrid Mobile Components
Authors: Fernando J. Barros
Venue: Simulation (2005)

The Heterogeneous Flow System Specification (HFSS) is a modeling formalism that represents hybrid simulation components in a modular and hierarchical form. The HFSS formalism exploits the hierarchical aspects of modeling by permitting the representation of dynamic structure components. An important type of structural change involves the migration of a component between two models. This type of component is called a mobile component. Component mobility provides a natural representation for many complex systems composed of dynamic entities that move between places, providing a representation that structurally mimics the reality. The author identifies the key operations to support component mobility--namely, the ability to remove a component; transmit the component through a channel, possibly with some time delay; and restore the component at the destination. The author shows how mobile components can be used to represent mobile agents, a network technology that involves the migration of software units between computers through a computer network.
Communication complexity of common voting rules
Authors: Vincent Conitzer, Tuomas Sandholm
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, single transferable vote (STV), Condorcet, approval, Bucklin, cup, maximin, Borda, Copeland, and ranked pairs. For each rule, we first give a deterministic communication protocol and an upper bound on the number of bits communicated in it; then, we give a lower bound on (even the nondeterministic) communication requirements of the voting rule. The bounds match for all voting rules except STV and maximin.
A virtual human architecture that integrates kinematic, physical and behavioral aspects to control H-Anim characters
Authors: Lucio Ieronutti, Luca Chittaro
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

Virtual humans are being increasingly used in different domains. Virtual human modeling requires to consider aspects belonging to different levels of abstractions. For example, at lower levels, one has to consider aspects concerning the geometric definition of the virtual human model and appearance while, at higher levels, one should be able to define how the virtual human behaves into an environment. H-Anim, the standard for representing humanoids in X3D/VRML worlds, is mainly concerned with low-level modeling aspects. As a result, the developer has to face the problem of defining the virtual human behavior and translating it into lower levels (e.g. geometrical and kinematic aspects). In this paper, we propose VHA (Virtual Human Architecture), a software architecture that allows one to easily manage an interactive H-Anim virtual human into X3D/VRML worlds. The proposed solution allows the developer to focus mainly on high-level aspects of the modeling process, such as the definition of the virtual human behavior.
The Future of High-End Computing: Standing on One Another's Feet?
Authors: Daniel A. Reed
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Though the complexity of the most biological systems still outstrips the capabilities of even the largest computational systems, and will do so for some time to come, computer scientists working with biomedical scientists will produce higher and higher resolution images and combine imaging modalities to create more effective imaging and visualization tools to better understanding of biology and physiology across the scales of molecular, to cells to tissues to organs to organ systems.
Interrupted cognition and design for non-disruptiveness: the skilled memory approach
Authors: Antti Oulasvirta
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Interruptions have gained in importance as a topic in current HCI research. Through a series of experiments, we take a step toward analyzing the active role of human memory in controlling interruptions. The results of these experiments lead us to propose a novel approach, the skilled memory approach, to how UIs can support memory in skilled man-agement of and recovery from interruptions.
On Identifying Maximal Covers
Authors: S. Muñoz
Venue: SIAM Journal on Discrete Mathematics (2005)

In this paper we present an efficient procedure for identifying all maximal covers from the set of covers implied by a 0-1 knapsack constraint. It requires tight bounds for the cardinality of certain minimal covers and an ordering of the covers implied by the knapsack constraint. This type of maximal cover can be very useful for tightening 0-1 models. We also present a modification of the procedure to identify only maximal covers whose induced inequalities are violated by a given fractional solution. Some computational experiments are reported for randomly generated 0-1 knapsack constraints and for single source capacitated plant location problem instances drawn from the literature.
Use of morphological analysis in protein name recognition
Authors: Kaoru Yamamoto, Taku Kudo, Akihiko Konagaya, Yuji Matsumoto
Venue: Journal of Biomedical Informatics (2004)

Protein name recognition aims to detect each and every protein names appearing in a PubMed abstract. The task is not simple, as the graphic word boundary (space separator) assumed in conventional preprocessing does not necessarily coincide with the protein name boundary. Such boundary disagreement caused by tokenization ambiguity has usually been ignored in conventional preprocessing of general English. In this paper, we argue that boundary disagreement poses serious limitations in biomedical English text processing, not to mention protein name recognition. Our key idea for dealing with the boundary disagreement is to apply techniques used in Japanese morphological analysis where there are no word boundaries. Having evaluated the proposed method with GENIA corpus 3.02, we obtain F-measure of 69.01 on a strict criterion and 79.32 on a relaxed criterion. The result is comparable to other published work in protein name recognition, without resorting to manually prepared ad hoc feature engineering. Further, compared to the conventional preprocessing, the use of morphological analysis as preprocessing improves the performance of protein name recognition and reduces the execution time.
A Cheap and Safe COTS Wormhole for Local Area Networks
Authors: Andrey Brito, Francisco Brasileiro
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17 (2005)

The asynchronous system model is widely used as a programming model mainly because of its ability to model most existing systems. Also, programming to this model is easy and results in portable applications due to its weak assumptions. However, many important practical problems are not solved in this model (for example, consensus). To circumvent this limitation, researchers have added synchronism assumptions to the asynchronous model. These assumptions may be added in the time domain (i.e. the system sometimes behave synchronously) or in the space domain (i.e. there is some portion of the system which always behaves synchronously). In this work, we take the space based approach and equip asynchronous systems with a small synchronous subsystem (i.e. a Wormhole). We then use good engineering to support our assumptions in this portion of the system based on cheap off-the-shelf components such as Switched Ethernet networks, message prioritization and built-in hardware clocks. Finally, we discuss how some services, like perfect failure detection, can be implemented in such subsystem and propose safety mechanisms to be applied when the synchronism assumptions do not hold.
Smart sinks: real-world opportunities for context-aware interaction
Authors: Leonardo Bonanni, Ernesto Arroyo, Chia-Hsun Lee, Ted Selker
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Can implicit interaction with a computer easily drive useful interface improvements in physical world settings? This paper presents a case study presenting multiple such context-aware interaction improvements in a sink. We have identified opportunities where automated interfaces at the sink have positive consequences for safety, hygiene and ecology. The danger of scalding oneself with hot water is confronted by transforming the water into a graphical user interface and using image understanding to dispense the proper temperature of water. Audio-visual feedback at the sink can motivate users to conserve water. Used in combination with an RFID reader, the sink can serve as an effective means of verifying hand-washing compliance for clean environments. Finally, automatic actuation of the sink's height based on the user and task can prevent burns and ergonomic injuries. This project demonstrates that the integration of digital interaction in a hostile environment can facilitate and improve our daily rituals.
A Motivation Based Behavior in Hybrid Intelligent Agents for Intention Reconsideration Process in Vessel Berthing Applications
Authors: Prasanna Lokuge, Damminda Alahakoon
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Strategic planning and dynamism in decision making are essential factors in a vessel berthing application in any container port to assure faster turnaround time and high productivity. BDI agents have been used in many applications with limited capabilities. In this paper, wepropose a new hybrid BDI architecture with learning capacities overcoming some limitations exists in the generic BDI agent model. A new "knowledge Acquisition Model" (KAM) module is proposed with a supervised neural network and Adaptive neuro fuzzy inference system (ANFIS) in the intention reconsideration process of the agent model. Commitment strategy of the new intention reconsideration process is based on the motivation of the state transitions and the effect of belief changes in the environment
A formal approach to using data distributions for building causal polytree structures
Authors: M. Ouerd, B. J. Oommen, S. Matwin
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

We consider the problem of approximating an underlying distribution by one derived from a dependence polytree. We propose a formal and systematic algorithm, which traverses the undirected tree obtained by the Chow method [IEEE Trans. Inform. Theory 14 (1968) 462], and which subsequently processes the latter using the knowledge of inter-node independence tests. By using the tree structure and these independence tests, our scheme successfully orients the polytree using an application of the depth first search (DFS) strategy to multiple causal basins. The algorithm has been formally proven, and rigorously tested for synthetic and real-life data.
Reviews of "Machine Learning by Ryszard S. Michalski, Jaime G. Carbonell, and Tom M. Mitchell", Tioga publishing company, 1983, ISBN 0-935382-05-4.
Authors: Peter Norvig
Venue: Issue 90 (October 1984) (1984)

Machine Learning is in the enviable yet difficult position of being the first published collection of papers on the subject. By "machine learning" the editors refer to three distinct areas: the engineering of computer systems to learn in particular application areas, the theoretical analysis of learning algorithms, and the simulation of human learning processes. However, there is very little material on the third topic, and almost no mention of neurological models or biological theories of adaptation. The word "machine" is as important as "learning."
On time sharing systems' performance...
Authors: Sergio Bernstein
Venue: ACM SIGDA Newsletter (1974)

"Evaluating the performance of a time sharing system is difficult." 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
Web citation data for impact assessment: A comparison of four science disciplines: Book Reviews
Authors: Liwen Vaughan, Debora Shaw
Venue: Journal of the American Society for Information Science and Technology (2005)

The number and type of Web citations to journal articles in four areas of science are examined: biology, genetics, medicine, and multidisciplinary sciences. For a sample of 5,972 articles published in 114 journals, the median Web citation counts per journal article range from 6.2 in medicine to 10.4 in genetics. About 30&percnt; of Web citations in each area indicate intellectual impact (citations from articles or class readings, in contrast to citations from bibliographic services or the author's or journal's home page). Journals receiving more Web citations also have higher percentages of citations indicating intellectual impact. There is significant correlation between the number of citations reported in the databases from the Institute for Scientific Information (ISI, now Thomson Scientific) and the number of citations retrieved using the Google search engine (Web citations). The correlation is much weaker for journals published outside the United Kingdom or United States and for multidisciplinary journals. Web citation numbers are higher than ISI citation counts, suggesting that Web searches might be conducted for an earlier or a more fine-grained assessment of an article's impact. The Web-evident impact of non-UK&sol;USA publications might provide a balance to the geographic or cultural biases observed in ISI's data, although the stability of Web citation counts is debatable. &copy; 2005 Wiley Periodicals, Inc.
Constraint Solving for Proof Planning
Authors: Jürgen Zimmer, Erica Melis
Venue: Journal of Automated Reasoning (2004)

Proof planning is an application of AI planning to theorem proving that employs plan operators that encapsulate mathematical proof techniques. Many proofs require the instantiation of variables; that is, mathematical objects with certain properties have to be constructed. This is particularly difficult for automated theorem provers if the instantiations have to satisfy requirements specific for a mathematical theory, for example, for finite sets or for real numbers, because in this case unification is insufficient for finding a proper instantiation. Often, constraint solving can be employed for this task. We describe a framework for the integration of constraint solving into proof planning that combines proof planners and stand-alone constraint solvers. Proof planning has some peculiar requirements that are not met by any off-the-shelf constraint-solving system. Therefore, we extended an existing propagation-based constraint solver in a generic way. This approach generalizes previous work on tackling the problem. It provides a more principled way and employs existing AI technology.
Who Moved My Data? A Backup Tracking System for Dynamic Workstation Environments
Authors: Gregory Pluta, Larry Brumbaugh, William Yurcik, Joseph Tucek
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Periodic data backup is a system administration requirement that has changed as wireless machines have altered the fundamental structure of networks. These changes necessitate a complete rethinking of modern network backup strategies. The approaches of the 1980's and 1990's are no longer sufficient and must be updated. In addition to standard backup programs from vendors, specialized system administration tools are often needed. This paper examines one backup system and the major software components used to implement it. NCSA has developed a Backup Tracking System (BTS)[Note 1] to perform backup operations based on knowledge of the network and when each machine was last successfully backed up. BTS can chronologically list all computers: from those currently attached to the network through those that have ever been attached over the life of the BTS program. BTS also provides information about all backup operations including the time of last attempt, success state, amount backed up, etc. The BTS database also contains the date of the last successful backup for each machine and whether it has at least one VIP user (to be given preferred status during backups) or all non-VIP users.
Databases of Discovery
Authors: James Ostell
Venue: Queue (2005)

Open-ended database ecosystems promote new discoveries in biotech. Can they help your organization, too? The National Center for Biotechnology Information (NCBI), part of the National Institutes of Health (NIH), is responsible for massive amounts of data. A partial list includes the largest public bibliographic database in biomedicine (PubMed), the U.S. national DNA sequence database (GenBank), an online free full text research article database (PubMed Central), assembly, annotation, and distribution of a reference set of genes, genomes, and chromosomes (RefSeq), online text search and retrieval systems (Entrez), and specialized molecular biology data search engines (BLAST, CDD search, and others). At this writing, NCBI receives about 50 million Web hits per day, at peak rates of about 1,900 hits per second, and about 400,000 BLAST searches per day from about 2.5 million users. The Web site transfers about 0.6 terabytes per day, and people interested in local copies of bulk data FTP about 1.2 terabytes per day.