ppxscal/embedding_network huggingface dataset:
Temporal Probabilistic Object Bases
Authors: Veronica Biazzo, Rosalba Giugno, Thomas Lukasiewicz, V. S. Subrahmanian
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

There are numerous applications where we have to deal with temporal uncertainty associated with objects. The ability to automatically store and manipulate time, probabilities, and objects is important. We propose a data model and algebra for temporal probabilistic object bases (TPOBs), which allows us to specify the probability with which an event occurs at a given time point. In explicit TPOB-instances, the sets of time points along with their probability intervals are explicitly enumerated. In implicit TPOB-instances, sets of time points are expressed by constraints and their probability intervals by probability distribution functions. Thus, implicit object base instances are succinct representations of explicit ones; they allow for an efficient implementation of algebraic operations, while their explicit counterparts make defining algebraic operations easy. We extend the relational algebra to both explicit and implicit instances and prove that the operations on implicit instances correctly implement their counterpart on explicit instances.
Approximating Fill in Solving Sparse Linear Systems
Authors: Ajit Agrawal, Philip Klein, R. Ravi
Venue:  (1991)

In this paper, we present the first approximation algorithm for minimizing fill in solving a symmetric positive-definite sparse linear system of equations. Moreover, the elimination ordering of variables output by the algorithm also approximately minimizes two other important quantities: the total number of multiplications and the total time taken on a parallel machine to solve the problem using gaussian elimination. For a constant number of nonzero elements in each row and column, the performance guarantee is polylogarithmic in the number of variables. The bound is weaker in other cases. The problem of minimizing fill is directly related to the problem of minimum graph chordalization for which we give an approximation algorithm here. The algorithm is based on a method of Leighton and Rao for finding approximate balanced node separators in undirected graphs.
A Probabilistic Analysis of the Power of Arithmetic Filters
Authors: Olivier Devillers, Franco P. Preparata
Venue:  (1996)

The assumption of real-number arithmetic, which is at the basis of conventionalgeometric algorithms, has been seriously challenged in recent years,since digital computers do not exhibit such capability. A geometric predicate usually consists of evaluating the sign of some algebraic expression. In most cases, rounded computations yield a reliable result, but sometimes rounded arithmetic introduces errors which may invalidate the algorithms. The rounded arithmetic may produce an incorrect result only if the exact absolute value of the algebraic expression is smaller than some (small) $\varepsilon$, which represents the largest error that may arise in the evaluation of the expression. The threshold $\varepsilon$ depends on the structure of the expression and on the adopted computer arithmetic, assuming that the input operands are error-free. A pair (arithmetic engine,threshold) is an {\em arithmetic filter}. In this paper we develop a general technique for assessing the efficacy of an arithmetic filter. The analysis consists of evaluating both the threshold and the probability of failure of the filter. To exemplify the approach, under the assumption that the input points be chosen randomly in a unit ball or unit cube with uniform density, we analyze the two important predicates "which-side'''' and ''insphere''''. We show that the probability that the absolute values of the corresponding determinants be no larger than some positive value $V$, with emphasis on small $V$, is $\Theta(V)$ for the which-side predicate, while for the insphere predicate it is $\Theta(V^{\frac{2}{3}})$ in dimension 1, $O(V^{\frac{1}{2}})$ in dimension 2, and $O(V^{\frac{1}{2}}\ln \frac{1}{V})$ in higher dimensions. Constants are small, and are given in the paper.
THE POWER POLITICS GAME: offensive realism in theory and practice
Authors: David A. Reilly
Venue: Simulation and Gaming (2003)

The behavior of states in the international system, according to theories of power politics, is centered on survival. Individuals become citizens, relinquishing their right to self-govern, to improve their security. Their primary demand of the state, in return, is that it function to protect its citizens. The state, therefore, must develop strategies to ensure its survival. This has led historically to a concern about the power of a state relative to others. Given that the international system lacks a centralized authority capable of dictating and enforcing laws, each state must engage in self-help strategies. This simulation enables participants to experience power politics as they unfold and to serve as leaders attempting to ensure the survival of their state. They will develop foreign policies intended to improve their security and bargain for foreign assistance. The game is most effective as a learning tool when followed by a debriefing session that introduces the theories behind many of the activities they engaged in. The simulation and debriefing can be conducted in 1.5 to 2 hours.
Semantic Organization of Scenes Using Discriminant Structural Templates
Authors: Antonio B. Torralba, Aude Oliva
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

In this paper, we present a procedure for organizing real world scenes along semantic axes. The approach is based on the output energies of linear discriminant filters that take into account, or not, spatial information.We introduce three semantic axes along which pictures are ordered. The main semantic axis computes the degree of naturalness of a scene. Then, urban pictures are evaluated according to their degree of verticalness and natural scenes, according to their degree of openness. We observe the emergence of typical scene categories such as beach, mountain, skyscrapers, city center, etc., along the axes.
Noise Safety Design Methodologies
Authors: M. Graziano, M. Delaurenti, G. Masera, G. Piccinini, M. Zamboni
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The increasing densities in growing size circuits leads to consider as an issue noise problems as crosstalk, switching noise, electromigration and substrate injection. Noise safety must be a clear objective in design tools, which development must then include circuit models for the analysis of noise phenomena. This paper point out a proposed methodology in the developing of new models and related tools that focuses on noise immunity of circuit design.
Data Types for Very High Level Programming Languages
Authors: Narain Gehani
Venue:  (1975)

Very high level programming languages (higher than PL/I, Algol 60, etc.) attempt to free the programmer from providing details and let him concentrate on the algorithm for the problem at hand. The importance of very high level programming languages is further emphasized by decreasing machine costs, increased programming costs and the desire to have programs that are well structured, easy to understand and prove correct. Very high level languages provide powerful control structures and data structures that allow the problem to be specified in a natural manner. In this dissertation, we propose several ways of raising the level of a language. The different types of for iteration statements are consolidated into one general for statement. This, along with a new type, the domain of an array, provides us with an easy way of processing arrays; nested iteration statements are no longer necessary. The syntactic list and array generators and the concept of overloading make programming more flexible. The current notion that a data type is a set of values together with basic operations on that set leads us to conclude that formal parameter types need not be explicitly stated. Given a formal parameter X with operations $z_{1}, z_{2},\ldots, z_{n}$ being performed on it within the procedure, one should be able to supply, as an actual parameter in a call, a variable of any type that has the operations $z_{1}, z_{2},\ldots, z_{n}$ defined on it. For example, this concept allows us to write one procedure that finds the maximum value of the elements of an array of any dimension and any element or index type. Grids are arrays that can have any shape. Grid elements need not be contiguous i.e. grids can have holes in them. For example, grids can be trapezoidal, parabolic, rectangular with a hole or pyramid-like. Programs written using grids are more general than those written using arrays and/or functions to simulate non-array shapes. To alter an existing program to work for another grid shape one need only modify the grid declaration suitably, leaving the rest of the program intact. Programs are smaller, semantically clearer and have a more natural problem representation. Grids may be used to represent sparse matrices. Data security is achieved by allowing parts of grids pass as parameters to be readd only or completely masked out. Grids have been implemented as an extension to Fortran. Using Pascal as the base language, we show by series of examples from numerical analysis, data processing, engineering etc., how the above concepts raise the level of a programming language and how they blend together naturally and systematically. Efficient ways of implementing them are also discussed.
Network Based Genetic Algorithm
Authors: Kazunori Kojima, Wataru Kawamata, Hiroshi Matsuo, Masaaki Ishigame
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Parallel genetic algorithms are effective to solve large problems. Most of them are implemented in massive parallel computer and the efficiency depends on parallel computing system. It is inappropriate to implement them in a distributed computing system connected by network. This paper proposes a client-server based approach to parallel genetic algorithm with delegate management model that manages string exchange between subpopulations by the server and eliminates inter-subpopulation communications. It is easy to port and implement without any parallel computing systems. Some experiments solving Traveling Salesman Problem (100 cities) were carried out. The results show the effectiveness of the proposed model.
Computing Many Faces in Arrangements of Lines and Segments
Authors: K P Agawral, Matou\v{s}ek,  J\''{i}\v{r}\''{i}, Otfried Schwarzkopf
Venue:  (1994)

We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previously known ones. The main new idea is a simple randomized $O(n \log n)$ expected time algorithm for computing $\sqrt{n}$ cells in an arrangement of $n$ lines.
Continuity Management: Preserving Corporate Knowledge and Productivity When Employees Leave
Authors: Hamilton Beazley, Jeremiah Boenisch, David Harden
Venue:  (2002)

:This recurring management question, perhaps the most pressing of the Information Age, is insightfully answered in this groundbreaking book. Acute knowledge loss from downsizing and imminent baby-boomer retirements has exacerbated chronic knowledge loss from high job turnover; together, these factors pose an unprecedented threat to organizational productivity, profits, even survival. The loss of knowledge that accompanies an employee's transfer, resignation, termination, or retirement is the single most pervasive and costly source of knowledge mismanagement in corporate America today. But it doesn't have to be. Continuity Management describes a breakthrough process that transfers operational knowledge from departing employees to their successors. Knowledge continuity initiatives at Pfizer, Deloitte Consulting, EMC Corporation, the U.S. Army, and hundreds of other organizations are already under way. But such initiatives are just the beginning. They herald the sweeping change that continuity management will bring, revolutionizing how leaders manage and companies compete. Continuity management implementation generates decisive competitive advantages: faster ramp-up of new employees, improved customer satisfaction, greater innovation, a sustained commitment to learning, and increased productivity. Until now, knowledge continuity has been the missing link in the new paradigm that recognizes the organization as a network of thoughts rather than a hierarchy of positions -- and knowledge as the force that binds, directs, and vitalizes it. Revolutionary in its effect, but evolutionary in its practice, continuity management is central to the tidal wave that is reshaping organizational knowledge flow and creation in the new century and transforming the way we think about knowledge. Based on extensive research, this book offers a solution to knowledge loss that managers at any organizational level can use. Continuity management is fueling a new knowledge revolution. This book is about that revolution -- and how to lead it.
A Lightweight Middleware Protocol for Ad Hoc Distributed Object Computing in Ubiquitous Computing Environments
Authors: Stephen S. Yau, Fariaz Karim
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Devices in ubiquitous computing environments are usually embedded, wearable, and handheld, have resource constraints, and are all connected to each other through wireless connections and other computers possibly through fixed network infrastructures, such as the Internet. These devices may form numerous webs of short-range and often low-power mobile ad hoc networks to exchange information. Distributed object computing (DOC) middlewaretechnologies have been successful in promoting high quality and reusable distributed software for enterprise-oriented environments. In order to reap the same benefit in ubiquitous computing environments, it is important to note that the natural interactions among distributed objects in ubiquitous computing environments are quite different due to various factors, such as bandwidth constraints, unpredictable device mobility, network topology change, and context-sensitivity (or situation-awareness) of application objects. Hence, the interactions among distributed objects tend to be more spontaneous and short-lived rather than predictable and long-term. In this paper, a middleware protocol, RKF, to facilitate distributed object-based application software to interact in an ad hoc fashion in ubiquitous computing environments is presented. RKF addresses both spontaneous object discovery and context-sensitive object data exchange. Our experimental results, based on RKF's implementation and evaluation inside the object request broker of our RCSM middleware test bed, indicate that it is lightweight, has good performance, and can be easily used in PDA-like devices.
Dequantization Bias for JPEG Decompression
Authors: Jeffery R. Price, Majid Rabbani
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Standard JPEG decompression reconstructs quantized DCT coefficients to the center of the quantization bin. This fails to exploit the nonuniform distribution of the AC coefficients. Assuming a Laplacian distribution, we derive a maximum likelihood estimate of the Laplacian parameter, based on the quantized coefficients available at the decoder, and use this estimate to optimally bias the reconstruction levels during decompression. As a decoder enhancement, this technique is fully compatible with the JPEG standard and does not modify the JPEG compressed bit stream. Extensive simulations indicate that, at typical compression ratios, biased re-construction results in modest PSNR improvements - about 0.25 dB or higher - and slight subjective improvements, for little or no computational cost. Furthermore, simulations show that the PSNR improvements are very close (within 0.07 dB) to the best theoretically possible.
Extending Moore's Law through Advances in Semiconductor Manufacturing Equipment
Authors: Ashok K. Sinha
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

After more than thirty years of effectiveness, associated benefits to the electronics industry and several false alarms, it appears that Moore's Law' is again threatened with derailment. These threats are in the form of a convergence of three waves which requires major necessary changes relating to: a)Lithography below O.l3µm, which involves printing and aligning at sub-micron wavelength dimensions with new unproven lasers/lens systems. b)Cu/low-? interconnect technology, which is facing major challenges in achieving commercially viable yields. c )300mm wafer size conversion, which requires an extensive retooling of the entire industry. 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
Communication Interface with Eye-Gaze and Head Gesture Using Successive DP Matching and Fuzzy Inference
Authors: Hidetoshi Nonaka
Venue: Journal of Intelligent Information Systems (2003)

This paper proposes a communication interface with eye-gaze and head gesture. Visual sensorimotor integration with eye-head cooperation is considered, especially head gesture accompanied with vestibulo-ocular reflex is used for selecting object in the screen. Eye-mark recorder and motion tracking system were used to tracking eye movement and head movement, respectively. Nonverbal response animation with eye contact was introduced in the interaction system. In identifying the head gesture, we adopted a modified dynamic programming matching method and fuzzy inference.
On Structural vs. Functional Testing for Delay Faults
Authors: Angela Krstic, Jing-Jia Liou, Kwang-Ting (Tim) Cheng, Li-C. Wang
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

A structurally testable delay fault might become untestable inthe functional mode of the circuit due to logic or timing constraints or both. Experimental data suggests that there couldbe a large difference in the number of structurally and functionally testable delay faults. However, this difference is usually calculated based only on logic constraints. It is unclearhow this difference would change if timing constraints weretaken into consideration, especially when using statistical timing models. In this paper, our goal is to better understandhow structural and functional test strategies might affect thedelay test quality and consequently, change our perception ofthe delay test results.
Performance Tradeoffs in Real-Time Transaction Processing with Client Data Caching
Authors: Hyunchul Kang, YoungSung Kim
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

The client-cached data can enhance performance of transaction processing in a client-server DBMS. It can improve the throughput of the committed transactions and can reduce the response time of each individual transaction. Does this client data caching also lend itself to processing of real-time transactions with timing constraints? In this paper, we investigate the performance tradeoffs in real-time transaction processing with client data caching in a client-server DBMS. Through a series of simulation experiments with two types of algorithms RTS/NC(Real-Time Scheduling with No Cache) and RTS/C(Real-Time Scheduling with Cache), we present and analyze how the performance of real-time transaction processing is affected when the number of clients, the client cache size, and the write probability of transactions vary.
Speech Support in Wireless, Multihop Networks
Authors: Hsiao-Kuang Wu, Chia-Heng Hung, Mario Gerla, Rajive Bagrodia
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper we address the evaluation of speech quality through a wireless network as perceived by the user. User perceived evaluation (in addition to the usual network metrics including delay, throughput, packet loss statistics etc) is critical in the design of wireless multimedia networks where speech and video play a key role and are affected by several factors, such as network performance and encoding scheme. We use two approaches for our evaluation: small scale testbed implementation and hybrid simulation. The testbeds are implemented either by UDP (User Datagram Protocol) connection or UCLA talk connection. The hybrid simulation is event driven and is based on the Maisie parallel simulation language. It uses speech traces for inputs and plays back the speech outputs off line. There are several advantages in using the simulation tool, mainly from the point of view of scalability and new protocol feature testing. At the same time, the real life testbed provides verification of the simulator assumptions, albeit on a small scale.
Intelligent Text Handling Using Default Logic
Authors: Anthony Hunter
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

There is a need to develop more intelligent means for handling text in applications such as information retrieval, information filtering, and message classification. This raises the need for mechanisms for ascertaining what an item of text is about. Even though natural language processing offers the best results, it is not always viable. A less accurate, but more viable alternative, is to reason with keywords in the text. Unfortunately, classical reasoning is often inadequate for determining from some keywords what a text is about. In particular, it does not allow context-dependent interpretation of keywords. So for example, if some text has the keyword "oil", it is usually also about "minerals", though with exceptions such as when it has the keyword "cooking". To address this kind of problem, we consider a model of ``aboutness'' based on default logic.
An independent software-modification method
Authors: T. Shimomura, Y. Oki, T. Chikaraishi, T. Ohta
Venue: Proceedings of the International Conference on Software Maintenance (1995)

After parts of a program have been modified to incorporate specification changes or functional enhancements, regression testing has generally been necessary to confirm that the other parts of the program still operate according to original specifications, since the modifications may have affected those parts. It has been reported that program slicing techniques extracting the parts of a program that perform calculations both for the functions to be modified and for functions not to be modified enable modifications to be made without influencing the operations of non modified functions. Such techniques, though, cannot prevent the non modified parts from influencing the modified parts. We analyze the influence of non modified parts on modified parts and then present an independent modification method that automatically eliminates such influence and that of course also prevents the non modified functions from being affected by the modifications. This method makes it possible for a programmer to modify a program by concentrating only on those parts that perform calculations related to the functions to be modified. In addition, because testing performed only for the modified parts gives the same results as does testing the entire program, this method makes it unnecessary to test non modified functions.