ppxscal/embedding_network huggingface dataset:
An Interactive, Source-Centric, Open Testbed for Developing and Profiling Wireless Sensor Systems
Authors: Andrew R. Dalton, Jason O. Hallstrom
Venue: International Journal of Distributed Sensor Networks (2009)

The difficulty of developing wireless sensor systems is widely recognized. Problems associated with testing, debugging, and profiling are key contributing factors. While network simulators have proven useful, they are unable to capture the subtleties of underlying hardware, nor the dynamics of wireless signal propagation and interference; and physical experimentation remains a necessity. To this end, developers increasingly rely on shared deployments exposed for physical experimentation. Sensor network testbeds are under development across the world. We present a complementary testbed architecture that derives its novelty from three characteristics. First, the system is interactive; users can profile source and network level components across a network in real time, as well as inject transient state faults and external network traffic. Second, the system is source-centric; it enables automated source code analysis, instrumentation, and compilation. Finally, the design is open; developers can extend the set of exposed inter faces as appropriate to particular projects without modifying the underlying middleware. We present the testbed design and implementation, a graphical user interface, a shell-based macro programming interface, example scenarios that illustrate their use, and discuss the testbed's application in the research and teaching activities at client institutions.
Reducing energy consumption of multi-channel mobile medical monitoring algorithms
Authors: Eugene Shih, John Guttag
Venue: Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments (2008)

Advances in integrated circuit technologies have enabled engineers to embed computation and communication resources in small form factors. Small wireless sensors have enabled a variety of ambulatory medical detection applications where individuals are instrumented in order to detect events outside a clinical setting. To make such devices suitable for long-term use, small batteries must be used. Thus, reducing overall energy consumption is essential. In these applications, reducing the amount of data sampled or processed can reduce energy consumption. One way to do this is to use a low-cost screening detector that quickly rules out segments of the sampled data that are unlikely to contain an event. Depending on the detection ability and relative power consumption of the screening detector, the combination of the original detector and screening detector can decrease energy consumption dramatically while maintaining low false positives and false negatives. In this paper, we describe a systematic method that uses machine learning to construct a screening detector for multi-feature detection algorithms. We evaluate this technique on real electroencephalography (EEG) data obtained from patients with epileptic seizures. Our results suggest that for most patients our technique can be used to construct a detector that reduces computation time by an average of 80% relative to the original detector. Moreover, we estimate that the average reduction in energy consumption would be 71% overall and 77% during non-seizure periods. This corresponds to a 4x increase in battery lifetime.
Feature extraction using Radon and wavelet transforms with application to face recognition
Authors: Dattatray V. Jadhav, Raghunath S. Holambe
Venue: Neurocomputing (2009)

This paper presents a new pattern recognition framework for face recognition based on the combination of Radon and wavelet transforms, which is invariant to variations in facial expression, and illumination. It is also robust to zero mean white noise. The technique computes Radon projections in different orientations and captures the directional features of face images. Further, the wavelet transform applied on Radon space provides multiresolution features of the facial images. Being the line integral, Radon transform improves the low-frequency components that are useful in face recognition. For classification, the nearest neighbor classifier has been used. Experimental results using FERET, ORL, Yale and YaleB databases show the superiority of the proposed method with some of the existing popular algorithms.
Column enumeration based decomposition techniques for a class of non-convex MINLP problems
Authors: Steffen Rebennack, Josef Kallrath, Panos M. Pardalos
Venue: Journal of Global Optimization (2009)

We propose a decomposition algorithm for a special class of nonconvex mixed integer nonlinear programming problems which have an assignment constraint. If the assignment decisions are decoupled from the remaining constraints of the optimization problem, we propose to use a column enumeration approach. The master problem is a partitioning problem whose objective function coefficients are computed via subproblems. These problems can be linear, mixed integer linear, (non-)convex nonlinear, or mixed integer nonlinear. However, the important property of the subproblems is that we can compute their exact global optimum quickly. The proposed technique will be illustrated solving a cutting problem with optimum nonlinear programming subproblems.
System-level process variability compensation on memory organizations: on the scalability of multi-mode memories
Authors: Concepción Sanz, Manuel Prieto, José Ignacio Gómez, Antonis Papanikolaou, Francky Catthoor
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Process variation and the dynamism of modern applications can degrade the expected performance of a system. Execution time can be severely affected by both factors, resulting in deadline violations and energy consumption overheads. Memory organizations, which account for a large part of the system energy and the time budgets, are especially vulnerable to process variation. Configurable - multimode - memories are a promising technology to deal with these problems, but they also introduce new issues that need to be solved. Essentially, adding configuration capabilities to the memories comes with a cost, both in memory area and control complexity; hence, we need to evaluate what is the minimum amount of re-configurability to satisfy system's constraints. In this paper, we analyze the scalability of configurable memories and highlight the relationship among mode allocation, memory mapping and data allocation.
Efficient Algorithms for Functional Constraints
Authors: Yuanlin Zhang, Roland H. Yap, Chendong Li, Satyanarayana Marisetti
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, e.g. arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for reducing systems involving functional and bi-functional constraints together with other non-functional constraints. It also solves globally any CSP where there exists a variable such that any other variable is reachable from it through a sequence of functional constraints. Our experiments show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.
Shadow agent: a new type of virtual agent
Authors: Philippe Pasquier, Eunjung Han, Kirak Kim, Keechul Jung
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

The shadow agent is a new type of intelligent virtual agent exploiting the metaphor of the shadow as a medium. The core of the shadow agent is a behavioral architecture inspired by the BDI (Belief, Desire and Intention) cognitive agent model. The shadow agent perceives the world through two video cameras and a microphone. Advanced computer graphics techniques are used to locate the user's feet and analyses his/her behavior. The shadow agent is embodied as an animated silhouette projected on the floor using the Everywhere Display system and is endowed with simple sonic behavior. While presented as an interactive installation, this model is thought to be a generic approach that can support many more applications, including: video games, museum guides and digital performance to name a few.
Application maintenance: one shop's experience and organization
Authors: Robert E. Marsh
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Several years of data on software support activity at Dow Corning are analyzed to illustrate the problems of managing this function. Most software changes are small from the user's point of view, but few changes are small from the maintenance point of view. Several organizational models have been tried for the management of support. None is entirely successful.
Agile Tool Market Growing with the Philosophy
Authors: Greg Goth
Venue: IEEE Software (2009)

The market for application-lifecycle-management tools for the agile development model is booming. However, tool vendors and analysts are far too busy jockeying for position to spend too long appreciating the irony of the matter.
SRCP: Simple Remote Control for Perpetual High-Power Sensor Networks
Authors: Navin Sharma, Jeremy Gummeson, David Irwin, Prashant Shenoy
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

Remote management is essential for wireless sensor networks (WSNs) designed to run perpetually using harvested energy. A natural division of function for managing WSNs is to employ both an in-band data plane to sense, store, process, and forward data, and an out-of-band management plane to remotely control each node and its sensors. This paper presents SRCP, a Simple Remote Control Protocol that forms the core of an out-of-band management plane for WSNs. SRCP is motivated by our target environment: a perpetual deployment of high-power, aggressively duty-cycled nodes capable of handling high-bandwidth sensor data from multiple sensors. The protocol runs on low-power always-on control processors using harvested energy, distills an essential set of primitives, and uses them to control a suite of existing management functions on more powerful main nodes. We demonstrate SRCP's utility by presenting a case study that (i) uses it to control a broad spectrum of management functions and (ii) quantifies its efficacy and performance.
Mobile Ontology: Towards a Standardized Semantic Model for the Mobile Domain
Authors: Claudia Villalonga, Martin Strohbach, Niels Snoeck, Michael Sutterer, Mariano Belaunde, Ernö Kovacs, Anna V. Zhdanova, Laurent Walter Goix, Olaf Droegehorn
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Ontologies will be crucial for the future development of Next Generation Service Delivery Platforms. While various projects have defined ontologies for the mobile domain, there is yet little agreement on a common semantic model. One reason is the intrinsically hard problem of finding, using, mapping and evolving already existing ontologies. In this paper we present the Mobile Ontology, an effort within the IST project SPICE to converge towards a standardized ontology. Our approach is based on a minimal core ontology that defines common concepts for sub-ontologies of relevant domains and that is easily extensible towards existing and future ontologies. It is our intention to make this ontology available to other projects and collaboratively work on standardized ontology for the mobile domain.
Pitch Shifting of Music Based on Adaptive Order Estimation of Linear Predictor
Authors: Naoki Koshikawa, Takahiro Murakami, Toshihisa Tanaka
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

A method for timbre-preserving pitch shifting of music signals based on estimating the order in linear predictive coding (LPC) is described. LPC is used for estimating a transfer function approximated using autoregressive (AR) models. We need to determine the appropriate number of poles in the AR model for LPC. For general audio signals, the number of poles varies with time because the number and the kind of sound sources such as musical instruments change dynamically. To estimate the order, we utilize the inequality of arithmetic and geometric means (AM-GM inequality) and fractional bandwidth at each pole of the model. The estimated order can be applied to LPC for the timbre-preserving pitch shifting. A listening test evaluated by the mean opinion score (MOS) shows that our approach improves the sound quality of pitch-shifted signals.
Looking backward and forward
Authors: Bob Violino
Venue: Communications of the ACM (2009)

CRA's Computing Community Consortium hosted a day-long symposium to discuss the important computing advances of the last several decades and how to sustain that track record of innovation.
A practical and efficient code design for distributed source coding using multilevel codes
Authors: Zhu Xuqi, Zhang Lin, Liu Yu
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In order to deal with the changing network status and different service quality requirements, the wireless distributed compression system may adopt distributed source codes with various compression ratios. The multilevel codes (MLCs) can provide flexible encoding rates and inherent unequal error protection (UEP), so a practical distributed source coding (DSC) scheme based on the MLCs is proposed in this paper. The MLC-based DSC code design rule is also discussed. The DSC encoder utilizes linear block code as component code, and the multistage decoding (MSD) decoder implements soft decision decoding on the constructed trellis of linear block codes. Simulation results reveal that MLC-based DSC provides flexible rates and UEP while guaranteeing equivalent performance with the trellis-based one. And the codes taking the design rule into account achieve the best perfomance among the codes which have the same total compression rate.
Statistical path selection for at-speed test
Authors: Vladimir Zolotov, Jinjun Xiong, Hanif Fatemi, Chandu Visweswariah
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Process variations make at-speed testing significantly more difficult. They cause subtle delay changes that are distributed rather than the localized nature of a traditional fault model. Due to parametric variations, different paths can be critical in different parts of the process space, and the union of such paths must be tested to obtain good process space coverage. This paper proposes a novel branch-and-bound algorithm that elegantly and efficiently solves the hitherto open problem of statistical path tracing. The resulting paths are used for at-speed structural testing. A new Test Quality Metric (TQM) is proposed and paths which maximize this metric are selected. After chip timing has been performed, the path selection procedure is extremely efficient. Path selection for a multi-million gate chip design can be completed in a matter of seconds.
Applying DCMI elements to digital images and text in the Archimedes Palimpsest program
Authors: Michael B. Toth, Doug Emery
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

The digitized version of the only extant copy of Archimedes' key mathematical and scientific works contains over 6,500 images and 130 pages of transcriptions. Metadata is essential for managing, integrating and accessing these digital resources in the Web 2.0 environment. The Dublin Core Metadata Element Set meets many of our needs. It offers the needed flexibility and applicability to a variety of data sets containing different texts and images in a dynamic technical environment. The program team has continued to refine its data dictionary and elements based on the Dublin Core standard and feedback from the Dublin Core community since the 2006 Dublin Core Conference. This presentation cites the application and utility of the DCMI Standards during the final phase of this decade-long program. Since the 2006 conference, the amount of data has grown tenfold with new imaging techniques. Use of the DCMI Standards for integration across digital images and transcriptions will allow the hosting and integration of this data set and other cultural works across service providers, libraries and cultural institutions.
Contribution, commercialization & audience: understanding participation in an online creative community
Authors: Eric Cook, Stephanie D. Teasley, Mark S. Ackerman
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

This paper presents a qualitative study of attitudes towards participation and contribution in an online creative community. The setting of the work is an online community of practice focused on the use and development of a user-customizable music software package called Reaktor. Findings from the study highlight four emergent topics in the discourse related to user contributions to the community: contribution assessment, support for learning, perceptions of audience and tensions about commercialization. Our analysis of these topics frames discussion about the value and challenges of attending to amateur and professional users in online creative communities.
Interactive diagnosis of flexible manufacturing systems
Authors: Calin Ciufudean, Constantin Filote, Dumitru Amarandei
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In order to diagnose a flexible manufacturing system (FMS's), we focus on a method for synthesizing deadlock avoidance controllers in discrete event systems (DES's), as we well know that FMS's represent a typical class of DES's. The modelling process of a supervisory policy that enforces liveness is realized with Petri nets, which are an interactive modelling paradigm for a wide class of DES's. Our supervisory policy is based on the next two steps in modelling process: a) A bottom-up approach for the synthesis of a controlled Petri net model for the production flow; b) A liveness condition for the above mentioned model, under the circumstances of underlying the potential peril path (PPP) in the Petri net model by respecting the concept of minimal resource requirements. While the deadlock avoidance controller ensures the liveness of the global Petri net model (GPN) of the FMS, an algorithm for estimating the system throughput is introduced. The utility of our approach in alleviating the computational burden of policy synthesis is illustrated via example.
Note: On the diameter of a domination dot-critical graph
Authors: Nader Jafari Rad
Venue: Discrete Applied Mathematics (2009)

A graph G is domination dot-critical, or just dot-critical, if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. In this paper, we study an open question concerning of the diameter of a domination dot-critical graph G.
Hybrid Genetic Programming for Optimal Approximation of High Order and Sparse Linear Systems
Authors: Jing Liu, Wenlong Fu, Weicai Zhong
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

A Hybrid Genetic Programming (HGP) algorithm is proposed for optimal approximation of high order and sparse linear systems. With the intrinsic property of linear systems in mind, an individual in HGP is designed as an organization that consists of two cells. The nodes of the cells include a function and a terminal. All GP operators are designed based on organizations. In the experiments, three kinds of linear system approximation problems, namely stable, unstable, and high order and sparse linear systems, are used to test the performance of HGP. The experimental results show that HGP obtained a good performance in solving high order and sparse linear systems.
Defining defects, errors, and service degradations
Authors: Gertrude Neuman Levine
Venue: ACM SIGSOFT Software Engineering Notes (2009)

The study of defects is a principal topic of software systems, af-fecting all phases of a system's lifecycle. Defects are the cause of errors and service degradations. Unresolved errors cause failures. If defects cannot be prevented effectively, then error control me-chanisms must be evaluated. We introduce a model to distinguish between defects, errors, and service degradations. A two-dimensional classification scheme is developed for defects, defined by the types of process interaction and software corruption that are involved. A third dimension is added to this taxonomy for defects that cause service degradation, based on the deviations in service quality that are tolerated. We investigate the role of service degradation in error prevention.
Mining high utility patterns in incremental databases
Authors: Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Frequent pattern mining techniques treat all items in the database equally by taking into consideration only the presence of an item within a transaction. However, the customer may purchase more than one of the same item, and the unit price may vary among items. High utility pattern mining approaches have been proposed to overcome this problem. As a result, it becomes a very important research issue in data mining and knowledge discovery. On the other hand, incremental and interactive data mining provides the ability to use previous data structures and mining results in order to reduce unnecessary calculations when the database is updated, or when the minimum threshold is changed. In this paper, we propose a tree structure, called IIUT (incremental and interactive utility tree), to solve these problems together. It uses a pattern growth mining approach to avoid the level-wise candidate set generation-and-test problem, and it can efficiently capture the incremental data without any restructuring operation. Moreover, IIUT has the "build once mine many" property and therefore it is highly suitable for interactive mining. Experimental results show that our tree structure is very efficient and scalable for incremental and interactive high utility pattern mining.
GIUC: A Gesture Interface for Ubiquitous Computing
Authors: Dong Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

This paper presents a vision-based gesture interface called GIUC for ubiquitous computing environments. A camera mounted on top of screen facing the user is used to capture and interpret the movements of hand gestures for intelligent human computer interactions. We propose a tracking and recognition algorithm combining particle filter algorithms and elastic graph matching to recover gesture parameters robustly against complex backgrounds. A two-hierarchical parameter estimation scheme is introduced to improve the tracking speed and accurateness. Experimental results show that the GIUC system works robustly for indoor desktop interaction environments. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player