ppxscal/embedding_network huggingface dataset:
Spatio-temporal correlated noise in multi-output neural networks
Authors: S. Hosseini
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

In this paper, supposing a Gaussian noise model, we study the problem of multi-output nonlinear regression using multilayer perceptrons (MLP) when the noise in each output is a correlated autoregressive time series and there is a spatial correlation between different output noise sources. We show that using a maximum likelihood approach, the noise parameters can be determined simultaneously with the network weights and used to improve the network generalization performance. For two special cases of first and second order AR noise, the appropriate cost functions to minimize them are derived.
X-Online: An Online Interface for Digital Decryption Tools
Authors: Sudhir Aggarwal, Daniel Beech, Rajarshi Das, Breno de Medeiros, Eric Thompson
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

In this paper, we describe X-Online, a Web application designed to interface with a password-recovery and/or decryption tool such as AccessData's Distributed Network Attack (DNA^{TM}) tool. X-Online allows for submission of documents in a highly secure and reliable manner for digital forensic processing. The output of the digital forensic tool interfaced with X-online is displayed back to the user. We anticipate that web service-based applications such as X-Online will be increasingly important as e-Forensic tools. In this paper, we give an overview of the need for such systems, describe our system's design, and discuss the key security and reliability aspects associated with the system. XOnline is based on two different Operating System platforms (Linux and Windows), and uses a secure webserver as well as additional authentication protocols for security. File sharing supports interfacing to the widely used DNA Digital Decryption tool, and protecting this service was accordingly a major component of our overall security design. We also discuss the features that we plan to support in the future, and our designs to use it in connection with a broader forensic research initiative.
Estimation and equalization of fading channels with random coefficients
Authors: M. K. Tsatsanis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The time-varying tap coefficients of frequency selective fading channels are typically modeled as random processes with low-pass power spectra. However, traditional adaptive techniques usually make no assumption on the channel's time variations and hence do not exploit this information. Kalman filtering methods are derived to track the channel by employing a multichannel autoregressive description of the time-varying taps in a decision-feedback equalization framework. Fitting a model to the variations of the channel's taps is a challenging task because the tap coefficients are not observed directly. A novel linear method is proposed in order to estimate the model parameters from input/output data. The consistency of the proposed method is shown, and some illustrative simulations are presented.
Low Runtime-Overhead Software Synthesis for Communicating Concurrent Processes
Authors: Youngchul Cho, Nacer-Eddine Zergainoh, Kiyoung Choi, Ahmed A. Jerraya
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

Modeling a system with communicating concurrent processes is an effective way of exposing parallelism inherent in the application. When multiple processes are mapped to a processor, however, we have to serialize the execution of the processes. Such serialization usually requires scheduling that may introduce significant runtime overheads due to context switching. In this work, we propose techniques to synthesize software with low runtime overhead from the set of processes running on a processor. Particularly, we convert concurrent processes into a sequential C++ program with process scheduling implemented in the program and replace operating system's communication API by user-level communication API. Since there is no code explosion in our approach, it is applicable to big applications and we show it through experiments with a real-world example.
Maximizing beowulf performance
Authors: Robert G. Brown
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

At this point in time the beowulf (and other related compute cluster) architectures has come of age in Linux. Few indeed are those in any realm of technical computing that are unaware of the fact that one can assemble a collection of commodity off the shelf (COTS) computers and networking hardware into a high performance supercomputing environment. However, a detailed knowledge or appreciation for the bottlenecks and special problems associated with beowulf design is not so common. A review of the important bottlenecks and design features of a beowulf is given along with associated benchmarking and measurement tools to illustrate how to bridge the gap between the simple "recipe" of a beowulf as a pile of compute nodes, interconnected with a fast network and running linux and the realities of engineering a parallel code and beowulf-style cluster to achieve satisfactory performance.
Simula 2000: an Internet based working environment for the support of educational applications in the field of electronics
Authors: J. J. Zamora
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

The use of computers in electronics education has suffered an impressive evolution during the years. Following that evolution, a series of applications has been developed to make communication electronics easier to learn for students of the University of the Basque Country. The last version of this applications, Simula 2000, allows remote operation through the use of a web-based interface and a server running under Linux in the University building (accessible from the outside through the Internet connection of the University). Its main features are on-line tests, circuit explanations and, one of the main important differences with respect to similar applications, real-time simulation. It uses a copy of Spice to simulate the different circuits (stages) that students design with the help of a series of libraries included with the application. It also allows these stages to be connected to create bigger and more complex circuits (projects) that can also be simulated. All this makes Simula 2000 become one of the most advanced learning tools that can nowadays be found at the University of the Basque Country.
Computer Anxiety: "Trait" or "State"?
Authors: John J. Beckers, Jelte M. Wicherts, Henk G. Schmidt
Venue: Computers in Human Behavior (2007)

A recurring question in the study of computer anxiety is whether computer anxiety is a relatively stable personality trait or a mutable, temporary state. The two studies reported examined this question in two groups of first year psychology students. These students were requested to complete a computer anxiety test, a trait anxiety test, and a state anxiety test. Some groups were administered the tests in a pen and paper format, while others were tested using computerized tests. In the first study, a Dutch version of the Profile of Mood States (POMS) was used; in the second study, a Dutch adaptation of the State-Trait Anxiety Inventory (STAI). The data were analyzed using structural equation modeling. In both studies, computer anxiety turned out to be related more strongly to trait anxiety than to state anxiety. In fact, there was no relationship between computer anxiety and state anxiety in the pen and paper format. In the computerized versions however, computer anxiety and state anxiety were related, suggesting that state anxiety in situations involving a computer is caused by pre-existing computer anxiety.
A new approach to the temporal evolution of a family of curves
Authors: V. P. Baradad
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

In this study the problem of modeling a family of curves is addressed. The need of such modeling appears frequently in many aspects of image processing where many linear structures keep spatial relationships during their evolution. We present a modeling tool well suited to the spatial modeling of a family of curves, and which can be very useful for motion tracking and curve evolution as well. The family of curves is represented as the line paths (orbits) of a "spline vector field", i.e. a vector field interpolating data using a framework similar to the theory of spline curves. The model is exemplified with oceanic satellite data. Its usefulness for curve evolution modeling is also presented.
Multiple description channel-optimized trellis-coded quantization
Authors: T.-T. Lam
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper presents the design of multiple description trellis-coded quantizers that are optimized for transmitting data over multiple noisy channels. A multiple description channel-optimized trellis-coded quantization (MDCOTCQ) scheme is developed whereby all trellis-coded quantizers (side and central) are designed to operate over the binary symmetric channel with a given bit error rate (BER). Using the tensor product of trellises, an expression of the multi-channel transition probability matrix is derived. This formulation enables the construction of multiple description channel-optimized trellis-coded quantizers for arbitrary bit rates and arbitrary channel bit error rates. The proposed MDCOTCQ system enables the transmission of compressed data over noisy diversity or packet-based communication systems, and enables outstanding robustness to channel or packet loss. Examples are presented to illustrate the performance of the proposed MDCOTCQ-based source coder.
Speaker-dependent name dialing in a car environment with out-of-vocabulary rejection
Authors: C. S. Ramalingam
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We describe a system for name dialing in the car and present results under three driving conditions using real-life data. The names are enrolled in the parked car condition (engine off) and we describe two approaches for endpointing them-energy-based and recognition-based schemes-which result in word-based and phone-based models, respectively. We outline a simple algorithm to reject out-of-vocabulary names. PMC is used for noise compensation. When tested on an internally collected twenty-speaker database, for a list size of 50 and a hand-held microphone, the performance averaged over all driving conditions and speakers was 98%/92% (IV accuracy/OOV rejection); for the hands-free data, it was 98%180%.
The Return of Silicon Efficiency
Authors: Simon Knowles
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

The economic and physical forces which have always shaped the business of digital chip design are again evolving to change the priorities of designers. Key physical trends include the end of gate oxide thickness scaling, and the effect of small dopant populations on threshold voltage variance. Key economic trends include the need to tolerate specification shift and design error, and the need to amortise chip development cost over multiple market sockets.
Support for Computer Forensics Examination Planning with Domain Modeling: A Report of One Experiment Trial
Authors: Alfred C. Bogen, David A. Dampier, Jeffrey C. Carver
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In any forensic investigation, planning and analysis activities are required in order to determine what digital media will be seized, what types of information will be sought in the examination, and how the examination will be conducted. Existing literature and suggested practices indicate that such planning should occur, but few tools provide support for such activities. Planning an examination may be an essential activity when investigators and technicians are faced with unfamiliar case types or unusually complex, large-scale cases. This paper presents the results of an empirical study that evaluates two planning methods for computer forensics examination: a methodology that includes domain modeling and a more typical, ad hoc planning approach. This paper briefly describes the case domain modeling and planning methodology, describes the empirical study, and presents preliminary results of and conclusions drawn from the empirical study.
Cutting apron strings
Authors: Owen Astrachan
Venue: ACM SIGCSE Bulletin (2007)

Moore's law tells us there has been more than a thousand-fold increase in computing power in the last twenty years. Most of us likely search our library and (without too much exaggeration) the world while we sit in a chair and type. The Human Genome Project and the Sloan Digital Sky Survey are using the fruits of computer science to map the genome and the universe. The open source development model has transformed software development, commerce, and science. Many of us argue the merits of emacs compared to v1, why objects-first has failed, and whether induction should precede recursion. Something is wrong with this picture.
Preconditioned Iterative Solvers for Inductance Extraction of VLSI Circuits
Authors: Hemant Mahawar, Vivek Sarin
Venue: SIAM Journal on Scientific Computing (2007)

Parasitic extraction techniques are used to estimate signal delay in VLSI circuits. Inductance extraction is a critical component of the parasitic extraction process that involves estimation of on-chip inductive effects with high accuracy. The problem requires the solution of a large, dense, complex linear system of equations, where the unknown current must satisfy the constraint imposed by Kirchoff&rsquo;s current law. In this paper, we describe a solenoidal basis method to transform the constrained linear system into an unconstrained one. The method uses discrete local solenoidal flows to represent the unknown current, and to obtain a reduced linear system. The paper proposes preconditioning techniques that do not require explicit construction of the reduced system. Numerical experiments are presented to illustrate the effectiveness of the preconditioning approach. Comparisons with a well-known inductance extraction package are provided to highlight the advantages of the proposed scheme.
[incr Widgets] an object oriented mega-widget set
Authors: Mark L. Ulferts
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

The introduction of [incr Tcl] and [incr Tk] allows an object oriented approach to Tk widget construction. "Megawidgets" developed in these extensions seamlessly expand the Tk base widget set. Each of these object-oriented widgets may themselves be extended, using either inheritance or composition. This paper presents one such general purpose hierarchy called [incr Widgets] which maintains the Motif look-and-feel and establishes several new concepts, including extensible child sites and flexible large scale component configuration.
Data block adaptive filtering algorithms for α-stable random processes
Authors: Zhijin Zhao, Kehai Dong, Chunyun Xu
Venue: Digital Signal Processing (2007)

The least mean p-norm (LMP) algorithm is an effective algorithm for processing the signal of @a-stable distribution. This paper proposes data block adaptive filtering algorithms for the @a-stable random processes based on the fractional lower order statistics (FLOS). The data block algorithms change the direction of coefficient increment vector by introducing a matrix which includes the information of more past input signal vectors than which are used in the LMP algorithm during the iteration process, taking full advantage of the past values of the gradient vector during the adaptation. Simulations studies indicate that the proposed algorithms increase convergence rate in non-Gaussian stable distribution noise environments compared to the existing algorithms based on FLOS summarized in this paper.
On the Minimization fo the Instantaneous Temperature for Periodic Real-Time Tasks
Authors: Jian-Jia Chen, Chia-Mei Hung, Tei-Wei Kuo
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

While there is a tradeoff between the energy consumption and the satisfaction of task deadlines, the management of the processor temperature is of paramount important to the survival of the processor and the reduction of packing cost. This paper explores the scheduling of periodic real-time tasks with temperature-aware considerations in a uniprocessor or homogeneous multi-processor environment. By modeling the cooling process approximately according to Fourier's Law, a 2.719-approximation algorithm is shown for the minimization of the maximum temperature for processors with continuous processor speeds. When the processor is with discrete speeds only, we extend the 2.719- approximation algorithm to manage the voltage/speed transition so that the maximum temperature can be minimized. For homogeneous multiprocessor systems, we show that the largest-taskfirst strategy has a 3.072-approximation bound in the minimization of the maximum temperature when all of the processors are on a chip. When each processor is on a chip, the approximation bound in the minimization of the maximum temperature is 6.444. When jobs might complete earlier than their worst-case estimation, dynamic scheduling is further explored to reduce the maximum temperature.
Understanding Context through a Comprehensive Prototyping Experience: A Testbed Research Strategy for Emerging Technologies
Authors: J. Ramon Gil-Garcia, Theresa A. Pardo, Andrea Baker
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Information and Communication Technologies (ICTs) are rapidly changing and new technologies, processes, and skills are constantly emerging. An important challenge for the research community is to gain knowledge about these emergent technologies in specific contexts, sometimes before they are actually implemented. This paper draws on our experience in the use of comprehensive prototyping as a methodology for building understanding of emerging technologies in new contexts1. A Testbed research strategy combines various prototyping, business analysis, team work, and training techniques to understand the specific characteristics of a technology and the context in which it is going to be embedded. The paper presents three cases of Testbed research approaches developed within a 10 year period and presents some insights based on those experiences to inform the efforts of both practitioners and researchers.
The computing educators oral history project: planning for the future
Authors: Barbara Boucher Owens, Vicki L. Almstrum, Lecia J. Barker
Venue: ACM SIGCSE Bulletin (2007)

This poster will showcase the planning stage of a project to develop a searchable repository of artifacts relating to the personal histories of computing educators. Artifacts will include digital audio interviews, interview transcripts, photographs, vitas, and other relevant items. Individuals included in the collection will be balanced across factors such as gender, geographic location, age, race/ethnicity, and institutional size. A key use of the project will be to support, recruit, and retain under-represented groups.
Interface grammars for modular software model checking
Authors: Graham Hughes, Tevfik Bultan
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified as context free grammars. An interface grammar for a component specifies the sequences of method invocations that are allowed by that component. Using interface grammars one can specify nested call sequences that cannot be specified using interface specification formalisms that rely on finite state machines. Moreover, our interface grammars allow specification of semantic predicates and actions, which are Java code segments that can be used to express additional interface constraints. We have built an interface compiler that takes the interface grammar for a component as input and generates a stub for that component. The resulting stub is a table-driven parser generated from the input interface grammar. Invocation of a method within the component becomes the lookahead symbol for the stub/parser. The stub/parser uses a parser stack, the lookahead, and a parse table to guide the parsing. The semantic predicates and semantic actions that appear in the right hand sides of the production rules are executed when they appear at the top of the stack. We conducted a case study by writing an interface grammar for the Enterprise JavaBeans (EJB) persistence interface. Using our interface compiler we automatically generated an EJB stub using the EJB interface grammar. We used the JPF model checker to check EJB clients using this automatically generated EJB stub. Our results show that EJB clients can be verified efficiently using our approach.
Theoretical analysis of subband adaptive array combining cyclic prefix data transmission scheme
Authors: X. N. Tran, T. Taniguchi, Y. Karasawa
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper presents a theoretical analysis of subband adaptive array combining the cyclic prefix transmission scheme (SBAA-CP) in a multipath fading environment. The exact expressions for optimal weights, array outputs and the output signal to interference plus noise ratio (SINR) are derived. The analysis shows that use of the cyclic prefix data transmission scheme can significantly improve the performance of subband adaptive array (SBAA). We also show that if the output SINR is plotted versus the delay of the delay path then the output SINR of SBAA-CP is in effect the SINR of SBAA shifted by C samples to the right.
Blended Learning Technology in Information Security Management Courses
Authors: Gerald Quirchmayr
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In this paper the author describes the approaches to blending learning he has pursued at the University of Vienna's Institute of Distributed and Multimedia Systems and at the University of South Australia's School of Computer and Information Science in an attempt to supply online students and on campus students with enhanced teaching and learning materials in an Information Security Management course.
Application of Bayesian Networks to Architectural Optimisation
Authors: Artem Parakhine, Tim O'Neill, John Leaney
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

The field of optimisation covers a great multitude of principles, methods and frameworks aimed at maximisation of an objective under constraints. However, the classical optimisation can not be easily applied in the context of computer-based systems architecture as there is not enough knowledge concerning the dependencies between non-functional qualities of the system. Out approach is based on the simulation optimisation methodology where the system simulation is first created to assess the current state of the design with respect to the objectives. The results of the simulation are used to construct a Bayesian Belief Network which effectively becomes a base for an objective function and serves as the main source of the decision support pertaining to the guidance of the optimisation process. The potential effects of each proposed change or combination of changes is then examined by updating and re-evaluating the system simulation.