ppxscal/embedding_network huggingface dataset:
Frequency Independent Nonlinear Feedforward Phase Estimator
Authors: R. Di Girolamo, T. Le-Ngoc
Venue: Wireless Personal Communications: An International Journal (1997)

The major focus of this work deals with fast and efficient phase estimation in an additive white Gaussian noise environment, where the received signal is a function of both phase and frequency error (&Delta;&Phi;,&Delta;f). The paper proposes a modified version of the Viterbi and Viterbi phase estimator, and compares this modified version with the original. The comparison is performed in terms of two criteria &ndash; estimator variance and phase ambiguity resolution. Results suggest that the new estimator has a lower variance than the original technique when a frequency error is present. In addition, when the frequency is perfectly synchronized, the two estimators yield similar performances at moderate to high levels of signal-to-noise ratios. Phase ambiguity resolution by unique word preambles is also investigated. Although the new estimator requires additional processing to resolve ambiguity, its probability of resolution error is shown to be almost the same as for the V V estimator.
Edge-gracefulness of the composition of paths with null graphs
Authors: Wai Chee Shiu, Peter Che Bor Lam, Hee Lin Cheng
Venue: Discrete Mathematics (2002)

Let G = (V,E) be a (p,q)-graph. Let f:E → {1,2,..., q} be a bijection. The induced mapping f+ : V → Zp of f is defined by f+(u) ≡ Σuυ∈Ef(uυ) (modp) for u ∈ V. If f+ is a bijection, then G is called edge-graceful. In this paper, we investigate the edge-gracefulness of the composition of paths with null graphs Pm > Nn, where there are mn vertices and (m - 1)n2 edges. We show that P3 > Nn is edge-graceful if n is odd.
Computing Performance Bounds of Fork-Join Parallel Programs Under a Multiprocessing Environment
Authors: John C. S. Lui, Richard R. Muntz, Don Towsley
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

We study a multiprocessing computer system which accepts parallel programs that have a fork-join computational paradigm. The multiprocessing computer system under study is modeled as K homogeneous servers, each with an infinite capacity queue. Parallel programs arrive at the multiprocessing system according to a series-parallel phase type interarrival process with mean arrival rate of ¿. Upon the program arrival, it forks into K independent tasks and each task is assigned to an unique server. Each task's service time has a k-stage Erlang distribution with mean service time of 1/¿. A parallel program is completed upon the completion of its last task. This kind of queuing model has no known closed form solution in the general (K¿ 2) case. In this paper, we show that by carefully modifying the arrival and service distributions at some imbedded points in time, we can obtain tight performance bounds. We also provide a computational efficient algorithm for obtaining upper and lower bounds on the expected response time. The methodology is flexible and allows one to trade-off the tightness of the bounds and computational cost.
New technique for measuring the threshold voltage in MOS devices
Authors: A. Benfdila, A. Chikouche, M. S. Khanniche
Venue: Microelectronic Engineering (2002)

The present paper describes an experimental method that can be used to measure the threshold voltage in MOS devices in the form of transistors or capacitors. The proposed method is based on the detection of the non-steady-state/steady-state transition of the surface potential at the oxide-semiconductor interface of a MOS device, when it is swept from depletion to inversion regions. This detection is carried out as follows: a set of current versus gate signal frequency measurements, for different voltage amplitudes, is performed. The frequency values corresponding to the maximum measured current (optimum frequency)fm, are read. Several gate voltage versus optimum frequencies (fm-VG) curves are plotted for gate voltage values ranging from 0.2 to 3 V with a 0.1 V step increment. The (fm-VG) curves are found to undergo an abrupt change of slope at a specific gate voltage value. The value of threshold voltage is extracted from the critical points of the former curves. Experiments have been carried out on different devices. The measured values of threshold voltage are found to be in good agreement to those obtained by the conventional ID-VGS and simulation methods as well as that supplied by the device manufacturer.
Parallel Finite-Element Computation of 3D Flows
Authors: Tayfun Tezduyar, Sharouz Aliabadi, Marek Behr, Andrew Johnson, Sanjay Mittal
Venue: Computer (1993)

The authors describe their work on the massively parallel finite-element computation of compressible and incompressible flows with the CM-200 and CM-5 Connection Machines. Their computations are based on implicit methods, and their parallel implementations are based on the assumption that the mesh is unstructured. Computations for flow problems involving moving boundaries and interfaces are achieved by using the deformable-spatial-domain/stabilized-space-time method. Using special mesh update schemes, the frequency of remeshing is minimized to reduce the projection errors involved and also to make parallelizing the computations easier. This method and its implementation on massively parallel supercomputers provide a capability for solving a large class of practical problems involving free surfaces, two-liquid interfaces, and fluid-structure interactions.
CMOS Technology Trends and Economics
Authors: Armin W. Wieder, Franz Neppl
Venue: IEEE Micro (1992)

CMOS has become the mainstream IC technology. Extending well into the sub-0.1- mu m regime, its potential provides enormous chip complexities for integration of complete systems on one chip. A number of general trends in the development and manufacturing of CMOS technologies and ICs are discussed. It is argued that unrestricted availability of this technology is of strategic importance for the European high-technology industry. Exploding development costs and investments per technology generation require global cooperation, particularly for the relatively small European IC manufacturers to survive in this key technology. Trends in the development of 64-Mb and 256-Mb DRAMs, optical lithography processes, multilayer resist technologies, retrograde-well structures for CMOS device isolation, low-resistive and dense interconnection systems with low capacitances and silicon-on-insulator technology for the development of CMOS devices are described.
Noise-Resistant Invariants of Curves
Authors: I. Weiss
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Projective invariants are shape descriptors that are independent of the point of view from which the shape is seen, and, therefore, are of major importance in object recognition. They make it possible to match an image of an object to one stored in a database without the need for searching for the correct viewpoint. An invariant representation of a general curve is obtained. The calculation is local and does not suffer from the occlusion problem of global descriptors. To make the method robust, differentiation techniques that give much more reliable results than previous ones are developed. These differentiation methods are useful in many other applications as well.
Design Error Diagnosis with Re-Synthesis in Combinational Circuits
Authors: Raimund Ubar
Venue: Journal of Electronic Testing: Theory and Applications (2003)

A new approach is proposed for removing design errors from digital circuits, which does not use any error model. Based on a diagnostic pre-analysis of the circuit, a subcircuit suspected to be erroneous is extracted. Opposite to other known works, re-synthesis of the subcircuit need not be applied to the whole function of the erroneous internal signal in terms of primary inputs, it may stop at arbitrary nodes inside the circuit. As the subcircuits to be redesigned are kept as small as possible, the speed of the whole procedure of diagnosis and re-synthesis can be significantly increased. A formal algorithm is proposed for the whole procedure. Experimental data show the efficiency of the diagnostic pre-analysis.
Simulating Software Development Processes
Authors: Gregory A. Hansen
Venue: Computer (1996)

One of the main factors affecting any product development schedule is rework. In the consumer product market, the risk of rework is often measured against the need to get to market quickly. This frequently happens in the software market as well; products are released with known bugs and then upgraded after "user testing." Therefore, software development organizations may choose to limit the iterations of defect correction to meet schedules or control costs. The decision to release software after a certain point is a business decision, and little is written about business decisions in software-related literature. The underlying problem is this: Despite the increasing maturity of organizations and despite the software estimation tools that are available, schedules continue to be missed. This article shows that subtle changes to process drivers can have major impact on software development schedules and costs.
An Approach to Active Spatial Data Mining Based on Statistical Information
Authors: Wei Wang, Jiong Yang, Richard Muntz
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

Spatial data mining presents new challenges due to the large size of spatial data, the complexity of spatial data types, and the special nature of spatial access methods.Most research in this area has focused on efficient query processing of static data. This paper introduces an active spatial data mining approach that extends the current spatial data mining algorithms to efficiently support user-defined triggers on dynamically evolving spatial data. To exploit the locality of the effect of an update and the nature of spatial data, we employ a hierarchical structure with associated statistical information at the various levels of the hierarchy and decompose the user-defined trigger into a set of subtriggers associated with cells in the hierarchy. Updates are suspended in the hierarchy until their cumulative effect might cause the trigger to fire. It is shown that this approach achieves three orders of magnitude improvement over the naive approach that reevaluate the condition over the database for each update, while both approaches produce the same result without any delay. Moreover, this scheme can support incremental query processing as well.
Induction-based gate-level verification of multipliers
Authors: Ying Tsai Chang, Kwang Ting Tim Cheng
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

We propose a method based on unrolling the inductive definition of binary number multiplication to verify gate-level implementations of multipliers. The induction steps successively reduce the size of the multiplier under verification. Through induction, the verification of an n-bit multiplier is decomposed into n equivalence checking problems. The resulting equivalence checking problems could be significantly sped up by simple structural analysis. This method could be generalized to the verification of more general arithmetic circuits and the equivalence checking of complex data-path.
Measuring and Analyzing Real-Time Performance
Authors: Kevin B. Kenny, Kwei-Jay Lin
Venue: IEEE Software (1991)

To satisfy the deadline requirements of hard real-time systems, programmers must be able to determine the maximum execution time of any task. The use of Flex, an experimental real-time language being developed for the Concord project, is examined. The Flex system embodies an empirical approach that first measures the actual timing behavior and then uses the measurement results to determine the parameters of a programmer-supplied timing model. This timing model gives the system the programmer's understanding of the program's timing behavior in terms of its asymptotic time complexity. The measurement system determines the exact values of model parameters using sophisticated statistical methods to derive the program's timing characteristics precisely. Flex is better than performance analyzers that examine only code because it can cope with more kinds of program structures and its does not depend on an underlying hardware model. The integration of measurement and formal analysis is discussed.
What Knowledge Is Important to a Software Professional?
Authors: Timothy C. Lethbridge
Venue: Computer (2000)

Software engineering licensing bodies, universities designing curricula, and companies focusing on better training for their staff are all pursuing efforts to define the subject matter that software professionals should know. Whereas most of these groups are basing their decisions on expert opinions in the field, the author, part of a survey group at the University of Ottawa, was more interested in learning what subject matter practitioners themselves actually find most important in their work.From May to October 1998, this survey group at the University of Ottawa queried software professionals to learn which educational topics have proved most important to them in their careers and to identify the topics for which their education or current knowledge could be improved.They used the responses to the 75 questions in the survey to develop three sets of data: the importance of various topics taught in computer science, software engineering, and computer engineering curricula; the emphasis educational institutions place on these topics; and what practitioners believe they currently know about the topics.
Registering Multiview Range Data to Create 3D Computer Objects
Authors: Gérard Blais, Martin D. Levine
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This research deals with the problem of range image registration for the purpose of building surface models of three-dimensional objects. The registration task involves finding the translation and rotation parameters which properly align overlapping views of the object so as to reconstruct from these partial surfaces, an integrated surface representation of the object.The approach taken is to express the registration task as an optimization problem. We define a function which measures the quality of the alignment between the partial surfaces contained in two range images as produced by a set of motion parameters. This function computes a sum of Euclidean distances between a set of control points on one of the surfaces to corresponding points on the other. The strength of this approach resides in the method used to determine point correspondences across range images. It is based on reversing the rangefinder calibration process, resulting in a set of equations which can be used to directly compute the location of a point in a range image corresponding to an arbitrary point in three-dimensional space.A stochastic optimization technique, very fast simulated reannealing (VFSR), is used to minimize the cost function.Dual-view registration experiments yielded excellent results in very reasonable computational time. A multiview registration experiment was also performed, but a large processing time was required. A complete surface model of a typical 3D object was then constructed from the integration of its multiple partial views. The effectiveness with which registration of range images can be accomplished makes this method attractive for many practical applications where surface models of 3D objects must be constructed.
A Temporal Access Control Mechanism for Database Systems
Authors: Elisa Bertino, Claudio Bettini, Elena Ferrari, Pierangela Samarati
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

This paper presents a discretionary access control model in which authorizations contain temporal intervals of validity. An authorization is automatically revoked when the associated temporal interval expires. The proposed model provides rules for the automatic derivation of new authorizations from those explicitly specified. Both positive and negative authorizations are supported. A formal definition of those concepts is presented in the paper, together with the semantic interpretation of authorizations and derivation rules as clauses of a general logic program. Issues deriving from the presence of negative authorizations are discussed. We also allow negation in rules: it is possible to derive new authorizations on the basis of the absence of other authorizations. The presence of this type of rules may lead to the generation of different sets of authorizations, depending on the evaluation order. An approach is presented, based on establishing an ordering among authorizations and derivation rules, which guarantees a unique set of valid authorizations. Moreover, we give an algorithm detecting whether such an ordering can be established for a given set of authorizations and rules. Administrative operations for adding, removing, or modifying authorizations and derivation rules are presented and efficiency issues related to these operations are also tackled in the paper. A materialization approach is proposed, allowing to efficiently perform access control.
Are Primitive Polynomials Always Best in Signature Analysis?
Authors: A. Ahmad, N. K. Nanda, K. Garg
Venue: IEEE Design Test (1990)

It is shown that in testing technique based on linear-feedback shift registers, the use of primitive polynomials in a signature-analysis register is not always better than using nonprimitive polynomials. The results show how some primitive polynomials may actually yield maximum aliasing errors. These results are based on the simulation of single stuck-at faults, but they also hold for certain multiple stuck-at faults. The best testing technique appears to be one that uses a binary counter in test-pattern generation with a primitive polynomial in signature analysis.
Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems
Authors: Jan Jonsson, Kang G. Shin
Venue: Real-Time Systems (2002)

Distributed real-time applications usually consist of several component tasks and must be completed by its end-to-end (E-T-E) deadline. As long as the E-T-E deadline of an application is met, the strategy used for dividing it up for component tasks does not affect the application itself. One would therefore like to &ldquo;slice&rdquo; each application E-T-E deadline and assign the slices to component tasks so as to maximize the schedulability of the component tasks, and hence the application. Distribution of the E-T-E deadline over component tasks is a difficult and important problem since there exists a circular dependency between deadline distribution and task assignment. We propose a new deadline-distribution scheme which has two major improvements over the best scheme known to date. It can distribute task deadlines prior to task assignment and relies on new adaptive metrics that yield significantly better performance in the presence of high resource contention. The deadline-distribution problem is formulated for distributed hard real-time systems with relaxed locality constraints, where schedulability analysis must be performed at pre-run-time, and only a subset of the tasks are constrained by pre-assignment to specific processors. Although it is applicable to any scheduling policy, the proposed deadline-distribution scheme is evaluated for a non-preemptive, time-driven scheduling policy. Using extensive simulations, we show that the proposed adaptive metrics deliver much better performance (in terms of success ratio and maximum task lateness) than their non-adaptive counterparts. In particular, the simulation results indicate that, for small systems, the adaptive metrics can improve the success ratio by as much as an order of magnitude. Moreover, the new adaptive metrics are found to exhibit very robust performance over a large variety of application and architecture scenarios.
An Introduction to Evaluating Biometric Systems
Authors: P. Jonathon Phillips, Alvin Martin, C. l. Wilson, Mark Przybocki
Venue: Computer (2000)

On the basis of media hype alone, you might conclude that biometric passwords will soon replace their alphanumeric counterparts with versions that cannot be stolen, forgotten, lost, or given to another person. But what if the actual performance of these systems falls short of the estimates? The authors designed this article to provide sufficient information to know what questions to ask when evaluating a biometric system, and to assist in determining whether performance levels meet the requirements of an application. For example, a low-performance biometric is probably sufficient for reducing--as opposed to eliminating--fraud. Likewise, completely replacing an existing security system with a biometric- based one may require a high-performance biometric system, or the required performance may be beyond what current technology can provide. Of the biometrics that give the user some control over data acquisition, voice, face, and fingerprint systems have undergone the most study and testing--and therefore occupy the bulk of this discussion. This article also covers the tools and techniques of biometric testing.
Comments on ''A Three-Module Strategy for Edge Detection'' (with reply)
Authors: R. H. Park, W. Y. Choi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Comments are made on the above named work by V. Lacroix. The commenters contend that the proposed orthogonal bases are the same as the edge subspace bases in the approach of W. Frei and C.C. Chen and that the ratio for detecting edges is the same as that proposed by Frei and Chen for special cases. In his reply, Lacroix explains the relationship between his method and that of Frei and Chen.
What Has Influenced Computing Innovation?
Authors: Thomas P. Hughes, Jerry R. Sheehan
Venue: Computer (1999)

Computing technology is nothing if not fast moving. Generations of products and their underlying electronics are introduced every 18 to 24 months. These developments are driven largely by competition and commercial reward, but many have their roots firmly in research funded by both the government and private sector. New products, processes, and services typically stem from the complex interaction of government, industry, and academia. But are there specific patterns in past successes? Over the years, a particular blend of government, industry, and academia has been the foundation of computing innovation. If the US is to sustain its past growth in computing, researchers, business leaders, and policy makers need to understand the elements of this synergy. One way to gain insight is to analyze past successes in significant areas The Computer Science and Telecommunications Board (CSTB) produced a report that overviews the innovations since World War II in five critical areas of computing technology: relational databases, the Internet, theoretical computer science, artificial intelligence, and virtual reality. The studies demonstrate significant interaction among industry, universities, and government in developing and commercializing computing technology.
Usability and the Bottom Line
Authors: George M. Donahue
Venue: IEEE Software (2001)

There's little debate that usability engineering benefits end users, but its benefit for companies and the people who work for them is less widely known. The author discusses these broader usability benefits and also how to use a cost-benefit analysis to demonstrate the value of usability to your company's bottom line.