ppxscal/embedding_network huggingface dataset:
Nonlinear echo cancellation using decoupled A-B net structure
Authors: G. B. Sentoni
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper proposes a general nonlinear digital filter structure for echo cancellation applications. Although echo cancelers employing linear digital filter structures are more widely used, there are many applications where nonlinear filters must be used. We propose using the DABNet (Decoupled A-B Net) filter, which is composed of a decoupled linear dynamic system followed by a nonlinear static map, for echo cancellation. The linear dynamic system is initially spanned by a set of discrete Laguerre systems, and then cascaded with a single hidden layer perceptron. A model reduction technique can be performed not only to identify the main time constants, but also to reduce the dimensionality of the perceptron input. The DABNet structure is able to approximate any nonlinear, causal, discrete time invariant, multiple-input single output system with fading memory. Comparisons between echo cancelers implemented with the DABnet and nonlinear FIR filters are presented.
Cyberinsurance in IT Security Management
Authors: Walter S. Baer, Andrew Parkinson
Venue: IEEE Security and Privacy (2007)

Cyberinsurance to cover losses and liabilities from network or information security breaches can provide incentives for security investments that reduce risk. Although cyberinsurance has evolved, industry has been slow to adopt it as a risk management tool.
Embracing Wired Networks
Authors: Mache Creeger
Venue: Queue (2007)

Most people I know run wireless networks in their homes. Not me. I hardwired my home and leave the Wi-Fi turned off. My feeling is to do it once, do it right, and then forget about it. I want a low-cost network infrastructure with guaranteed availability, bandwidth, and security. If these attributes are important to you, Wi-Fi alone is probably not going to cut it.
Data Model Transformation for Supporting Interoperability
Authors: Gorka Benguria, Xabier Larrucea
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

One of the main barriers for interoperability today, is the proliferation of different standards and proprietary formats for the exchange of information among the organizations willing to interoperate. But how can the different standards and formats be reconciled? Traditionally, code based mapping techniques have been performed to reconcile standards and formats, but recently a new approach has appeared for dealing with this situation; it is known as model transformation. Model transformation techniques support the engineer in the definition of formal translation rules which allow communication between incompatible components. This paper presents two of these techniques, MTF (Model transformation Framework) and ATL (Atlas transformation language) and compares them with the traditional approach.
The Future that Never Was
Authors: Paul F. Dubois
Venue: Computing in Science and Engineering (2007)

The author, columnist Paul Dubois, discusses some of the predictions made by top researchers 10 years ago.
Analysis of protein-protein interactions using multiple biological data sets
Authors: Ting Chen
Venue:  (2006)

With the availability of various large-scale biological data sets, it is crucial to develop systematic methods to unravel cellular activities at the protein level. In this thesis, we study protein functions and protein interactions, and proteins associated with phenotypes by integrating various biological data sets. First, we develop a maximum likelihood estimation method that uses both protein localization and gene expression data to estimate the reliability of protein interaction data sets. By integrating both data sets, we can obtain more accurate estimates of the reliability of various interaction data sets than using a single data set. Second, we use protein-protein interactions to understand protein functions. We develop a novel Kernel Logistic Regression (KLR) method based on diffusion kernels for protein interaction networks. We extend our model by incorporating multiple biological data sources. We show that the KLR approach significantly improve the accuracy of protein function predictions over the other models. Third, we infer domain interactions using multiple biological data sources. We propose a new measure, the expected number of observed interactions for each pair of domains from protein interaction data. We score domain interactions based on protein interaction data from yeast, worm, fruity, and humans. We also incorporate information on pairs of domains that coexist in known proteins and on pairs of domains with the same function to construct a high-confidence set of domain-domain interactions using a Bayesian approach. As a result, a total of 2,420 high-confidence domain interactions are obtained and these domain interactions are used to unravel detailed protein and domain interactions in several protein complexes. Forth, we develop a new method for prioritizing genes associated with a phenotype by combining gene expression and protein interaction data (CGI) based on a Markov Random Field framework. The method has been applied to three yeast gene expression data sets of compendium knockout, stress response, and cell cycle, together with various protein interaction data sets. We show that the CGI outperforms the Pearson correlation coefficient in prioritizing genes associated with a phenotype.
Design and implementation of an fpga-based scalable pipelined associative simd processor array with specialized variations for sequence comparison and msimd operation
Authors: Robert A. Walker
Venue:  (2006)

Over the years a number of variations on associative computing have been explored. At Kent State University (KSU), associative SIMD computing has its roots at Goodyear Aerospace Corporation, but most recently has focused on exploring the power of the associative computing paradigm as compared to traditional SIMD, and even MIMD, computing. In contrast, Prof. Robert Walker's research group at KSU has focused on implementing those associative concepts on a single chip by developing a new associative SIMD RISC processor, called the ASC (ASsociative C&barbelow;omputing) Processor, using modern FPGA implementation techniques. This dissertation describes the development of a working, scalable, ASC Processor that is pipelined to improve performance, supports a reconfigurable network, can be specialized further for dedicated applications (e.g., genome processing), and that can realize the multiple SIMD (MSIMD) paradigm by supporting multiple control units. As a first step in this processor development, a Control Unit and a 4-PE Array developed previously by Master's students were integrated into the first working ASC Processor. This processor was then modified to develop the first scalable PE ASC Processor, and demonstrated on database processing and image processing. However, the core of this dissertation research was the design and implementation of a pipelined scalable ASC Processor, which as far as we are aware is the first working single-chip pipelined SIMD associative processor and perhaps the first single-chip pipelined SIMD processor in general. Compared to the first scalable ASC Processor, this pipelined processor not only gains the advantage of pipelining, but has a faster clock frequency due to a more efficient implementation. With that pipelined scalable ASC Processor as a base, two major architectural variations were explored. To support an innovative LCS algorithm for genome sequence comparison, the reconfigurable PE interconnection was modified with some features inspired by the coterie network, plus row and column broadcast buses. To better support control parallelism and increase PE utilization, a multiple-instruction-stream MASC Processor was developed, which dynamically assigns tasks to Processing Elements as the program executes.
Linguistic modeling with weighted double-consequent fuzzy rules based on cooperative coevolutionary learning
Authors: Rafael Alcalá, Jorge Casillas, Oscar Cordón, Francisco Herrera
Venue: Integrated Computer-Aided Engineering (2003)

This paper presents an evolutionary learning process for linguistic modeling with weighted double-consequent fuzzy rules. These kinds of fuzzy rules are used to improve the linguistic modeling, with the aim of introducing a trade-off between interpretability and precision. The use of weighted double-consequent fuzzy rules makes more complex the modeling and learning process, increasing the solution search space. Therefore, the cooperative coevolution, an advanced evolutionary technique proposed to solve decomposable complex problems, is considered to learn these kinds of rules. The proposal has been tested with different problems achieving good results.
Interactive presentation: Executable system-level specification models containing UML-based behavioral patterns
Authors: Leandro Soares Indrusiak, Andreas Thuy, Manfred Glesner
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Behavioral patterns are useful abstractions to simplify the design of the communication-centric systems. Such patterns are traditionally described using UML diagrams, but the lack of execution semantics in UML prevents the co-validation of the patterns together with simulation models and executable specifications which are the mainstream in today's system level design flows. This paper proposes a method to validate UML-based behavioral patterns within executable system models. The method is based on actor orientation and was implemented as an extension of the Ptolemy II framework. A case study is presented and potential applications and extensions of the proposed method are discussed.
Software Configuration Management, Fundament for Evolution of Large Existing Code Bases
Authors: Bart Leeten
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

The availability of an integrated code base is often taken for granted in common reengineering literature. In this paper, we report on the approaches used by the EDS eFlex project team to gain better control over a large, technology-heterogeneous code base in the context of the reengineering of a multi-million line software system. Specifically in the context of geographically dispersed teams, controlling the code base is a prerequisite for efficient evolution. After enlisting key evolution impediments emerging in the integration of software systems that each have their own code bases, we characterize our activities in unifying these code bases.
A new application of He's variational iteration method for quadratic Riccati differential equation by using Adomian's polynomials
Authors: S. Abbasbandy
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, the quadratic Riccati differential equation is solved by He's variational iteration method with considering Adomian's polynomials. Comparisons were made between Adomian's decomposition method (ADM), homotopy perturbation method (HPM) and the exact solution. In this application, we do not have secular terms, and if @l, Lagrange multiplier, is equal -1 then the Adomian's decomposition method is obtained. The results reveal that the proposed method is very effective and simple and can be applied for other nonlinear problems.
Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing
Authors: Kwangjin Park, Hyunseung Choo
Venue: IEEE Transactions on Computers (2007)

Indexing provides for selective tuning but suffers from the drawback that, in order to conserve battery power, the client has to wait for and tune to the index segment. In Location-Aware Mobile Services (LAMSs), it is important to reduce the query response time since a late query response may contain out-of-date information. In this paper, we present a broadcast-based spatial query processing scheme designed to support Nearest Neighbor (NN) query processing. With the proposed schemes, broadcast data items are sorted sequentially based on their locations and the clients can selectively tune to the desired data item without the need for an index segment. For the purpose of selective tuning, we present the Exponential Sequence Scheme (ESS) and Cluster-Based Fibonacci Sequence Scheme (CFS) schemes. The ESS and CFS schemes attempt to conserve battery power. The performance of our schemes is investigated in relation to various environmental variables such as the distributions of data objects, the average speed of the clients, and the size of the service area. The resulting latency and tuning time are close to the optimum values, as our analysis and simulation results indicate.
An integrated system for interaction support in lectures
Authors: Henning Bär, Gina Häussge, Guido Rößling
Venue: ACM SIGCSE Bulletin (2007)

This paper motivates the use of an interaction support system both during and outside lectures. We describe requirements for an "optimal" system based on an investigation of related interaction support systems. An example system architecture that satisfies these requirements is presented. The evaluation of the system clearly shows its usability.
Online monitoring of FPGA-based co-processing engines embedded in dependable workstations
Authors: Nikolaos Bartzoudis, Klaus McDonald-Maier
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

An assertion-based monitoring system was implemented to enforce the operation of a FPGA coprocessing engine, which is part of a dependable workstation. The monitor was built in VHDL using simple state machines. Concurrent error detection is an important aspect in dependable workstations helping to prevent the propagation of errors within the system. The functionality of the implemented monitoring component does not interfere with the performance of the workstation and ensures high system availability. The monitor checks for PCI protocol and application errors based on the forensic analysis of a dependable workstation with FPGA-based co-processing support.
Certificate Chain Discovery in Web of Trust for Ad Hoc Networks
Authors: Hisashi Mohri, Ikuya Yasuda, Yoshiaki Takata, Hiroyuki Seki
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In an ad hoc network, we cannot assume a trusted certificate authority and a centralized repository that are used in ordinary Public-Key Infrastructure (PKI). Hence a PKI system of the web-of-trust type in which each node can issue certificates to others in a self-organizing manner has been studied. Although this system is useful for ad hoc networks whose topology can change, it has the problem that for authentication a node needs to find a certificate-chain to the destination node. In this paper, we formally model a web-of- trust-type PKI system, define the certificate-chain discovery problem, and propose a new distributed algorithm and its modifications that solve the problem. Furthermore, we propose a measure of communication cost, and according to the measure, we compare our algorithm with an existing method.
A new universal language for speech recognition applications
Authors: L. M. Arslan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Automatic speech recognition systems are prone to errors when there are confusable words in the dictionary. Even human beings sometimes make errors when they have to choose between words like "fix" and "six". The situation is worse for telephone conversation. Most unvoiced phonemes with low energy are lost in the background noise. In this paper, a new approach to the solution of this problem is proposed. The idea is to create a new language with words that are orthogonal to each other in the acoustic space. The suggestion in this paper is to limit the vocabulary of the new language to include only a few very essential words (i.e., digits, yes-no, etc.). In such a case the users may have the option of learning 10-20 words in the new language and get better service in return, which may be preferred by some part of the population.
Document Frauds: Identification and Linking Fake Document to Scanners and Printers
Authors: Gaurav Gupta, Sanjoy Kumar Saha, Shayok Chakraborty, Chandan Mazumdar
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

With the advent of cheap and sophisticated scanning and printing technologies, the document frauds are on rise. Generating fraudulent document using a scanner and printer for malicious and unlawful gain has seen a paradigm shift. In this paper, we propose a new method for the problem of detecting a fraudulent document and then fixing it to color laser printers or color inkjet printers. For each printer in question study has found characteristics specific to printing technology and same varies among same model, same company printers. For the forensic purpose the linking of a document to a scanner/printer and printing technology is extremely useful.
Categorization and analysis of text in computer mediated communication archives using visualization
Authors: Ahmed Abbasi, Hsinchun Chen
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Digital libraries (DLs) for online discourse contain large amounts of valuable information that is difficult to navigate and analyze. Visualization systems developed to facilitate improved CMC archive analysis and navigation primarily focus on interaction information, with little emphasis on textual content. In this paper we present a system that provides DL exploration services such as visualization, categorization, and analysis for CMC text. The system incorporates an extended feature set comprised of stylistic, topical, and sentiment related features to enable richer content representation. The system also includes the Ink Blot technique which utilizes decision tree models and text overlay to visualize CMC messages. Ink Blots can be used for text categorization and analysis across forums, authors, threads, messages, and over time. The proposed system's analysis capabilities were evaluated with a series of examples and a qualitative user study. Empirical categorization experiments comparing the Ink Blot technique against a benchmark support vector machine classifier were also conducted. The results demonstrated the efficacy of the Ink Blot technique for text categorization and also highlighted the effectiveness of the extended feature set for improved text categorization.
Detection and estimation of embolic Doppler signals using discrete wavelet transform
Authors: N. Aydin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Almost any system for the detection of asymptomatic circulating emboli by Doppler ultrasound employs the fast Fourier Transform (FFT). However, the FFT is not ideally suited to study short-lived embolic signals. The wavelet transform (WT) is an optimized way of analyzing short-lived signals and performs better than the FFT in some respects. We propose a detection method based on the discrete wavelet transform (DWT) and study some parameters, which might be useful for describing embolic signals. We used 2 independent data sets, comprising 100 low intensity embolic signals, 100 various type of artifacts and 100 Doppler speckle. After applying the DWT to the data, several parameters were evaluated. The threshold values used for both data sets were optimized using the first data set. 98 out of 100 embolic signals were detected as embolic signals for the first data set. 95 out of 100 embolic signals were detected for the second data set when the same threshold values were used.
On laparoscopic robot design and validation
Authors: Victor F. Muñoz, J. Fernández-Lozano, J. Gómez-de-Gabriel, I. García-Morales, R. Molina Mesa, C. Pérez-del-Pulgar
Venue: Integrated Computer-Aided Engineering (2003)

This paper presents a robotic assistant for helping surgeons in minimally invasive surgery. The system provides the direct control of the camera positioning inside the abdominal cavity, including teleoperation capabilities. This prototype does not require any modification of a standard operating room for its installation and its application in surgical procedures. The insertion point of the laparoscopic camera constitutes the most important kinematic constraint in laparoscopic techniques. In the proposed design, this has been solved with a passive wrist. A three active degrees of freedom manipulator positions the wrist. In order to demonstrate the robot suitability to develop the tasks it has been designed for, a design validation has been performed. This validation consists of simulations based on the configuration space concept. Finally, trials with alive animals have been carried out in an experimental operating theatre.
A Novel Approach for Re-Ranking of Search Results Using Collaborative Filtering
Authors: U. Rohini, Vasudeva Varma
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Search Engines today often return a large volume of results with possibly a few relevant results. The notion of relevance is subjective and depends on the user and context. Re-ranking of the results to reflect the most relevant results to the user using the relevance feedback has received wide attention in information retrieval in recent years. Also, sharing of information among users having similar interests using collaborative filtering techniques has achieved wide success in recommendation systems. In this paper, we propose a novel approach for re-ranking of the search results using collaborative filtering techniques using relevance feedback of a given user as well as the other users. Our approach is to learn the profiles of the users using macine learning techniques making use of past browsing histories including queries posed and documents found relevant or irrelevant. Re-ranking of the results is done using collaborative filtering techniques. First, the context of the query is inferred from the query category. The user's community is determined dynamically in the context of the query by using the user profiles. The rank of a document is calculated using the user's profile as well profiles of the other users in the community.
Bandwidth Allocation for Integrated MPEG-4 Video, WAP and MP3 Traffic over Next Generation Wireless Cellular Networks
Authors: P. Koutsakis
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In this paper we explore, via an extensive simulation study, the performance of a Medium Access Control (MAC) protocol when integrating video, WAP and MP3 data packet traffic over a wireless picocellular system of very high capacity, with errors. Mobile terminals are considered to be high performance devices with extended storage capabilities which can act like cache memories streaming multimedia material. Ïur scheme achieves high aggregate channel throughput in all cases of traffic load, despite the very bursty nature of the examined traffic and the introduction of errors in the system.