ppxscal/embedding_network huggingface dataset:
2-D DOA estimation method using Zernike moments
Authors: Nobuhiro Kanaya, Youji Iiguni, Hajime Maeda
Venue: Signal Processing (2002)

This paper proposes a computationally efficient 2-D direction-of-arrival estimation method for the single source case. In this method, the array outputs are regarded as the pixel values and then transformed into the Zernike moments (ZMs). The rotation-invariant feature of ZMs allows us to estimate azimuth angles independently of elevation angles, without performing the eigenvalue decomposition. Obtained the azimuth estimate, the elevation angle is estimated by applying the MUSIC technique to the Correlation matrix of the ZM Vector that is smaller than that of the original array input vector. Therefore the computational complexity of the eigenvalue decomposition and the sweeping operation can be reduced. Several simulation results are presented to show the effectiveness of the proposed method.
On Transaction Boundaries in Active Databases: A Performance Perspective
Authors: M. J. Carey, R. Jauhari, M. Livny
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

A performance model designed for studying active DBMS performance issues is described. The authors present the results of simulation experiments in which system performance was studied as a function of transaction boundary semantics for varying levels of data contention, rule complexity, and data sharing between externally submitted tasks and rule management tasks. The results demonstrate that the way in which transaction boundaries are imposed can have a major impact on the performance of an active DBMS. It is therefore concluded that this aspect of rule semantics must be carefully considered at the time that rules are specified.
Tantalum carbide and nitride diffusion barriers for Cu metallisation
Authors: T. Laurila, K. Zeng, J. K. Kivilahti, J. Molarius, T. Riekkinen, I. Suni
Venue: Microelectronic Engineering (2002)

The reactions in the Si/TaC/Cu and Si/Ta2N/Cu metallisation systems were investigated by X-ray diffraction, Rutherford backscattering, scanning electron microscope and the transmission electron microscopy. The results were then combined with the assessed ternary Si-Ta-C, Ta-C-Cu, Si-Ta-N and Ta-N-Cu phase diagrams. It was found that both barriers ultimately failed due to diffusion of Cu through the barrier and accompanied formation of Cu3Si at temperatures higher than 725°C. However, in the TaC barriers the formation of amorphous TaOx layer with significant amounts of C took place at the TaC/Cu interface already at 600°C. Similar behaviour at 'low' temperatures was also noted in the Ta2N barriers.
Interactive Translation of Conversational Speech
Authors: Alex Waibel
Venue: Computer (1996)

Speech recognition performance has come a long way in the past 10 years. Present technology permits speaker-independent, continuous-speech, large-vocabulary dictation systems with word error rates of about 10 percent. Machine translation has also improved, but merely combining these technologies cannot produce good speech translation. Providing useful speech translation means attempting more than a sentence-by-sentence translation: It means interpreting an utterance or extracting its main intent. This often involves summarizing, which requires semantic and pragmatic interpretation within a domain of discourse. The Janus-II system described in this article not only extracts intent but also deals with problems such as ill-formed sentences, noise, and speech recognition errors. It does so by successively applying all sources of knowledge--from acoustic to discourse--to narrow the search for the most plausible translation. The system's main modules are speech recognition, parsing, discourse processing, and generation. Each is language-independent, consisting of a general processor that can be loaded with language-specific knowledge. Deriving an Interlingua--a language-independent representation of meaning--is key to system versatility. The Janus-II team is experimenting with spoken-language interpretation in an interactive videoconferencing environment, portable speech translation, and simultaneous dialogue translation. Questions concerning the human factors of interactive spoken-language translation await further study in actual field use.
Special Edition Using Visual InterDev 6, 6th edition
Authors: Steve Banick, Michael Morrison
Venue:  (1998)

:Book Description SE Using Visual InterDev X provides the reader with an easy to use reference to the newest version of Microsoft s Visual InterDev. The book teaches Internet application development with Visual InterDev in a steady, yet concise pace. After presenting foundational information for developing with Visual InterDev, the book quickly progresses into more advanced topics such as Dynamic HTML, scriptlets, ActiveX controls, database development, security, administration, optimization, and more.After only a year i n release, Microsoft Visual InterDev is used by over 225,000 professional developers worldwide, making it the leading Web application development tool, with nearly twice as many users as its nearest competitorSE Using Visual InterDev goes beyond most tutorials by providing expanding coverage of hot topics such as dynamic HTML (DHTML), scriptlets, ADO, ActiveX components creation and more
Enhanced stability of Ni monosilicide on MOSFETs poly-Si gate stack
Authors: P. S. Lee, D. Mangelinck, K. L. Pey, J. Ding, D. Z. Chi, T. Osipowicz, J. Y. Dai, A. See
Venue: Microelectronic Engineering (2002)

The formation and stability of Ni(Pt)Si on metal oxide semiconductor field effect transistor (MOSFETs) polycrystalline-Si (poly-Si) gate stack was investigated. Poly-Si and partial amorphous Si (a-Si) structures were grown using LPCVD and RTCVD techniques. For pure Ni silicidation, nucleation of NiSi2 was found at 700°C, which is slightly lower than that on monocrystalline Si (about 750°C). With Pt addition, Ni(Pt)Si was found up to 800°C, implying the important role of Gibbs free energy changes in enhancing the monosilicide stability. The extent of layer inversion of Ni(Pt)Si on RTCVD-Si is less than that on LPCVD-Si and thus results in a slower sheet resistance degradation.
Minimal State Space Search in Parallel Production Systems
Authors: V. V. Dixit, D. I. Moldovan
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

A methodology for transforming the original search space into an equivalent but minimal search space is proposed. First, the concept of dependences leads to a procedure for reduction of the search space. The search procedure using this method can produce a minimal and complete search space. It is shown that this method is applicable to parallel search as well. An added advantage of this method is that it does not exclude the use of heuristics. pi - lambda transformation is introduced to reduce the parallel search space.
Dealing with Dates: Solutions for the Year 2000
Authors: Robert A. Martin
Venue: Computer (1997)

The Y2K problem is real, and it has attracted intense media attention and aggressive vendor response. For whatever reason-- whether they wanted to save precious memory in an era when memory was incredibly expensive, or because they didn't expect systems to last this long, or because they simply didn't recognize the problem-programmers long ago adopted a two-digit convention to represent the year. This convention will cause failures as we approach the turn of the century and beyond. On January 1, 2000, uncorrected software will assume that the maximum value of a year field is 99 and will roll systems over to the date 1900 instead of 2000, resulting in negative date calculations. Incorrect leap year calculations will incorrectly assume that the year 2000 has only 365 days instead of 366. What's more, many date-dependent algorithms and forward-referencing systems are already beginning to fail. Approaches for resolving the problem and managing the risks have tended to focus on how particular tools and vendors can help. This article sets forth the concepts, terminology, and individual aspects of a Y2K effort and then defines a process that an organization can use to address its own Y2K challenge in a forthright and level-headed manner.
Continuations: A Mathematical Semantics for Handling FullJumps
Authors: Christopher Strachey, Christopher P. Wadsworth
Venue: Higher-Order and Symbolic Computation (2000)

This paper describes a method of giving the mathematical semantics of programming languages which include the most general form of jumps.
Context-sensitive rewriting strategies
Authors: Salvador Lucas
Venue: Information and Computation (2002)

Contex-sensitive rewriting is a simple rewriting restriction which is formalized by imposing fixed restrictions on replacements. Such a restriction is given on a purely syntactic basis: it is given on the arguments of symbols of the signature and inductively extended to arbitrary positions of terms built from those symbols. The termination behavior is not only preserved but usually improved and several methods have been developed to formally prove it. In this paper, we investigate the definition, properties, and use of context-sensitive rewriting strategies, i.e., particular, fixed sequences of context-sensitive rewriting steps. We study how to define them in order to obtain efficient computations and to ensure that context-sensitive computations terminate whenever possible. We give conditions enabling the use of these strategies for root-normalization, normalization, and infinitary normalization. We show that this theory is suitable for formalizing the definition and analysis of real computational strategies which are used in programming languages such as OBJ or ELAN.
Latency effects of system level power management algorithms
Authors: Dinesh Ramanathan, Sandy Irani, Rajesh Gupta
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

A power management algorithm for an embedded system reduces system level power dissipation by shutting off parts of the system when they are not being used and turning them back on when they are required. Algorithms for this problem are online in nature since they must operate without knowledge of the arrival time or service requirements of future requests. In this paper, we present online algorithms to manage power for embedded systems. We perform an empirical analysis of these algorithms and give theoretical justification for the empirical results. Effective power management strategies have an adverse impact on the latency of the system for which the strategy is designed. Typically, the more aggressive the power management scheme, the greater the increase in the latency of the system. In this paper, we prove an upper bound on the additional latency of the system introduced by power management strategies. Moreover, we show that this upper bound occurs each time the system is shutdown and hence is an important system design parameter.In addition, service time and latencies have an effect on power management strategies since they alter the length and occurrences of idle periods which. We study this phenomenon experimentally, by modeling the disk drive of a laptop computer as an embedded system. The results show that if service times of arriving requests are modeled, the relative performance of algorithms can change leading to non-adaptive algorithms performing better than adaptive ones. We compare the performance of adaptive and non-adaptive power management algorithms. In particular, our experimental results show that an "immediate" shutdown strategy that shuts down the system whenever it encounters an idle period performs surprising better than sophisticated adaptive algorithms suggested in the literature. We provide an analytical explanation for the effectiveness of power management strategies.
Guest Editors' Introduction to Special Section on Mobile Computing and Wireless Networks
Authors: Stephan Olariu, Koji Nakano
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

In recent years, the areas of mobile computing and wireless networks have seen explosive growth both in terms of the number of services provided and the types of technologies that have become available. Indeed, cellular telephony, radio paging, cellular data, and even rudimentary cellular multimedia services have become commonplace and the demand for enhanced capabilities will continue to grow into the foreseeable future. It is anticipated that, in the not-so-distant future, mobile users will be able to access their data and other services, such as electronic mail, video telephony, stock market news, map services, electronic banking, while on the move. Already today, there are more portable phones than computers connected to the Internet. However, the trend toward the Internet with its protocols around IP as the common basis for all communication applications seems to be quite clear.
Seven Great Blunders of the Computing World
Authors: Neville Holmes
Venue: Computer (2002)

Last July, for my first-anniversary column, I urged computing professionals to temper pride with humility ("Vanity and Guilt, Humility and Pride," Computer, July 2001, pp. 104, 102-103). To justify the humility, I wrote that "the computing industry's blunder rate is far higher than it should be, and we must take professional responsibility for it." No one reacted to this assertion, leaving me unsure if the silence sprang from collegial agreement or dismissive contempt.But we must remember the blunders so we can strike a proper balance between pride and humilityýassuming there have indeed been blunders. This column aims to confirm their existence by giving examples. The seven blunders I offer here provide a mix that is ancient and modern, retrievable and irretrievable, general and particular, subtle and blatant, and arguable and undeniable. I describe some blunders only briefly because I have already given their details in previous issues of Computer. Further, my choice of examples reflects my background and experience. If any of you care to offer a different selection for The Profession next July, I would consider such a contribution both educational and entertaining.
Matching 3-D Line Segments with Applications to Multiple-Object Motion Estimation
Authors: H. H. Chen, T. S. Huang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A two-stage algorithm for matching line segments using three-dimensional data is presented. In the first stage, a tree-search based on the orientation of the line segments is applied to establish potential matches. the sign ambiguity of line segments is fixed by a simple congruency constraint. In the second stage, a Hough clustering technique based on the position of line segments is applied to verify potential matches. Any paired line segments of a match that cannot be brought to overlap by the translation determined by the clustering are removed from the match. Unlike previous methods, this algorithm combats noise more effectively, and ensures the global consistency of a match. While the original motivation for the algorithm is multiple-object motion estimation from stereo image sequences, the algorithm can also be applied to other domains, such as object recognition and object model construction from multiple views.
SEL's Software Process Improvement Program
Authors: Victor Basili, Marvin Zelkowitz, Frank McGARRY, Jerry Page, Sharon Waligora, Rose Pajerski
Venue: IEEE Software (1995)

In 1993, the IEEE Computer Society and the Software Engineering Institute jointly established the Software Process Achievement Award to recognize outstanding improvement accomplishments. This award is to be given annually if suitable nominations are received by the SEI before November 1 each year. The nominations are reviewed by an award committee of Barry Boehm, Manny Lehman, Bill Riddle, myself, and Vic Basili (who did not participate in this award decision because of his involvement in the Software Engineering Laboratory).It is particularly fitting that the SEL was selected as the first winner for this award. They started their pioneering work nearly a decade before the Software Engineering Institute was founded, and their work has been both a guide and an inspiration to all of us who have attempted to follow in their footsteps.¿Watts Humphrey
ADER: A High-Order Approach for Linear Hyperbolic Systems in 2D
Authors: T. Schwartzkopff, C. D. Munz, E. F. Toro
Venue: Journal of Scientific Computing (2002)

The ADER scheme for solving systems of linear, hyperbolic partial differential equations in two-dimensions is presented in this paper. It is a finite-volume scheme of high order in space and time. The scheme is explicit, fully discrete and advances the solution in one single step. Several numerical tests have been performed. In the first test case the dissipation and dispersion behaviour of the schemes are studied in one space dimension. Dispersion as well as dissipation effects strongly influence the discrete wave propagation over long distances and are very important for, e.g., aeroacoustical calculations. The next test, the so-called co-rotating vortex pair, is a demonstration of the ideas of the two-dimensional ADER approach. The linearised Euler equations are used for the simulation of the sound emitted by a co-rotating vortex pair.
Minimum T-cuts and optimal T-pairings
Authors: Romeo Rizzi
Venue: Discrete Mathematics (2002)

We introduce the notion of T-pairing and give a min-max characterization for the minimum size of a T-cut. We show that the coefficients in the minimal TDI system for the T-cut polyhedron can be arbitrarily big.
Interference Modelling in DS/CDMA Cellular Systems Operating in a General Fading Environment
Authors: A. Sathyendran, K. W. Sowerby, M. Shafi
Venue: Wireless Personal Communications: An International Journal (1997)

Multiple access interference and the mobile radio environment are the primary limitations on the performance of DS/CDMA cellular systems. This paper presents the analysis of a DS/CDMA cellular system operating in a &ldquo;general&rdquo; fading environment. In particular the issues of signal fading, multiple access interference, and power control are addressed. A computationally efficient statistical method is used in the estimation of system performance. It is assumed that the variability of each received signal can be represented by fast Nakagami&lowbar;m fading plus slower log-normal shadowing. Average bit-error-rate (BER) and outage probability are estimated as system performance indicators. The analysis shows, that as the variability of the fast fading of the received signal reduces, the performance of the system improves. However, when the signal undergoes both fast fading and shadowing, it is largely the shadowing that determines system performance. Use of forward link power control (that compensates for the variability due to shadowing) results in minimal performance improvement. However, in the reverse link significant improvement in performance can be achieved using a similar power control scheme.
Stochastic wire-length and delay distributions of 3-dimensional circuits
Authors: Rongtian Zhang, Kaushik Roy, Cheng Kok Koh, David B. Janes
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

3-D technology promises higher integration density and lower interconnection complexity and delay. At present, however, not much work on circuit applications has been done due to lack of insight into 3-D circuit architecture and performance. In this paper, we investigate the interconnect distributions of 3-D circuits. We divide the 3-D interconnects into horizontal wires and vertical wires and derive their wire-length distributions, respectively. Based on the stochastic wire-length distributions, we calculate 3-D circuit interconnect delay distribution. We show that 3-D structures effectively reduce the number of long delay nets, significantly reduce the number of repeaters needed, and dramatically improve the performance. With 3-D structures, a circuit can work at a much higher clock rate (double, even triple) than with 2-D. However, we also show that the impacts of vertical wires on chip area and interconnect delay may limit the number of device layers that we can integrate.
Processor Allocation in Hypercube Multicomputers: Fast and Efficient Strategies for Cubic and Noncubic Allocation
Authors: Debendra Das Sharma, Dhiraj K. Pradhan
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

A new approach for dynamic processor allocation in hypercube multicomputers which supports a multi-user environment is proposed. A dynamic binary tree is used for processor allocation along with an array of free lists. Two algorithms are proposed based on this approach, capable of efficiently handling cubic as well as noncubic allocation. Time complexities for both allocation and deallocation are shown to be polynomial, a significant improvement over the existing exponential and even super-exponential algorithms. Unlike existing schemes, the proposed strategies are best-fit strategies within their search space. Simulation results indicate that the proposed strategies outperform the existing ones in terms of parameters such as average delay in honoring a request, average allocation time, average deallocation time, and memory overhead.
A case study of web server benchmarking using parallel WAN emulation
Authors: Carey Williamson, Rob Simmonds, Martin Arlitt
Venue: Performance Evaluation (2002)

This paper describes the use of a parallel discrete-event network emulator called the Internet Protocol Traffic and Network Emulator (IP-TNE) for Web server benchmarking. The experiments in this paper demonstrate the feasibility of high-performance wide area network (WAN) emulation using parallel discrete-event simulation (PDES) techniques on a single shared-memory multiprocessor. Our experiments with an Apache Web server achieve up to 8000 HTTP/1.1 transactions/s for static document retrieval across emulated WAN topologies with up to 4096 concurrent Web/TCP clients. The results show that WAN characteristics, including round-trip delays, packet losses, and bandwidth asymmetry, all have significant impacts on Web server performance, as do client protocol behaviors. WAN emulation using the IP-TNE enables stress testing and benchmarking of Web servers in ways that may not be possible in simple local area network (LAN) test scenarios.
Using Reconfiguration for Efficient Management of Replicated Data
Authors: Divyakant Agrawal, Amr El Abbadi
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Replicated data management protocols have been proposed that exploit a logically structured set of copies. These protocols have the advantage that they provide limited fault-tolerance at low communication cost. The proposed protocols can be viewed as analogues of the read-one write-all protocol in the context of logical structures. In this paper, we start by generalizing these protocols in two ways for logical structures. First, the quorum based approach is applied to develop protocols that use structured read and write quorums, thus attaining a high degree of data availability for both read and write operations. Next, the reconfiguration or views approach is developed for these structures resulting in protocols that attain high degrees of availability at significantly low communication cost for read operations. In this sense, the proposed protocols have the advantages of the read-one write-all protocol for low cost read operations as well as the majority quorum protocol for high data availability. Finally, we generalize the reconfiguration approach to allow for the dynamic reconfiguration of the database system from one replica management protocol to another. This allows database systems to adapt to an evolving and dynamic application environment.