ppxscal/embedding_network huggingface dataset:
Goal-Directed Context Validation for Adaptive Ubiquitous Systems
Authors: Chang Xu, S. C. Cheung, W. K. Chan
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Ubiquitous systems adaptive to their dynamic environments find their roles useful in many modern applications. Their adaptability, however, can be badly impaired if the environments are incorrectly perceived. Our earlier work has proposed a technique to evaluate the constraints that govern the consistency of perceived environmental information. This technique generates links as the evaluation result to explain how the constraints are satisfied or violated. However, the technique may generate redundant links and may not effectively utilize resources in both time and space. To address the problem, this paper presents a goaldirected technique to enhance our earlier link generation semantics. We evaluate the technique analytically, and show how the enhanced semantics helps reduce the number of generated redundant links for context validation.
Why and how prefiltering for discrete multiwavelet transforms
Authors: Xiang-Gen Xia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We study why prefiltering is necessary for discrete multiwavelet transforms. We propose a method to generate prefilters given a set of multiwavelet filterbanks, where they are called good prefilters.
Spectrum-blind minimum-rate sampling and reconstruction of multiband signals
Authors: Ping Feng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We propose a universal sampling pattern and corresponding reconstruction algorithms that guarantee well-conditioned reconstruction of all multiband signals with a given spectral occupancy bound without prior knowledge of the spectral support. It is shown that such a universal sampling pattern can asymptotically achieve the Nyquist-Landau (1957) minimal sampling rate. Also, the new design method replaces the nonaliasing or packability criterion for a reconstructive sampling pattern with a more lenient criterion, allowing reconstruction of signals aliased by sampling.
Edge Pixel Histograms Characterization with Neural Networks for an Improved Semantic Description
Authors: Antonio M. G. Pinheiro
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Edge Histograms are extensively used as an image de- scriptor for image retrieval and recognition applications. Edges represent textures and are also representative of the shapes in an image. In this work a histogram of the pixel edge directions is defined for image description. The edges detected with the Canny algorithm will be described in 4 directions. Images are divided into 16 sub-images, and a descriptor with 64 bins results. The descriptor ability for comparing images based in the Euclidean distance between histograms is going to be tested. Although the measure of the images similarity is important, it is also important to define new methods for high level description of images. The level of description can grow by defining image classes related with the image content. In this work, a neu- ral network is used for the decision process of assigning each image to a set of defined image classes.
Segmentation based wavelet coding of digital images
Authors: E. S. Jang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

In this paper, we present a segmentation based wavelet coding scheme, in which an image is segmented into two regions: stationary areas (background) and the areas containing edge information (foreground). These regions are then encoded independently using two dedicated encoders that are optimized for each region. A 2-D edge operator is used for segmenting the image. We use the embedded zerotree wavelet (EZW) algorithm for encoding the background due to its good performance on stationary areas. The foreground area is, however, encoded using a predictive residual vector quantizer (PRVQ). Experimental results show that the proposed technique improves the quality of the reconstructed images, both numerically (in terms of mean square error) and perceptually when compared to EZW at the same bit rate.
TFS: a transparent file system for contributory storage
Authors: James Cipar, Mark D. Corner, Emery D. Berger
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

Contributory applications allow users to donate unused resources on their personal computers to a shared pool. Applications such as SETI@home, Folding@home, and Freenet are now in wide use and provide a variety of services, including data processing and content distribution. However, while several research projects have proposed contributory applications that support peer-to-peer storage systems, their adoption has been comparatively limited. We believe that a key barrier to the adoption of contributory storage systems is that contributing a large quantity of local storage interferes with the principal user of the machine. To overcome this barrier, we introduce the Transparent File System (TFS). TFS provides background tasks with large amounts of unreliable storage--all of the currently available space--without impacting the performance of ordinary file access operations. We show that TFS allows a peer-to-peer contributory storage system to provide 40% more storage at twice the performance when compared to a user-space storage mechanism. We analyze the impact of TFS on replication in peer-to-peer storage systems and show that TFS does not appreciably increase the resources needed for file replication.
Quadratically Many Colorful Simplices
Authors: Imre Ba´ra´ny, Jir&caron;i´ Matous&caron;ek
Venue: SIAM Journal on Discrete Mathematics (2007)

The colorful Carathe&acute;odory theorem asserts that if $X_1,X_2,\ldots,X_{d+1}$ are sets in ${\bf R}^d$, each containing the origin 0 in its convex hull, then there exists a set $S \subseteq X_1 \cup \cdots \cup X_{d+1}$ with $|S \cap X_i| = 1$ for all $i=1,2,\ldots,d+1$ and $0 \in conv(S)$ (we call $conv(S)$ a colorful covering simplex). Deza &etal; [Discrete Comput. Geom., 35 (2006), pp. 597-615] proved that if the $X_i$ are in general position with respect to 0 (consequently, each $X_i$ has at least $d+1$ points), then there are at least $2d$ colorful covering simplices, and they constructed an example with no more than $d^2+1$ such simplices. Under the same assumption, we show that there are at least $\frac{1}{5}d(d+1)$ colorful covering simplices, thus determining the order of magnitude. A similar result was proved independently by Stephen and Thomas [http://www.arxiv.org/abs/math.CO/0512400 (2005)]. We also obtain a lower bound of $3d$ for $d \geq 3$, which is better for small $d$ and, in particular, together with a parity argument it settles the case $d=3$, where the minimum possible number of colorful covering simplices is 10.
Remote Sensing of Earth's Polar Regions: Opportunities for Computational Science
Authors: Dan Lubin, Robert Massom
Venue: Computing in Science and Engineering (2007)

Polar remote sensing offers numerous opportunities for computer scientists, including spacecraft design and data processing, the development of algorithms for geophysical product retrieval, operational assistance for aircraft and ship navigation, and database management at national archives.
Energy-Aware Grid Multipath Routing Protocol in MANET
Authors: Zhengyu Wu, Hantao Song, Shaofeng Jiang, Xiaomei Xu
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

A Mobile Ad hoc NETwork (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. Earlier research has proposed several unipath routing protocols specifically on MANET, but most studies have not focused on the limitations of battery resource. To alleviate these problems, a new routing protocol called Energy-Aware Grid Multipath Routing (EAGMR) protocol is proposed. The proposed protocol can conserve energy and provide the best path to route according to probability. Simulation results indicate that this new energy-aware protocol can save energy of mobile hosts and improve data packet delivery ratio.
Energy matching based on deformable templates
Authors: Y. S. Tawfik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Snakes, or active contours, have been previously used in computer vision applications to locate and identify objects. However, problems associated with initialization, poor convergence to boundary concavities and high computational complexity, have limited their utility. We present a scheme for object localization and classification based on inexact description of the shape. The approach is based on deformable templates and was tested and proven be very robust with respect to changes in object scale, position and orientation as well as noise and local deformations of shape. A coarse-to-fine algorithm was developed to reduce the computational complexity and achieve efficient implementation. Results of applying the algorithm for automatic identification and localization of industrial parts are presented.
A New Scheme of Using Inference Inside Evolutionary Computation Techniques to Solve CSPs
Authors: Madalina Ionita, Mihaela Breaban, Cornelius Croitoru
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

Combining inference and search produces successful schemes for solving constraint satisfaction problems. Based on this idea a general scheme which uses inference inside evolutionary computation techniques is presented. A Genetic Algorithm and the Particle Swarm Optimization heuristic make use of adaptable inference levels offered by the Mini-Bucket Elimination algorithm. Experimental results prove the efficiency of our approach in solving the Max-CSP optimization task. The inference/search trade-off is analyzed.
Knowledge Management: Using Topic Maps in Organizational Memory
Authors: Les Miller, Sree Nilakanta, Yunan Song, Lei Zhu, Ming Hua
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Organizational memories play a significant role in knowledge management but several challenges confront their use. Artifacts of OM are many and varied. Access and use of the stored artifact is influenced by the user's understanding of these information objects as well as their context. Theories of distributed cognition and the notion of community of practice are used to develop a model of the knowledge management system. Topic maps are used in this implementation to represent user cognition of contextualized information. Topic maps also allow for access and analysis of stored memory artifacts. The paper presents the design and development of a system to accomplish this.
Content-based image retrieval using joint correlograms
Authors: Adam Williams, Peter Yoon
Venue: Multimedia Tools and Applications (2007)

The comparison of digital images to determine their degree of similarity is one of the fundamental problems of computer vision. Many techniques exist which accomplish this with a certain level of success, most of which involve either the analysis of pixel-level features or the segmentation of images into sub-objects that can be geometrically compared. In this paper we develop and evaluate a new variation of the pixel feature and analysis technique known as the color correlogram in the context of a content-based image retrieval system. Our approach is to extend the autocorrelogram by adding multiple image features in addition to color. We compare the performance of each index scheme with our method for image retrieval on a large database of images. The experiment shows that our proposed method gives a significant improvement over histogram or color correlogram indexing, and it is also memory-efficient.
Computational geometry column 49
Authors: Joseph O'Rourke
Venue: ACM SIGACT News (2007)

The new algorithm of Bobenko and Izmestiev for reconstructing the unique polyhedron determined by given gluings of polygons is described.
Improved User Identity Confidentiality for UMTS Mobile Networks
Authors: Behnam Sattarzadeh, Mahdi Asadpour, Rasool Jalili
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

In UMTS mobile networks, there are some circumstances that the International Mobile Subscriber Identity (IMSI) of a user is conveyed in clear-text over the radio interface. Such situations violate the anonymity of users. In this paper, we introduce an Improved User Identity Confidentiality (IUIC) mechanism which attempts to avoid the drawback and makes users more anonymous. We give the role of IMSI to anonymous tickets in such a way that IMSI is never exposed on the radio interface or over any other link. Our IUIC mechanism employs symmetric cryptography based on the existing network access security features of UMTS. Its implementation, security, and performance issues are also considered.
Supporting synchronous groupware with peer object-groups
Authors: Jorge Paulo F. Simão, José A. Legatheaux Martins, Henrique João L. Domingos, Nuno Manuel R. Preguiça
Venue: Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3 (1997)

We propose the peer object-group design pattern as a suitable architectural solution to structure and implement synchronous groupware applications. We discuss a reliable group-communication subsystem and a distributed objects model, implemented in Java, used to realize the approach.
Harmonic+noise coding using improved V/UV mixing and efficient spectral quantization
Authors: E. W. M. Yu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper presents a harmonic+noise speech coder which uses an efficient spectral quantization technique and a novel voiced/unvoiced (V/UV) mixing model. The harmonic magnitudes are coded at 23 bits/frame using the magnitude response of a linear predictive coding (LPC) system. The difference between the harmonic magnitudes and the sampled magnitude response is minimized by the closed-loop approach. The V/UV mixing is modeled by a smooth function which is derived from the speech spectrum envelope based on the flatness measure. The V/UV mixing model allows noise to be added in the harmonic portion of speech spectrum so that buzzyness is reduced. The V/UV mixing information is determined from the spectral parameters available in the decoder, no bits are needed for transmitting the V/UV information. A 1.4 kbps harmonic coder is developed. The speech quality of the coder is comparable to other harmonic coders operating at higher rates.
Efficient multicast on a terabit router
Authors: P. Bhargava, S. C. Krishnan, R. Panigrahy
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

Multicast routing protocols and routers on the Internet enable multicast transmission by replicating packets close to the destinations, obviating the need for multiple unicast connections, thereby saving network bandwidth and improving throughput. Similarly, within a router, multicast between linecards is enabled by a multicast capable switch fabric. A multicast cell is sent once from the source linecard to the switch fabric; the switch fabric sends the cells to all the destination linecards obviating the need for, and the waste of, linecard to fabric bandwidth that would result from multiple unicast cell transmissions. For high capacity routers (several terabits), the fixed size destination field of the cell is inadequate to specify exactly the subset of the switch ports the multicast cell should be sent to the number of multicast connections to be supported. Therefore, for several connections, we have to supercast, i.e., send the cell to non-subscribing linecards and have them drop the cell. We study the problem of assigning destination labels for multicast cells so that the amount of supercast, i.e., wasted bandwidth, is minimized, and the throughput of the router is maximized. We formalize this combinatorial optimization problem and prove it NP-complete and hard to find approximate solutions. We have devised several heuristic algorithms that we have implemented and we report the experimental results. Faster heuristics can support a higher multicast connection establishment rate; slower heuristics can be invoked off-line to further optimize multicast label maps.
Bayesian Filtering and Anonymous Sensors for Localization in a Smart Home
Authors: Youcef Rahal, Philippe Mabilleau, Helene Pigot
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In the context of a constantly increasing aging population with cognitive deficiencies, insuring the autonomy of the elders at home becomes a priority. The DOMUS laboratory aims to address this issue by conceiving a smart home which can both assist people and preserve their quality of life. Obviously, the ability to monitor properly the occupant's activities and thus provide the pertinent assistance depends highly on location information inside the smart home. This paper proposes a solution to localize the occupant thanks to Bayesian filtering and a set of anonymous sensors disseminated throughout the house. The localization system is designed for a single person inside the house. It could however be used in conjunction with other localization systems in case more people are present. Our solution is already functional in real conditions. The preliminary results are encouraging: location estimation exceeds 85% certainty in most cases. We conceived an experiment to estimate precisely the system's accuracy. The experiment consists of a scenario of daily routine that maximizes the occupant's motion in meaningful activities and will be performed by 30 volunteers. We conclude the paper by discussing possible continuations of this work.
Holographic algorithms: from art to science
Authors: Jin-Yi Cai, Pinyan Lu
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We develop the theory of holographic algorithms. We definea basis manifold and give characterizations of algebraic varieties of realizable symmetric generators and recognizers on this manifold. We present a polynomial time decision algorithm for the simultaneous realizability problem. Using the general machinery we are able to giveunexpected holographic algorithms for some counting problems, modulo certain Mersenne type integers. These counting problems are P-complete without the moduli. Going beyond symmetric signatures, we define d-admissibility and d-realizability for general signatures, and give a characterizationof 2-admissibility.
Evolving short-term trading strategies using genetic programming
Authors: N. Svangard, P. Nordin, S. Lloyd, C. Wihlborg
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

We have used a linear Genetic Programming system with a multitude of different quotes on financial securities as input in order to evolve an intraday trading strategy for an individual stock, attempting to outperform a simple buy and hold strategy over the same period of time.
Example-Driven Reconstruction of Software Models
Authors: Oscar Nierstrasz, Markus Kobel, Tudor Girba, Michele Lanza, Horst Bunke
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

As software systems evolve, they become more complex and harder to understand and maintain. Certain reverse engineering techniques attempt to reconstruct software models from source code with the help of a parser for the source language. Unfortunately a great deal of effort may be required to build a specialized parser for a legacy programming language or dialect. On the other hand, (i) we typically do not need a complete parser that recognizes all language constructs, and (ii) we have a rich supply of (legacy) examples. We present an approach to use these facts to rapidly and incrementally develop parsers as follows: we specify mappings from source code examples to model elements; we use the mappings to generate a parser; we parse as much code as we can; we use the exceptional cases to develop new example mappings; and we iterate. Experiments with Java and Ruby, two very different languages, suggest that our approach can be a very efficient and effective way to rapidly construct software models from legacy code.
Designing a Cluster for Your Application
Authors: William R. Dieter, Henry G. Dietz
Venue: Computing in Science and Engineering (2007)

The Cluster Design Rules (CDR) helps inexperienced users focus on the most important factors in cluster design. Without it, users must rely on a "cookie cutter" approach that can result in giving up performance unnecessarily.
Optimal pilot design for multipath channel estimation of a single carrier cyclic prefix-assisted CDMA system
Authors: Kai Yang, A. Madhukumar, F. Chin
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper investigates the effects of pilot choice for the channel estimation of the single carrier cyclic prefix-assisted CDMA system. The optimal pilot problem for die least square channel estimation is formed as a discrete optimization problem. Because the computation to Find the optimal solution is too huge the heuristic method is applied to get several sub-optimal pilots. Different equalization methods are also applied to test the channel estimation performance. The simulation results demonstrate that even the sub-optimal pilots can give more accurate estimation of the channel and improve the system performance considerably.
A 16-kbit/s bandwidth scalable audio coder based on the G.729 standard
Authors: K. Koishida
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper proposes a bandwidth-scalable coding scheme based on the G.729 standard as a base layer coder. In the scheme, according to the channel conditions, the output speech of the decoder can be selected to be narrowband (4-kHz bandwidth) or wideband (8-kHz bandwidth). The proposed scheme consists of two layers: base and enhancement. The base coder uses the G.729 algorithm to encode narrowband speech. The enhancement coder is based on a full-band CELP model and it encodes wideband speech while making use of the available base layer information. Two bandwidth-scalable coders are designed: one is scalable with the 8 kbit/s G.729 base coder and another with the 6.4 kbit/s G.729 (Annex D) base coder. Subjective tests show that, for wideband speech, the proposed coders at 16 kbit/s achieve better performance than the 16 kbit/s MPEG-4 CELP with bandwidth scalability.