ppxscal/embedding_network huggingface dataset:
Embedding Branch and Bound within Evolutionary Algorithms
Authors: Carlos Cotta, José M. Troya
Venue: Applied Intelligence (2003)

A framework for hybridizing evolutionary algorithms with the branch-and-bound algorithm (B B) is presented in this paper. This framework is based on using B B as an operator embedded in the evolutionary algorithm. The resulting hybrid operator will intelligently explore the dynastic potential (possible children) of the solutions being recombined, providing the best combination of formae (generalized schemata) that can be constructed without introducing implicit mutation. As a basis for studying this operator, the general functioning of transmitting recombination is considered. Two important concepts are introduced, compatibility sets, and granularity of the representation. These concepts are studied in the context of different kinds of representation: orthogonal, non-orthogonal separable, and non-separable.The results of an extensive experimental evaluation are reported. It is shown that this model can be useful when problem knowledge is available in the form of an optimistic evaluation function. Scalability issues are also considered. A control mechanism is proposed to alleviate the increasing computational cost of the algorithm for highly multidimensional problems.
Taligent's CommonPoint: The Promise of Objects
Authors: Ware Myers
Venue: Computer (1995)

Taligent has begun to lift the cover on its ambitious framework- based development environment: The CommonPoint Application Environment, the Taligent Development Environment (TalDE), and Taligent Object Services (TalOS). The CommonPoint Application Environment contains more than 100 frameworks that provide the functionality required across most client domains. TalDE contains the tools useful in object-oriented and, more specifically, framework-based development. Though currently running on top of 32-bit multitasking operating systems from IBM and Hewlett-Packard, Taligent will soon provide its own fully object-oriented operating system, TalOS. The new environment suggests the tantalizing possibility of "zero- lines-of-code programming." This article provides a closer look at this open, portable architecture that is both hardware and operating system independent.
Parametric modeling of photometric signals
Authors: A. Ferrari, J. Y. Tourneret, G. Alengrin
Venue: Signal Processing (2002)

This paper studies a new model for photometric signals under high flux assumption. Photometric signals are modeled by Gaussian autoregressive processes having the same mean and variance denoted Constraint Gaussian Autoregressive Processes (CGARP's). The estimation of the CGARP parameters is discussed. The Cramér Rao lower bounds for these parameters are studied and compared to the estimator mean square errors. The CGARP is intended to model the signal received by a satellite designed for extrasolar planets detection. A transit of a planet in front of a star results in an abrupt change in the mean and variance of the CGARP. The Neyman-Pearson detector for this changepoint detection problem is derived when the abrupt change parameters are known. Closed form expressions for the Receiver Operating Characteristics (ROC) are provided. The Neyman-Pearson detector combined with the maximum likelihood estimator for CGARP parameters allows to study the generalized likelihood ratio detector. ROC curves are then determined using computer simulations.
Concurrency Control in Database Systems
Authors: Bharat Bhargava
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Ideas that are used in the design, development, and performance of concurrency control mechanisms have been summarized. The locking, time-stamp, optimistic-based mechanisms are included. The ideas of validation in optimistic approach are presented in some detail. The degree of concurrency and classes of serializability for various algorithms have been presented. Questions that relate arrival rate of transactions with degree of concurrency and performance have been briefly presented. Finally, several useful ideas for increasing concurrency have been summarized. They include flexible transactions, adaptability, prewrites, multidimensional timestamps, and relaxation of two-phase locking.
An Approach to Knowledge Acquisition Based on the Structure of Personal Construct Systems
Authors: K. M. Ford, F. E. Petry, J. R. Adams-Webber, P. J. Chang
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

A research effort aimed at the development and unification of the prerequisite underlying theoretical foundations for an adequate approach to knowledge elicitation from repertory grid data is described. A theory of confirmation that incorporates the basic tenets of personal construct psychology directly into the logic as a basis for the determination of relevance is offered, thus strengthening the logic and extending personal construct psychology. These largely theoretical developments are applied to the representation and analysis of repertory grid data. The concept of an alpha -plane is introduced as a binary decomposition of repertory grid data that furnishes the realization of construct extensions (or ranges of convenience) needed to determine the range of relevance of a particular generalization or hypothesis. In addition, they provide the uniquely determined string of incidences required by any application of Bundy's truth functional incidence calculus. The theories are applied to the design and construction of NICOD-a semiautomated medical knowledge acquisition system. The system has been successfully employed in the elicitation of valuable heuristic radiological knowledge (mammography) that the domain experts (radiologists) were otherwise unable to articulate.
Reasoning About Equations and Functional Dependencies on Complex Objects
Authors: M. F. van Bommel, G. E. Weddell
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Virtually all semantic or object-oriented data models assume that objects have an identity separate from any of their parts, and allow users to define complex object types in which part values may be any other objects. This often results in a choice of query language in which a user can express navigating from one object to another by following a property value path. We consider a constraint language in which one may express equations and functional dependencies over complex object types. The language is novel in the sense that component attributes of individual constraints may correspond to property paths. The kind of equations we consider are also important, because they are a natural abstraction of the class of conjunctive queries for query languages that support property value navigation. In our introductory comments, we give an example of such a query and outline two applications of the constraint theory to problems relating to a choice of access plan for the query. We present a sound and complete axiomatization of the constraint language for the case in which interpretations are permitted to be infinite, where interpretations themselves correspond to a form of directed labeled graph. Although the implication problem for our form of equational constraint alone over arbitrary schema is undecidable, we present decision procedures for the implication problem for both kinds of constraints when the problem schema satisfies a stratification condition, and when all input functional dependencies are keys.
Origin of the C49-C54 volume anomaly in TiSi2 thin films: an in-situ XRD and TEM Analysis
Authors: B. Chenevier, O. Chaix-Pluchery, I. Matko, R. Madar, F. La Via
Venue: Microelectronic Engineering (2002)

To analyze the origin of the C49-C54 volume anomaly in TiSi2 thin films, accurate thermal expansion coefficients were determined for both TiSi2 phases using in-situ X-ray diffraction. Between room temperature and 900 K, the C49 coefficients exhibit a clear anisotropy and the volume expansion is found to be larger in C54. This contributes to reduce the 2.0% volume difference usually observed at room temperature to 1.6% at the transformation temperature. The magnitude of the volume discontinuity during transformation is an indication of a first-order transition. At the C49-C54 transformation, TEM observations of annealed Ti/Si film capped with (111) TiN have shown that both phases coexist with a metal-rich third component indexed as Ti5Si3 and located beneath TiN.
Traffic Hazards on the Superhighway
Venue: IEEE Software (1994)

Discussions in the US regarding the National Information Infrastructure, also called the electronic highway or the information superhighway, have garnered attention at conferences, in the media, and before Congress. The NII is really a cooperative effort between the US government and several private entities, including AT&T, Digital, Hewlett Packard, and Sprint, who are being encouraged to develop and test concepts and applications. One goal of the NII is that everyone will have access to international networks of information and communication. The coming era promises electronic democracy, electronic commerce, electronic classrooms, electronic funds transfers, and electronic publishing-all of which will allegedly foster improved communication. education, and quality of life. The author discusses how several difficult legal problems place serious hazards in the road to the information superhighway.
Asset Pricing Models, Specification Search, and Stability Analysis
Authors: J. Del Hoyo, J. Guillermo Llorente
Venue: Computational Economics (2001)

Testing asset pricing models is closely related to specification search analysis in quantitative economics. Most specification search processes select models based on some goodness of fit statistic (such as R2 or related F). The effects of the sequential search on the statistical tests should be taken into account when looking for the maximum goodness of fit. To avoid misspecified models it is useful to study the selected models based both on the full sample and along the sample. This paper presents a conditional sequential procedure for the specification search process with linear regression models that minimizes data snooping or data mining. It is a combined test that first considers the search for the `best' set of regressors and, conditional on this set, studies its significance and/or stability along the sample. The characteristics of the conditional tests are presented. Its efficacy is illustrated with a model of future returns as a function of past volume and returns.
Simulation and visualization of fire using extended lindenmayer systems
Authors: Tomasz Zaniewski, Shaun Bangay
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

This research introduces a method of using Lindenmayer Systems to model the spreading and behavior of fire inside a factory building. The research investigates the use of L-System propagated fires for determining factors such as where the fire is most likely to spread first and how fast. It also looks at an alternative way of storing the Lindenmayer System, not in the form of a string but rather as a graph. A variation on the building and traversal process is also investigated, in which the L-System is traversed depth first instead of breadth first. Results of fire propagation are presented and we conclude that L-Systems are a suitable tool for fire propagation.
A Verification Framework for Agent Communication
Authors: Rogier M. Van Eijk, Frank S. De Boer, Wiebe Van Der Hoek, John-Jules Ch. Meyer
Venue: Autonomous Agents and Multi-Agent Systems (2003)

In this paper, we introduce a verification method for the correctness of multiagent systems as described in the framework of ACPL (Agent Communication Programming Language). The computational model of ACPL consists of an integration of the two different paradigms of CCP (Concurrent Constraint Programming) and CSP (Communicating Sequential Processes). The constraint programming techniques are used to represent and process information, whereas the communication mechanism of ACPL is described in terms of the synchronous handshaking mechanism of CSP. Consequently, we show how to define a verification method for ACPL in terms of an integration of the verification methods for CCP and CSP. We prove formally the soundness of the method and discuss its completeness.
JEWEL: Design and Implementation of a Distributed Measurement System
Authors: F. Lange, R. Kroeger, M. Gergeleit
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

The distributed measurement system JEWEL, developed within project RelaX, is described. JEWEL consists of a flexible toolkit for low-interference online performance measurement integrated with a powerful adaptable graphical presentation facility and a generic interactive experiment control system. JEWEL supports a large set of different system models as well as a wide variety of interfaces to the observed system. Two examples are presented in order to demonstrate its flexibility.
Creating Disjoint Paths in Gamma Interconnection Networks
Authors: Nian-Feng Tzeng, Po-Jen Chuang, Chwan-Hwa Wu
Venue: IEEE Transactions on Computers (1993)

The Gamma interconnection network (GIN) is composed of 3*3 basic building blocks, with interconnecting patterns between stages following the plus-minus-2/sup i/ functions. The authors consider modifications to the GIN by altering the interconnecting patterns between stages so as to achieve high terminal reliability between any source-destination pair, resulting in the reliable GIN (REGIN). A type of REGIN's ensures totally disjoint paths in existence from any source to any destination, thereby capable of tolerating an arbitrary single fault. If several building blocks (i.e., 3*3 switches) are fabricated in one chip with very large scale integrated (VLSI) technology, the layout area and the pin count are less for the REGIN than for its GIN counterpart as a result of the change in the interconnecting patterns, giving rise to potential cost reduction. The terminal reliability of the REGIN is derived and compared with that of a compatible GIN. In addition, the performance of the REGIN is evaluated using simulation.
A Proposed Testing and Analysis Research Initiative
Authors: Leon Osterweil, Lori A. Clarke
Venue: IEEE Software (1992)

The steps being taken to develop a US software research agenda and to bridge the gap between testing and analysis researchers and practitioners are discussed. The current software reliability crisis and the obstacles to developing more effective testing and analysis technology and transferring it to industry are reviewed. Nine research areas most likely to yield important results are outlined. A major initiative in testing and analysis to provide the needed resources, an organizing framework, and an impetus to broaden and intensify critical testing and analysis research is discussed.
Dominance, potential optimality, imprecise information, and hierarchical structure in multi-criteria analysis
Authors: Kyung Sang Lee, Kyung Sam Park, Soung Hie Kim
Venue: Computers and Operations Research (2002)

Incorporating the imprecision of both weights and values into multi-attribute value theory brings us some computational difficulties in evaluating alternatives to be considered. For instance, we involve treating a non-linear programming problem because of non-linear forms of objectives or constraints to represent inner product forms of imprecisely known weights and values. In this paper, we thus develop a technique to translate such non-linear programming problems into ordinary linear programming equivalents. Note that there exits an earlier method similar to those developed in the present paper. However, that method has a limitation where it is assumed that there exists at least one alternative that has the only value of unity to be maximal in the corresponding attribute. This limitation is removed in the present article and, further, an extension is made to handle hierarchical structures.
An Evidential Reasoning Approach to Attribute Value Conflict Resolution in Database Integration
Authors: Ee-Peng Lim, Jaideep Srivastava, Shashi Shekhar
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Resolving domain incompatibility among independently developed databases often involves uncertain information. DeMichiel [1] showed that uncertain information can be generated by the mapping of conflicting attributes to a common domain, based on some domain knowledge. In this paper, we show that uncertain information can also arise when the database integration process requires information not directly represented in the component databases, but can be obtained through some summary of data. We therefore propose an extended relational model based on Dempster-Shafer theory of evidence [2] to incorporate such uncertain knowledge about the source databases. The extended relation uses evidence sets to represent uncertainty in information, which allow probabilities to be attached to subsets of possible domain values. We also develop a full set of extended relational operations over the extended relations. In particular, an extended union operation has been formalized to combine two extended relations using Dempster's rule of combination. The closure and boundedness properties of our proposed extended operations are formulated. We also illustrate the use of extended operations by some query examples.
On the Randi&#x0107; index
Authors: Charles Delorme, Odile Favaron, Dieter Rautenbach
Venue: Discrete Mathematics (2002)

The Randić index R(G) of a graph G = (V, E) is the sum of (d(u)d(υ))-1/2 over all edges uυ ∈ E of G. Bollobás and Erdös (Ars Combin. 50 (1998) 225) proved that the Randić index of a graph of order n without isolated vertices is at least √n - 1. They asked for the minimum value of R(G) for graphs G with given minimum degree δ(G). We answer their question for δ(G) = 2 and propose a related conjecture. Furthermore, we prove a best-possible lower bound on the Randić index of a triangle-free graph G with given minimum degree δ(G).
An Efficient Indefiniteness Inference Scheme in Indefinite Deductive Databases
Authors: C. S. Ku, H. D. Kim, L. J. Henschen
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

We introduce an inference scheme, based on the compilation approach, that can answer "true," provable-false," "indefinite," or "assumable-false" to a closed query in an indefinite deductive database under the generalized closed world assumption. The inference scheme proposed in this paper consists of a representation scheme and an evaluation process that uses one of two groups of positive indefinite ground clauses (PIGC's) derivable from the database for a given query. These two groups of PIGC's are base-PIGC's and descendants of base-PIGC's. We prove that the set of base-PIGC's derivable from the database is sufficient to infer the indefiniteness of a query. This newly proposed method offers many advantages over the existing compilation method. This new method outperforms the existing one in terms of the cost of compilation, ease in the handling of updates, and efficiency in query evaluation.
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Authors: Katia Sycara, Seth Widoff, Matthias Klusch, Jianguo Lu
Venue: Autonomous Agents and Multi-Agent Systems (2002)

Service matchmaking among heterogeneous software agents in the Internet is usually done dynamically and must be efficient. There is an obvious trade-off between the quality and efficiency of matchmaking on the Internet. We define a language called Larks for agent advertisements and requests, and present a flexible and efficient matchmaking process that uses Larks. The Larks matchmaking process performs both syntactic and semantic matching, and in addition allows the specification of concepts (local ontologies) via ITL, a concept language. The matching process uses five different filters: context matching, profile comparison, similarity matching, signature matching and constraint matching. Different degrees of partial matching can result from utilizing different combinations of these filters. We briefly report on our implementation of Larks and the matchmaking process in Java. Fielded applications of matchmaking using Larks in several application domains for systems of information agents are ongoing efforts.
Integer Division in Residue Number Systems
Authors: Erich Kaltofen, Markus A. Hitz
Venue: IEEE Transactions on Computers (1995)

This contribution to the ongoing discussion of division algorithms for residue number systems (RNS) is based on Newton iteration for computing the reciprocal. An extended RNS with twice the number of moduli provides the range required for multiplication and scaling. Separation of the algorithm description from its RNS implementation achieves a high level of modularity, and makes the complexity analysis more transparent. The number of iterations needed is logarithmic in the size of the quotient for a fixed start value. With preconditioning it becomes the logarithm of the input bit size. An implementation of the conversion to mixed radix representation is outlined in the appendix.
A Versatile Architecture for the Distributed Sensor Integration Problem
Authors: S. S. Iyengar, D. N. Jayasimha, D. Nadig
Venue: IEEE Transactions on Computers (1994)

Proposes a versatile architecture for a distributed sensor network which consists of a multilevel network with the nodes (processing element/sensor pairs) at each level interconnected as a deBruijn network. The authors show that this multilevel network has reasonable fault tolerance, admits simple and decentralized routing, and offers easy extensibility. They model information from sensors as real valued intervals and derive an interesting property related to information integration in the presence of faults. Using this property, the search for a fault is narrowed down to two potentially faulty sensors or communication links. In a distributed environment, information has to be integrated from "temporally close" signals in the presence of imperfect clocks in a distributed environment. The authors apply the results of past research in this area to state various relationships between the clocks of the processing elements in the network for proper information integration.
Extending PCI Performance Beyond the Desktop
Authors: Shlomo Weiss, Ehud Finkelstein
Venue: Computer (1999)

In just a few years since its introduction, the PCI (peripheral component interconnect) bus has become an industry standard, implemented in most PC systems as well as in some workstations. Designed for the desktop PC market, the PCI bus cannot be used directly in most embedded systems or in industrial applications due to packaging, reliability, or maintenance considerations.While the proliferation of PCI-related standards attests to PCI's success, some confusion arises because it is not always clear why there are so many standards, what the differences are between them, and which standards apply to a specific application. To address these questions, the authors provide a detailed description of the PCI bus architecture. They also review the various standards that enable the use of PCI silicon, software, and firmware in various segments of the computer industry.
Numerical Entropy Production on Shocks and Smooth Transitions
Authors: Gabriella Puppo
Venue: Journal of Scientific Computing (2002)

In this work, we propose an algorithm to measure the numerical entropy production of several high order central schemes. The results obtained on a numerical test indicate that this quantity permits to estimate the local error, in regions of smooth flow, and to detect and locate shocks.