ppxscal/embedding_network huggingface dataset:
Secure Event Dissemination in Publish-Subscribe Networks
Authors: Mudhakar Srivatsa, Ling Liu
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Secure event dissemination in a pub-sub network refers to secure distribution of events to clients subscribing to those events without revealing the secret attributes in the event to the unauthorized subscribers and the routing nodes in a pub-sub network. A common solution to provide confidentiality guarantees for the secret attributes in an event is to encrypt so that only authorized subscribers can read them. The key challenge here is to build a secure and scalable content-based event dissemination infrastructure that can handle complex and flexible subscription models while preserving the efficiency and scalability of key management algorithms. In this paper, we describe the design and implementation of PSGuard, for secure event dissemination in pub-sub networks. PSGuard exploit hierarchical key derivation algorithms to encode publication-subscription matching semantics for scalable key management. An experimental evaluation of our prototype system shows that PSGuard meets the security requirements while maintaining the performance and scalability of a pub-sub network.
Blind channel estimation and equalization of multiple-input multiple-output channels
Authors: J. K. Tugnait
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Channel estimation and blind equalization of MIMO (multiple-input multiple-output) communications channels is considered using primarily the second-order statistics of the data. We consider estimation of (partial) channel impulse response and design of finite-length MMSE (minimum mean-square error) blind equalizers. The basis of the approach is the design of a zero-forcing equalizer that whitens the noise-free data. We allow infinite impulse response (IIR) channels. Moreover /spl Gamma/ the multichannel transfer function need not be column-reduced. Our approaches also work when the "subchannel" transfer functions have common zeros so long as the common zeros are minimum-phase zeros. The channel length or model orders need not be known. The sources are recovered up to a unitary mixing matrix and are further "unmixed" using higher-order statistics of the data. An illustrative simulation example is provided.
Carriers temperature for an operating silicon p-n junction
Authors: M. H. Boukhatem, M. El Tahchi, G. W. El Haj Moussa, M. Ajaka, A. Khoury, P. Mialhe
Venue: Microelectronics Journal (2007)

An analytic expression is introduced to describe the dependence of the carriers temperature with the lattice temperature. An experimental study of the temperature dependence of silicon junction characteristics leads to an experimental determination of the carriers temperature. An average error of 2.5% between the experimental values and the calculated values is obtained. The introduction of the carriers temperature is used to study the temperature dependence of the energy gap and to determine the value of the energy bandgap at 0K. The carriers temperature is efficient to use in studying optoelectronic properties of silicon devices.
A peer-to-peer framework for managing large-scale coalitions of federated dynamic resources
Authors: Y. Charlie Hu
Venue:  (2006)

The computational Grid has popularized the idea of sharing resources such as compute cycles, storage space, and data across administrative domains. Grid resources traditionally encompassed dedicated super-computers, clusters, or storage units. The growing computational and storage capabilities of the modern everyday-use computers such as desktop and laptop machines make them potential candidates for serving as nodes in a federated resource sharing system. However, managing such resources poses several major challenges since such resources can be heterogeneous, highly dynamic, and with distinct sharing preferences, and can pose various security challenges due to cross-domain sharing. In recent years, peer-to-peer (p2p) has emerged as a powerful paradigm for constructing large-scale distributed systems. It provides self-organization, decentralization, redundancy, efficient locality-aware routing, and eliminates much of the cost, difficulty, and time required to deploy, configure, and maintain large-scale distributed systems. Previously, the p2p paradigm has been limited to file sharing applications. This thesis explores the potential of the powerful p2p paradigm in Grid computing and proposes a p2p framework for discovering and managing federated dynamic resources. The framework supports a two-level hierarchical organization, in which nodes within each administrative domain are organized into a local p2p overlay, and the manager nodes from individual domains form the higher level p2p overlay. Such organization retains the sovereignty of resources within each domain while allowing flexible sharing of local resources with remote clusters. The framework is successfully applied to develop two Grid services. First, the framework is applied to develop a self-organizing distributed compute cycle sharing service that allows users to utilize local and remote resources even in the presence of resources leaving and joining the system. Second, the framework is used to develop a fault-tolerant distributed storage system that harvests unused disk space on desktop machines or cluster nodes. The distributed storage retains the Network File System interface which allows users to transparently utilize the distributed storage via the standard NFS mechanisms. The thesis presents the design and evaluation of these services, and also investigates the issues of secure and fair resource sharing across domains.
Advances in quantum computational learning theory
Authors: Rocco A. Servedio
Venue:  (2006)

This dissertation explores results at the intersection of two important branches of theoretical computer science: quantum computation, which studies the power of computing devices based on quantum physical phenomena, and computational learning theory, which studies the foundations of machine learning algorithms. We refer to the area of research at this intersection as quantum computational learning theory. Like its classical counterpart, quantum computational learning theory aims to understand the computational and information theoretic requirements of learning problems and algorithms. However unlike the classical models, the models for quantum learners generally involve quantum sources of information and quantum gates employing quantum physical phenomena such as superposition and entanglement, which do not have classical equivalents. Our results can be summarized as follows: (1) In Chapter 3, we study the information theoretic requirements of quantum exact learning, partition learning and "Probably Approximately Correct" (PAC) learning. First, we develop a new general quantum exact learning algorithm, resolving a conjecture by Hunziker et al. [HMP+03]. Next, we present positive and negative results towards the rather general problem of partition learning of which both "exact learning" and "computing a binary property" are special cases. Finally, we derive an improved lower bound on the number of quantum examples required for PAC learning. (2) In Chapter 4, we consider the problem of learning unions of high dimensional rectangles over the domain [b]n using membership queries and uniform quantum examples. These classes oral generalizations of classes of DNF formulae over {0,1}n that have been extensively studied in the learning theory literature. (3) In Chapter 5, we develop quantum algorithms for learning and testing juntas (Boolean functions that depend on a few variables) and learning sparse functions. These algorithms are based on the quantum subroutine due to Bshouty and Jackson [BJ99] that enables sampling from the Fourier spectrum.
Developing Internet-based VHDL course material
Authors: J. Calhoun
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper examines the issues and challenges in association with leveraging the explosion in information technology systems to effectively develop and deliver on-line VHDL course material. Mississippi State University's (MSU) Microsystems Prototyping Laboratory (MPL) has been contracted by the RASSP (Rapid-prototyping of Application Specific Signal Processors) Educator/Facilitator Program to assist in the development of on-line VHDL course material. MSU has also developed a VHDL course through a grant from the ARPA AASERT program. The course utilizes the World Wide Web and its associated technologies as a delivery mechanism. The course also utilizes advanced multimedia including use of video and animation to enhance the learning process. The use of intelligent tutoring systems as a catalyst for on-line instruction and training of complex CAD tools is also being explored as a consequence of the development of this and other on-line electrical and computer engineering courses.
Improved HMM training and scoring strategies with application to accent classification
Authors: L. M. Arslan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We propose two methods to improve HMM speech recognition performance. The first method employs an adjustment in the training stage, whereas the second method employs it in the scoring stage. It is well known that a speech recognition system performance increases when the amount of labeled training data is large. However, due to factors such as inaccurate phonetic labeling, end-point detection, and voiced-unvoiced decisions, the labeling procedure can be prone to errors. We propose a selective hidden Markov model (HMM) training procedure in order to reduce the adverse influence of atypical training data on the generated models. To demonstrate its usefulness, selective training is applied to the problem of accent classification, resulting in a 9.4% improvement in classification error rate. The second goal is to improve HMM scoring performance. The objective of HMM training algorithms is to maximize the probability over the training tokens for each model. However, this does not guarantee a minimized error rate across the entire model set. Typically, biases in the confusion matrices can be observed. We propose a method for estimating the bias from input training data, and incorporating it into the general scoring algorithm. Using this technique, a 9.8% improvement is achieved in accent classification error rate.
A DHT-based FFT/IFFT processor for VDSL transceivers
Authors: Chin-Liang Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents a new VLSI architecture for computing the N-point discrete Fourier transform (DFT) of real data and the corresponding inverse (IDFT) based on the discrete Hartley transform, where N is a power of two. The architecture includes two real multipliers, three real adders, six memory-based buffers, two ROMs, and some simple logic circuits, making itself suitable for single-chip implementation. It is capable of evaluating one DFT sample or one IDFT sample every (log/sub 2/N+1)//sub 2/ clock cycles on average. Under 0.35 /spl mu/m CMOS technology, the proposed design can operate at a clock rate of 100 MHz to reach a throughput of 20M transform samples per second for N=512. The processing speed will be higher if more advanced CMOS technology is adopted to implement the same circuit. Such low-complexity and high-throughput feature supports that the proposed design is well suited for use in discrete multitone based very high-speed digital subscriber line transceivers.
A low resolution pulse position coding method for improved excitation modeling of speech transition
Authors: Jongseo Sohn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We propose a new excitation model for transitional speech to reduce the distortion due to the traditional two-excitation source, voiced unvoiced, model. The proposed low resolution pulse position coding (LRPPC) algorithm detects the existence of pulses at frames of weak periodicity, which are determined as unvoiced, and transmits the approximate pulse positions. In the decoder, dispersed pulses that have a flat magnitude spectrum are synthesized at the decoded positions to form the excitation signal. A subjective quality test shows that the vocoder employing the LRPPC algorithm produces better quality of speech, and is very robust to mode decision errors.
Optimal array pattern synthesis using semidefinite programming
Authors: F. Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We present a new technique to solve array pattern synthesis problems by using semidefinite programming. We first formulate (or reformulate) the array design problems into semidefinite programming problems, and then use the recently developed efficient numerical algorithms and software to compute the numerical solution of antenna array weights. Using this approach, we can directly solve not only the standard synthesis problems for nonuniform arrays, but also the synthesis problems for arrays having power restrictions and uncertainties. Numerical examples are presented to illustrate our approach.
Defining a Trusted Service-Oriented Network Environment
Authors: Emmanuel A. Adigun, J. H. P. Eloff
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Network device availability and reliability are very important in a network environment. The network devices in this environment provide services to the other nodes or devices on the network. Hence we define a service-oriented network environment. We also propose a novel model for a trusted service-oriented network environment by using an Internet Control Message Protocol. We argue that trust representation in this environment must be different from an application-oriented environment.
Towards automatic conceptual personalization tools
Authors: Faisal Ahmad, Sebastian de la Chica, Kirsten Butcher, Tamara Sumner, James H. Martin
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper describes the results of a study designed to validate the use of domain competency models to diagnose student scientific misconceptions and to generate personalized instruction plans using digital libraries. Digital library resources provided the content base for human experts to construct a domain competency model for earthquakes and plate tectonics encoded as a knowledge map. The experts then assessed student essays using comparisons against the constructed domain competency model and prepared personalized instruction plans using the competency model and digital library resources. The results from this study indicate that domain competency models generated from select digital library resources may provide the desired degree of content coverage to support both automated diagnosis and personalized instruction in the context of nationally-recognized science learning goals. These findings serve to inform the design of personalized instruction tools for digital libraries.
Synchronization Solutions for Decentralized Service Orchestrations
Authors: Ustun Yildiz, Claude Godart
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

This paper reports on a new formal approach for the decentralized orchestration of service oriented processes. We focus on the dynamic binding (discovery and use) of services following a decentralized approach. We investigate synchronization issues of a process being executed on different computing entities. We propose formal techniques that insures the synchronization of distributed activities in the presence of decentralized and dynamic service bindings. Precisely, our contribution consists of two different techniques that prevent concurrent service bindings. The latter are characterized by additional operations implemented by orchestrated services.
Accuracy and Performance Testing of Three-Dimensional Unsaturated Flow Finite Element Groundwater Programs on the Cray XT3 Using Analytical Solutions
Authors: Fred T. Tracy
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Because Richards' equation for describing unsaturated groundwater flow is highly nonlinear, it is challenging to test the accuracy and efficiency of parallel three-dimensional finite element groundwater programs used to model such activities as remediation of military sites and computing flows and pressures in levees broken by Hurricane Katrina. To aid in this testing, the author has recently derived steady-state and transient analytical solutions for unsaturated flow. With these solutions, both accuracy of the numerical solutions and the performance of the parallel versions of the computer programs may be easily tested. The other significant feature of these analytical solutions is that the amount of nonlinearity of the equation may be easily adjusted by a parameter á. This paper first presents the equations for the analytical solutions of steady-state and transient flow into a rectangular block of initially dry soil. It then uses the program FEMWATER as a benchmark to compute the numerical solutions corresponding to these analytical solutions. Accuracy results for various sizes of the mesh and numbers of processing elements (PEs) on the Cray XT3 are computed for different values of á. The number of nonlinear iterations for the steady-state problem is also reported. The result of the accuracy assessment is that as á is increased, the errors also increase significantly with even 512 PEs not being enough compute power to adequately solve the problem. Overall parallel performance and performance of the Message Passing Interface calls for updating the ghost nodes and are also tested with results given. The result of this study is that scaling of a 1,000,000-element problem was good up to 256 PEs (64 PEs is the typical sweet spot for FEMWATER), and the performance of the ghost-node updating routine met or exceeded expectations.
A new optimizing procedure for /spl nu/-support vector regressor
Authors: F. Perez-Cruz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We present an approach to solve the v-SVR. It is based on an iterative re-weighted least squares (IRWLS) procedure, which is simple to implement and can be tuned to the usual /spl nu/-SVR solution. The IRWLS procedure is much more efficient (computational load) than quadratic programming techniques, which are usually employed to solve it.
Optimum subband coding of cyclostationary signals
Authors: S. Dasgupta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We consider the optimal orthonormal subband coding of zero mean cyclostationary signals, with N-periodic second order statistics. A 2-channel uniform filter bank, with N-periodic analysis and synthesis filters, is used as the subband coder. A dynamic scheme involving N-periodic bit allocation is employed. An average variance condition is used to measure the output distortion. The conditions for maximizing the coding gain parallel those for the case when the signals are wide sense stationary (WSS) and the analysis and synthesis filters and the bit allocation time invariant, in that the blocked subband signals must be decorrelated and the subband power spectral densities must obey an ordering. Some additional conditions on this ordering, over and above those required for the WSS case, are needed.
Fair Cost Sharing among Multicast Receivers
Authors: Patrik Osterberg, Tingting Zhang
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

In scenarios where many receivers simultaneously are interested in the same data, multicast transmission is more bandwidth efficient than unicast. The reason is that the receivers of a multicast session share the resources through a common transmission tree. Since the resources are shared between the receivers, it is reasonable that the costs corresponding to these resources should be shared as well. This paper deals with fair cost sharing among multicast receivers. The work is based upon the assumption that costs should be shared based on resource usage. With this in mind, existing cost-allocation mechanisms are evaluated and the conclusion is that none of them is satisfactory fair. We therefore propose a new cost-allocation mechanism that allocates the costs according to the transmission path and obtained QoS level of each receiver.
Using SVM for Efficient Detection of Human Motion
Authors: J. Grahn, H. Kjellstromg
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

This paper presents a method for detection of humans in video. Detection is here formulated as the problem of classifying the image patterns in a range of windows of different size in a video frame as "human" or "non-human". Computational efficiency is of core importance, which leads us to utilize fast methods for image preprocessing and classification. Linear spatio-temporal difference filters are used to represent motion information in the image. Patterns of spatio-temporal pixel difference is classified using SVM, a classification method proven efficient for problems with high dimensionality and highly non-linear feature spaces. Furthermore, a cascade architecture is employed, to make use of the fact that most windows are easy to classify, while a few are difficult. The detection method shows promising results when tested on images from street scenes with humans of varying sizes and clothing.
Displays for exploration and comparison of nested or intersecting surfaces
Authors: Russell M. Taylor,  II
Venue:  (2006)

The surfaces of real-world objects almost never intersect, so the human visual system is ill prepared to deal with this rare case. However, the comparison of two similar models or approximations of the same surface can require simultaneous estimation of individual global shape, estimation of point or feature correspondences, and local comparisons of shape and distance between the two surfaces. A key supposition of this work is that these relationships between intersecting surfaces, especially the local relationships, are best understood when the surfaces are displayed such that they do intersect. For instance, the relationships between radiation iso-dose levels and healthy and tumorous tissue is best studied in context with all intersections clearly shown. This dissertation presents new visualization techniques for general layered surfaces, and intersecting surfaces in particular, designed for scientists with problems that require such display. The techniques are enabled by a union/intersection refactoring of intersecting surfaces that converts them into nested surfaces, which are more easily treated for visualization. The techniques are aimed at exploratory visualization, where accurate performance of a variety of tasks is desirable, not just the best technique for one particular task. User studies, utilizing tasks selected based on interviews with scientists, are used to evaluate the effectiveness of the new techniques, and to compare them to some existing, common techniques. The studies show that participants performed the user study tasks more accurately with the new techniques than with the existing techniques.