ppxscal/embedding_network huggingface dataset:
Performance Analysis Framework for Layout Analysis Methods
Authors: A. Antonacopoulos, D. Bridson
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper presents a new framework for in-depth analysis of the performance of layout analysis methods. Contrary to existing approaches aimed at evaluation or benchmarking, the proposed framework provides detailed information at various levels that can be used by method developers to identify specific problems and improve their work. Complex layouts are supported as well as the flexible configuration of goal-oriented performance analysis scenarios. The comparison of segmentation results against the ground truth is performed in a very efficient way based on a decomposition of any region shape into an interval-based description. The framework has been validated using the dataset and method results of the ICDAR2005 Page Segmentation Competition.
Using DaVinci Technology for Digital Video Devices
Authors: Deepu Talla, Jeremiah Golston
Venue: Computer (2007)

It's not practical for one SoC processor to fit all equipment and meet today's aggressive performance, power, and cost targets. The DaVinci integrated portfolio of processors, software, and tools offers support for developing a broad spectrum of optimized digital video equipment.
A Novel Measure of Uncertainty for Mobile Robot SLAM with Rao-Blackwellized Particle Filters
Authors: J. L. Blanco, J. A. Fernández-Madrigal, J. Gonzalez
Venue: International Journal of Robotics Research (2008)

Rao-Blackwellized particle filters (RBPFs) are an implementation of sequential Bayesian filtering that has been successfully applied to mobile robot simultaneous localization and mapping (SLAM) and exploration. Measuring the uncertainty of the distribution estimated by a RBPF is required for tasks such as information gain-guided exploration or detecting loop closures in nested loop environments. In this paper we propose a new measure that takes the uncertainty in both the robot path and the map into account. Our approach relies on the entropy of the expected map (EM) of the RBPF, a new variable built by integrating the map hypotheses from all of the particles. Unlike previous works that use the joint entropy of the RBPF for active exploration, our proposal is better suited to detect opportunities to close loops, a key aspect to reduce the robot path uncertainty and consequently to improve the quality of the maps being built. We provide a theoretical discussion and experimental results with real data that support our claims.
Power, Thermal, and Reliability Modeling in Nanometer-Scale Microprocessors
Authors: David Brooks, Robert P. Dick, Russ Joseph, Li Shang
Venue: IEEE Micro (2007)

Power is the source of the greatest problems facing microprocessor designers. Rapid power variation brings transient errors. High power densities bring high temperatures, harming reliability and increasing leakage power. The wages of power are bulky, short-lived batteries, huge heat sinks, large on-die capacitors, high server electric bills, and unreliable microprocessors. Optimizing power depends on accurate and efficient modeling that spans different disciplines and levels, from device physics, to numerical methods, to microarchitectural design.
Negotiated Coscheduling in a P2P Based HPC Platform
Authors: Fei Luo, Hai Jin, Xiaofei Liao, Qin Zhang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

To promote peer-to-peer (P2P) based high performance computing (HPC), new scheduling strategies are necessarily designed to break the limitation in current systems, which only support applications with independent tasks. Therefore, we introduce a negotiated coscheduling policy, which supports applications with interactive tasks in a structured P2P based HPC platform, P2HP-2. In this policy, with the help of a project description file, a negotiated dispatching metric with two priorityentitling algorithms is proposed, which distributes tasks across computing resources. The coscheduling is further processed with two steps: spinning for dependent data and performing tasks' computation. Furthermore, a reliable message-event transmission method and a load balancer are developed to improve the performance. All our preliminary results show that this scheduling policy is efficient and fault-tolerant to support applications with task-dependent relationships.
The Design and Implementation of a Scalable Wireless Video Streaming System Adopting TCP Transmission Mode
Authors: Ying Chai, Dejian Ye
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Streaming services on wireless network is being popular since the bandwidth and QoS on wireless net- work has been improved. However, the dynamic fluctu- ated bandwidth, higher error rate and sharp delay jit- ter on wireless channel cause trouble to the real-time demand of streaming services. The wireless streaming media system aims at mobile users must also consider the large scale number of the potential users and the fast growth in the future. To solve these problems, we propose a scalable wireless video streaming system adopting TCP transmission mode in this paper. Our proposed system is compatible with the RTSP/RTP pro- tocols. It adopts RTP-on-TCP transmission mode to improve the quality of service on wireless network. It takes a hybrid centralized-distributed architecture on the server side to support the growth of users. Stream- ing services such as VOD are supported by the system with a wide range of media bitrates and several high- performance compression standards such as H264 and AMR.
Enhanced System Design Solutions for Wireless Sensor Networks applied to Distributed Environmental Monitoring
Authors: Gianfranco Manes, Romano Fantacci, Francesco Chiti, Michele Ciabatti, Giovanni Collodi, Davide Di Palma, Antonio Manes
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The adoption of Wireless Sensor Networks (WSN) for wide area environmental monitoring is currently considered one of the most challenging application scenario for this emerging technology. The promise of an unmanaged, self-configuring and self-powered wireless infrastructure, with a continuously decreasing cost per unit, attracts the attention of both final users and system integrators, replacing previously deployed wired solutions and opening new business opportunities. This challenge might be afforded by resorting to a complete system level design to jointly address and optimize all the involved aspects. Besides, the design guide lines need to be inspired by the application requirements rather than technology driven. Following this approach, this paper presents an overall solution focusing both on node, network and remote user interface issues. The proposed platform in finally applied to to a realistic user defined scenario oriented to agro-food production phase monitoring within GoodFood Integrated Project. The results of the validation phase presented highlight remarkable advantages both in terms of cost and complexity reduction and experienced QoS enhancement as well and, consequently, validating the WSN technology adoption.
Mesh optimizatin: Anisotropic or Uniform Meshes for Reaction Diffusion Problems?
Authors: Kumar Khattri Sanjay, Sylvia Encheva
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

We present a method for generating anisotropic meshes for reaction diffusion problems. A conservative finite dif- ference method is used for discretizing reaction diffusion problems on these meshes. We compare our approach with the traditional uniform refinement technique, and show that for problems with anisotropic solution, anisotropic meshes are ideal.
Frequency-domain Regularized Deconvolution for Images with Stripe Noise
Authors: Zuoguan Wang, Yutian Fu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper presents a new approach to the deconvolution for images contaminated by stripe noise. Inspired by the 2-D power spectrum distribution property of stripe noise in the frequency domain, we construct a novel regularized inverse filter which allows the algorithm to suppress the amplification of stripe noise in the Fourier inverse step and further get rid of most of them, and a mirror-wavelet denoising is followed to remove the left colored noise. In simulations with striped images, this algorithm outperforms the traditional mirror-wavelet based deconvolution in terms of both visual effect and SNR comparison, only at the expense of slightly heavier computation load. The same idea about regularized inverse filter can also be used to improve other deconvolution algorithms, such as wavelet packets and wiener filters, when they are employed to images stained by stripe noise.
On Whistle Blowing
Authors: H. T. Larson
Venue: Computer (1971)

Recent publicity has been widespread regarding Mr. Ralph Nader's "call for responsipility," of encouragement to "blow the whistle" on the part of scientists, engineers and other professionals. A day long meeting was held in washington on 30 January and was reported widely (see. reference 1, 2,and 4). In fact, according to the New York Times, this call will be exemplified by an address by Mr. Nader on May 3 before the Writers Guild of America ( see, reference 3).
Stability Analysis Of Timing Acquisition Methods With Multi-hypothesis In Indoor UWB Multipath And MAI Channel
Authors: Hongjiang Wang, Fei Ji, Shengming Jiang, Liying Huang, Gang Wei
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The paper analyzes the effect of timing acquisition methods with multi-hypothesis on the UWB system performance, including the BER and user number tolerance, in the multipath and multiuser channel environment. To our knowledge, it is the first time to investigate the stability problem about multi-hypothesis timing acquisition schemes. In the multipath UWB systems, the multi-hypothesis timing acquisition strategy has been considered as the most effective method, which takes advantage of the indoor multipath propagation characteristics and considers more than one hypothesized phase as a good estimate of the true signal phase. That means there exists a multipath set where any a path can be locked on by the receiver. The strategy can contribute to speeding up the timing acquisition process through some efficient search approaches at the cost of timing accuracy. However, it is sure that the relative delay between the locked non-strongest path and the strongest one will have the effect on the system performance. In the paper, we have analyzed the effect of the different relative path delay on the BER and user number tolerance for DS-UWB systems employing the different PN sequences. Numerical results show that both the relative path delay and the cross-correlation performance of the PN sequence can degrade the performance of DS-UWB systems.
Detection of Bugs by Compiler Optimizer Using Macro Expansion of Functions
Authors: D. T. V. Ramakrishna Rao
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

A new static analysis based approach is proposed to detect interface bugs in software. Unlike existing static analyses, which suggest new tools, this approach does not suggest a new tool, but leverages the optimizer which is part of the compiler already used by programmers. To facilitate the optimizer in detecting the interface bugs of a function, a macro is created which encodes the conditions to be checked for the function arguments. The approach is found to be effective when applied on two already well-tested commercial software systems, where it detected more than 50 bugs.
An open source primer
Authors: Elizabeth Dykstra-Erickson, Yann Cheri
Venue: interactions (2007)

Design projects come in all sizes. Many interaction designers have responsibility for a part of a larger application; many have sole responsibility for the overall experience of an application; and many have responsibility for the care and nurturing of a user experience, where others are free to chime in and change things. This last point reflects the nature of open source: You never know what someone will think up next, or how someone may change what you have already done. Working successfully as a designer in an open source project means a huge amount of freedom and a lot of homework. You can do almost anything the technology will permit, because that's the point: It's an open and collaborative environment, where anyone can make a contribution. But it's not without rules, and that's where the homework comes in. For designers, it's imperative to understand where the flexibility lies and where the rules apply. The articles in this section address project management, licensing options, and some of the community issues around open source software from experts working in this field. We also have a case study from the OpenOffice project and a technical introduction to SMIL, an open format for interactivity. We extend our sincere thanks to all of our contributors, and we hope you enjoy this exploration into open source.
Research of Cluster Parallel Computing Model Based on Mobile Agent
Authors: Liu Meijing, Jiang Bo
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

This paper presents a parallel computing model based on mobile agent for the computer cluster system on the basis of the technology of mobile agent and parallel computing. The communication way of mobile agents is also analyzed. At last, an information retrieval experiment is carried out by Mobile Agent and C/S methods .The corresponding experiments results and compare conclusion are given.
Visual Surveillance Metadata Management
Authors: Petr Chmelar, Jaroslav Zendulka
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The paper deals with a solution for visual surveillance metadata management. Data coming from many cameras is annotated using computer vision units to produce metadata representing moving objects in their states. It is assumed that the data is often uncertain, noisy and some states are missing. The solution consists of the following three layers: (a) data cleaning layer -- improves quality of the data by smoothing it and by filling in missing states in short sequences referred to as tracks that represent a composite state of a moving object in a spatiotemporal subspace followed by one camera. (b) Data integration layer -- assigns a global identity to tracks that represent the same object. (c) Persistence layer -- manages the metadata in a database so that it can be used for online identification and offline querying, analyzing and mining. A Kalman filter technique is used to solve (a) and a classification based on the moving object's state and its visual properties is used
Periodic solution for a class of higher-dimension impulsive functional differential equations with parameter
Authors: J. G. Yin, M. J. Gai, G. Zhou, X. H. Hou
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, by employing a fixed-point theorem in cones, we study a kind of higher-dimension impulsive functional differential equation with parameter as follows: x' = A\left( t \right)x\left( t \right) + \lambda f\left( {t,x_t } \right),t \ne \tau _k , \Delta x|_{t = \tau _k }= I_k \left( {x\left( {\tau _k } \right)} \right),t = \tau _k ,k \in Z_+.some results on the existence of periodic solutions are obtained.
Nugget discovery in visual exploration environments by query consolidation
Authors: Di Yang, Elke A. Rundensteiner, Matthew O. Ward
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Queries issued by casual users or specialists exploring a dataset often point us to important subsets of the data, be it clusters, outliers or other meaningful features. Capturing and caching such queries (henceforth called nuggets) has many potential benefits, including the optimization of the system performance and the search experience of users. Unfortunately, current visual exploration systems have not yet tapped into this potential resource of identifying and sharing important queries. In this paper, we introduce a query consolidation strategy aimed at solving the general problem of isolating important queries from the potentially huge amount of queries submitted. Our solution clusters redundant queries caused by exploration-style query specification, which is prevalent in data exploration systems. To measure the similarity between queries, we designed an effective distance metric that incorporates both the query specification and the actual query result. To overcome its high complexity when comparing queries with large result sets, we designed an approximation method, which is efficient while still providing excellent accuracy. A user study conducted on multivariate data sets comparing our proposed technique to others in the literature confirms that the proposed distance metric indeed matches well with users' intuition. As proof of feasibility, we integrated our proposed query consolidation solution into the Nugget Management System (NMS) framework [22], which is based on a visual exploration system XmdvTool. A second user study indicates that both the efficiency and accuracy of users' visual exploration are enhanced when supported by NMS.
Detecting Arithmetic of Passenger's Location Based on Image Processing
Authors: Ying Yang, Jing Sheng, Wei Zhou
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Airbag deployments during automobile accidents can cause injury and even death if the occupant is an improper size or in an improper position. Because of this, steps have been taken to make airbag deployment safer by adding adaptive deployment decision capabilities. This paper presents a new method to obtain occupants' pose and location by using a CCD camera fixed in a cabin. The face location is the target of our initial focus, as it provides a good estimate of the occupant's head position and is the most critical part of the body in airbag deployment. The occupants' head locations are detected through obtaining their face position. First, establish criterion templates to represent different size of occupants, that is, children, the 5th percentage of female, the 50th percentage of male and the 90th percentage of male. Then compare the occupants' stature with the criterion templates. The airbag can be fully deployed, partially deployed or nor deployed at all according to occupants' size and location. This arithmetic has the advantage of simple, accuracy, real time and less sensitive to illumination. Experimental results show that the recognition accuracy of the proposed approach is better. The total correct classification rate is 96.5%. It has great significance to maximum protect occupants' lives according to occupants' stature to control the deployment of airbag.
An FFT-based companding front end for noise-robust automatic speech recognition
Authors: Bhiksha Raj, Lorenzo Turicchia, Bent Schmidt-Nielsen, Rahul Sarpeshkar
Venue: EURASIP Journal on Audio, Speech, and Music Processing (2007)

We describe an FFT-based companding algorithm for preprocessing speech before recognition. The algorithm mimics tone-to-tone suppression and masking in the auditory system to improve automatic speech recognition performance in noise. Moreover, it is also very computationally efficient and suited to digital implementations due to its use of the FFT. In an automotive digits recognition task with the CU-Move database recorded in real environmental noise, the algorithm improves the relative word error by 12.5% at -5 dB signal-to-noise ratio (SNR) and by 6.2% across all SNRs (-5 dB SNR to +15 dB SNR). In the Aurora-2 database recorded with artificially added noise in several environments, the algorithm improves the relative word error rate in almost all situations.
Discovering the shared understanding dynamics of large software teams
Authors: Jorge Aranda, Ramzan Khuwaja, Steve Easterbrook
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Reaching project goals demands from team members the creation and communication of detailed and vastly heterogeneous project information. Although no team member needs to know every piece of project information, each of them depends extensively on knowledge generated by other parties. Their aggregated information-seeking and information-sharing activities form a web of interactions that develops the team's shared understanding of their project. Current approaches to study this phenomenon are unsatisfactory, as they tend to overlook its inherent complexity. To address this issue, we present a proposal to analyze shared understanding dynamics that draws from cognitive and organizational theories, as well as from Kruchten's 4+1 views of software architecture.
The Locally Weighted Bag of Words Framework for Document Representation
Authors: Guy Lebanon, Yi Mao, Joshua Dillon
Venue: The Journal of Machine Learning Research (2007)

The popular bag of words assumption represents a document as a histogram of word occurrences. While computationally efficient, such a representation is unable to maintain any sequential information. We present an effective sequential document representation that goes beyond the bag of words representation and its n-gram extensions. This representation uses local smoothing to embed documents as smooth curves in the multinomial simplex thereby preserving valuable sequential information. In contrast to bag of words or n-grams, the new representation is able to robustly capture medium and long range sequential trends in the document. We discuss the representation and its geometric properties and demonstrate its applicability for various text processing tasks.
Efficient Process of Top-k Range-Sum Queries over Multiple Streams with Minimized Global Error
Authors: Hao-Ping Hung, Kun-Ta Chuang, Ming-Syan Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Due to the resource limitation in the data stream environments, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential ability of a Data Stream Management System (DSMS). In the literature, recent research has been elaborated upon minimizing the local error metric of an individual stream. However, many emergent applications, such as stock marketing and sensor detection, also call for the need of recording multiple streams in a commercial DSMS. As shown in our thorough analysis and experimental studies, minimizing global error in multiple-stream environments leads to good reliability for DSMS to answer the queries; in contrast, only minimizing local error may lead to significant loss of query accuracy. As such, we first study in this paper the problem of maintaining the wavelet coefficients of multiple streams within collective memory so that the predetermined global error metric is minimized. Moreover, we also examine a promising application in the multistream environment, i.e., the queries for top-k range sum. We resolve the problem of efficient top-k query processing with minimized global error by developing a general framework. For the purposes of maintaining the wavelet coefficients and processing top-k queries, several well-designed algorithms are utilized to optimize the performance of each primary component of this general framework. We also evaluate the proposed algorithms empirically on real and simulated data streams and show that our framework can process top-k queries accurately and efficiently.