ppxscal/embedding_network huggingface dataset:
CaseMan: A Case Management Tool for CFD Applications
Authors: Alan Shih, Corey Shum, Mark Dillavou, Ralph Noack, Bharat Soni, Greg Power
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Computational Fluid Dynamics (CFD) has become a crucial tool to predict and analyze flow field within a domain. When engineers understand the complex flow patterns, reliable results can be provided. However, accuracy improvement, confidence development, throughput increase, and cost reduction are the four key challenges to CFD. Solution throughput in the generation of aerodynamics, propulsion, and fluid dynamics simulations that involve parametric and sensitivity studies of design and analysis must be significantly improved. Such parametric and sensitivity studies require a large number of CFD simulation runs. However, preparing and managing such a large number of CFD simulation jobs is a challenging problem even for experienced users; compounded by the complexity of running these simulations with different cluster environments on the Department of Defense (DoD) High Performance Computing (HPC) systems. Moreover, different groups of users may prefer a different CFD solver that requires a different input file format and outputs solutions in various flavors.
Process variation tolerant low power DCT architecture
Authors: Nilanjan Banerjee, Georgios Karakonstantis, Kaushik Roy
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

2-D Discrete Cosine Transform (DCT) is widely used as the core of digital image and video compression. In this paper, we present a novel DCT architecture that allows aggressive voltage scaling by exploiting the fact that not all intermediate computations are equally important in a DCT system to obtain "good" image quality with Peak Signal to Noise Ratio(PSNR) > 30 dB. This observation has led us to propose a DCT architecture where the signal paths that are less contributive to PSNR improvement are designed to be longer than the paths that are more contributive to PSNR improvement. It should also be noted that robustness with respect to parameter variations and low power operation typically impose contradictory requirements in terms of architecture design. However, the proposed architecture lends itself to aggressive voltage scaling for low-power dissipation even under process parameter variations. Under a scaled supply voltage and/or variations in process parameters, any possible delay errors would only appear from the long paths that are less contributive towards PSNR improvement, providing large improvement in power dissipation with small PSNR degradation. Results show that even under large process variation and supply voltage scaling (0.8V), there is a gradual degradation of image quality with considerable power savings (62.8%) for the proposed architecture when compared to existing implementations in 70 nm process technology.
Enterprise Architecture: Challenges and Implementations
Authors: Frank Armour, Stephen Kaisler, Jeff Bitner
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Enterprise Architecting (EA) is the process of developing enterprise Information Technology architecture -- both its description and its implementation. An EA description focuses on a holistic and integrated view of the why, where, and who uses IT systems and how and what they are used for within an organization. An enterprise architect develops the strategy and enables the decisions for designing, developing, and deploying IT systems to support the business operations as well as to assess, select, and integrate the technology into the organization's infrastructure. Alignment between business and IT is one of the top issues for CIOs and IS managers for several years as report.
Space-time processing TDMA wireless testbed
Authors: H. Sampath
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The paper describes the architecture of the Stanford University (SU) TDMA standalone testbed. The testbed was developed to evaluate space-time processing (STP) algorithms for diversity, co-channel interference (CCI) and intersymbol interference (ISI) mitigation, array gain and space-time coding. It operates in both uplink and downlink modes and uses a hybrid (combining a real and simulated) channel environment. A description of transmit and receive schemes implemented on the testbed is presented.
Weighted sharing of a small function by a meromorphic function and its derivative
Authors: Abhijit Banerjee
Venue: Computers Mathematics with Applications (2007)

The paper deals with the problem of meromorphic functions sharing a small function with its derivative and improves the results of Yu [K.W. Yu, On entire and meromorphic functions that share small functions with their derivatives, J. Inequal. Pure Appl. Math. 4 (1) (2003) Art. 21 (Online: http://jipam.vu.edu.au/)], Lahiri-Sarkar [I. Lahiri, A. Sarkar, Uniqueness of meromorphic function and its derivative, J. Inequal. Pure Appl. Math. 5 (1) (2004) Art. 20 (Online: http://jipam.vu.edu.au/)] and a recent result of Zhang [Q.C. Zhang, Meromorphic function that shares one small function with its derivative, J. Inequal. Pure Appl. Math. 6 (4) (2005) Art. 116 (Online: http://jipam.vu.edu.au/)].
A new normalized relatively stable lattice structure
Authors: C. Schwarz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper proposes a new lattice filter structure that has the following properties. When the filter is linear time invariant (LTI), it is equivalent to the celebrated Gray-Markel lattice. When the lattice parameters vary with time it sustains arbitrary rate of time variations without sacrificing a prescribed degree of stability, provided that the lattice coefficients are magnitude bounded in a region where all LTI lattices have the same degree of stability. We also show that the resulting linear time varying (LTV) lattice obeys an energy contraction condition. This structure thus generalizes the normalized Gray-Markel lattice which has similar properties but only with respect to stability as opposed to relative stability.
An adaptive blind signal separation based on the joint optimization of Givens rotations
Authors: N. Bienati
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Blind signal separation (BSS) is a recurrent problem in many multi-sensors applications where observations can be modelled as mixtures of N statistical independent source signals. We propose the estimation of the orthonormal transformation matrix Q in the case of whitened observations and a cost function based on the fourth-order moments. Q is described as combination of elementary Givens rotations and the optimization is carried out jointly for all the rotations. When sub-sets of angles are optimized separately the method reduces to the deflation approach which has been proved to be globally convergent. The joint estimation of Givens rotation matrices has a computational complexity O(7N/sup 2/) and, compared to other adaptive BSS, simulations demonstrate that it converges faster and achieves a better crosstalk attenuation.
Authentication without Identification
Authors: Anna Lysyanskaya
Venue: IEEE Security and Privacy (2007)

Many authentication transactions performed today require us to disclose more information than is strictly needed, just for verification purposes. Fortunately, modern cryptography provides us with a way to solve the verification problem without leaking unnecessary personal information. These techniques are fast, secure, and preserve privacy, so let's use them!
WSDLite: a lightweight alternative to windows sockets direct path
Authors: Evan Speight, Hazim Shafi, John K. Bennett
Venue: Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4 (2000)

This paper describes WSDLite, a thin software layer that maps a useful subset of the WinSock2 API onto a system area network. The development of WSDLite was motivated by our experience with an early version of Windows Sockets Direct Path (WSDP). WSDP was developed by Microsoft to allow unmodified network applications to exploit the performance and reliability advantages of System Area Networks (SANs). This is accomplished through the use of a software "switch" that, when appropriate, redirects message traffic through the SAN provider protocol stack instead of the standard TCP/IP protocol stack. In addition to the performance advantages, the WSDP architecture offers several other benefits, including automatic support for legacy code, a single well-known API for supporting many different underlying SAN network protocols, and substantially simpler buffer management than that required by the native SAN API. The beta version of WSDP that we examined did not perform as well as expected, achieving only 26% of the native SAN throughput on the system studied. In an effort to determine whether or not this performance difference was intrinsic, we developed WSDLite, a simple alternative to WSDP. WSDLite is a user-level runtime library that implements a small but commonly used subset of the WinSock2 API. For those applications that do not require full WinSock2 functionality, WSDLite provides both the transparency of WSDP and much of the performance benefit of the underlying SAN architecture. In low-level network tests, WSDLite achieves an average of 70% of the native SAN performance. In this paper we describe the design of WSDLite, and present results comparing the performance of both parallel applications and low-level benchmarks using WSDLite, WSDP, TCP, and a native SAN programming library API as the network programming layer.
Nonlinear blind source separation by spline neural networks
Authors: M. Solazzi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

In this paper a new neural network model for blind demixing of nonlinear mixtures is proposed. We address the use of the adaptive spline neural network recently introduced for supervised and unsupervised neural networks. These networks are built using neurons with flexible B-spline activation functions and in order to separate signals from mixtures, a gradient-ascending algorithm which maximizes the outputs entropy is derived. In particular a suitable architecture composed by two layers of flexible nonlinear functions for the separation of nonlinear mixtures is proposed. Some experimental results that demonstrate the effectiveness of the proposed neural architecture are presented.
Canonical space-time processing in CDMA systems
Authors: E. N. Onggosanusi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We propose a canonical space-time receiver structure for wireless communications based on front-end processing with respect to a fixed basis that is independent of the true channel parameters. The basis is dictated by a canonical characterization of channel propagation dynamics in terms of discrete multipath delays, Doppler shifts, and directions of arrival that capture the essential degrees of freedom in the received signal. In addition to dramatically reducing the number of channel parameters to be estimated, performance analysis demonstrates that canonical space-time receivers can deliver optimal performance at substantially reduced complexity compared to existing designs.
Object lifetimes in java card
Authors: Marcus Oestreicher, Ksheerabdhi Krishna
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

Java Card promises the ease of programming in Java to the world of smart cards. Java's memory model however is resource intensive especially for smart card hardware. Hence, adapting Java's memory model to Java Card must retain the easy programming paradigm while enabling Java Card applications to maximize the use of smart card memory. To this end, the Java Card 2.1 Specification [3] advocates an ad hoc persistent memory model that foists an unnatural programming paradigm and an inherently limited API. In this paper we discuss memory model choices for Java Card in the context of persistent systems. We propose the concept of a transient and persistent environment for encapsulating the transient and persistent objects in Java Card applications. While offering a simple programming model, it allows efficient sharing of the memory resources among multiple applications and enables garbage collection for Java Card.
Blind channel identification for multirate CDMA systems
Authors: Hongbo Yan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In this paper, we propose a unified approach to blindly identify channels for multirate CDMA systems-both multiple code (MC) and variable processing gain (VPG) systems are considered. A time-domain subspace approach to blind channel estimation introduced in Torlak and Xu (1997) is generalized to the multi-rate case. Performance evaluation is conducted based on the normalized root mean square error (NRMSE) with an appropriate single-rate as a baseline for comparison.
A three-tier IDS via data mining approach
Authors: Tsong Song Hwang, Tsung-Ju Lee, Yuh-Jye Lee
Venue: Proceedings of the 3rd annual ACM workshop on Mining network data (2007)

We introduced a three-tier architecture of intrusion detection system which consists of a blacklist, a whitelist and a multi-class support vector machine classifier. The first tier is the blacklist that will filter out the known attacks from the traffic and the whitelist identifies the normal traffics. The rest traffics, the anomalies detected by the whitelist, were then be classified by a multi-class SVM classifier into four categories: PROBE, DoS, R2L and U2R. Many data mining and machine learning techniques were applied here. We design this three-tier IDS based on the KDD'99 benchmark dataset. Our system has 94.71% intrusion detection rate and 93.52% diagnosis rate. The averag cost for each connection is 0.1781. All of these results are better than those of KDD'99 winner's. Our three-tier architecture design also provides the flexibility for the practical usage. The network system administrator can add the new patterns into the blacklist and allows to do fine tuning of the whitelist according to the environment of their network system and security policy.
CoDNS: improving DNS performance and reliability via cooperative lookups
Authors: KyoungSoo Park, Vivek S. Pai, Larry Peterson, Zhe Wang
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

The Domain Name System (DNS) is a ubiquitous part of everyday computing, translating human-friendly machine names to numeric IP addresses. Most DNS research has focused on server-side infrastructure, with the assumption that the aggressive caching and redundancy on the client side are sufficient. However, through systematic monitoring, we find that client-side DNS failures are widespread and frequent, degrading DNS performance and reliability. We introduce CoDNS, a lightweight, cooperative DNS lookup service that can be independently and incrementally deployed to augment existing nameservers. It uses a locality and proximity-aware design to distribute DNS requests, and achieves low-latency, low-overhead name resolution, even in the presence of local DNS nameserver delay/failure. Using live traffic, we show that CoDNS reduces average lookup latency by 27-82%, greatly reduces slow lookups, and improves DNS availability by an additional '9'. We also show that a widely-deployed service using CoDNS gains increased capacity, higher reliability, and faster start times.
Supporting Social Awareness with 3D Collaborative Virtual Environments and Mobile Devices: VirasMobile
Authors: Ekaterina Prasolova-Forland, Monica Divitini, Anders Einar Lindas
Venue: Proceedings of the Second International Conference on Systems (2007)

Social awareness is essential for effective learning. 3D Collaborative Virtual Environments (CVEs) have been proposed as a tool for social awareness support in an educational context as the natural environments are often not sufficient for this purpose. User evaluations of the prototype that was developed to test the suitability of 3D CVEs in this context identified a number of problems in terms of supporting short-term social awareness. To overcome these shortages, we propose to supplement 3D CVEs with mobile devices. The paper presents a revised set of requirements for the augmented system, describes the corresponding design and outlines the technical implementation of a prototype.
Statistical analysis of a signal separation method based on second order statistics
Authors: T. Gustafsson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper explores an existing method for signal separation, which is based on second order statistics. Here, statistical analysis of a generalized version of the original algorithm is given. The generalized method includes a weighting matrix, and a result of the statistical analysis is that the best possible weighting is found. The problem of initialization of the involved non-linear optimization is also discussed.
VisiCon: a robot control interface for visualizing manipulation using a handheld projector
Authors: Kazuhiro Hosoi, Vinh Ninh Dao, Akihiro Mori, Masanori Sugimoto
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

The miniaturization of image projectors leads to the expectation that projectors could be embedded in mobile devices such as cellular phones and PDAs. A projector mounted on a mobile device, freely movable in 3D space under user control, could operate not only as an output device but also as an input device for enabling humans to manipulate mobile robots. We therefore explore the possibilities of human-robot interaction techniques using handheld projectors. For this purpose, we propose an innovative interface called VisiCon. We have also developed a cooperative game, CoGAME, in which players guide a simple robot using handheld projectors. In this game, users can connect projected maps together, and cooperatively lead a robot to a specified goal. In this paper, we explain the techniques used in CoGAME, and present an evaluation.
Clock compensation in a data/fax relay system
Authors: E. Daeipour
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In data/fax relay applications, one challenge is to overcome problems associated with having independent clocks in the system. Due to slight differences in the clock frequency of the relay system compared to the far modems (fax machines), the relay system is unable to transmit with the same rate that it receives data. Eventually, the system either starves for data or loses data due to under/over flow of its buffers. The clock difference problem in a demod/remod system and a method to compensate for it is addressed in this paper. The transmitter clock in each side of the relay system is tuned to match with the clock rate at the other side. This clock tuning is done via a closed loop feedback system. The bit error rate measurements show a significant improvement in the performance of the demod/remod system when the clock difference is compensated. 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
Statistical estimation with 1/f-type prior models: robustness to mismatch and efficient model determination
Authors: A. N. Venetsanopoulos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

One common problem in signal and image processing is the determination of a discrete representation of a signal given data corresponding to a noisy and blurred version of the unknown. We examine the performance degradation associated with the use of a two-parameter family of fractal-type statistical models in a linear least squares estimator (LLSE) when the model parameters do not match those of the actual process. These models are shown to perform well under various circumstances for estimating noisy and blurred 1/f type fractals and first order Gauss-Markov (FOGM) signals. In addition we demonstrate an effective means of bounding one of the model parameters as a function of the other so as to reduce the model to a single parameter.
Efficient structural optimization using reanalysis and sensitivity reanalysis
Authors: U. Kirsch, M. Bogomolni, I. Sheinman
Venue: Engineering with Computers (2007)

Optimization of large-scale structures using conventional formulations often involves much computational effort. Repeated solutions of the analysis and sensitivity analysis equations usually require most of this effort. The computational cost may become prohibitive in large-scale structures having complex analysis models. To alleviate this difficulty, various procedures are integrated in this study into a general optimization approach. The approach is suitable for different classes of response types and optimization methods, including linear and non-linear response; static and dynamic response; direct and gradient optimization methods. Combined approximations are used for reanalysis and repeated sensitivity analysis. The advantage is that the efficiency of local approximations and the improved quality of global approximations are combined to obtain effective solution procedures. Approximate reanalysis and finite-difference sensitivity reanalysis are considered for each intermediate design during the solution process. Reductions in the computational effort may reach several orders of magnitude. Typical numerical examples show that the results achieved by the approach presented are similar to those obtained by exact reanalysis and sensitivity analysis.
The GridX1 computational Grid: from a set of service-specific protocols to a service-oriented approach
Authors: Gabriel Mateescu, Wayne Podaima, Andre Charbonneau, Roger Impey, Meera Viswanathan, Ashok Agarwal, Patrick Armstrong, Ron Desmarais, Ian Gable, Sergey Popov, Simon Ramage, Randall Sobie, Daniel C. Vanderster, Darcy Quesnel
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

GridX1 is a computational Grid designed and built to link resources at a number of research institutions across Canada. Building upon the experience of designing, deploying and operating the first generation of GridX1, we have designed a second-generation, web-services-based, computational Grid. The second generation of GridX1 leverages the Web Services Resource Framework, implemented by the Globus Toolkit version 4. The value added by GridX1 includes metascheduling, file staging, resource registry and resource monitoring.
Order-Optimal Preconditioners for Implicit Runge-Kutta Schemes Applied to Parabolic PDEs
Authors: K.-A. Mardal, T. K. Nilssen, G. A. Staff
Venue: SIAM Journal on Scientific Computing (2007)

In this paper we show that standard preconditioners for parabolic PDEs discretized by implicit Euler or Crank-Nicolson schemes can be reused for higher-order fully implicit Runge-Kutta time discretization schemes. We prove that the suggested block diagonal preconditioners are order-optimal for A-stable and irreducible Runge-Kutta schemes with invertible coefficient matrices. The theoretical investigations are confirmed by numerical experiments.