ppxscal/embedding_network huggingface dataset:
Formalization and Analysis of Dataflow in Object-Oriented Design Models
Authors: Toshiaki Aoki, Takuya Katayama
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

In the upstream phase of object-oriented development, we usually model a target system from multiple points of view. A dataflow view has been recognized as one of the most important views in software engineering. We need to relate dataflow models to OO models and check consistency between them as it is still important even if we adopt object-oriented approach. In this paper, we propose a method to analyze dataflows in OO design models with the model checker Spin after formalizing them.
Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation
Authors: Timothy W. O'Neil, Edwin H.-M. Sha
Venue: Journal of VLSI Signal Processing Systems (2005)

Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). The execution of all tasks of a DFG is called an iteration, with the average computation time of an iteration the iteration period. A great deal of research has been done attempting to optimize such applications by applying various graph transformation techniques to the DFG in order to minimize this iteration period. Two of the most popular are retiming and unfolding, which can be performed in tandem to achieve an optimal iteration period. However, the result is a transformed graph which is much larger than the original DFG. To the authors' knowledge, there is no technique which can be combined with minimal unfolding to transform a DFG into one whose iteration period matches that of the optimal schedule under a pipelined design. This paper proposes a new technique, extended retiming, which does just this. We construct the appropriate retiming functions and design an efficient retiming algorithm which may be applied directly to a DFG instead of the larger unfolded graph. Finally, we show through experiments the effectiveness of our algorithms.
Dynamic sampling with governed neural networks
Authors: Matt Fiedler, Evan Moses, Jeremy Stober
Venue: Journal of Computing Sciences in Colleges (2004)

The process of training neural networks online for robot control suffers from catastrophic forgetting. Long sequences of repetitive sensory inputs corresponding to slowly changing environmental stimuli tend to dominate the learning process of neural network controllers. In robot control tasks, however, short critical periods of sensory data are often more vital to the learning process. Traditionally, to enhance the importance of these short critical periods of sensory information, sensory data from the required task is collected and balanced before being used as a training set for an offline neural network. Using vector quantization techniques, we have developed a neural network governor that dynamically samples the input data online so as to excise long sequences of repetitive data that would otherwise prevent shorter critical sequences from being properly learned.
The computation of market equilibria
Authors: Bruno Codenotti, Sriram Pemmaraju, Kasturi Varadarajan
Venue: ACM SIGACT News (2004)

The market equilibrium problem has a long and distinguished history. In 1874, Walras published the famous "Elements of Pure Economics", where he describes a model for the state of an economic system in terms of demand and supply, and expresses the supply equals demand equilibrium conditions [62]. In 1936, Wald gave the first proof of the existence of an equilibrium for the Walrasian system, albeit under severe restrictions [61]. In 1954, Nobel laureates Arrow and Debreu proved the existence of an equilibrium under milder assumptions [3]. This existence result, along with the two fundamental theorems of welfare are the pillars of modern equilibrium theory. The First Fundamental Theorem of Welfare showed the Pareto optimality of allocations at equilibrium prices, thereby formally expressing Adam Smith's "invisible hand" property of markets and providing important social justification for the theory of equilibrium.
Entropy-Based Image Merging
Authors: A. German, M. R. Jenkin, Y. Lesperance
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Spacecraft docking using vision is a challenging task. Not least among the problems encountered is the need to visually localize the docking target. Here we consider the task of adapting the local illumination to assist in this docking. An online approach is developed that combines images obtained under different exposure and lighting conditions into a single image upon which docking decisions can be made. This method is designed to be used within an intelligent controller that automatically adjusts lighting and image acquisition in order to obtain the "best" possible composite view of the target for further image processing.
Every 2-CSP allows nontrivial approximation
Authors: Johan Håstad
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We use semidefinite programming to prove that any constraint satisfaction problem in two variables over any domain allows an efficient approximation algorithm that does provably better than picking a random assignment. To be more precise assume that each variable can take values in [d] and that each constraint rejects t out of the d2 possible input pairs. Then, for some universal constant c, we can, in probabilistic polynomial time, find an assignment whose objective value is, on expectation, within a factor (1- t/d2(1- c/d2 log d)) of optimal.
Embracing and Extending Windows 2000
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

We were recently presented with the challenge of deploying a large scale Windows 2000 environment, initially for the Administration Division, but eventually including academic and other users. Rather than try to eventually re-integrate independently administered domains, we took this as an opportunity to develop the tools and resources to provide a campus-wide Windows 2000 environment that is well integrated with the existing enterprise information and computing systems, much like we integrated our Unix systems. This would automate many of the mundane administrative functions, yet provide appropriate delegation of control to departmental administrators as needed. This paper describes the systems we developed to make this happen.
Bi-Level and Anti-Aliased Rendering Methods for a Low-Resolution 2D Vibrotactile Array
Authors: Christoph W. Borst, Alp V. Asutay
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We investigate rendering methods for 2D tactile arrays. We present four rendering methods, two of which are anti-aliased methods to improve display quality and smoothness. We describe three experiments to evaluate the methods. The first experiment compares them based on subjective ratings and finds that anti-aliased methods improve perceived quality and smoothness. The second experiment investigates the potential for one approach to communicate information at a sub-tactor resolution, based on the shortest line segment allowing identification of its direction. The third experiment is a shape discrimination experiment and finds that only one of the approaches allows reasonable discrimination for the selected shapes.
Bayesian Object Detection in Dynamic Scenes
Authors: Yaser Sheikh, Mubarak Shah
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Detecting moving objects using stationary cameras is an important precursor to many activity recognition, object recognition and tracking algorithms. In this paper, three innovations are presented over existing approaches. Firstly, the model of the intensities of image pixels as independently distributed random variables is challenged and it is asserted that useful correlation exists in the intensities of spatially proximal pixels. This correlation is exploited to sustain high levels of detection accuracy in the presence of nominal camera motion and dynamic textures. By using a non-parametric density estimation method over a joint domain-range representation of image pixels, multi-modal spatial uncertainties and complex dependencies between the domain (location) and range (color) are directly modeled. Secondly, temporal persistence is proposed as a detection criteria. Unlike previous approaches to object detection which detect objects by building adaptive models of the only background, the foreground is also modeled to augment the detection of objects (without explicit tracking) since objects detected in a preceding frame contain substantial evidence for detection in a current frame. Third, the background and foreground models are used competitively in a MAP-MRF decision framework, stressing spatial context as a condition of pixel-wise labeling and the posterior function is maximized efficiently using graph cuts. Experimental validation of the proposed method is presented on a diverse set of dynamic scenes.
A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints
Authors: Stephen Braun, John E. Mitchell
Venue: Computational Optimization and Applications (2005)

The presence of complementarity constraints brings a combinatorial flavour to an optimization problem. A quadratic programming problem with complementarity constraints can be relaxed to give a semidefinite programming problem. The solution to this relaxation can be used to generate feasible solutions to the complementarity constraints. A quadratic programming problem is solved for each of these feasible solutions and the best resulting solution provides an estimate for the optimal solution to the quadratic program with complementarity constraints. Computational testing of such an approach is described for a problem arising in portfolio optimization.
AFWL hydrocode development parallel techniques: fluid dynamics (abstract)
Authors: Charles E. Needham, Richard E. Durrett, Daniel A. Matuska
Venue: ACM SIGNUM Newsletter (1975)

The methods employed in solving the fluid dynamic equations are especially amenable to parallel techniques. In fact, one of the major forces behind the development of ILLIAC IV was the solution of hydrodynamic problems. During the early phases of ILLIAC IV development, (mid 1970 to 1971), the Air Force Weapons Lab expended several manyears of effort in converting its hydrocodes to the ILLIAC IV architecture. This has been reported in AFWLTR 72-33 "Shell for the ILLIAC IV". The experience has carried over into the codes presently used at AFWL which have many characteristics necessary for parallel processing. Applications of the parallel philosophy to serial machines has decreased running times by a factor of 2 or more. Our original single material hydrocode ran at the rate of approximately 1.5ms/zone/cycle on the CDC6600. The present version runs at about 0.5ms/zone/cycle.
Haptic and Visual Size Judgements in Virtual and Real Environments
Authors: Dianne Wuillemin, George van Doorn, Barry Richardson, Mark Symmons
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In a series of three experiments, participants were asked to match the sizes of spheres presented in the haptic and visual modalities. Stimuli were either real or virtual. Real spheres were sets of ball bearings of various sizes that could be both viewed and touched. Virtual spheres were presented using a Phantom for the haptic presentations or a 4D screen for the visual presentations. Comparing the judgements made within sensory modalities, virtual spheres of a given size were perceived as significantly larger than their real counterparts for vision, but not for haptics. Across modalities, virtual haptic spheres were perceived as significantly larger than their virtual visual counterparts, while there was no significant difference in the judged size of real visual and real haptic spheres. The results have implications for the design of virtual environments where it cannot be assumed that the sizes of objects as depicted by their designers will be perceived in identical fashion across modalities.
A Two-Node Jackson Network With Infinite Supply Of Work
Authors: Ivo Adan, Gideon Weiss
Venue: Probability in the Engineering and Informational Sciences (2005)

We consider a Jackson network with two nodes, with no exogenous input, but instead an infinite supply of work at each of the nodes: Whenever a node is empty, it processes a job from this infinite supply. We obtain an explicit expression for the steady state distribution of this system, as an infinite sum of product forms.
Automated Behavioral Phenotype Detection and Analysis Using Color-Based Motion Tracking
Authors: Alan Shimoide, Ilmi Yoon, Megumi Fuse, Holly C. Beale, Rahul Singh
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

The problem of elucidating the functional significance of genes is a key challenge of modern science. Solving this problem can lead to fundamental advancements across multiple areas such starting from pharmaceutical drug discovery to agricultural sciences. A commonly used approach in this context involves studying genetic influence on model organisms. These influences can be expressed at behavioral, morphological, anatomical, or molecular levels and the expressed patterns are called phenotypes. Unfortunately, detailed studies of many phenotypes, such as the behavior of an organism, is highly complicated due to the inherent complexity of the phenotype pattern and because of the fact that it may evolve over long time periods. In this paper, we propose applying color-based tracking to study Ecdysis in the hornworm - a biologically highly relevant phenotype whose complexity had thus far, prevented application of automated approaches. We present experimental results which demonstrate the accuracy of tracking and pheno-type determination under conditions of complex body movement, partial occlusions, and body deformations. A key additional goal of our paper is to expose the computer vision community to such novel applications, where techniques from vision and pattern analysis can have a seminal influence on other branches of modern science.
Option Pricing with Downward-Sloping Demand Curves: The Case of Supply Chain Options
Authors: Apostolos Burnetas, Peter Ritchken
Venue: Management Science (2005)

This article investigates the role of option contracts in a supply chain when the demand curve is downward sloping. We consider call (put) options that provide the retailer with the right to reorder (return) goods at a fixed price. We show that the introduction of option contracts causes the wholesale price to increase and the volatility of the retail price to decrease. In general, options are not zero-sum games. Conditions are derived under which the manufacturer prefers to use options. When this happens the retailer is also better off, if the uncertainty in the demand curve is low. However, if the uncertainty is sufficiently high, then the introduction of option contracts alters the equilibrium prices in a way that hurts the retailer.
Computation of dynamic characteristics of control systems: An Effectiveness enhancement method
Authors: G. G. Arunyants, A. L. Rutkovskii, Z. G. Salikhov, D. N. Stolbovskii
Venue: Automation and Remote Control (2005)

The Simoy method of computation of transfer functions from transition curves is modified and improved such that selection of an optimal structure for a transfer function from synthesized variants for the channel of action of an element and computation of its parameters are implemented sequentially and automatically, and then the optimal values of computed parameters of transfer functions are determined by minimizing the approximation error. This method enhances the accuracy of computation of dynamic characteristics at least by 20%.
Creating porcine biomedical models through recombineering: Conference Reviews
Authors: Margarita M. Rogatcheva, Laurie A. Rund, Kelly S. Swanson, Brandy M. Marron, Jonathan E. Beever, Christopher M. Counter, Lawrence B. Schook
Venue: Comparative and Functional Genomics (2004)

Recent advances in genomics provide genetic information from humans and other mammals (mouse, rat, dog and primates) traditionally used as models as well as new candidates (pigs and cattle). In addition, linked enabling technologies, such as transgenesis and animal cloning, provide innovative ways to design and perform experiments to dissect complex biological systems. Exploitation of genomic information overcomes the traditional need to choose naturally occurring models. Thus, investigators can utilize emerging genomic knowledge and tools to create relevant animal models. This approach is referred to as reverse genetics. In contrast to &lsquo;forward genetics&rsquo;, in which gene(s) responsible for a particular phenotype are identified by positional cloning (phenotype to genotype), the &lsquo;reverse genetics&rsquo; approach determines the function of a gene and predicts the phenotype of a cell, tissue, or organism (genotype to phenotype). The convergence of classical and reverse genetics, along with genomics, provides a working definition of a &lsquo;genetic model&rsquo; organism (3). The recent construction of phenotypic maps defining quantitative trait loci (QTL) in various domesticated species provides insights into how allelic variations contribute to phenotypic diversity. Targeted chromosomal regions are characterized by the construction of bacterial artificial chromosome (BAC) contigs to isolate and characterize genes contributing towards phenotypic variation. Recombineering provides a powerful methodology to harvest genetic information responsible for phenotype. Linking recombineering with gene-targeted homologous recombination, coupled with nuclear transfer (NT) technology can provide &lsquo;clones&rsquo; of genetically modified animals. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Relational Soft Network and its realization
Authors: Zhang Li-cui, Fan Ya-qin, Wang Lin-zhu, Jin Cheng-zhi
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

In order to satisfy the need of people's communicating in terms of relationship and interest, a new network service, Relational Soft Network (RSN), is proposed. The structure, communication protocol and formalization of RSN are described in this paper. We make an experiment about communication with group communication method and RSN method respectively. The result of experiment shows that RSN decreases the network load, saves the bandwidth and increases the efficiency.
Single Image Phase-Based MRI Fat Suppression Expectation Maximization Algorithm
Authors: Daniel J. Blezek, W. Thomas Dixon, Paritosh J. Dhawale
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

MRI fat suppression techniques are primarily approached by variations of the phase based methods. Multi-point methods dominate the literature, specifically methods that require the acquisition of three images at different echo times. These methods estimate the contribution of fat and water signals by solving a set of equations using echos acquired with the relative phase of fat and water at - ¿, ¿, ¿. We present a novel approach to fat suppression that requires only a single image. Using an expectation maximization algorithm on a gradient echo image with the relative phase of fat and water at approximately We present a novel approach to fat suppression that requires only a single image. Using an expectation maximization algorithm on a gradient echo image with the relative phase of fat and water at approximately ¿/2, the pixel composition and inhomogeneity of the magnetic field are estimated. Fat suppressed images are generated from estimated inhomogeneity. Our method does not need custom pulse sequences. Results from mathematical phantoms and volunteer images are reported.
On restricted connectivities of permutation graphs
Authors: C. Balbuena, X. Marcote, P. García-Vázquez
Venue: Networks (2005)

A permutation graph lpar;or generalized prism rpar; <i>G</i><sup>&pi;</sup> of a graph <i>G</i> is obtained by taking two disjoint copies of <i>G</i> and adding an arbitrary matching between the two copies. Permutation graphs can be seen as suitable models for building larger interconnection networks from smaller ones without increasing significantly their maximum transmission delays, in such a way that these larger networks are highly fault-tolerant. For permutations graphs, in this article we provide conditions that guarantee optimal values for two parameters of connectivity, &lambda;&prime; and &kappa;&prime;. For a connected graph <i>G</i> the restricted edge-connectivity &lambda;&prime; lpar;<i>G</i> rpar; is defined as the minimum cardinality of a restricted edge-cut; that is, the minimum cardinality of a set <i>S</i> of edges such that <i>G</i> - <i>S</i> is not connected and <i>S</i> does not contain the set of incident edges of any vertex of the graph. A graph <i>G</i> is said to be &lambda;&prime;-optimal if &lambda;&prime; lpar;<i>G</i> rpar; equals; &xi; lpar;<i>G</i> rpar;, where &xi; lpar;<i>G</i> rpar; is the minimum edge-degree in <i>G</i> defined as &xi; lpar;<i>G</i> rpar; equals; min lcub;<i>d</i> lpar;<i>u</i> rpar; plus; <i>d</i> lpar;<i>v</i> rpar; - 2 : <i>uv</i> &isin; <i>E</i> lpar;<i>G</i> rpar; rcub;, and <i>d</i> lpar;<i>u</i> rpar; denotes the degree of vertex <i>u</i>. Among other things, we prove that permutation graphs satisfy: min lcub;&lambda;&prime; lpar;<i>G</i> rpar; plus; <i>&delta;</i> lpar;<i>G</i> rpar;, 2&lambda;&prime; lpar;<i>G</i> rpar;, &xi; lpar;<i>G</i><sup>&pi;</sup> rpar; rcub; &le; &lambda;&prime; lpar;<i>G</i><sup>&pi;</sup> rpar; &le; &xi; lpar;<i>G</i><sup>&pi;</sup> rpar; if verbar;<i>V</i> lpar;<i>G</i> rpar; verbar; &ge; &xi; lpar;<i>G</i> rpar; plus; 2. Furthermore, min lcub; 2&lambda;&prime; lpar;<i>G</i> rpar;, &xi; lpar;<i>G</i><sup>&pi;</sup> rpar; rcub; &le; &lambda;&prime; lpar;<i>G</i><sup>&pi;</sup> rpar; &le; &xi; lpar;<i>G</i><sup>&pi;</sup> rpar; if <i>G</i> is triangle-free. We also study the vertex case considering the restricted connectivity &kappa;&prime; lpar;<i>G</i> rpar; and relating it to the superconnectivity &kappa;<sub>1</sub> lpar;<i>G</i> rpar;; the latter is defined as the minimum cardinality of a set of vertices, if any, whose deletion disconnects <i>G</i> in such a way that every remaining component has at least two vertices. For instance, we prove that 2&kappa; lpar;<i>G</i> rpar; &le; &kappa;<sub>1</sub> lpar;<i>G</i> rpar; &le; &kappa;&prime; lpar;<i>G</i><sup>&pi;</sup> rpar; &le; &xi; lpar;<i>G</i><sup>&pi;</sup> rpar; if <i>G</i> is triangle-free and the permutation graph has no cycles of length five. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45 lpar;3 rpar;, 113&ndash;118 2005