ppxscal/embedding_network huggingface dataset:
The cone condition and t-designs
Authors: Peter Dukes, Richard M. Wilson
Venue: European Journal of Combinatorics (2007)

The existence of a t-(v,k,@l) design implies that certain 'almost constant' vectors belong to the convex cone generated by the columns of the incidence matrix of t-subsets versus k-subsets of a v-set. We prove that some vectors are not in, or in a few cases are in, this cone-whether a design exists or not. When certain vectors are shown not to be in this cone, the implication is an inequality on the parameters or a condition on the structure of a t-design. We unify a number of known inequalities for t-designs, and derive some new ones concerning t-wise balanced designs, with this approach.
Evaluation of a mosaic based approach to video compression
Authors: B. Tannenbaum
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

There is great interest in the storage and browsing of large collections of video clips, due to the current explosion in demand for digital video. Many new algorithms and standards (MPEG, H.261, H.263, etc.) have been developed in recent years for the coding of video. However, most of these techniques lose performance when there exists significant camera motion, a common element of some classes of video such as surveillance and sporting events. A mosaic-based approach to video compression, initially presented by Irani, Hsu, and Anandan (1995), creates a world-oriented panoramic representation of the scene for compression. This paper proposes and evaluates a specific mosaic-based algorithm for video compression that uses a static mosaic with a wavelet-based coding scheme for the mosaic and the temporal residual information. The mosaic-based approach is compared to a global motion compensation approach and the algorithms detailed in this paper are compared to the H.263 TMN5 coder.
Electronic protection and routing optimization of MANETs operating in an electronic warfare environment
Authors: António Grilo, Mário Macedo, Pedro Sebastião, Mário Nunes
Venue: Ad Hoc Networks (2007)

Domination of the electromagnetic spectrum is a crucial component of the 21st century warfare. In the harsh electromagnetic environment of the modern battlefield, it is of the utmost importance to deny the opposing force the opportunity to attack or exploit the detection/interception of friendly communications assets through the deployment of electronic protection (EP) measures in order to attain low probability of detection (LPD), low probability of interception (LPI) and anti-jam (A/J). Given that directional antennas are a suitable means to achieve both extended range and LPD/LPI, this paper proposes mechanisms to optimize the trade-off between these capabilities, minimizing the number of hops and end-to-end delay when routing packets in a multi-hop ad-hoc network, while taking into account stealth requirements. The novel scheme is based on a variant of Fisheye State Routing, coupled with a power control algorithm to guarantee a LPD/LPI beyond the zone covered by the omni-directional radiation footprint of the network. The performance of the proposed scheme is evaluated through computer simulation.
An improved residual-domain phase/amplitude model for sinusoidal coding of speech at very low bit rates: a variable rate scheme
Authors: S. Ahmadi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

An improved harmonic sinusoidal model is presented, where the underlying sine wave amplitudes and phases are efficiently represented using a combination of linear prediction, linear phase alignment, all-pass filtering, and spectral sampling in the residual-domain. The analysis and synthesis systems are introduced and the derivation and encoding of each model parameter is discussed. Performance analysis on a large database indicates effective modeling of the sinusoidal parameters. A variable-rate sinusoidal coder operating at an average bit rate of 1.75 kbps, based on the proposed model, has been developed, yielding reproduced speech of good quality, intelligibility, and naturalness. The proposed model may find applications in low bit rate speech coding in high capacity wireless communication systems. 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
Unwrapping phase images by propagating probabilities across graphs
Authors: R. Koetter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Phase images are derived from source images by applying a modulus operation to each pixel value. Phase unwrapping is the problem of inferring the original, unwrapped values from the wrapped values, using prior knowledge about the smoothness of the image. One approach to solving this problem is to infer the gradient vector field of the unwrapped image and then integrate the gradient field. The gradient in a particular direction at a pixel is equal to the observed pixel difference plus an unknown integer number of shifts. We introduce a technique for inferring these shifts using the low-complexity probability propagation algorithm, applied in a graphical model that prefers shifts that match the phase image and that constrains the shifts to satisfy the properties of a gradient field. We present results for a phase image from the region of the Sandia National Laboratories.
Online trust and reputation systems
Authors: Neel Sundaresan
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

As online commerce, social networks, and user-generated content become common, need for trust and reputation models become prime. This tutorial will give an overview of trust and reputation systems as studied by social network researchers. Other topics include: Reputation and its relationship to security and fraud; Feedback and other Manifestations and Implementations of trust and reputations; Models of reputation; platforms: P2P systems, Centralized systems; Auctions, Incentive systems; Collaborative filtering; Social Networking and Social reputation; Portability and Universality of Identity, trust, and reputation.
Domain Adaptive Information Extraction Using Link Grammar and WordNet
Authors: Aye Lelt Lelt Phyu, Nilar Thein
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

Nowadays, people want to extract variety of information from on line texts. As more and more text becomes available on-line, there is emergent need for systems that extract information automatically from text corpus. One of the principle challenges of information extraction is the efficient customization of a system to a new domain. Adapting an information extraction system to a new domain entails the construction of a new set of extraction rules. Many recent information extraction systems have ignored the tedious and time-consuming nature of that process. This paper proposes an alternative approach, which generate candidate extraction rules from untagged text corpus using Link Grammar Parser and filter the final extraction rules using Wordnet and linguistic patterns. The proposed method not only reduces the amount of time and effort required to create an appropriate training corpus but also obviates the need to examine many candidate extraction rules so that the system can easily port well to different domain.
A Cache Coherence Protocol for MIN-Based Multiprocessors With Limited Inclusion
Authors: Mazin S. Yousif, Chita R. Das, Matthew J. Thazhuthaveetil
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In this paper, we look into a feasible approach to incorporating caches into selected switching ele ments of a multistage interconnection network (MIN)- based multiprocessor. Along with the processor private caches, these switch caches form a two-level cache hi erarchy. Selected switch caches within a particular stage of the MIN are connected by a coherence con trol bus, through which a write-invalidate cache coher ence protocol is maintained. Considering scalability and practicality issues, only limited inclusion between the two cache levels is enforced. A simulation-based performance study is conducted to analyze the impact of the protocol on system performance. Comparison between limited and strict inclusion shows that system performance declines with limited inclusion.
Interactive presentation: Generating and executing multi-exit custom instructions for an adaptive extensible processor
Authors: Hamid Noori, Farhad Mehdipour, Kazuaki Murakami, Koji Inoue, Maziar Goudarzi
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

To improve the performance of embedded processors, an effective technique is collapsing critical computation subgraphs as application-specific instruction set extensions and executing them on custom functional units. The problems of this approach are immense cost and long time of designing. To address these issues, we propose an adaptive extensible processor in which custom instructions (CIs) are generated and added after chip-fabrication. To support this feature, custom functional units are replaced by a reconfigurable matrix of functional units with the capability of conditional execution. Unlike previous proposed CIs, ours can include multiple exits. Experimental results show that multi-exit CIs enhance the performance by 46% in average compared to CIs limited to one basic block. A maximum speedup of 2.89 compared to a 4-issue in-order RISC processor, and a speedup of 1.66 in average, was achieved on MiBench benchmark suite.
Minitrack: Digital Divide
Authors: Karine Barzilai-Nahon
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Digital divide plays an important role in last years' discourse in theory and practice as well. Starting in the 90's by focusing on infrastructures divides between the "have' and "have-not' and continuing in the following years to other dimensions of the divide such as skills, usage, governmental and communal support and more. This mini-track tries to step out of the traditional look at the digital divide, from an infrastructure point of view, and enable a platform to discuss other perspectives of it - Socio-demographic factors, social and governmental support, conceptualization of the concept digital divide, usage patterns and more.
An Information Avalanche
Authors: Vinton G. Cerf
Venue: Computer (2007)

We must harness the Internet's energy before the information it has unleashed buries us.
Reductions between the Subgraph Isomorphism Problem and Hamiltonian and SAT Problems
Authors: Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

Subgraph isomorphism (SI) detection is an important problem for several computer science subfields. In this paper we present a study of the Subgraph Isomorphism Problem (SIP) and its relation with the Hamiltonian cycles and SAT problems. In particular, we describe how instances of those problems can be solved throughout SI detection (using problems reductions). In our experiments we use an algorithm developed by the authors, which is capable to find all valid mappings in a SI instance. We performed several experiments, including cases for which there exists a known solution in polynomial time. In our analysis, we show the advantage and disadvantage of using a SI representation to solve Hamiltonian cycles and SAT problems.
Tangible interfaces for real-time 3D virtual environments
Authors: Ali Mazalek, Michael Nitsche
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Emergent game formats, such as machinima, that use game worlds as expressive 3D performance spaces have new expressive powers with an increase of the quality of their underlying graphic and animation systems. Nevertheless, they still lack intuitive control mechanisms. Set direction and acting are limited by tools that were designed to create and play video games rather than produce expressive performance pieces. These tools do a poor job of capturing the performative expression that characterizes more mature media such as film. Tangible interfaces can help open up the game systems for more intuitive character control needed for a greater level of expression in the digital real-time world. The TUI3D project (Tangible User Interfaces for Real-Time 3D) addresses production and performative challenges involved in creating machinima through the development of tangible interfaces for controlling 3D virtual actors and environments in real-time. In this paper, we present the design and implementation of a tangible puppet prototype for virtual character control in the Unreal game engine and discuss initial user feedback.
Object Categorization Robust to Surface Markings using Entropy-guided Codebook
Authors: Sungho Kim, In So Kweon
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Visual categorization is fundamentally important for autonomous mobile robots to get intelligence such as novel object acquisition and topological place recognition. The main difficulty of visual categorization is how to reduce the large intra-class variations. In this paper, we present a new method made robust to that problem by using intermediate blurring and entropy-guided codebook selection in a bagof- words framework. Intermediate blurring can reduce the high frequency of surface markings and provide dominant shape information. Entropy of a hypothesized codebook can provide the necessary amount of repetition among training exemplars. A generative optimal codebook for each category is learned using the MDL (minimum description length) principle guided by entropy information. Finally, a discriminative codebook is learned using the discriminative method guided by the inter-category entropy of the codebook. We validate the effect of the proposed method using a Caltech-101 DB, which has large intra-class variations.
Virtual reality and learning by design: tools for integrating mechanical engineering concepts
Authors: T. Impelluso
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The Department of Mechanical Engineering at San Diego State University has begun to re-design its introductory mechanical engineering courses. The objectives of these newly designed courses are to incorporate the learner as designer strategy and to positively impact students' conceptual understanding of mechanical engineering concepts. To achieve these objectives, the courses are designed to use virtual reality as a tool that integrates the fundamental concepts of design, analysis and manufacturing. The first implementation of one of these courses afforded an opportunity to study a particular type of learner as designer strategy, the learner as instructional designer strategy. This paper describes the course and the impact of the learner as instructional designer strategy on students' conceptual understanding of and attitude towards mechanical engineering concepts.
Multimode Illinois Scan Architecture for Test Application Time and Test Data Volume Reduction
Authors: Anshuman Chandra, Haihua Yan, Rohit Kapur
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

We present a novel DFT technique based on multimode Illinois scan architecture (MILS) for low pin count test that simultaneously reduces test data volume and test application time. By using the proposed technique, significant savings in test data volume, and testing time can be obtained without modifying the clock tree of the design and with a very small combinational area overhead. Experimental results for two large industrial circuits show that the test data volume and test application time reduction of the order of 100x can be achieved in all cases with less than 1% area overhead over ILS.
A new 3D display using a dynamically reconfigurable display matrix surface
Authors: D. Xue, D. Wallace, R. Crawfis
Venue: Proceedings of the Computer Graphics International 2005 (2005)

This paper presents a new three-dimensional display system using a reconfigurable projection manifold. The display surface is warped interactively into a non-planar manifold according to the scene image's depth information for the current view. Scene images are projected onto the display using computer graphics and a post-process warping. We currently use two projections to provide a complete coverage of the manifold surface from oblique projection angles. In this paper, we describe the overall design issues and goals of the projector-based rendering process, introduce the algorithms to model the projection manifold surface and describe the algorithms used to create the pre-warped images from the scene image. Our current prototype is a discrete tile-based approximation to the depth manifold. We describe our experiments with two such prototypes, one using a static test configuration, and another actuated using linear motion controllers for each discrete tile. This second prototype can be configured dynamically, as the depth information in the scene changes.
A self-organizing map of sigma-pi units
Authors: Cornelius Weber, Stefan Wermter
Venue: Neurocomputing (2007)

By frame of reference transformations, an input variable in one coordinate system is transformed into an output variable in a different coordinate system depending on another input variable. If the variables are represented as neural population codes, then a sigma-pi network is a natural way of coding this transformation. By multiplying two inputs it detects coactivations of input units, and by summing over the multiplied inputs, one output unit can respond invariantly to different combinations of coactivated input units. Here, we present a sigma-pi network and a learning algorithm by which the output representation self-organizes to form a topographic map. This network solves the frame of reference transformation problem by unsupervised learning.
Modeling speech variability with segmental HMMs
Authors: W. J. Holmes, M. J. Russell
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

An important characteristic of segmental hidden Markov models (HMMs) is a distinction between extra-segmental variability across different examples of a sub-phonemic speech segment and intra-segmental variability within any one example. This paper considers the modeling of these two types of variability in some detail. Analysis of natural speech data has suggested that intra-segmental variability of mel cepstrum features is not well-approximated by single Gaussians. The model of this variability was improved by introducing a two-component Gaussian mixture, where the two components have the same mean but one has much smaller variance than the other. Initial recognition experiments using models with three segments per phone have shown the importance of accurately modeling intra-segmental variability, in order for the intra- and extra-segmental probabilities to balance correctly and hence for good recognition performance to be achieved.
A Force-directed Approach for Fast Generation of Efficient Multi-Port NoC Architectures
Authors: Balasubramanian Sethuraman, Ranga Vemuri
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Networks-on-Chip (NoC) is an emerging style of system design introduced to overcome the communi- cation and the performance bottlenecks of a shared- bus design. Away from the traditional NoC mesh de- sign, Multi Local Port Router (MLPR) has been intro- duced as design alternative to improve the bandwidth, reduce the network area (36% average area savings) and eventually, improve the overall performance of the NoC system. In this research, we present a fast map- ping tool (cMap) for generating NoC architectures us- ing MLPRs. The algorithm exploits the advantages of- fered by MLPRs and starts with a minimum dimen- sion mesh. After an initial bandwidth-communication- cost based nearest-neighbor placement, it uses a force- directed approach to iteratively expand the mesh, as the cost gets reduced. The algorithm introduces the concept of Folding to improve the NoC design. Unlike the ear- lier exhaustive-search based optiMap algorithm, cMap can handle any size of the task graph, producing near- optimal results (average cost difference between 3% and 10%) in a couple of seconds. We experiment with a rich set of 22 benchmarks and report the results.
Video coding using affine motion compensated prediction
Authors: Kui Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

The aim in variable block size and object based video coding is to motion compensate as large regions as possible. Whereas the translational motion model is adequate to motion compensate small regions even if the image sequence involves complex motion, it is no longer capable of delivering satisfactory results for large regions. A more sophisticated motion model is required in such regions. In this paper, we extend our previous approach by proposing a multiple layer video codec which uses affine model for large regions to improve motion compensation. The translational model is still used for small regions to reduce the bit overhead. A multi-resolution robust Hough transform based motion estimation technique is used to estimate the affine motion parameters. The experimental results show that the proposed method gives better results in terms of the bit rate under the same PSNR constraint for most of the tested sequences as compared with our previous approach and an implementation of the standard H.261.
Animating programs and students in the laboratory
Authors: J. F. Korsh
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Program animation is a well-recognized tool for the enhancement of understanding of algorithms and data structures. The difficulty of creating animations, however, has limited the use of animation by students. This is especially so in introductory courses where the students need to concentrate on the material to be learned and should not be distracted by irrelevant details of an animation system. We have developed a prototype system which allows students (or instructors) to create C/C++ programs which are self-animating. Use of this system does not require learning any extra programming skills. Users need only specify which variables and data structures they want to be animated. This is done by declaring those elements of the program to be "self-animating" types. Typically, this would mean substituting INT for int. Similar changes allow for the self-animation of arrays, structs, and pointers. At present, our implementation supports ints and types derived from ints using pointers, arrays, and structs. The resulting C/C++ program appears in an integrated display environment that provides animation of the selected data items, and also shows the source code with the currently animated instruction highlighted. The environment also organizes program information in a way that is meaningful to the programmer, and allows the programmer to control the degree of detail that he or she wants to see. This paper briefly describes the system and, by using examples, shows the ease with which students or instructors can create animations in the laboratory or classroom.