ppxscal/embedding_network huggingface dataset:
Speaker adaptation with all-pass transforms
Authors: J. McDonough
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

In previous work, a class of transforms were proposed which achieve a remapping of the frequency axis much like conventional vocal tract length normalization. These mappings, known collectively as all-pass transforms (APT), were shown to produce substantial improvements in the performance of a large vocabulary speech recognition system when used to normalize incoming speech prior to recognition. In this application, the most advantageous characteristic of the APT was its cepstral-domain linearity; this linearity makes speaker normalization simple to implement, and provides for the robust estimation of the parameters characterizing individual speakers. In the current work, we exploit the APT to develop a speaker adaptation scheme in which the cepstral means of a speech recognition model are transformed to better match the speech of a given speaker. In a set of speech recognition experiments conducted on the Switchboard corpus, we report reductions in word error rate of 3.7% absolute.
Optimistic Parallelization of Floating-Point Accumulation
Authors: Nachiket Kapre, Andre DeHon
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

Floating-point arithmetic is notoriously nonassociative due to the limited precision representation which demands intermediate values be rounded to fit in the available precision. The resulting cyclic dependency in floating-point accumulation inhibits parallelization of the computation, including efficient use of pipelining. In practice, however, we observe that floating-point operations are "mostly" associative. This observation can be exploited to parallelize floating-point accumulation using a form of optimistic concurrency. In this scheme, we first compute an optimistic associative approximation to the sum and then relax the computation by iteratively propagating errors until the correct sum is obtained. We map this computation to a network of 16 statically-scheduled, pipelined, double-precision floating-point adders on the Virtex-4 LX160 (-12) device where each floating-point adder runs at 296MHz and has a pipeline depth of 10. On this 16 PE design, we demonstrate an average speedup of 6× with randomly generated data and 3-7× with summations extracted from Conjugate Gradient benchmarks.
Aggregating and Deploying Network Access Control Policies
Authors: Joaquin G. Alfaro, Frederic Cuppens, Nora Cuppens-Boulahia
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The existence of errors or inconsistencies in the configuration of security components, such as filtering routers and/or firewalls, may lead to weak access control policies - potentially easy to be evaded by unauthorized parties. We present in this paper a proposal to create, manage, and deploy consistent policies in those components in an efficient way. To do so, we combine two main approaches. The first approach is the use of an aggregation mechanism that yields consistent configurations or signals inconsistencies. Through this mechanism we can fold existing policies of a given system and create a consistent and global set of access control rules - easy to maintain and manage by using a single syntax. The second approach is the use of a refinement mechanism that guarantees the proper deployment of such a global set of rules into the system, yet free of inconsistencies.
Handshake Games
Authors: Luca Fossati
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In this paper I present a game model for the semantical analysis of handshake circuits. I show how the model captures effectively the composition of circuits in an associative way. Then I build a compact-closed category of handshake games and handshake strategies. I then consider the language Tangram and I define a semantics for this language simply by giving a denotation in the model to each handshake component that is used in the compilation of Tangram programs.
IIPP: integrated IP paging protocol with a power save mechanism: Research Articles
Authors: Ved P. Kafle, Sangheon Pack, Yanghee Choi, Eiji Kamioka, Shigeki Yamada
Venue: Wireless Communications Mobile Computing (2007)

The advent of advanced mobile&#x002F;wireless systems has been facilitating the battery-powered mobile computing devices (nodes) to remain always connected to the internet. However, until now, the power-drain rate of mobile nodes is very high in comparison with the available power of portable batteries. To reduce the energy consumption of mobile nodes, we present an integrated IP paging protocol (IIPP) by integrating the IP-layer paging protocol based on Mobile IPv4 regional registration (MIPRR) with a power save mechanism. IIPP reduces the frequency of signaling messages between mobile nodes and networks. When not sending or receiving data for a certain time, mobile nodes enter power save mode (PSM), and consume very low power. We formulate analytical models and carry out simulations to evaluate the proposed IIPP. The results show that, compared to MIPRR, IIPP significantly reduces the average power consumption of the mobile node and signaling overheads in the network. Copyright &copy; 2006 John Wiley & Sons, Ltd. This work was partially accomplished while the author was studying as a graduate student at the Multimedia and Mobile Communication Laboratory at Seoul National University.
Evolving the mapping between input neurons and multi-source imagery
Authors: P. R. W. Harvey, D. M. Booth, J. F. Boyce
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

We present a mutable input field concept that allows a neural network to evolve a mapping between its input layer and a 3-dimensional input cube consisting of a local window applied within multiple imagery sources, such as hyperspectral bands, feature maps, or even encoded tactical information regarding likely object location and class. This allows the net to exploit salient regions (both within and across sources) of what may otherwise be an unwieldy input domain. Small recurrent neural networks are evolved to perform object detection within airborne reconnaissance imagery that has been processed to provide 3 colour bands and 2 feature maps including one designed to identify man-made structures based on perpendicularity of edge direction. A variable input field is shown to provide faster convergence and superior detector fitness over a number of trials than a set of alternative fixed input field mappings.
Interactive animation and visualization in a virtual soil mechanics laboratory
Authors: M. E. Haque
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

With the advances in information technology over the last decade, the traditional teaching format of having an individual lecture to an audience has been supplemented and, in some cases, replaced by the rapid development and implementation of new distance learning methods. As technology rapidly changes, the importance of educating and training diverse populations of construction science students become more critical. It has become relatively easy to develop Web-based course materials for courses that do not have laboratory components. However, technology is currently available that allows for the development of virtual laboratories. It is now possible to develop laboratory courseware that can simulate very sophisticated and costly equipment and reach larger sections of the student population. The paper demonstrates a Web-based interactive virtual soil mechanics laboratory for construction science. The main elements of the presented approach are: a means of assimilating the students' interactive learning knowledge and behavior, representation of the instructor's guidance and assessment knowledge, and utilization of motivational techniques such as multimedia, animation and Java simulation of laboratory soil tests. The presented paper illustrates some of the laboratory soil tests that are simulated with multimedia interaction and visualization techniques for enhancing the student's subject visualization and conceptual understanding in soil mechanics.
Low-delay CELP with multi-pulse VQ and fast search for GSM EFR
Authors: S. Taumi, K. Ozawa, T. Nomura, M. Serizawa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper proposes a speech codec, named MP-CELP (multi-pulse-based CELP), with a 10 msec frame length, which has been developed for the GSM EFR (enhanced full-rate) codec standardization. A novel multi-pulse excitation signal quantization method is proposed, where the pulse amplitudes are vector-quantized (VQ). The combination search of the pulse position and the amplitude VQ remarkably enhances the performance. By restricting the pulse positions based on the algebraic-type structure, the search complexity and the bits are reduced. The divided pulse position search drastically reduces the position search complexity. The speech quality for MP-CELP is higher than that for G.728 LD-CELP. MP-CELP also satisfies all the speech quality requirements of the GSM EFR standardization except for the background noise condition.
Problems in graph connectivity
Authors: Balaji Raghavachari
Venue:  (2006)

We consider optimization problems where the main constraint is connectivity. Finding minimum-cost subgraphs with connectivity requirements is a fundamental problem in network optimization. This dissertation focuses on two important problems: the 2-vertex-connectivity problem and the 3-edge-connectivity problem. Improving approximation ratios for k-connectivity problems when k is small is quite a challenge because the problems are easily understood and fundamental, and a lot of researchers have worked on them and many papers have already been published. So, we had to come up with nontrivial algorithms to beat current ratios. Also, one of the uses of approximation algorithms for the above problems is that they can be used as black box algorithms for solving higher connectivity problems. Given a 2-connected graph G = (V, E), the 2-vertex-connected-spanning-subgraph (2VCSS) problem is to find a minimum cardinality subgraph that is also 2-connected. Given a 3-edge-connected graph G(V, E), the 3-edge-connected-spanning-subgraph (3ECSS) problem is to find a minimum cardinality subgraph that is also 3-edge-connected. We also discuss the average- k-VCSS problem and average-k-ECSS problem in this thesis. These problems deal with finding k-connected spanning subgraphs of minimum average weight. We present different approximation algorithms for edge connectivity and vertex connectivity problems. The following results are discussed in the dissertation: (1) An approximation algorithm with a performance ratio of 9/7 &ap; 1.286 for the 2VCSS problem. (2) An approximation algorithm with a performance ratio of 5/4 for the 2VCSS problem in graphs with a minimum-degree of three at every node. (3) An approximation algorithm with a performance ratio of 4/3 &ap; 1.33 is presented for the 3ECSS problem. (4) A 3-approximation algorithm for the average-k-ECSS problem. (5) An O(logk) approximation algorithm for the average- k-VCSS problem. (6) A 2 + &epsi; approximation algorithm for the average-k-VCSS in Euclidean graphs, for any constant &epsi; > 0. (7) A 3-approximation algorithm for the average- k-VCSS in graphs satisfying the triangle inequality.
An undergraduate curriculum evaluation with the analytic hierarchy process
Authors: L. Frair
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

An undergraduate curriculum committee has developed the use of the analytic hierarchy process (AHP) for the evaluation of alternative curriculum designs. The hierarchy consists of four levels of interaction-from the top most objective through affected parties (students, faculty, employers, etc.), curriculum components (design, science, math, etc.), to curriculum alternatives at the bottom. An Internet web site has been designed and is being implemented to collect AHP judgments from the affected parties. This collected information can then be used to rank the various curriculum alternatives generated by the committee and others. A description of AHP development for this curriculum design problem is provided. The implementation of an Internet web site to collect the AHP judgments is detailed. Finally the combination of the various AHP inputs for the ranking of the curriculum alternatives is discussed.
Reducing fine-grain communication overhead in multithread code generation for heterogeneous MPSoC
Authors: Lisane Brisolara, Sang-il Han, Xavier Guerin, Luigi Carro, Ricardo Reis, Soo-Ik Chae, Ahmed Jerraya
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

Heterogeneous MPSoCs present unique opportunities for emerging embedded applications, which require both high-performance and programmability. Although, software programming for these MPSoC architectures requires tedious and error-prone tasks, thereby automatic code generation tools are required. A code generation method based on fine-grain specification can provide more design space and optimization opportunities, such as exploiting fine-level parallelism and more efficient partitions. However, when partitioned, fine-grain models may require a large number of inter-processor communications, decreasing the overall system performance. This paper presents a Simulink-based multithread code generation method, which applies Message Aggregation optimization technique to reduce the number of inter-processor communications. This technique reduces the communication overheads in terms of execution time by reduction on the number of messages exchanged and in terms of memory size by the reduction on the number of channels. The paper also presents experiment results for one multimedia application, showing performance improvements and memory reduction obtained with Message Aggregation technique.
New time-frequency symbol classification
Authors: Byeong-Gwan Iem
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We propose new time-frequency (TF) symbols as the narrowband Weyl symbol (WS) smoothed by an appropriate kernel. These new symbols preserve time and frequency shifts on a random process. Choosing specific smoothing kernels, we can obtain various new symbols (e.g. Levin symbol and Page symbol). We link a quadratic form of the signal to the new symbols and Cohen's (1992) class of quadratic time-frequency representations, and we derive a simple kernel constraint for unitary symbols. We also propose an affine class of symbols in terms of the wideband Weyl symbol (P/sub 0/WS). These symbols preserve scale changes and time shifts. Furthermore, we generalize the smoothed versions of the WS and P/sub 0/WS to analyze random processes undergoing generalized frequency shifts or generalized time shifts.
New results and open problems on nonuniform filter-banks
Authors: S. Akkarakaran
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Nonuniform filter-banks (FBs) have traditionally been built either by cascading uniform ones in a tree structure or by direct design methods that lead to near-perfect reconstruction. However many theoretical issues remain unresolved. This paper begins by pointing out a number of these issues, and summarizes the known conditions for existence of nonuniform perfect reconstruction (PR) FBs. As a new contribution, we simplify some of these conditions and make them more explicit. We provide examples that illustrate some hitherto unobserved connections between these conditions.
Authentication in Wireless Networks
Authors: G. V. S. Raju, Rehan Akbani
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

With the explosive growth in the adoption of wireless networks in the recent years, the limitations of wireless security have become a topic of wide spread concern. It is easy for hackers to enter or leave a wireless network. They can directly attack the network and inject spurious packets, tamper with packets, drop packets, or impersonate another node. This violates the network's goals of availability, integrity and authentication. This paper presents an authentication scheme for Mobile Ad hoc Networks (MANETs) that is designed to combat such attacks from adversaries. In this scheme, every packet is authenticated at every node. The performance of the proposed scheme is compared with other published schemes and it is found to be just as efficient while improving on security.
QoS policies and architecture for cache/memory in CMP platforms
Authors: Ravi Iyer, Li Zhao, Fei Guo, Ramesh Illikkal, Srihari Makineni, Don Newell, Yan Solihin, Lisa Hsu, Steve Reinhardt
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

As we enter the era of CMP platforms with multiple threads/cores on the die, the diversity of the simultaneous workloads running on them is expected to increase. The rapid deployment of virtualization as a means to consolidate workloads on to a single platform is a prime example of this trend. In such scenarios, the quality of service (QoS) that each individual workload gets from the platform can widely vary depending on the behavior of the simultaneously running workloads. While the number of cores assigned to each workload can be controlled, there is no hardware or software support in today's platforms to control allocation of platform resources such as cache space and memory bandwidth to individual workloads. In this paper, we propose a QoS-enabled memory architecture for CMP platforms that addresses this problem. The QoS-enabled memory architecture enables more cache resources (i.e. space) and memory resources (i.e. bandwidth) for high priority applications based on guidance from the operating environment. The architecture also allows dynamic resource reassignment during run-time to further optimize the performance of the high priority application with minimal degradation to low priority. To achieve these goals, we will describe the hardware/software support required in the platform as well as the operating environment (O/S and virtual machine monitor). Our evaluation framework consists of detailed platform simulation models and a QoS-enabled version of Linux. Based on evaluation experiments, we show the effectiveness of a QoS-enabled architecture and summarize key findings/trade-offs.
Document clustering using small world communities
Authors: Brant W. Chee, Bruce Schatz
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Words in natural language documents exhibit a small world network structure. Thus the physics community provides us with an extensive supply of algorithms for extracting community structure. We present a novel method for semantically clustering a large collection of documents using small world communities. This method combines modified physics algorithms with traditional information retrieval techniques. A term network is generated from the document collection, the terms are clustered into small world communities, the semantic term clusters are used to generate overlapping document clusters. The algorithm combines the speed of single link with the quality of complete link. Clustering takes place in nearly real-time and the results are judged to be coherent by expert users. Our algorithm occupies a middle ground between speed and quality of document clustering.
Effective use of individual user profiles with software distribution
Authors: Mark Murray, Troy Roberts
Venue: Proceedings of the 1997 Workshop on Large Scale System Administration of Windows NT (1997)

Many system administrators have found themselves supporting user communities who are either quite mobile and use many different workstations or share one workstation among multiple users. Within Windows NT networks, these users can still maintain unique personal settings for the software packages they each use through the use of individual profiles. Individual user profiles have, however, introduced a problem in the typical software distribution process. During software installations, whether software distribution tools are used or not, there is usually a portion of the "package" that requires updates in each users personal profile or configuration storage area (often their home directory). These updates include default, and often required, user customizable settings and can only be performed for the user that is logged in at the time the package is distributed to each workstation. Problems occur when a user who was not logged in during the distribution of a particular package attempts to use that package. This user will not have the required registry entries or configuration files and the software package will not work properly, if at all. Some software packages work around this by creating a default configuration on the fly, but they are not in the majority, and this does not allow organizations to customize the default settings that a user will receive. At Interprovincial Pipe Line Inc. we have implemented a combination of commercial and home-grown utilities that provide a flexible and complete software distribution mechanism to a network of Windows NT 4.0 client workstations. These utilities specifically address the issue of applying individual user defaults and customizations after an application has been installed.
Two-pass strategy for continuous speech recognition with detection and transcription of unknown words
Authors: S. Matsunaga, H. Sakamoto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper proposes a new approach of using a two-pass strategy to effectively recognize continuous speech including unknown words. In this approach, the first pass uses context-independent phoneme HMMs to recognize registered words and phoneme-cluster HMMs to detect unknown words. In the second pass context-dependent phone models are used for precise recognition where unknown words are transcribed. In sentence recognition experiments using this unknown-word processing, phoneme cluster models that consider the Japanese syllabic construction achieved a higher word accuracy rate of 70.3%, compared with 59.2% for sentence recognition without this processing. Furthermore, the amount of processing was reduced by about half compared with a detection method using phoneme HMMs. The total system achieves a 75.2% phoneme accuracy rate including the transcription of unknown words.
Teaching software reuse with JavaBeans
Authors: Juan Wang
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Software reuse is one of the important topics in a software engineering course. Ada and C++ are traditionally two popular languages for teaching software reuse and software engineering in general. This paper reports our experience by adopting JavaBeans as an example component architecture in our upper-level software engineering course CSIS499 (Special Topics in Software Engineering), which emphasizes software reuse and software metrics. Both software development for reuse and with reuse are discussed based on JavaBeans. The benefits of teaching software reuse with JavaBeans include a well-defined component model, no portability overhead, availability of building tools, support for reusability metrics, and adaptability to different levels of students.