ppxscal/embedding_network huggingface dataset:
Energy efficient key management protocols to secure sensor networks
Authors: Sanjay Kumar Madria
Venue:  (2006)

In sensor networks, large numbers of tiny sensor nodes communicate remotely or locally among themselves to accomplish a wide range of applications. However, such a network poses serious security protocol design challenges due to the ad hoc nature of the communication and constraints such as limited energy, processor speed and memory. To secure such a wireless network, the efficient key management techniques are important. Existing techniques assume energy and memory equipped nodes. This dissertation proposes energy efficient group key management protocols for secure sensor networks. First we propose a group key management protocol for hierarchical sensor networks where instead of using pre-deployed keys, each sensor node generates a partial key dynamically using a function. The function takes partial keys of its children as arguments. In the second protocol, we propose an Energy and Communication Efficient Group key management (ECEG) scheme which reduces the usage of memory, communication and energy in sensors. This scheme is designed based on the idea that each node is pre-loaded with a key chain and an elliptic curve. The next key management protocol is based on securing cluster heads in sensor networks. As the cluster head does data aggregation and takes important decision on the behalf of a group, hence it is crucial to provide enhanced security to the cluster head when compared to general nodes. In the last scheme we propose a protocol called RBASH (Role Based Hierarchical Sensor Networks) which provides role-based multi-level security in sensor networks. Each group is organized in such a way that, they can have different roles and depending on their roles, can have different levels of access. The success of each of these schemes in providing security and being energy efficient is experimentally evaluated through the simulations using TinyOs and TOSSIM. This includes, analyzing the time and energy consumption in broadcasting partial keys and group key under two sensor routing protocols (Tiny-AODV and Tiny-Diffusion) by varying the number of nodes and key sizes. Some of the other experiments include evaluation of the packet loss in the network, packet delivery time for partial and group key computation, energy consumption and comparison with the existing scheme like &mu;TESLA.
Multipitch estimation and sound separation by the spectral smoothness principle
Authors: A. P. Klapuri
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

A processing principle is proposed for finding the pitches and separating the spectra of concurrent musical sounds. The principle, spectral smoothness, is used in the human auditory system which separates sounds partly by assuming that the spectral envelopes of real sounds are continuous. Both theoretical and experimental evidence is presented for the vital importance of spectral smoothness in resolving sound mixtures. Three algorithms of varying complexity are described which successfully implement the new principle. In validation experiments, random pitch and sound source combinations were analyzed in a single time frame. The number of simultaneous sounds ranged from one to six, the database comprising sung vowels and 26 musical instruments. Usage of a specific yet straightforward smoothing operation corrected approximately half of the pitch errors that occurred in a system which was otherwise identical but did not use the smoothness principle. In random four-voice mixtures, pitch error rate reduced from 18 % to 8.1 %.
A Formal Framework for Web Services Coordination
Authors: Claudio Guidi, Roberto Lucchi, Manuel Mazzara
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Recently the term Web Services Choreography has been introduced to address some issues related to Web Services Composition and Coordination. Several proposals for describing Choreography for Business Processes have been presented in the last years and many of these languages (e.g. BPEL4WS) make use of concepts as long-running transactions and compensations for coping with error handling. However, the complexity of BPEL4WS makes it difficult to formally define this framework, thus limiting the formal reasoning about the designed applications. In this paper, we formally address Web Services Coordination with particular attention to Web transactions. We enhance our past work - the Event Calculus - introducing two main novelties: i) a multicast event notification mechanism, and ii) event scope names binding. The former enables an easier specification of complex coordination scenarios - such as E-commerce applications require - while the latter allows many new interesting behaviors which can be very useful in business scenarios: the introduction of private event scope names - used to deal with security and privacy - and a dynamic event scopes definition that can be used to manage multiple instances of the same application.
Redundancy in block coded modulations for channel equalization based on spatial and temporal diversity
Authors: G. Vazquez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Linear block codes in the complex field can be applied in spatial and/or temporal diversity receivers in order to develop high performance schemes for (almost-) blind equalization in mobile communications. The proposed technique uses the structure of the encoded transmitted information (with redundancy) to achieve equalization schemes based on a deterministic criterion. Simulations show that the proposed technique is more efficient than other schemes that follow similar equalizer structures. The result is an algorithm that provides the design of channel equalizers in low EbNo scenarios.
Decimal Floating-Point Multiplication Via Carry-Save Addition
Authors: Mark A. Erle, Michael J. Schulte, Brian J. Hickmann
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

Decimal multiplication is important in many commercial applications including financial analysis, banking, tax calculation, currency conversion, insurance, and accounting. This paper presents the design of a decimal floating-point multiplier that complies with specifications for decimal multiplication given in the draft revision of the IEEE 754 Standard for Floating-point Arithmetic (IEEE 754R). This multiplier extends a previously published decimal fixedpoint multiplier design by adding several features including exponent generation, sticky bit generation, shifting of the intermediate product, rounding, and exception detection and handling. The core of the decimal multiplication algorithm is an iterative scheme of partial product accumulation employing decimal carry-save addition to reduce the critical path delay. Novel features of the proposed multiplier include support for decimal floating-point numbers, on-thefly generation of the sticky bit, early estimation of the shift amount, and efficient decimal rounding. Area and delay estimates are provided for a verified Verilog register transfer level model of the multiplier.
Gap detector for multipath
Authors: Chuang He
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In a multipath communication channel, the optimal receiver is matched to the maximum likelihood (ML) estimate of the multipath signal. In general, this leads to a computationally intensive multi-dimensional nonlinear optimisation problem. We develop a detection algorithm that avoids the ML estimation while still achieving good performance. Our approach is based on a geometric interpretation of the problem. The ML estimate of the multipath signal is the orthogonal projection of the received signal on a suitable signal subspace S. We design a second subspace G, the representation subspace, that is close to S, but whose orthogonal projection is easily computed. The "closeness" is measured by the gap metric. The subspace G is designed by using wavelet multiresolution analysis tools coupled with a reshaping algorithm in the Zak transform domain. We show an example where our approach significantly outperforms the correlator receiver and an alternative suboptimal approach.
Active Biometric Cryptography (ABC): Key Generation Using Feature and Parametric Aggregation
Authors: Christopher R. Costanzo
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Key generation and storage mechanisms are responsible for some of the more common security weaknesses affecting many information systems today. Passwords can be lost, stolen, or easily hacked. Work has been done demonstrating the use of biometrics to produce cipher keys, however these approaches typically require that the user store a template of their biometric in either a local or remote database which can be compared to future biometric samples. Other approaches require complex data processing to recover the cipher key. The proposed approach eliminates the need for template storage and demonstrates how a cryptographic key can be constructed through the use of biometric feature and parametric aggregation along with certain mathematical combinatorial and permutation constructs.
Transmit beamforming combined with diversity techniques for cdma2000 systems
Authors: R. A. Soni
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

With the advent of new wireless mobile Internet technologies, there has been a significant increase in demand for capacity on the forward link of cellular systems. While significant enhancements to the system have improved the performance of the system, there continues to be a greater need for even more capacity on the forward link. Further capacity can only be derived by exploiting the spatial distribution of users. By intelligently steering energy related to a mobile only in the direction of a mobile, capacity can be increased. Use of intelligent antenna techniques coupled with transmit diversity techniques offer the most robust performance gains across a variety of environments. This paper discusses an antenna array architecture which exploits a combination of diversity and coherent antenna arrays to achieve peak performance in a cdma2000 environment. Performance results are given for this antenna architecture under a number of fading conditions.
Women In Engineering: A Personal Success Story
Authors: C. Coleman
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Statistics are generally used to identify and address needs such as the inclusion of more women and minorities in engineering. In this paper, the authors synthesize the experiences of thirty-six engineers and six computer scientists in order to understand some of the positive and negative factors in these women's lives, and explore ways of teaching and advising in engineering schools that would allow the increasingly diverse student population to be better served. The students who reach college are a select group who have overcome the early barriers and are set on a potential track to becoming an engineer. College advisors and teachers need to reaffirm the methods and thinking these students have evolved, but which may be challenged by the system based on a "normative student" model. The authors present a theory that begins to explore these aspects. 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
Development of Multi-Broadband Planar Wire Antennas for Wireless Applications
Authors: Ronglin Li, Gerald Dejean, Manos M. Tentzeris, Joy Laskar
Venue: Wireless Personal Communications: An International Journal (2007)

A new type of multi-broadband antennas is developed for wireless applications. The broadband performance of this type of antennas is achieved by introducing a small gap on a wire loop while the multi-band operation is realized by simultaneously exciting one or more additional wire elements. Three antenna configurations are investigated for single-, dual-, and triple-broadband operations. The dual-broadband operation is obtained by employing a combination of a loop and a monopole. The triple-broadband antenna consists of a loop, a monopole, and an inverted-L structure. It is demonstrated that the multi-broadband antennas can achieve a bandwidth of 30% in the 1GHz band, 50% in the 2 GHz band, and 40% in the 5 GHz band, which cover the frequency bands for AMPS/PCS, GSM/DCS, PDC/PHS, and IMT-2000 mobile communications as well as for 2.4-GHz and 5-GHz wireless applications.
Parallel garbage collection for shared memory multiprocessors
Authors: Christine H. Flood, David Detlefs, Nir Shavit, Xiaolan Zhang
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

We present a multiprocessor "stop-the-world" garbage collection framework that provides multiple forms of load balancing. Our parallel collectors use this framework to balance the work of root scanning, using static overpartitioning, and also to balance the work of tracing the object graph, using a form of dynamic load balancing called work stealing. We describe two collectors written using this framework: pSemispaces, a parallel semispace collector, and pMarkcompact, a parallel markcompact collector.
Time series analysis for ECG data compression
Authors: H. M. Abbas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This work presents a new electrocardiogram (ECG) data compression method. By differentiating the signal and using proper thresholding, the ECG is first segmented into a sequence of straight lines. The vertices of these lines are used to encode the signal. The decoding part works by applying the fast orthogonal search (FOS) method (Korenberg and Paarmann 1991) to reconstruct the original signal. Simulation results have demonstrated the efficiency of the algorithm.
Attack Probability Based Deterministic Key Predistribution Mechanism for Non-Uniform Sensor Deployment
Authors: Chia-Mu Yu, Cheng-Chung Li, Chun-Shien Lu, Der-Tsai Lee, Sy-Yen Kuo
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Secure communication is a challenging problem in wireless sensor networks. In this paper, we investigate an attack probability-based deterministic key predis- tribution method for non-uniform sensor deployment. First, we design a reasonable model for group-based de- ployment to estimate the attack probability of each de- ployment group. Second, our proposed model further considers the location of data sink to meet the practical situation. Third, based on this attack model, a deter- ministic key predistribution mechanism is presented for group-based deployment. The proposed method mainly aims at preserving the integrity of network so that the functionality of each sensor node can be used. To evaluate the proposed method, the issues of memory overhead, communication overhead, and the fraction of total communications compromised after adversaries launch node capture attacks are studied analytically and numerically.
Describing multimedia documents in natural and semantic-driven ordered hierarchies
Authors: N. Adami
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this work we present the ToCAI (Table of Content-Analytical Index) framework, a description scheme (DS) for content description of audio-visual (AV) documents. The idea for such a description scheme comes out from the structures used for indexing technical books (table of content and analytical index). This description scheme provides therefore a hierarchical description of the time sequential structure of a multimedia document (ToC), suitable for browsing, together with an analytical index (AI) of the key items of the document, suitable for retrieval. The AI allows to represent in an ordered way the items of the AV document which are most relevant from the semantic point of view. The ordering criteria are therefore selected according to the application context. The detailed structure of the DS is presented by means of UML notation as well and an application example is shown.
Classification and Clustering: A Perspective toward Risk Mining
Authors: Sadaaki Miyamoto
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this paper three topics concerning data clustering are discussed. One is an association found in supervised classification and clustering, whereby new techniques of clustering can be developed some of which are described here. Next two are concerned with risk mining. The consideration of associations between the above two classes of methods is related to the second topic in which clustering in the presence of rough sets is considered. The third is related to mining actual data on a risk issue, where the method of fuzzy clustering is applied. Throughout these considerations, we focus more on a research perspective, i.e., possibilities in near future rather than an established method or algorithm.
Detecting Stellar Streams in the Halos of Galaxies with Voronoi Tessellations
Authors: Jonathan Sick, Roelof de Jong
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Galaxy formation models oriented towards a \LambdaCDM cosmology envision galaxies as being built through the accretion of dwarf galaxies. Such galaxy accretion should appear as tidally-disrupted streams of stars in the halo of the host galaxy. Yet these stellar streams have very low surface brightnesses, making their detection difficult. We propose that surface luminosity maps, derived from Hubble Space Telescope Advanced Camera for Surveys resolved star photometry, can be used to reveal stellar structures in the halos of galaxies. To create surface luminosity maps with high, yet consistent, signal to noise, the Centroidal Voronoi Tessellation is used. The Voronoi tessellation offers the advantage of optimal binning to preserve spatial resolution. As preliminary testing has shown, the technique reveals halo structures, such as the dwarf galaxy near NGC 4631, as bright, compact, Voronoi regions.
Stereo-based hand gesture tracking and recognition in immersive stereoscopic displays
Authors: Linda Shapiro
Venue:  (2006)

This dissertation presents a novel method of tracking and recognizing gestures for the purpose of interaction with virtual 3D environments.
From small groups to learning communities: energizing large classes
Authors: K. A. Smith
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Summary form only given. The article presents a brief work in progress which highlights over 60 interviews with faculty who have implemented active, interactive and cooperative learning and learning communities in large classes (over 100 students). The article summarizes the research case for small-group learning and learning communities, describes a variety of approaches for implementing small group learning based on practices of faculty who were interviewed, highlights faculty members' responses to common challenges and problems, and provides suggestions for moving to broader implementation to active, interactive and cooperative learning. 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
Kernel plugins: when a VM is too much
Authors: Ivan Ganev, Greg Eisenhauer, Karsten Schwan
Venue: Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3 (2004)

This paper presents kernel plugins, a framework for dynamic kernel specialization inspired by ideas borrowed from virtualization research. Plugins can be created and updated inexpensively on-the-fly and they can execute arbitrary user-supplied functions such that neither safety nor performance are compromised. Three key techniques are used to implement kernel plugins: (1) hardware fault isolation, (2) dynamic code generation, and (3) dynamic linking. Hardware fault isolation protects kernel-level services from plugin misbehavior, dynamic code generation enables rapid online creation of arbitrary plugins, and dynamic linking governs the kernel/plugin interface. We discuss the design and implementation of the kernel plugin facility, as well as its advantages and shortcomings. Its use is demonstrated by a range of micro-and macro-benchmarks and a real-life application featuring plugins that dynamically transcode images served by a high-performance kernel web server. Benefits realized from plugins can be both qualitative (adapting services to clients' needs), and quantitative (improving performance through co-location of application plugin code with kernel services). Plugins are implemented in GNU/Linux on the Intel x86 platform. Reported performance results include plugin upcalls in 0.45-0.62 µS, dynamic code generation in 4 mS, and linking/unlinking in 3.1/1.6 µS for an image grayscaling plugin - a dynamically code generated 66-line function written in a subset of C. All results are measured on an 866 MHz Pentium III.
Maximum likelihood methods for bearings-only target localization
Authors: L. M. Kaplan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We develop four maximum likelihood (ML) methods to localize a moving target using a network of acoustical sensor arrays. Each array transmits a direction-of-arrival (DOA) estimate to a central processor, which employs one of the localization techniques. The four ML approaches use different target signal models where the time retardation factor for the target position and the degradation of the target signal through the air may or may not be included in the model. We compare these methods along with a linear least squares approach through a number of simulations at various signal to noise levels.
Frequency domain active noise control system using optimal step-size parameters
Authors: Y. Kajikawa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We propose a frequency domain active noise control system using optimal step-size parameters at each frequency. The proposed ANC system can converge faster than the conventional ANC system using the Filtered-x LMS algorithm with the optimal step-size parameter. Moreover, the proposed system can converge by setting the step-size parameters at unstable frequencies to 0 in the case where the phase error of the secondary path model does not satisfy the stable condition, whereas the conventional ANC system cannot converge in this case. In this paper, the theoretical equation of the optimal step-size parameters is derived by using available information during system operation. Next, we present the structure of the ANC system using the optimal step-size parameters obtained from the theoretical equation. Moreover, a control technique determining unstable frequencies is introduced. Finally, simulation results demonstrate the efficiency of the proposed ANC system.