ppxscal/embedding_network huggingface dataset:
On-line exact shortest distance query processing
Authors: Jiefeng Cheng, Jeffrey Xu Yu
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Shortest-path query processing not only serves as a long established routine for numerous applications in the past but also is of increasing popularity to support novel graph applications in very large databases nowadays. For a large graph, there is the new scenario to query intensively against arbitrary nodes, asking to quickly return node distance or even shortest paths. And traditional main memory algorithms and shortest paths materialization become inadequate. We are interested in graph labelings to encode the underlying graphs and assign labels to nodes to support efficient query processing. Surprisingly, the existing work of this category mainly emphasizes on reachability query processing, while no sufficient effort has been given to distance labelings to support querying exact shortest distances between nodes. Distance labelings must be developed on the graph in whole to correctly retain node distance information. It makes many existing methods to be inapplicable. We focus on fast computing distance-aware 2-hop covers, which can encode the all-pairs shortest paths of a graph in O(|V|&middot;|E|1/2) space. Our approach exploits strongly connected components collapsing and graph partitioning to gain speed, while it can overcome the challenges in correctly retaining node distance information and appropriately encoding all-pairs shortest paths with small overhead. Furthermore, our approach avoids pre-computing all-pairs shortest paths, which can be prohibitive over large graphs. We conducted extensive performance studies, and confirm the efficiency of our proposed new approaches.
Nourishing the ground for sustainable HCI: considerations from ecologically engaged art
Authors: Carl DiSalvo, Kirsten Boehner, Nicholas A. Knouf, Phoebe Sengers
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Sustainable HCI is now a recognized area of human-computer interaction drawing from a variety of disciplinary approaches, including the arts. How might HCI researchers working on sustainability productively understand the discourses and practices of ecologically engaged art as a means of enriching their own activities? We argue that an understanding of both the history of ecologically engaged art, and the art-historical and critical discourses surrounding it, provide a fruitful entry-point into a more critically aware sustainable HCI. We illustrate this through a consideration of frameworks from the arts, looking specifically at how these frameworks act more as generative devices than prescriptive recipes. Taking artistic influences seriously will require a concomitant rethinking of sustainable HCI standpoints - a potentially useful exercise for HCI research in general.
AVMON: Optimal and Scalable Discovery of Consistent Availability Monitoring Overlays for Distributed Systems
Authors: Ramsés Morales, Indranil Gupta
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

This paper proposes to build overlays that help in monitoring of long-term availability histories of hosts, with a focus on large-scale distributed settings where hosts may be selfish or colluding. Concretely, we target the important problems of selection and discovery of an availability monitoring overlay. We motivate six significant goals - firstly, consistency, verifiability, and randomness, in selecting availability monitors of nodes, so as to be probabilistically resilient to selfish and colluding nodes. The next three goals are discoverability, load-balancing, and scalability in finding these monitors. We present AVMON, the first availability monitoring overlay to satisfy these six requirements. Our core algorithmic contribution is a range of protocols for discovering the availability monitoring overlay scalably and efficiently, given any arbitrary monitor selection scheme that is consistent and verifiable. We mathematically analyze the performance of AVMON's discovery protocols w.r.t. scalability and discovery time of monitors. Most interestingly, we are able to derive optimal (and practical) variants of AVMON, that minimize different combinations of memory, bandwidth, computation, and monitor discovery time. Finally, our extensive experimental evaluations using three types of availability traces - synthetic, from PlanetLab, and from the Overnet p2p system - demonstrate AVMON's practicality in a variety of distributed systems.
Rough set based ad-hoc on demand distance vector routing algorithm for MANETs
Authors: A Nagaraju, S Ramachandram
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

The existing reactive routing algorithms in Mobile Ad-hoc Networks (MANETs) generally send route request packet to all the neighbor nodes when it needs to find the destination. This greatly reduces the performance of network and consumes much of the bandwidth. The existing routing algorithms such as Ad-hoc On-demand Routing Algorithm (AODV) and Dynamic Source Routing (DSR) are suitable for networks with frequent changing topology. In this paper we propose a technique to reduce broadcasting by finding equivalence classes based on rough set concept among the neighbors of a source node. This protocol tries to establish a long term valid path from source node to destination node. This means the protocol is of more use full in several applications such as multimedia and video conferences.
Application of Neural Network Dynamic Inversion Control Arithmetic
Authors: Guang-lin He, Guo-hui Wu, Li Lao, Jing Chen
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The MAV is very little, so it is easily disturbed by the environment and has week stability. Due to its low Reynolds number, it is easy to be affected by the unstable air (turbulence and gusts), and other outside interference. Recent work in dynamic inversion with neural network may be applied to control a MAV where the reference commands include position, velocity, attitude and angular rate. This control technology can provide the MAV with an admirably command follow and steady control capability. Neural networks are used directly as the controller as well as indirect designs that are based on a neural network process model. The emulator is compiled by using neural network toolbox in MATLAB. Then the main result of this simulation is presented. It indicates that the method has high precision and strong stability, which can serve the control of MAV. Thereafter, an amendment about controlling system with dynamic inversion of the MAV is described.
Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm
Authors: Uwe Keller, Stijn Heymans
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

We present ${\mathbf{FixIt}}{\mathbb{(ALC)}}$, a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ${\mathbb{ALC}}$. ${\mathbf{FixIt}}{\mathbb{(ALC)}}$ does not search for tree-structured models as in tableau-based proof procedures, but embodies a (greatest) fixpoint-computation of canonical models that are not necessarily tree-structured, based on a type-elimination process. Soundness, completeness and termination are proven and the runtime and space complexity are discussed. We give a precise characterization of the worst-case complexity of deciding KB satisfiability (as well as related terminological and assertional reasoning tasks) in ${\mathbb{ALC}}$ in the general case and show that our method yields a worst-case optimal decision procedure (under reasonable assumptions). To the best of our knowledge it is the first fixpoint-based decision procedure for FDLs, hence introducing a new class of inference procedures into FDL reasoning.
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
Authors: Greg Reid, Lihong Zhi
Venue: Journal of Symbolic Computation (2009)

We briefly survey several existing methods for solving polynomial systems with inexact coefficients, then introduce our new symbolic-numeric method which is based on the geometric (Jet) theory of partial differential equations. The method is stable and robust. Numerical experiments illustrate the performance of the new method.
Multiagent Incremental Learning in Networks
Authors: Gauvain Bourgne, Amal Fallah Seghrouchni, Nicolas Maudet, Henry Soldano
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

This paper investigates incremental multiagent learning in structured networks. Learning examples are incrementally distributed among the agents, and the objective is to build a common hypothesis that is consistent with all the examples present in the system, despite communication constraints. Recently, different mechanisms have been proposed that allow groups of agents to coordinate their hypotheses. Although these mechanisms have been shown to guarantee (theoretically) convergence to globally consistent states of the system, others notions of effectiveness can be considered to assess their quality. Furthermore, this guaranteed property should not come at the price of a great loss of efficiency (for instance a prohibitive communication cost). We explore these questions theoretically and experimentally (using different boolean formulas learning problems).
A two-warehouse inventory model with imperfect quality production processes
Authors: Kun-Jen Chung, Chao-Chun Her, Shy-Der Lin
Venue: Computers and Industrial Engineering (2009)

One of the weaknesses of some production-inventory models is the unrealistic assumption that all items produced are of good quality. But production of defective units is a natural phenomenon in a production process. Defective items should be treated as a result of imperfect quality production. On the other hand, the classical inventory models usually assume the available warehouse has unlimited capacity. In many practical situations, there exist many factors like temporary price discounts making retailers buy a capacity of goods exceeding their own warehouse. In this case, retailers may rent other warehouses for the need of business. A lot of researchers studied inventory models with two warehouses and inventory models with imperfect quality separately. Compared with previous models, based on Salameh and Jaber [Salameh, M. K., Jaber, M. Y. (2000). Economic production quantity model for items with imperfect quality. International Journal of Production Economics, 64, 59-64.], this paper tries to incorporate the above concepts to establish a new inventory model with two warehouses and imperfect quality simultaneously. The mathematical model by maximizing the annual total profit and the solution procedure are developed and numerical examples are provided to illustrate them.
DWLT compression method based on MSVQ for a real-time ECG monitoring system in WSNs
Authors: Bonam Kim, Inkyo Jung, Insung Lee, YoungJun Kim
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

The use of a Zigbee network in various health monitoring systems has become well accepted. However, such a system has limited storage, power supply, bandwidth for communication, and processing speed when massive volumes of bio signals, especially ECG signals are involved. Various effective methods, including using low power hardware, have been proposed to maximize the limited resources. Data compression is one of the most efficient methods. In this paper, we propose an ECG compression algorithm based on a Discrete Wavelet lifting Transform (DWLT) and Multistage Vector Quantization (MSVQ) methods for a ubiquitous ECG monitoring system over the Zigbee Network. We performed an evaluation of the results of the proposed compression method through an ECG monitoring system and experimentation with a pervasive computing test bed.
Tailored least-squares solvers implementation for high-performance gravity field research
Authors: Oliver Baur
Venue: Computers Geosciences (2009)

Least-squares (LS) problems occur in almost every scientific and engineering discipline. Basically, they are generated by providing more observations than unknown parameters to be resolved. Appropriate LS solvers depend on both quality and computational issues. With regard to the latter, this paper focuses on the tailored parallel implementation of two LS solvers: the iterative LSQR method (substitutional for any Krylov-space method) and the ''brute-force'' inversion approach. Both implementations demonstrate very good scaling results in a parallel processing environment. Even so, the present investigations show that, from the computational and hardware point of view, iterative solvers outperform the ''brute-force'' approach. LSQR not only provides superior speed-up values; but, in addition, source code portability and hardware requirements are much more convenient for the iterative solver. These conclusions are drawn in the context of state-of-the-art terrestrial geopotential recovery with regard to the forthcoming Gravity field and steady-state Ocean Circulation Explorer (GOCE) satellite mission.
IT-Case Study: Ontology-Based Answer Selection in Dialog Systems
Authors: Christian Pretzsch
Venue:  (2007)

In these days our daily life is more and more affected by computers. For this reason it is necessary to find a simple and intuitive way to interact with complex technologies. Natural language dialog systems could be the solution how humans and machines could communicate with each other. One of the main tasks of such dialog systems is to provide fast and appropriate answers to user's questions. The challenge is: how do we find these answers out of the flood of information? Is there a way or an algorithm to find the appropriate answer to a given question? The author Christian Pretzsch gives, at first, an overview about the linguistically and theoretically background. Therein, among other things, the concepts: dialog, dialog systems, and ontology are introduced. Afterwards, answer selection and question-answering are elucidated, before the found results are tested for a concrete case study. This example and its evaluation is the base for an alternative approach. The illustrated algorithm could be a solution to realize answer selection in a fast and effective way. This book is addressed to students and all interested parties of Computational Linguistics, Computer Science, and Applied Linguistics.
Connection Stability Analyze Based on Dynamic Clustering Algorithm for Mobile Ad hoc Network
Authors: Limin Meng, Kai Zhou, Jingyu Hua, Zhijiang Xu, Jiabo Luo
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

With the increase in size and application are of the communication network, more attention has been paid to the invulnerability of mobile ad hoc network. Based on studying deeply in the characteristic of mobile ad hoc network, analyzing the shortages in invulnerability algorithm previously, this paper presents a mathematically tractable model of node motion to derive a precise relation between mobility and connection stability. We improve the first order energy consumption model with dynamic clustering firstly and then build a incidence matrix to depict the connectivity of the network nodes in a dynamic network model. Finally, we simulate the network invulnerability related to time. As a result, it validates the high invulnerability of the dynamic clustering ad hoc networks.
A Secure Steganographic Technique for Blind Steganalysis Resistance
Authors: Mehul S. Raval
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

A simple yet effective tactic for secure steganography is proposed in this paper that can resist the blind steganalysis. In this method author derives a matrix based on the image content and thus providing the security. This matrix is used by Quantization Index Modulation (QIM) based encoder and decoder. The embedding location of data is also randomized so as to immobilize the self calibration process. It is shown that detection rate of steganalysis scheme to proposed method is close to arbitrary speculation.
Application of Semantic Web in e-Business and Telecommunication
Authors: Aakif Nazeer Khan, M. Hussain
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Semantic web has emerged as a web of next generation providing has various opportunities to enhance the over all performance of current web. The objective of this paper is to review the literature and to provide a critical evaluation of semantic application in the domains of e-business and telecommunications. Literature review reveals that a simple solution to the current e-business problem is solved by purposing a wrapper layer above the current state of the art technologies. We emphasize that telecommunication is one the strong area of research for semantic web implementation. Strength, Weakness, Opportunities and Threats (SWOT) analysis for using semantic technologies in telecom sector is found effective to make better decision, and business to business integration on the basis of intelligent semantic web services.
Finite Gamma mixture modelling using minimum message length inference: application to SAR image analysis
Authors: Djemel Ziou, Nizar Bouguila, Mohand Said Allili, Ali El-Zaart
Venue: International Journal of Remote Sensing (2009)

This paper discusses the unsupervised learning problem for finite mixtures of Gamma distributions. An important part of this problem is determining the number of clusters which best describes a set of data. We apply the Minimum Message Length (MML) criterion to the unsupervised learning problem in the case of finite mixtures of Gamma distributions. The MML and other criteria in the literature are compared in terms of their ability to estimate the number of clusters in a data set. The comparison utilizes synthetic and RADARSAT SAR images. The performance of our method is also tested by contextual evaluations involving SAR image segmentation and change detection.
MPLS Online Routing Optimization Using Prediction
Authors: Abutaleb Abdelmohdi Turky, Andreas Mitschele-Thiel
Venue: Network Control and Optimization: Second Euro-NF Workshop, NET-COOP 2008 Paris, France, September 8-10, 2008. Revised Selected Papers (2009)

This paper presents an efficient enhancement to the online routing algorithms for the computation of Labeled Switching Paths (LSPs) in Multiprotocol Label Switching (MPLS) based networks. To achieve that, an adaptive predictor is used to predict the future link loads. Then the predicted values are incorporated in the link weights formula. Our contribution is to propose a new idea that depends on the knowledge of the future link loads to achieve a routing that can be done much more efficiently. According to the non-linear nature of traffic, we use a Feed Forward Neural Network (FFNN) to build an accurate traffic predictor that is able to capture the actual traffic behaviour. We study two performance parameters: the rejection ratio and the percentage of accepted bandwidth in different load conditions. Our proposed algorithm in general, reduces the rejection ratio of requests and achieves higher throughput when compared to CSPF and WSP algorithms.
"Chinese Whispers": mediating oscillations between physical form and digital space
Authors: Simon Fraser, Marcia Lyons, Julian Looser, Hartmut Seichter
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

In this paper we investigate the use of next generation remote collaboration tools for supporting design education. "Chinese Whispers" [ref] refers to the concept of mediating between remote studios with new forms of hybrid designing and real time online collaboration. We conducted a sequence of experiments which explore the concept of linkage and slippage, occurring at the boundaries of converging technologies as a means of generating innovative and unexpected design outcomes -- real and virtual, tangible and intangible. The project is framed in a contemporary context with background research into current concepts and theories centered on learning ecology, and user-generated design into future trends and state of the art technologies. Chinese Whisper involved linking hard- and soft-wares that are not immediately compatible in a remote networked environment, to facilitate an educational design process in both remote and real environments. Through this process students engaged in 3D scanning, downloading, visualizing, analyzing, remote simultaneous modeling in stereo and deciding when to hit '3D print' at any given stage to invent a new design methodology.
Exploiting Parallel Treebanks to Improve Phrase-Based Statistical Machine Translation
Authors: John Tinsley, Mary Hearne, Andy Way
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

Given much recent discussion and the shift in focus of the field, it is becoming apparent that the incorporation of syntax is the way forward for the current state-of-the-art in machine translation (MT). Parallel treebanks are a relatively recent innovation and appear to be ideal candidates for MT training material. However, until recently there has been no other means to build them than by hand. In this paper, we describe how we make use of new tools to automatically build a large parallel treebank and extract a set of linguistically motivated phrase pairs from it. We show that adding these phrase pairs to the translation model of a baseline phrase-based statistical MT (PBSMT) system leads to significant improvements in translation quality. We describe further experiments on incorporating parallel treebank information into PBSMT, such as word alignments. We investigate the conditions under which the incorporation of parallel treebank data performs optimally. Finally, we discuss the potential of parallel treebanks in other paradigms of MT.
Satellite Orbit Determination Based on Stahel-Donoho Kernel Estimator
Authors: Xiaogang Pan, Haiyin Zhou
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Dynamic model error and observation model error was the main factor to badly pollute the precision of orbit determination, especially in space based observation. Model error compensation technology was researched by designing semi-parametric orbit determination regression model. Stahel-Donoho Kernel estimator was applied to solve the semi-parametric model, which can effectively estimate the model error and restrain the gross error. Simulation Experiments was processed under space based surveillance system, and results proved that the Stahel-Donoho Kernel estimator can improve the precision of orbit determination largely.
Service Selection via Extreme Geotagging
Authors: Vlad Tanasescu, Dumitru Roman, John Bruno Domingue
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Location of services plays an important role in the process of service selection. Geotagging emerged as a technique for attaching location information to Web elements, including Web services. In this context, this paper proposes a Web service selection framework based on geotagging. First, we introduce tagging and geotagging as an operation that emphasizes processes and the dynamic aspects of the environment. Then, we propose a conceptual model that defines a set of relations between tags. Furthermore, we develop a service selection technique based on this model and give an example of service selection. An overview of a system that implements geotagging-based service selection is presented at the end.