ppxscal/embedding_network huggingface dataset:
A study on perceptual distance measure for phase spectrum of stimuli
Authors: H. Banno
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper describes a perceptual distance measure for phase spectrum based on results from a subjective experiment using stimuli. The stimuli have flat amplitude spectrum and, in a particular frequency band, have a certain group delay value. The experiment was performed using stimuli with different group delay peak values where the group delay center frequencies are fixed, and their associated group delay bandwidths are also fixed. It was found that when the peak values of stimuli are between -1 ms and 2 ms, they are perceived to be zero phase regardless of their center frequencies and bandwidths. Moreover, when the peak values are less than -8 ms or more than 10 ms and the bandwidths are less than 1 ERB, each of the stimuli are perceived to be similar. Based on these perceptual similarity results, we introduce an ellipsoidal function to estimate the similarity scores with a simple equation. It is found that the estimated similarity scores well approximate the subjective similarity scores.
Variable forgetting factor linear least squares algorithm for a frequency selective fading channel estimation
Authors: Seongwook Song
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Variable forgetting factor linear least squares (VFFLLS) algorithm is presented in order to improve the tracking capability of the channel estimation. Compared to the already-existing algorithm-exponentially windowed recursive least squares (EW-RLS) with the optimal forgetting factor, this method makes remarkable improvement in a fast fading environment. The effects of channel parameter-signal to noise ratio, fading rate, are tested in computer simulations with the given channel model. The performance of each algorithm is assessed in terms of the mean-square-identification-error (MSIE).
Improving instruction locality with just-in-time code layout
Authors: J. Bradley Chen, Bradley D. D. Leupen
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

This paper describes Just-In-Time code layout (JITCL), a new method for improving the locality of an instruction reference stream by selecting the order of procedures in the text segment during program execution. By determining procedure placement dynamically, this method provides an optimized procedure layout without requiring profile data. For UNIX-style workloads, JITCL provides improvements in instruction cache performance comparable to profile-based layout strategies, while avoiding the requirement of profile data. The late nature of this optimization makes it possible to implement procedure orderings across executable and DLL boundaries, overcoming a limitation of current profile-based techniques. Simulations using Etch [RVL97] on Windows NT show that inter-module JITCL commonly reduces the memory footprint of executable text by 50%.
Minimising the effects of subband quantisation of the time domain aliasing cancellation filter bank
Authors: C. Jakob
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The effect of the quantisation of filter bank subbands has been analysed by incorporating quantisation noise models into the time domain aliasing cancellation (TDAC) filter bank. We have found expressions for the reconstruction error of the quantised TDAC system in terms of several signal correlated components, and an uncorrelated component. These expressions allow easy identification of subjectively annoying errors, and provide the framework for a subjective optimisation of the quantisation process. Research has been carried out on alternative quantiser models and methods of quantiser-compensation.
LDPC-based joint source-channel coding scheme for multimedia communications
Authors: Liuguo Yin, Jianhua Lu, Youshou Wu
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Joint source-channel coding schemes have been proven to be effective ways for reliable multimedia communications. In this paper, we develop a joint source-channel coding scheme that well combines the hidden Markov source (HMS) estimation and the powerful low-density parity-check (LDPC) codes with an iterative estimation/decoding scheme. With this coding method, the source redundancy could be accurately extracted by the hidden Markov estimation without using any priori information about the source. Moreover, the interleaver that is likely used to separate the source coding and channel coding is exempted by exploiting the randomizing property of the LDPC codes, while the channel decoding procedure may be implemented in parallel, resulting in good performance with a fairly low decoding complexity and delay. Simulation results have shown that the proposed scheme may achieve a much better performance than that of the standard coding scheme over the binary input additive white Gaussian noise (BIAWGN) channels.
Recruiting women into engineering graduate programs
Authors: M. A. White
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Since women are seriously underrepresented in engineering graduate programs, programs are needed to bridge existing retention programs for undergraduate women with retention programs for graduate women in engineering. These efforts are likely to strengthen the pipeline of women entering academia. The National Science Foundation-funded Women in Engineering Scholars program is designed to encourage more women to pursue graduate school in engineering. The Scholars Program is administered through the Women in Applied Science and Engineering (WISE) Program at Arizona State University and it includes strong industry participation. A description of the program is presented including budget and funding, participant recruiting, preliminary results and lessons learned.
On the characterizations of (S,N)-implications
Authors: Michał Baczyński, Balasubramaniam Jayaram
Venue: Fuzzy Sets and Systems (2007)

The characterization of S-implications generated from strong negations presented firstly by Trillas and Valverde in 1985 is well-known in the literature. In this paper we show that some assumptions are needless and present two characterizations of S-implications with mutually independent requirements. We also present characterizations of (S,N)-implications obtained from continuous fuzzy negations or strict negations. Besides these main results some new facts concerning fuzzy implications, fuzzy negations and laws of contraposition are proved.
An approach for enabling DCT/IDCT energy reduction scalability in MPEG-2 video codecs
Authors: R. Henning
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

It would be desirable, in terms of energy conservation, to use a low complexity approximate algorithm to do all DCT and IDCT computation in an MPEG-2 video codec. However, there is a significant quality penalty associated with this approach that may not always be acceptable. A practical algorithmic method is studied for achieving scalable energy reduction during DCT and IDCT computation in MPEG-2 video codecs at the expense of reasonable amounts of quality. For example, by applying exact and approximate DCT/IDCT algorithms appropriately, the energy consumption of DCT and IDCT execution in two video codecs communicating with one another can be reduced by 8% for quality reduction of 0.4 dB average PSNR, 14% for 0.8 dB; reduction, or 22% for 1.4 dB reduction.
Image Analysis by Methods of Dimension Reduction
Authors: Pavel Moravec, Vaclav Snasel, Alexander Frolov, Dusan Husek, Hana Rezankova, Pavel Polyakov
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In this paper, we compare performance of several dimension reduction techniques, namely LSI, NMF, SDD, Boolean factor analysis, and cluster analysis. The qualitative comparison is evaluated on a collection of bars. We compare the quality of these methods from on the base of the visual impact.
Administering access control in dynamic coalitions
Authors: Rakesh Bobba, Serban Gavrila, Virgil Gligor, Himanshu Khurana, Radostina Koleva
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

Dynamic coalitions enable autonomous domains to achieve common objectives by sharing resources based on negotiated resource-sharing agreements. A major requirement for administering dynamic coalitions is the availability of a comprehensive set of access control tools. In this paper we discuss the design, implementation, evaluation, and demonstration of such tools. In particular, we have developed tools for negotiating resource-sharing agreements, access policy specification, access review, wholesale and selective distribution and revocation of privileges, and policy decision and enforcement.
A block bigram prediction model for statistical machine translation
Authors: Christoph Tillmann, Tong Zhang
Venue: ACM Transactions on Speech and Language Processing (TSLP) (2007)

In this article, we present a novel training method for a localized phrase-based prediction model for statistical machine translation (SMT). The model predicts block neighbors to carry out a phrase-based translation that explicitly handles local phrase reordering. We use a maximum likelihood criterion to train a log-linear block bigram model which uses real-valued features (e.g., a language model score) as well as binary features based on the block identities themselves (e.g., block bigram features). The model training relies on an efficient enumeration of local block neighbors in parallel training data. A novel stochastic gradient descent (SGD) training algorithm is presented that can easily handle millions of features. Moreover, when viewing SMT as a block generation process, it becomes quite similar to sequential natural language annotation problems such as part-of-speech tagging, phrase chunking, or shallow parsing. Our novel approach is successfully tested on a standard Arabic-English translation task using two different phrase reordering models: a block orientation model and a phrase-distortion model.
A History of Indonesian Telecommunication Reform 1999-2006
Authors: Susan Eick
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This study examines the effect of Indonesia's telecommunications policy on Internet access and the digital divide. The study finds that current government policy had minimal impact on Internet access. Policies of privatization and depoliticization should be fully adopted alongside the current policy of liberalization. These policies could lessen government intervention in both regulation and in corporate telecom ownership, and create a more stable, competitive telecom sector. The Telecommunications Act of 1999 signaled a new effort by the government to attend to telecom market reforms, but continuous political wrangling hindered reform implementation. While ethnic clashes and political instability hold Indonesia on the brink of a crisis, further reform policies could encourage the country to move forward. A conceptual framework exemplifies a triangular relationship between the government, service providers, and users. Data used in the study are based on government statistics, company-published information, the World Telecommunications Indicators Database, and secondary sources.
Matching pursuits low bit rate video coding with codebooks adaptation
Authors: Chien-Kai Peng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We propose a codebook adaptation algorithm for matching pursuit low bit rate video compression. The matching pursuit dictionary is a set of basis functions. In practice, a function is approximated as a vector. According to the incoming data, the basis functions are modified similar to the minimum-point-finding algorithm in stochastic regression. Although matching pursuit low bit rate compressions have been studied intensively, bases adaptation in the dictionary is a new approach. We demonstrate the performance of our adaptation method on MPEG-4 video sequences.
A Heuristic Map-Matching Algorithm by Using Vector-Based Recognition
Authors: Dongdong Wu, Tongyu Zhu, Weifeng Lv, Xin Gao
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

The traditional map-matching algorithms mainly use two methods: the incremental method and the global method. Both of them have advantages and disadvantages of themselves: while the global map-matching algorithm produces better matching results, the incremental algorithm produces results of lower quality faster. All things considering the two traditional algorithms, this paper proposes a heuristic map-matching algorithm by using vector-based recognition. Firstly, the algorithm uses the heuristic search method which is similar to A* algorithm, and it makes use of geometric operation to form the restriction, and make the comparison between the vector formed with the vehicular GPS points and the special road network to heuristicly search and select the vehicular possible traveling routes. Secondly, it globally compares the vehicular every possible route by calculating the map-matching weight, and then chooses the optimal one. The result of testing demonstrates the efficiency of the algorithm both at accuracy and computational speed when handling the large-scale data of GPS tracking data even under the complex road network conditions.
DFT studies of closely bound ground state of (N2-N2)+1 ionic dimmer
Authors: Ajmal. H. Hamdani, Sheikh Shahdin
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

A detailed DFT study of the ground state of (N2-N2)+1 ionic dimmer has been carried out in closely bound region from 1.20Å to 2.50Å using different DFT methods and Basis sets. A real potential energy minima has been found to exist at r = 1.20 Å and R = 1.63 Å for D2h symmetry group. The potential energy levels and other physical properties of the dimmer are reported at B3LYP / 6-311++g** level of the theory. D2h symmetry group has been found to be the most stable structure.
A GA-based RBF classifier with class-dependent features
Authors: Xiuju Fu, Lipo Wang
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

High dimensionality of data sets is a curse to classifiers. We propose to construct a novel radial basis function (RBF) classifier using class-dependent features by genetic algorithms (GA). Since each feature may have different capabilities in discriminating different classes, features should be masked differently for different classes. In our novel RBF classifier, each Gaussian kernel function of the RBF neural network is active for only a subset of patterns which are approximately of the same class. A group of Gaussian kernel functions is generated for each class. In our method, different feature masks are used for different groups of Gaussian kernel functions corresponding to different classes. The feature masks are adjusted by GA. The classification accuracy of the RBF neural network is used as the fitness function. Thus, the dimensionality of a data set is reduced. Simulations show that, with irrelevant features removed for each class, our method can lead to significant improvements on classification accuracy.
Power processing circuits for electromagnetic, electrostatic and piezoelectric inertial energy scavengers
Authors: P. D. Mitcheson, T. C. Green, E. M. Yeatman
Venue: Microsystem Technologies (2007)

Inertial energy scavengers are self-contained devices which generate power from ambient motion, by electrically damping the internal motion of a suspended proof mass. There are significant challenges in converting the power generated from such devices to useable form, particularly in micro-engineered variants. This paper examines this power conversion requirement for each of the cases of electromagnetic, electrostatic and piezo-electric transduction, and presents new circuit approaches for the first two of these.
Comparison of approaches to continuous hand gesture recognition for a visual dialog system
Authors: P. Morguet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Continuous hand gesture recognition requires the detection of gestures in a video stream and their classification. In this paper two continuous recognition solutions using hidden Markov models (HMMs) are compared. The first approach uses a motion detection algorithm to isolate gesture candidates followed by a HMM recognition step. The second approach is a single-stage, HMM-based spotting method improved by a new implicit duration modeling. Both strategies have been tested on continuous video data containing 41 different types of gestures embedded in random motion. The data has been derived from usability experiments with an application providing a realistic visual dialog scenario. The results show that the improved spotting method in contrast to the motion detection approach can successfully suppress random motion providing excellent recognition results.
Tool-support for the analysis of hybrid systems and models
Authors: Andreas Bauer, Markus Pister, Michael Tautschnig
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper introduces a method and tool-support for the automatic analysis and verification of hybrid and embedded control systems, whose continuous dynamics are often modelled using MATLAB/Simulink. The method is based upon converting system models into the uniform input language of our efficient multi-domain constraint solving library, ABSOLVER, which is then used for subsequent analysis. Basically, ABSOLVER is an extensible SMT-solver which addresses mixed Boolean and (nonlinear) arithmetic constraint problems as they appear in the design of hybrid control systems. It allows the integration and semantic connection of various domain specific solvers via a logical circuit, such that almost arbitrary multi-domain constraint problems can be formulated and solved. Its design has been tailored for extensibility, and thus facilitates the reuse of expert knowledge, in that the most appropriate solver for a given task can be integrated and used. As such the only constraint over the problem domain is the capability of the employed solvers. Our approach to systems verification has been validated in an industrial case study using the model of a car's steering control system. However, additional benchmarks show that other hard instances of problems could also be solved by ABSOLVER in respectable time, and that for some instances, ABSOLVER's approach was the only means of solving a problem at all.
Self-Adaptive Systems for Information Survivability: PMOP and AWDRAT
Authors: Howard Shrobe, Robert Laddaga, Bob Balzer, Neil Goldman, Dave Wile, Marcelo Tallis, Tim Hollebeek, Alexander Egyed
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Information systems form the backbones of the critical infrastructures of modern societies. Unfortunately, these systems are highly vulnerable to attacks that can result in enormous damage. This paper describes two related systems PMOP and AWDRAT1 that were developed during the DARPA Self Regenerative Systems program. PMOP defends against insider attacks while AWDRAT is intended to detect compromises to software systems. Both rely on self-monitoring, diagnosis and self-adaptation. We describe both systems and show the results of experiments with each
Evaluating Two Visualization Techniques for Genome Comparison
Authors: Morel Henley, Mikkel Hagen, R. Daniel Bergeron
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Genomic study is fairly novel. Typical research processes are not established yet. Many new discoveries are happening in this area all the time. Are current methods of visualizations effective? What works well? What could be improved? These are some of the questions we are interested in evaluating for two graphical tools used to compare nucleotide sequences. Scatter plots and parallel coordinate-like visuals have been used in genomics for identifying similarities in genetic code. Our preliminary evaluation focuses on determining the aspects of the two visualizations that are successful and those that need enhancements.
ROPE: a reactive, opportunistic protocol for environment monitoring sensor networks
Authors: R. Cardell-Oliver
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

The goal of sensor networks that monitor the environment is to detect and report the temporal and spatial dynamics of that environment and to run unattended for several months. Meeting all three of these requirements in real applications has proved to be a challenging task. The paper presents a novel protocol for data gathering that adapts opportunistically to changes in its environment. Each node compresses its gathered data locally, transmitting a burst of data when communication conditions are good. We report the design and analysis of the protocol and results of preliminary implementation tests using CSIRO Flecks and TinyOS.
Mobile objects and agents (MOA)
Authors: Dejan S. Milojičić, William LaForge, Deepika Chauhan
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

This paper describes the design and implementation of the Mobile Objects and Agents (MOA) project at the Open Group Research Institute. MOA was designed to support migration, communication and control of agents. It was implemented on top of the Java Virtual Machine, without any modifications to it. The initial project goals were to support communication across agent migration, as a means for collaborative work; and to provide extensive resource control, as a basic support for countering denial of service attacks. In the course of the project we added two further goals: compliance with the Java Beans component model which provides for additional configurability and customization of agent system and agent applications; and interoperability which allows cooperation with other agent systems. This paper analyzes the architecture of MOA, in particular the support for mobility, naming and locating, communication, and resource management. Object and component models of MOA are discussed and some implementation details described. We summarize the lessons learned while developing and implementing MOA and compare it to related work.