ppxscal/embedding_network huggingface dataset:
XORs in the air: practical wireless network coding
Authors: Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, Jon Crowcroft
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper proposes COPE, a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that intelligently mixing packets increases network throughput. Our design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing the integration of network coding in the current network stack. We evaluate our design on a 20-node wireless network, and discuss the results of the first testbed deployment of wireless network coding. The results show that using COPE at the forwarding layer, without modifying routing and higher layers, increases network throughput. The gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.
Every minor-closed property of sparse graphs is testable
Authors: Itai Benjamini, Oded Schramm, Asaf Shapira
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Testing a property P of graphs in the bounded degree model deals with the following problem: given a graph G of bounded degree d we should distinguish (with probability 0.9, say) between the case that G satisfies P and the case that one should add/remove at least ε d n edges of G to make it satisfy P. In sharp contrast to property testing of dense graphs, which is relatively well understood, very few properties are known to be testable in bounded degree graphs with a constant number of queries. In this paper we identify for the first time a large (and natural) family of properties that can be efficiently tested in bounded degree graphs, by showing that every minor-closed graph property can be tested with a constant number of queries. As a special case, we infer that many well studied graph properties, like being planar, outer-planar, series-parallel, bounded genus, bounded tree-width and several others, are testable with a constant number of queries. None of these properties was previously known to be testable even with o(n) queries. The proof combines results from the theory of graph minors with results on convergent sequences of sparse graphs, which rely on martingale arguments.
Classification of Spanish vowels and digits using neural networks
Authors: Jose Brito, Wladimir Rodriguez
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper we describe the use of Multilayer Perceptron Array for learning and classifying speech signals, using characteristic vectors of reconstructed dynamics. First, we consider the phonatory system as a black box, where the only available data is its output: the speech signal. This is a way of accessing underlying dynamics, and is the starting point for two kinds of experiments: classification of vowels and digits, with Venezuelan Spanish voices. Results verify positively that characteristics vectors extracted from underlying dynamics hold discriminative power for distinguishing between classes of speech signals. Besides, neural networks are able to generalize using this kind of data.
ERP Usage in Banking: An Exploratory Survey of the World's Largest Banks
Authors: Carolin Fuβ, Ralf Gmeiner, Dirk Schiereck, Susanne Strahringer
Venue: Information Systems Management (2007)

As banking is currently considered a non-typical area for ERP usage, the authors conducted a survey on anticipated benefits, potential disadvantages and implementation success associated with ERP adoption in banking. The results indicate that, despite a predominant usage of ERP systems in back-office areas, banks see ERP systems as a long-term strategic investment to support organizational effectiveness.
Design of MEMS and microsystems: models and simulation
Authors: M. Husak, J. Jakovenko, P. Kulha, A. Boura
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Various model systems are utilized in the process of design of integrated circuits, microsystems, microactuators, and microsensors. The models have their hierarchical levels that are mutually connected. The connection creates so-called "flow of models" system. It defines a system of simulation approaches to design of microsystems and microsensors. Models on different hierarchical levels and their mutual relations are discussed. Examples of utilization of equivalent models between different energy domains are presented. Analytical mathematical methods, numeric methods, or their hybrid combinations can be used for solution. Mutual interconnection represents design "flow". However, the "flow" solutions are not universal. For educational purposes, certain steps of the design (models) may be verified by realization of these models (subpart of the design). The principles are illustrated by the examples of design of an integrated strain gauge sensor and a wireless sensor system for pressure measurement. Presented examples are completed with reached results.
A scalable authentication model based on public keys
Authors: Hongjun Liu, Ping Luo, Daoshun Wang
Venue: Journal of Network and Computer Applications (2008)

To solve the scalability problems of the identity authentication model based on CA for application in large distributed networks, adopting a rigorous binary tree code algorithm, we present a distributed identity authentication model based on public keys. The advantages of our model are described as follows: First, it has good scalability and is suitable for large-scale distributed networks. Second, the authentication path is short, with no more than two entities intervening. Third, it does not require users to inquire about certificate revocation lists.
Hardware Objects for Java
Authors: Martin Schoeberl, Christian Thalinger, Stephan Korsholm, Anders P. Ravn
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Java, as a safe and platform independent language, avoids access to low-level I/O devices or direct memory access. In standard Java, low-level I/O is not a concern; it is handled by the operating system. However, in the embedded domain resources are scarce and a Java virtual machine (JVM) without an underlying middleware is an attractive architecture. When running the JVM on bare metal, we need access to I/O devices from Java; therefore we investigate a safe and efficient mechanism to represent I/O devices as first class Java objects, where device registers are represented by object fields. Access to those registers is safe as Java's type system regulates it. The access is also fast as it is directly performed by the bytecodesgetfield and putfield. Hardware objects thus provide an object-oriented abstraction of low-level hardware devices. As a proof of concept, we have implemented hardware objects in three quite different JVMs: in the Java processor JOP, the JIT compiler CACAO, and in the interpreting embedded JVM SimpleRTJ.
A SysML profile for mechatronics integrating bond graphs
Authors: Skander Turki, Thierry Soriano Lismma, Adel Sghaier
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper we present a SysML [1] profile for mechatronic-systems design. It is an extension to the activity diagram of UML 2.0 so that it maps to the Bond Graph formalism which is a useful tool when dealing with mechatronic systems. This extension is a package that contains a set of stereotypes and tagged values which are the extension mechanisms that SysML inherits from UML2.0 [3]. We establish mapping between bond graph elements and these extensions. We illustrate this SysML profile by an example.
Dvd information – volume 13 (issue 13/3)
Venue: Organised Sound (2008)

Organised Sound publishes a DVD annually in its issue 3. As of the current issue, 13/2, Cambridge University Press is publishing all media examples online when the issue comes out. Furthermore, all media examples in volumes 1/1 to 13/1 will be appearing in the near future on the Cambridge Journals Online site. The following media examples are mentioned in this ‘Global/Local’ issue. They can therefore be found online and will also appear on the 13/3 DVD.
TIMELINESTag clouds and the case for vernacular visualization
Authors: Fernanda B. Viégas, Martin Wattenberg
Venue: interactions (2008)

Most HCI history articles trace digital developments back to the 1980s, 1960s, or earlier. Information visualization is moving so rapidly that it's great to have a look back and glance forward on tag clouds, just over a decade old in digital form, from leading visualization researchers Fernanda Vi&eacute;gas and Martin Wattenberg. ---Jonathan Grudin
Designing games with a purpose
Authors: Luis von Ahn, Laura Dabbish
Venue: Communications of the ACM (2008)

Data generated as a side effect of game play also solves computational problems and trains AI algorithms.
User defined structural searches in mediawiki
Authors: Johannes Albertsen, Niels Olof Bouvin
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

Wikipedia has been the poster child of user contributed content using the space of MediaWiki as the canvas on which to write. While well suited for authoring simple hypermedia documents, MediaWiki does not lend itself easily to let the author create dynamically assembled documents, or create pages that monitor other pages. While it is possible to create such "special" pages, it requires PHP coding and thus administrative rights to the MediaWiki server. We present in this paper work on a structural query language (MediaWiki Query Language - MWQL) to allow users to add dynamically evaluated searches to ordinary wiki-pages.
Conditional edge-fault-tolerant Hamiltonian cycle embedding of star graphs
Authors: Sun-Yuan Hsieh, Chang-De Wu, Chao-Wen Huang
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

The star graph has been recognized as an attractive alternative to the hypercube. In this paper, we investigate the hamiltoncity of a n-dimensional star graph. We show that for any n-dimensional star graph (n &#x2265; 4) with at most 3n &#x2212; 10 faulty edges in which each node is incident to at least two fault-free edges, there exists a fault-free Hamiltonian cycle. Our result improves the previously best known result where the number of tolerable faulty edges is bounded by 2n &#x2212; 7. We also demonstrate that our result is optimal with respect to the worst case scenario where every other node of a six-length cycle is incident to exactly n &#x2212; 3 faulty non-cycle edges.
The power of combining the techniques of algebraic and numerical computing: improved approximate multipoint polynomial evaluation and improved multipole algorithms
Authors: V. Y. Pan
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors demonstrate the power of combining the techniques of algebraic computation with ones of numerical computation. They do this by improving the known methods for polynomial evaluation on a set of real points and for simulation of n charged particles on the plane. In both cases they approximate (rather than exactly compute) the solutions and do this by exploiting algebraic techniques of the algorithm design.
Triangulating a simple polygon in linear time
Authors: B. Chazelle
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A linear-time deterministic algorithm for triangulating a simple polygon is developed. The algorithm is elementary in that it does not require the use of any complicated data structures; in particular, it does not need dynamic search trees, finger trees, or fancy point location structures.
Biological Sensor System Design for Gymnasium Indoor Air Protection
Authors: Hui Xie, Fei Ma, Huifang Fan, Baoyu Shen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Increasing attention is being directed to the vulnerability of public buildings, and national defense facilities to terrorist attack or the accidental release of biological pathogens. Many biological sensors have been developed for protecting the indoor air quality. However, there is lack of fundamental system-level research on developing sensor networks for indoor air protection. The optimal design of a sensor system is affected by sensor parameters, such as sensitivity,probability of correct detection, false positive rate, and response time. This study applies CONTAM in the sensor system design. Common building biological attack scenarios are simulated for a gymnasium. Genetic algorithm (GA) is then applied to optimize thesensor sensitivity, location, and quantity, thus achieving the best system behavior and reducing the total system cost. Assuming that each attack scenario has the same probability for occurrence, optimal system designs that account for the simulated possible attack scenarios are obtained.
Hyper-spectral features applied to colour shade grading tile classification
Authors: Juan Rosell, Gabriela Andreu, Alberto Pérez
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

In this paper, hyper-spectral images are employed for colour shade grading tile classification. Our goal is to design a machine vision system that can estimate the sufficient similarity of tiles, or same appearance to the human eye. We use spectral representations of colour, and spectral features to distinguish tiles of the same class but with subtle differences in their colour shade grading. A laboratory system for colour shade grading measurements is built and a method for calibrating such a system is introduced. Experiments with three classes of tiles are presented and discussed.
Optimal technology selection for minimizing energy and variability in low voltage applications
Authors: Mingoo Seok, Dennis Sylvester, David Blaauw
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Ultra Low voltage operation has recently drawn significant attention due to its large potential energy savings. However, typical design practices used for super-threshold operation are not necessarily compatible with the low voltage regime. Here, radically different guidelines may be needed since existing process technologies have been optimized for super-threshold operation. We therefore study the selection of the optimal technology in ultra low voltage designs to achieve minimum energy and minimum variability which are among foremost concerns. We investigate five industrial technologies, from 250nm to 65nm. We demonstrate that mature technologies are often the best choice in very low voltage applications, saving as much as ~1800X in total energy consumption compared to a poorly selected technology. In parallel, the effect of technology choice on variability is investigated, when operating at the energy optimal design point. The results show up to a 4X improvement in delay variation due to global process shift and mismatch when using the most advanced technologies despite their large variability at nominal Vdd.
Scheduling impatient jobs in a clearing system with insights on patient triage in mass casualty incidents
Authors: Nilay tanik Argon, Serhan Ziya, Rhonda Righter
Venue: Probability in the Engineering and Informational Sciences (2008)

Motivated by the patient triage problem in emergency response, we consider a single-server clearing system in which jobs might abandon the system if they are not taken into service within their “lifetime.” In this system, jobs are characterized by their lifetime and service time distributions. Our objective is to dynamically determine the optimal or near-optimal order of service for jobs so as to minimize the total number of abandonments. We first show that if the jobs can be ordered in such a way that the job with the shortest lifetime (in the sense of hazard rate ordering) also has the shortest service time (in the sense of likelihood ratio ordering), then the optimal policy gives the highest priority to this “time-critical” job independently of the system state. For the case in which the jobs with shorter lifetimes have longer service times, we observed that the optimal policy generally has a complex structure that might depend on the type and number of jobs available. For this case, we provide partial characterizations of the optimal policy and obtain sufficient conditions under which a state-independent policy is optimal. Furthermore, we develop two state-dependent heuristic policies, and by means of a numerical study, we show that these heuristics perform well, especially when jobs abandon the system at a relatively faster rate when compared to service rates. Based on our analytical and numerical results, we develop several insights on patient triage in the immediate aftermath of a mass casualty event. For example, we conclude that in a worst-case scenario, where medical resources are overwhelmed with a large number of casualties who need immediate attention, it is crucial to implement state-dependent policies such as the heuristic policies proposed in this article.
Generation of mosaiced digital true orthophotographs from multispectral and lidar data
Authors: N. Balic, H. Weinacker, B. Koch
Venue: International Journal of Remote Sensing (2007)

A software program has been developed to generate true orthophotographs using multispectral and lidar data. To accomplish this, the obscured points were first identified in the acquired conventional orthophotographs. Next, the obscured points were replaced with corresponding unobscured points from the neighbouring orthophotographs. Finally, the resulting orthophotographs were merged into a mosaic. This paper provides insight into the generation procedure, developed methods and results obtained in the course of the creation of the digital true orthophotograph.
Automated Standard Cell Library Analysis for Improved Defect Modeling
Authors: Jason G. Brown, R. D. (Shawn) Blanton
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Inductive fault analysis techniques examine the physical geometry of a design to identify potential defect sites. Since traditional methodologies for test generation, fault simulation, and diagnosis rely on logic-level models of the circuit under test, the behavior of a circuit node within a standard cell is not easily modeled since it does not always map directly to a logic-level signal. A significant percentage of defects, however, involves these internal nodes and therefore cannot be ignored. Also, due to the potentially complex behavior of feedback bridges, many defects that cause structural feedback are ignored. We propose a methodology to create a mapping between the physical nodes of a standard cell and the logic level. By identifying appropriate fault activation and error propagation conditions for each internal node, accurate fault models can be formulated. We also describe a strategy for modeling feedback bridges that enables the use of traditional test tools.
How Healthcare Professionals "Make Sense" of an Electronic Patient Record Adoption
Authors: Tina Blegind Jensen, Margunn Aanestad
Venue: Information Systems Management (2007)

This article examines how healthcare professionals experience an Electronic Patient Record (EPR) adoption process. Based on a case study from two surgical wards in Danish hospitals, we analyze the healthcare professionals' conceptions of the technology, how it relates to their professional roles, and aspects of the implementation process from a "sensemaking" perspective.
A model for service-oriented communication systems
Authors: Bernd Reuther, Dirk Henrici
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Using innovative protocols at the transport or network layer is difficult today. Even if such protocols become available, most applications are not able to utilize them because usage of TCP/IP is hard coded into the application. Service-oriented communication systems (SOCS) aim to decouple applications from lower level protocols. Therefore, a service-oriented interface between applications and the transport layer is introduced. A broker mediates transport service requests to appropriate configurations of transport service providers. A flexible and protocol independent specification schema for defining service requirements and offers is regarded as a key element for such an interface. The specification schema enables short and simple descriptions as well as detailed and sophisticated descriptions and can thus scale with information available about service providers, network status, as well as application and user requirements.
A Novel Automated Scan Chain Division Method for Shift and Capture Power Reduction in Broadside At-Speed Test
Authors: Ho Fai Ko, Nicola Nicolici
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

To address the excessive power during test, multiple scan divisions can be created such that not all the circuit blocks are active at the same time. While this concept has been successfully employed in the past for addressing shift power, the reported techniques for at-speed capture power reduction rely on modifications in the automatic test pattern generation (ATPG) algorithms. This paper shows how by analyzing the signal dependencies in the circuit’s sequential graph, scan chain divisions can be created automatically, such that power is guaranteed to be reduced during both shift and capture when Broadside test is employed. This is achieved with the existing ATPG flows and without affecting the transition fault coverage or increasing the scan time.
Context-sensitive cut, copy, and paste
Authors: Reid Kerr, Wolfgang Stuerzlinger
Venue: Proceedings of the 2008 C3S2E conference (2008)

Creating and editing source code are tedious and error-prone processes. One important source of errors in editing programs is the failure to correctly adapt a block of copied code to a new context. This occurs because several dependencies to the surrounding code usually need to be adapted for the new context and it is easy to forget one of them. Conversely, this also makes such errors hard to find. This paper presents a new method for identifying some common types of errors in cut, copy and paste operations. The method analyzes the context of the original block of code and tries to match it with the context in the new location. It utilizes a simple, pattern-based model of context, which we found to be well suited to the analysis of relocated blocks of text. Furthermore, we discuss the ability of our technique to detect semantic errors. While semantic errors are relatively difficult to recognize in a static document, our new technique can infer important information from the original context to detect some semantic mismatches. Finally, we present a proof-of-concept implementation and discuss our simple user interface for context-sensitive cut, copy and paste.