ppxscal/embedding_network huggingface dataset:
Blind RBF equalizer for received signal constellation independent channel
Authors: Hai Lin, K. Yamashita
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The purpose of this paper is to propose a novel cluster map based blind RBF equalizer for received signal constellation (RSC) independent channel. Without the channel estimator, firstly, a neural-gas algorithm is used to obtain the desired number of unlabeled RBF centers. Then these unlabeled centers are partitioned into appropriate subsets based on a cluster map generated from the known RBF equalizer structure. This process, which also can be viewed as the weight initialization, is implemented merely by several simple sorting operations. Finally, the weight is adjusted iteratively by a unsupervised least mean square (LMS) algorithm. Because of the effective weight initialization that comply with the underlying structure of the RBF equalizer, the proposed blind RBF equalizer achieves almost identical performance with the optimal RBF equalizer. The validity of the proposed equalizer is also demonstrated by computer simulations.
A framework for heterogeneous specification and design of electronic embedded systems in SystemC
Authors: Fernando Herrera, Eugenio Villar
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2007)

This work proposes a methodology which enables heterogeneous specification of complex, electronic systems in SystemC supporting the integration of components under different models of computation (MoCs). This feature is necessary in order to deal with the growing complexity, concurrency, and heterogeneity of electronic embedded systems. The specification methodology is based on the SystemC standard language. Nevertheless, the use of SystemC for heterogeneous system specification is not straightforward. The first problem to be addressed is the efficient and predictable mapping of untimed events required by abstract MoCs over the discrete-event MoC on which the SystemC simulation kernel is based. This mapping is essential in order to understand the simulation results provided by the SystemC model of those MoCs. The specification methodology proposes the set of rules and guidelines required by each specific MoC. Moreover, the methodology supports a smooth integration of several MoCs in the same system specification. A set of facilities is provided covering the deficiencies of the language. These facilities constitute the methodology-specific library called HetSC. The methodology and associated library have been demonstrated to be useful for the specification of complex, heterogeneous embedded systems supporting essential design tasks such as performance analysis and SW generation.
On gray-box program tracking for anomaly detection
Authors: Debin Gao, Michael K. Reiter, Dawn Song
Venue: Proceedings of the 13th conference on USENIX Security Symposium - Volume 13 (2004)

Many host-based anomaly detection systems monitor a process ostensibly running a known program by observing the system calls the process makes. Numerous improvements to the precision of this approach have been proposed, such as tracking system call sequences, and various "gray-box" extensions such as examining the program counter or return addresses on the stack when system calls are made. In this paper, we perform the first systematic study of a wide spectrum of such methods. We show that prior approaches can be organized along three axes, revealing new possibilities for system-call-based program tracking. Through an empirical analysis of this design space, we shed light on the benefits and costs of various points in the space and identify new regions that appear to outperform prior approaches. In separate contributions, we demonstrate novel mimicry attacks on a recent proposal using return addresses for system-call-based program tracking, and then suggest randomization techniques to make such attacks more difficult.
Utilizing MATLAB in two graduate electrical engineering courses
Authors: E. E. Yaz, A. Azemi
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Control system design packages like MATLAB, MATRIX/sub X/, Control C, SIMNON, etc. have become essential ingredients of both undergraduate and graduate courses in the systems and controls area. This work describes our experience, at the University of Arkansas and Pennsylvania State University, with the use of one of these packages, namely MATLAB with its control systems and signal processing toolboxes in stochastic systems and linear control systems courses, both of which are offered to advanced undergraduate and graduate students. This paper also presents the MATLAB features that are found most useful in these two courses in enhancing students' understanding of the material. A discussion of how MATLAB helps in reducing the amount of time spent in performing computational homework assignments follows. Finally, the general positive student reaction to incorporating this software package into these courses is reported.
A Middleware Approach for Behavior Consistent Composition of Services in Smart Space
Authors: Qin Yin, Hao Hu, Jun Li, Jian Lu
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

In recent years, service-oriented computing and perva- sive computing are emerging as the next computing par- adigms. Applying service-oriented technologies in smart space, a typical pervasive environment, facilitates the inter- action of heterogeneous service components and the con- struction of pervasive applications. However, it also raises the new challenge of extending service specifications, com- posing available services and designing a supported mid- dleware. To meet the challenge, we introduce a service- oriented component model which extends service specifica- tion with behavior and capability information. Based on it, we propose an approach of modeling composite services by UML activity diagrams and ensuring behavior consistency with respect to control flow. To support behavior consistent composition of services in smart space, SOBECA (Service- Oriented, BEhavior and Capability supported Architecture) system is designed and implemented.
Interoperability among Service Registry Standards
Authors: Eyhab Al-Masri, Qusay H. Mahmoud
Venue: IEEE Internet Computing (2007)

Basic similarities among the several service-registry standards that exist today suggest the potential for interoperability. Given that service registries are key components in Web services architectures, interoperability will play an increasingly important role in facilitating dynamic business-to-business interactions. Yet, the standards' distinctive approaches to discovery make it unclear whether the provisional specifications will eventually merge or coexist.
Stochastic sleeping with sink-oriented connectivity and coverage in large-scale sensor networks: Research Articles
Authors: Gaotao Shi, Minghong Liao
Venue: International Journal of Communication Systems (2007)

Maintaining a long network lifetime with stringent energy constraints on tiny sensor nodes presents a big challenge for the design of wireless sensor networks. A widely used energy consumption strategy is to turn off a node when it is transmitting or receiving. However, most existing scheduling algorithms depend on location or directional information. As a result, the energy cost and system complexity involved in obtaining such geometric information may compromise the effectiveness as a whole. In this paper, we analyse the shortcomings of geographic scheduling schemes maintaining a complete coverage and prove that the network lifetime is determined by the boundary nodes. We propose a probabilistic cellular automaton scheduling scheme, which does not need any node location or directional information and also provide a topology control protocol (S3C2), which schedules a node to sleep based on probabilistic cellular automaton and maintains a sink-oriented connectivity and coverage. Extensive simulations are conducted to evaluate the performance of our proposed scheduling scheme and topology control protocol. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Temporal Privacy in Wireless Sensor Networks
Authors: Pandurang Kamat, Wenyuan Xu, Wade Trappe, Yanyong Zhang
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Although the content of sensor messages describing "events of interest" may be encrypted to provide confidentiality, the context surrounding these events may also be sensitive and therefore should be protected from eavesdroppers. An adversary armed with knowledge of the network deployment, routing algorithms, and the base-station (data sink) location can infer the temporal patterns of interesting events by merely monitoring the arrival of packets at the sink, thereby allowing the adversary to remotely track the spatio-temporal evolution of a sensed event. In this paper, we introduce the problem of temporal privacy for delaytolerant sensor networks and propose adaptive buffering at intermediate nodes on the source-sink routing path to obfuscate temporal information from an adversary. We first present the effect of buffering on temporal privacy using an information-theoretic formulation and then examine the effect that delaying packets has on buffer occupancy. We evaluate our privacy enhancement strategies using simulations, where privacy is quantified in terms of the adversary's estimation error.
A Prediction Mechanism of Adaptive Learning Content in the Scalable E-Learning Environment
Authors: Chih-Ping Chu, Yi-Chun Chang
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In e-learning environments, adaptive learning is a critical requirement to enhance the teaching quality of the e-learning. Adaptive learning feature provides content specific to a student's learning style. Hence, the first step of adaptive learning is to identify the student's learning style and then to determine the appropriate learning content that corresponds to the individual students learning style. This paper proposes a mechanism to predict the adaptive learning content for each student. To prove the usability and availability of the proposed mechanism, this paper implements the proposed mechanism in a scalable e-learning environment. In the scalable e-learning environment, every student can share diverse learning contents distributed in different learning management systems through peer to peer technology. By means of the prediction mechanism, the adaptive learning content can be acquired at the student site in advance of its use. Hence, the waiting time for downloading learning content can be reduced and thus the learning performance is enhanced. Furthermore, the complexity of storage space is decreased since the student only needs to acquire the learning content corresponding to her/his learning style. In addition, this paper also uses the IRIS dataset and real student data to verify the accuracy of the prediction mechanism.
SnakeSort: A Family of Simple Optimal Randomized Sorting Algorithms
Authors: David T. Blackston, Abhiram Ranade
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

We present a family of exceedingly simple sorting algorithms called Snakesort. Snakesort is a natural generalization of the simple barallel bubble sort algorithm, also known as odd-even transposition sort. Instances of Snakesort can be implemented on any interconnection network so long as it has a Hamiltonian Path.
Automated placement of transducers for active noise control: performance measures
Authors: J. A. Olkin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

In our previous work, we developed a new actuator placement algorithm that is capable of selecting the best actuators for active noise control problems over a broadband of frequencies. The actuator selection algorithm is based on a novel extension of the Householder QR subset selection algorithm. In this paper, we improve our algorithm by incorporating seven new measures of actuator performance. The new measures, based on different matrix norms and functions of the actuator frequency responses, yield active noise control systems with improved performance and robustness.
Partial and Fuzzy Constraint Satisfaction to Support Coalition Formation
Authors: Petros Belsis, Stefanos Gritzalis, Sokratis K. Katsikas
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

The creation of dynamic coalitions is a challenging task, seen from a security perspective. Due to the presence of conflicting requirements and specifications, the policy negotiation and policy merging processes call for the use of efficient techniques to resolve ambiguities. Constraints and constraint programming on the other hand, are useful means for representing a wide range of access control states and access control problems. In this paper we utilize constraints to represent access control policies in a multi-domain environment. In contrast to monolithic (crisp) constraint satisfaction techniques, we extend the applicability of constraints for access control, by examining soft constraints and partial constraint satisfaction. We also introduce a security framework based on fuzzy constraints that allows the determination of preferences for the participating domains.
"ITRS test challenges need defect based test: fact or fiction?"
Authors: J. Plusquellic
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

Test generation for scan-based test of sequential circuits is typically performed by generating tests for the embedded combinational logic (ECL) and translating these into scan test vectors. However, the serial nature of scan-based test incurs significant overhead in terms of test application time. To reduce the test data volume, in this paper we propose a new algorithm for compatibility analysis of the circuit flip flops. This algorithm, when applied to parallel-scan methods such as the Illinois Scan Architecture (ILS), results in shorter and more balanced scan chains. It also eliminates the need to apply test vectors in serial mode. As a result, an average reduction of 1.4/spl times/ and a maximum reduction of 1.7/spl times/ in test data volume was obtained for the ISCAS89 benchmarks, over current versions of ILS. 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
Advanced analysis techniques for cross-product coverage
Authors: H. Azatchi, L. Fournier, A. Ziv, K. Zohar
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

Coverage analysis is used to monitor the quality of the verification process. Reports provided by coverage tools help users identify areas in the design that have not been adequately tested. Because of their sheer size, the analysis of large coverage models can be an intimidating and time-consuming task. This paper presents two new techniques for coverage analysis. The first technique, coverage query, allows users that concentrate on a single uncovered event to find larger phenomena (e.g., hole) that contains this event. The second technique, quasi-hole analysis, automatically identifies large areas in the coverage space that are lightly covered. The proposed techniques provide additional means for extracting relevant, useful information, thereby improving the quality of the coverage analysis. A number of examples are provided showing how the proposed method improved the verification of actual designs.
GStokes: A Grid-enabled Solver for the 3D Stokes/Navier-Stokes System on Hybrid Meshes
Authors: Ulrich Langer, Walter Zulehner, Huidong Yang, Markus Baumgartner
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Grid computing is a new framework for distributed computing that provides us a more advanced computing and memory resource sharing model for solving large scale computational problems. Under this environment, the challenging problem in computational fluid dynamics (CFD) can be resolved in an efficient way. However, the traditional solvers of partial differential equations (PDEs) using finite element method (FEM) are usually tight combinations of a mesh generator and a linear system solver, and thus not suitable for grid computing. In this paper, we present a newly designed grid-enabled client/server (CS) model for the 3D Stokes/Navier-Stokes problem on more complicated hybrid meshes. This paper mainly focuses on the construction of the client/server model under the grid environment, and how to apply it to the Stokes system.
Cognitive complexity and dynamic personality in agent simulation
Authors: Nasser Ghasem-Aghaee, Tuncer I. Ören
Venue: Computers in Human Behavior (2007)

Infohabitants of the connected information systems include individuals, organizations, smart appliances, smart buildings, and other smart systems, as well as virtual entities acting on their behalf. They can best be represented by software agents. Hence, realistic cognitive abilities of software agents such as influence of personality to decision making and problem solving is of practical computational importance. In this article, two characteristics are added to software agents with personality: dynamic personality and the relationships of personality trait openness with both problem solving ability and cognitive complexity. The last characteristic of openness leads to its impact to dynamic modification of problem solving ability. In this article, an implementation of a fuzzy agent with personality is realized in Java environment to show personality descriptors, personality factors, personality style, and problem solving success consequently. Furthermore, a prototype system is presented to update personality facets and respective personality trait openness which can affect problem solving ability.
Stochastic modeling of spectral adjustment for high quality pitch modification
Authors: A. Kain
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

We present a new algorithm for adjusting the magnitude spectrum when the fundamental frequency (F/sub 0/) of a speech signal is altered. The algorithm exploits the correlation between F/sub 0/ and the magnitude spectrum of speech as represented by line spectral frequencies (LSFs). This correlation is class-dependent, and thus a broad classification of the input is achieved by a Gaussian mixture model (GMM). The within-class dependencies of LSFs on F/sub 0/ values are captured by constructing their joint probability densities using a series of GMMs, one for each speech class. The proposed system is used for post-processing the pitch modified signal. Perceptual tests showed that the addition of this post-processing system improves the naturalness of the pitch modified signal for large pitch modification factors.
Real-Time Control of a Pipelined Multicomputer for the Relational Database Join Operation
Authors: Yoshikuni Okawa, Yasukazu Toteno, Bi Kai
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

We propose a database system which consists of a personal computer, disks and a pipeline of microcomputers. The rela tional join is a target. We find that there exist two different algorithms: one contributes the speed up of the pipeline cycle time, and the other reduces the number of the necessary disk accesses. The controller watches the state of the pipeline, and if the pipeline is critical, then it switches to the high speed algorithms. Like wise, the controller selects the most appropri ate strategy for the given situation. We have built an experimental parallel processing sys tem. The results show the feasibility of the proposed control algorithm.
A multi-hypothesis GLRT approach to the combined source detection and direction of arrival estimation problem
Authors: R. E. Bethel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The problem of detecting the number of uncorrelated narrowband signals received by an array of sensors when the direction of arrival (DOA) and power level of each source is unknown is investigated. A multi-hypothesis generalized likelihood ratio test (GLRT) approach is used, resulting in a procedure which maximizes the likelihood function with respect to the number of signals and their DOAs and powers. A tuning mechanism for controlling the tradeoff between the probability of correct detection and the probability of false alarm is obtained by imposing a constraint on the minimum allowable value for the power level estimate. A sequential search over the number of sources is used for a computationally feasible solution. Performance comparisons are made to the minimum description length (MDL) and minimum variance distortionless response (MVDR) signal detection approaches.
Efficient Detection of Patterns in 2D Trajectories of Moving Points
Authors: Joachim Gudmundsson, Marc Kreveld, Bettina Speckmann
Venue: Geoinformatica (2007)

Moving point object data can be analyzed through the discovery of patterns in trajectories. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock, leadership, convergence, and encounter, as defined by Laube et al., Finding REMO--detecting relative motion patterns in geospatial lifelines, 201---214, (2004). These patterns are large enough subgroups of the moving point objects that exhibit similar movement in the sense of direction, heading for the same location, and/or proximity. By the use of techniques from computational geometry, including approximation algorithms, we improve the running time bounds of existing algorithms to detect these patterns.
Where We At? Mobile Phones Bring GPS to the Masses
Authors: Keri Schreiner
Venue: IEEE Computer Graphics and Applications (2007)

Child tracking is just one of a host of mobile-phone applications that use Global Positioning System technology. Other applications include those for tracking the whereabouts of friends, pets, and employees, and those that let farmers survey and navigate their land, hikers create routes and download maps, and skiers check snow conditions and reserve seats on backcountry helicopters. Although consumers have yet to embrace such products en masse, application vendors who follow market predictions are no doubt hopeful, with some research firms--such as Global Information--estimating a global growth rate of 9 percent by next year.
Estimation of nonstationary hidden Markov models by MCMC sampling
Authors: P. M. Djuric
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Hidden Markov models are very important for analysis of signals and systems. They have been attracting the attention of the speech processing community, and they have become the favorite models of biologists. A major weakness of conventional hidden Markov models is their inflexibility in modeling state duration. In this paper, we analyze nonstationary hidden Markov models whose state transition probabilities are functions of time, thereby indirectly modeling state durations by a given probability mass function. The objective of our work is to estimate all the unknowns of the nonstationary hidden Markov model, its parameters and state sequence. To this end, we construct a Markov chain Monte Carlo sampling scheme in which all the posterior probability distributions of the unknowns are easy to sample from. Extensive simulation results show that the estimation procedure yields excellent results.