ppxscal/embedding_network huggingface dataset:
Time-Sensitive Control-Flow Checking for Multitask Operating System-Based SoCs
Authors: Fabian Vargas, Leonardo Piccoli, Juliano Benfica, Antonio A. de Alecrim Jr., Marlon Moraes
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

This paper presents a new approach based on a watchdog infrastructure intellectual property (I-IP) core to detect control-flow faults that affect CPU execution time. More precisely, this approach aims at detecting those faults that change the expected CPU instruction sequence and that as consequence, change also (by increasing or reducing) the expected CPU time allocated for the execution of the monitored task. The underlined advantage of this approach is the ability of detecting faults in systems-on-chips (SoCs) simultaneously running multiple tasks under the control of a real-time (preemptive) operating system (OS). In this multi-task scenario, the I-IP performs fault detection in a time-shared basis. Practical experiments based on the IEC 62.132-2 Std. for IC electromagnetic immunity measurement have been carried out and the obtained results are discussed.
Modeling the distribution of DCT coefficients for JPEG reconstruction
Authors: R. Krupiński, J. Purczyński
Venue: Image Communication (2007)

In the paper, the one moment (OM) method for the estimation of the shape parameter of generalized Gaussian distribution (GGD) is derived from the two moments method in the case when the moments converge in the limits to the same value. The one moment method reduces to the maximum likelihood (ML) method in the special case when the moment equals the shape parameter. The proposed method exhibits smaller complexity of calculations over ML keeping the same error. Assuming Laplacian distribution, there exists a method for optimally biasing the reconstruction levels for the quantized AC discrete cosine transform (DCT) coefficients using only the quantized ones available at the JPEG decoder [J.R. Price, M. Rabbani, Biased reconstruction for JPEG decoding, IEEE Signal Process. Lett. 6 (12) (1999) 297-299; R. Krupinski, J. Purczynski, First absolute moment and variance estimators used in JPEG reconstruction, IEEE Signal Process. Lett. 11 (8) (2004) 674-677]. Many researchers stated that the subset of images can be modeled with GGD with the shape parameter lower than 1. By assuming a source signal with GGD with the exponent 0.5, equations in a closed form for the centroid reconstruction can be obtained as it cannot be done for a GGD model. The ML method of discrete GGD 0.5 is derived, which requires the estimation of only one parameter. For selected images, the values of PSNR coefficients are compared for both distributions.
High Rate Wave-pipelined Asynchronous On-chip Bit-serial Data Link
Authors: Rostislav Reuven Dobkin, Yevgeny Perelman, Tuvia Liran, Ran Ginosar, Avinoam Kolodny
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

A high data rate asynchronous bit-serial link for long-range on-chip communication is presented. The data bit cycle time is equal to a single gate delay, enabling 67Gbps throughput in 65nm technology. The serial link incurs lower power and area costs relative to bit-parallel communications, and enables higher tolerance to PVT variations relative to synchronous links. The link uses differential dual-rail level encoding (LEDR) and current mode signaling over a lowcrosstalk interconnect layout. Novel circuits used in the link are described, including a novel splitter shift register, a fast LEDR encoder, a high-speed toggle element, a channel driver with adaptive control and a differential channel receiver.
Automatic compact disc transfer for quality assurance testing
Authors: R. P. Ramachandran
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

The purpose of this project was to design, build and test a low cost prototype that transfers compact discs (CDs) from a spindle to a computer based testing station. This will speed up the CD production/testing interface and eliminate the need for manual operation. Along with a heavy product design technical component, the project included a real life educational experience for the four students who got credit for a one year advanced senior project. Various designs were considered and the optimal design (based on cost and performance) was prototyped.
Identification of tumor region parameters using evolutionary algorithm and multiple reciprocity boundary element method
Authors: M. Paruch, E. Majchrzak
Venue: Engineering Applications of Artificial Intelligence (2007)

In the paper the inverse problems consisting in the simultaneous estimation of unknown thermophysical and/or geometrical parameters (thermal conductivity, perfusion coefficient, metabolic heat source, location, size) of the tumor region are solved. The additional information concerning the knowledge of local skin surface temperature at the selected set of points is assumed to be known. The problem of thermal processes proceeding in the domain considered is described by the system of the Pennes equations and boundary conditions given on the outer and contact surfaces. On the stage of numerical solution the evolutionary algorithm coupled with the multiple reciprocity boundary element method has been applied.
Analysis and synthesis of the distribution of consonants over languages: a complex network approach
Authors: Monojit Choudhury, Animesh Mukherjee, Anupam Basu, Niloy Ganguly
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Cross-linguistic similarities are reflected by the speech sound systems of languages all over the world. In this work we try to model such similarities observed in the consonant inventories, through a complex bipartite network. We present a systematic study of some of the appealing features of these inventories with the help of the bipartite network. An important observation is that the occurrence of consonants follows a two regime power law distribution. We find that the consonant inventory size distribution together with the principle of preferential attachment are the main reasons behind the emergence of such a two regime behavior. In order to further support our explanation we present a synthesis model for this network based on the general theory of preferential attachment.
Service combinators for web computing
Authors: Luca Cardelli, Rowan Davies
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

The World-Wide Web is rich in content and services, but access to these resources must be obtained mostly through manual browsers. We would like to be able to write programs that reproduce human browsing behavior, including reactions to slow transmission-rates and failures on many simultaneous links. We thus introduce a concurrent model that directly incorporates the notions of failure and rate of communication, and then describe programming constructs based on this model.
Predicting protein secondary structure based on Bayesian classification procedures on Markovian chains
Authors: I. V. Sergienko, B. A. Beletskii, S. V. Vasil'Ev, A. M. Gupal
Venue: Cybernetics and Systems Analysis (2007)

The paper discusses numerical results of predicting protein secondary structure using Bayesian classification procedures based on nonstationary Markovian chains. A new approach is used, based on the classification of pairs of states for pairs of neighboring amino acids. It improves the prediction accuracy as compared with that of the classification of the state of one amino acid.
Relational Temporal Machines
Authors: Nicole Bidoit, Francois Hantry
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

The paper introduces and investigates relational temporal machine (RTM) as a general abstract model for generic temporal querying. The RTM devices subsume most temporal query languages that have emerged in the literature. A first contribution of the paper is to provide two simplified forms for our machines, namely extended onetape RTMs and one-tape RTMs. Another contribution is to establish connections between RTMs and the T-WHILE and TS-WHILE extensions of FO based on complexity criteria.
Scaling Down SOA to Small Businesses
Authors: Enrique Castro-Leon, Jackson He, Mark Chang
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

The adoption of SOA in business computing environments is growing due to the promise of significant cost reduction in the planning, deployment and operation of IT projects. However, the organic transformation from legacy enterprise applications to SOA applications has occurred mostly in large enterprises. Small businesses have largely been left out of the SOA transformation. For small businesses and organizations, SOA is a mysterious technology little related with their business. This paper proposes a new way of scaling SOA services dubbed "outsidein" SOA that makes it possible for small business to enjoy the benefit of service orientation and service mashups to best fit their business needs. This "outsidein" SOA approach could unleash a SOA tsunami that will lead to the adoption of business-oriented Web services in a way similar to the adoption of the Web 2.0 that took place in the consumer market. This paper also demonstrates a few use cases how such a service delivery model could benefit small businesses and discusses the technical and social challenges of the adoption of this approach.
TOCTTOU vulnerabilities in UNIX-style file systems: an anatomical study
Authors: Jinpeng Wei, Calton Pu
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

Due to their non-deterministic nature, Time of Check To Time of Use (TOCTTOU) vulnerabilities in Unix-style file systems (e.g., Linux) are difficult to find and prevent. We describe a comprehensive model of TOCTTOU vulnerabilities, enumerating 224 file system call pairs that may lead to successful TOCTTOU attacks. Based on this model, we built kernel monitoring tools that confirmed known vulnerabilities and discovered new ones (in often-used system utilities such as rpm, vi, and emacs). We evaluated the probability of successfully exploiting these newly discovered vulnerabilities and analyzed in detail the system events during such attacks. Our performance evaluation shows that the dynamic monitoring of system calls introduces non-negligible overhead in microbenchmark of those file system calls, but their impact on application benchmarks such as Andrew and PostMark is only a few percent.
2007 Special Issue: Reducing uncertainties in neural network Jacobians and improving accuracy of neural network emulations with NN ensemble approaches
Authors: Vladimir M. Krasnopolsky
Venue: Neural Networks (2007)

A new application of the NN ensemble technique to improve the accuracy (reduce uncertainty) of NN emulation Jacobians is presented. It is shown that the introduced ensemble technique can be successfully applied to significantly reduce uncertainties in NN emulation Jacobians and to reach the accuracy of NN Jacobian calculations that is sufficient for the use in data assimilation systems. An NN ensemble approach is also applied to improve the accuracy of NN emulations themselves. Two ensembles linear (or conservative) and nonlinear (uses an additional averaging NN to calculate the ensemble average) were introduced and compared. The ensemble approaches: (a) significantly reduce the systematic and random error in NN emulation Jacobian, (b) significantly reduce the magnitudes of the extreme outliers and, (c) in general, significantly reduce the number of larger errors. It is also shown that the nonlinear ensemble is able to account for nonlinear correlations between ensemble members and to improve significantly the accuracy of the NN emulation as compared to the linear conservative ensemble in terms of systematic (bias), random, and larger errors.
The Hadwiger Number of Jordan Regions Is Unbounded
Authors: Otfried Cheong, Mira Lee
Venue: Discrete Computational Geometry (2007)

We show that for every n > 0 there is a planar topological disk A0 and n translates A1, A2, ..., An of A0 such that the interiors of A0, ..., An are pairwise disjoint, but with each Ai touching A0 for 1 &#x2264; i &#x2264; n.
Nonlinear Response of Strongly Correlated Materials to Large Electric Fields
Authors: J. K. Freericks, V. Turkowski, V. Zlatic
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Strongly correlated electron materials are materials where the electron-electron interaction is so strong it is of primary importance in determining how the materials behave. These materials may be tuned to pass through a metal-insulator transition as a function of chemical doping, pressure, or temperature. This tunability of their properties makes them good candidates for so-called "smart materials" that may change their properties to respond to the particular needs of a device. We employ a massively parallel algorithm to solve exactly for the response of these strongly correlated materials to the presence of a large electric field, including all nonlinear and non-equilibrium effects. The work was performed as a CAP Phase II project on the ERDC XT3 computer in the Winter of 2006. The code displayed good scalability up to approximately 3000 processors although most production runs employed about 1500 processors, because of machine load.
Undergraduate electromagnetics: a new paradigm
Authors: D. R. Voltmer
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The traditional use of differential and integral vector calculus as the basis for undergraduate electromagnetic courses is reconsidered. A compelling case is made for improved student understanding by basing introductory electromagnetics on two mutually supporting principles-spatial discretization and numeric formulation. Dividing space into discrete cells facilitates casting the laws of electromagnetics in terms of lumped element circuit theory. The vector nature of fields evolves naturally from the behavior of these discrete circuit elements. Numeric formulations for discretized space similar to those used by electromagnetic professionals take the form of remarkably simple models and algorithms. Powerful computer engines and graphics operate on these formulations to solve "real world" applications and bring the physical concepts to life. This "work in progress" is presented to stimulate audience comments and discussion.
Use of Personal Digital Assistants (PDAs) in Medical Education
Authors: Rattiporn Luanrattana, Khin Than Win, John Fulcher
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

A systematic review of how the personal digital assistants (PDAs) have been used in healthcare professions and medical education has been conducted in order to identify current usage of PDAs in both areas. The major aim of this research is to study the feasibility of incorporating PDAs into problem-based learning (PBL) medical education. A systematic review was conducted by exploring various databases on the use of PDAs in two major areas: the healthcare professions and medical education during the period 2000-2006. Results: The needs, patterns and functionalities of using PDAs in the medical profession have been identified and categorized into different areas. What remains is to how to best incorporate PDAs into a PBL approach to medical education at the University of Wollongong.
State-space based approximation methods for the harmonic retrieval problem in the presence of known signal poles
Authors: Hua Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In parameter estimation of closely-spaced sinusoids, prior knowledge of some known signal poles can be incorporated as done in the LCTLS-LP algorithm proposed by Dowling et al. (1992, 1994) and based on forward linear prediction and total least squares. In this paper, two better algorithms, HTLS-PK and HTLN-PK, derived respectively from Kung et al.'s (1983) state-space method using the TLS principle and the newly developed structured total least norm technique are presented that incorporate the same prior knowledge but clearly outperform the LCTLS-LP method in both resolution and parameter accuracy.
3wish: distributed [incr Tcl] extensions for physical-world interfaces
Authors: Brygg Ullmer
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

The creation of physical-world interfaces seamlessly integrated with the physical environment poses new implementation and interface challenges for the Tcl language. 3wish is a suite of [incr Tcl] class libraries and C/C++ extensions which supports user interfaces integrating distributed physical sensors, displays, and 3D graphics. The poster presents an overview of 3wish, its application to physical-world interfaces, and its implementation of distributed sensors, displays, object proxies, and platform-independent 3D graphics.
The Effect of Bursty Lengths on DQDB Networks
Authors: R. N. Chiou, J. K. Guo
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

The distributed queue dual bus network is a LAN/MAN protocol proposed by the IEEE 802.6 committee. It can integrate isochronous and nonisochronous services. Due to its medium access control protocol, the network has the unfairness of access for bursty traffic. This paper explores the effect of bursty lengths on the unfairness. In the simulations of the paper, the average delays of distributed and local queues of nodes are calculated for exhibiting the variation of unfairness corresponding to the alteration in the number of cells of bursty messages. The simulation shows that the unfairness is obviously affected by bursty lengths. As the number of cells increases, the unfairness of the delay of distributed queues will be more moderate. But the unfairness of the delay of local queues will become more severe. On the other hand, the throughput of the network is irrelevant to the bursty length.
Bayesian network learning algorithms using structural restrictions
Authors: Luis M. de Campos, Javier G. Castellano
Venue: International Journal of Approximate Reasoning (2007)

The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domain, in such a way that a Bayesian network representing this domain should satisfy them. The main goal of this paper is to study whether the algorithms for automatically learning the structure of a Bayesian network from data can obtain better results by using this prior knowledge. Three types of restrictions are formally defined: existence of arcs and/or edges, absence of arcs and/or edges, and ordering restrictions. We analyze the possible interactions between these types of restrictions and also how the restrictions can be managed within Bayesian network learning algorithms based on both the score+search and conditional independence paradigms. Then we particularize our study to two classical learning algorithms: a local search algorithm guided by a scoring function, with the operators of arc addition, arc removal and arc reversal, and the PC algorithm. We also carry out experiments using these two algorithms on several data sets.
A new algorithm for computing sparse solutions to linear inverse problems
Authors: G. Harikumar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We present an iterative algorithm for computing sparse solutions (or sparse approximate solutions) to linear inverse problems. The algorithm is intended to supplement the existing arsenal of techniques. It is shown to converge to the local minima of a function of the form used for picking out sparse solutions, and its connection with existing techniques explained. Finally, it is demonstrated on subset selection and deconvolution examples. The fact that the proposed algorithm is sometimes successful when existing greedy algorithms fail is also demonstrated.
A new family of EVD tracking algorithms using Givens rotations
Authors: B. Champagne
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this work, we derive new algorithms for tracking the eigenvalue decomposition (EVD) of a time-varying data covariance matrix. These algorithms have parallel structures, low operation counts and good convergence behavior. Their main feature is the use of Givens rotations to update the eigenvector estimates. As a result, orthonormality of the latter can be maintained at all time, which is critical in the application of certain signal-subspace methods. The comparative performance of the new algorithms is illustrated by means of computer experiments.
The general education component: a new curriculum feature
Authors: D. T. Stephenson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

This paper introduces the general education component, a new feature of the Electrical Engineering and Computer Engineering curricula at Iowa State University, and reports on the experiences of students, advising staff, and faculty in its first year of implementation. The Department of Electrical and Computer Engineering implemented the general education component in both of its curricula for students entering fall 1999. This component replaces the Social Sciences and Humanities component that had been a part of the curricula for decades. The general education component consists of 15 credits, cannot include remedial coursework, must include 6 credits at the 300 or 400 (junior or senior) level, must meet the University's U.S. Diversity and International Perspectives requirements, and cannot include courses in engineering or the mathematical or physical sciences. Each student's selection of general education component courses is to support an educational objective developed by the student, and must be approved by a faculty advisor.
The polynomial phase differencing algorithm for 2-D phase unwrapping: performance analysis
Authors: J. M. Francos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We consider non-homogeneous 2-D signals which can be represented by a constant modulus polynomial-phase model. In previous papers we developed a computationally efficient estimation algorithm for the parameters of this model, and a novel phase unwrapping method which is based on this estimation algorithm. In this paper we analyze the performance of the algorithm and derive expressions for the mean squared error of the estimated coefficients. Assuming high signal to noise ratio (SNR), we show that the estimates are unbiased, and derive a rule for optimal selection of the algorithm parameters. The theoretical results are verified by Monte-Carlo simulations for selected examples. Finally, we present an approximate error analysis of the estimates for an arbitrary SNR. This analysis is carried out for a specific set of the algorithm parameters, which is selected based on the high SNR analysis.