ppxscal/embedding_network huggingface dataset:
Some Results Regarding the Estimation of Densities and Random Variate Generation Using Neural Networks
Authors: Malik Magdon-Ismail, Amir Atiya
Venue:  (2000)

In this paper we consider two important topics: density estimation and random variate generation. We will present a framework that is easily implemented using the familiar multilayer neural network. First, we develop two new methods for density estimation, a stochastic method and a related deterministic method. Both methods are based on approximating the distribution function, the density being obtained by differentiation. In the second part of the paper, we develop new random number generation methods. Our methods do not suffer from some of the restrictions of existing methods in that they can be used to generate numbers from an observed inverse relationship between the density estimation process and the random number generation process. We present two variants of this method -- a stochastic and a deterministic version. We propose a second method that is based on formulating the task as a control problem, where a "controller network" is trained to shape a given density into the desired density. We justify the use of all the methods that we propose by providing theoretical convergence results. In particular, we prove that the L8 convergence to the true density to both the density estimation and random variate generation techniques occurs as a rate O((log log N/N)^((1-e)/2) where N is the number of data points and e can be made arbitrarily small for sufficiently smooth target densities. This bound is very close to the optimally achievable convergence rate under similar smoothness conditions. Also, for comparison, the L2 (RMS) convergence rate of a positive kernel density estimator is O(N^(-2/5)) when the optimal kernel width is used. We present numerical simulations to illustrate the performance of the proposed density estimation and random variate generation methods. In addition, we present an extended introduction and bibliography that serves as an overview and reference for the practitioner.
Multiresolution vision in autonomous systems
Authors: Pelegrín Camacho, Fabián Arrebola, Francisco Sandoval
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

The performance of many autonomous systems based on artificial vision depends mainly on the speed of response and the field of view of the vision systems. The many tasks to be carried out, such as object detection, recognition, tracking, etc., the complexity of reliable algorithms and tasks to be done in real time, and the huge data volumes involved with stereo vision systems, imply processing times and resources that, in some cases, are incompatible with or unsuitable for acceptable system operation. Multiresolution systems are one alternative to cover wide fields of view without involving high data volumes and, therefore, considerably reduce the constraints imposed by off-the-shelf uniresolution vision systems.Our work is related to adaptive space-variant sensors, able to supply any number of resolution levels with reconfigurable resolution profiles around regions or objects of interest, and to the specific algorithms and hierarchical data structures related to processing multiresolution data involved in tasks of image segmentation, object detection, etc. required for operation in dynamic environments.
An Algorithm for a Truncated Solution of a Fault Tree
Authors: B J Dugan
Venue:  (1988)

In [1], Martensen and Butler present a method for bounding the reliability of a system by analyzing only a subset of the entire set of state vectors. From the description of the algorithm given in the Appendix A of [1], it appears that the authors assume that there is no case in which a state representing $i+1$ failed components is more probable than some state with only $i$ failed components. We present a modification to the Martensen-Butler technique which holds in the more general case. The general approach taken in this paper is to bound the maximum probability associated with the state vectors that have not been analyzed. The state vectors are partitioned into subsets, and an error term equal to the maximum contribution of each subset to the system failure probability is calculated. A collection of subsets is formed such that the sum of the error terms associated with the subsets is smaller than the largest acceptable error in the overall system failure probability. The chosen subsets of state vectors need not be analyzed for their contribution to the system failure probability in order to be assured that the desired accuracy is reached.
Programming with Inductive and Co-Inductive Types
Authors: John Greiner
Venue:  (1992)

We look at programming with inductive and co-inductive datatypes, which are inspired theoretically by initial algebras and final co-algebras, respectively. A predicative calculus which incorporates these datatypes as primitive constructs is presented. This calculus allows reduction sequences which are significantly more efficient for two dual classes of common programs than do previous calculi using similar primitives. Several techniques for programming in this calculus are illustrated with numerous examples. A short survey of related work is also included.
A complete calculus for equational deduction in coalgebraic specification
Authors: Andrea Corradini
Venue:  (1997)

The use of coalgebras for the specification of dynamical systems with a hidden state space is receiving more and more attention in the years, as a valid alternative to algebraic methods based on observational equivalences. However, to our knowledge, the coalgebraic framework is still lacking a complete equational deduction calculus which enjoys properties similar to those stated in Birkhoff''s completeness theorem for the algebraic case. In this paper we present a sound and complete equational calculus for coalgebras of a restricted class of polynomial functors. This restriction allows us to borrow some ``algebraic'''' notions for the formalization of the calculus. Aditionally, we discuss the notion of `colours'' as a suitable dualization of variables in the algebraic case. Then the completeness result is extended to the ``non-ground'''' or ``coloured'''' case, which is shown to be expressive enough to deal with equations of hidden sort. Finally we discuss some weaknesses of the proposed results with respect to Birkhoff''s, and we suggest possible future extensions.
Dynamic reasoning without variables
Authors: D. J Eijck
Venue:  (1998)

A variable free notation for dynamic logic is proposed which takes its cue from De Bruijn''s variable free notation for lambda calculus. De Bruijn indexing replaces variables by indices which indicate the distance to their binders. We propose to use reverse De Bruijn indexing, which works almost the same, only now the indices refer to the depth of the binding operator in the formula. The resulting system is analysed at length and applied to a new rational reconstruction of discourse representation theory. It is argued that the present system of dynamic logic without variables provides an explicit account of anaphoric context and yields new insight into the dynamics of anaphoric linking in reasoning. A calculus for dynamic reasoning with anaphora is presented and its soundness and completeness are established.
Mobile Cultures: New Media in Queer Asia (Console-Ing Passions Ser.)
Authors: Chris Berry, Fran Martin, Audrey Yue
Venue:  (2003)

:Mobile Cultures provides much-needed, empirically grounded studies of the connections between new media technologies, the globalization of sexual cultures, and the rise of queer Asia. The availability and use of new media -- fax machines, mobile phones, the Internet, electronic message boards, pagers, and global television -- have grown exponentially in Asia over the past decade. This explosion of information technology has sparked a revolution, transforming lives and lifestyles, enabling the creation of communities and the expression of sexual identities in a region notorious for the regulation of both information and sexual conduct. Whether looking at the hanging of toy cartoon characters like "Hello Kitty" from mobile phones to signify queer identity in Japan or at the development of queer identities in Indonesia and Singapore, the essays collected here emphasize the enormous variance in the appeal and uses of new media from one locale to another. Scholars, artists, and activists from a range of countries, the contributors chronicle the different ways new media galvanize queer communities in Taiwan, South Korea, Japan, Indonesia, Thailand, Malaysia, and India, and around the world. They consider phenomena such as the uses of the Internet among gay, lesbian, and queer individuals in Taiwan and South Korea, the international popularization of Japanese queer pop culture products such as Yaoi manga, and a Thai website's reading of a scientific tract on gay genetics in light of Buddhist beliefs. Essays also explore the politically subversive possibilities opened up by the proliferation of media technologies, examining, for instance, the use of Cyberjaya -- Malaysia's government-backed online portal -- to form online communities in the face of strict antigay laws.
An approach for the extensional integration of data sources with heterogeneous representation formats
Authors: Luigi Pontieri, Domenico Ursino, Ester Zumpano
Venue: Data Knowledge Engineering (2003)

In this paper we propose an approach for the extensional integration of data sources with heterogeneous representation formats. The proposed approach is based on the exploitation of a new model, called E-SDR-Network, for representing and handling, at the extensional level, heterogeneous data sources, ranging from databases to XML documents, object exchange model graphs and other semi-structured data. Due to the specific features of E-SDR-Network, the proposed extensional integration methodology is capable of: (i) easily handling null or unknown values, (ii) producing consistent query answers from possibly inconsistent data and (iii) reconstructing, at the extensional level, the content of each data source involved in the integration task. Finally, we show that E-SDR-Network and the proposed extensional integration algorithm are the counterpart, at the extensional level, of the SDR-Network conceptual model and the associated intensional integration algorithm, already proposed in the literature. Therefore, in the whole, we obtain a complete approach consisting of two components performing synergically both the intensional and the extensional integration of data sources having heterogeneous data representation formats.
Experience Report - Restructure of Processes Based on ISO/IEC 12207 and SW-CMM in CELEPAR
Authors: Cristina Filipak Machado, Luiz Carlos de Oliveira, Rosane Antunes Fernandes
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

This paper describes the CELEPAR experience using ISO/IEC 12207- Software Life Cycle Processes [1] and the Software-CMM -Capability Maturity Model [2] to improve and organize the maintenance and development processes.
Probabilistic bottom-up join order selection --- breaking the curse of NP-completeness
Authors: Florian Waas, J. Pellenkoft
Venue:  (1999)

Join-ordering is known to be NP-complete and therefore a variety of heuristics have been devised to tackle large queries which are considered computational intractable otherwise. However, practitioners often point out that typical problem instances are not difficult to optimize at all. In this paper we address that seeming discrepancy. We present a probabilistic bottom-up join-ordering technique that is distinguished by the high-quality results achieved, the extremely short running time and---most notable---its independence of the search space''s size. The subsequent thorough analysis of the algorithm''s principle confirm our experimental results.
Field Applied Molecular Dynamics (FMD) Computer Simulation of Circular Dichroism and Optical Rotatory Dispersion: The Discovery by FMD of Bi-Axial Rosenfeld Birefringence
Authors: M. W. Evans, S. Wozniak, G. Wagniere
Venue:  (1991)

Field applied molecular dynamics (FMD) computer simulation is used to investigate circular dichroism (CD) and optical rotatory dispersion (ORD) in the picosecond time window (far infra red frequency interval) using second order rise transients (RSs) and a range of time correlation functions (CFs) in the presence of right and left circularly polarised (c.p.) lasers propagating in a) chiral (S)-CHbrClF; and b) achiral liquid water. In case a) simulated RSs and CFs are computed using the torque mediated by the Rosenfeld tensor, and are found to be different for right and left c.p. lasers, and the FMS results are expressed in terms of a set of novel, pseudoscalar, difference CFs. Detailed agreement is found between the RTs and analytical Langevin Kielich functions, and the first far infra red ORD spectrum is isolated in terms of a novel rotational velocity difference CF for different applied laser intensities. In case b) pseudoscalar difference functions between right and left c.p. lasers are not observed, indicating that there is no CD or ORD in water, but a novel anisotrophy develops due to surviving off-diagonal elements of the Rosenfeld tensor in water.
Performance Analysis of Flat and Layered Gossip Services for Failure Detection and Consensus in Scalable Heterogeneous Clusters
Authors: K. Sistla George, R. Todd, R. Tilak
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

Gossip protocols and services provide a means bywhich failures can be detected in large, distributed systemsin an asynchronous manner without the limits associatedwith reliable multicasting for group communications.Gossiping with consensus can take place throughout thesystem via a flat structure, or it can be hierarchicallydistributed across cooperating layers of nodes. In thispaper, the performance of flat and layered protocols isanalyzed on an experimental testbed in terms of consensustime and scalability. Performance associated with layeredgossip is analyzed with varying group sizes and is shownto scale well in a heterogeneous environment.
Mobile Agents: Motivations and State-of-the-Art Systems
Authors: Robert S. Gray, David Kotz, George Cybenko, Daniela Rus
Venue:  (2000)

A mobile agent is an executing program that can migrate, at times of its own choosing, from machine to machine in a heterogeneous network. On each machine, the agent interacts with stationary service agents and other resources to accomplish its task. In this chapter, we first make the case for mobile agents, discussing six strengths of mobile agents and the applications that benefit from these strengths. Although none of these strengths are unique to mobile agents, no competing technique shares all six. In other words, a mobile-agent system provides a single general framework in which a wide range of distributed applications can be implemented efficiently and easily. We then present a representative cross-section of current mobile-agent systems.
Proving Temporal Properties of Concurrent Programs: A Non-Temporal Approach
Authors: Bowen Alpern
Venue:  (1986)

This thesis develops a new method for proving properties of concurrent programs and gives formal definitions for safety and liveness. A property is specified by a property recognizer a finite-state machine that accepts the sequences of program states in the property it specifies. A property recognizer can be constructed for any temporal logic formula. (ABRIDGED )
Introducing "Quality in use": the usability service model of Swiss Re
Authors: Andreas Bau, Marc Hassenzahl, Markus Geissbühler
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Shows how the user-centred organisational maturity of the company Swiss Re was assessed, the Usabiluty Service Model (USM) was applied, and how usability was introduced into the software development process.
A source-based algorithm for delay-constrained minimum-cost multicasting
Authors: Qing Zhu, M. Parsa, J. J. Garcia-Luna-Aceves
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

A new heuristic algorithm is presented for constructing minimum-cost multicast trees with delay constraints. The new algorithm can set variable delay bounds on destinations and handles two variants of the network cost optimization goal: one minimizing the total cost (total bandwidth utilization) of the tree, and another minimizing the maximal link cost (the most congested link). Instead of the single-pass tree construction approach used in most previous heuristics, the new algorithm is based on a feasible search optimization method which starts with the minimum-delay tree and monotonically decreases the cost by iterative improvement of the delay-bounded tree. The optimality of the costs of the delay-bounded trees obtained with the new algorithm is analyzed by simulation. Depending on how tight the delay bounds are, the costs of the multicast trees obtained with the new algorithm are shown to be very close to the costs of the trees obtained by the Kou, Markowsky and Berman's algorithm (1981).
Expressing Deduction Rules Using SQL - A Declarative Approach
Authors: Mark McLoughlin
Venue:  (1993)

Logical relationships discovered during the conceptual design phase of system development are rarely fully realised in the final implemented system. Rules implemented as Prolog rules. SQL views or triggered SQL procedures typically express only part of the original conceptual relationship. We look at a method of expressing and processing rules which allows the true conceptual relationship to be expressed. The approach we take is to represent deduction rules as SQL queries which determine when the rule, when viewed as a constraint, is being violated. This method is non-directed and so allows any of the terms in a rule to be inferred from the others.
A Practical Nonblocking Queue Algorithm Using Compare-and-Swap
Authors: Chien-Hua Shann, Ting-Lu Huang, Cheng Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory management problem: a dequeued node cannot be freed or reused without proper handling. The problem is usually overlooked; one just assumes the existence of a lower level mechanism, which takes care of all the details of handling the problem. Employing such a mechanism incurs significant overheads, and consequently the link-based queues may not perform as well as claimed. A new nonblocking queue algorithm based on a finite array is proposed in this paper. Comparing with the link-based algorithms, the new algorithm provides the same degree of concurrency without being subject to the memory problem, hence suggests a good performance.
A Genetic Algorithm for Optimal 3-Connected Telecommunication Network Designs
Authors: Runhe Huang, Jianhua Ma, D. Frank Hsu
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper, a genetic algorithm for three connected telecommunication network designs is proposed. The genetic algorithm uses a new approach to solution representation, in which constraints such as diameter and connectivity constraints can be easily encoded and two-point crossover with the operation of swapping duplicated nodes ensures solutions generated through genetic evolution are all feasible so that both checking of the constraints and repair mechanism can be avoided. Both efficiency and effectiveness are increased due to no checking of the constraints and no repair mechanism conducted. In fact, our design algorithm for three-connected network design can be extended to a high-connectivity network design.
Integrating Human Factors with Software Engineering Practices
Authors: William E. Hefley, Elizabeth A. Buie, Gene F. Lynch, Michael J. Muller, Douglas G. Hoecker, Jim Carter, J. T Roth
Venue:  (1994)

Engineering processes and methodologies used in building tomorrow''s systems must place a greater emphasis on designing usable systems that meet the needs of the systems'' users and their tasks. This paper identifies the need for defining human factors and human-computer interaction (HCI) engineering activities that contribute to the design, development, and evaluation of usable and useful interactive systems, and presents a rationale for integrating these activities with software engineering and incorporating them into the system life cycle.
Generalized gradient approximations to density functional theory: comparison with exact results
Authors: Claudia Filippi, Xavier Gonze, C. J. Umrigar
Venue:  (1996)

In order to assess the accuracy of commonly used approximate exchange-correlation density functionals, we present a comparison of accurate exchange and correlation potentials, exchange energy densities and energy components with the corresponding approximate quantities. Four systems are used as illustrative examples: the model system of two electrons in a harmonic potential and the De, Be and Ne atoms. A new ingredient in the paper is the separation of the exchange-correlation potential into exchange and correlation according to the density functional theory definition.
On the Sufficiency of Limited Testing for Knowledge Based Systems
Authors: Tim Menzies, Bojan Cukic
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Knowledge-based engineering and computational intelligence are expected to become core technologies in the design and manufacturing for the next generation of space exploration missions. Yet, if one is concerned with the reliability of knowledge based systems, studies indicate significant disagreement regarding the amount of testing needed for system assessment. The sizes of standard black-box test suites are impracticably large since the black-box approach neglects the internal structure of knowledge-based systems. On the contrary, practical results repeatedly indicate that only a few tests are needed to sample the range of behaviors of a knowledge-based program. In this paper, we model testing as a search process over the internal state space of the knowledge-based system. When comparing different test suites, the test suite that examines larger portion of the state space is considered more complete. Our goal is to investigate the trade-off between the completeness criterion and the size of test suites. The results of testing experiment on tens of thousands of mutants of real-world knowledge based systems indicate that a very limited gain in completeness can be achieved through prolonged testing. The use of simple (or random) search strategies for testing appears to be as powerful as testing by more thorough search algorithms.