ppxscal/embedding_network huggingface dataset:
A Hybrid Adaptive Normal Map Texture Compression Algorithm
Authors: Bailin Yang, Zhigen Pan
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Normal mapping can reveal the details of complex geometry object and improve the photorealistic when rendering. However, GPU should compress a great number of normal textures to save the valuable video memory and limited bandwidth just as the common texture compression technology. This paper proposes a Hybrid Adaptive Normal Map Texture Compression Algorithm, which utilizes three useful tactics, which are TSSA, BlockIndexTable and I3DC, to compress the normal map texture according to its different features such as a great many of, few or fewer zero texels existed in the normal map texture. The experimental results and comparisons show that it can reach the compression rate of 5: 1 or more and achieve better image result than others'. What's more, it will be a good candidate for hardware implementation because of its low cost.
OM-based video shot retrieval by one-to-one matching
Authors: Yuxin Peng, Chong-Wah Ngo, Jianguo Xiao
Venue: Multimedia Tools and Applications (2007)

This paper proposes a new approach for shot-based retrieval by optimal matching (OM), which provides an effective mechanism for the similarity measure and ranking of shots by one-to-one matching. In the proposed approach, a weighted bipartite graph is constructed to model the color similarity between two shots. Then OM based on Kuhn---Munkres algorithm is employed to compute the maximum weight of a constructed bipartite graph as the shot similarity value by one-to-one matching among frames. To improve the speed efficiency of OM, two improved algorithms are also proposed: bipartite graph construction based on subshots and bipartite graph construction based on the same number of keyframes. Besides color similarity, motion feature is also employed for shot similarity measure. A motion histogram is constructed for each shot, the motion similarity between two shots is then measured by the intersection of their motion histograms. Finally, the shot similarity is based on the linear combination of color and motion similarity. Experimental results indicate that the proposed approach achieves better performance than other methods in terms of ranking and retrieval capability.
Articulatory feature recognition using dynamic Bayesian networks
Authors: Joe Frankel, Mirjam Wester, Simon King
Venue: Computer Speech and Language (2007)

We describe a dynamic Bayesian network for articulatory feature recognition. The model is intended to be a component of a speech recognizer that avoids the problems of conventional ''beads-on-a-string'' phoneme-based models. We demonstrate that the model gives superior recognition of articulatory features from the speech signal compared with a state-of-the-art neural network system. We also introduce a training algorithm that offers two major advances: it does not require time-aligned feature labels and it allows the model to learn a set of asynchronous feature changes in a data-driven manner.
Performance assessment of tandem connection of enhanced cellular coders
Authors: S. F. Campos Neto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The growth and increased competition in the second-generation (digital) cellular communication market has led service providers to improve the speech quality in their systems by introducing enhanced speech coders. Advancements in speech coding allowed designers to aim at toll-quality for these enhanced coders, and investigation of the impact of speech coders on the end-to-end quality of the public switched telephone network (PSTN) is necessary. This paper presents the continuation of a series of studies on the impact of tandem connection of cellular systems, where the quality of the enhanced cellular coders for major systems in use today is studied in the context of PSTN interconnection. A major conclusion of this study is that deployment of enhanced coders in second-generation cellular systems makes possible a substantial increase in quality of the cellular connections when in tandem with other speech coders in long haul international networks.
Cramer-Rao bounds and parameter estimation for random amplitude phase modulated signals
Authors: M. Ghogho
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The problem of estimating the phase parameters of a phase modulated signal in the presence of coloured multiplicative noise (random amplitude modulation) and additive white noise, both Gaussian, is addressed. Closed-form expressions for the exact and large-sample Cramer-Rao bounds (CRB) are derived. It is shown that the CRB is not significantly affected by the colour of the modulating process, especially when the signal-to-noise ratio is high. Hence, maximum likelihood type estimators which ignore the noise colour and optimize a criterion with respect to only the phase parameters are proposed. These estimators are shown to be equivalent to the nonlinear least squares estimators which consist of matching the squared observations with a constant amplitude phase modulated signal when the mean of the multiplicative noise is forced to zero. Closed-form expressions are derived for the efficiency of these estimators, and are verified via simulations.
Compressed vertex chain codes
Authors: Yong Kui Liu, Wei Wei, Peng Jie Wang, Borut alik
Venue: Pattern Recognition (2007)

This paper introduces three new vertex chain codes. Firstly, considering that the vertex chain code uses 2 bits to represent only three code elements, a new code is introduced without increasing the average bits per code. The second case introduces a variable-length vertex chain code. Finally, a new compressed chain code is proposed based on the Huffman method. The continuation introduces a method for quantificationally evaluating the efficiency of chain codes. The efficiencies of the new vertex chain codes are then compared theoretically and practically against the most popular chain codes. The result of the comparison shows that the new compressed chain code is the most efficient.
Alternative approaches to K-12 school technology illustrated by an experimental course in technical investigations
Authors: D. T. Kelly
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

School technology programmes in the western world are being pursued through the age ranges 5-15/16 and 11-15/16 and in some countries they are compulsory. Information technology is likely to be a cross curricular activity. The objectives and content of such programmes may differ considerably from the objectives that engineers might believe they should have. The term technology is broadly interpreted, as in every day life, and there is no specific focus on engineering. Given that they are based on design and make activities they respond to neglected areas of the curriculum, i.e. the provision of practical work, the tapping of spatial ability and creative talent, and the development of problem-solving skills. Such aims contribute to the completion of a child's general education and there the matter should rest. Among the criticisms that have been levelled against these programmes are that they pay inadequate attention to the role of science in technological development. However, it may be objected that students would, in any event, be more able to cope with an engineering oriented curriculum in senior high school (i.e. post 15/16).
Views About Writing Survey-a new writing attitudinal survey applied to engineering students
Authors: T. Reed Rhoads
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The development and initial administration results of a new attitudinal instrument, the Views about Writing Survey (VAWS), are presented. The goal of the VAWS is to measure the attitudes, beliefs, values, and perceptions that students have about writing at the beginning of the composition course and again at the end of the semester to show if and how their attitudes change. To this end, the instrument is used as a pre- and post- semester tool to compare students taught in a traditional English course with those taught in an English course that has been integrated with the engineering, physics, and calculus courses. The VAWS was administered to 50 freshmen engineering students within the Foundation Coalition program and to 155 freshmen students within regular sections of English in the first week and again in the last week of classes in the fall semester of 1997. This paper discusses the development of the instrument including the course objectives addressed by the survey. Further, initial validation results of this new instrument and statistical results from comparisons of the engineering students within the Foundation Coalition and students in regular English courses are presented.
Boosting k-Nearest Neighbor Queries Estimating Suitable Query Radii
Authors: Marcos R. Vieira, Caetano Traina Jr., Agma J. M. Traina, Adriano Arantes, Christos Faloutsos
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

This paper proposes novel and effective techniques to estimate a radius to answer k-nearest neighbor queries. The first technique targets datasets where it is possible to learn the distribution about the pairwise distances between the elements, generating a global estimation that applies to the whole dataset. The second technique targets datasets where the first technique cannot be employed, generating estimations that depend on where the query center is located. The proposed k-NNF() algorithm combines both techniques, achieving remarkable speedups. Experiments performed on both real and synthetic datasets have shown that the proposed algorithm can accelerate k-NN queries more than 26 times compared with the incremental algorithm and spends half of the total time compared with the traditional k-NN() algorithms.
Evolutionary programming to optimize an assembly program
Authors: B. Blaha, D. Wunsch
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Evolutionary programming was used to attempt to optimize a program written in the pseudo-assembly language Redcode, invented by A.K. Dewdney. Corewars is the game under which Redcode programs compete. Since 1994, the last standardization of Redcode, many complicated, effective Redcode programs have been written by people, but intense study is required to learn the nuances of the language and perfect programs. Since this is such a difficult task, evolutionary techniques may outperform humans. Multiple point, variable length crossover and change, insert, and delete mutations were the operators used. Relative fitnesses were calculated within a subset of the population on remote client computers. A food model was used to select the most fit programs. Current results are preliminary, but already one of the resulting programs wins 38% and ties 29% against a common type of human-written program. The best performance is 151 wins, 49 losses, and 0 ties against a typical human program.
Intelligent Data Analysis of Out-of-Hospital Cardiac Arrest
Authors: Mateja Verlic, Miljenko Krizmaric, Stefek Grmec, Peter Kokol
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

The rate of survival for the out-of-hospital cardiac arrest (OHCA) is not encouraging. Quick and quality prognosis affects the OHCA outcome. Identification of important factors in prognosis can improve the survival rate. Intelligent data analysis of data obtained in a 4 year study of OHCA outcome in Maribor shows that arrival time of emergency medical team, witnessed arrest, bystander cardiopulmonary resuscitation and especially end-expired CO2 are of great importance for the OHCA outcome.
Tumor treatment by time-reversal acoustics
Authors: M. Porter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

There has been a great deal of work in ocean science over the last 10 years in using acoustic channel models in the signal processing. The goal has been to compensate for the "barbershop" effect in which a sonar system confuses the true source with its reflections in the acoustic mirrors formed by the ocean surface and bottom. Separately, in medicine, hyperthermia has emerged as an important area of research. For hyperthermia acoustic beams are trained on tumors with the goal of reversing their growth. Our interest is the question of what (if any) lessons from the sonar experience can be applied to hyperthermia.
Minitrack: E-Government Information and Knowledge Management
Authors: Maria A. Wimmer, Michael Goul, Jing Zhang
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The public sector realizes the strategic importance of methods, tools and concepts applied to the efficient and effective Information and Knowledge resource Management (IKM). Because governments and public administrations deal with vast amounts of information and knowledge, it is particularly important to leverage research agendas that advance tenets related to the management of these resources. For example, much of the work of public authorities and governments is related to the collection, processing, interpretation, and use of data, information and knowledge on citizens, businesses, governments themselves, the society, the market, the environment, laws, politics, etc.
Using an Ultrasonic Transducer: Evidence for an Anisotropic Deprivation of Frictional Cues in Microtexture Perception
Authors: Melisande Biet, Loic Boulon, Francois Martinot, Frederic Giraud, Betty Lemaire-Semail
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Ultrasonic transducers can be used to control friction. In case of a haptic texture actuated and explored simultaneously with the bare finger, this technology allows to reduce perceived roughness. In this article, we investigate its use to understand determinants of friction at contact. In the literature, a researcher recently suggested that microtexture perception was mainly determined by an interaction determinant: the commensurability of its asperities with epidermal ridges. In this paper, we levitate the skin with an air gap and thus cancel shear forces at contact. Results show that more important amplitude of vibration of the actuator is necessary to suppress friction at contact area when a directed movement is done along the epidermal ridges than across. This suggests that tactile perception of texture really depends on the bearing forces exerted by the surface on the skin.
Statistical analysis of a subspace method for blind channel identification
Authors: M. Kristensson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

This paper considers the problem of blind channel estimation of multi-channel FIR filters. This is a problem arising in, for example, mobile communication systems using digital signalling. By using the orthogonality property between the noise subspace and the channel matrix, it has been shown in earlier work that the channel matrix is identifiable up to a multiplicative constant. In this article, the asymptotic properties of a subspace method using this orthogonality property is presented. An asymptotically correct weighting matrix is derived, demonstrating an attainable lower theoretical bound using the subspace estimate.
New dynamic link weight algorithm for on-line calculation of LSPS in MPLS networks
Authors: Huan Pham, B. Lavery
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper presents a new dynamic link weight (DLW) routing algorithm for calculating label switched paths (LSPs) in multiple protocol label switching (MPLS) networks. The routing algorithm takes early precautions to avoid using up the capacity of any congested links when alternative lower loaded paths are available. This algorithm is effective in minimizing the traffic demand reject probability, therefore increasing the throughput. Its complexity is low, making it scalable for large networks and suitable for on-line routing calculations in such networks.
An algorithm for power system disturbance monitoring
Authors: P. O'Shea
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper presents a spectral analysis algorithm for monitoring the characteristics of the damped oscillating "modes" which are set up after a disturbance in an electric power distribution system. This monitoring is necessary so that one can detect early whether any modes are "inverse damped" (i.e. exponentially growing), and hence likely to create instability in the power system. In this application it is necessary to be able to resolve modes which are very closely spaced in frequency, and which may be imbedded in substantial noise. The proposed algorithm is Fourier based, and is an extension of a method proposed by the author. The extension enables resolution of very closely spaced multiple modes and has good noise performance. The scheme is tested on simulated signals and on a real power system example. 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
Principles of fractional delay filters
Authors: V. Valimaki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

In numerous applications, such as communications, audio and music technology, speech coding and synthesis, antenna and transducer arrays, and time delay estimation, not only the sampling frequency but the actual sampling instants are of crucial importance. Digital fractional delay (FD) filters provide a useful building block that can be used for fine-tuning the sampling instants, i.e., implement the required bandlimited interpolation. In this paper an overview of design techniques and applications is given.
An Assessment Framework for Discovering and Using Patterns in Virtual Project Management
Authors: Deepak Khazanchi, Ilze Zigurs
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Virtual project management in global organizations is both challenging and important. Being able to identify and apply best practices is an essential skill, as is an understanding of how to leverage the right technology for communication and information sharing. Based on a typology of virtual projects, and using the theoretical frame of patterns, we propose an integrative way of identifying and applying best practices for the management of virtual projects. We present an assessment approach that allows managers to determine the nature of their virtual projects and discover and apply patterns for managing them.
Augmenting Branch Predictor to Secure Program Execution
Authors: Yixin Shi, Gyungho Lee
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Although there are various ways to exploit software vulnerabilities for malicious attacks, the attacks always result in unexpected behavior in program execution, deviating from what the programmer/user intends to do. Program execution blindly follows the execution path specified by control flow transfer instructions with the targets generated at run-time without any validation. An enhancement is therefore proposed to secure program execution by introducing a validation mechanism over control flow transfer instructions at micro-architecture level. The proposed scheme, as a behavior-based protection, treats a triplet of the indirect branch's location, its target address, and the execution path preceding it as a behavior signature of program execution and validates it at run-time. The first two pieces of information can prevent an adversary from overwriting control data and introducing foreign code or impossible targets to redirect an indirect branch. The last one is necessary to defeat the attacks that use a legitimate target but follow an unintended execution path. Interestingly, the branch predictor is found to contain the signature information already and doing a portion of the validation when resolving the branch, thus greatly reducing the validation frequency. An enhancement of branch target buffer (BTB) entry together with a signature table implemented in the form of a Bloom filter in hardware is proposed to incorporate the validation into the processor's pipeline, providing a new defense in the processor architecture to secure program execution.
Linear feature-based models for information retrieval
Authors: Donald Metzler, W. Bruce Croft
Venue: Information Retrieval (2007)

There have been a number of linear, feature-based models proposed by the information retrieval community recently. Although each model is presented differently, they all share a common underlying framework. In this paper, we explore and discuss the theoretical issues of this framework, including a novel look at the parameter space. We then detail supervised training algorithms that directly maximize the evaluation metric under consideration, such as mean average precision. We present results that show training models in this way can lead to significantly better test set performance compared to other training methods that do not directly maximize the metric. Finally, we show that linear feature-based models can consistently and significantly outperform current state of the art retrieval models with the correct choice of features.
Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access
Venue: International Workshop on Data Engineering for Wireless and Mobile Access (2007)

Welcome to MobiDE'07 in Beijing! This is the sixth of a successful series of workshops that aim to bring together the data management, wireless networking, and mobile computing communities. This year's workshop, held in conjunction with SIGMOD 2007, continues its tradition of being the premier forum for researchers and technologists to discuss the state-of-the-art, present research results, experiences and contributions, and setting future directions in data management for mobile and wireless access. It is very fitting to have MOBIDE 2007 in Beijing, one year before the Olympic capital is engaged in a very ambitious process of enabling extensive tourist information to mobile users through the Olympia 2008 project. The workshop program presents new and controversial research ideas so as to foster interaction among researchers from around the world. The call for papers attracted 28 submissions. All submissions were reviewed by at least 3 members of the Program Committee. Many of these submissions were of very high quality, making the selection process quite competitive. As a result, 9 submissions were accepted as full papers, and 2 submissions that reported on promising works in progress were accepted as poster papers.