ppxscal/embedding_network huggingface dataset:
Capturing Outlines of Planar Images by Fuzzy Randomized Knot Insertion to Cubic Spline
Authors: Muhammad Sarfraz, Aiman Rasheed
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

The proposed work, in this paper, is concerned with an efficient technique of curve fitting using cubic splines. The technique has various phases including extracting outlines of images, detecting corner points from the detected outline, addition of extra knot points if needed. The last phase makes a significant contribution by making the technique automated. It uses the idea of knot insertion in a fuzzy randomized manner. The proposed algorithm is an iterative one. The algorithm proposed is computationally efficient as compared to least square approach.
Low-cost, high-impact video production techniques for laboratory instructional materials
Authors: E. R. Doering
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Video production techniques have been developed to produce laboratory instructional materials that are low cost, both in terms of cash outlay and in instructor development time, and yet which achieve high impact in terms of student learning effectiveness. This paper reviews the instructional needs of the students that motivate the specific choice of production techniques, and presents assessment results from classroom use of the methods. The techniques have been developed to support lab-oriented courses that require students to become proficient users of a set of CAD tools.
Simulation of hearing impairment based on the Fourier time transformation
Authors: J. Chalupper
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

A signal processing system was designed to simulate hearing impairment for normal hearing listeners. Typical consequences of sensorineural hearing loss are an elevated threshold in quiet, abnormal growth of loudness ('recruitment') and reduced spectral and temporal resolution. However, the just noticable difference (jnd) in intensity is unaffected. Based on an aurally adequate time-frequency representation, these effects can be simulated by intensity quantization and frequency dependent dynamic level expansion. The Fourier time transformation (FTT) was used for analysis of the time signal and the inverse FTT for resynthesis of the modified complex spectra. Input-output functions used for level expansion are calculated from the audiogram and a categorical loudness scaling procedure. Hearing experiments were carried out to find the appropriate quantization step and to simulate intensity jnd's of normal and hearing impaired listeners. The proposed processing scheme will be used to improve the design and fitting of hearing aids.
Lyapunov-based nonlinear control and estimation using vision in the loop
Authors: Darren Dawson
Venue:  (2006)

This Ph.D. dissertation describes the design and implementation of various nonlinear estimation and control strategies synthesized from a fusion of homography-based computer vision techniques and Lyapunov control design methods. Chapter 2 is devoted to the design of a continuous estimator that is utilized to asymptotically identify the six degree-of-freedom velocity of a moving object using a single fixed camera. Similar to the stereo vision paradigm, the proposed estimator utilizes different views of the object from a single camera to calculate 3D information from 2D images. Homography-based techniques are used in the development of the object kinematics. In contrast to some of the previous work in this area, no explicit model is used to describe the movement of the object; rather, the estimator is constructed based on bounds on the object's velocity, acceleration, and jerk. Building upon the mathematical foundation laid in chapter 2, the development of an adaptive nonlinear estimator to identify the Euclidean coordinates of feature points on a moving object using a monocular camera is described in chapter 3. The performance of the estimator is demonstrated by simulation and experimental results. While chapters 2 and 3 are devoted to the design of nonlinear estimators for motion and structure of rigid bodies in the field of view of a camera, the remaining two chapters describe the design of vision-based nonlinear controllers, specifically for unmanned aerial vehicles (UAVs), in order to achieve the objectives of autonomous landing (chapter 1) and path following (chapter 5). Video stream from a monocular camera on-board the UAV is utilized for formulating the position and orientation error systems. The controllers are then designed utilizing the Backstepping approach.
The Performance Impact of Kernel Prefetching on Buffer Cache Replacement Algorithms
Authors: Ali R. Butt, Chris Gniady, Y. Charlie Hu
Venue: IEEE Transactions on Computers (2007)

A fundamental challenge in improving file system performance is to design effective block replacement algorithms to minimize buffer cache misses. Despite the well-known interactions between prefetching and caching, almost all buffer cache replacement algorithms have been proposed and studied comparatively, without taking into account file system prefetching, which exists in all modern operating systems. This paper shows that such kernel prefetching can have a significant impact on the relative performance in terms of the number of actual disk I/Os of many well-known replacement algorithms; it can not only narrow the performance gap but also change the relative performance benefits of different algorithms. Moreover, since prefetching can increase the number of blocks clustered for each disk I/O and, hence, the time to complete the I/O, the reduction in the number of disk I/Os may not translate into proportional reduction in the total I/O time. These results demonstrate the importance of buffer caching research taking file system prefetching into consideration and comparing the actual disk I/Os and the execution time under different replacement algorithms.
Towards locating execution omission errors
Authors: Xiangyu Zhang, Sriraman Tallam, Neelam Gupta, Rajiv Gupta
Venue: ACM SIGPLAN Notices (2007)

Execution omission errors are known to be difficult to locate using dynamic analysis. These errors lead to a failure at runtime because of the omission of execution of some statements that would have been executed if the program had no errors. Since dynamic analysis is typically designed to focus on dynamic information arising from executed statements, and statements whose execution is omitted do not produce dynamic information, detection of execution omission errors becomes a challenging task. For example, while dynamic slices are very effective in capturing faulty code for other types of errors, they fail to capture faulty code in presence of execution omission errors. To address this issue relevant slices have been defined to consider certain static dependences (called potential dependences) in addition to dynamic dependences. However, due to the conservative nature of static analysis, overly large slices are produced. In this paper, we propose a fully dynamic solution to locating execution omission errors using dynamic slices. We introduce the notion of implicit dependences which are dependences that are normally invisible to dynamic slicing due to the omission of execution of some statements. We design a dynamic method that forces the execution of the omitted code by switching outcomes of relevant predicates such that those implicit dependences are exposed and become available for dynamic slicing. Dynamic slices can be computed and effectively pruned to produce fault candidate sets containing the execution omission errors. We solve two main problems: verifying the existence of a single implicit dependence through predicate switching, and recovering the implicit dependences in a demand driven manner such that a small number of verifications are required before the root cause is captured. Our experiments show that the proposed technique is highly effective in capturing execution omission errors.
Achieving Flexible Cache Consistency for Pervasive Internet Access
Authors: Yu Huang, Jiannong Cao, Zhijun Wang, Beihong Jin, Yulin Feng
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

Caching is an important technique to support pervasive Internet access. Cache consistency measures the deviation between the cached data and the source data. In mobile computing environments, especially with ad hoc networks, users are in great need of the flexibility in tuning their consistency requirements, in order to make tradeoffs between the specified cache consistency and the cost incurred. Existing works have used Delta Consistency (DC) and Probabilistic Consistency (PC) which, to some extent, provide the users with such flexibility. In this paper, we propose a general consistency model called Probabilistic Delta Consistency (PDC). PDC covers all existing consistency models including DC and PC, and integrates the flexibility granted by both DC and PC. Thus, PDC enables the users to flexibly specify their consistency requirements in two orthogonal dimensions, namely the deviation in time/value and the ratio of queries gaining the specified consistency. We also propose a consistency maintenance algorithm, called Flexible Combination of Push and Pull (FCPP), which can meet users' consistency requirements specified under the PDC model. An analytical model is derived to achieve the optimized combination of push and pull, so as to ensure the user-specified consistency requirements, while minimizing the consistency maintenance overhead. Extensive simulations are conducted to evaluate the performance of the FCPP algorithm. Evaluation results show that, compared with the widely used Dynamic TTR algorithm, FCPP can save up to 68% of the traffic overhead and reduce the query delay by up to 84%.
Digital homes on wheels: designing for the unimagined home
Authors: Alexandra Zafiroglu, Michele Chang
Venue: Personal and Ubiquitous Computing (2007)

Design for the digital home is often predicated on an ideal, imagined domestic space that is expansive, stable, occupied by a "busy" nuclear family, and does not always match existing, real-life digital homes. Using American retirees living full time in recreational vehicles as our case study of actual digital homes, we argue that designing suitable and appropriate technologies for the home must be done with particular attention to the home as embodied, rather than the home as ideal. The challenges and advantages of designing for embodied homes are detailed in this paper. We contend that appropriate design must seriously engage not only the material body of the house, but the social fabric--the complex sets of social relationships and identities and practices they support--that make a house a home. An analysis of the salient aspects of the material body and social fabric of full time retired RVer household leads to bespoke design considerations for these real-life digital homes.
Practical Exploitation of the Energy-Latency Tradeoff for Sensor Network Broadcast
Authors: Matthew J. Miller, Indranil Gupta
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

As devices become more reliant on battery power, it is essential to design energy efficient protocols. While there is a vast amount of research into power save protocols for unicast traffic, relatively little attention has been given to broadcast traffic. In previous work [1], we proposed Probability-Based Broadcast Forwarding (PBBF) to address broadcast power save by allowing users to select a desired tradeoff between energy consumption, latency, and reliability. In this paper we extend our previous work in two ways. First, we introduce a new parameter that allows a tradeoff between reliability and packet overhead to give users more options. Second, we implement PBBF on the TinyOS platform [2] to evaluate it beyond the analysis and simulation from our previous work. Our evaluation demonstrates the tradeoffs possible using PBBF on sensor hardware.
Effect of feedback delay on fixed step and variable step power control algorithms in CDMA systems
Authors: A. Kurniawan
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

In this paper, we compare the performance of fixed step and variable step algorithms of a closed-loop power control (CLPC) scheme for the reverse link of a code division multiple access (CDMA) system. The CLPC under consideration is based on the signal-to-interference (SIR) measurement at the base station. Conceptually, variable step algorithms outperform fixed step algorithms because the variable step algorithm can track the fading channel more accurately, with accuracy increasing proportionally to the number of power control bits per power control interval. In practice, however, power control algorithms are subject to the limitations of power control parameters, particularly the effect of feedback delay. The performance of variable step algorithm with mode q=4 is found to be worse than that of a fixed step algorithm (q=1) under practical situations with feedback delay of two power control intervals. To overcome the effect of feedback delay, a channel predictor is devised using a recursive least square (RLS) method and is shown to. be very effective. 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
Comparison of anomaly signal quality in common detection metrics
Authors: Daniela Brauckhoff, Martin May, Bernhard Plattner
Venue: Proceedings of the 3rd annual ACM workshop on Mining network data (2007)

Problems involving classification and pattern recognition can often be profitably viewed from the perspective of signal detection theory. We present ANEX (ANomaly EXposure), a simple and intuitive measure for comparing anomaly detection metrics regarding their capability to expose certain types of anomalies. ANEX is based on signal detection theory and determines the anomaly signal quality with the help of the intersection area of the metric's probability density functions in the normal and anomalous case. We illustrate the applicability of our measure by comparing 15 frequently-used detection metrics for the Blaster worm and discuss some early results by comparing NetFlow data from four different border gateway routers of a medium-sized ISP network.
Collaborative Virtual Environments as Research and Teaching Instruments in the Field of Disaster Medicine: the "e-DISTRICT CiPro" Simulator
Authors: F. La Mura, F. Della Corte, M. Gribaudo, B. Tosi, S. Alciati, R. Bordino, G. Franceschinis
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

The virtual reality simulator used in the e-DISTRICT CiPro Pilot-Project, in the context of the EU programme Leonardo da Vinci II, allows the realization of an Internet based Collaborative Virtual Environment and it can be used for Education and Training for Civil Protection Operators, and for Research purposes in new operational protocols and their effectiveness (which would be very expensive in case of real drills, and also very difficult to organize). In this article we focus on the goals of the e- District CiPro Project, and we present the virtual reality simulator. We also address the importance of the detail level of the scenarios and we consider their customization and their integration with other software that simulates the phase of treatment in hospital.
Towards Data Partitioning for Parallel Computing on Three Interconnected Clusters
Authors: Brett A. Becker, Alexey Lastovetsky
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

We present a new data partitioning strategy for parallel computing on three interconnected clusters. This partitioning has two advantages over existing partitionings. First it can reduce communication time due to a lower total volume of communication and a more efficient communication schedule. When the network topology is a linear array this partitioning always results in a lower total volume of communication compared to existing partitionings, provided the most powerful node is at the center of the array. When the topology is fully connected this partitioning results in a lower total volume of communication for all but a few power ratios. Second, it allows for the overlapping of communication and computation. These two inherent advantages work together to reduce overall execution time significantly.
Embedding Large Mesh of Trees and Related Networks in the Hypercube with Load Balancing
Authors: Kemal Efe
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

The ability to embed arbitrarily large graphs in smaller graphs has important applications in mapping problems which require more processors than is available in a parallel architecture. We address this problem with the main focus on balancing processor loads. We show that maximum level of system utilization can be obtained when each host node emulates an equal number of "busy" guest nodes for each step of computation. While the embedding methods used are applicable to a variety of guest graphs, the main focus of the paper is on meshes of tree due to their importance as parallel architectures. Methods are also developed for embedding arbitrarily large complete binary trees and grids.
Millennium sort: a cluster-based application for windows NT using DCOM, river primitives and the virtual interface architecture
Authors: Philip Buonadonna, Joshua Coates, Spencer Low, David E. Culler
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

We present the design and results of Millennium Sort, a distributed sorting application built using three layers of technology: extensible River System primitives, the Virtual Interface Architecture (VIA) and the Distributed Component Object Model (DCOM). The Millennium Sort application is a vehicle for exploring the issues of commercial cluster technologies and distributed development on commodity node clusters. We discuss the architecture and design of the River System primitives, VIA and DCOM. Performance results are discussed, including the latest Datamation Sort record time of 1.18 seconds achieved by a 16-node Pentium-II cluster.
Research on Fusion of the Web and TV Broadcasting
Authors: Katsumi Tanaka
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

Despite much talk about the fusion of broadcasting and the Internet, no technology has been established for fusing web and TV program content. In this paper, we report our research activities of the research on fusion of the Web and TV broadcasting under Kyoto University 21st century Center of Excellence (COE) program entitled Informatics Research Center for Development of Knowledge Society Infrastructure. We propose several ways to acquire information from diverse information sources of different media types, especially from Web and TV broadcasting. A notable difference between Web contents and TV program contents is that the former is a document-based information media and the latter is a time-based continuous information media, which leads to the difference of information accessing methods. Conventional "Web browsing" is an active manner of accessing information. On the other hand, conventional "TV watching" is a passive way of accessing information. In order to search, integrate and view the information of Web and TV, we explored (1) media conversion between Web and TV contents, (2) watching TV with live chats, (3) dynamic TV-content augmentation by Web, and (4) searching for TV contents with Web.
On solving systems of ordinary differential equations on MIMD-computers
Authors: A. N. Khimich, M. F. Yakovlev, T. A. Gerasimova
Venue: Cybernetics and Systems Analysis (2007)

The error of solution of Cauchy problems for systems of ordinary differential equations is estimated in the case where the input data are approximate. It is shown how to prepare a program for computing the right-hand sides of the system automatically and simultaneously. Diagrams are presented to illustrate the efficiency of parallelization.
A Consistency Model for Highly Interactive Multi-player Online Games
Authors: Suiping Zhou, Haifeng Shen
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

In this paper, we investigate the consistency issue in multi-player online games (MPOGs). Though consistency has been well-studied in parallel and distributed systems, database systems, and groupware systems, it is still a new and challenging issue for MPOGs. Most existing consistency models and consistency maintenance mechanisms adopt a data-centric approach, which is not adequate for MPOGs. We advocate a human-centric approach, and propose a consistency model based on the similarity of the perceptions of different players. The implications of the proposed consistency model in game design are also discussed. In particular, a generic consistency maintenance mechanism for MPOGs is proposed.
A Convex Programming Approach for Exploiting Data and Functional Parallelism on Distributed Memory Multicomputers
Authors: Shankar Ramaswamy, Sachin Sapatnekar, Prithviraj Banerjee
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Compilers have focused on the exploitation of one of functional or data parallelism in the past. The PARADIGM compiler project at the University of Illinois is among the first to incorporate techniques for simultaneous exploitation of both. The work in this paper describes the techniques used in the PARADIGM compiler and analyzes the optimality of these techniques. It is the first of its kind to use realistic cost models and includes data transfer costs which all previous researchers have neglected. Preliminary results on the CM-5 show the efficacy of our methods and the significant advantages of using functional and data parallelism together for execution of real applications.
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Authors: Kemal Efe, Antonio Fernandez
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees using the cross product operation. This paper focuses on structural, embedding, routing, and layout properties of the MCT networks. We show that MCT networks are computationally more powerful than grids and complete binary trees, and at least as powerful as meshes of trees (MOT). Analysis of VLSI complexity shows thai the additional power is obtained without asymptotically increasing the layout area with respect to the grid of at least 3 dimensions or to the MOT of any number of dimensions. A variation of the basic architecture with same maximum vertex degree and same asymptotic area complexity is also investigated. This variation contains the torus as a subgraph as well as the MOT, further increasing the computational power of the basic architecture. These results suggest that the basic MCT network and its variant are suitable architectures for a large class of massively parallel computations.