ppxscal/embedding_network huggingface dataset:
Emergence of communication in embodied agents evolved for the ability to solve a collective navigation problem
Authors: D. Marocco, S. Nolfi
Venue: Connection Science (2007)

In this paper, we present the results of an experiment in which a collection of simulated robots that have been evolved for the ability to solve a collective navigation problem develop a communication system that allows them to co-operate better. The analysis of the results obtained indicates how evolving robots develop a non-trivial communication system and exploit different communication modalities. The results also indicate how the possibility of co-adapting the robots' individual and social/communicative behaviour plays a key role in the development of progressively more complex and effective individuals.
Crystalline silicon cantilevers for piezoresistive detection of biomolecular forces
Authors: G. Villanueva, J. A. Plaza, J. Montserrat, F. Perez-Murano, J. Bausells
Venue: Microelectronic Engineering (2008)

In order to obtain a sensor with force resolution better than 100pN for biomolecular detection, U-shaped piezoresistive cantilevers made of crystalline silicon have been fabricated. The resistors have been defined by ionic implantation of As^+, yielding a shallow and thin resistor and they have been patterned parallel to the (100) crystallographic direction, attaining a maximum for the piezoresistive factor. The sensitivity of the devices is characterized together as the force resolution, being both of them 60@mV/pN and 65pN, respectively, for a cantilever with a length of 250@mm, a width of 8@mm and a thickness of 340nm.
Scalable Video Transmission for a Surveillance System
Authors: Tomi Räty, Lassi Lehikoinen, Francois Bremond
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The Area of Interest (AoI) is a distributed scalable video transmission subsystem, for a surveillance system, which concentrates on decrementing the amount of video information transmitted to the end-user equipped with a mobile device. The video information is processed by the Video Surveillance Intelligent Platform (VSIP) to discriminate the essential images of the indoor area under stationary video surveillance. The AoI system analyzes the output of the VSIP’s images and eXtended Markup Language (XML) image information. The AoI system is able to define and extract the essential information, e.g., a tracked individual, and it transmits only this image to the end-user. First, the AoI transmits the entire image of the indoor area to the mobile device of the end-user. Then, the AoI system transmits only the secluded tracked objects’ images to the mobile device. The end-user’s device portrays the scaled portrait images of the targeted object on top of the background image. The AoI system endeavors to decrease the size of the video images transmitted to a smart phone over a wireless network and to retain the comprehension of a tracking situation. The operability of the constructed prototype indicates that this endeavor is attained. The research is based on the constructive method of the related publications and technologies and the results are derived by the implemented AoI system.
Isolation and Characterization of Salt-sensitive Mutants of the Moderately Halophilic Bacterium, Salinivibrio sp. DL6
Authors: Daochen Zhu, Shunyan Cui, Jianhe Wei, Shinichi Nagata
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Salinivibrio sp. DL6 is a moderately halophilic bacterium that can grow over a wide range of salinity, 0.5-20 % NaCl. In response to the external osmotic stress (1-3 M NaCl), strain DL6 can accumulate ectoine, glycine betaine and glutamate as compatible solutes. Transposon mutagenesis appears to be a potentially useful tool in the research on the synthesis of compatible solutes in response to the high osmotic stress. We used suicide plasmids pSUP101 to introduce the transposon Tn1732 into Salinivibrio sp. DL6 via Escherichia coli SM10 mediated conjugation. One Tn1732-induced mutant, MU1, which was severely affected in salt tolerance, was isolated. Mutant MU1 could not grow above 1.5 M NaCl and did not synthesize ectoine but accumulated ectoine precursor, N--acetyl-diaminobutyrate, which was shown by 1H-NMR analysis. From these data, we concluded that in the strain Salinivibrio sp. DL6 ectoine performs a key role for the adaptation high salinity environments, since glycine betaine and glutamate were accumulated regardless of the salinity.
Incorporating Object-Orientedness in Transformations from Live Sequence Charts to Colored Petri Nets
Authors: Binsan Khadka, Boleslaw Mikolajczak
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper presents an approach of automatic model checking in the requirement model of a software system known as Live Sequence Charts by transforming the behavior into Colored Petri Nets. The technique of combining Objects and Colored Petri Nets is used to provide a robust mechanism for the model checking which serves towards research in code generation from the software requirement model. Two major concepts: Objects inside Petri Nets and Petri Nets inside Objects are used in the composed Colored Petri Nets model to monitor the object’s state during system run and to check individual object’s behavior when interacting with other objects respectively.
Image Retrieval Using Maximum Frequency of Local Histogram Based Color Correlogram
Authors: Waqas Rasheed, Youngeun An, Sungbum Pan, Ilhoe Jeong, Jongan Park, Jinsuk Kang
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Color histogram is widely used for image indexing in content-based image retrieval (CBIR). A color histogram describes the global color distribution of an image. It is very easy to compute and is insensitive to small changes in viewing positions. However, the histogram is not robust to large appearance changes. Moreover, the histogram might give similar results for different kinds of images if the distributions of colors are same in the images. On the other hand, color Correlogram is efficiently used for image indexing in content-based image retrieval. Color Correlogram extracts not only the color distribution of pixels in images like color histogram, but also extracts the spatial information of pixels in the images. The characteristic of the color Correlogram to take into account the spatial information as well as the distribution of color pixels greatly attracts the researcher for content based image retrieval. In this paper, we propose the image bin (histogram value divisions) separation technique followed by extracting maxima of frequencies and plotting a Correlogram. At first, the histogram is first calculated for an image. After that, it is subdivided into four equal bins. Each bin is subdivided into four more bins and for every such subdivision the maxima of frequencies s calculated. This information is stored in the form of a Correlogram. The distance between Correlogram of the query image with the corresponding Correlogram of database images is calculated. The proposed algorithm is tested on a database comprising a large number of images.
Proposing a 2D dynamical model for investigating the parameters affecting whiplash injuries
Authors: S. Rajaee, M. H. Farahani
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This paper proposes a 2D dynamical model for evaluating parameters affecting whiplash. In fact a four segment dynamical model is developed in the sagittal plane for the analysis. The model response is validated using the existing experimental data and is shown to simulate the "S-Shape" and "initial upward ramping" kinematics of the cervical spine and the resulting dynamics observed in human and cadaver experiments. The model is then used to evaluate the effects of parameters such as velocity change between rear vehicle and the target vehicle (Δv), head/head restraint separation (backset) and the awareness of occupant on the whiplash injuries. It is shown that the proposed model can simulate whiplash phenomena very well; therefore it is a suitable alternative for other existing models.
A new efficient radix sort
Authors: A. Andersson
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We present new improved algorithms for the sorting problem. The algorithms are not only efficient but also clear and simple. First, we introduce Forward Radix Sort which combines the advantages of traditional left-to-right and right-to-left radix sort in a simple manner. We argue that this algorithm will work very well in practice. Adding a preprocessing step, we obtain an algorithm with attractive theoretical properties. For example, n binary strings can be sorted in /spl Theta/ (n log(B/(n log n)+2)) time, where B is the minimum number of bits that have to be inspected to distinguish the strings. This is an improvement over the previously best known result by Paige and Tarjan (1987). The complexity may also be expressed in terms of H, the entropy of the input: n strings from a stationary ergodic process can be sorted in /spl Theta/ (n log(1/H+1)) time an improvement over the result recently presented by Chen and Reif (1993).
A fastest route planning for LBS based on traffic prediction
Authors: Yong-Bin Kang, Sung-Soo Kim
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

This paper proposes a new route plan on the basis of traffic prediction for finding a fastest route to a given destination in traffic network. So far, lots of traffic prediction systems were introduced to help drivers. Previous works were done mainly on providing restricted route services which depend on only cumulative traffic velocities. For this reason, we consider both real-time and cumulative traffic information together to obtain more accurate future traffic information. In location-based services, the traffic network is needed to solve certain constrains, such as turns problems and provide method for avoiding traffic congestions. To guide a fastest route service in such a complicated network, we first construct a linear dual graph from a traffic network. Then, we propose main algorithmic approaches which are developed by Kalman Filter and cumulative traffic patterns to predict a much better quality of future traffic information by combining real-time with cumulative traffic conditions. Finally, we adopt Dijkstra's shortest path algorithm to minimize the travel time with generating a fastest cost function. Experimental results show that this approach is highly efficient in route plan than previously used ways by only cumulative approaches. This approach is supposed to proceed convenience for drivers and develop a quality of navigation service in telematics.
Pricing combinatorial markets for tournaments
Authors: Yiling Chen, Sharad Goel, David M. Pennock
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In a prediction market, agents trade assets whose value is tied to a future event, for example the outcome of the next presidential election. Asset prices determine a probability distribution over the set of possible outcomes. Typically, the outcome space is small, allowing agents to directly trade in each outcome, and allowing a market maker to explicitly update asset prices. Combinatorial markets, in contrast, work to estimate a full joint distribution of dependent observations, in which case the outcome space grows exponentially. In this paper, we consider the problem of pricing combinatorial markets for single-elimination tournaments. With $n$ competing teams, the outcome space is of size 2n-1. We show that the general pricing problem for tournaments is P-hard. We derive a polynomial-time algorithm for a restricted betting language based on a Bayesian network representation of the probability distribution. The language is fairly natural in the context of tournaments, allowing for example bets of the form "team i wins game k". We believe that our betting language is the first for combinatorial market makers that is both useful and tractable. We briefly discuss a heuristic approximation technique for the general case.
Interactive visualization of news distribution in blog space
Authors: Yasufumi Takama, Akio Matsumura, Tomoki Kajinami
Venue: New Generation Computing (2008)

This paper proposes a visualization method of news distribution in Blog space. Recently, Blog is becoming one of the important information resources on the Web, from which trend information can be obtained. On the other hand, online news site is another information resource, which reports latest events in the world. This paper focuses on the combination of both resources, and proposes a method for visualizing news distribution in Blog space, which indicates various access patterns to news articles in Blog space. The types of objects that are to be visualized as well as their relationships are defined, based on which interactive information visualization system is proposed. Experiments with test subjects are performed to investigate the viewpoints they employ for examining news distribution in Blog space. The results show that test subjects can examine news distribution in Blog space from various viewpoints, which affects their estimation of the impacts of news articles.
Minimal triangulations of sphere bundles over the circle
Authors: Bhaskar Bagchi, Basudeb Datta
Venue: Journal of Combinatorial Theory Series A (2008)

For integers d>=2 and @e=0 or 1, let S^1^,^d^-^1(@e) denote the sphere product S^1xS^d^-^1 if @e=0 and the twisted sphere product if @e=1. The main results of this paper are: (a) if d=@e(mod2) then S^1^,^d^-^1(@e) has a unique minimal triangulation using 2d+3 vertices, and (b) if d=1-@e(mod2) then S^1^,^d^-^1(@e) has minimal triangulations (not unique) using 2d+4 vertices. In this context, a minimal triangulation of a manifold is a triangulation using the least possible number of vertices. The second result confirms a recent conjecture of Lutz. The first result provides the first known infinite family of closed manifolds (other than spheres) for which the minimal triangulation is unique. Actually, we show that while S^1^,^d^-^1(@e) has at most one (2d+3)-vertex triangulation (one if d=@e(mod2), zero otherwise), in sharp contrast, the number of non-isomorphic (2d+4)-vertex triangulations of these d-manifolds grows exponentially with d for either choice of @e. The result in (a), as well as the minimality part in (b), is a consequence of the following result: (c) for d>=3, there is a unique (2d+3)-vertex simplicial complex which triangulates a non-simply connected closed manifold of dimension d. This amazing simplicial complex was first constructed by Kuhnel in 1986. Generalizing a 1987 result of Brehm and Kuhnel, we prove that (d) any triangulation of a non-simply connected closed d-manifold requires at least 2d+3 vertices. The result (c) completely describes the case of equality in (d). The proofs rest on the Lower Bound Theorem for normal pseudomanifolds and on a combinatorial version of Alexander duality.
Processing Ad-Hoc Queries in Wireless Sensor Networks
Authors: Sanghun Yun, Haengrae Cho, Xingcheng Liu
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

A wireless sensor network (WSN) consists of a large number of sensor nodes that can measure and process data while communicating through wireless channels. In this paper, we propose a hybrid query processing (HQP) algorithm for user queries submitted to the WSN. Unlike previous algorithms that consider continuous queries only, HQP supports both continuous queries and ad-hoc queries. Specially, HQP tries to reduce energy consumption of ad-hoc queries by using query results cached at each sensor node which are created during the execution of the previous continuous queries. HQP can also exploit a trade-off between energy consumption and data accuracy. We compare the performance of HQP with previous algorithms using our simulation model.
Noise-Assisted Control in Information Networks
Authors: Naoki Wakamiya, Kenji Leibnitz, Masayuki Murata
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In recent years, interesting phenomena were revealed where the inherent noise enhances the adaptability of a system to its changing environment in a resilient manner. The application of such methods can be found in a wide variety of fields, from biology to engineering. In this paper we discuss the application of noise-assisted mechanisms to control and manage information networks. Specifically, we focus on two mechanisms, stochastic resonance and adaptive response by attractor selection, and show how they can be applied in self-adaptive network control to improve the robustness and reliability of the system.
Communication in distributed model predictive collision avoidance
Authors: Yongsoon Yoon, H. Jin Kim, J. H. Shin, Tokson Choe, Yongwoon Park
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

This paper presents a model predictive approach for collision avoidance of car-like robots. An optimal problem is formulated in terms of cost minimization under constraints. Information on each robot can be incorporated online in the nonlinear model predictive framework and kinematic constraints are treated by Karush-Kuhn-Tucker(KKT) condition. For distributed collision avoidance of multiple robots with two levels of a communication network, performances are compared. In comparison with different types of communication, how much information the robots share can cause difference in the performance. More successful collision avoidance was possible when the robots share enough amount of information.
FlexPar: Reconfigurable Middleware for Parallel Environments
Authors: Jó Ueyama, Edmundo Roberto Mauro Madeira, Paul Grace
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Although a growing number of devices have the support for parallel processing, parallelism is not widely exploited, as it should be. This can be illustrated by the fact that all Apple desktops and laptops are currently supplied with one or more dual-core processors. Despite this, parallel programming in popular languages such as Java is not widely encouraged and often only recommended as a last resort. In addition, it is likely that the next generation parallel applications will have to operate within a diverse range of heterogeneous devices ranging from supercomputers to sensors. This paper proposes a flexible component-based middleware that aims at facilitating the construction of deadlock-free parallel and concurrent applications for heterogeneous environments. The middleware is particularly targeted to tailor applications to the target need and environment. For our prototyping, we implemented plugins that are capable of deploying JCSP(CSP library for Java programmers) and occampi processes. Both JCSP and occampi make use of the CSP disciplines. The CSP (Communicating Sequential Processes) paradigm helps us to avoid concurrency problems such as deadlocks. It should be stressed that there is no bias towards these languages as the proposed middleware is highly extensible.
An improved higher order zigzag theory for the static analysis of laminated sandwich plate with soft core
Authors: Mihir K. Pandit, Abdul H. Sheikh, Bhrigu N. Singh
Venue: Finite Elements in Analysis and Design (2008)

An improved higher order zigzag theory is proposed for the static analysis of laminated sandwich plate with soft compressible core. The variation of in-plane displacements is assumed to be cubic for both the face sheets and the core and transverse displacement is assumed to vary quadratically within the core while it remains constant through the faces. The core is considered to behave as a three-dimensional elastic medium to incorporate the effect of transverse normal deformation. A computationally efficient C^0 finite element is also proposed for this model. Numerical examples of laminated composite and sandwich plate are provided for different thickness ratios and aspect ratio to illustrate the accuracy of the present formulation by comparing the present results with the three-dimensional elasticity solutions. Some new results are also presented. The performance of the present model is excellent in calculating displacements and stresses for a wide range of sandwich plate problems with transversely flexible core.
The inhabitation problem for intersection types
Authors: M W Bunder
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

In the system &lambda;&Lambda; of intersection types, without &omega;, the problem as to whether an arbitrary type has an inhabitant, has been shown to be undecidable by Urzyczyn in [10]. For one subsystem of &lambda;&Lambda;, that lacks the &Lambda;-introduction rule, the inhabitation problem has been shown to be decidable in Kurata and Takahashi [9]. The natural question that arises is: What other subsystems of &lambda;&Lambda;, have a decidable inhabitation problem? The work in [2], which classifies distinct and inhabitation-distinct subsystems of &lambda;&Lambda;, leads to the extension of the undecidability result to &lambda;&Lambda; without the (&eta;) rule. By new methods, this paper shows, for the remaining six (two of them trivial) distinct subsystems of &lambda;&Lambda;, that inhabitation is decidable. For the latter subsystems inhabitant finding algorithms are provided.
Persistence and communication state transfer in an asynchronous pipe mechanism
Authors: Philip Chan, David Abramson
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Emergent wide-area distributed systems like computational grids present opportunities for large scientific applications. On these systems, communication mechanisms have to deal with dynamic resource availability and occurrence of network failures. In this paper, we present the design and implementation of an asynchronous and persistent pipe mechanism, called &#x03C0;-channels. These communication issues are addressed by combining adaptive caching with data streaming for efficient and fault-tolerant communication. We present the underlying distributed algorithm that implements (a) caching of pipe data segments; (b) asynchronous operation; and (c) re-establishment of connections when a peer leaves and rejoins the computation - part of a communication state transfer mechanism. This makes it possible for different segments (from cache and from writer) of the pipe data to be concurrently streamed to the migrated reader, reducing the retrieval time. Finally, we present some performance results showing the benefits of asynchronous operation.