ppxscal/embedding_network huggingface dataset:
DOA estimation by fourth-order cumulants in unknown noise environments
Authors: Y.-H. Chen, Y.-S. Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Directions-of-arrival algorithms based on the cumulants of array data have been developed to suppress additive spatially correlated Gaussian noises. The authors propose a new cumulant-based method which is applicable in both Gaussian and non-Gaussian noise environments. This approach is derived on the basis of the fourth-order cumulants of the transformed array data by the discrete Fourier transform (DFT) and then relies on the statistical central limit theorem. Computer simulation results show that the proposed method is superior to the standard correlation-based multiple signal classification (MUSIC) technique and the cumulant-based MUSIC in both Gaussian and non-Gaussian noise environments.
Incentive mechanism design for selfish hybrid wireless relay networks
Authors: Hung-Yu Wei, Richard D. Gitlin
Venue: Mobile Networks and Applications (2005)

Non-cooperative behaviors in communication networks can significantly adversely affect the entire network. Recently, researchers have begun to study such non-cooperative communication systems within a game theory framework and strive to engineer the system to prevent performance degradation under non-cooperative behaviors. The WWAN/WLAN two-hop-relay system described in [1] integrates two types of wireless technologies to improve wireless access throughput and coverage. The relay nodes in the two-hop-relay system can be wireless relay routers deployed by wireless service providers, or dual-mode users who voluntarily relay traffic for other users. However, it is reasonable to assume that all dual-mode terminals are selfish and are not willing to relay for other users without an incentive. In this paper, we will use the basic concepts of game theory, especially the concept of the Nash Equilibrium, to design our scheduling algorithms. Several scheduling algorithms, including the maximum rate C/I scheduler, the proportional fair scheduler, and the round robin scheduler, are examined to understand performance while operating under the assumption that all users are selfish. Under the C/I scheduler or the proportional fair scheduler, Nash Equilibriums exist at the operating points where no user will relay for other users--an undesirable situation. Under the round robin scheduler, selfish users are indifferent on relaying voluntarily or not relaying. Therefore, we are inspired to design a novel incentive scheduler. By applying the proposed incentive scheduler, all selfish users relay cooperatively at the Nash Equilibrium.
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
Authors: Sun-Yuan Hsieh
Venue: IEEE Transactions on Computers (2006)

A graph G=(V,E) is said to be pancyclic if it contains fault-free cycles of all lengths from 4 to |V| in G. Let F_{v} and F_{e} be the sets of faulty nodes and faulty edges of an n{\hbox{-}}{\rm dimensional} Möbius cube MQ_{n}, respectively, and let F=F_{v}\cup F_{e}. A faulty graph is pancyclic if it contains fault-free cycles of all lengths from 4 to |V-F_{v}|. In this paper, we show that MQ_{n}-F contains a fault-free Hamiltonian path when |F|\leq n-1 and n\geq 1. We also show that MQ_{n}-F is pancyclic when |F|\leq n-2 and n\geq 2. Since MQ_{n} is regular of degree n, both results are optimal in the worst case.
Integrating Point and Touch for Interaction with Digital Tabletop Displays
Authors: J. Karen Parker, Regan L. Mandryk, Kori M. Inkpen
Venue: IEEE Computer Graphics and Applications (2006)

TractorBeam is a hybrid point-touch interaction technique for tabletop computer displays that seamlessly combines remote pointing and local touch. Results from studies investigating its use for target selection, docking, and puzzle tasks give some positive results, but further tests on its usefulness in collaborative activities are necessary.
Text Map Explorer: a Tool to Create and Explore Document Maps
Authors: Fernando Vieira Paulovich, Rosane Minghim
Venue: Proceedings of the conference on Information Visualization (2006)

This paper presents a tool, called Text Map Explorer, which can be used to create and explore document maps (visual representations of document collections). This tool is capable of grouping (and separating) documents by their contents, revealing to the user relationships amongst them. This paper also presents a novel multi-dimensional projection technique for text that reduces the quadratic time complexity of our previous approach to O(N32), keeping the same quality of maps. The technique creates a surface that reveals intrinsic patterns and support various kinds of exploration of a text collection.
Definition of Mechanisms that Enable the Exploitation of Governed Content
Authors: Jaime Delgado, Tommaso Martini, Paolo Nesi, Eva Rodriguez, Davide Rogai, Andrea Vallotti
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

Digital Rights Management (DRM) systems control the use of governed multimedia content through the complete digital value chain. They enable business models in which the creation, exploitation and distribution of digital objects can be controlled according to the terms and conditions stated by content owners, aggregators, etc. In this context, a key issue is the definition of mechanisms to enable the governed use of content thorough the B2B value chain and to specify the rights and constraints required for the rights expressions governing the digital objects. This paper presents relevant use cases where governed digital objects are manipulated and determine the rights and conditions that can be used in the licenses that will be issued to enable the manipulation of this governed digital objects.
How words map concepts
Authors: Pr. Christophe Roche
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Most definitions of ontology, viewed as a "specification of a conceptualization", agree on the fact that if an ontology can take different forms, it necessarily includes a vocabulary of terms and some specification of their meaning in relation to the domain's conceptualization. And as domain knowledge is mainly conveyed through scientific and technical texts, we can hope to extract some useful information from these texts for building ontology. Indeed, we use names for denoting concepts and linguistic relationships such as hyponymy can be viewed as a linguistic translation of the subsumption relationships between concepts. But is it as simple as this? In this article we shall see that the lexical structure, i.e. the network of words linked by linguistic relationships, does not necessarily match the domain conceptualization. In other words, the conceptual structure derived from the lexical structure - if we consider a word as a lexicalized concept - does not generally fit the conceptualization of the domain. We have to bear in mind that writing documents is the concern of textual linguistics, of which one of the principles is the incompleteness of text, whereas building ontology - viewed as task-independent knowledge - is concerned with conceptualization based on formal - and not natural - languages. We should also bear in mind that using rhetorical figures in writing text, like metonymy and synecdoche, modifies the perception of any concepts we may have. While we can extract some useful information from texts, ontology cannot be directly built from them.
Performance analysis of location-aware mobile service proxies for reducing network cost in personal communication systems
Authors: Baoshan Gu, Ing-Ray Chen
Venue: Mobile Networks and Applications (2005)

We propose and analyze mobile service management schemes based on location-aware proxies with the objective to reduce the network signaling and communication cost in future personal communication systems (PCS). Under these schemes, a mobile user uses personal proxies as intelligent client-side agents to communication with services engaged by the mobile user. A personal proxy cooperates with the underlying location management system so that it is location-aware and can optimally decide when and how often it should move with the roaming user. We show that, when given a set of model parameters characterizing the network and workload conditions, there exists an optimal proxy service area size for service handoffs such that the overall network signaling and communication cost for servicing location and service operations is minimized. We demonstrate via Petri net models that our proposed proxy-based mobile service management schemes outperform non-proxy-based schemes over a wide range of identified conditions. Further, when the mobile user is concurrently engaged in multiple services, the per-service proxy scheme that uses a separate proxy for each service outperforms the aggregate proxy scheme that uses a single proxy to interface with multiple services taking their aggregate service characteristics into consideration.
Model Driven capabilities of the DA-GRS model
Authors: Arnaud Casteigts
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

The development of applications that target dynamic networks often adresses the same difficulties. Since the underlying network topology is unstable, the application has to handle it in a context-reactive manner, and, when possible, with algorithms that are localized and decentralized. The present paper shows how the DA-GRS model, that is a high level abstract model for localized graph algorithms, can be used to drastically improve the development time of selforganized systems. The canonical method that is proposed makes use of generic pieces of code, along with some additional code generation. All the concepts presented here are illustrated by means of a spanning forest algorithm, that can then be used by the application at a high abstraction level.
On Implementation Aspects of Standard Asymmetric and Symmetric Cryptographic Algorithms on TI Signal Processors
Authors: Milan Markovic, Goran Dordevic
Venue: Proceedings of the Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (2006)

In this work, possible optimization techniques for realization of asymmetrical and symmetrical standard cryptographic algorithms on assembler of Texas Instruments TMS320C54x family of digital signal processors are considered. Optimization of RSA asymmetrical, as well as IDEA and AES (Rijndael) symmetrical algorithms are evaluated. Possible optimization techniques for RSA algorithm are related to multiplication, modular reduction and RSA private key operation procedures. We have modified the original Karatsuba-Offman's algorithm and obtain a less recursive algorithm and use it for possible optimization. A cryptographic throughput and a speed of the signal processor's realization of IDEA and AES symmetrical algorithms in ECB mode are also analyzed. Besides, an optimization procedure in AES algorithm using specific tables is also discussed. Obtained results show that the TMS320C54x family of signal processors is suitable for the standard asymmetrical and symmetrical algorithms' realization.
Optimization study with ligand-design interval rules
Authors: Jürgen Paetz
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2006)

Drug design has emerged as an application area of soft computing methodology. To find potential novel drugs, up to millions of molecules need to be virtually screened by algorithmic techniques using computational devices. Due to the high combinatorial number of molecules experimental costs need to be decreased by improvements of the computational virtual screening method. In this contribution an adaptive neuro-fuzzy system is applied to find interval rules by cutting the adapted trapezoid membership functions, that provide knowledge about the important class of bioactive molecules as candidates for potential drugs. However, the aim is not to classify all the molecular data, but to find a small region, described by a rule, with a high enrichment of bioactive molecules. This small number of molecules could then be screened in the laboratory, limiting the costs clearly. The generated rules performed mostly better than common similarity measures and decision tree rules. Another part of the work herein was to increase again the perfomance of the best found rules so far by using evolutionary optimization. A comparison of four different parameter settings for the fitness function is given. The results of the hybrid approach are mainly more performant than the neuro-fuzzy interval rules solely.
Prediction of Antisense Oligonucleotide Efficacy Using Local and Global Structure Information with Support Vector Machines
Authors: Roger Craig, Li Liao
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Designing antisense oligonucleotides with high efficacy is of great interest both for its usefulness to the study of gene regulation and for its potential therapeutic effects. The high cost associated with experimental approaches has motivated the development of computational methods to assist in their design. Essentially, these computational methods rely on various sequential and structural features to differentiate the high efficacy antisense oligonucleotides from the low efficacy. By far, however, most of the features used are either local motifs present in primary sequences or in secondary structures. We proposed a novel approach to profiling antisense oligonucleotides and the target RNA to reflect some of the global structural features such as hairpin structures. Such profiles are then utilized for classification and prediction of high efficacy oligonucleotides using support vector machines. The method was tested on a set of 348 antisense oligonucleotides of 19 RNA targets with known activity. The performance was evaluated by cross validation and ROC scores. It was shown that the prediction accuracy was significantly enhanced.
A new WLS method for the design of two-dimensional FIR digital filters
Authors: Chaur-Heh Hsieh, Ying-Luan Han, Chung-Ming Kuo, Yue-Dar Jou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Recently, the weighted least square (WLS) technique for the FIR filter design has received wide attention, since it is computationally more efficient than other minimax techniques. However, for two-dimensional (2-D) filter design, the conventional WLS technique rearranges the frequency samples and the impulse filter coefficients with 2-D form into 1-D form, thus the WLS technique results in expensive computation. This paper presents a new 2-D FIR filter design method which retains the frequency samples and impulse filter coefficients in their 2-D form. Experimental results show that the new technique is computationally very efficient and leads to nearly-optimal approximations.
Space-Time-Block-Coded Transmissions for Downlink MC-CDMA Transmissions Over Frequency-Selective Fading Channels
Authors: S. Jamallulil, J. P. Cances, V. Meghdadi
Venue: Wireless Personal Communications: An International Journal (2006)

Mitigation of multipath fading effects and suppression of multiuser interference (MUI) constitute major challenges in the design of the third generation wireless mobile systems. Space-time (ST) coding offers a attractive solution to cope with mutipath fading, but most existing ST coding schemes assume flat fading channels that may not be realistic for wide-band communications. Especially multiuser ST block-coded transmissions through multipath fading channels present unique challenge in suppressing not only MUI but also intersymbol/chip interference. In this paper, we design ST multiuser transceivers for MC-CDMA quasi-synchronous systems, capable to reliably transmit over frequency-selective multipath downlink channels. The proposed system is able to provide transmit diversity and to guarantee symbol recovery in multiuser environments, regardless of unknown multipath. Unlike existing approaches, the mobile does not need to know the channel of other users. In addition to decoding simplicity, computer simulations show the performance merits of the proposed transceiver.
Factorization of multivariate positive Laurent polynomials
Authors: Jeffrey S. Geronimo, Ming-Jun Lai
Venue: Journal of Approximation Theory (2006)

Recently Dritschel proved that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix Fejér-Riesz theorem. Then we discuss a computational method to find approximates of polynomial matrix factorization. Some numerical examples will be shown. Finally we discuss how to compute nonnegative Laurent polynomial factorizations in the multivariate setting.
Feature Selection for Medical Data Mining: Comparisons of Expert Judgment and Automatic Approaches
Authors: Tsang-Hsiang Cheng, Chih-Ping Wei, Vincent S. Tseng
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Data mining refers to the process of automatic extracting previously unknown, valid, and actionable patterns or knowledge from large databases for crucial decision support. Among different data mining technique, classification analysis is widely adopted for healthcare applications for supporting medical diagnostic decisions, improving quality of patient care, etc. If a training dataset contains irrelevant features (i.e., attributes), classification analysis may produce less accurate and less understandable results. Two commonly employed feature selection approaches include use of automatic feature selection mechanisms (i.e., data-driven) or expert judgment (i.e., knowledgedriven). Due to differences in their underlying processes, the two prevailing feature selection approaches may have their unique biases that possibly lead to dissimilar classification effectiveness. In this study, we empirically evaluate the classification effectiveness resulted from the two feature selection approaches on a risk prediction of cardiovascular disease dataset. Our evaluation results suggest that the feature subsets selected domain experts improve the sensitivity of a classifier, while the feature subsets selected by an automatic feature selection mechanism improve the predictive power of a classifier on the majority class (i.e., the specificity in this study).
Adaptive Knowledge-Based Visualization for Accessing Educational Examples
Authors: Peter Brusilovsky, Jae-wook Ahn, Tibor Dumitriu, Michael Yudelson
Venue: Proceedings of the conference on Information Visualization (2006)

A number of research teams are working to organize personalized access to the modern repositories of educational resources. The goal of personalized access is to help students locate resources that match their individual goals, interests, and current knowledge. The project presented in this paper is focused on the least explored way of personalized access - adaptive visualization. Here, we present the NavEx ADVISE visualization system, which provides personalized access to a repository of educational examples. The system combines spatial, similarity-based visualization with adaptive annotations of resources. The spatial layout and the adaptive annotations are generated using a knowledge-based indexing of examples with domain concepts.
Some questions of control of the robotized in-orbit assembly of large space structures
Authors: S. D. Zemlyakov, V. Yu. Rutkovskii, V. M. Sukhanov
Venue: Automation and Remote Control (2006)

Presented was an analytical review of the foreign and domestic scientific literature published over more than two decades on the dynamics and theory of motion control of large space structures and free-flying space robots meant for assisting the astronauts or replacing them at execution of diverse maintenance operations in open space. Although many results on the design of control systems for each of the aforementioned kinds of objects are very significant taken separately, nevertheless the most important problem of using the flying robots for in-orbit assembly of the large space structures remains still unsolved. Formulated was the concept of complex approach to the problem of robot-assisted in-orbit assembly of space structures which lies in combining the algorithms of all subsystems involved in the assembly of the objects with regard for the requirements on safe interaction of the participants, high resultant precision and reliability of operation, and minimal use of the consumable fuel.
A new eigenvector-based algorithm for multichannel blind deconvolution of input colored signals
Authors: M. I. Gurelli, C. L. Nikias
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The development of a new algorithm is presented for the deconvolution of an unknown, possibly colored signal which is observed through two or more unknown channels described by rational system transfer functions. It is assumed that the channel orders as well as the root locations are unknown. The proposed algorithm starts with over-estimated channel orders and iteratively reduces them. The root locations are simultaneously estimated. This algorithm may also be used in multichannel system identification problems.
Automatic detection of PET lesions
Authors: Zhe Chen, David Dagan Feng, Weidong Cai
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

We propose a method to handle the automatic detection of PET lesions based on asymmetry feature measurement after segmenting the PET images. It is an essentially initial step in automatic diagnosis and content-based retrieval applications. Our technique includes six steps: Image alignment, segmentation, image reflection & subtraction, thresholding, background removal using morphological filtering and segment back-mapping. Compared with existing per-pixel asymmetry detection methods, our method can provide fewer false positives and more accurate results.
Educational tools for the advancement of undergraduate statistics education
Authors: Andrew Schaffner, David Madigan
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Traditional statistics courses often rely on statistical methodology to shed light on the underlying statistical concepts [Garfield 1995]. Styles of instruction that rely on this model of learning do not take advantage of decades of research on how the human mind works and assimilates information. Many authors ([diSessa & Minstrell 1995], [Cohen 1994], [Reynolds et al. 1995], [Bruer 1993], [von Glaserfield 1991]) have argued the benefits of collaborative learning, authentic activity based courses, and individual and social constructivism as tools for the development of conceptual and transferable knowledge. This thesis investigates and evaluates these theories and their application to undergraduate statistics. In particular, this thesis explores Facet Based Learning (FBL) and Scaffold Questioning and Discussion (SQD), instructional strategies for both the classroom and computer environment (World Wide Web) which draw on students' prior understandings and create an environment to address these understandings in order to promote the intended deeper understandings.