ppxscal/embedding_network huggingface dataset:
Reducing file system latency using a predictive approach
Authors: James Griffioen, Randy Appleton
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

Despite impressive advances in file system through put resulting from technologies such as high-bandwidth networks and disk arrays, file system latency has not improved and in many cases has become worse. Consequently, file system I/O remains one of the major bottlenecks to operating system performance [10]. This paper investigates an automated predictive approach towards reducing file latency. Automatic Prefetching uses past file accesses to predict future file systemrequests. The objective is to provide data in advance of the request for the data, effectively masking access latencies. We have designed and implement a system to measure the performance benefits of automatic prefetching. Our current results, obtained from a trace-driven simulation, show that prefetching results in as much as a 280% improvement over LRU especially for smaller caches. Alternatively, prefetching can reduce cache size by up to 50%.
Inductive Reasoning and Programming Visualization, an Experiment Proposal
Authors: Andrés Moreno, Niko Myller, Erkki Sutinen, Taiyu Lin, Kinshuk
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We lay down plans to study how Inductive Reasoning Ability (IRA) affects the analyzing and understanding of Program Visualization (PV) systems. Current PV systems do not take into account the abilities of the user but show always the same visualization independently of the changing knowledge or abilities of the student. Thus, we propose IRA as an important skill when comprehending animation, which can be used to model the students and thus to adapt the visualization for different students. As an initial step we plan to check if IRA correlates with ability to answer program related questions during program visualization. We discuss the possible benefits of using IRA modeling in adaptive PV.
Applying Formal Methods to Compositionality Description of Web Service
Authors: HuaiKou Miao, JunFeng Wu
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Web services are a relatively new paradigm for building distributed web applications. Normally for proving properties of service compositions, and mapping the pre/post-conditions are assertions only on the initial and final states of the service respectively. They do not help in specifying and verifying ongoing behavior of a composite web service system. We propose a formal framework for enriching composite service description with two additional assertions: assumption and commitment that facilitate compositional reasoning about services for the composition of their integration. The technique is based on Maude language, a rewriting logic based methodology in which formal modeling and analysis can be used from the earliest phases of system design to uncover many errors and inconsistencies, and to reach high assurance for critical components with runtime verification.
Analysis of errors in quantization of Weyl-Heisenberg frame expansions and oversampled A/D conversion
Authors: Z. Cvetkovic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Manifestations of robustness of overcomplete expansions, acquired as a result of the redundancy, have been observed for two primary sources of degradation: white additive noise and quantization. These two cases require different treatments since quantization error has a certain structure which is obscured by statistical analysis. The central issue of this paper is a deterministic approach to quantization error analysis, with a focus on redundant Weyl-Heisenberg expansions in L/sup 2/(R). This analysis demonstrates that overcomplete expansions exhibit a higher degree of robustness to quantization error than to a white additive noise, and indicates how this additional robustness can be exploited for improvement of representation accuracy. Further, it shows that under reasonable assumptions quantization error in Weyl-Heisenberg frame expansions can be reduced as /spl par/e/spl par//sup 2/=O(1/r/sup 2/), where r is the frame redundancy factor. 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
Hand Gesture Interaction for Virtual Training of SPG
Authors: Deyou Xu, Wuyun Yao, Yongliang Zhang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

We develop a virtual reality based driving training system of Self-Propelled Gun (SPG). In order to make the interface of the system more powerful and natural, hand gesture interaction need to be incorporated into the system's interface. This paper discusses the use of hand gestures for interaction with the virtual training environment. We employ static hand gestures which coupled with hand translations and rotations as the method of interacting with the virtual training environment. An 18-sensor DataGove is chosen for monitoring the movements of the fingers and the wrist. The feed-forward neural network is developed for recognizing gestures for use in virtual training application of artillery Self-Propelled Gun (SPG). We present our approach for the algorithm design and implementation, and the use of the gestures in our application. The presented hand gesture interaction method can be effectively used in our virtual reality training system of SPG to perform various manipulating tasks in a more fast, precise, and natural way.
The Terrascope Dataset: Scripted Multi-Camera Indoor Video Surveillance with Ground-truth
Authors: C. Jaynes, A. Kale, N. Sanders, E. Grossmann
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

This paper introduces a new video surveillance dataset that was captured by a network of synchronized cameras placed throughout an indoor setting and augmented with groundtruth data. The dataset includes ten minutes of individuals who are moving throughout the sensor network. In addition, three scripted scenarios that contain behaviors exhibtied over a wide-area, such as "gathering for a meeting" or "stealing an object" are included to assist researchers who are interested in wide-area surveillance and behavior recognition. In addition to the video data, a face and gait database for all twelve individuals observed by the network of cameras is supplied. Hand-segmented ground-truth foreground regions are provided for every 500th frame in all cameras and for many sequential frames in two overlapping views. The entrance and exit time of each individual in each camera for one of the scenarios is provided in an XML database. We believe that the dataset will help provide a common development and verifcation framework for the increasing number of research efforts related to video surveillance in multiple, potentially non-overlapping, camera networks.
Teaching Engineering Design with Humanities and Social Sciences Companion Courses
Authors: J. Schumacher, G. Gabriele, J. Newcomer
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The paper documents the first year process and product evaluation of the NSF-sponsored Foundation Coalition (FC) project at Texas A&M University designed to integrate five courses taken by most freshman engineering students: physics, engineering design, calculus, English, and chemistry. In addition to the curriculum integration, the project emphasized cooperative learning, teaming, technology applied to learning, and active learning. One hundred students of the entering freshman engineering students who were calculus-ready were invited on a first-come, first-served basis to participate; all qualified women and minorities who applied were accepted, and others were accepted on a waiting list in order of application. Entry characteristics indicated that the students did not differ from the freshman class. FC student achievement in physics and calculus and attitudes toward coalition engineering goals were assessed both fall and spring. Separate comparison groups were selected fall and spring. Results indicated that the FC group scored almost identically to the comparison group on the initial testing. For the spring testing the FC group outscored the comparison group statistically on the physics and calculus tests, and all scales of the California Critical Thinking Test except Analysis (no difference). Student attitudes improved for the value of homework, lifelong learning, and decreased in their overall evaluation of engineering.
Design of a High-Speed Asynchronous Turbo Decoder
Authors: Pankaj Golani, Georgios D. Dimou, Mallika Prakash, Peter A. Beerel
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

This paper explores the advantages of high performance asynchronous circuits in a semi-custom standard cell environment for high-throughput turbo coding. Turbo codes are high-performance error correction codes used in applications where maximal information transfer is needed over a limitedbandwidth communication link in the presence of data corrupting noise. Specifically we designed an asynchronous high-speed Turbo decoder that can be potentially used for new wireless communications protocols with close to OC-12 throughputs. The design has been implemented using a new static single-track-full-buffer (SSTFB) standard cell library in IBM 0.18ìm technology that provides low latency, fast cycle-time, and more robustness to noise than previously studied single-track full-buffer technology (STFB). A high-speed synchronous counterpart using the same high-speed architecture is designed in the same technology for comparison. The results demonstrate that for a variety of network constraints, the asynchronous design provides advantages in throughput per area. Moreover, the asynchronous design can support very low-latency network constraints not achievable with the synchronous alternative.
Defect-Aware Configurable Computing in Nanoscale Crossbar for Improved Yield
Authors: Somnath Paul, Rajat Subhra. Chakraborty, Swarup Bhunia
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

High defect rate in emerging nano-devices mandates new computational models that can tolerate defects thereby rendering reliability of operation and reasonable manufacturing yield. In a bottom-up system design approach using nano-crossbar applications are typically mapped into a crossbar using either PLA or lookup table (LUT) implementation of a logic circuits. LUT-based implementation has some definite advantages over PLA-based one due its easy reconfigurability. In this paper, we consider a LUT-based logic design paradigm using nano-crossbar and propose a novel application mapping technique that can effectively take advantage of certain defects in the LUTs. The main idea is: 1) to identify and localize the unidirectional stuck-at faults in the LUTs and 2) then map an application in such a way that the a particular defective LUT is used to map a Boolean function which is compatible with the behavior of the LUT. The idea of exploiting certain defects to implement a function (as opposed to discard the defective location as unusable), improves yield considerably in LUT-based configurable nanocomputing. Our simulation with 5X5 and 5X1 LUT shows an average improvement of 87% in number of mapped function over conventional mapping for a defect rate of 10%.
Integrating generative growth and evolutionary computation for form exploration
Authors: Una-May O'Reilly, Martin Hemberg
Venue: Genetic Programming and Evolvable Machines (2007)

We present an algorithmic growth process that is an extension of Lindenmayer's Map L-systems. This growth process relies upon a set of rewrite rules, a map axiom and a geometric interpreter which is integrated with a 3D simulated environment. The outcome of the growth process is a digital surface in 3D space which has "grown" within and in response to its environment. We have developed a complementary evolutionary algorithm that is able to take over the task of generating the rewrite rules set for a growth process. Using a quantitative multi-objective fitness function that evaluates a variety of surface properties, the integrated system (evolutionary algorithm and growth process) can explore and generate diverse and interesting surfaces with a resemblance of organic form. The algorithms have been implemented to create a design tool for architects called Genr8.
Reduced interference distributions for the detection and classification of outside sound source acoustic emissions
Authors: J. C. Mossing
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The problem of detecting and classifying outside sound sources (i.e. diesel engines, rotors, etc.) by their acoustic emissions is applicable to a number of industries. The key to successful detection and classification is selecting harmonically related narrowband peaks in the frequency domain. These harmonically related narrowband features an directly attributed to physical phenomena (i.e. engine firing rates and rotor RPM). The spectral signatures of these sources are non-stationary and require the use of time-frequency analysis techniques to achieve high resolution spectral estimates. This paper demonstrates the use of time-frequency distributions of Cohen's class (1989) on real data for a classification problem. Reduced interference distributions (RIDs), developed by Williams (1989) and others, are successfully applied resulting in high resolution spectral estimates.
Using Argumentative Agents to Manage Communities of Web Services
Authors: Jamal Bentahar, Zakaria Maamar, Djamal Benslimane, Philippe Thiran
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper presents a framework for specifying Web services communities. A Web service is an accessible application that humans, software agents, and other applications in general can discover, compose, and invoke in order to satisfy users' needs like hotel booking. Web services providing the same functionality are gathered into one community, independently of their origins. This framework shows how software agents that are able to argue, negotiate, and reason about Web services can be used to specify these Web services and to manage their respective communities. The use of what we call argumentative agents helps Web services in being better organized within communities and in achieving the goals for which they are conceived. The community is led by a master component, which among others attracts new Web services to the community, retains existing Web services in the community, and identifies the Web services in the community that will participate in composite Web services. All these operations are managed by interacting agents through flexible conversations made up by argumentation, persuasion, and negotiation phases called dialogue games.
Augmenting OAI-PMH repository holdings using search engine APIs
Authors: Martin Klein, Michael L. Nelson, Juliet Z. Pao
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

In this poster, we give the preliminary results of our project to acquire Atmospheric Science Data Center (ASDC) project-related web resources, not with focused crawling, but by using the search engine (SE) APIs directly. We aggregate the results and create archive-ready complex objects.
Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item
Authors: T. Belgacem, M. Hifi
Venue: Computers and Operations Research (2008)

In this paper, we study the sensitivity analysis of the optimum of the knapsack sharing problem (KSP) to the perturbation of the weight of an arbitrary item. We determine the interval limits of the weight of each perturbed item using a heuristic approach which reduces the original problem to a series of single knapsack problems. A perturbed item belongs either to an optimal class or to a non-optimal class. We evaluate the performance of the proposed heuristic on a set of problem instances of the literature. Encouraging results are obtained.
Texture classification with a biorthogonal directional filter bank
Authors: J. G. Rosiles
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Classifying textures is a problem that has been considered by many researchers. Many of the high performance methods are based on extracting features from the textures and performing classification in the feature space. In this paper, we consider the application of a new directional filter bank (DFB) to the problem of texture classification. The DFB is used to provide a compact and efficient representation in which fast classification can be performed using classical statistical methods. The resulting method is shown to yield higher performance than feature-based techniques reported previously. Furthermore, the approach has the added attraction that both the computational complexity and storage requirements are relatively low. Experimental comparisons using the Brodatz texture database are also presented.
Making CORBA objects persistent: the object database adapter approach
Authors: Francisco C. R. Reverbel, Arthur B. Maccabe
Venue: Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3 (1997)

This paper discusses a realization of object persistence in a CORBA-based distributed system. In our approach, persistence of CORBA objects is accomplished by the integration of the ORB with an ODBMS. This approach is not limited to pure object-oriented database systems, as the ODBMS may be a combination of a relational DBMS and an object-relational mapper. The design and implementation of an Object Database Adapter that integrates an ORB and an ODBMS with C++ bindings is presented. The ODA uses delegation (rather than inheritance) to connect user-provided implementation classes and IDL-generated classes. Only the user-defined parts of CORBA objects are actually stored in a database. Their IDL-generated parts are dynamically instantiated, in transient memory, by the ODA. Persistent relationships between CORBA objects within a server are not realized at the CORBA level, but at the level of implementation objects. Database traversals and queries can therefore be executed at ODBMS speeds. The paper discusses in some detail a number of implementation issues, such as caching. ODA support to local transactions, ODA interfaces, and CORBA server organization are also examined.
Frequency-aware energy optimization for real-time periodic and aperiodic tasks
Authors: Xiliang Zhong, Cheng-Zhong Xu
Venue: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems (2007)

Energy efficiency is an important factor in embedded systems design. We consider an embedded system with a dynamic voltage scaling (DVS) capable processor and its system-wide power consumption is dominated by the processor and memory. We present speed assignment polices for a set of periodic/aperiodic tasks that minimize the overall system energy consumption including active and idle power of CPU and other components. A limitation of most DVS-based system-wide energy optimization techniques is that they assume the number of worst-case execution cycles (WCEC) of a task is a constant, independent of CPU frequency. This is not the case when other system components such as memory are taken into account. In this paper, we decompose task execution time into two parts: on-chip inside CPU and off-chip outside the CPU. We propose a frequency-aware system-wide energy minimization approach and establish necessary and sufficient conditions for the optimality. By exploiting properties of the conditions, we derive a bisection algorithm that finds the optimal solution to offline periodict asks in a linear time complexity. We apply a similar analytical approach to online aperiodic tasks scheduling and devise an iterative speed assignment algorithm in the complexity of O(n2). We prove it is optimal among all online algorithms without assumptions about future task releases.
Augmented Reality 3D Interactive Advertisements on Smartphones
Authors: Fadi Chehimi, Paul Coulton, Reuben Edwards
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

Whilst Augmented Reality (AR) has been a prevalent research topic it has proved difficulty to implement and apply in commercial situations as it generally requires complex and expensive hardware. With the proliferation of mobile phones amongst the world population with ever increasing sets of advanced features such as cameras and high resolution screens AR has the opportunity to emerge from laboratories and enter the high street. In this paper we discuss a unique system that will allow complex and highly interactive visual 3- D adverts to be viewed on mobile phones equipped with cameras. The 3-D adverts are contained within a novel visual code design which allows the system to be deployed without the requirement for additional network infrastructure making it both practical and affordable for advertisers.
Identification of dynamic diagnostic models with the use of methodology of knowledge discovery in databases
Authors: Dominik Wachla, Wojciech A. Moczulski
Venue: Engineering Applications of Artificial Intelligence (2007)

This paper deals with an approach to knowledge discovery in databases applied in order to identify a dynamic model of a real-existing machine. The problem considered within the paper is how to identify dynamic models suitable for model-based diagnosing of a physical object. A special attention is paid to identification on unsupervised way, while big databases collected by a SCADA system is handled. In the paper a method of identification of dynamic models of objects and processes is presented. The usefulness of the method in technical diagnostics are shown. The elaborated method of analysis of quantitative dynamic data is based on applications of accessible methods of knowledge discovery in databases. The essence of the method is to project values of considered set of attributes into the so-called multidimensional space of regressors. In order to select the subset of relevant features the genetic algorithm was used. Knowledge was induced using the support vector machines (SVM) method. The AIC measure as well as our own heuristic function were applied as evaluation criteria. The method was applied in a process of discovery of a model of changes of temperature of a pump. Within framework of the research, data gathered by means of an industrial system registering data on a peculiar object, which was deep-well pumping station, was analyzed.
Iterative multi-user algorithm for convolutionally coded asynchronous DS-CDMA systems: turbo-CDMA
Authors: A. Roumy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A low-complexity and iterative receiver is proposed for the CDMA uplink, consisting of a low-complexity equalizer and single-user decoders. Iterations are used to feed the equalizer with more reliable data, which improves performance. This receiver called turbo-CDMA is aimed to eliminate MUI almost completely in the presence of multipath and to be robust to the near-far effect. Simulation results show that the performance approaches single-user performance at moderate and also low signal-to-noise ratios, even for a severe distortion channel.