ppxscal/embedding_network huggingface dataset:
The impact of local policies on the quality of packet routing in paths, trees, and rings
Authors: Eric Angel, Evripidis Bampis, Fanny Pascual
Venue: Journal of Scheduling (2008)

We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced, with respect to a global optimal solution, if each link uses a (fixed) local policy to schedule the packets which go through it. The quality of the derived solutions is measured using the worst case analysis for two global optimality criteria, namely the maximum arrival date of a packet at its destination (or makespan) and the average arrival date of the packets at their destinations.We consider the setting where n packets, each one having a size (or length) and a destination, are released from the same source. In the case of rings, there exist two paths between the source and a destination. Each packet is owned by a user which chooses a path to its destination. We assume that users are rational: knowing the local policy used by the links and the state of the network, a user chooses the path which minimizes the arrival date of its packet at its destination. We are then interested by the quality of the Nash equilibria obtained.
A Scheme to Enhance TEBU Scheme of Fast Handovers for Mobile IPv6
Authors: Seonggeun Ryu, Youngsong Mun
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In Mobile IPv6, a handover latency is an important issue. To reduce the handover latency, mipshop working group in IETF has studied the fast handovers for Mobile IPv6 (FMIPv6) which creates and verifies a new care-of address (NCoA) in advance before a layer 2 handover resulting in reduced handover latency. Then the paper which reduces delay of a binding update to a home agent (HA) is emerged, called the TEBU (Tentative and Early Binding Update) scheme. This scheme can reduce handover latency, since the NCoA is registered to the HA during the layer 2 handover of FMIPv6. Additionally, if Return Routability (RR) procedure which introduces long delay is performed in advance like the TEBU scheme, the handover latency may be reduced significantly. Therefore, we propose an enhanced TEBU (eTEBU) scheme that the binding update (BU) and RR procedure are started during the layer 2 handover. The BU message and the messages for RR procedure are transferred through a fast binding update message (FBU) of FMIPv6. We perform analysis of handover latency for the performance evaluation. As a result, we found that the eTEBU scheme guarantees lower handover latency than the TEBU scheme and FMIPv6.
Temporal Hebbian Self-Organizing Map for Sequences
Authors: Jan Koutník, Miroslav Šnorek
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

In this paper we present a new self-organizing neural network called Temporal Hebbian Self-organizing Map (THSOM) suitable for modelling of temporal sequences. The network is based on Kohonen's Self-organizing Map, which is extended with a layer of full recurrent connections among the neurons. The layer of recurrent connections is trained with Hebb's rule. The recurrent layer represents temporal order of the input vectors. The THSOM brings a straightforward way of embedding context information in recurrent SOM using neurons with Euclidean metric and scalar product. The recurrent layer can be easily converted into a stochastic automaton (Markov Chain) generating sequences used for previous THSOM training. Finally, two real world examples of THSOM usage are presented. THSOM was applied to extraction of road network from GPS data and to construction of spatio-temporal models of spike train sequences measured in human brain in vivo.
Semantic Similarity, Ontologies and the Portuguese Language: A Close Look at the subject
Authors: Juliano Baldez Freitas, Vera Lúcia Lima, Josiane Fontoura Anjos Brandolt
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

Semantic similarity and mapping between ontologies are a crucial subject, which is just starting to be researched for ontologies written in Portuguese. Our study begins with SiSe (Similaridade Semântica) measure, an extension for the Taxonomic Overlap proposed by Maedche and Staab [1], which compares the similarity between terms of distinct ontologies through the analysis of the hierarchies where they are placed. SiSe development and evaluation, even bringing some interesting conclusions, point to continuing efforts, what is discussed here in the context of more recent proposals presented in the ontology mapping domain.
Classification of Key Management Schemes for Wireless Sensor Networks
Authors: Hwaseong Lee, Yong Ho Kim, Dong Hoon Lee, Jongin Lim
Venue: Proceedings of the APWeb/WAIM 2007 DBMAN, WebETrends, PAIS and ASWAN international workshops on Advances in Web and Network Technologies, and Information Management (2007)

For secure wireless sensor networks, a pair-wise key between nodes has to be established securely and efficiently. It is common to evaluate the security and efficiency of a (symmetric) key management scheme with those of other schemes without considering adversary's ability. In this paper, we defined attack models according to adversary's ability and classify existing key management schemes according to the attack models. We also suggested a guideline on selecting a proper key scheme with a given attack model. We expect our classification provides a certain criteria to fairly evaluate key management schemes in the same attack model.
A meta-level architecture for QoS awareness in a mobile environment
Authors: Zahi Jarir, Mohammed Erradi
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

According to their requirements, mobile clients interact with their environments to discover local services offered by different service providers. The underlying software, either within the mobile clients or the servers, consists in different discovery protocols and a variety of heterogeneous middleware platforms such as CORBA, RMI, SOAP, etc. The diversity of discovery protocols can also be a barrier to discover the available services in the context of a mobile client. Therefore, service invocation may require a dynamic adaptation to the specific features of the middleware and those of the available discovery protocols in use. In addition, when a given service is provided by two or more providers, within the same area of the mobile clients, a decision should be made to select the most appropriate service with the best quality of service. The objective of this work is to suggest an adaptive reflective middleware named MAQAME: a Meta-level Architecture for Qos Adaptation in a Mobile Environment that provides a QoS management level to select the service having the better quality of service among the other provided local services. Firstly, we present an overview of a previous work related to an adaptable Middleware, developed for a fixed environment. Then we discuss the MAQAME components that allow a dynamic adaptation of both discovery and interaction protocols to the mobile client environment while providing the better QoS
The noise cancelling technique using Z-filter on machining signal
Authors: M. Z. Nuawi, F. Lamin, M. J. M. Nor, N. Jamaluddin, S. Abdullah
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

A filter is used to remove undesirable frequency information from a dynamic signal. This paper shows that noise nuisance can be effectively removed from a machining signal when applying the Z-filter filtering technique to extract the desired spectra components. The Z-filter can be applied as the noise of the operation that being studied can be determined. The noise components were initially identified from the sound produced by the operation of machine components itself such as hydraulic system, motor, machine environment condition and etc. By correlating the noise components with the measured machining signal, the filtered signal which was less interfered with the noise can be obtained. As a result, the interested components of the measured signal were extracted. The elimination of noise is very important for fault diagnosis where in common, the noise will change the original signal feature that can deteriorate the useful sensory information.
Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group
Authors: Kirsten Eisenträger, Dimitar Jetchev, Kristin Lauter
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

Kolyvagin has shown how to study the Shafarevich-Tate group of elliptic curves over imaginary quadratic fields via Kolyvagin classes constructed from Heegner points. One way to produce explicit non-trivial elements of the Shafarevich-Tate group is by proving that a locally trivial Kolyvagin class is globally non-trivial, which is difficult in practice. We provide a method for testing whether an explicit element of the Shafarevich-Tate group represented by a Kolyvagin class is globally non-trivial by determining whether the Cassels pairing between the class and another locally trivial Kolyvagin class is non-zero. Our algorithm explicitly computes Heegner points over ring class fields to produce the Kolyvagin classes and uses the efficiently computable cryptographic Tate pairing.
Performance Analysis of Ranging System Based on Combined Modulation Using Spectral Correlation Method
Authors: Xinhong Hao, Zhanzhong Cui
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

A new radio ranging system based on pseudo-random binary-phase code and linear frequency combined modulation is presented. An improved signal processing method of the correlation detection of cyclic autocorrelation function is given and applied to the ranging system. It is proved to be equivalent to the spectral correlation method. The ranging performance and anti-noise ability are simulated and analyzed. The simulation results of ranging precision are in accord with the calculation values. The results show that the spectral correlation method has better ranging precision and stronger anti-noise capability.
A Range Free Localization Algorithm Based on Restricted-Area for Wireless Sensor Networks
Authors: Chao Wang, Kai Liu, Nan Xiao
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

This paper presents a restricted-area-based localization algorithm (RAL) for wireless sensor networks (WSN), in which radio connectivity and principle of perpendicular bisectors are used to provide a lower estimation error than some of restricted-area-based localization algorithms. In the RAL algorithm, anchor nodes can transmit beacon signals at different power levels, which divide the possible transmission ranges of an anchor into a circle and multiple rings. The intersection of circle or rings of all the anchors heard by unknown node forms restricted-area I. In addition, we utilize all the perpendicular bisectors of the line which connects each pair of anchor nodes to obtain restricted-area II. Based on the restricted-area I and restricted-area II, we can calculate valid intersection points, and take average value of all these points as the estimated location of the unknown nodes. The proposed algorithm is range-free and energy efficient. Neighboring sensor nodes do not need to exchange information. Each sensor node only relies on information of anchors it heard to compute two kinds of restricted-areas and estimates its location. Simulation results show that the proposed algorithm has less estimation error than Centroid, Convex and CAB localization algorithms.
Normalization Issues in Mathematical Representations
Authors: Manfred Kerber
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

Typically it is considered a strength of a language that the same situation can be described in different ways. However, when a human or a program is to check whether two representations are essentially the same it is much easier to deal with normal forms. For instance, (infinitely many) different sets of formulae may normalize to the same clause set. In the case of propositional logic formulae with a fixed number of boolean variables, the class of all clause sets is finite. Since it grows doubly exponentially, it is not feasible to construct the complete class even for small numbers of boolean variables. Hence further normalizations are necessary and will be studied. Furthermore some potential applications will be discussed.
Interval ordered information systems
Authors: Yuhua Qian, Jiye Liang, Chuangyin Dang
Venue: Computers Mathematics with Applications (2008)

Interval information systems are generalized models of single-valued information systems. By introducing a dominance relation to interval information systems, we propose a ranking approach for all objects based on dominance classes and establish a dominance-based rough set approach, which is mainly based on substitution of the indiscernibility relation by the dominance relation. Furthermore, we discuss interval ordered decision tables and dominance rules. To simplify knowledge representation and extract much simpler dominance rules, we propose attribute reductions of interval ordered information systems and decision tables that eliminate only the information that are not essential from the viewpoint of the ordering of objects or dominance rules. The approaches show how to simplify an interval ordered information system and find dominance rules directly from an interval ordered decision table. These results will be helpful for decision-making analysis in interval information systems.
The Parallel C Preprocessor
Authors: Eugene D. Brooks III, Brent C. Gorda, Karen H. Warren
Venue: Scientific Programming (1992)

We describe a parallel extension of the C programming language designed for multiprocessors that provide a facility for sharing memory between processors. The programming model was initially developed on conventional shared memory machines with small processor counts such as the Sequent Balance and Alliant FX/8, but has more recently been used on a scalable massively parallel machine, the BBN TC2000. The programming model is split-join rather than fork-join. Concurrency is exploited to use a fixed number of processors more efficiently rather than to exploit more processors as in the fork-join model. Team splitting, a mechanism to split the team of processors executing a code into subteams to handle parallel subtasks, is used to provide an efficient mechanism to exploit nested concurrency. We have found the split-join programming model to have an inherent implementation advantage, compared to the fork-join model, when the number of processors in a machine becomes large.
Technology standards-setting in the US wireless telecommunications industry: A study of three generations of digital standards development
Authors: Thomas A. Hemphill
Venue: Telematics and Informatics (2009)

This article focuses on the evolution of technology standards-setting in the US wireless telecommunications industry during the decades of the 1980s and 1990s. The purpose of this exploratory study is to understand and model the organizational process and environmental influences employed to develop three generations (i.e. second generation (2.0) Time Division Multiple Access (TDMA), second generation (2.5) Code Division Multiple Access (CDMA), and third generation (3.0) Wideband Code Division Multiple Access (WCDMA)) of de jure US wireless digital telecommunications standards. Through the use of a multi-case study approach, the research study focuses on inter-organizational strategic cooperation among wireless telecommunications firms proposing competitive technology designs in the standard development process. Based on data collected in these three case studies, wireless standard development models are ''mapped'' for the TDMA, CDMA and WCDMA technologies. Moreover, a generic, conceptual wireless technology standard development model is ''mapped'', a further refinement of an earlier seminal model of telecommunications standard-setting. Finally, conclusions are reached, with both theoretical and practical implications, and suggested areas of future research (in the form of a set of research hypotheses) are presented.
Real-time crowd motion planning: Scalable Avoidance and Group Behavior
Authors: Barbara Yersin, Jonathan Ma&#x00ef;m, Fiorenzo Morini, Daniel Thalmann
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Real-time crowd motion planning requires fast, realistic methods for path planning as well as obstacle avoidance. In a previous work (Morini et&#x00a0;al. in Cyberworlds International Conference, pp. 144&#x2013;151, 2007), we introduced a hybrid architecture to handle real-time motion planning of thousands of pedestrians. In this article, we present an extended version of our architecture, introducing two new features: an improved short-term collision avoidance algorithm, and simple efficient group behavior for crowds. Our approach allows the use of several motion planning algorithms of different precision for regions of varied interest. Pedestrian motion continuity is ensured when switching between such algorithms. To assess our architecture, several performance tests have been conducted, as well as a subjective test demonstrating the impact of using groups. Our results show that the architecture can plan motion in real time for several thousands of characters.
Time fractional IHCP with Caputo fractional derivatives
Authors: Diego A. Murio
Venue: Computers Mathematics with Applications (2008)

The numerical solution of the time fractional inverse heat conduction problem (TFIHCP) on a finite slab is investigated in the presence of measured (noisy) data when the time fractional derivative is interpreted in the sense of Caputo. A finite difference space marching scheme with adaptive regularization, using mollification techniques, is introduced. Error estimates are derived for the numerical solution of the mollified problem and several numerical examples of interest are provided.
A Context-Driven Bayesian Classification Method for Eye Location
Authors: Eun Jin Koh, Mi Young Nam, Phill Kyu Rhee
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

In this paper, we present a novel classification method for eye location. It is based on image context analysis. There is general accord that context can be affluent derivation of information about an illumination, character and diversity of object. However, the problem of how to customize contextual influence is not yet solved clearly. Here we describe a naïve probabilistic method for modeling and testing the images of eye patterns. The proposed eye location method employs context-driven adaptive Bayesian framework to relive the effect due to uneven condition of face image. Based on an easy holistic analysis of face images, the proposed method is able to exactly locate eye position. The experimental results show that the proposed approach can achieve superior performance using various data sets to previously proposed methods.
On Representation of Planar Graphs by Segments
Authors: Sadish Sadasivam, Huaming Zhang
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

In this paper, we introduce Vertex-face contact representation (VFCR for short) for 2-connected plane multigraphs. We present a simple linear time algorithm for constructing a VFCR for 2-connected plane graphs. Our algorithm only uses an st-orientation for G and its corresponding st-orientation for the dual graph of G. We also show that one kind of vertex-vertex contact representation (VVCR) for 2-connected bipartite planar graphs introduced by Fraysseix et al. [2,3] can be easily obtained by applying our algorithm. In general, our algorithm produces a more compact representation than their algorithm.Then we investigate st-orientations for 3-connected planar graphs. We prove that a 3-connected planar graph G with n vertices and f faces, has an st-orientation with the length of its longest directed path $\leq \frac{2n}{3}+2\lceil\sqrt{n/3}\rceil+5$. This implies that such a graph G admits a VFCR in a grid with non-trivial size bound. This non-trivial size bound also applies to the vertex-vertex contact representation [2,3] for a large class of 2-connected bipartite planar graphs.
Applications on the Image Processing Using Singular Value Preservers
Authors: Duk-Sun Kim, Sang-Gu Lee
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Singular values hold many informations on the data of a given image. And singular values are preserved by unitary (U, V)-operators. In this process singular value preserver are used on the recognition of image patterns. In this paper, we show applications on the properties of singular value preserver in the image processing and pattern recognition for given image datas.
Towards a reliable air traffic control
Authors: Minh Nguyen-Duc, Zahia Guessoum, Olivier Mari, Jean-François Perrot, Jean-Pierre Briot, Vu Duong
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track (2008)

Since critical socio-technical systems include people interacting with equipments in workplaces, their intrinsic reliability problems have been concerned with both these two "actors" Air Traffic Control (ATC) is going to be such a system in which controllers use a large number of distributed software tools to provide safety ATC services. The reliability of these services relies on the availability of the various tools. Indeed, a partial failure of a tool in use can have tragic consequences. This paper presents a multi-agent approach to this problem. We propose an agent-based decision-aided system that helps controllers in using their multiple software tools in situations where some tools are not available due to technical incidents. We build and test our system in an ATC simulation environment, thus develop an Agent-Based Simulation (ABS). Experimental work has demonstrated the significance of our system to air traffic controllers.