ppxscal/embedding_network huggingface dataset:
ALIP: The Automatic Linguistic Indexing of Pictures System
Authors: Jia Li, James Z. Wang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this demonstration, we present the Automatic Linguistic Indexing of Pictures (ALIP) system. The system annotates images with linguistic terms, chosen among hundreds of such terms. The system uses a wavelet-based approach for feature extraction, a statistical modeling process for training, and a statistical significance processor to annotate images. We implemented and tested our ALIP system on a photographic image database of 600 different concepts, each with about 40 training images. The ALIP system has been used to annotate about 60,000 photographic images. In this demonstration, we illustrate the algorithms in the system and show the annotation results. With distributed computation, the annotation of an image can be provided in real-time. The demonstration system is available online at the site http://riemann.ist. psu.edu .
A Speed Based Active Queue Management Scheme
Authors: Jian-guo Zhou, Xiao Chen, Pu-liu Yan, Jing Wu, Gui-wen Yang
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

This paper presents a speed based active queue management scheme. This scheme predicts the incoming and outgoing speed of every active flow in the next sample intervals according to the history data. And then with the queue length of every flow at the end of last a few intervals, predicted incoming and outgoing rate and expected queue length, drop probability in this interval is calculated. The goal of this scheme is to achieve both stabilized queue length and per-flow fairness. Through ns-2 simulation, we compare SBAQM against FRED and SRED and obtain satisfying results.
Parallel Programming Models for a Multi-Processor SoC Platform Applied to High-Speed Traffic Management
Authors: Pierre G. Paulin, Chuck Pilkington, Michel Langevin, Essaid Bensoudane, Gabriela Nicolescu
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

In this paper, we describe the MultiFlex multi-processor SoC programming environment, with focus on two programming models: a distributed system object component (DSOC) message passing model, and a symmetrical multi-processing (SMP) model using shared memory. The MultiFlex tools map these models onto the StepNP multi-processor SoC platform, while making use of harware accelerators for message passing and task scheduling. We present the results of mapping an Internet traffic management application, running at 2.5Gb/s.
Traffic protection and restoration schemes in core routers/switches
Authors: Deepak Mathur
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

As the usage of Internet is getting more widespread, users expect its availability to approach that of telephone networks. From the perspective of the users, they should be able to communicate in spite of hardware and software failures, network maintenance and upgrades. Even the quality of service should be maintained for better than 99.9% of time for high priority traffic. To provide such high availability, Internet Service Providers not only install network equipment that is highly reliable, but also provide alternate paths of communication between switches by reserving resources on the network that are only fully utilized in case of failure to redirect traffic away from the point of failure. This paper provides overview of the protection and restoration schemes present in the routers in the core of the network and guidelines of how to use these schemes.
The Relevance of Long-Range Dependence in Disk Traffic and Implications for Trace Synthesis
Authors: Bo Hong, Tara M. Madhyastha
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Accurate disk workloads are crucial for storage systems design, but I/O traces are difficult to obtain, unwieldy to work with, and unparameterizable. I/O traces are often bursty and difficult to characterize. Although good models of I/O workloads would be extremely useful, such bursty traces cannot accurately be modeled using exponential or Poisson arrival times. Much experimental evidence suggests that I/O traces are self-similar, which researchers have hoped might help to model bursty traces. In this paper, we show that self-similarity at large time scales does not significantly affect disk behavior with respect to response times. This allows us to generate synthetic arrival patterns at relatively small time scales, improving the accuracy of trace generation. The relative error of our method, with input parameters suitable for the workload, ranges from approximately 8% to 12%.
Using context-aware computing to reduce the perceived burden of interruptions from mobile devices
Authors: Joyce Ho, Stephen S. Intille
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

The potential for sensor-enabled mobile devices to proactively present information when and where users need it ranks among the greatest promises of ubiquitous computing. Unfortunately, mobile phones, PDAs, and other computing devices that compete for the user's attention can contribute to interruption irritability and feelings of information overload. Designers of mobile computing interfaces, therefore, require strategies for minimizing the perceived interruption burden of proactively delivered messages. In this work, a context-aware mobile computing device was developed that automatically detects postural and ambulatory activity transitions in real time using wireless accelerometers. This device was used to experimentally measure the receptivity to interruptions delivered at activity transitions relative to those delivered at random times. Messages delivered at activity transitions were found to be better received, thereby suggesting a viable strategy for context-aware message delivery in sensor-enabled mobile computing devices.
Combustion Chamber Fluid Dynamics and Hypergolic Gel Propellant Chemistry Simulations for Selectable Thrust Rocket Engines
Authors: Michael J. Nusca, Michael J. McQuaid
Venue: Proceedings of the 2004 Users Group Conference (2004)

The Army is developing gelled bipropellants and tactical missile propulsion systems that utilize these propellants for future combat systems. The use of hypergolic gel propellants introduces new capabilities for selectable thrust missiles while at the same time introducing new challenges in combustion control, one of which is the mixing of oxidizer and fuel to obtain maximum performance without increasing the size of the engine. One of the Army's leading propulsion candidate's, the impinging stream vortex engine (ISVE), has generated excellent performance test data. Since the ISVE is a new concept, analytical models are just beginning to emerge. However, in order to fully exploit the performance advantages of the ISVE it is desirable to understand the underlying flow physics of the engine. This paper describes a high performance computing methodology that is producing simulations of the ISVE using computational fluid dynamics to model the chemically reacting flow within the engine and computational chemistry to characterize the hypergolic bipropellants.
Using Dynamic Adaptability to Protect Mobile Agents Code
Authors: Salima Hacini
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Mobile agents must be prepared to execute on different hosts where, according to specific environmental conditions, they will adopt different behaviors. The aim of this paper is to describe how a mobile agent equipped with a flexible capacity, can adapt its execution with the request and security found (in a visited environment). Based on its security, The agent becomes able to adapt itself to the environment where it is currently running, by composing only appropriate modules. This allows enhancement of the privacy of the agent code.
"One Size Fits All": An Idea Whose Time Has Come and Gone
Authors: Michael Stonebraker, Ugur Cetintemel
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

The last 25 years of commercial DBMS development can be summed up in a single phrase: "One size fits all". This phrase refers to the fact that the traditional DBMS architecture (originally designed and optimized for business data processing) has been used to support many data-centric applications with widely varying characteristics and requirements. In this paper, we argue that this concept is no longer applicable to the database market, and that the commercial world will fracture into a collection of independent database engines, some of which may be unified by a common front-end parser. We use examples from the stream-processing market and the data-warehouse market to bolster our claims. We also briefly discuss other markets for which the traditional architecture is a poor fit and argue for a critical rethinking of the current factoring of systems services into products.
High-Accuracy DNS of Supersonic Base Flows and Control of the Near Wake
Authors: Richard D. Sandberg, Hermann F. Fasel
Venue: Proceedings of the 2004 Users Group Conference (2004)

Large-scale numerical simulations of axisymmetric, supersonic base flows were conducted at various Reynolds numbers. Direct Numerical Simulations (DNS) were employed to investigate the hydrodynamic stability behavior of the near-wake region. As a consequence of physical flow instabilities, large coherent structures evolve that have a significant impact on the mean flow wand and are responsible for a considerable amount of base-drag. It is demonstrated that the deliberate exclusion or reinforcement of certain helical modes can lead to a rise inbas -pressure and thus decrease the drag of a blunt body at supersonic speed. For these investigations, a high-order accurate compressible Navier-Stokes solver in cylindrical coordinates with high parallel efficiency was developed and employed on the SGI Origin 3900 shared memory complex at the ERDC MSRC. In addition to providing vital insight into the physical mechanisms in supersonic base flows, the DNS results are intended for use as benchmark data for the development of a Flow Simulation Methodology (FSM) for high Reynolds number turbulent flows.
Resistive-Open Defect Influence in SRAM Pre-Charge Circuits: Analysis and Characterization
Authors: Luigi Dilillo, Patrick Girard, Serge Pravossoudovitch, Arnaud Virazel
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

In this paper, we present an exhaustive study on the effects of resistive-open defects in the pre-charge circuits of SRAM memories. In particular, we have analyzed the influence of resistive-opens placed in different locations of these circuits. In SRAM memories, the pre-charge circuits operate the pre-charge and equalization at a certain voltage level, in general Vdd, of all the couples of bit lines of the memory array. This action is essential in order to ensure correct read operations. Each defect studied in this paper disturbs the pre-charge circuit in a different way and for different resistive ranges, but the produced effect on the normal memory action is always the perturbation of the read operations. This faulty behavior can be modeled with Un-Restored Write Faults (URWFs) and Un-Restored Read Faults (URRFs), because there is an incorrect pre-charge/equalization of the bit lines after a write or read operation that disturbs the following read operation. In the last part of the paper, we demonstrate that the test of URWFs is more rentable in terms of resistive defect detection than that of URRFs.
The Modified pbM-Estimator Method and a Runtime Analysis Technique for the RANSAC Family
Authors: Stas Rozenfeld, Ilan Shimshoni
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Robust regression techniques are used today in many computer vision algorithms. Chen and Meer recently presented a new robust regression technique named the projection based M-estimator. Unlike other methods in the RANSAC family of techniques, where performance depends on a user supplied scale parameter, in the pbM-estimator technique this scale parameter is estimated automatically from the data using kernel smoothing density estimation. In this work we improve the performance of the pbM-estimator by changing its cost function. Replacing the cost function of the pbM-estimator with the changed one yields themodified pbM-estimator. The cost function of the modified pbM-estimator is more stable relative to the scale parameter and is also a better classifier. Thus we get a more robust and effective technique. A new general method to estimate the runtime of robust regression algorithms is proposed. Using it we show, that the modified pbM-estimator runs 2 - 3 times faster than the pbM-estimator. Experimental results of fundamental matrix estimation are presented demonstrating the correctness of the proposed analysis method and the advantages of the modified pbM-estimator.
Tech-tiles: exploring texture
Authors: Tim Blackwell, Janis Jefferies
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This paper describes the tech-tile project: an exploration of visual and sonic texture enabled by a mapping of textile images into sound. The mapping from a rectangular element (a tile) of an image onto a sonic event is explained, and it is demonstrated that the result gives interesting and distinctive sonic textures and preserves, in part, the visual structure of the image. An entire image can be converted to a single tech-tile, which can be performed as a composition, or a swarm of small tiles can fly over the image, generating a sonic improvisation.
Drawing evaluation into design for mobile computing: a case study of the Renwick Gallery&#x2019;s Hand Held Education Project
Authors: Kirsten Boehner, Geri Gay, Claire Larkin
Venue: International Journal on Digital Libraries (2005)

We present a detailed case study of the design, launch, and evaluation of a handheld mobile computing guide for visitors to the Smithsonian American Art Museum&#x2019;s Renwick Gallery. Of particular emphasis is integrating methods and tools of evaluation into the process of designing for new visitor experiences. Using a method of reflective design and evaluation incorporating interviews, surveys, observation, and clickstream analysis, we uncover assumptions and hypothesis for further testing. Finally, we discuss the cross-over between physical navigation of museum spaces and information navigation of online museum data.
Coordination of Multiple Agents for Probabilistic Object Tracking
Authors: Roozbeh Mottaghi, Shahram Payandeh
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In this paper, we develop a new tracking approach which is based on cooperation and coordination of multiple agents which are pan-tilt-zoom cameras to optimize the cost of tracking and communication while simultaneously focus on the details of the object of interest. Each agent is able to track the object individually but the problem arises when the object goes suddenly out of the field of view of one agent because of an occlusion or an unexpected event. So each agent has to decide to take an action among a set of finite possible actions to overcome this situation in a way that optimizes the task of tracking.
Energy management in software-controlled multi-level memory hierarchies
Authors: O. Ozturk, M. Kandemir
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Performance and energy consumption behavior of embedded applications are increasingly being dependent on their memory usage/access patterns. Focusing on a software-managed, application-specific multi-level memory hierarchy, this paper studies three different memory hierarchy management schemes from both energy and performance angles. The first scheme is pure performance-oriented and tuned for extracting the maximum performance possible from the software-managed multi-level memory hierarchy. The second scheme is built upon the first one but it also reduces leakage by turning-on and off memory modules (i.e., different memory levels) at appropriate program points during execution based on the data access pattern information extracted by the compiler. The last scheme evaluated is oriented towards further reducing leakage energy, as well as dynamic energy, by modifying the data transfer policy (data access pattern) of the performance-oriented scheme. Our empirical analysis indicates that it is possible to reduce leakage consumption of the application-specific multi-level memory hierarchy without seriously impacting its performance, and that one can achieve further savings by modifying data transfer pattern across the different levels of the memory hierarchy.
Acquiring Linear Subspaces for Face Recognition under Variable Lighting
Authors: Kuang-Chih Lee, Jeffrey Ho, David J. Kriegman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

Previous work has demonstrated that the image variation of many objects (human faces in particular) under variable lighting can be effectively modeled by low-dimensional linear spaces, even when there are multiple light sources and shadowing. Basis images spanning this space are usually obtained in one of three ways: A large set of images of the object under different lighting conditions is acquired, and principal component analysis (PCA) is used to estimate a subspace. Alternatively, synthetic images are rendered from a 3D model (perhaps reconstructed from images) under point sources and, again, PCA is used to estimate a subspace. Finally, images rendered from a 3D model under diffuse lighting based on spherical harmonics are directly used as basis images. In this paper, we show how to arrange physical lighting so that the acquired images of each object can be directly used as the basis vectors of a low-dimensional linear space and that this subspace is close to those acquired by the other methods. More specifically, there exist configurations of k point light source directions, with k typically ranging from 5 to 9, such that, by taking k images of an object under these single sources, the resulting subspace is an effective representation for recognition under a wide range of lighting conditions. Since the subspace is generated directly from real images, potentially complex and/or brittle intermediate steps such as 3D reconstruction can be completely avoided; nor is it necessary to acquire large numbers of training images or to physically construct complex diffuse (harmonic) light fields. We validate the use of subspaces constructed in this fashion within the context of face recognition.
View-based tool integration in database-centered environments
Authors: V. Venugopal
Venue: ACM SIGSMALL/PC Notes (1990)

Database-centered environment architectures differ significantly from file-based architectures. Consequently they require a different set of primitives for tool support. This paper describes a form of tool composition called cotools which provides many of the benefits of UNIX pipes in terms of being able to reuse existing tools in tool composites, and allowing tools to operate concurrently ad incrementally on data. However, the tool language and the composition model is tailored to provide these benefits in a database-centered environment where tools do not directly communicate with each other. The effect of communication is achieved by allowing member tools in a cotool to access common data in a coordinated manner while allowing the changes made to data by one tool immediately visible to other tools in the cotool.Since database transactions normally maintain consistency in a database by disallowing interleaved data manipulation amongst separate applications, certain modifications to the concept of transactions are required. One of goals from a systemic point of view is to allow the benefits of tool cooperation without completely violating the transactions idea, which is a very clean mechanism for maintaining data consistency in a shared data store.
3D adaptive motion vector coding integrated with block-based adaptive interpolation filter
Authors: Hideaki Kimata, Masaki Kitahara, Yoshiyuki Yashima
Venue: Systems and Computers in Japan (2004)

Since fractional pixel accuracy motion compensation precisely expresses the motion information, it is widely used for improving coding efficiency in the International Standard video coding methods for the MPEG and H.26x series. When the motion accuracy is ascertained more precisely, motion information becomes more exact, and consequently, prediction efficiency can be improved. The problem, however, is that the amount of bits for expressing large motion increases. Accordingly the adaptive interpolation filter (AIF) method, which changes the filter characteristics for half-pixel positions on quarter-pixel motion compensation, was proposed. This technique also changes the image at quarter-pixel positions and makes the motion accuracy more precise. In conventional studies, the AIF method was used per frame or macroblock that was not the motion compensation block, because the overhead problem of filter indication has never been resolved. In this paper, we propose the 3D motion vector coding technique with the block-based adaptive interpolation filter. This method integrates filter indication into motion vector coding and predicts the filter indication adaptively, so that it reduces the overhead of filter indications. In this method, the filter is changed per motion compensation block so that the prediction efficiency is improved per motion compensation block. We also demonstrate in simulations that this method achieves higher coding efficiency than the normal H.264 coding method. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(14): 10&ndash;20, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20125
Combinatorial Auction-Based Protocols for Resource Allocation in Grids
Authors: Anubhav Das, Daniel Grosu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

In this paper, we introduce the combinatorial auction model for resource management in grids. We propose a combinatorial auction-based resource allocation protocol in which a user bids a price value for each of the possible combinations of resources required for its tasks execution. The protocol involves an approximation algorithm for solving the combinatorial auction problem. We implement the new protocol in a simulated environment and study its economic efficiency and its effect on the system performance.
Metadata driven code generation using .NET framework
Authors: Ivo Damyanov, Nick Holmes
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In this paper incorporating manual and automatic code generation is discussed. A solution for automatic metadata-driven code generation is presented illustrated with multi tier Enterprise Resource Planning System. We intend to make our solution available to public in order to encourage investigation of code generation and schema-driven tools for .NET Framework.