ppxscal/embedding_network huggingface dataset:
A feasibility study: secure public key infrastructure with quantum key distributions in grid computing
Authors: Ronald I. Frank
Venue:  (2007)

To address Internet and E-Commerce security requirements, businesses deploy advanced network protocols and Web Services security standards to ensure transaction privacy, data integrity and information confidentiality. The Public Key Infrastructure (PKI) that utilizes the X.509 protocol has been a widely adopted security mechanism to meet today's Internet and E-Commerce security requirements. Unfortunately, Public Key Infrastructure (PKI) is limited by key transmission security concerns between senders and receivers. Eavesdroppers who are equipped with advanced computer resources are capable of breaching Internet and Web Services security via man-in-the-middle attacks. We propose using Quantum Key Distribution to answer the key transmission concerns. Based on the laws of nature (Quantum Physics), Quantum Cryptography promises to be an unbreakable, eavesdropping-proof security measure. Utilizing the Internet as the process backend, the on-demand, service-oriented business model is the key to transforming modern businesses to meet challenges in the new millennium. Grid computing is one way to address the requirements for the on-demand, service-oriented business model. Grid systems create a dynamic "Virtual Organization" (VO) that combines groups of various computer resources and services over the Internet and aggregates these computer resources and services for common purposes. This dissertation first analyzes vulnerabilities of network security protocols and Web Services security standards, which Grid computing embraces as part of its security offerings. Based on the understanding of the vulnerabilities we surveyed, we suggest building a transitive trust architecture for X.509 certificates to ensure proper authentication and authorization and then we propose combining classical Public Key Infrastructure (PKI) for heavy message traffic with point-to-point Quantum Key Distribution for distributing the private keys between Grid service providers and Grid service requesters. We conclude with a proposal for and a feasibility analysis of enhancing Grid security requirements using Quantum Key Distribution.
Interactive presentation: Efficient computation of discharge current upper bounds for clustered sleep transistor sizing
Authors: A. Sathanur, A. Calimera, L. Benini, A. Macii, E. Macii, M. Poncino
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Sleep transistor insertion is a key step in low power design methodologies for nanometer CMOS. In the clustered sleep transistor approach, a single sleep transistor is shared among a number of gates and it must be sized according to the maximum current that can be injected onto the virtual ground by the gates in the cluster. A conservative (upper bound) estimate of the maximum injected current is required in order to avoid excessive speed degradation and possible violations of timing constraints. In this paper we propose a scalable algorithm for tightening upper bound computation, with a controlled and tunable computational cost. The algorithm leverages the capabilities of state-of-the-art commercial timing analysis engines, and it is tightly integrated into standard industrial flow for leakage optimization. Benchmark results demonstrate the effectiveness and efficiency of our approach.
Kerberos security with clocks adrift
Authors: Don Davis, Daniel E. Geer
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

We show that the Kerberos Authentication System can relax its requirement for synchronized clocks, with only a minor change which is consistent with the current protocol. Synchronization has been an important limitation of Kerberos; it imposes political costs and technical ones. Further, Kerberos' reliance on synchronization obstructs the secure initialization of clocks at bootstrap. Perhaps most important, this synchronization requirement limits Kerberos' utility in contexts where connectivity is often intermittent. Such environments are becoming more important as mobile computing becomes more common. Mobile hosts are particularly refractory to security measures, but our proposal gracefully extends Kerberos even to mobile users, making it easier to secure the rest of a network that includes mobile hosts. An advantage of our proposal is that we would not change the Kerberos protocol per se; a special type of preauthentication exchange can convey just enough replay protection to authenticate the initial ticket and its times-tamp to an unsynchronized client, without adding process-state to the system's servers.
WINS in the Lehman infrastructure
Authors: Chris Rouland
Venue: Proceedings of the 1997 Workshop on Large Scale System Administration of Windows NT (1997)

This document describes the proposed method for creating a more stable implementation of the Windows Internet Naming System. It begins with an overview of WINS, explaining what it is and how it works. This is followed by a description of the WINS server that will be used in this implementation. Finally, the WINS server integration with Moira and its use in the Lehman environment is detailed.
Integrating coherency and recoverability in distributed systems
Authors: Michael J. Feeley, Jeffrey S. Chase, Vivek R. Narasayya, Henry M. Levy
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

We propose a technique for maintaining coherency of a transactional distributed shared memory, used by applications accessing a shared persistent store. Our goal is to improve support for fine-grained distributed data sharing in collaborative design applications, such as CAD systems and software development environments. In contrast, traditional research in distributed shared memory has focused on supporting parallel programs; in this paper, we show how distributed programs can benefit from this shared-memory abstraction as well. Our approach, called log-based coherency, integrates coherency support with a standard mechanism for ensuring recoverability of persistent data. In our system, transaction logs are the basis of both recoverability and coherency. We have prototyped log-based coherency as a set of extensions to RVM [Satyanarayanan et al. 94], a runtime package supporting recoverable virtual memory. Our prototype adds coherency support to RVM in a simple way that does not require changes to existing RVM applications. We report on our prototype and its performance, and discuss its relationship to other DSM systems.
Model Checking Branching Time Logics
Authors: Ph. Schnoebelen
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

Branching-time logics are temporal logics that allow quantification over possible futures [3, 4]. Such logics have been considered very early by the automated verification community because efficient model-checking algorithms for logics like CTL could be easily implemented and were used successfully [1].
Using WordNet to automatically deduce relations between words in noun-noun compounds
Authors: Fintan J. Costello, Tony Veale, Simon Dunne
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We present an algorithm for automatically disambiguating noun-noun compounds by deducing the correct semantic relation between their constituent words. This algorithm uses a corpus of 2,500 compounds annotated with WordNet senses and covering 139 different semantic relations (we make this corpus available online for researchers interested in the semantics of noun-noun compounds). The algorithm takes as input the WordNet senses for the nouns in a compound, finds all parent senses (hypernyms) of those senses, and searches the corpus for other compounds containing any pair of those senses. The relation with the highest proportional co-occurrence with any sense pair is returned as the correct relation for the compound. This algorithm was tested using a 'leave-one-out' procedure on the corpus of compounds. The algorithm identified the correct relations for compounds with high precision: in 92% of cases where a relation was found with a proportional co-occurrence of 1.0, it was the correct relation for the compound being disambiguated.
Best of both: a hybridized centroid-medoid clustering heuristic
Authors: Nizar Grira, Michael E. Houle
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Although each iteration of the popular k-Means clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to a solution. This paper introduces an enhancement of k-Means in which local search is used to accelerate convergence without greatly increasing the average computational cost of the iterations. The local search involves a carefully-controlled number of swap operations resembling those of the more robust k-Medoids clustering heuristic. We show empirically that the proposed method improves convergence results when compared to standard k-Means.
An algorithm for exhaustive extrema computation and its application to array signal processing
Authors: R. Tweg
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

This paper presents an algorithm for exhaustive extrema computation of one-dimensional cost functions. Its applicability to array signal processing is demonstrated. We use it for antenna array design, and to solve a multiple source direction finding problem using MUSIC, beamformer and minimum variance methods.
Spectrum-shaping method to improve spectral efficiency of OFDM systems
Authors: N. Izuka, Y. Daido, S. Mizuno, Y. Yamakita
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper proposes a spectrum-shaping filter for an OFDM signal. In the proposed method, the transmitted signal after multi-carrier modulation with the inverse Fourier transform is spectrally shaped by root-roll-off filters, and the received signal before Fourier transform is also shaped by the filters. An out-of-band emission level can be significantly reduced under the condition that the transmitted data can be perfectly recovered. The paper also describes an optimized impulse response of the filter to reduce the emission level. The resultant. filter has a new impulse response different from the root-roll-off filter. The effective roll-off factor of 0.1 and the emission level of less than -100 dB are obtained with the optimization when the number of filter taps is 201 at an over-sampling rate of 4. We calculate output power spectra with the proposed filter and a conventional raised cosine window in the time domain. The calculation results show that the signal bandwidth with the proposed method can be less than one third of the bandwidth with the conventional method at an emission level of -60 dB. Therefore, the proposed method can significantly improve the spectral efficiency of OFDM systems.
Composition of Cyber-Physical Systems
Authors: Janos Sztipanovits
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Cyber Physical Systems (CPS) is emerging as a new research discipline at the intersection of physical, biological, engineering and information sciences. Information technology, once a provider of tools for sciences and engineering, has become an interdisciplinary field at the center of scientific and industrial innovation. This talk addresses some of the basic challenges of CPS and its relationship to ECBS.
Hysteretic Hopfield network with dynamic tunneling for crossbar switch and N-queens problem
Authors: P. Thangavel, D. Gladis
Venue: Neurocomputing (2007)

An efficient hysteretic Hopfield network with dynamic tunneling is proposed. The hysteretic activation function is used for training. The dynamic tunneling approach is employed to detrap the network from local minima. The network gives better convergence results for the selected problems namely crossbar switch problem with exclusive switching and concurrent switching, and N-queens problem.
Towards a Synchronous Scheduling Service on Top of a Unicast Distributed Real-Time Java
Authors: Pablo Basanta-Val, Luis Almeida, Marisol Garcia-Valls, Iria Estevez-Ayres
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

This paper describes an approach towards the definition and implementation of a synchronization service on top of a remote object model offered by an unicast real-time remote object paradigm. Also an architecture model based on the RTSJ (Real-time Specification for Java) and the distribution middleware RMI (Remote Method Invocation) specifications is proposed in order to give support to the model, defining a convergence layer that manages the underlying resources involved in a master-slave communication through a new API. Finally, preliminary results from an implementation prototype show the feasibility of the model and provide an initial estimation of jitters and the performance of the synchronization service.
Embedded algebraic vector quantizers (EAVQ) with application to wideband speech coding
Authors: Minjie Xie, J.-P. Adoul
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A new lattice vector quantization scheme, namely embedded algebraic vector quantizers (EAVQ), is proposed. This scheme makes use of spherical subsets of the rotated Gosset lattice RE/sub 8/ to constitute a vector-quantizer codebook. The codebook consists of several sub-codebooks and has an embedded structure. The codewords can be generated using an algebraic method and do not have to be stored. In combination with transform coded excitation (TCX) coding, this quantization technique is applied to 16 kbps wideband speech coding in order to quantize the so-called target signal in the frequency domain. Compared to a stochastic complex vector quantization scheme, EAVQ can achieve better performance and lead to significant savings of memory requirements.
New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization
Authors: Diego R. Llanos, David Orden, Belen Palop
Venue: IEEE Transactions on Computers (2007)

In this work, we address the problem of scheduling loops with dependences in the context of speculative parallelization. We show that the scheduling alternatives are highly influenced by the dependence violation pattern the code presents. We center our analysis in those algorithms where dependences are less likely to appear as the execution proceeds. Particularly, we focus on randomized incremental algorithms, widely used as a much more efficient solution to many problems than their deterministic counterparts. These important algorithms are, in general, hard to parallelize by hand and represent a challenge for any automatic parallelization scheme. Our analysis led us to the development of Meseta, a new scheduling strategy that takes into account the probability of a dependence violation to determine the number of iterations being scheduled. Meseta is compared with existing techniques, including Fixed-Size Chunking (FSC), the only scheduling alternative used so far in the context of speculative parallelization. Our experimental results show a 5.5 percent to 36.25 percent speedup improvement over FSC, leading to a better extraction of the parallelism inherent to randomized incremental algorithms. Moreover, when the cost of dependence violations is too high to obtain speedups, Meseta curves the performance degradation.
Portals in 4.4BSD
Authors: W. Richard Stevens Jan-Simon Pendry
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

Portals were added to 4.4BSD as an experimental feature and are in the publicly available 4.4BSD-Lite distribution. Portals provide access to alternate file types or devices using names in the normal filesystem that a process just opens. For example, an open of /p/tcp/foo.com/smtp returns a TCP socket descriptor to the calling process that is connected to the SMTP server on the specified host. By providing access through the normal filesystem, the calling process need not be aware of the special functions necessary to create a TCP socket and establish a TCP connection. This makes TCP connections, for example, available to programs such as Awk, Tcl, and shell scripts. This paper describes the implementation of portals in 4.4BSD as another type of filesystem and provides some examples.
Joint optimal impulse response shortening
Authors: P. J. W. Melsa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

In discrete multitone a cyclic prefix (CP) is inserted between symbols to ensure that samples from one symbol do not interfere with the samples of another symbol. The CP length is determined by the impulse response length of the effective physical channel. The cyclic prefix reduces the throughput of the transceiver. When the transceiver is used in a full-duplex environment the portion of the receive signal arising from echo must be reduced through the use of echo cancellation, the complexity of which is directly related to the length of the echo path impulse response. To alleviate both problems a short time-domain FIR filter can be used to shorten both the effective channel and echo impulse responses. This paper explores a joint optimal algorithm for determining the coefficients of this time-domain filter, resulting in reduced ISI and echo canceller complexity. For the simulations a configuration is chosen which is representative of that encountered by the remote terminal in the asymmetrical digital subscriber lines (ADSL) environment.
A semantic workflow authoring tool for programming grids
Authors: Giuseppe Avellino, Stefano Beco, Barbara Cantalupo, Andrea Cavallini
Venue: Proceedings of the 2nd workshop on Workflows in support of large-scale science (2007)

Workflows have an increasing role in scientific applications programming and business environment development because they are an effective technology to define composition of different pieces of knowledge, both in the application domain and in the business context. However, workflows are addressed in a number of different perspectives and no consensus has been reached yet on the language, modelling, and systems, to adopt in advanced contexts like Grid or semantic Web. In this paper, we describe a graphical tool for supporting different kinds of users in authoring workflows running on next generation Grids. The tool, named Semantic Workflow Programming Tool, is based on a reference workflow model that has been developed to provide advanced functionality with respect to the currently available workflow description. Design and functionality of the tool resulted from requirements and scenarios emerged in the EU funded NextGRID project, in whose context the tool is developed.
Automatic Deformation Detection for Visual Post Inspection
Authors: Dirk Padfield, Glen Brooksby, Robert Kaucic
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Computer vision algorithms are seeing increased use in industrial inspection applications. Here, we present an "Aid to Visual" system that can detect post deformations of less than 0.005 inches in jet engine high pressure turbine disks. We create a gold-standard reference post from the posts of sample turbine disks and then use registration, edge detection, and curve-similarity algorithms to identify unacceptable post deformations. We address the challenges associated with adapting academic algorithms for use in functioning inspection systems. We present novel solutions to deal with practical issues such as accuracy, speed, robustness, and ease of use. Finally, we have integrated our algorithms into the software used in the work-flow of plantfactory inspectors, who will be able to identify minute post deformations that were previously difficult to detect.
Adaptive optimal bounded-ellipsoid identification with an error under-bounding safeguard: applications in state estimation and speech processing
Authors: D. Joachim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Optimal bounding ellipsoid (OBE) identification algorithms are noted for their simplicity and ability to leverage model error-bound knowledge for improved parameter convergence. However, the OBE convergence rate is dependent on the pointwise "tightness" of the model error-bound estimates. Since the least upper bound on the model error is often unknown, the convergence rate is compromised by the need to overestimate error-bounds lest the integrity of the process be violated by underestimation. We present an effective under-bounding safeguard against system model violations in OBE processing. Simulation examples in state estimation and speech processing demonstrate the efficacy of the under-bounding safeguard. 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
Nonlinear cumulant based adaptive filter for simultaneous removal of Gaussian and impulsive noises in images
Authors: H. M. Ibrahim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This correspondence presents an edge-preserving higher order statistics (HOS) based filter called nonlinear cumulant based adaptive filter (NCBAF) for noise suppression in images. The NCBAF algorithm combines the linear (averaging) characteristics of the two-dimensional cumulant based adaptive enhancer (2DCBAE) and the nonlinear characteristics of the median filter. The proposed algorithm allows the simultaneous removal of impulsive and Gaussian noise types in images, processed in a single filtering pass. The performance of the proposed method is compared to the commonly used median filter and the 2DCBAE.
Introduction of rapid systems prototyping into undergraduate computer engineering curricula
Authors: J. Hamblen, H. Owen, S. Yalamanchili
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The rapid evolution of the computing industry challenges academic curricula to keep pace in providing students with a modern education. In many existing curricula, laboratories, and textbooks there is a notable lack of recent research advances in CAD, rapid prototyping, and integrated hardware/software design. Many electrical and computer engineering career paths in both industrial research and development as well as academic research require competence in these areas. The paper describes a two quarter undergraduate capstone design class in a computer engineering curriculum. Design groups comprised of students from several different areas of specialization (e.g., software systems, VLSI devices and circuits, and computer architecture) design, simulate, implement, and evaluate a complete computing system. The projects in the current sequence include a pipelined 32 bit RISC processor, a 4 cell systolic array processor and a video game. The goal is to produce simulation and hardware/software codesign as early as possible in the design process. Students execute software on simulation models prior to any hardware implementation. Throughout the sequence, students participate in design reviews, and must provide documentation of their designs. The final designs are implemented in arrays of field programmable gate arrays (FPGAs) contained in a device called a hardware emulator. This allows for ease of design modifications while still having actual hardware for experimentation.