ppxscal/embedding_network huggingface dataset:
Signal modeling for isolated word recognition
Authors: M. Karnjanadecha
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper presents speech signal modeling techniques which are well suited to high performance and robust isolated word recognition. Speech is encoded by a discrete cosine transform of its spectra, after several preprocessing steps. Temporal information is then also explicitly encoded into the feature set. We present a new technique for incorporating this temporal information as a function of the temporal position within each word. We tested features computed with this method using an alphabet recognition task based on the ISOLET database. The HTK toolkit was used to implement the isolated word recognizer with whole word HMM models. The best result obtained based on 50 features and speaker independent alphabet recognition was 98.0%. Gaussian noise was added to the original speech to simulate a noisy environment. We achieved a recognition accuracy of 95.8% at a SNR of 15 dB. We also tested our recognizer with simulated telephone quality speech by adding noise and band limiting the original speech. For this "telephone" speech, our recognizer achieved 89.6% recognition accuracy. The recognizer was also tested in a speaker dependent mode, resulting in a 97.4% accuracy on test data.
A projection-correlation algorithm for acoustic echo cancellation in the presence of double talk
Authors: T. Creasy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper presents a novel variable-step-size affine projection adaptive algorithm for acoustic echo cancellation. The adaptation rate is controlled by a measure of the correlation between instantaneous and long-term averages of the projection vectors. The proposed algorithm offers excellent robustness against double talk, good initial convergence and tracking ability, and low steady state misadjustment. Simulation results confirming improved performance are provided.
Analysis of Trust in Internet and Mobile Commerce Adoption
Authors: Dai-Yon Cho, Hyun Jung Kwon, Hyoung-Yong Lee
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Understanding user acceptance of the Internet, especially the intentions to use Internet commerce and mobile commerce, is important in explaining the fact that these commerce have been growing at an exponential rate in recent years. This paper studies factors of new technology to better understand and manage the electronic commerce activities. The theoretical model proposed in this paper is intended to clarify the factors as they are related to the Technology Acceptance Model. More specifically, the relationship among trust and other factors are hypothesized. Using the Technology Acceptance Model, this research reveals the importance of the hedonic factor. The result of this research implies that the ways of stimulating and facilitating customers' participation in mobile commerce should be differentiated from those in Internet commerce.
Mobile Information and Communication Technologies in the Context of the Pharmaceutical Sales Force Work
Authors: Chihab BenMoussa
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We need to understand how effective information and communication technologies are and to derive lessons from their implementation. This paper investigates the effectiveness of a mobile information system designed to help the sales force of a mediumsized pharmaceutical company in dealing with the barriers to performance they face when operating within a mobile work setting. The paper also examines issues associated with the implementation of such a system. The results show that the members of the sales force were pleased with their firm's initiative to invest in the mobile information system. However, they were underutilizing it in terms of dealing with a number of barriers to performance they face in the field. The study suggests that in order to enhance the adoption of technology by the sales force, training that goes beyond technical issues and focuses on the sales force's way of working is the key.
Combinatorial complexity in O-minimal geometry
Authors: Saugata Basu
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

In this paper we prove tight bounds on the combinatorial and topological complexity of sets dened in terms of n denable sets belonging to some fixed denable family of sets in an o-minimal structure. This generalizes the combinatorial parts of similar bounds known in the case of semi-algebraic and semi-Pfaffian sets, and as a result vastly increases the applicability of results on combinatorial and topological complexity of arrangements studied in discrete and computational geometry. As a sample application, we extend a Ramsey-type theorem due to Alon et al. [3], originally proved for semi-algebraic sets of fixed description complexity to this more general setting.
1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258)
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The following topics were dealt with: CELP speech coding; large vocabulary speech recognition; speech analysis; acoustic modelling; automatic speech recognition systems and applications; low bit rate speech coding; robust speech recognition in noisy environments; speaker recognition; speech production and synthesis; feature extraction; speech understanding; language modelling; lexical issues/search; quantisation; utterance verification/acoustic modelling; speech enhancement; language recognition; echo cancellation and noise control; auditory modelling; hearing aids; spatial audio; music applications; pattern recognition and speech processing; neural architectures; signal separation; image processing; nonlinear signal processing; filter design; signal detection; wavelets; adaptive filtering; time-frequency analysis; time-scale analysis; signal modelling and representation; filterbanks; source and signal separation; fast algorithms; frequency and phase estimation; spectral analysis and higher order statistics; signal reconstruction; transforms and statistical estimation; Markov and Bayesian estimation and classification; system identification, equalisation and noise suppression; parameter estimation; DSP development tools; VLSI building blocks; DSP architectures and system design; education; signal sampling; steganography; information embedding, digital watermarking and data hiding; rapid prototyping; communication technology; automotive applications; industrial signal processing; defence and security applications; biomedical applications; voice and media processing; adaptive interference cancellation; source coding and compression; modulation; channel estimation and equalisation; blind multiuser communications; CDMA and space-time processing; time-varying channels and self-recovering receivers; signal processing for communications; multi-channel equalisation; multicarrier communications; radar and sonar signal processing; array processing; direction finding; blind identification, separation and equalisation; antenna arrays; multimedia analysis and retrieval; audio and video processing for multimedia applications; video compression; image coding; image restoration; image analysis; object identification and tracking; motion estimation; medical imaging; image segmentation; face recognition. 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
Deducing similarities in Java sources from bytecodes
Authors: Brenda S. Baker, Udi Manber
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Several techniques for detecting similarities of Java programs from bytecode files, without access to the source, are introduced in this paper. These techniques can be used to compare two files, to find similarities among thousands of files, or to compare one new file to an index of many old ones. Experimental results indicate that these techniques can be very effective. Even changes of 30% to the source file will usually result in bytecode that can be associated with the original. Several applications are discussed.
Tracking and Organizing Visual Exploration Activities across Systems and Tools
Authors: Dennis P. Groth
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Modern knowledge discovery activities occur in highly dynamic environments. Specific activities may involve multiple tools, techniques, systems, individuals, and locations. In addition to these complexities, the span of time involved with discovery may vary from short to long, as well as being contiguous or disjoint. This paper presents a framework for tracking the history, or provenance, of the discovery process across applications, systems, and users. The resulting capabilities provide fine-grained provenance information relative to the discovered information. Along with the provenance framework, a prototype system is used to demonstrate the main concepts of the proposed approach.
A Custom Instruction Approach for Hardware and Software Implementations of Finite Field Arithmetic over $$\mathbb{F}_{{2^{{163}} }} $$ using Gaussian Normal Bases
Authors: Marcio Juliato, Guido Araujo, Julio López, Ricardo Dahab
Venue: Journal of VLSI Signal Processing Systems (2007)

This paper presents a comprehensive analysis of the design of custom instructions in a reconfigurable hardware platform dedicated to accelerate arithmetic operations in the binary field $$\mathbb{F}_{{2^{{163}} }} $$ , using a Gaussian normal basis representation. The resulting platform is capable of running real applications, thus allowing a precise measurement of the execution overheads, and a fair comparison of the hardware and software speedups at several implementation levels. By using this approach, we determine which field operations (e.g., multiplication) are better suited to constrained environments, and which ones provide an enhanced performance in general-purpose systems. Experimental results reveal that by using our fastest field multiplier implemented as a custom instruction in a combined hardware/software approach, we accelerate point multiplication (the fundamental operation in Elliptic Curve Cryptography) over 126 times.
Using computer assisted collaborative learning to improve distance education
Authors: N. A. Pendergrass
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper describes how computer assisted, collaborative learning techniques can be used to improve distance learning courses which use two-way compressed video. With these methods, students spend most of their class time working in groups on problems or interactive demonstrations. The approach provides an active learning experience and sharply reduces the amount of information which must be sent through the video system. The methods also increase interaction between students and the instructor and raise student motivation to overcome obstacles in the course. This paper also discusses many of the practical issues that are involved in distance education for classes using either collaborative learning or lecture based methods.
Evaluation of Reliable Data Transmission Protocol in Wireless Sensor-Actuator Network
Authors: Kiyohiro Morita, Keiji Ozaki, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In a wireless sensor-actuator network (WSAN), sensor and actuator nodes exchange messages in a wireless channel. Sensor nodes can deliver messages to only close nodes while actuator can deliver to distant nodes. Messages sent by nodes might be lost due to collision and noise. The more number of sensor nodes are located in an event area, the more number of messages are lost due to collision. In the redundant data transmission (RT) protocol, a sensor node sends a message with not only its sensed value but also sensed values received from other sensor nodes. Even if a message with a sensed value v from a sensor node is lost, an actuator node can take the value v from other messages. We evaluate the RT protocol compared with the CSMA protocol in terms of how much sensing data a node can receive in presence of messages loss.
Generalized Fibonacci Cubes
Authors: W. J. Hsu, M. J. Chung
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

We present a new class of interconnection topolo gies called the generalized Fibonacci cubes (GFCs, for short) that encompass a range of networks such as the popular Boolean cube (hypercube) and the recent second-order Fibonacci cube in [5]. We show that each GFC has a recursive and self-similar structure and hence exhibits fault tolerant features. We also show that each GFC admits simple embedding of other useful net works such as cycles, trees, and meshes. The GFCs may find applications in fault-tolerant com puting.
Nonsecurity Considerations in Security Decisions
Authors: Bruce Schneier
Venue: IEEE Security and Privacy (2007)

Security decisions are generally made for nonsecurity reasons. For security professionals and technologists, this can be a hard lesson. We like to think that security is vitally important. But anyone who has tried to convince the sales VP to give up her department's Blackberries knows security is often viewed as a minor consideration in a larger decision.
Modeling Web Services with FSM Modules
Authors: Hrushikesha Mohanty, Jitesh Mulchandani, Deepak Chenthati, R. K. Shyamasundar
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Web service modeling research is largely limited to service conversation i.e. choreography. Recently, we have proposed a method to model both service orchestration and choreography using a FSM. But a flat approach (i.e. modeling at one level only) is not suitable to represent a large and complex service process. For the purpose, we propose a method to model web services using FSM modules. And shown that such a model is structured, understandable (especially while handling concurrent activities), verifiable and useful for model transformation. We have proposed two operators to model temporal behavior of web services.
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
Authors: Manish Bhide, Krithi Ramamritham, Mukund Agrawal
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically, a user application is interested in the value of some function defined over the data items. For example, the traffic management system can make control decisions based on the observed traffic at major intersections; stock investors can manage their investments based on the value of their portfolios. In this paper we present a system that supports pull based data refresh and query processing techniques where such queries access data from multiple distributed sources. Key challenges in supporting such Continuous Multi-Data Incoherency BoundedQueries lie in minimizing network and source overheads, without loss of fidelity in the query responses provided to users. We address these challenges by using mathematically sound approaches based on Gradient Descent and Constraint Optimization which allow us to adapt the refresh frequencies of the dynamically changing data and adjust the quality of service provided to different users.
Power Reduction in VLIW Processor with Compiler Driven Bypass Network
Authors: Neeraj Goel, Anshul Kumar, Preeti Ranjan Panda
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

With the increase in issue width, bypass control of a processor become more complex. Also, in a processor, operands are read both from register file as well as from bypass. For a multi-port register file, read/write energy is much more than that of single port register file. Both redundant register read/write and bypass control area can be reduced with compiler hints for register bypass. In this work we suggest a innovative way to represent compiler bypass hints that serve both these motivations. Further, bypass hints are used in effective design of multi-stage bypass network. Experiments on mediabench benchmarks show that by using our approach, (i) register file energy savings can be as as much as 60% (ii) and synthesis of VLIW core saves 2-4% of the core area.
An Approach to QoS-aware Service Selection in Dynamic Web Service Composition
Authors: Yan Yang, Shengqun Tang, Youwei Xu, Wentao Zhang, Lina Fang
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Web service composition has been recognized as a flexible way for resource sharing and application integration. For Web services providing similar functionality, Quality of Service (QoS) is the main factor to differentiate them. In this paper, the issue of QoS driven service selection in dynamic Web service composition is investigated. OWL-S is extended with a flexible QoS model to better facilitate service selection process. Based on different global constraints users set, the QoS-based service selection problems for composite services are divided into three categories. For each category, the mathematical model and its corresponding solving algorithm are put forward separately. Simulation experiments are conducted to show the validity and efficiency of the algorithms.
Development of an ASIP enabling flows in ethernet access using a retargetable compilation flow
Authors: K. Van Renterghem, P. Demuytere, D. Verhulst, J. Vandewege, Xing-Zhi Qiu
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In this paper we research an FPGA based Application Specific Instruction Set Processor (ASIP) tailored to the needs of a flow aware Ethernet access node using a retargetable compilation flow. The toolchain is used to develop an initial processor design, asses the performance and identify the potential bottlenecks. A second design iteration results in a fully optimized ASIP with a VLIW instruction set which allows for high degree of parallelism among the functional units inside the ASIP and has dedicated instructions to accelerate typical packet processing tasks. This way, a single processor is capable of handling the complete throughput of a gigabit Ethernet link. To reach the target of a 10 Gbit/s Ethernet access node several processors operate in parallel in a multicore environment.
A PC course-which way is the frontier?
Authors: T. W. Schultz
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

A new course in an area of microcomputers has resulted from requests by other out-of-area faculty. It was desired to establish a course that would be different from software or PC-as-a-computing-tool courses, as well as to one different from beginning microprocessor courses. The complexity of PC hardware presented a problem-since detailed exploration of the PC itself was inappropriate, should students build boards, add to existing boards, or use pre-built boards? How could the course avoid software obsolescence? Should students interface to DOS or Windows, and should they develop custom graphical interfaces? How much software can be learned when there is such a large hardware content? Should this be called a Junior, Senior or Graduate course? There were conflicting suggestions and recommendations. The issues and politics of these decisions are described Finally, the challenge of teaching a course in an area where the instructor is not yet an expert is described. Steps to finding help and ways to keep up to date are suggested.
Deploying Wide-Area Applications Is a Snap
Authors: Carles Pairot Gavalda, Pedro Garcia Lopez, Ruben Mondejar Andreu
Venue: IEEE Internet Computing (2007)

The Structured overlay Networks Application Platform (Snap) is a J2EE-compatible wide-area Web application deployment infrastructure. Due to its structured peer-to-peer overlay network substrate, Snap offers three benefits to wide-area Web application deployment: easyadaptation of existent J2EE applications to a scalable network, a secure and decentralizeddeployment environment, and transparent embedded services, such as persistence, loadbalancing, fault tolerance, and edge computing.
Comparison of CDMA spatio-temporal receivers structures
Authors: M. Le Bot
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper reports an analysis of the performance of code division multiple access (CDMA) system employing spatio-temporal adaptive receiving filters at the base station. We show that taking into account the spatial and temporal statistical properties of the interference is a very interesting and efficient way of increasing the cell capacity. Since a pilot sequence is used to estimate the receiving filter, the influence of the number of available pilot symbols on the receiver's performance is studied.
Acute Triangulations of Flat Mobius Strips
Authors: Liping Yuan, Tudor Zamfirescu
Venue: Discrete Computational Geometry (2007)

In this paper we investigate the acute triangulations of flat Mobius strips. We find out that we can always triangulate a flat Mobius strip with at most nine acute triangles, and sometimes (but not always) that many triangles are really needed.
Increasing effective link bandwidth by suppressing replicated data
Authors: Jonathan Santos, David Wetherall
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

In the Internet today, transfer rates are often limited by the bandwidth of a bottleneck link rather than the computing power available at the ends of the links. To address this problem, we have utilized inexpensive commodity hardware to design a novel link layer caching and compression scheme that reduces bandwidth consumption. Our scheme is motivated by the prevalence of repeated transfers of the same information, as may occur due to HTTP, FTP, and DNS traffic. Unlike existing link compression schemes, it is able to detect and use the long-range correlation of repeated transfers. It also complements application-level systems that reduce bandwidth usage, e.g., Web caches, by providing additional protection at a lower level, as well as an alternative in situations where application-level cache deployment is not practical or economic. We make three contributions in this paper. First, to motivate our scheme we show by packet trace analysis that there is significant replication of data at the packet level, mainly due to Web traffic. Second, we present an innovative link compression protocol well-suited to traffic with such long-range correlation. Third, we demonstrate by experimentation that the availability of inexpensive memory and general-purpose processors in PCs makes our protocol practical and useful at rates exceeding T3 (45 Mbps).