ppxscal/embedding_network huggingface dataset:
A schedulable virtual machine for real-time embedded applications
Authors: Yann-Hang Lee
Venue:  (2006)

The application areas of real-time embedded systems range these days from industrial controls to consumer gadgets, communication and medical devices. The systems are equipped with complex application features, a significant amount of software, and net working interconnection despite heterogeneity. The development of these complex software centric real-time embedded applications can benefit from a high level abstraction and programming language model, provided by virtual machine (VM) that features portability, productivity, and safety. In order for VM to be adequate for real-time embedded applications, it has to satisfy the constraints and demands of the application. In this dissertation, we focus on developing software and analysis techniques essential to make VM infrastructure suitable for real-time embedded applications. The goal of our study is to retune VM systems for predictability, reliability, and availability. The dissertation describes an extended VM infrastructure which includes three subsystems. The Schedulable Garbage Collection makes behavior of garbage collection predictable by controlling the pause time due to garbage collection operations. Then, with a joint scheduling algorithm of garbage collection and real-time application tasks, the subsystem can guarantee to meet task deadlines and to make a heap memory available. The Schedulable Persistence System aims to ensure fault-tolerance that is demanded in mission- and safety-critical systems. It demonstrates that a persistence service can be conducted non-intrusively and cost-efficiently with concurrent and preemptible object serialization. In the Schedulable Online Testing Framework, software testing is piggybacked on a running system that operates to serve an actual mission. The framework ensures the timely correctness of the regular service with a flexible scheduling mechanism. By employing a persistence service, the testing operation can be initiated with a consistent system state and run in an isolated partition. Thus, the testing operation, while having a full access to external interference and unexpected behavior of the target application environment, cannot cause unbounded pause time or spoil the regular operation. The subsystems are prototyped on a CLI (Common Language Infrastructure) runtime environment. Execution data is measured and used to analyze performance characteristics and to establish scheduling models. With execution traces and performance analysis, the feasibility of the VM infrastructure is demonstrated.
Intersection-Based Matchmaking for Semantic Web Service Discovery
Authors: Stephan Grimm
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

For Semantic Web Service discovery, matchmaking techniques are used to compare descriptions of semantically annotated services issued by service requesters and providers. Such semantic descriptions are typically expressed in ontology languages to capture the functionality of a service in a meaningful and machine-interpretable way. Among various other techniques proposed in the literature, intersection-based matchmaking rates two service descriptions as compatible if they agree on some concrete instantiation of service parameters. We report on an intersection-based matchmaking framework which we have applied to an industrial logistics case study. We particularly focus on the how-to of designing semantic service descriptions, providing modelling guidelines and patterns, an aspect that is often neglected in matchmaking literature. By an example from our logistics case study that involves sophisticated ontology reasoning, we show how some of the limitations of this matching technique can be overcome by an appropriate modelling.
Gerschgorin radii based source number detection for closely spaced signals
Authors: Jar-Ferr Yang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We first analyze the resolution performance of the Gerschgorin radii based source number detector proposed by Wu, Yang and Chen (see IEEE Trans. SP, vol.43, no.6, p.1325-33, 1995) for independent closely-spaced plane waves. Based upon the analysis, we can easily verify the resolution threshold of the Gerschgorin radii based algorithm. For improvement of the detection performance, we then further propose a weighted Gerschgorin radii algorithm. With closed-form expressions and simulations, we find that the analyzed performance in terms of the number of sensors, the relative angular separation of emitters, and the signal-to-noise ratios can properly characterize their behaviour for source number detection.
Efficient Load Balancing on Irregular Network Topologies Using B+tree Structures
Authors: Ilias K. Savvas, M-Tahar Kechadi
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

In this study, a heterogeneous distributed computing environment (Grid) is employed as a computing platform to perform some computationally intensive tasks. In order to increase the efficiency of the system (utilization and average response time), a dynamic task scheduling algorithm is proposed to balance the load among the nodes of the system. The technique is composed of two main phases. Firstly, the heterogeneous distributed system is embedded onto a structure similar to B+tree and then the algorithm of load-balancing is executed on the virtual structure. The optimum degree of the tree is identified in order to achieve optimal performance. The experimental and simulation results show the benefit of using the technique and additionally they show that it is relatively easy to identify the crossover points (thresholds) for which the system should be load balanced.
Using a GPU to Accelerate Die and Mold Fabrication
Authors: Masatomo Inui, Atsushi Ohta
Venue: IEEE Computer Graphics and Applications (2007)

The authors present a GPU-based method for generating and verifying cutter paths for numerically controlled milling. A CAM system based on this technology is now employed in production at Mazda Motor Corporation for manufacturing stamping dies. This system can compute cutter paths more than 20 times faster than previous methods.
Sequential forward sample selection in array-based image formation
Authors: Yun Gao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

In some types of imaging, the signal is strictly limited in one domain while sampling takes places in another. If sampling is done in a rectangular array pattern at sub-Nyquist density, the array must be dithered to sample the image at the Nyquist density in each dimension. However, the Nyquist density oversamples the image due to the nonrectangular support in the transform domain. We present an efficient forward selection algorithm for optimizing the dithering pattern so that the image can be reconstructed as reliably as possible from a periodic nonuniform set of samples, which can be obtained from a dithered rectangular-grid array. Our examples show that this new algorithm makes selective sampling possible in a real-time image acquisition setting for MR spectroscopic imaging.
Improved voice activity detection based on a smoothed statistical likelihood ratio
Authors: Y. D. Cho
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents the behavioural mechanism of a statistical model-based voice activity detector (VAD), featuring a likelihood ratio test for the activity decision. From investigation of the VAD, it is found that detection errors could occur frequently at speech offset regions because of the delay term in the decision-directed parameter estimator, employed for the estimation of an unknown parameter of the likelihood ratio. Hence, this paper proposes a smoothed likelihood ratio so as to alleviate the detection errors at the offset region. Objective test results show that the proposed scheme is useful for achieving a considerable performance improvement for the VAD. Additionally, the proposed VAD gives detection performances superior to G.729B VAD and comparable with the AMR VAD option 2.
Towards Context-Sensitive Domain Ontology Extraction
Authors: Raymond Y. K. Lau, Jin Xing Hao, Maolin Tang, Xujuan Zhou
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Although there has been a surge of interest in applying domain ontologies to facilitate communications among computers and human users, engineering of these ontologies turns out to be very labor intensive and time consuming. Recently, some learning methods have been proposed for automatic or semi-automatic extraction of ontologies. Nevertheless, the accuracy and computational efficiency of these methods should be improved to support large scale ontology extraction for real-world applications. This paper illustrates a novel domain ontology extraction method. In particular, contextual information of the knowledge sources is exploited for the extraction of high quality domain ontologies. By combining lexico-syntactic and statistical learning approaches, the accuracy and the computational efficiency of the extraction process can be improved. Empirical studies have confirmed that the proposed method can extract reliable domain ontology to improve the performance of information retrieval and facilitate human users to discover and refine domain ontology.
Evaluating the Harmfulness of Cloning: A Change Based Experiment
Authors: Angela Lozano, Michel Wermelinger, Bashar Nuseibeh
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

Cloning is considered a harmful practice for software maintenance because it requires consistent changes of the entities that share a cloned fragment. However this claim has not been refuted or confirmed empirically. Therefore, we have developed a prototype tool, CloneTracker, in order to study the rate of change of applications containing clones. This paper describes CloneTracker and illustrates its preliminary application on a case study.
The Development of Multi-Depth Pepper's Ghost Display for Mixed Reality System
Authors: Ronald Sidharta, Atsushi Hiyama, Tomohiro Tanikawa, Michitaka Hirose
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Pepper's Ghost is a well known technique in theater productions that allows the appearance of a semi-transparent and perhaps flying ghost on the stage. This technique has also been used with digital display to create a mixed reality (MR) system, where dynamic virtual objects are presented together with the static diorama. The usual pepper's ghost setup does not allow the presentation of the virtual objects in different z location. This paper describes the development of a pepper's ghost MR system that is able to display the virtual objects in varying z locations. In this implementation, we used six layers of Polymer Dispersed Liquid Crystal (PDLC) as the projection screens. By adjusting the on/off status of the PDLC layer, we were able to present objects at different depths.
On the implementation of the harmonic plus noise model for concatenative speech synthesis
Authors: Y. Stylianou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In concatenative speech synthesis systems, speech models are usually used to represent the speech signal. Recently, the harmonic plus noise model (HNM) has been proposed for concatenative speech synthesis with promising results. One main drawback of HNM is its complexity. In this paper, we review four different methods of reducing the complexity of HNM. These include, straight-forward synthesis(SF), synthesis using inverse fast Fourier transform (IFFT), synthesis using recurrence relations for trigonometric functions (RR), and synthesis based on delayed multi-resampled cosine functions (DMRC). DMRC was shown to outperform all the other techniques reducing the complexity of HNM synthesizer by 95% compared to the current version of the HNM which is based on the SF method. Informal listening tests showed that the version of HNM based on the DMRC method provides higher quality of speech synthesis than the version based on SF.
Autonomic self-organization architecture for wireless sensor communications
Authors: Jiann-Liang Chen, Hsi-Feng Lu, Chien-An Lee
Venue: International Journal of Network Management (2007)

Wireless sensor nodes may be spread over large areas and long distances, and require multi-hop communications between nodes, making direct management numerous wireless sensor nodes inefficient. Hierarchical management can be adopted to control several nodes. Effectively controlling the top-level nodes can decrease the costs of managing nodes and of the communication among them. The lower-level nodes are controlled and organized with the higher-level nodes. This study presents an algorithm for self-organization mechanism of higher-level nodes, contesting member nodes by multi-hop to form hierarchical clusters, and applying the '20/80 rule' to determine the ratio of headers to member nodes. Furthermore, the broadcast tree is constructed with the minimum number of hops. Simulation results indicate that the mechanism has a 6-22% lower cover loss than other approaches. The average delay of the minimum hop count approach is 0.22-1.57 ms less than that of free hop count approach. The simulation also reveals the influence of 20/80 rule on cluster formation between sensor nodes.
Two-Tier Multiple Query Optimization for Sensor Networks
Authors: Shili Xiang, Hock Beng Lim, Kian-Lee Tan, Yongluan Zhou
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

When there are multiple queries posed to the resourceconstrained wireless sensor network, it is critical to process them efficiently. In this paper, we propose a Two-Tier Multiple Query Optimization (TTMQO) scheme. The first tier, called base station optimization, adopts a cost-based approach to rewrite a set of queries into an optimized set that shares the commonality and eliminates the redundancy among the queries in the original set. The optimized queries are then injected into the wireless sensor network. In the second tier, called in-network optimization, our scheme efficiently delivers query results by taking advantage of the broadcast nature of the radio channel and sharing the sensor readings among similar queries over time and space at a finer granularity. Our experimental results indicate that our proposed TTMQO scheme offers significant improvements over the traditional single query optimization technique.
Scriptroute: a public internet measurement facility
Authors: Neil Spring, David Wetherall, Tom Anderson
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

We present Scriptroute, a system that allows ordinary Internet users to conduct network measurements from remote vantage points. We seek to combine the flexibility found in dedicated measurement testbeds such as NIMI with the general accessibility and popularity of Web-based public traceroute servers. To use Scriptroute, clients use DNS to discover measurement servers and then submit a measurement script for execution in a sandboxed, resource-limited environment. The servers ensure that the script does not expose the network to attack by applying source- and destination-specific filters and security checks, and by rate-limiting traffic. Scriptroute code is publicly available and has been deployed on the PlanetLab testbed of 42 sites. As proof-of-concept, we have used it both to create RPT, a tool for measuring routing trees toward a destination, and to repeat the experiment used to evaluate GNP, a recently proposed Internet distance estimation technique. We find that our system is flexible enough to implement a variety of measurement tools despite its security restrictions, that access to many remote vantage points makes the system valuable, and that scripting is an apt choice for expressing and combining measurement tasks.
A Parallel Solution for the Multiprocessor Document Allocation Problem
Authors: Kyeongmo Park, Ophir Frieder, Arun Sood
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We present a new coarse grain parallel genetic algorithm (PGA}for the Multiprocessor Document Allocation Problem (MDAP, an NP-complete problem). The problem is to find an optimal mapping of a collection of documents onto the multiprocessor nodes such that the average cluster diameter is kept to a minimum while providing for an even document distribution across the nodes. Our algorithm has been implemented on a 16-node Intel iPSC/2 hypercube and the performance was evaluated. As part of the experimental analysis, the effects of varying the number of documents and their distribution across the clusters are studied. We also investigate the impact of varying two PGA parameters - the migration period and the migration volume
What happened to the intelligent test bench?
Authors: G. Smith
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

In this paper we present techniques for comparison between behavioral level and register transfer level (RTL) design descriptions by mapping the designs into virtual controllers and virtual datapaths. We also discuss about how the equivalence between behavioral level and RTL designs can be defined precisely using the proposed "attribute statements" in an interactive fashion. Implementation issues as well as considerations on real life industrial design examples are presented as well. 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
Higher-order (nonlinear) diffraction tomography
Authors: G. A. Tsihrintzis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Nonlinear tomographic reconstruction algorithms are developed for inversion of data measured in scattering experiments in which the scattered wavefields are modeled by an arbitrarily large number of terms in the Born series. The algorithms attain the form of a Volterra series of nonlinear operators, with the usual filtered backpropagation algorithm of diffraction tomography as the leading linear term.
Practical Protocol Steganography: Hiding Data in IP Header
Authors: Bo Xu, Jia-zhen Wang, De-yun Peng
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Steganography is defined as the art and science of hiding information, which is a process that involves hiding a message in an appropriate carrier for example an image file. The carrier can then be sent to a receiver without anyone else knowing that it contains a hidden message. In this paper we present a novel scheme to send message imperceptibly between points over Internet. This scheme uses fourth-order Chebyshev chaotic system to generate chaos sequence which is used to encrypt secret message, and then embeds the modulated message into identification field of IP header. Compared with Ahsa's scheme, this scheme can provide higher security. Furthermore, this schema allows sending covert message point to point by selecting proper IP packets according to path MTU discovery.
Hardware Implementation of a Bounded Algorithm for Application of Rules in a Transition P-System
Authors: Victor Martinez, Fernando Arroyo, Abraham Gutierrez, Luis Fernandez
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The transition P-systems performs a computation through transition between two consecutive configurations. A configuration consists in a m-tuple of multisets present at any moment in the existing m regions of the system. Transitions between two configurations are performed by using evolution rules which are in each region of the system in a non-deterministic maximally parallel manner. This paper is part of exhaustive investigation line whose objective is to implement a hardware system that evolves as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic system in several stages. The first stage was to determine active rules in a determined configuration for the membrane. The second stage is developed by obtaining the part of the system that is in charge of the application of the active rules. To count the number of times that the active rules is applied exist different algorithms. In this paper presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is perfectly defined, and their adaptation to systems with any number of rules is simple.
A course in information engineering across the professions
Authors: J. A. Orr
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

A new course titled "Information Engineering Across the Professions" is being implemented at WPI. This course is intended for students outside of the Electrical and Computer Engineering majors. It addresses a need that has arisen from the impact that information technology is making on all professions, technical and non-technical. This course will provide students with knowledge regarding such concepts as the nature of information, bandwidth, types of transmission and storage media, and the fundamental principles governing information technology. Through the use of laboratory project-based modules customized to address different student disciplinary interests and backgrounds (e.g., mechanical engineering the sciences, the arts, management), the course will expose students to professional applications of these technologies. The course will be taught making extensive use of the World Wide Web (which also will serve as an example of the future of information technologies), and this web material will be available for use by other institutions and other faculty.
Air interface switching and performance analysis for fast vertical handoff in cellular network and WLAN interworking: Research Articles
Authors: Minghui Shi, Liang Xu, Xuemin (Sherman) Shen, Jon W. Mark, Aladdin Saleh
Venue: Wireless Communications Mobile Computing (2007)

The integration of wireless local area network (WLAN) hotspot and the 3G cellular networks is imminently the future mode of public access networks. One of the key elements for the successful integration is vertical handoff between the two heterogeneous networks. Service disruption may occur during the vertical handoff because of the IP layer handoff activities, such as registration, binding update, routing table update, etc. In this paper, the network interface switching and registration process are proposed for the integrated WLAN&#x002F;cellular network. Two types of fast vertical handoff protocols based on bicasting and non-bicasting supporting real-time traffic, such as voice over IP, are modeled. The performance of a bicasting based handoff scheme is analyzed and compared with that of fast handoff without bicasting. Numerical results and the simulation are given to show that packet loss rate can be reduced by the bicasting during handoff scheme without increasing bandwidth on both wireless interfaces. Copyright &copy; 2006 John Wiley & Sons, Ltd.