ppxscal/embedding_network huggingface dataset:
Result merging strategies for a current news metasearcher
Authors: Yves Rasolofo, David Hawking, Jacques Savoy
Venue: Information Processing and Management: an International Journal (2003)

Metasearching of online current news services is a potentially useful Web application of distributed information retrieval techniques. We constructed a realistic current news test collection using the results obtained from 15 current news Web sites (including ABC News, BBC and AllAfrica) in response to 107 topical queries. Results were judged for relevance by independent assessors. Online news services varied considerably both in the usefulness of the results sets they returned and also in the amount of information they provided which could be exploited by a metasearcher. Using the current news test collection we compared a range of different merging methods. We found that a low-cost merging scheme based on a combination of available evidence (title, summary, rank and server usefulness) worked almost as well as merging based on downloading and rescoring the actual news articles.
On the Completeness of Propositional Hoare Logic
Authors: Dexter Kozen, Jerzy Tiuryn
Venue:  (1999)

We investigate the completeness of Hoare Logic on the propositional level. In particular, the expressiveness requirements of Cook''s proof are characterized propositionally. We give a completeness result for Propositional Hoare Logic (PHL): all relationally valid rules {b1}p1{c1}, ..., {bn}pn{cn} --------------------------{b}p{c} are derivable in PHL, provided the propositional expressiveness conditions are met. Moreover, if the programs pi in the premises are atomic, no expressiveness assumptions are needed.
Quantum Theory of Optical NMR and ESR in Atoms
Authors: M. W. Evans
Venue:  (1991)

The quantum theory of laser induced nuclear spin and electron paramagnetic resonance (optical NMR and ESR respectively) is developed using the irreducible spherical representations of the appropriate mediating molecular property tensors, alpha (the vectoral polarisability), and beta (a magnetic electric hyperpolarisability). The quantum structure of the theory is developed with a simple application of the Wigner/Eckart theorem in the point group of atoms, and using Griffith/Harnung theory for the point groups of molecules. The results are expressed as simple laser induced shifts and splittings in hertz for comparision with experimental data.
Error injection aimed at fault removal in fault tolerance mechanisms-criteria for error selection using field data on software faults
Authors: J. Christmansson, P. Santhanam
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Fault injection allows a detailed study of complex interactions between faults and fault handling mechanisms. It can be a useful complement to analytical modeling and formal verification techniques in the testing of fault tolerant systems. However, work on fault injection has not matured adequately to provide industry with cost effective alternatives for the validation of fault tolerant systems. This study analyzes 408 customer discovered faults (defects) in a release of a large operating system product. We discuss methods to select the error types for an error injection experiment in the system test environment, aimed at fault removal. Using four levels of severity and a total of 24 error types as recorded in the customer defects records, we analyze the faults in terms of fault types and system test triggers as defined in ODC. Our work shows examples of criteria that can be used to select errors for injection that use the information from the field reported defects.
Macromedia ColdFusion MX Professional Projects
Authors: Rohit Kumar, Parag Rastogi
Venue:  (2003)

:Incorporating seven hands-on projects, Macromedia ColdFusion MX Professional Projects is your key to unlocking the power of this latest version of ColdFusion. Each project focuses on a specific concept and is based on a real-world situation. You will be able to use the skills that you develop throughout the book to modify the projects to fit your professional needs.
An Efficient Neural Controller for a DC Servo Motor by Using ANN and PLR Identifiers
Authors: H. Riza ÖZçalik, A. Küçüktüfekçi
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This work introduces an artificial neural network based rather efficient speed control for a DCmotor. For this task; first, the motor mathematical model is obtained in the digital form. Secondly, in order to be able to develop necessary inputs to drive the plant, open loop control signals, the direct and inverse models of the system are identified by conventional and ANNidentifiers working together. After that, a neural controller is introduced, which is trained by a composite error signal. The success of the designed control system is tested by a simulation study considering real conditions to be able to occur in actual operation.
Case Study in KSR Programming: Finding Outliers by the Minimum Volume Ellipsoid Method
Authors: Donna Bergmark, Mark Crovella
Venue:  (1992)

This case study describes the enablement of a parallel application on Cornell Theory Center''s KSR1, a highly parallel machine from Kendall Square Research. The application is from statistics, and exposes some interesting facets of the KSR as well as some parallel programming tools and techniques. Statistics are a novel application area for supercomputing, at least at the Cornell Theory Center. First we describe the application itself, then the approaches to parallelizing it, and finally present some results.
Depth from Flash
Authors: David B. Martin
Venue:  (2000)

Digital camera technology has recently seen substantial improvements in image quality while lower prices have made it affordable to the average consumer. Camera manufacturers, however, are not taking full advantage of this new medium for image capture. By filtering the already digitized image produced by these cameras through on-board image processing algorithms we can dramatically increase the power of digital cameras. For example, according to experts in the photographic industry, most people simply take bad pictures. Classic examples of this phenomenon are photographs taken indoors with a point-and-shoot style camera using its built-in flash. The subjects of these photographs often seem to have a spotlight on them, making them look bright and washed out while the rest of the photograph is dark and indistinct. This can primarily be accounted for by a well known property of point light sources: falloff in brightness is inversely proportional to the square of the distance between the light and the object being illuminated. A technique first introduced in the field of computer vision has been shown to successfully recover information about the distance between the light source and objects in the world. We propose using this technique, which is readily implementable in hardware, to correct for a variety of poorly illuminated digital images. 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 Quadratically Convergent Newton-Like Method Based Upon Gaussian-Elimination
Authors: Kenneth M. Brown
Venue:  (1968)

NO SUPPLIED 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
Smart and Stupid Networks: Why the Internet Is Like Microsoft
Authors: Odlyzko Andrew
Venue:  (1999)

Is the Internet growing primarily because it is a dumb network, one that simply delivers packets from one point to another? Probably not. If were a dumb network, we surely would not need huge and rapidly growing ranks of network professionals. A more detailed look suggests that the Internet is succeeding largely for the same reasons that led the PC to dominate the mainframe, and are responsible for the success of Microsoft. Like the PC, the Internet offers an irresistible bargain to a crucial constituency, namely developers, while managing to conceal the burden it places on users.
On energy-optimal voltage scheduling for fixed-priority hard real-time systems
Authors: Han-Saem Yun, Jihong Kim
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

We address the problem of energy-optimal voltage scheduling for fixed-priority hard real-time systems, on which we present a complete treatment both theoretically and practically. Although most practical real-time systems are based on fixed-priority scheduling, there have been few research results known on the energy-optimal fixed-priority scheduling problem. First, we prove that the problem is NP-hard. Then, we present a fully polynomial time approximation scheme (FPTAS) for the problem. For any &epsiv; > 0, the proposed approximation scheme computes a voltage schedule whose energy consumption is at most (1 + &epsiv;) times that of the optimal voltage schedule. Furthermore, the running time of the proposed approximation scheme is bounded by a polynomial function of the number of input jobs and 1/&epsiv;. Given the NP-hardness of the problem, the proposed approximation scheme is practically the best solution because it can compute a near-optimal voltage schedule (i.e., provably arbitrarily close to the optimal schedule) in polynomial time. Experimental results show that the approximation scheme finds more efficient (almost optimal) voltage schedules faster than the best existing heuristic.
Recent developments in DNA-computing
Authors: D. Rooss
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

L.M. Adleman (1994) published the description of a lab experiment, where he computed an instance of the Hamiltonian path problem with DNA in test tubes. He initiated a flood of further research on computing with molecular means in theoretical computer science. A great number of models was introduced and examined, concerning their computational power (universality as well as time and space complexity), their efficiency and their error resistance. The main results are presented in this survey.
MCAD/MCSD training Guide (70-320): Developing XML Web Services and Server Components with Visual C# >NET and the .NET Framework
Authors: Priti Kalani
Venue:  (2003)

:This certification exam measures the ability to develop and implement XML Web Services and server components using Visual C# and the Microsoft .NET Framework. This exam, released in September 2002, counts as a core credit toward the new MCAD (Microsoft Certified Application Developer) certification as well as a core credit toward the new MCSD .NET track. Readers preparing for this exam find our Training Guide series to be the most successful self-study tool in the market. This book is their one-stop shop because of its teaching methodology, the accompanying PrepLogic testing software, and superior Web site support. 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
Introducing an OO Technology in Non-OO Standard Environment
Authors: Igor B. Ushakov
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

This paper briefly describes basic practical steps for an Object Technology adoption in an industrial software development environment. The environment is considered standard: ISO 9000 certified software development process is assumed. A number of success factors are defined and considered how they are achieved, and what can be going wrong. The analysis of the factors is based on an experience gained from various software development projects and illustrated by real examples.
Configuration Management in Terms of Logical Structures
Authors: Yi Lin
Venue:  (1995)

When designing software, programmers usually think in terms of modules that are represented as functions and classes. But with existing configuration management systems, programmers have to deal with versions and configurations that are organized by files and directories. This is inconvenient and error-prone, since there is a gap between handling source code and managing configurations. In this thesis we present a framework for programming environments that handles configuration management directly in terms of functions and classes in the source code. We define the operations required for this purpose, study their semantics, and find a general strategy to support them. We show that our framework can handle a large module as a single unit, and argue that this ability can simplify configuration management issues in software reuse, cooperative programming, and software maintenance. We also present a formal model developed to serve as the foundation of our framework and a prototype environment used to verify our ideas. Our framework is centered around a set of objects. Each of those objects represents a function or a class in the source code and contains all the necessary data and operations to build object code and control versions of the function or class it is representing. Dependencies among functions and classes are described by links between objects, and high-level configuration management tasks are carried out by invoking the operations of individual objects. In contrast, most existing configuration management systems describe the relations between software components with separate scripts and carry out their functions with a set of tools that sit on top of a passive database or file system. 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
Visualizing Time-Series on Spirals
Authors: Marc Weber, Marc Alexa, Wolfgang Müller
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

In this paper, we present a new approach for the visualization of time-series data based on spirals. Different to classical bar charts and line graphs, the spiral is suited to visualize large data sets and supports much better the identification of periodic structures in the data. Moreover, it supports both the visualization of nominal and quantitative data based on a similar visualization metaphor. The extension of the spiral visualization to 3D gives access to concepts for zooming and focusing and linking in the data set. As such, spirals complement other visualization techniques for time series and specifically enhance the identication of periodic patterns.
Natural Language Programming for Multimedia Information
Authors: Eiichiro Kodama, Kiwamu Sato, Masatoshi Miyazaki
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Learning a programming language is difficult for the beginner of the computer. Therefore, it is necessary to build an intelligent programming environment in which the program can be written directly in the grammar of one's mother tongue. In this paper, we propose a model of an intelligent programming environment that is oriented to the Japanese. In this model, the text that describes in Japanese the layout of multimedia contents and the relationship between two multimedia contents can be parsed with the technology of machine translation, translated into an executable program, and executed. As an application of the proposed model, an environment called ACORNS is implemented. The performance study of ACORNS is performed. The results of the performance study shows that the proposed model is robust.
Inclusion tree layout convention: an empirical investigation
Authors: Kevin Pulo, Masahiro Takatsuka
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

The inclusion tree layout convention involves drawing trees as nested rectangles rather than the more common node-link diagrams. Finding good inclusion layouts presents some unique challenges, for example, the quantification of what is meant by the "size" of a rectangle. This paper empirically evaluates and investigates several rectangle size measures for their usefulness in the inclusion tree layout convention. We find that the area size measure, commonly used in graph drawing, is very poorly suited to the inclusion layout convention, whilst size measures based on the aspect ratio of the layout are more appropriate and give better results.
Quaternary Dynamic Differential Logic with Application to Fuzzy-Logic Circuits
Authors: Andreas Herrfeld, Siegbert Hetnschke
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

This paper introduces a new dynamic quaternary CMOS technique. Using only standard enhancement MOSFETs with no threshold modifications was one aim of the development. The difference between two successive logical voltages has to be greater than the threshold voltages of the MOSFETs. Thereby, a high noise margin can be reached. The paper shows dynamic circuits for connecting the quaternary circuits with binary ones. Furthermore, quaternary OR- and AND-gates are given. In connection with literal-operators, all quaternary logic functions can be realized with the technique introduced. In addition, four Fuzzy-logic circuits are shown, namely a bounded-sum and a bounded-difference circuit as well as a drastic-product and a drastic-sum circuit.
Agent-Based Grocery Shopping System Based on User's Preference
Authors: Kwang Hyoun Joo, Tetsuo Kinoshita, Norio Shiratori
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

We propose an agent-based grocery shopping system, which automates grocery-shopping process by comparing grocery information based on user's preference. The agents gather grocery information from several store server agents and compare it with user's preferences of groceries and stores. The agents could adapt to user's up-to-date preference by learning from his/her evaluation of previous shopping results. There are three organization agents in our system: a user agent, an information management agent, and a store server agent. The organization agent is responsible for organizing the primitive agents and coordinating message delivery. By implementing a prototype of the agent-based grocery shopping system, we have confirmed that it is instrumental in purchasing the best possible groceries of user's preference from several grocery stores. This system eliminates or reduces the burden of grocery shopping, and helps user save enormous time required shopping around grocery stores.
New Trends of Train Control and Management Systems with Real-Time and Non-Real-Time Properties
Authors: S. Shoji, A. Igarashi
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

The conventional train traffic control system has been focused on safety and punctuality in normal operations. Recently, however, more flexible and adaptive management has been required not only for train regulation, but also for maintenance, and in train delay situations. An autonomous decentralized train control and management system is proposed to attain both the real time property for train control such as train traffic and non real time property for train management such as scheduling. This subsystem has been developed to make these two heterogeneous subsystems coexist by isolating or coordinating mutually. This system has been applied to the train traffic control and management system for Japanese bullet train line (COSMOS: Computerized Safety Maintenance and Operation system of Shinkansen). The proposed system has been in operation since November 1995, and the effectiveness has been evaluated.
Domain Visualization for Digital Libraries
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Domain visualization aims to reveal the most significant intellectual structure associated with a subject domain. This article illustrates how domain visualization enables novel ways of accessing scientific literatures in digital libraries. The domain of computer graphics is visualized based on a citation analysis of articles appeared in the prestigious IEEE Computer Graphics and Applications over 18 years (1982-1999). The derived high-dimensional domain structure is uncovered using various visualization and animation techniques. Author co-citation maps open up new ways of visual information retrieval. Can users not only explore domain visualizations as a virtual landscape, but also invoke queries directly to a digital library. In this article, the domain visualization is linked to various citation-related information of scientific literatures on the Web through NEC's Research Index system. 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
Reconstructing Ownership Architectures To Help Understand Software Systems
Authors: Ivan T. Bowman, Richard C. Holt
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

Recent research suggests that large software sys-tems should have a documented system architec-ture. One form of documentation that may help describe the structure of software systems is the or-ganization of the developers that designed and im-plemented the software system.We suggest that an ownership architecture that documents the relationship between developers and source code is a valuable aid in understanding large software systems. If this document is not available, then we can reconstruct it based on the system implementation and other documentation.We examine Linux as a case study to demonstrate how to reconstruct and use this type of architecture. The reconstructed Linux ownership architecture provides information that complements other types of architectural documentation. It identifies experts for system components, shows non-functional de-pendencies, and provides estimates of the quality of components. Ownership architectures also al-low us to find problems such as under-staffed sub-systems and components that risk abandonment.
Efficient and Accurate Ethernet Simulation
Authors: Jia Wang, Srinivasan Keshav
Venue:  (1999)

The Internet is increasingly being called upon to provide different levels of service to different applications and users. A practical problem in doing so is that although Ethernet is one of the hops for nearly all communication in the Internet, it does not provide any QoS guarantees. A natural question, therefore, is the effect of offered load on Ethernet throughput and delay. In this paper, we present several techniques for accurately and quickly modeling the behavior of a heavily loaded Ethernet link. We first present a distributed approach to exact simulation of Ethernet, which eliminates sophisticated collision detection. Then, we describe an efficient distributed simulation model, called Fast Ethernet Simulation, that empirically models an Ethernet link to quickly and accurately simulate it. By eliminating the implementation of CSMA/CD protocol, our approach reduces computational complexity drastically while still maintaining desirable accuracy. Performance results show that our techniques not only add very little overhead (less than 5 in our tests) to the basic cost of simulating an Ethernet link, but also closely match real-world mesurements. We also present efficient techniques for compressing cumulative distributions using hyperbolic curves and for monitoring the load on a heavily-loaded link.