ppxscal/embedding_network huggingface dataset:
Sensitive ant model for combinatorial optimization
Authors: Camelia Chira, D. Dumitrescu, Camelia-Mihaela Pintea
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

A combinatorial optimization metaheuristic called Sensitive Ant Model (SAM) based on the Ant Colony System (ACS) technique is proposed. ACS agents cooperate indirectly using pheromone trails. SAM improves and extends the ACS approach by enhancing each agent of the model with properties that induce heterogeneity. Agents are endowed with different pheromone sensitivity levels. Highly-sensitive agents are essentially influenced in the decision making process by stigmergic information and thus likely to select strong pheromone-marked moves. Search intensification can be therefore sustained. Agents with low sensitivity are biased towards random search inducing diversity for exploration of the environment. SAM is studied on a dynamic optimization problem. Numerical experiments offer promising results indicating the potential of the proposed SAM metaheuristic.
Time synchronization of multimedia streams and objects
Authors: Yordan Shterev
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Some results on multimedia streams and objects synchronization have been presented in this paper. The following items have been introduced: dynamic fuzzy multimedia Petri net and its state equation, quality of service of multimedia presentation depending on the human sensory organs, multimedia presentation of synchronized multimedia integration language with interactions, non-breaking and breaking the performance quality.
Hyperchaotic signal generation via DSP for efficient perturbations to liquid mixing
Authors: Zhong Zhang, Guanrong Chen, Simin Yu
Venue: International Journal of Circuit Theory and Applications (2009)

This paper presents the design, simulation, hardware implementation and an application in liquid mixing of some hyperchaotic circuits, based on the digital signal processing (DSP) technology. The hyperchaotic Chen's system is used as an example to show the system discretization and variable renormalization in the design process. Numerical simulation is given to verify the hardware signal generator. The implemented hardware of Chen's system generates outputs in good agreement with the numerical simulation. The hyperchaotic signal output from the DSP is applied to generate complex perturbations in liquid mixing experiments. Dye dispersion experiments show that the induced hyperchaotic motion effectively helps enhance the mixing homogeneity in the stirred-tank-based mixer in our laboratory. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A Fault-Tolerant Strategy for Multicasting in MPLS Networks
Authors: Weili Huang, Hongyan Guo
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Multicast is an effective way for increasing the efficiency of network resources utilization. But when designed, MPLS did not consider the support of multicast. So multicast in MPLS has many problems. To solve this, we introduce and propose a new multicast strategy in this paper that combines ERM and AMFM. Compared with the previous multicast algorithms, it simplifies LSP setup and has less forwarding states. And it is fault-tolerant. So if implemented in MPLS networks, it can get a better performance.
MADO interface: a window like a tangible user interface to look into the virtual world
Authors: Takuya Maekawa, Yuichi Itoh, Norifumi Kawai, Yoshifumi Kitamura, Fumio Kishino
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

"MADO Interface" is a tangible user interface consisting of a compact touch-screen display and physical blocks. "MADO" means "window" in Japanese, and MADO Interface is utilized as the real window into the virtual world. Users construct a physical object by simply combining electrical blocks. Then, by connecting MADO Interface to the physical object, they can watch the virtual model corresponding to the physical block configuration (shape, color, etc.) The size and the viewpoint of the virtual model seen by the user depend on the position of MADO Interface, maintaining the consistency between the physical and virtual worlds. In addition, users can interact with the virtual model by touching the display on MADO Interface. These features enable users to explore the virtual world intuitively and powerfully.
A multiagent potential field-based bot for real-time strategy games
Authors: Johan Hagelbäck, Stefan J. Johansson
Venue: International Journal of Computer Games Technology (2009)

Bots for real-time strategy (RTS) games may be very challenging to implement. A bot controls a number of units that will have to navigate in a partially unknown environment, while at the same time avoid each other, search for enemies, and coordinate attacks to fight them down. Potential fields are a technique originating from the area of robotics where it is used in controlling the navigation of robots in dynamic environments. Although attempts have been made to transfer the technology to the gaming sector, assumed problems with efficiency and high costs for implementation have made the industry reluctant to adopt it. We present a multiagent potential field-based bot architecture that is evaluated in two different real-time strategy game settings and compare them, both in terms of performance, and in terms of softer attributes such as configurability with other state-of-the-art solutions. We show that the solution is a highly configurable bot that can match the performance standards of traditional RTS bots. Furthermore, we show that our approach deals with Fog of War (imperfect information about the opponent units) surprisingly well. We also show that a multiagent potential field-based bot is highly competitive in a resource gathering scenario.
Design and implementation of the banyan interconnection network in TRAC
Authors: U. V. Premkumar, R. Kapur, M. Malek, G. J. Lipovski, P. Horne
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Over the past few years, owing to technological breakthroughs in building cheap, reliable and powerful microprocessors and relatively cheap LSI memories, interconnection networks have become the major hardware cost in design and implementation of the multiprocessor systems. This situation occurs from the fact that many more functions may be expected from the interconnection network (switch) than the establishment of simple bus connections. Even if only the communication links were considered, the complexity of some networks make their implementation prohibitive. An example of such a network is a crossbar whose complexity is 0(n**2) where n represents a number of resources which may be connected to another set of n resources. This switch provides a separate connection between each pair of resources (Figure 1). It has been empirically shown that implementation of a crossbar switch for a large n is very difficult and with a state-of-the-art technology practically infeasible for n>50.
A root-based strategy for constructing a clustered MANET in all-IP networks
Authors: Long-Sheng Li, Gwo-Chuan Lee, Wei-Zan Wang
Venue: Computer Standards Interfaces (2009)

Due to the popularity of Wireless LAN, the deployment of a flexible WLAN with IP services is a new trend for wireless Internet. The Mobile Ad Hoc Network (MANET) can easily be set up in any environment without any base station. In this paper, we propose a root-based mechanism for constructing a clustered MANET in all-IP networks. To support all-IP networks, the integration of Mobile IP and the root-based clustering MANET will be presented. The routing strategy of the root-based constructing strategy, denoted as Modified Cluster head Gateway Switch Routing (MCGSR), is based on the virtual backbone of the clustered MANET. In this routing strategy, the maintenance cost of the routing information in the virtual backbone will be smaller than that of CGSR. The simulation results show that the root-based strategy with MCGSR routing significantly outperforms both the DSDV and LCC with CGSR routing in terms of the stability of virtual backbones, memory overheads, and control messages overheads.
Convergence of finite volume schemes for triangular systems of conservation laws
Authors: Kenneth Hvistendahl Karlsen, Siddhartha Mishra, Nils Henrik Risebro
Venue: Numerische Mathematik (2009)

We consider non-strictly hyperbolic systems of conservation laws in triangular form, which arise in applications like three-phase flows in porous media. We device simple and efficient finite volume schemes of Godunov type for these systems that exploit the triangular structure. We prove that the finite volume schemes converge to weak solutions as the discretization parameters tend to zero. Some numerical examples are presented, one of which is related to flows in porous media.
Functional modelling of volatility in the Swedish limit order book
Authors: Suad Elezović
Venue: Computational Statistics Data Analysis (2009)

The publicly available electronic limit order book at the Stockholm Stock Exchange consists of five levels of prices and quantities of a given stock with a bid and ask side. All changes in the book during one day can be recorded with a time quote. Studying the variation of the quoted price returns as a function of quantity is discussed. In particular, discovering and modelling dynamic behaviours in the volatility of prices and liquidity measures are considered. Applying a functional approach, estimation of the volatility dynamics of the spreads, created as differences between the ask and bid prices, is presented through a case study. For that purpose two-step estimation of functional linear models is used, extending this method to a time series context.
Issues in the design of relational model management systems
Authors: Robert W. Blanning
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

One component of the literature on model management in decision support systems (DSSs) suggests that the relational framework for data management be extended to the management of decision models. This paper examines three important design issues in relational model management: the organization of relational model banks, relational completeness of model query languages, and system implementation.
Brain activity during playing video game correlates with player level
Authors: Shingo Hattahara, Nobuto Fujii, Shinpei Nagae, Koji Kazai, Haruhiro Katayose
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Many studies have focused on the relationship between playing video games and brain activity. Most of these studies have reported that regions of the prefrontal cortex are deactivated when video games are played. However, it is natural to assume that the effect on humans varies with the player's age, attitude, or mastery level. In this paper, we focus on the mastery level of the video game player. We measured the brain activity at the prefrontal cortex using functional near-infrared spectroscopy (fNIRS) while novices, intermediate players, and master-level players ("masters") played video games. We observed the activation of brain activity at the prefrontal cortex while masters were playing the game that they had mastered.
Problems, perils and promises of computer graphics
Authors: Lawrence Rosler, James D. Foley, John B. Macdonald, H. G. Marsh
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

For many years, profitable large-scale use of computer graphics has been "just around the corner." The panelists, representing industrial users, system developers, and university researchers, will present divergent views on what is required for the promises finally to be fulfilled. These views range from coding in tailored machine language to writing transportable programs in a high-level language. An open discussion, with audience participation invited, will follow.
On the Design and Applicability of Distance Functions in High-Dimensional Data Space
Authors: Chih-Ming Hsu, Ming-Syan Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Effective distance functions in high dimensional data space are very important in solutions for many data mining problems. Recent research has shown that if the Pearson variation of the distance distribution converges to zero with increasing dimensionality, the distance function will become unstable (or meaningless) in high dimensional space, even with the commonly used $L_p$ metric in the Euclidean space. This result has spawned many studies the along the same lines. However, the necessary condition for unstability of a distance function, which is required for function design, remains unknown. In this paper, we shall prove that several important conditions are in fact equivalent to unstability. Based on these theoretical results, we employ some effective and valid indices for testing the stability of a distance function. In addition, this theoretical analysis inspires us that unstable phenomena are rooted in variation of the distance distribution. To demonstrate the theoretical results, we design a meaningful distance function, called the Shrinkage-Divergence Proximity (SDP), based on a given distance function. It is shown empirically that the SDP significantly outperforms other measures in terms of stability in high dimensional data space, and is thus more suitable for distance-based clustering applications.
Pathfinder: an online collaboration environment for citizen scientists
Authors: Kurt Luther, Scott Counts, Kristin B. Stecher, Aaron Hoff, Paul Johns
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

For over a century, citizen scientists have volunteered to collect huge quantities of data for professional scientists to analyze. We designed Pathfinder, an online environment that challenges this traditional division of labor by providing tools for citizen scientists to collaboratively discuss and analyze the data they collect. We evaluated Pathfinder in a sustainability and commuting context using a mixed methods approach in both naturalistic and experimental settings. Our results showed that citizen scientists preferred Pathfinder to a standard wiki and were able to go beyond data collection and engage in deeper discussion and analyses. We also found that citizen scientists require special types of technological support because they generate original research. This paper offers an early example of the mutually beneficial relationship between HCI and citizen science.
A sub-pixel stereo matching algorithm and its applications in fabric imaging
Authors: Wurong Yu, Bugao Xu
Venue: Machine Vision and Applications (2009)

In this paper, we describe a sub-pixel stereo matching algorithm where disparities are iteratively refined within a regularization framework. We choose normalized cross-correlation as the matching metric, and perform disparity refinement based on correlation gradients, which is distinguished from intensity gradient-based methods. We propose a discontinuity-preserving regularization technique which utilizes local coherence in the disparity space image, instead of estimating discontinuities in the intensity images. A concise numerical solution is derived by parameterizing the disparity space with dense bicubic B-splines. Experimental results show that the proposed algorithm performs better than correlation fitting methods without regularization. The algorithm has been implemented for applications in fabric imaging. We have shown its potentials in wrinkle evaluation, drape measurement, and pilling assessment.
Vagueness and Roughness
Authors: Zbigniew Bonikowski, Urszula Wybraniec-Skardowska
Venue: Transactions on Rough Sets IX (2008)

The paper proposes a new formal approach to vagueness and vague sets taking inspirations from Pawlak's rough set theory. Following a brief introduction to the problem of vagueness, an approach to conceptualization and representation of vague knowledge is presented from a number of different perspectives: those of logic, set theory, algebra, and computer science. The central notion of the vague set, in relation to the rough set, is defined as a family of sets approximated by the so called lower and upper limits. The family is simultaneously considered as a family of all denotations of sharp terms representing a suitable vague term, from the agent's point of view. Some algebraic operations on vague sets and their properties are defined. Some important conditions concerning the membership relation for vague sets, in connection to Blizard's multisets and Zadeh's fuzzy sets, are established as well. A classical outlook on a logic of vague sentences (vague logic) based on vague sets is also discussed.
Learning a Parallelepiped: Cryptanalysis of GGH and&#x00a0;NTRU Signatures
Authors: Phong Q. Nguyen, Oded Regev
Venue: Journal of Cryptology (2009)

Lattice-based signature schemes following the Goldreich&#x2013;Goldwasser&#x2013;Halevi (GGH) design have the unusual property that each signature leaks information on the signer&#x2019;s secret key, but this does not necessarily imply that such schemes are insecure. At Eurocrypt &#x2019;03, Szydlo proposed a potential attack by showing that the leakage reduces the key-recovery problem to that of distinguishing integral quadratic forms. He proposed a heuristic method to solve the latter problem, but it was unclear whether his method could attack real-life parameters of GGH and NTRUSign. Here, we propose an alternative method to attack signature schemes &#x00e0; la GGH by studying the following learning problem: given many random points uniformly distributed over an unknown n-dimensional parallelepiped, recover the parallelepiped or an approximation thereof. We transform this problem into a multivariate optimization problem that can provably be solved by a gradient descent. Our approach is very effective in practice: we present the first successful key-recovery experiments on NTRUSign-251 without perturbation, as proposed in half of the parameter choices in NTRU standards under consideration by IEEE P1363.1. Experimentally, 400 signatures are sufficient to recover the NTRUSign-251 secret key, thanks to symmetries in NTRU lattices. We are also able to recover the secret key in the signature analogue of all the GGH encryption challenges.
A design flow for architecture exploration and implementation of partially reconfigurable processors
Authors: Kingshuk Karuri, Anupam Chattopadhyay, Xiaolin Chen, David Kammler, Ling Hao, Rainer Leupers, Heinrich Meyr, Gerd Ascheid
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

During the last years, the growing application complexity, design, and mask costs have compelled embedded system designers to increasingly consider partially reconfigurable application-specific instruction set processors (rASIPs) which combine a programmable base processor with a reconfigurable fabric. Although such processors promise to deliver excellent balance between performance and flexibility, their design remains a challenging task. The key to the successful design of a rASIP is combined architecture exploration of all the three major components: the programmable core, the reconfigurable fabric, and the interfaces between these two. This work presents a design flow that supports fast architecture exploration for rASIPs. The design flow is centered around a unified description of an entire rASIP in an Architecture Description Language (ADL). This ADL description facilitates consistent modeling and exploration of all three components of a rASIP through automatic generation of the software tools (compiler tool chain and instruction set simulator) and the RTL hardware model. The generated software tools and the RTL model can be used either for final implementation of the rASIP or can serve as a preoptimized starting point for implementation that can be hand optimized afterward. The design flow is further enhanced by a number of automatic application analysis tools, including a fine-grained application profiler, an Instruction Set Extension (ISE) generator, and a data path mapper for Coarse Grained Reconfigurable Architectures (CGRAs). We present some case studies on embedded benchmarks to show how the design space exploration process helps to efficiently design an application domain specific rASIP.
New paradigms for a product oriented modelling: Case study for traceability
Authors: Salah Baïna, Hervé Panetto, Gérard Morel
Venue: Computers in Industry (2009)

Nowadays, product information management is a key issue for traceability and quality management but also for state-of-the-art technologies such as intelligent and autonomous product technologies. Due to these needs, product information design and management are becoming one of the most important steps in order to control quality of services and products that aim at customer satisfaction. However, there is no real method that exists to build the exhaustive representation of product information throughout their production cycle. In this paper, a product oriented modelling approach is proposed in order to provide a complete method for product representation. This modelling approach aims at covering all aspects related to product information and its management.
A Composite Model Based on Shape for Fast Image Matching
Authors: Gang Xu, Wenxian Yang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

A new improved partial Hausdorff distance is presented as the accurate measurement of the degree of shape similarity between the template and images, according to this distance, a fast strategy is proposed to measure the similarity roughly. A new genetic algorithm based on fuzzy logic, which can adaptively regulate the probabilities of crossover and mutation, is used to search the optimum shape matching quickly. The composite model composed of these algorithms can finish the shape matching from coarse to fine. The experimental results show that the model is capable of the shape matching with better quality and higher speed compared with other similar matching algorithms and can be used in real-time image matching.
How Redundant Is Your Universal Computation Device?
Authors: Alberto Leporati, Claudio Zandron, Giancarlo Mauri
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

Given a computational model ${\cal M}$, and a "reasonable" encoding function ${\cal C}: {\cal M} \to \{0,1\}^\ast$ that encodes any computation device M of ${\cal M}$ as a finite bit string, we define the description size of M (under the encoding ${\cal C}$) as the length of ${\cal C}(M)$. The description size of the entire class ${\cal M}$ (under the encoding ${\cal C}$) can then be defined as the length of the shortest bit string that encodes a universal device of ${\cal M}$. In this paper we propose the description size as a complexity measure that allows to compare different computational models. We compute upper bounds to the description size of deterministic register machines, Turing machines, spiking neural P systems and UREM P systems. By comparing these sizes, we provide a first partial answer to the following intriguing question: what is the minimal (description) size of a universal computation device?
On sets of points that determine only acute angles
Authors: Eyal Ackerman, Oren Ben-Zwi
Venue: European Journal of Combinatorics (2009)

We show that for every integer d there is a set of points in of size such that every angle determined by three points in the set is smaller than &pi;/2. This improves the best known lower bound by a factor.