ppxscal/embedding_network huggingface dataset:
An Adaptable Crash Faults Detector for Mobile Ad-Hoc Networks
Authors: Mourad Elhadef, Fahim Abdun-Nur
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Failure detection forms a basic block when deploying dependable wireless networks which are required to provide reliable and continuous services despite the failure of some of their hosts. The role of the failure detection service is to provide information on which hosts have crashed and which ones are still alive. In this work, we introduce an adaptable failure detector (AFD) that can tolerate mobility and topology changes. The new AFD is shown to be eventually perfect, by satisfying both strong completeness (i.e., there is a time after which every faulty host is permanently suspected by every fault-free host) and eventual strong accuracy (i.e., no host will be suspected before it crashes).
Vibration Enhances Geometry Perception with Tactile Shape Displays
Authors: Maria Oyarzabal, Masashi Nakatani, Robert D. Howe
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Tactile displays can provide detailed spatial information to the skin, but little is known about the effects of vibrating displayed shapes. This study examines passive touch perception of flat and indented surfaces displayed on a 36 pin tactile display with 2 mm pin pitch. Subjects could not perceive a 0.1 mm deep central indentation when it was presented statically, but it was readily detected when the pattern was vibrated at 5 Hz. A central raised bar was incorrectly perceived as indented when the adjacent pins were vibrated, which is consistent with the "fishbone tactile illusion (Nakatani et al., Proc. EuroHaptics 2006). These results suggest that tactile display devices can use vibrational stimulus to enhance perception of small differences in height.
Software compliments structured learning for kinematics of mechanisms
Authors: C. J. Egelhoff
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

This paper describes how several commercial software products can be integrated into teaching the Kinematics of Mechanisms and how technology can be transformed into an advantage for the student. The authors advocate increasing the educational use of existing software while balancing the student experience with a healthy skepticism of all computer products and a wealth of hands-on activities.
MVP: a mutation-based validation paradigm
Authors: J. Campos, H. Al-Asaad
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

A mutation-based validation paradigm that can handle complete high-level microprocessor implementations is presented. First, a control-based coverage measure is presented that is aimed at exposing design errors that incorrectly set control signal values. A method of automatically generating a complete set of modeled errors from this coverage metric is presented such that the instantiated modeled errors harness the rules of cause-and-effect that define mutation-based error models. Finally, we introduce an automatic test pattern generation technique for high-level hardware descriptions that solves multiple concurrent constraints and is empowered by concurrent programming.
Split band CELP (SB-CELP) speech coder
Authors: M. R. Nakhai
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We discuss the split band code-excited linear prediction (SB-CELP) speech coder which employs an iterative version of the harmonic sinusoidal coding algorithm to encode the periodic contents of speech signal. The speech spectrum is split into two frequency regions of harmonic and random components and a reliable fundamental frequency is estimated for the harmonic region using both speech and its linear predictive (LP) residual spectrum. The resulting sinusoidal parameters are interpolated to reconstruct the periodicity in speech waveform. The level of periodicity is controlled by computing a cutoff frequency between the harmonic and random regions of spectrum. The random part of spectrum and unvoiced speech are processed using the CELP coding algorithm. The SB-CELP speech coder which combines the powerful features of the sinusoidal and CELP coding algorithms yields a high quality synthetic speech at 4.05 kb/s.
A Time Division Beacon Scheduling Mechanism for IEEE 802.15.4/Zigbee Cluster-Tree Wireless Sensor Networks
Authors: Anis Koubaa, Andre Cunha, Mario Alves
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

While the IEEE 802.15.4/Zigbee protocol stack is being considered as a promising technology for low-cost low-power Wireless Sensor Networks (WSNs), several issues in their specifications are still open. One of those ambiguous issues is how to build a synchronized cluster-tree network, which is quite suitable for ensuring QoS support in WSNs. In fact, the current IEEE 802.15.4/Zigbee specifications restrict the synchronization in the beacon-enabled mode (by the generation of periodic beacon frames) to star-based networks, while they support multi-hop networking using the peer-to-peer mesh topology, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multi-hop and synchronization features, the description on how to effectively construct such a network topology is missing. This paper tackles this problem, unveiling the ambiguities regarding the use of the cluster-tree topology and proposing a synchronization mechanism based on Time Division Beacon Scheduling to construct cluster-tree WSNs. We also propose a methodology for an efficient duty-cycle management in each router (cluster-head) of a cluster-tree WSN that ensures the fairest use of bandwidth resources. The feasibility of the proposal is clearly demonstrated through an experimental test bed based on our own implementation of the IEEE 802.15.4/Zigbee protocols.
Real-time Controller Area Networks (CAN) -- managing transient surges
Authors: Paul Richardson, Larry Sieh, Ali Elkateeb, Peter Haniak
Venue: Integrated Computer-Aided Engineering (2002)

Controller Area Network (CAN) is a control network protocol that can be found in a wide range of embedded systems. Control networks are inherently real-time local area networks (LANs) whose correct performance is specified in terms of the reliable and timely delivery of messages. These networks are typically required to provide long periods of uninterrupted service in harsh and dynamic environments. Under these conditions, the network is prone to transient-surges in loading that tend to upset temporal behavior. During transient-surges, it is highly desirable to sustain the timely transmission of critical messages. In this effort we describe a protocol that provides Quality of Service (QoS) support for critical real-time message transmissions under nominal conditions and during transient-surges. Our approach uses the CAN protocol in conjunction with a time-value scheduling algorithm. The QoS support for individual message transmissions considers system-state, network loading, and the value of pending messages with respect to time.
Motion-based segmentation by principal singular vector (PSV) clustering method
Authors: S. Y. Kung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Motion-based segmentation has attracted a lot of attention. The task of identifying independent objects is called segmentation. Motion-based segmentation has a broad video application domain. An approach based on principal singular vectors (PSVs) of the image measurement matrix was proposed for separating independent moving objects in Kung and Yun-Ting Lin (1995). After applying SVD (singular value decomposition), feature blocks with different object-based motions tend to form separate clusters on the PSV space. Therefore, a frame can be divided into regions each with consistent motion. Our approach offers several additional features: (1) a multi-candidate feature tracker is adopted. (2) Multiple frames are utilized to facilitate motion-based separation. (3) We would like to achieve not only accurate motion estimation, but also the object regions should retain some neighborhood property (to save the bits for the coding boundary). For this, a neighborhood sensitivity parameter /spl delta/ is introduced. One application of motion-based segmentation is low-bit-rate video compression. In very low bit-rate video coding, only motion vectors of finite regions and the region boundary (coded in prediction error) need to be transmitted. Yet simulations yield quite respectable compensated frames.
Evaluating windows NT terminal server performance
Authors: Alexander Ya-li Wong, Margo Seltzer
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

With the introduction of Windows NT, Terminal Server Edition (TSE), Microsoft finally brings to Windows the "thin-client" computing model the X Window System has offered Unix for a decade. TSE's two most salient features are the provision of multi-user login service and the provision of that service remotely, over a network link. These features distinguish TSE from previous Microsoft operating systems not only by functionality, but also by how its performance ought to be measured. Because TSE's primary service is interactive, user-perceived latency is more important than ever. In this paper, we examine the resource consumption and latency characteristics of shared usage on a TSE system. We find that the introduction of remote, multi-user access has added to the minimal level of resource consumption, that the efficiency of TSE's RDP protocol is generally good but degrades on dynamic user interface elements, and that TSE can exhibit poor latency performance when subjected to high processor, memory, and network load.
Purely Digital BIST for Any PLL or DLL
Authors: Stephen Sunter, Aubin Roy
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

PLLs are the heart of most SoCs, so their performance affects many tests. Practical, published PLL BIST approaches cannot measure \le10 ps RMS jitter or \ge1 GHz. This paper describes how a SerDes undersampling DFT technique was adapted to test multiple PLLs and DLLs for jitter, output frequency, duty cycle, and other parameters. Its multi-GHz range, sub-picosecond jitter noise floor, and minimal silicon area are better than for any previous silicon-proven DFT or BIST that needs no calibration or analog circuitry. FPGA implementation results are provided.
Similarity Search in Trajectory Databases
Authors: Nikos Pelekis, Ioannis Kopanakis, Gerasimos Marketos, Irene Ntoutsi, Gennady Andrienko, Yannis Theodoridis
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

Trajectory Database (TD) management is a relatively new topic of database research, which has emerged due to the explosion of mobile devices and positioning technologies. Trajectory similarity search forms an important class of queries in TD with applications in trajectory data analysis and spatiotemporal knowledge discovery. In contrast to related works which make use of generic similarity metrics that virtually ignore the temporal dimension, in this paper we introduce a framework consisting of a set of distance operators based on primitive (space and time) as well as derived parameters of trajectories (speed and direction). The novelty of the approach is not only to provide qualitatively different means to query for similar trajectories, but also to support trajectory clustering and classification mining tasks, which definitely imply a way to quantify the distance between two trajectories. For each of the proposed distance operators we devise highly parametric algorithms, the efficiency of which is evaluated through an extensive experimental study using synthetic and real trajectory datasets.
Introduction of Humatronics--Towards Integration of Web Intelligence and Robotics
Authors: Yasufumi Takama
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In recent years, various systems based on electron-ics, such as cars, computers and robots have been get-ting into our daily lives. Unfortunately, asymmetrical relationship exists between human and such systems, imposing burdens especially on elderly or handi-capped persons. In order to solve various problems for balancing such asymmetrical relationship, humatron-ics is proposed. Main purpose of humatronics is to establish the symmetric interaction between human and electronic systems by giving the systems the capa-bility of understanding humans. Another important factor for humatronics is computer networks, over which the systems can share knowledge, information, and experiences. This paper introduces the concept of humatronics and key technologies for realizing it. A prototype system that is currently developed based on the concept of humatronics is also introduced.
A Method for the Certification and the Delegation of Trust in Distributed Systems
Authors: Thomas Wolfl, Kai Fischbach
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Distributed computing systems require methods for a participant's decision about its trust in other entities. A similar problem exists in the area of Public Key Infrastructures (PKIs) where the verifier's trust in the issuer of a public key certificate is a well-known prerequisite for the acceptance of the certificate. This work presents a method for the assignment, the storage, the propagation and the verification of trust in a distributed system which is based on a PKI trust management approach. A participant's trust causes the issuing of a digital certificate binding a privilege for the proper fulfillment of a certain task to the trusted entity. These certificates are stored in a distributed manner in the system and, therefore, are available to any other participant for its trust decisions. We describe the processes for the certification and the verification of these trust privileges. Additionally, a formal model of the trust verification process is presented. An example illustrates the application of the method and the model.
A two-stage scoring method combining world and cohort models for speaker verification
Authors: W. D. Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The cohort and world models are commonly used for scoring normalization in speaker verification. As these models represent different regions of the feature space, a better solution could be obtained by integrating them into a single framework. In this paper, we embed the two models in elliptical basis function networks and propose a two-stage decision procedure for improving verification performance. In the first stage, the score of an unknown utterance is normalized by a world model. If the difference between the resulting normalized score and a world threshold is sufficiently large, the claimant is accepted or rejected immediately. Otherwise, the score will be normalized by a cohort model and compared with a cohort threshold to make a final accept/reject decision. Experimental evaluations based on the YOHO corpus suggest that the two-stage method achieves a lower error rate as compared to the case where only one background model is used.
Towards Competitive Web Service Market
Authors: Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang, Tae-Hyung Kim
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

By fully exploiting Service Oriented Architecture (SOA), Web service provides an efficient way to connect the existing on-line assets to support business enterprises. Most of the current Web service research inherently assumes that there exists only one service provider that can invoke those element services and compose them in a specific solution scenario. This paper aims to extend Web services research beyond the current limitations, allowing the existence of parallel and competitive service providers that compete for serving the customers. This paper intends to formally describe the concept of competitive Web service market, or CWSM in short. Web service composition problems pertinent to CWSM are also discussed. Two different models for CWSM are investigated, and the heuristics to be considered for the design of revenue oriented composition approaches are also proposed.
Frequency estimation for sensorless control of induction motors
Authors: M. Hilairet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

In the motor control industry, DSP systems offer major improvements over analog designs, enabling notably to replace speed or position sensors by the implementation of sensorless control algorithms. In this paper, we propose a new viable method which estimates the rotor velocity from the "rotor slot harmonics" included in the stator current signals. This approach is based on both an adjustable digital filter, which is fitted to this particular application, and an extended Kalman filter whose computational burden has been reduced thanks to an additional virtual state.
A sparse grid based spectral stochastic collocation method for variations-aware capacitance extraction of interconnects under nanometer process technology
Authors: Hengliang Zhu, Xuan Zeng, Wei Cai, Jintao Xue, Dian Zhou
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In this paper, a Spectral Stochastic Collocation Method (SSCM) is proposed for the capacitance extraction of interconnects with stochastic geometric variations for nanometer process technology. The proposed SSCM has several advantages over the existing methods. Firstly, compared with the PFA (Principal Factor Analysis) modeling of geometric variations, the K-L (Karhunen-Loeve) expansion involved in SSCM can be independent of the discretization of conductors, thus significantly reduces the computation cost. Secondly, compared with the perturbation method, the stochastic spectral method based on Homogeneous Chaos expansion has optimal (exponential) convergence rate, which makes SSCM applicable to most geometric variation cases. Furthermore, Sparse Grid combined with a MST (Minimum Spanning Tree) representation is proposed to reduce the number of sampling points and the computation time for capacitance extraction at each sampling point. Numerical experiments have demonstrated that SSCM can achieve higher accuracy and faster convergence rate compared with the perturbation method.
Space-time travel blogging using a mobile phone
Authors: William Bamford, Paul Coulton, Reuben Edwards
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Whilst location based services have long been envisioned as an important element of future mobile user experiences, they have only recently become realizable for the average phone user. This is due to the emergence of: flat rate date tariffs on mobile networks; low cost Bluetooth GPS units and a large user base of phones capable of installing and running applications. In this paper we discuss the design, implementation, and results of a six month open user trial of a space-time photo travel blogging service called LocoBlog. The user experiences, over 1100 photographs from 14 countries, show that such a service is practical, affordable and seen as a new and exciting way of not only recording and sharing travel experiences but also general activities within their daily lives.
Video temporal reconstruction and frame rate conversion
Authors: Farshad Fotouhi, William Grosky
Venue:  (2006)

This research identified and discussed several issues in motion compensated frame rate conversation: spatiotemporal enhancement of decoded motion vectors in compressed domain, novel and fast video shot boundary detection, foreground segmentation under inconsistent motion styles and hybrid motion compensated frame interpolation methods. First of all, methods for spatially and temporally compressing video redundancy have been identified and analyzed. Due to the compression, encoded motion vectors are unable to precisely provide object motion direction and velocity, and have low spatial granularity. Ground on the facts above, we employ a spatiotemporal filtering and interpolation method that not only reduces the negative impacts brought by random noises, but also enhance both the spatial and the temporal resolution of motion vector fields decoded from compressed video sequences. Motion compensated frame rate conversion is highly dependent on consistent visual contents that continuous frames represent. Hence, in the second part, we introduce a novel video shot boundary detection method. Similar frames are first grouped together. To overcome the initial over-segmentation, we measure the ratio of the between-group distance and the within-group distance for any two consecutive groups, and then iteratively merge two groups that minimize this ratio. Thirdly, we study the motion segmentation, especially when foreground objects exhibit different motion styles from that of background. An iterative estimation method is proposed to use the enhanced motion vector field as input and carefully separate blocks that have larger motion errors from the rest. The separated blocks are then filtered and tracked to form consistent spatiotemporal objects. Fourthly, two different motion compensated frame interpolation methods are provided. Hybrid block-based interpolation reconstructs the background by applying the estimated motion model on every background pixel, followed by a conventional block-wise foreground reconstruction. In region-based interpolation, foreground is segmented into regions. By spatial and temporal merging, the region correspondence between two frames is established. Pixel-level motion estimation is applied on every pair of matching regions. Regions in interpolated frames are then derived from the intermediate state of compensating one matching region to another. Experimental results suggest that region-based method generates less block artifacts than block-based method.
Efficient Broadcast in All-Port Wormhole-Routed Hypercubes
Authors: Philip K. McKinley, Christian Trefftz
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

A method to reduce broadcast time in wormhole routed hypercube systems in described. The method takes advantage of the destance insensitivity of wormhole routing and the presence of multiple ports between processors and their routes. Performance results from an nCUBE-2 multicomputers are given that demonstrate the advantage of the method over the traditional spanning binomial tree approach.