ppxscal/embedding_network huggingface dataset:
The pothole patrol: using a mobile sensor network for road surface monitoring
Authors: Jakob Eriksson, Lewis Girod, Bret Hull, Ryan Newton, Samuel Madden, Hari Balakrishnan
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

This paper investigates an application of mobile sensing: detecting and reporting the surface conditions of roads. We describe a system and associated algorithms to monitor this important civil infrastructure using a collection of sensor-equipped vehicles. This system, which we call the Pothole Patrol (P2), uses the inherent mobility of the participating vehicles, opportunistically gathering data from vibration and GPS sensors, and processing the data to assess road surface conditions. We have deployed P2 on 7 taxis running in the Boston area. Using a simple machine-learning approach, we show that we are able to identify potholes and other severe road surface anomalies from accelerometer data. Via careful selection of training data and signal features, we have been able to build a detector that misidentifies good road segments as having potholes less than 0.2% of the time. We evaluate our system on data from thousands of kilometers of taxi drives, and show that it can successfully detect a number of real potholes in and around the Boston area. After clustering to further reduce spurious detections, manual inspection of reported potholes shows that over 90% contain road anomalies in need of repair.
Application Based Meta Tagging of Network Connections
Authors: Mark Wallis, Frans Henskens, Michael Hannaford
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Modern operating systems offer a large array of features in their network subsystems that support fine-grained access control, monitoring and accounting. Such features allow a system administrator to account and filter outgoing network connections based on attributes such as the destination IP address and port number of the connection. With the increase in multi-user systems such as Grid Networks and Shared Web Hosting, the complexity of these tasks has increased. Current operating systems lack the ability to determine the intent of a network connection based on the connection's technical characteristics alone. This paper presents a new mechanism by which applications themselves are given the ability to pass meta information to the network subsystem, allowing it to take advantage of application specific data.
Proceedings of the 6th international workshop on Software quality
Venue: International Conference on Software Engineering (2008)

It is our great pleasure to welcome you to the <i>6th Workshop on Software Quality -- WoSQ08</i>. As with previous workshops, the workshop is intended for researchers in the area of software quality and aims to encourage discussion on their research progress and to explore future directions. The goals of the working session are to exchange experience, to discover areas of mutual collaboration and to envision future trends in the field of software quality. To achieve this, the workshop aims to bring together academic, industrial and commercial communities interested in software quality topics to discuss the different technologies being defined and used in the software quality area. The workshop had 10 papers accepted for presentation and discussion. We are pleased to have gathered a truly international community with papers from Austria, Australia, Canada, Germany, Japan, Pakistan, United Kingdom and the United States. All papers had two reviews.
Independence trees and Hamilton cycles
Authors: Hajo Broersma, Hilde Tuinstra
Venue: Journal of Graph Theory (1998)

Let G be a connected graph on n vertices. A spanning tree T of G is called an independence tree, if the set of end vertices of T (vertices with degree one in T) is an independent set in G. If G has an independence tree, then &alpha; t(G) denotes the maximum number of end vertices of an independence tree of G. We show that determining &alpha;t of a graph is an NP-hard problem. We give the following analogue of a well-known result due to Chv&aacute;tal and Erd&ouml;s. If &alpha;t(G) &le; &kappa;(G) - 1, then G is hamiltonian. We show that the condition is sharp. An I&le;k-tree of G is an independence tree of G with at most k end vertices or a Hamilton cycle of G. We prove the following two generalizations of a theorem of Ore. If G has an independence tree T with k end vertices such that two end vertices of T have degree sum at least n - k + 2 in G, then G has an I&le;k-1-tree. If the degree sum of each pair of nonadjacent vertices of G is at least n - k + 1, then G has an I&le;k-tree. Finally, we prove the following analogue of a closure theorem due to Bondy and Chv&aacute;tal. If the degree sum of two nonadjacent vertices u and v of G is at least n - 1, then G has an I&le;k-tree if and only if G + uv has an I&le;k-tree (k &ge; 2). The last three results are all best possible with respect to the degree sum conditions. &copy; 1998 John Wiley Sons, Inc. J Graph Theory 29: 227237, 1998
Shear horizontal surface acoustic wave resonators for ammonia detection
Authors: Chi-Yen Shen, Cheng-Liang Hsu, Jin-Shing Jeng
Venue: Proceedings of the 9th International Conference on Circuits (2005)

This Shear horizontal surface acoustic wave (SH-SAW) devices coated with L-glutamic acid hydrochloride have been fabricated and used as ammonia sensors in this work. The humidity effect on the ammonia sensors was also studied. The sensitivity of the ammonia sensor was 4.6 ppm/ppm and the frequency shift was negative at 50°C in dry air. As the humidity rose in the environment, the sensor exhibited a positively increasing frequency shift. It proved that the humidity in the environment interfered with the detection to ammonia. This work would focus on estimating the cross-sensitivity of the humidity interference.
An innovative user interface concept for large hierarchical data spaces by example of the EPDM domain
Authors: Fredrik Gundelsweiler, Robert Konstanzer, Harald Reiterer
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

In this paper we will describe a new approach to navigation and interaction with the visualization of a data space of an electronic product data management (EPDM) system. The main problems are the amount of data and therefore the location of an item of interest, show specific relations and narrow or expand the information space. We combine a scalable visualization of the hierarchical data space with search and filter techniques like dynamic queries and direct manipulation to solve the stated problems. We assume that the proposed concept for EPDM can be adapted to data spaces like social networks or company structures.
Knowledge reuse for software reuse
Authors: Frank McCarey, Mel Ó Cinnéide, Nicholas Kushmerick
Venue: Web Intelligence and Agent Systems (2008)

Software reuse can provide significant improvements in software productivity and quality whilst reducing development costs. Expressing software reuse intentions can be difficult though. A developer may aspire to reuse a software component but experience difficulty expressing their reuse intentions in a manner that is compatible with, or understood by, the component retrieval system. Various intelligent retrieval techniques have been developed that assist a developer in locating or discovering components in an efficient manner. These solutions share a common shortcoming: the developer must be capable of anticipating all reuse opportunities and initiating the retrieval process. There is a need for a comprehensive technique that not only assists with retrievals but that can also identify reuse opportunities. This paper advocates that component-based reuse can be supported through knowledge collaboration. Often programming tasks and solutions are replicated; this characteristic of software can be exploited for the benefit of future developments. Through the mining of existing source code solutions, knowledge, relating to how components are used by developers, can be extracted. Based on a developer's current programming task, this knowledge can subsequently be filtered and used to recommend a candidate set of reusable components. This novel recommendation approach applies and extends commonly used Information Retrieval and Information Filtering techniques such as Collaborative Filtering, Content-Based Filtering, and Bayesian Clustering Models, to the software reuse domain. This recommendation technology is applied to several thousand open-source Java classes. The most effective recommendation algorithm produces recommendations of a high quality at a low cost.
VoxNet: An Interactive, Rapidly-Deployable Acoustic Monitoring Platform
Authors: Michael Allen, Lewis Girod, Ryan Newton, Samuel Madden, Daniel T. Blumstein, Deborah Estrin
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Distributed acoustic sensing underlies an increasingly important class of sensor network applications, from habitat monitoring and bio acoustic census to security applications and virtual fences. VoxNet is a complete hardware and software platform for distributed acoustic monitoring applications that focuses on three key goals:(1) rapid deployment in realistic environments;(2) a high level programming language that abstracts the user from platform and network details and compiles into a high performance distributed application; and(3) an interactive usage model based on run-time installable programs, with the ability to run the same high level program seamlessly over live or stored data. The VoxNet hardware is self-contained and weather-resistant, and supports a four-channel microphone array with automated time synchronization, localization, and network coordination. Using VoxNet, an investigator can visualize phenomena in real-time, develop and tune on-line analysis, and record raw data for off-line analysis and archival. This paper describes both the hardware and software elements of the platform, as well as the architecture required to support distributed programs running over a heterogeneous network.We characterize the performance of the platform, using both microbenchmarks that evaluate specific aspects of the platform and a real application running in the field.
An image coding/decoding method based on direct and inverse fuzzy transforms
Authors: Ferdinando Di Martino, Vincenzo Loia, Irina Perfilieva, Salvatore Sessa
Venue: International Journal of Approximate Reasoning (2008)

With some modifications, we adopt the coding/decoding method of image processing based on the direct and inverse fuzzy transforms defined in previous papers. By normalizing the values of its pixels, any image can be considered as a fuzzy matrix (relation) which is subdivided in submatrices (possibly square) called blocks. Each block is compressed with the formula of the discrete fuzzy transform of a function in two variables and successively it is decompressed via the related inverse fuzzy transform. The decompressed blocks are recomposed for the reconstruction of the image, whose quality is evaluated by calculating the PSNR (Peak Signal to Noise Ratio) with respect to the original image. A comparison with the coding/decoding method of image processing based on the fuzzy relation equations with the Lukasiewicz triangular norm and the DCT method are also presented. By using the same compression rate in the three methods, the results show that the PSNR obtained with the usage of direct and inverse fuzzy transforms is higher than the PSNR determined either with fuzzy relation equations method or in the DCT one and it is close to the PSNR determined in JPEG method for small values of the compression rate.
Navigating virtual agents in online virtual worlds
Authors: Russell Gayle, Dinesh Manocha
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

We present an approach for navigating autonomous virtual agents in online virtual worlds that are based on a centralized server network topology. Each agent's motion is controlled through local and global navigation. Our local navigation model is based on artificial social forces that has been extended to account for inaccurate sensing from network latency. Global navigation for each virtual agent is based on cell decomposition and computes high level paths. The overall computation is balanced by performing local navigation on client machines and global navigation on the server. We have implemented our navigation algorithm into the Second Life virtual world and highlight our results by simulating up to 18 virtual agents over multiple different client computers.
A directional propagation model for locating mobile stations within a mobile phone network
Authors: Kenneth M. K. Chu, Karl R. P. H. Leung, Joseph Kee-Yin Ng, Chun Hung Li
Venue: International Journal of Wireless and Mobile Computing (2008)

Mobile location estimation is becoming a high value added service on cellular phone networks. Among different mobile location estimation methods, the one which estimates the location of Mobile Stations (MSs) with reference to an intrinsics of wireless communication, signal strengths, is able to be applied to different kinds of cellular network, and hence is more general. This approach makes use of a wave propagation model to perform location estimation. Most wave propagation models are non-directional. However, we found out that in estimating mobile location with reference to signal strength, the azimuth gain of directional antenna and environmental factors can help to improve the accuracy. In this paper, we report our study of a Directional Propagation Model (DPM) which enhanced the traditional propagation model with these factors. We experimented our model with 192,177 sets of real life data covering most parts of Hong Kong collected from a major mobile hone operator of Hong Kong. Results show that the DPM models have significant improvement over other existing location methods in terms of accuracy and stability.
Monitoring in adaptive systems using reflection
Authors: Dylan Dawson, Ron Desmarais, Holger M. Kienle, Hausi A. Müller
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

Continuous evolution is a key trait of software-intensive systems. Many research projects investigate mechanisms to adapt software systems effectively in order to ease evolution. By observing its internal state and surrounding context continuously using feedback loops, an adaptive system is able to analyze its effectiveness by evaluating quality criteria and then self-tune to improve its operations. The goals of these feedback loops range from keeping single variables in a prescribed range to satisfying non-functional requirements by regulating decentralized, interdependent subsystems. To be able to observe and possibly orchestrate continuous evolution of software systems in a complex and changing environment, we need to push monitoring of evolving systems to unprecedented levels. It has been established that security has to be built into a system from the ground up and cannot be added as an afterthought - the same is probably true for intensive monitoring. We propose to monitor adaptive systems with autonomic elements to enhance their assessment capabilities. In this paper, we discuss how to build monitoring into Java programs from the ground up with reflection technology to detect normal and exceptional system behavior.
Frame packing algorithms for automotive applications
Authors: Rishi Saket, Nicolas Navet
Venue: Journal of Embedded Computing (2006)

The set of frames exchanged in automotive applications must meet two constraints: it has to be feasible from a schedulability point of view and it should minimize the network bandwidth consumption. This latter point is important since it allows the use of low cost electronic components and it facilitates an incremental design process. The purpose of this study is to propose efficient algorithms for solving the NP-hard problem of generating a set of schedulable frames that minimize the bandwidth usage. This study presents novel algorithms for building bandwidth-minimizing sets of frames that meet the schedulability requirement. In our experiments, these proposals have proved to be more effective than the existing approaches.
OntoCBR: Ontology-Based CBR in Context-Aware Applications
Authors: Yun Bai, Juan Yang, Yuhui Qiu
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Current context-aware applications are widely using ontology to describe context. However, most rules of the ontology-based reasoning in them are pre-defined or user-defined. They are short of flexibility to cope with the variant requirements. This paper proposes a ontology-based case-based reasoning model named OntoCBR. OntoCBR compares the similarity between contexts. We also provide the way to get the similarity of the ontology-based contexts.
Controls on the degree of fluvial incision of continental shelves
Authors: Sergio Fagherazzi, Alan D. Howard, Alan Wm. Niedoroda, Patricia L. Wiberg
Venue: Computers Geosciences (2008)

During sea-level low stands continental shelves were dissected by a network of channels somewhat resembling today's coastal plain streams. The network was subsequently buried or erased by marine processes during sea-level transgression, so that only some tracts are still conserved in the geological record. Herein we use a numerical model to study the effect of base level change by sea-level fall on the total channel incision. We find that four factors control the total incision on the shelf: (i) the presence of convex deposits; (ii) the evolution of the rivers towards equilibrium (graded) conditions; (iii) geometrical differences between coastal plain and shelf; and (iv) the exposure of the continental slope. The conceptual model is then applied to the Adriatic Sea, Italy. Simulations show that incisions in the Adriatic shelf develop in high stand fluvial deposits in the early stages of sea-level fall. At lower sea level, fluvial incision occurs in the mid-Adriatic due to the regrading of the Po River after the capture of the Apennine streams in its drainage system.
Design for video acquisition system based on DaVinci technology
Authors: Zhao Zhengjie, Zhang Jilong
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

There are many schemes to be selected to design the video transmission system, such as ASIC chip and System Integration. With the development of audio and video technology, there are some ways to update the system. The portfolio of DaVinci processors leverage TI's newest TMS320C64x+ DSP core and consists of scalable, programmable Digital Signal Processing SoCs, accelerators and peripherals that are optimized to match the price, performance and feature requirements for a broad spectrum of digital video end equipments. In the paper a novel video transfer system is designed with high reliability, good co-operation and compatibility, higher function and wide application.
A goal-oriented development tool to automate the incorporation of intelligent agents into interactive digital media applications
Authors: Han Yu, Zhiqi Shen, Chunyan Miao
Venue: Computers in Entertainment (CIE) (2008)

Recent developments in games and interactive storytelling applications have seen artificially intelligent computer controlled characters being included extensively. Non-human controlled characters are starting to play an increasingly significant role in enhancing the perceived intelligence of games. Although many of them employed certain cheating techniques (e.g. allocating more resources at the start to AI opponents to make them appear more aggressive), some limited learning did appear in several games (e.g. letting AI opponents remember where human users initiated attacked in previous game). In our Virtual Singapura research project, we incorporate software agents into our virtual world to provide more complex user interactions. With intelligent software agents being infused into interactive digital media applications, there is great potential in improving the overall user experience. However, during the process of our research, we discovered that the traditional way of adding a multi-agent system into a computer game requires a large amount of investment in time and resources and a high level of expertise in Agent Oriented Software Engineering (AOSE). Moreover, game AI is usually closely coupled with other parts of the game code which makes it hard to reuse or replace. This research proposes a multi-agent development and runtime framework which not only provides ease-of-use agent design and implementation tools but also can be easily plugged into various interactive digital media applications.
ISO 14649-based nonlinear process planning implementation for complex machining
Authors: Dae-Hyuk Chung, Suk-Hwan Suh
Venue: Computer-Aided Design (2008)

Increasing attention is being paid to complete machining, i.e., machining of the whole part in a single machine tool, in the metal working industry. For this purpose, complex machine tools equipped with machining components, such as multiple spindles and turrets have been developed by leading machine tool builders. The efficiency of complex machine tools is largely dependent on how the machining components are utilized. The main thrust of this paper is twofold: (1) Proposition of a nonlinear process planning based on the STEP-NC (STEP-compliant data interface for numerical controls) paradigm whose data model is formalized as ISO 14649, and (2) Development of an optimal solution algorithm for process planning for complex machining. The developed algorithm is based on the branch-and-bound approach and heuristics derived from engineering insights. The developed process planning method and optimization algorithm were implemented and tested via the TurnSTEP system developed by our research team. Through the experiments, we are convinced that the new process planning and algorithm can be used as a fundamental means for implementing the third type of STEP-NC [Suh S. TurnSTEP: Tools to create CNC turning programs. In: White paper presented on STEP Implementers' Forum ISO TC184/SC4 Meeting. 2004], i.e., an Intelligent and Autonomous STEP-NC system for the CAD-CAM-CNC chain supporting e-Manufacturing.
Improving HTML Compression
Authors: Przemyslaw Skibinski
Venue: Proceedings of the Data Compression Conference (2008)

In this work, we describe a lossless HTML transform which, combined with generally used LZ77 and PPM compression algorithms, allows to attain high compression ratios. Its core is a fully reversible transform featuring substitution of words in an HTML document using a static dictionary or a semi-static dictionary, effective encoding of dictionary indices and numbers.The test results show the proposed transform to improve the HTML compression efficiency of general purpose compressors on average by 17% in case of Deflate and 8% in case of PPMVC.
Microwulf: a beowulf cluster for every desk
Authors: Joel C. Adams, Tim H. Brom
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

A Beowulf cluster is a distributed memory multiprocessor built from commodity off-the-shelf PC hardware, an inexpensive network for inter-process communication, and open-source software. Today's multi-core CPUs make it possible to build a Beowulf cluster that is powerful, small, and inexpensive. This paper describes Microwulf, a Beowulf cluster that cost just $2470 to build, but provides 26.25 Gflops of measured performance. (For comparison: a 1996 Cray T3D MC256-8/464 provided 25.3 Gflops.) This makes Microwulf the first Beowulf with a price/performance ratio below $100/Gflop (for double-precision operations). The system measures just 11" x 12" x 17" (27.9 cm x 30.5 cm x 43.2 cm), runs at room temperature, and plugs into a standard wall outlet. These desirable characteristics combine to make Microwulf an attractive design for most computer science departments and/or individuals.