ppxscal/embedding_network huggingface dataset:
A self-reconfigurable communication network for modular robots
Authors: Ricardo Franco Mendoza Garcia, Kasper Stoy, David Johan Christensen, Andreas Lyder
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

We present a novel hybrid communication system for modular robots, based on inter-module buses that can connect on-demand to form arbitrary network topologies. In addition to describing the implementation of this hybrid communication system, we analyse transfer rates and reliability, validating the results using a Spice simulation and a proof-of-concept experiment performed on a hardware prototype. Thus, we find the system is fast, since it has a potential to provide a maximum transfer rate of 9.9Mbps divided by the maximum bus length measured in meters, with buses as large as 256 modules. The system is also found to be small in size, power saving and reliable. These features, in combination with its flexibility, make hybrid communication suitable for modular robots.
A new algorithm for minimizing convex functions over convex sets
Authors: P. M. Vaidya
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

An algorithm for minimizing a convex function over a convex set is given. The notion of a volumetric center of a polytope and a related ellipsoid of maximum volume inscribable in the polytope is central to the algorithm. The algorithm has a much better rate of global convergence than the ellipsoid algorithm. A by-product of the algorithm is an algorithm for solving linear programming problems that performs a total of O(mn/sup 2/L+M(n)nL) arithmetic operations in the worst case, where m is the number of constraints, n the number of variables, and L a certain parameter. This gives an improvement in the time complexity of linear programming for m>n/sup 2/.
Weighted Datalog and Levels of Trust
Authors: Stefamno Bistarelli, Fabio Martinelli, Francesco Santini
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

We extend the Datalog language (we call it Datalog^W)in order to deal with weights on ground facts and to consequently compute a feedback result for the goal satisfaction. The weights are chosen from a proper c-semiring. As a second step, in order to show the usefulness of the language, we use DatalogW as the basis to give a uniform semantics to declarative RTW (Trust Management) language family, in order to represent trust levels based on c-semirings. In this way it is possible to manage a score corresponding to a preference or cost associated to the revealed credentials, instead of a plain “yes or no” authorization result. Clearly, such a solution is more informative and allows us to treat uncertainty of facts and rules application, or different preferencesfor the entity roles. Trust can be then derived by choosing the best chain. The approach is rather generic and could be applied to other trust management languages.
Towards event source unobservability with minimum network traffic in sensor networks
Authors: Yi Yang, Min Shao, Sencun Zhu, Bhuvan Urgaonkar, Guohong Cao
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Sensors deployed to monitor the surrounding environment report such information as event type, location, and time when a real event of interest is detected. An adversary may identify the real event source through eavesdropping and traffic analysis. Previous work has studied the source location privacy problem under a local adversary model. In this work, we aim to provide a stronger notion: event source unobservability, which promises that a global adversary cannot know whether a real event has ever occurred even if he is capable of collecting and analyzing all the messages in the network at all the time. Clearly, event source unobservability is a desirable and critical security property for event monitoring applications, but unfortunately it is also very difficult and expensive to achieve for resource-constrained sensor network. Our main idea is to introduce carefully chosen dummy traffic to hide the real event sources in combination with mechanisms to drop dummy messages to prevent explosion of network traffic. To achieve the latter, we select some sensors as proxies that proactively filter dummy messages on their way to the base station. Since the problem of optimal proxy placement is NP-hard, we employ local search heuristics. We propose two schemes (i) Proxy-based Filtering Scheme (PFS) and (ii) Tree-based Filtering Scheme (TFS) to accurately locate proxies. Simulation results show that our schemes not only quickly find nearly optimal proxy placement, but also significantly reduce message overhead and improve message delivery ratio. A prototype of our scheme was implemented for TinyOS-based Mica2 motes.
An empirical evaluation of supervised learning in high dimensions
Authors: Rich Caruana, Nikos Karampatziakis, Ainur Yessenalina
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In this paper we perform an empirical evaluation of supervised learning on high-dimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and study the effect of increasing dimensionality on the performance of the learning algorithms. Our findings are consistent with previous studies for problems of relatively low dimension, but suggest that as dimensionality increases the relative performance of the learning algorithms changes. To our surprise, the method that performs consistently well across all dimensions is random forests, followed by neural nets, boosted trees, and SVMs.
Approximation of reachable sets by direct solution methods for optimal control problems
Authors: R. Baier, C. Büskens, I. A. Chahma, M. Gerdts
Venue: Optimization Methods Software (2007)

A numerical method for the approximation of reachable sets of linear control systems is discussed. The method is based on the formulation of suitable optimal control problems with varying objective function, whose discretization by Runge-Kutta methods leads to finite-dimensional convex optimization problems. It turns out that the order of approximation for the reachable set depends on the particular choice of the Runge-Kutta method in combination with the selection strategy used for control approximation. For an inappropriate combination, the expected order of convergence cannot be achieved in general. The method is illustrated by two test examples using different Runge-Kutta methods and selection strategies, in which the run times are analysed, the order of convergence is estimated numerically and compared with theoretical results in similar areas.
Model study of inspiratory fall of blood pressure in airway obstruction
Authors: Younhee Choi, Seok-Bum Ko
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Inspiratory fall of systolic blood pressure (IFSBP) is used as an index to assess the respiratory influences on non-linear dynamics of heart rate variability. In an in-vivo situation it is particularly difficult to isolate individual effects of heart rate, vascular tone, pleural pressure variation, and ventricular interdependence. A computer model of the cardiopulmonary system was adapted to this problem, relating mechanisms such as baroreflex regulation of heart rate in response to respiratory oscillations. The model provided time-course simulations of hemodynamics by numerically integrating 28 nonlinear, time-varying differential equations. Two approaches for baroreflex regulation were tested, including a simple 1st-order relationship between R-R interval (RRI) and SBP and the autoregressive moving average (ARMA) model. Experimental data were obtained retrospectively from 22 patients with chronic airway obstruction before and during breathing through an external resistance. Magnitude and phase relations between arterial pressure and pleural pressure were evaluated. The computer model provided good fits to arterial pressure waveforms: correlation coefficients (r) ranging from 0.71 to 0.96 (mean±SD: 0.87±0.06) with a simple 1st-order RRI-SBP model. It was observed that the ARMA model did not further improve the goodness of fit. However, no dominant parameter was found for phase relations.
Complementary utilities for UML an UP in information systems
Authors: J. F. Zelasco, J. Donayo, G. Merayo
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

This paper does a proposal, looking into certain delicate aspects of Unified Modelling Language (UML) and Unified Process (UP) usage, when applied to information systems. The usage of some tools and heuristics based on the gathered experience origined on the MERISE method evolution, gives place to comparative benefits while conceiving this type of informatic applications. The heuristic and tools used consists of starting from a higher level of abstraction provided with inverse engineering and re-engineering instrumentation methods. The knowledge of a minimal data schema enables a global vision and ensures, by means of certain verifications, reducing the number of modifications done to the initially built subsystems, assuring thus a better data integrity. Finally, the conceptual and organizational levels of treatment allows to evaluate organization solutions by comparison, yielding naturally into a usage manual and an analysis of the different actions taken by the different modules built with the given object's assemblies. This allows both the classical solution as well as the usage manual based one. We included some simplified examples to show the advantages of the proposed method.
A self-organising algorithm for sensor placement in wireless mobile microsensor networks
Authors: TheinLai Wong, Tatsuhiro Tsuchiya, Tohru Kikuno
Venue: International Journal of Wireless and Mobile Computing (2008)

This paper proposes a self-organising algorithm for enhancing the coverage of wireless mobile microsensor networks after an initial random placement of sensors. When the sensors move simultaneously in the neighbourhood, unnecessary excessive movement will be caused and hence sensors'energy will be consumed. A randomised back-off delay time is introduced to resolve this problem. A sensor node will relocate itself when the time calculated through randomised back-off delay computation is reached. The new location of the sensor is determined by a virtual force-directed algorithm where virtual attractive or repulsive forces exerted by other sensors or obstacles are used to guide the sensor to the desired location. The proposed self-organising algorithm for sensor placement is proved to be effective through simulation.
In situ migration of handcrafted ontologies to reason-able forms
Authors: Mikel Egaña Aranguren, Chris Wroe, Carole Goble, Robert Stevens
Venue: Data Knowledge Engineering (2008)

A methodology for in situ migration of a handcrafted Directed Acyclic Graph (DAG), to a formal and expressive OWL version is presented. Well-known untangling methodologies recommend wholesale re-coding. Unable to do this, we have tackled portions of the DAG, lexically dissecting term names to property-based descriptions in OWL. The different levels of expressivity are presented in a model called the ''feature escalator'', where the user can choose the level needed for the application and the expressivity that delivers requirement. The results of applying the methodology to some areas of the gene ontology (GO) demonstrate the validity of the methodology.
Software development tools for multi-core/parallel programming
Authors: Ramesh Peri
Venue: Proceedings of the 6th workshop on Parallel and distributed systems: testing, analysis, and debugging (2008)

The new era of multi-core processors is bringing unprecedented computing power to the mainstream desktop applications. In order to fully exploit this compute power one has to delve into the world of parallel programming which until today has been the exclusive domain of High Performance Computing Community. This talk will focus on the current state of the art in parallel programming tools that is applicable for developers of mainstream parallel applications with emphasis on software development tools like compilers, debuggers, performance analysis tools and correctness checking tools for parallel programs. I will share some of the challenges that developers face today in developing applications for multi-core systems containing a small number of homogeneous cores (2 to 8) and discuss the situation we will face with the advent of systems containing many more heterogeneous cores in next few years.
Reformulating Table Constraints using Functional Dependencies--An Application to Explanation Generation
Authors: Hadrien Cambazard, Barry O'Sullivan
Venue: Constraints (2008)

We present a novel approach to automatically reformulating constraints defined as tables of allowed assignments to variables. Constraints of this form are common in a variety of settings. Specifically, we propose an approach in which a high arity table constraint is reformulated as a conjunction of lower arity constraints. The reformulation is logically equivalent to the original constraint. We demonstrate that by using functional dependencies from the field of database design such reformulations can be found. We apply the approach to the problem of generating explanations as minimal conflicts. We show that reformulations can be found that yield compact explanations of inconsistency by reducing both the number of variables required to explain inconsistency and the arity of the largest constraint involved in the explanation. We demonstrate our approach on real-world datasets with positive results.
Moving from a Web Presence to e-Commerce: The Importance of a Business-Web Strategy for Small-Business Owners
Authors: Julie Fisher, Annemieke Craig, John Bentley
Venue: Electronic Markets (2007)

More than half of small businesses in Australia (57%) use a website to promote their business. Having an effective website is an important step for small business owners moving towards e-commerce. The research suggests that once a business has a clear online strategy through a website they are more likely to move to e-commerce. While many small business owners have a business strategy, it is often the case that this strategy does not include their Web presence. This paper describes the results of interviews with small business owners and assessment of their websites. We identify elements that are important for small business owners developing a business-Web strategy. The research indicates that many owners see their websites as little more than an advertising medium and few are ready for the move to e-commerce. Identifying the level of maturity of a small business owner's business-Web strategy however can help us understand how prepared a small business owner is to move to e-commerce.
Short Note: Analytical and geometrical tools for 3D volume of fluid methods in general grids
Authors: J. López, J. Hernández
Venue: Journal of Computational Physics (2008)

It is well known that volume of fluid (VOF) methods in three-dimensions, especially those based on unsplit advection schemes, involve highly complex geometrical operations. The objective of this work is to propose, for general grids and three-dimensional Cartesian geometry, simple and efficient geometrical tools for volume truncation operations that typically arise in VOF methods and an analytical method for local volume enforcement. The results obtained for different tests and grid types show that the proposed analytical method may be as much as three times faster than Brent's iterative method. Advection tests were carried out using hexahedral grids obtained from deformation of a cubic grid to assess the accuracy of the proposed tools in combination with a recently proposed unsplit PLIC-VOF method.
BlogWall: a new paradigm of artistic public mobile communication
Authors: Adrian David Cheok, Owen Noel Newton Fernando, Imiyage Janaka Prasad Wijesena, Abd-ur-Rehman Mustafa, Anne-Katrin Barthoff, Naoko Tosa
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Short message service (SMS) is extremely popular today. Currently it is being mainly used for peer-to-peer communication. BlogWall extends the SMS to a new level of self-expression and public communication by combining art and poetry. The application can simply display SMS, gather data using polls, and create poetry or even Japanese "Haiku" all based on the SMS.
Hypertextbooks and a Hypertextbook authoring environment
Authors: Rockford J. Ross
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

An ITiCSE 2006 working group explored the prospect of deploying educational visualizations (e.g., algorithm visualizations) in hypertextbooks [10]. In this paper we present our continuing work on a hypertextbook project that demonstrates the viability of many of the issues raised in that workshop. The project has two thrusts: (1) the authoring of hypertextbooks for specific academic subjects, and (2) the creation of an authoring environment for prospective hypertextbook authors. The status of both is discussed in detail. It is anticipated that the success of the project as well as access to the authoring environment will inspire the creation of more active-learning hypertextbooks covering many academic subjects.
Geolocation of man-made reservoirs across terrains of varying complexity using GIS
Authors: David M. Mixon, David A. Kinner, Robert F. Stallard, James P. M. Syvitski
Venue: Computers Geosciences (2008)

The Reservoir Sedimentation Survey Information System (RESIS) is one of the world's most comprehensive databases of reservoir sedimentation rates, comprising nearly 6000 surveys for 1819 reservoirs across the continental United States. Sediment surveys in the database date from 1904 to 1999, though more than 95% of surveys were entered prior to 1980, making RESIS largely a historical database. The use of this database for large-scale studies has been limited by the lack of precise coordinates for the reservoirs. Many of the reservoirs are relatively small structures and do not appear on current USGS topographic maps. Others have been renamed or have only approximate (i.e. township and range) coordinates. This paper presents a method scripted in ESRI's ARC Macro Language (AML) to locate the reservoirs on digital elevation models using information available in RESIS. The script also delineates the contributing watersheds and compiles several hydrologically important parameters for each reservoir. Evaluation of the method indicates that, for watersheds larger than 5km^2, the correct outlet is identified over 80% of the time. The importance of identifying the watershed outlet correctly depends on the application. Our intent is to collect spatial data for watersheds across the continental United States and describe the land use, soils, and topography for each reservoir's watershed. Because of local landscape similarity in these properties, we show that choosing the incorrect watershed does not necessarily mean that the watershed characteristics will be misrepresented. We present a measure termed terrain complexity and examine its relationship to geolocation success rate and its influence on the similarity of nearby watersheds.
On document splitting in passage detection
Authors: Nazli Goharian, Saket S.R. Mengle
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Passages can be hidden within a text to circumvent their disallowed transfer. Such release of compartmentalized information is of concern to all corporate and governmental organization. We explore the methodology to detect such hidden passages within a document. A document is divided into passages using various document splitting techniques, and a text classifier is used to categorize such passages. We present a novel document splitting technique called dynamic windowing, which significantly improves precision, recall and F1 measure.
Motion intention recognition in robot assisted applications
Authors: Daniel Aarno, Danica Kragic
Venue: Robotics and Autonomous Systems (2008)

Acquiring, representing and modelling human skills is one of the key research areas in teleoperation, programming-by-demonstration and human-machine collaborative settings. The problems are challenging mainly because of the lack of a general mathematical model to describe human skills. One of the common approaches is to divide the task that the operator is executing into several subtasks or low-level subsystems in order to provide manageable modelling. In this paper we consider the use of a Layered Hidden Markov Model (LHMM) to model human skills. We evaluate a gesteme classifier that classifies motions into basic action-primitives, or gestemes. The gesteme classifiers are then used in a LHMM to model a teleoperated task. The proposed methodology uses three different HMM models at the gesteme level: one-dimensional HMM, multi-dimensional HMM and multi-dimensional HMM with Fourier transform. The online and off-line classification performance of these three models is evaluated with respect to the number of gestemes, the influence of the number of training samples, the effect of noise and the effect of the number of observation symbols. We also apply the LHMM to data recorded during the execution of a trajectory tracking task in 2D and 3D with a mobile manipulator in order to provide qualitative as well as quantitative results for the proposed approach. The results indicate that the LHMM is suitable for modelling teleoperative trajectory-tracking tasks and that the difference in classification performance between one and multidimensional HMMs for gesteme classification is small. It can also be seen that the LHMM is robust with respect to misclassifications in the underlying gesteme classifiers.
Profile-based configuration of residential networks
Authors: Juan Jesus Sanchez Sanchez, Jose Alberto Vigo Segura, Natividad Martinez Madrid, Ralf Seepold
Venue: International Journal of Internet Protocol Technology (2007)

Until now, smart cards and automation networks have been integrated only for authentication and security purposes. This paper describes a proposal based on the idea of a higher grade of integration between the network and the smart card in such a way that a smart card can be used to configure an entire network. Applications of this approach would support future developments of real intelligent, ambient environments.
Clock Skew Evaluation Considering Manufacturing Variability in Mesh-Style Clock Distribution
Authors: Shinya Abe, Masanori Hashimoto, Takao Onoye
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Influence of manufacturing variability on circuit performance has been increasing because of finer manufacturing process and lowered supply voltage. In this paper, we focus on mesh-style clock distribution which is believed to be effective for reducing clock skew, and we evaluate clock skew considering manufacturing and design variabilities. Considering MOS transistor variation - random and spatially-correlated variation -and non-uniform flip-flop (FF) placement, we demonstrate that spatially-correlated variation and severe non-uniform FF distribution can be major sources of clock skew. We also examine the dependency of clock skew on design parameters, and reveal thatfiner clock mesh does not necessarily reduce clock skew.