ppxscal/embedding_network huggingface dataset:
An energy-efficient data dissemination method in a cluster-based sensor network
Authors: Jieun Cho, Jongwon Choe
Venue: Proceedings of the 4th Asian Conference on Internet Engineering (2008)

One of the most important considerations in designing sensor nodes in a wireless sensor network is to extend the network lifetime by minimizing the energy consumption with limited resources. The most challenging aspects of the studies conducted on this topic have been supporting the mobility of sink nodes in a wireless sensor network, and providing an efficient data dissemination approach. This paper proposes an Energy-Efficient data dissemination method in a cluster-based sensor network (CBDD) to minimize energy consumption during data dissemination to mobile sink nodes. The protocol uses permanent grid and clustering techniques to create energy-efficient data dissemination routes even when multiple mobile sink nodes exist in a large scale sensor network. Furthermore, data is disseminated using cross-shape trajectory forwarding to transmit data through intermediate nodes with forwarding information, rather than by directly transmitting data from the source to destination nodes. The superior energy efficiency of the proposed CBDD is demonstrated by conducting a comparative analysis and simulation with the TTDD (two-tier data dissemination) approach.
Low-coordination wake-up algorithms for multiple connected-covered topologies in sensor nets
Authors: Rajagopal Iyengar, Koushik Kar, Suman Banerjee
Venue: International Journal of Sensor Networks (2009)

It is likely that low-cost energy constrained sensor devices will be prone to failure. This necessitates that these devices must be deployed in higher densities than required. At a high level, the simplest strategy that can be exploited to prolong network lifetime is to activate only a subset of nodes at a time, while keeping the other nodes asleep, so that the topology formed by the active nodes is connected and provides coverage of the area of interest. Providing diversity in the connected sets of nodes also improves network lifetime significantly. We propose and evaluate different distributed, random and pattern-based wake-up policies for sensor nodes to construct connected-covered topologies. Through analysis and simulations we demonstrate that in dense sensor deployment scenarios, these policies can construct near-optimal topologies with minimal coordination between nodes, as long as location information is available at the individual sensor nodes. Based on these observations, we develop and evaluate a few simple distributed, wake-up based topology construction algorithms that can realise similar performance bounds in realistic sensor deployments, with varying node densities. These algorithms differ in terms of the required level of coordination and the use of sensor location information, and generate connected-covered topologies efficiently, with very low message-exchange overhead.
Excluding a bipartite circle graph from line graphs
Authors: Sang-il Oum
Venue: Journal of Graph Theory (2009)

We prove that, for a fixed bipartite circle graph H, all line graphs with sufficiently large rank-width (or clique-width) must have a pivot-minor isomorphic to H. To prove this, we introduce graphic delta-matroids. Graphic delta-matroids are minors of delta-matroids of line graphs and they generalize graphic and cographic matroids. &copy; 2008 Wiley Periodicals, Inc. J Graph Theory 60: 183&ndash;203, 2009 The research was partially done while the author was at Georgia Institute of Technology.
Sound Authoring Tools for Future Multimedia Systems
Authors: Marco Bezzi, Giovanni de Poli, Davide Rocchesso
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

A framework for authoring non-speech sound objects in the context of multimedia systems is proposed. The goal is to design specific sounds and their dynamic behavior in such a way that they convey dynamic and multidimensional information. Sounds are designed using a three-layer abstraction model: physically-based description of sound identity, signal-based description of sound quality, perception- and geometry-based description of sound projection in space. The model is validated with the aid of an experimental tool where manipulation of sound objects can be performed in three ways: handling a set of parameter control sliders, editing the evolution in time of compound parameter settings, via client applications sending their requests to the sounding engine.
Design of modified PD algorithm to control angular motion of large space structure
Authors: I. N. Krutova, V. M. Sukhanov
Venue: Automation and Remote Control (2009)

Consideration was given to the design of an algorithm to control orientation of the large space structure (LSS) in the presence of infralow (less than 0.01Hz) frequencies of elastic oscillations exerting considerable influence on the quality of transients due to closeness of the LSS eigenfrequencies to the frequency of control of the object's "rigid" motion. Procedure for designing a modified PD-algorithm for orientation of the LSS with infralow frequencies of elastic structural oscillations was described. Methods were proposed for calculation of the coefficients of additional components of the modified algorithm and determination of the LSS eigenfrequency boundary to the right of which the orientation control system is robust to the deviations of the object frequencies or inaccuracy of their definition. Some examples of mathematical modeling of the processes of the relay gyroforce control of LSS orientation using the proposed algorithm were given.
Proximity-based authentication of mobile devices
Authors: Adin Scannell, Alexander Varshavsky, Anthony LaMarca, Eyal De Lara
Venue: International Journal of Security and Networks (2009)

Securing interactions between devices that do not know each other a priori is an important and challenging task. We present Amigo, a technique to authenticate co-located devices using knowledge of their shared radio environment as proof of physical proximity. We present evaluation results that show that our technique is robust against a range of passive and active attacks. The key advantages of our technique are that it does not require any additional hardware to be present on the devices beyond the radios that are already used for communication, it does not require user involvement to verify the validity of the authentication process, and it is not vulnerable to eavesdropping.
Effect of edge-preserving adaptive image filter on low-contrast detectability in CT systems: application of ROC analysis
Authors: Miwa Okumura, Takamasa Ota, Kazuhisa Kainuma, James W. Sayre, Michael McNitt-Gray, Kazuhiro Katada
Venue: Journal of Biomedical Imaging (2008)

Objective. For the multislice CT (MSCT) systems with a larger number of detector rows, it is essential to employ dose-reduction techniques. As reported in previous studies, edge-preserving adaptive image filters, which selectively eliminate only the noise elements that are increased when the radiation dose is reduced without affecting the sharpness of images, have been developed. In the present study, we employed receiver operating characteristic (ROC) analysis to assess the effects of the quantum denoising system (QDS), which is an edge-preserving adaptive filter that we have developed, on low-contrast resolution, and to evaluate to what degree the radiation dose can be reduced while maintaining acceptable low-contrast resolution. Materials and Methods. The low-contrast phantoms (Catphan 412) were scanned at various tube current settings, and ROC analysis was then performed for the groups of images obtained with/without the use of QDS at each tube current to determine whether or not a target could be identified. The tube current settings for which the area under the ROC curve (Az value) was approximately 0.7 were determined for both groups of images with/without the use of QDS. Then, the radiation dose reduction ratio when QDS was used was calculated by converting the determined tube current to the radiation dose. Results. The use of the QDS edge-preserving adaptive image filter allowed the radiation dose to be reduced by up to 38%. Conclusion. The QDS was found to be useful for reducing the radiation dose without affecting the low-contrast resolution in MSCT studies.
Probabilistic instantaneous model-based signal processing applied to localization and tracking
Authors: Frederik Beutler, Marco F. Huber, Uwe D. Hanebeck
Venue: Robotics and Autonomous Systems (2009)

In this paper, a probabilistic approach for estimating time and space-variant parameters of a system, based on sequentially received discrete-time signal values, is presented. The system description is the solution of a linear partial differential equation (PDE). The PDE describes for example the wave propagation of an acoustic wave in a localization system. The solution of the PDE is given by a time-variant and space-variant impulse response. This impulse response is characterized by the time and space-variant parameters in order to track an object, which emits for example an acoustic signal. For estimating the position of the object in an instantaneous way a Bayesian approach has to be used, which considers the dynamic behavior of the parameters in a system model and uncertainties in a stochastic manner by means of probability density functions. Hence, the new approach provides a probabilistic instantaneous model-based signal processing, where the sequentially measured signal values are processed directly and known reference signal sequences are interpreted as part of a time-variant nonlinear measurement equation.
Computational framework for behavioural modelling of neural subsystems
Authors: M. T. Signes, J. M. García, G. de Miguel, H. Mora
Venue: Neurocomputing (2009)

This paper presents a new approach to the problem of modelling living system dynamics. Our point of view claims the fact that behind the biological apparent complexity, a hidden simplicity may appear when a suitable modelling is developed. The framework is inspired on the computing features of biological systems by involving a set of elementary standard behaviours that can be combined in order to emulate more complex behaviours. The algebraic formalization is based on both a recursive primitive operation defined by a table which models the elementary behaviours and a multilevel operating mode that carries out behaviour combinations. A parametric architecture implements the model, providing a good trade-off between time delay calculation and memory requirements. In this paper, the simulation of neural subsystems is considered as an application. The comparison with other simulation techniques outlines the capabilities of our method to provide an accurate modelling together with a very simple circuit implementation.
Space-Efficient Informational Redundancy
Authors: Christian Glaßer
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We study the relation of autoreducibility and mitoticity for polylog-space many-one reductions and log-space many-one reductions. For polylog-space these notions coincide, while proving the same for log-space is out of reach. More precisely, we show the following results with respect to nontrivial sets and many-one reductions. 1 polylog-space autoreducible ${\,\mathop{\Leftrightarrow}\,}$ polylog-space mitotic 1 log-space mitotic log-space autoreducible (logn ·loglogn)-space mitotic 1 relative to an oracle, log-space autoreducible log-space mitotic The oracle is an infinite family of graphs whose construction combines arguments from Ramsey theory and Kolmogorov complexity.
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
Authors: David Eppstein
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We define an xyz graph to be a spatial embedding of a 3-regular graph such that the edges at each vertex are mutually perpendicular and no three points lie on an axis-parallel line. We describe an equivalence between xyz graphs and 3-face-colored polyhedral maps, under which bipartiteness of the graph is equivalent to orientability of the map. We show that planar graphs are xyz graphs if and only if they are bipartite, cubic, and three-connected. It is NP-complete to recognize xyz graphs, but we show how to do this in time O(n2 n/2).
Measurement framework for evaluating e-governance on municipalities websites
Authors: Rocío Andrea Rodríguez, León Welicki, Daniel Alberto Giulianelli, Pablo Martín Vera
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

This paper presents a measurement framework for evaluating the design, content and services offered to citizens by municipal web sites. The proposed framework comprises 152 metrics enabling to analyze web sites by calculating through a single numerical value the level of e-Governance reached by each site. To perform this analysis a sample of municipal sites is considered, consisting on the capital cities of 31 countries spread over different continents. The results are compared and analyzed, allowing countries categorization according to their approach to e-Governance.
Simulation Model for the Studying of the Self-organizing Team
Authors: Jing Li, Yuejin Zhou
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

This paper proposes a multi-agent model for the studying of the self-organization team’s behavior. The model is dependent on the interaction rules and the decision factors of team members. Three kinds of team members (Reciprocators, Cooperators and Selfish) are proposed in the paper. The team members work with one of three work attitudes (diligence, average, shirking). A small-world network is suggested as the basic relationships of team members. It is supposed that team member’s decision of choosing work attitude depends on four decision factors, humanity, herd instinct, rationality, and follower tendency. A self-adaptive algorithm is suggested to achieve the four decision factors’ weights. The results of self-adaptive algorithm have different influence on the team’s behaviors under different fractions of Reciprocators. A number of experiments demonstrate that the multi-agent model is beneficial to manage the self-organizing team. The model should be available as a toolkit for the studying of the self-organizing team.
Tagging Classical Sanskrit Compounds
Authors: Brendan S. Gillon
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

The paper sets out a prima facie case for the claim that the classification of Sanskrit compounds in Pāninian tradition can be retrieved from a very slight augmentation of the usual enriched context free rules.
DynaQoS&copy;-RDF: a best effort for QoS-assurance of dynamic reconfiguration of dataflow systems
Authors: Wei Li
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2009)

The significance of QoS-assurance is being increasingly recognized by both the research and wider communities. In the latter case, this recognition is driven by the increasing adoption by business of 24-7 software systems and the QoS decline that end-users experience when these systems undergo dynamic reconfiguration. At the beginning of 2006, the author set up a project named DynaQoS&copy;-RDF (QoS-assurance of Dynamic Reconfiguration on Reconfigurable Dataflow Model), which was then sponsored by the CQ University Australia. Over the last two years, the author has investigated QoS-assurance for dataflow systems, which are characterized by the pipe-and-filter architecture. The research has addressed issues such as: the global consistency of protocol transactions, the necessary and sufficient conditions for QoS-assurance, execution overhead control for reconfiguration, state transfer for stateful components, and the design of a QoS benchmark. This paper discusses these research issues. It also proposes various QoS strategies and presents a benchmark for evaluating QoS-assurance strategies for the dynamic reconfiguration of dataflow systems. This benchmark is implemented using the DynaQoS&copy;-RDF v1.0 software platform. Various strategies, including those from the research literature are benchmarked, and the best efforts for QoS-assurance are identified. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Fast Forward and Fast Rewind Play System Based on the MPEG System Stream with New Concept
Authors: Sang-Yoon, Doh, Min Jang
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper, we present systems and algorithms for fast forward and fast rewind play system of motion picture streams encoded in standard MPEG system. Many traditional standard MPEG system decoders cannot easily control the MPEG system stream. Especially they have difficulty in controlling fast forward and fast rewind play. We adapt new concept for our system. We use index data in MPEG system stream. It has compatibility with the standard MPEG decoding method and also covers problems of other models.
Price Trust Evaluation in E-service Oriented Applications
Authors: Yan Wang, Lei Li, Ee-Peng Lim
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Trust is a critical issue in e-commerce and e-service environments. Some applications (such as eBay) have introduced various trust management mechanisms to provide valuable information to buyers prior to placing orders and making payments. While trust has been actively studied in the research community, some malicious sellers and fraudulent transactions still widely exist. A typical attack is to entice buyers into making payments for buying items at very cheap and attractive prices and not to deliver the items or deliver the fake item after payment. This paper proposes a new trust management system that provides information to indicate to some extent the trust level of a seller at an offered price. In this paper, we describe our proposed approach for price trust evaluation and an approach for market price calculation. We also evaluated our approaches empirically.
Discovering simulation models
Authors: A. Rozinat, R. S. Mans, M. Song, W. M. P. van der Aalst
Venue: Information Systems (2009)

Process mining is a tool to extract non-trivial and useful information from process execution logs. These so-called event logs (also called audit trails, or transaction logs) are the starting point for various discovery and analysis techniques that help to gain insight into certain characteristics of the process. In this paper we use a combination of process mining techniques to discover multiple perspectives (namely, the control-flow, data, performance, and resource perspective) of the process from historic data, and we integrate them into a comprehensive simulation model. This simulation model is represented as a colored Petri net (CPN) and can be used to analyze the process, e.g., evaluate the performance of different alternative designs. The discovery of simulation models is explained using a running example. Moreover, the approach has been applied in two case studies; the workflows in two different municipalities in the Netherlands have been analyzed using a combination of process mining and simulation. Furthermore, the quality of the CPN models generated for the running example and the two case studies has been evaluated by comparing the original logs with the logs of the generated models.
Target Identification in Battlefield Based on Evidence Theory
Authors: Li-biao Tong, Wen-jun Lu, Cong-li Li
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

With the development of digital and waveform micro-seismic emission (ME) technology, it makes the recognition of ME source possible. Because of the noise and complex of ME signal transmission characteristic, the recognition of ME source is very difficult. In order to resolve this problem, the new method of multi-sensor data fusion on decision level was presented. Using the data from each sensor in a location set and considering the confidence value for each sensor, the ME source characteristics were acquired. Experiment results show that the Battlefield target recognition based on Dempster-Shafer evidence Theory’s data fusion result is better than that of single sensor and the multi-sensor data fusion method is effective.
Computing with Proteins
Authors: Naren Ramakrishnan, Upinder S. Bhalla, John J. Tyson
Venue: Computer (2009)

Protein-based computers are ripe for spectacular scientific advances because we know a great deal about these circuits' molecular components. But we are only beginning to understand how they process information and make decisions.
Impacts of Interval Computing on Stock Market Variability Forecasting
Authors: Ling T. He, Chenyi Hu
Venue: Computational Economics (2009)

This study uses the interval computing approach to forecast the annual and quarterly variability of the stock market. We find that the forecasting accuracy is significantly higher than the OLS lower and upper bound forecasting. The strength of the interval computing comes from its data processing. It uses lower and upper bound information simultaneously, no variability information is lost in parameter estimation. The quarterly interval (variability) forecasts suggest that the interval computing method outperforms the OLS lower and upper bound forecasting in both stable and volatile periods.
Novel approaches to improve the capacity of optical packet-switched networks without optical buffers
Authors: Yuan Chi, Li Zhengbin, Xu Anshi
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Under the current and foreseeable limitations of optical technology, performance of optical packet-switched networks is mainly hampered at the network node by resource contention. The contention is serious constraints on the capacity of the network. Therefore, most of the research activities are focus on the node design. Unlike the existing research activities are focus on the node design, we proposed a new concept--server vision for optical packet-switched networks in this paper. From the point of view of server vision, the network resource is categorized into three types---the access server, the node server and the link server, based on the fact that the network resource performs the different function for the traffic. After present the server vision optical network, we presented two novel approaches--two link server solutions-- to erase the resource contention. One solution is the packet calking, and the other solution is the dual-fiber link. We have developed some scenarios to validate these solutions. Simulation results show that the dual-fiber link can reduce the contention in terms of orders of magnitude in optical packetswitched networks without optical buffers and wavelength conversions.