ppxscal/embedding_network huggingface dataset:
Subword-based text-dependent speaker verification system with user-selectable passwords
Authors: M. Sharma
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A subword-based, text-dependent speaker verification system that embodies the capability of user-selectable passwords (ideally, with no constraints on the choice of vocabulary words or the language) is presented. A novel automatic speech segmentation procedure, called the "blind" segmentation, is also introduced. This algorithm segments speech without any linguistic knowledge and makes the subword modeling of the user-selectable password realizable in the proposed system. The subword modeling is done using the neural tree networks (NTNs). The NTN is a hierarchical classifier that combines the properties of decision trees and feed-forward neural networks. The proposed system also takes advantage of such concepts as the multiple classifier fusion and data resampling to successfully boost the system performance.
A code grouping interference cancellation receiver in OVSF DS-CDMA downlink
Authors: Won Ha, Junghwa Bae, Jinwoo Park
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper presents the interference cancellation receiver for direct sequence code division multiple access (DS-CDMA) downlink channel with orthogonal variable spreading factor (OVSF) channelization code. The proposed receiver uses code grouping by the correlation property between OVSF mother and child codes. The proposed CGIC receiver does not requires the code information and activity of other user. The CGIC receiver has a lower computational complexity than other multiuser interference cancellation receivers. In the computer simulation results, the proposed receiver demonstrated huge performance improvement over the conventional matched filter receiver, RAKE receiver and serial interference cancellation (SIC) receiver in a multipath channel.
Content Based Image Retrieval System for Multi Object Images Using Combined Features
Authors: Aradhana Katare, Suman K. Mitra, Asim Banerjee
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper presents content-based image retrieval (CBIR) system for the multiobject images. The goal is to retrieve those images from the database, which contains the query object, which is a difficult problem when an image consists of multiple objects with arbitrary pose. In this paper we propose a method that uses GVF active contour for the efficient shape segmentation in a multiple object scenario. We have developed a novel technique for automatic initialisation of active contour. Using only shape information degrades performance in pose varying cases. As an attempt towards mitigating this problem, colour features are also used. The preliminary results obtained by our approach are very encouraging.
A spectral 2-D Wold decomposition algorithm for homogeneous random fields
Authors: Fang Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

The theory of the 2-D Wold decomposition of homogeneous random fields is effective in image and video analysis, synthesis, and modeling. However, a robust and computationally efficient decomposition algorithm is needed for use of the theory in practical applications. This paper presents a spectral 3-D Wold decomposition algorithm for homogeneous and near homogeneous random fields. The algorithm relies on the intrinsic fundamental-harmonic relationship among Fourier spectral peaks to identify harmonic frequencies, and uses a Hough transformation to detect spectral evanescent components. A local variance based procedure is developed to determine the spectral peak support. Compared to the two other existing methods for Wold decompositions, global thresholding and maximum-likelihood parameter estimation, this algorithm is more robust and flexible for the large variety of natural images, as well as computationally more efficient than the maximum-likelihood method.
Delineation of support domain of feature in the presence of noise
Authors: Tao Pei, A-Xing Zhu, Chenghu Zhou, Baolin Li, Chengzhi Qin
Venue: Computers Geosciences (2007)

Clustered events are usually deemed as feature when several spatial point processes are overlaid in a region. They can be perceived either as a precursor that may induce a major event to come or as offspring triggered by a major event. Hence, the detection of clustered events from point processes may help to predict a forthcoming major event or to study the process caused by a major event. Nevertheless, the locations of existing clustered events alone are not sufficient to identify the area susceptible to a potential major future event or to predict the potential locations of similar future events, so it is desirable to know the shape and the size of the region (the ''territory'' of feature events) that the feature process occupies. In this paper, the support domain of feature (SDF), the region over which any feature event has the equivalent likelihood to occur, is employed to approximate the ''territory'' of feature events. A method is developed to delineate the SDF from a region containing spatial point processes. The method consists of three major steps. The first is to construct a discrimination function for separating feature points from noise points. The second is to divide the entire area into a regular mesh of points and then compute a fuzzy membership value for each grid point belonging to the SDF. The final step is to trace the boundary of the SDF. The algorithm was applied to two seismic cases for evaluation, one is the Lingwu earthquake and the other is the Longling earthquakes. Results show that the main earthquakes in both areas as well as most aftershocks triggered by them fell into the estimated SDFs. The case study of Longling shows that the algorithm can deal with a region containing more than two processes.
Reducing computational complexity and response latency through the detection of contentless frames
Authors: R. A. Sukkar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

In this paper, we present a method that manipulates the decoding network to reduce both computational complexity and response latency while maintaining high ASR accuracy. The method employs a TSVQ (tree structured vector quantization) classifier that reliably discriminates between silence and non-silence frames. Reductions in computational complexity and response latency are achieved through three techniques: 1) silence skipping, 2) silence-based pruning of the dynamic programming network, and 3) early decision. Experimental results on a connected digit task and a large vocabulary company name task show that the proposed method can reduce ASR response latency by more than 82%. Furthermore, the computational complexity, measured in CPU seconds, was reduced by 13.6% on the connected digit task and 6.7% on the company name task while maintaining the recognition accuracy of the baseline system.
Global compact passive macromodeling algorithms for high-speed circuits
Authors: Dharmendra Saraswat
Venue:  (2006)

In the recent years, signal integrity has been at the forefront of new developments in CAD algorithms focussed on high-speed electronic circuits. With the continuous rise in operating frequencies, the interconnect effects such as delay, distortion, crosstalk and ringing become the dominant factors limiting the performance of VLSI systems. At relatively higher frequencies and increased level of integration, it is not always possible to find analytical or simulatable models for high-speed modules such as packages, vias, connectors, nonuniform transmission lines etc. In such a scenario, these devices are characterized by tabulated multiport parameters (S, Y, Z or T), obtained either through measurements or from the physical layout using rigorous full-wave electromagnetic simulations. However, transient simulation of such frequency-dependent tabulated data in the presence of nonlinear devices to obtain a global electrical assessment is a CPU expensive process due to the mixed frequency/time problem. Recently, several macromodeling algorithms have been proposed for this purpose. However, a major difficulty associated with these algorithms is that, they are either not able to guarantee the passivity of the resulting macromodel or when guaranteeing the passivity, they become prohibitively CPU expensive. In addition, further challenges are posed by modern designs which tend to contain multiple diverse high-speed modules. Such an emerging scenario typically leads to large sized circuit matrices and warrants unified passive reduction algorithms to facilitate fast simulations. However, the currently available algorithms cannot perform global passive reduction of such an environment with multiple diverse high-speed modules. In this thesis, novel algorithms are presented to address the above issues. A systematic methodology is presented for the passive macromodeling of tabulated data networks. For this purpose, fast passivity verification and enforcement algorithms are presented. These algorithms are suitable for small as well as large sized macromodels of tabulated networks. In addition, an algorithm with a guaranteed search direction is presented, to reduce the number of iterations during the passivity enforcement process. Also, a new algorithm is presented for a global reduction of circuits containing diverse high-speed modules. This algorithm permits a novel formulation to guarantee the passivity of the resulting reduced-order model. Also, an efficient algorithm is presented for the second-level reduction, to obtain further compact macromodels. The developed algorithms are robust and practical, and suitable for implementation in state-of-the-art design automation tools.
Requirement Driven Agent Collaboration Based on Functional Ontology and AMD
Authors: Liwei Zheng, Zhi Jin
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

With the increasing of Web services in Internet, composing existing services for satisfying new requirements has gained daily expanding attentions and interests. Many efforts have been pursued for supporting the essential activities in service composition. However, the existing techniques only focus on passive services which are waiting there for being discovered and invoked. we argue that it might be more attractive when Web services become active entities (Service Agent) distributed in Internet which can recognize the newly emergent requirements and compete with others for realize (part of) the requirements. Sometimes, more than one service agents have to collaborate to satisfy the requirements. That could be called as the requirement driven agent collaboration. This paper proposes a preliminary model for the requirement driven agent collaboration based on a functional ontology and the automated mechanism design.
A Static Verification Framework for Secure Peer-to-Peer Applications
Authors: Andrea Zisman
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

In this paper we present a static verification framework to support the design and verification of secure peer-to-peer applications. The framework supports the specification, modeling, and analysis of security aspects together with the general characteristics of the system, during early stages of the development life-cycle. The approach avoids security issues to be taken into consideration as a separate layer that is added to the system as an afterthought by the use of security protocols. The main functionality supported by the framework are concerned with the modeling of the system together with its security aspects by using an extension of UML, modeling of abuse cases to represent scenarios of attackers and assist with the identification of properties to be verified, specification of properties to be verified in a graphical template language, verification of the models against the properties, and visualization of the results of the verification process.
Manufacturing of micro electrodes using ultra sonic aided electrochemical machining
Authors: Feng-Tsai Wang, Chen-Siang Hsu, R. F. Shyu, C. T. Ho
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

In this study, a two-steps composite processing technology combining WEDG process, ultra sonic, and electrolysis machining is adapted to cut micro electrodes. Rod electrode of diameter 3.0 mm is cut to be 0.15 mm on wire-EDM machine in first step. A faster metal removal rate can be achieved on anode by ultra sonic aided electrolysis machining. The diameter of the microelectrode could be machined to 10 /spl mu/m in second step. Results have been revealed fine electrodes could be processed to a desired smaller size using proposed two-steps composite machining technology. With higher L/D ratio, the processed fine electrodes can be used for processing micro holes, deep micro holes, micro slots and manufacturing of micro nozzles.
The LF-ASD brain computer interface: on-line identification of imagined finger flexions in the spontaneous EEG of able-bodied subjects
Authors: Z. Bozorgzadeh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Focuses on developing a brain-computer interface (BCT) for asynchronous control applications, which are characterized by alternating periods of active control and attentive idleness. We have developed an asynchronous switch that users can control through their EEG. The online implementation of the Low-Frequency Asynchronous Switch Design (LF-ASD) system has shown promising results with actual index finger flexions by able-bodied subjects. This paper reports the results of the algorithm on imagined voluntary movements with able-bodied persons, demonstrating hit (true-positive) rates above 70% and false-positive rates below 3%. This work is a precursor to verifying an online switch operation for people with severe motor disabilities.
Transforming a high school student project in computer science into a significant scientific achievement
Authors: Barak Raveh, Bruria Haberman, Cecile Yehezkel
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

A special program for high school has been in operation in Israel whose aim is to expose young students to the field of computing. During their studies the students are required to develop a software project, and thus gain experience in software design. In the past students lacked proper guidance in technologically demanding projects. Here we describe how the work of a student who chose to develop an engine for automatic completion of sentences by the computer was enhanced through cooperation with academia in the innovative "Computer Science, Academia and Industry" educational program. Albeit highly talented, the student lacked necessary formal knowledge in advanced computing technologies. A graduate student who specializes in the field has mentored the high school student throughout design and implementation phase, enabling him to grasp an intuitive understanding of state of the art algorithms, and contribute creative ideas of his own, resulting in an award-winning project of scientific significance.
Identification of Critical Errors in Imaging Applications
Authors: Illia Polian, Damian Nowroth, Bernd Becker
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Practical on-line test methods do not cover all possible faults of a system. We propose a method to identify critical faults and distinguish them from non-critical ones. Low-cost on-line fault detection can focus on the critical faults. Alternatively, the circuit sites associated with critical faults could be selectively hardened to improve the overall reliability of a system. This is done in a cost-effective way because no hardening against non-critical faults is required. In this work, we concentrate on faults in imaging applications such as video. We classify faults based on their impact on the system behavior, i.e., the visibility of their effects by a human end-user. The psychovisual model from the JPEG compression method is used for fault effect classification.
A Multiphased Approach for Modeling and Analysis of the BitTorrent Protocol
Authors: Vivek Rai, Swaminathan Sivasubramanian, Sandjai Bhulai, Pawel Garbacki, Maarten van Steen
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

BitTorrent is one of the most popular protocols for content distribution and accounts for more than 15% of the total Internet traffic. In this paper, we present an analytical model of the protocol. Our work differs from previous works as it models the BitTorrent protocol specifically and not as a general file-swarming protocol. In our study, we observe that to accurately model the download process of a BitTorrent client, we need to split this process into three phases. We validate our model using simulations and realworld traces. Using this model, we study the efficiency of the protocol based on various protocol-specific parameters such as the maximum number of connections and the peer set size. Furthermore, we study the relationship between changes in the system parameters and the stability of the protocol. Our model suggests that the stability of BitTorrent protocol depends heavily on the number of pieces a file is divided into and the arrival rate of clients to the network.
Smooth movers: perceptually guided human motion simulation
Authors: Rachel McDonnell, Fiona Newell, Carol O'Sullivan
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

To animate a character, a number of poses are displayed in quick succession in order to create the illusion of motion. For most real-time applications, such as games, the pose update rate is largely constrained by the available hardware and overall simulation complexity. To date, no analysis of the factors that affect the perceived smoothness of animated virtual characters has been presented. In the first perceptual studies aimed at identifying such factors and their interactions, we have determined some thresholds that could be used to produce acceptably smooth human animations in a variety of conditions. Some interesting results were found, e.g., that character type, clothing, scene complexity or motion synchronicity had no effect on smoothness perception in our experiments, but cycle rate, linear velocity, motion complexity and group size all had a significant effect, with slower or lower intensity movements generally requiring fewer updates. Our results should be of real practical use to character animators in various application areas, but in particular to developers of real-time applications where Simulation Levels Of Detail (SLOD) need to be employed.
Designing wireless protocols: methodology and applications
Authors: M. Sgroi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Communication protocols are essential components of wireless systems. Present methods for protocol design are heuristic in nature and are not suited for next generation wireless systems where time-to-market concerns require correct-the-first-time implementations. In this paper we present a new design methodology for wireless protocols based on the principle of orthogonalization of concerns. In particular, the methodology separates function and architecture design and emphasizes the use of formal models to ensure correctness and reduce design time. Protocols are described using co-design finite state machines (CFSMs), a model of computation that has been introduced to allow the efficient capture of both the control and the data processing parts of the specification. Furthermore, algorithms for automatic hardware and software synthesis from CFSMs are available. This allows a fast exploration of different HW/SW partitions and the analysis of tradeoffs involved. Intercom, a mobile wireless system supporting full-duplex voice communication among different users, is presented and the design of its protocols is described. The design methodology presented here will be used for the design of PicoRadio, a low-power and highly adaptive network of sensors.
Text Display and Graphics Control on a Paintable Computer
Authors: William Butera
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Consider a display architecture where every pixel has its own dedicated graphics engine. Toward this end, we recast the rendering and graphics control of text for use on a paintable computer. Work on paintable computing is reviewed with a focus on the programming model based on autonomous, mobile code fragments (pfrags) which self-assemble into larger virtual structures. A device simulator is used to demonstrate pfrags interacting to form 2D coordinate scaffolds. Text characters, embodied as pfrag "seeds", use the scaffold to direct their migration and distribute models of the text and associated graphics code to the paint nodes. Affine transformations are demonstrated as an example of finely distributed graphics control.
Analysis of attacks on SDMI audio watermarks
Authors: Min Wu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper explains and analyzes the successful attacks submitted by the authors on four audio watermark proposals during a 3-week SDMI public challenge. Our analysis points out some weaknesses in the watermark techniques currently under SDMI consideration and suggests directions for further improvement. The paper also discusses the framework and strategies for analyzing the robustness and security of watermarking systems as well as the difficulty, uniqueness, and unrealistic expectations of the attack setup.
Parallel XML processing by work stealing
Authors: Wei Lu, Dennis Gannon
Venue: Proceedings of the 2007 workshop on Service-oriented computing performance: aspects, issues, and approaches (2007)

A language for semi-structured documents, XML has emerged as the core of the web services architecture, and is playing crucial roles in messaging systems, databases, and document processing. However, the processing of XML documents has been regarded as the performance bottleneck in most systems and applications. On the other side, the multicore processor, emerged as a solution for the clock-speed limitation of the modern CPUs, has been growingly prevalent. Leveraging the parallelism provided by the multicorere source to speedup the software execution is becoming the trend of the software development. In this paper, we present a parallel processing model for the XML document. The model is not designed just for a specific XML processing task, instead, it is a general model, by which we are able to explore various parallel XML document processing. The kernel of the model is a stealing-based dynamic load-balancing mechanism, called ThreadCrew, by which multiple threads are able to process the disjointed parts of the XML document in parallel with balanced load distribution. The model also provides a novel mechanism to trace the stealing actions, thus the equivalent sequential result can be gotten by gluing the multiple parallel-running results together. To show the feasibility and effectiveness of our approaches, we present our C# implementation of parallel XML serialization in this paper. Our empirical study shows our parallel XML serialization algorithm can improved the XML serializing performance significantly on a multicore machine.