ppxscal/embedding_network huggingface dataset:
Quality in Web Design for Visually Impaired Users
Authors: Margaret Ross
Venue: Software Quality Control (2002)

Visually impaired users require web page interfaces that they can interact with. Providing such interfaces is necessary to serve this community, and is required by government regulation. This paper describes the unique web access requirements of visually impaired users. It reviews surveys of the suitability of web sites for the partially sighted and blind. Most web sites do not meet the requirements of the UK and other governments. In addition, serving the visually impaired is a marketing opportunity for organizations, as there is an ever increasing population with potential sight problems.
FLEX: A Tolerant and Cooperative User Interface to Databases
Authors: A. Motro
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

FLEX a user interface to relational databases, can be used satisfactorily by users with different levels of expertise. FLEX is based on a formal query language, but is tolerant of incorrect input. It never rejects queries; instead, it adapts flexibility and transparently to their level of correctness and well-formedness, providing interpretations of corresponding accuracy and specificity. The most prominent design feature of FLEX is the smooth concatenation of several independent mechanisms, each capable of handling input of decreasing level of correctness and well-formedness. Each input is cascaded through this series of mechanisms until an interpretation is found. FLEX is also cooperative. It never delivers empty answers without explanation or assistance. By following up each failed query with a set of more general queries, FLEX determines whether an empty answer is genuine, in which case it suggests related queries that have nonempty answers, or whether it reflects erroneous presuppositions on the part of the user, in which case it then explains them.
Where to Look? Automating Attending Behaviors of Virtual Human Characters
Authors: Sonu Chopra Khullar, Norman I. Badler
Venue: Autonomous Agents and Multi-Agent Systems (2001)

This research proposes a computational framework for generating visual attending behavior in an embodied simulated human agent. Such behaviors directly control eye and head motions, and guide other actions such as locomotion and reach. The implementation of these concepts, referred to as the AVA, draws on empirical and qualitative observations known from psychology, human factors and computer vision. Deliberate behaviors, the analogs of scanpaths in visual psychology, compete with involuntary attention capture and lapses into idling or free viewing. Insights provided by implementing this framework are: a defined set of parameters that impact the observable effects of attention, a defined vocabulary of looking behaviors for certain motor and cognitive activity, a defined hierarchy of three levels of eye behavior (endogenous, exogenous and idling) and a proposed method of how these types interact.
Synthesis of Algorithm-Based Fault-Tolerant Systems from Dependence Graphs
Authors: B. Vinnakota, N. K. Jha
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Algorithm-based fault tolerance (ABFT) is a method for improving the reliability of parallel architectures used for computation-intensive tasks. A two-stage approach to thesynthesis of ABFT systems is proposed. In the first stage, a system-level code is chosento encode the data used in the algorithm. In the second stage, the optimal architectureto implement the scheme is chosen using dependence graphs. Dependence graphs are agraph-theoretic form of algorithm representation. The authors demonstrate that not allarchitectures are ideal for the implementation of a particular ABFT scheme. They propose new measures to characterize the fault tolerance capability of a system to better exploit the proposed synthesis method. Dependence graphs can also be used for the synthesis of ABFT schemes for non-linear problems. An example of a fault-tolerant median filter is provided to illustrate their utility for such problems.
Polynomial Time Testability of Circuits Generated by Input Decomposition
Authors: Gueesang Lee, M. J. Irwin, R. M. Owens
Venue: IEEE Transactions on Computers (1994)

Considers polynomial time testability of combinational circuits generated by input decomposition, especially those generated by the logic synthesis tool FACTOR. First, the complexity of the fault detection problem in this class of circuits is explored using a stuck-at fault model. An O(2/sup k/m) algorithm for detecting a single stuck-at fault is given that is faster than the O(16/sup k/m), previously reported best algorithm proposed by Fujiwara(1990), where k is the number of inputs in a subcircuit and m the number of signal lines in the circuit. Efficient, polynomial time algorithms are described for generating a test set for all single stuck-at faults in the circuit. The basic strategy is to eliminate backtracks during line justification by constructing tables or vector sets in each subcircuit, which makes the fault propagation procedure very simple and eventually results in an efficient test generation procedure. This presentation of efficient polynomial time test generation algorithms for FACTOR-generated circuits is important, since it shows that it is possible to synthesize circuits that are optimized for area and are polynomial time testable at the same time.
Automatic Target Recognition Using a Neocognitron
Authors: G. S. Himes, R. M. Iñigo
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

The use of a neocognitron in an automatic target recognition (ATR) system is described. An image is acquired, edge detected, segmented, and centered on a log-spiral grid using subsystems not discussed in the paper. A conformal transformation is used to map the log-spiral grid to a computation plane in which rotations and scalings are transformed to displacements along the vertical and horizontal axes, respectively. Since the neocognitron can recognize shifted objects, the use of log-spiral images by the neocognitron enables the system to recognize scaled, rotated, and translated objects. Two modifications to prior neocognitron implementations are described. A new weight reinforcement method is introduced which solves a significant training problem for the neocognitron. A method of reducing training time is also introduced which specifies the initial layer of weights in the network. All subsequent layers are trained using unsupervised learning. Simulation results using 32*32 and 64*64 intercontinental ballistic missile (ICBM) images are presented.
A Distributed Management Scheme for Partitionable Parallel Computers
Authors: M. Jeng, H. J. Siegel
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

A distributed scheme for dynamic partitioning is investigated. Distributed procedures to split a subsystem and to combine subsystems are presented. The correctness of each of these two procedures is shown, and the complexity is analyzed. The procedures are applicable to parallel computers that use interconnection networks, such as hypercube, omega, multistage cube, and extra-stage cube networks.
Functional Fault Models for Analog Circuits
Authors: Yuri V. Malyshenko
Venue: IEEE Design Test (1998)

Fault models are introduced for analog components described on the functional level. Conditions for the output manifestation of functional faults are derived, with a spread in analog output values allowed for. The study made has shown that only the function of a faulty-free component may be used to select input test stimuli which should ensure the manifestation of its faults. The results obtained may be used to select test stimuli for analog printed-circuit board.
Single-photon detection of THz-waves using quantum dots
Authors: S. Komiyama, O. Astafiev, V. Antonov, T. Kutsuwa
Venue: Microelectronic Engineering (2002)

We demonstrate two mechanisms of single photon detection in the THz spectral region by using gate-voltage-induced lateral GaAs/AlGaAs quantum dots (QDs). Firstly, a QD in strong magnetic fields (B = 3-4 T) is operated as a single electron transistor (SETs). THz-photons (1.8-1.5 THz) excite the QD via cyclotron resonance, and electrical polarization is thereby induced within the QD. The polarization, in turn, affects the SET conductance. Secondly, a SET with parallel double QDs is operated without magnetic fields, where GHz-photons (about 500 GHz) excite and ionize one of the QDs, which is, in turn, probed by the other QD to change the SET conductance.
Testing Interconnections to Static RAMs
Authors: Dilip K. Bhavsar
Venue: IEEE Design Test (1991)

A method for testing the interconnections of ordinary static RAMs with a processor that has a boundary-scan register and an IEEE 1149.1 test-access port is described. The method uses an enhanced boundary-scan-register design that manipulates the test-access-port controller states to meet the static RAM's timing constraints. The implementation is more economical than a boundary-scan register that strictly conforms to IEEE 1149.1. Test operation is more efficient, requiring a third of the number of scan operations. A test-pattern set and a method for detecting and diagnosing the interconnection faults on RAMs are also described. The test-pattern set can be enhanced as necessary to increase coverage and diagnosing ability and to handle any RAM configuration. The implementation of the proposed boundary-scan register is independent of the test algorithm used. It is believed that the methodology is extendable to RAMs that use an access protocol different from the one described, for example dynamic RAMs and synchronous RAMs.
Performance analysis of the adaptive line enhancer with multiple sinusoids in noisy environment
Authors: R. L. Campbell,  Jr., N. H. Younan, J. Gu
Venue: Signal Processing (2002)

In this paper, the performance analysis of the adaptive line enhancer when the input signal consists of multiple sinusoids embedded in noise is investigated. The performance is evaluated in terms of the signal-to-noise ratio gain at the filter's output. It is shown that, for multiple sinusoids, this gain is not only a function of the filter length, but also of three additional factors -- the number of sinusoids, the noise power, and the amplitude of each sinusoid. Simulation results for a dual noisy sinusoidal input are presented to illustrate the validity of this analysis.
Stochastic Trees and the StoTree Modeling Environment: Models and Software for Medical Decision Analysis
Authors: Gordon B. Hazen
Venue: Journal of Medical Systems (2002)

In this paper we present a review of stochastic trees, a convenient modeling approach for medical treatment decision analyses. Stochastic trees are a generalization of decision trees that incorporate useful features from continuous-time Markov chains. We also discuss StoTree, a freely available software tool for the formulation and solution of stochastic trees, implemented in the Excel spreadsheet environment.
Subpixel Edge Location in Binary Images Using Dithering
Authors: Xiangdong Liu, Roger W. Ehrich
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper concerns the problem of obtaining subpixel estimates of the locations of straight edges in binary digital images using dithering. By adding uniformly distributed independent random noise it is shown that estimation bias may be removed and that the estimation variance is inversely proportional to the length of the line segment. The sensitivity to incorrect dither amplitude is calculated, and implementation is discussed.
Quality of Service Support for Multimedia Applications in Third Generation Mobile Networks Using Adaptive Scheduling
Authors: Paul Richardson, Larry Sieh, Aura Ganz
Venue: Real-Time Systems (2001)

Third generation mobile network will support services such as video-telephony, video-conferencing and other multimedia applications. Therefore, this network must provide quality of service (QoS) to these applications consistent with that offered by fixed networks. However, this is a very challenging task due to the instability of the wireless channel and the diverse quality of service requirements dictated by different multimedia applications. In this paper we introduce a resource allocation algorithm for the wireless downlink that takes into account the wireless channel characteristics, the QoS required by the applications as well as a pricing value function. Our solution is based on an adaptive scheduling algorithm originally developed for scheduling real-time processes during transient surges. This algorithm tends to maximize the wireless network operator profit while satisfying the customers&rsquo; quality requests.
A Greedy EM Algorithm for Gaussian Mixture Learning
Authors: Nikos Vlassis, Aristidis Likas
Venue: Neural Processing Letters (2002)

Learning a Gaussian mixture with a local algorithm like EM can be difficult because (i) the true number of mixing components is usually unknown, (ii) there is no generally accepted method for parameter initialization, and (iii) the algorithm can get trapped in one of the many local maxima of the likelihood function. In this paper we propose a greedy algorithm for learning a Gaussian mixture which tries to overcome these limitations. In particular, starting with a single component and adding components sequentially until a maximum number k, the algorithm is capable of achieving solutions superior to EM with k components in terms of the likelihood of a test set. The algorithm is based on recent theoretical results on incremental mixture density estimation, and uses a combination of global and local search each time a new component is added to the mixture.
The Asymptotic Workload Behavior of Two Coupled Queues
Authors: Sem Borst, Onno Boxma, Miranda Van Uitert
Venue: Queueing Systems: Theory and Applications (2003)

We consider a system of two coupled queues Q1 and Q2. When both queues are backlogged, they are each served at unit rate. However, when one queue empties, the service rate at the other queue increases. Thus, the two queues are coupled through the mechanism for dynamically sharing surplus service capacity. We derive the asymptotic workload behavior at Q1 for various scenarios where at least one of the two queues has a heavy-tailed service time distribution. First of all, we consider a situation where the traffic load at Q1 is below the nominal unit service rate. We show that if the service time distribution at Q1 is heavy-tailed, then the workload behaves exactly as if Q1 is served in isolation at a constant rate, which only depends on the service time distribution at Q2 through its mean. In addition, we establish that if the service time distribution at Q1 is exponential, then the workload distribution is either exponential or semi-exponential, depending on whether the traffic load at Q2 exceeds the nominal service rate or not. Next, we focus on a regime where the traffic load at Q1 exceeds the nominal service rate, so that Q1 relies on the surplus capacity from Q2 to maintain stability. In that case, the workload distribution at Q1 is determined by the heaviest of the two service time distributions, so that Q1 may inherit potentially heavier-tailed characteristics from Q2.
Fuzzy Critical Path Method Based on Signed-Distance Ranking and Statistical Confidence-Interval Estimates
Authors: Feng-Tse Lin, Jing-Shing Yao
Venue: The Journal of Supercomputing (2003)

Activity networks have proved very useful for certain types of project performance evaluations. The purpose of the critical path method (CPM) is to identify the critical activities in the critical path of an activity network. However, the unknowns or vagueness about the time duration for activities in network planning, has led to the development of fuzzy CPM. In this paper, we propose an approach that combines fuzzy mathematics with statistics to solve practical problems in unknown or vague situations. We introduce a fuzzy CPM based on statistical confidence-interval estimates and a signed-distance ranking for (1&minus;&alpha;) fuzzy number levels. We not only derive the level (1&minus;&alpha;) of fuzzy numbers from (1&minus;&alpha;)&times;100% statistical data confidence-interval estimates, but also use the signed-distance ranking method to define the ordering. The primary result obtained from this study, is a theorem through which the critical path in the fuzzy sense is obtained based on statistical confidence-interval estimates.
Distributed exploratorium for high performance computational techniques
Authors: Sridhar V. Iyer, Alan Beck, Umberto Ravaioli, Jeff Terstriep
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

The exploratorium described here consists of hyperlinked tutorials and quizzes on high performance computational concepts and computational modules implemented on different computer systems: desktop workstations, vector and parallel supercomputers. The exploratorium provides a highly interactive environment in which students can experiment with computational modules and visually compare algorithms, numerical techniques, performance and implementation related issues. Such a hands-on simulation and experimentation based learning will enable students to gain a deeper understanding of advanced concepts. The world wide web based exploratorium fosters the easy development of instructional material from research software.
A Time Redundancy Approach to TMR Failures Using Fault-State Likelihoods
Authors: K. G. Shin, Hagbae Kim
Venue: IEEE Transactions on Computers (1994)

Failure to establish a majority among the processing modules in a triple modular redundant (TMR) system, called a TMR failure, is detected by using two voters and a disagreement detector. Assuming that no more than one module becomes permanently faulty during the execution of a task, Re-execution of the task on the Same HardWare (RSHW) upon detection of a TMR failure becomes a cost-effective recovery method, because 1) the TMR system can mask the effects of one faulty module while RSHW can recover from nonpermanent faults, and 2) system reconfiguration-Replace the faulty HardWare, reload, and Restart (RHWR)-is expensive both in time and hardware. We propose an adaptive recovery method for TMR failures by "optimally" choosing either RSHW or RHWR based on the estimation of the costs involved. We apply the Bayes theorem to update the likelihoods of all possible states in the TMR system with each voting result. Upon detection of a TMR failure, the expected cost of RSHW is derived with these likelihoods and then compared with that of RHWR. RSHW will continue either until it recovers from the TMR failure or until the expected cost of RSHW becomes larger than that of RHWR. As the number of unsuccessful RSHW's increases, the probability of permanent fault(s) having caused the TMR failure will increase, which will, in turn, increase the cost of RSHW. Our simulation results show that the proposed method outperforms the conventional reconfiguration method using only RHWR under various conditions.
Design of Efficient Balanced Codes
Authors: S. Al-Bassam, B. Bose
Venue: IEEE Transactions on Computers (1994)

All words in a balanced code have equal number of ones and zeros. Denote by DC(n,k) a balanced (or dc-free) code of length n, and 2/sup k/ code words. We design an efficient DC(k+r, k) code with k=2/sup r+1//spl minus/0.8/spl radic/(r/spl minus/2). These codes are optimal up to the construction method, introduced by D.E. Knuth (1986).
A Constructive Approach to Stabilizability and Stabilization of a Class of nD Systems
Authors: Zhiping Lin, James Lam, Krzysztof Galkowski, Shengyuan Xu
Venue: Multidimensional Systems and Signal Processing (2001)

This paper presents a constructive approach to the problem of output feedback stabilizability and stabilization of a class of linear multidimensional ( nD, n>2) systems, whose varieties of the ideals generated by the reduced minors are infinite with respect to not more than two variables. The main idea of the proposed approach is to decompose the variety of an nD system in this class into a union of several varieties, each of which is defined by polynomials in just two variables. The new method can be considered as a combination of Gr&ouml;bner bases and existing results on two-dimensional (2D) digital filter stability tests and on stabilizability and stabilization of 2D systems. An example is illustrated.
Image Relaxation: Restoration and Feature Extraction
Authors: Wesley Snyder, Youn-Sik Han, Griff Bilbro, Ross Whitaker, Stephen Pizer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

The techniques of a posteriori image restoration and itera- tive image feature extraction are described and compared. Image feature extraction methods known as Graduated Nonconvexity (GNC), Variable Conductance Diffusion (VCD), Anisotropic Diffusion, and Biased Anisotropic Diffusion (BAD), which extract edges from noisy images, are compared with a restoration/feature extraction method known as Mean Field Annealing (MFA). All are shown to be performing the same basic operation: image relaxation. This equivalence shows the relationship between energy minimization methods and spatial analysis methods and between their respective parameters of temperature and scale. As a result of the equivalence, VCD is demonstrated to minimize a cost function, and that cost is specified explicitly. Furthermore, operations over scale space are shown to be a method of avoiding local minima.
An Evaluation of Starburst's Memory Resident Storage Component
Authors: T. J. Lehman, E. J. Shekita, L.-F. Cabrera
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

As part of the Starburst extensible database project, the authors have designed and implemented a memory resident storage component that can coexist along side traditional disk-oriented storage components. The memory resident storage component shares the code of Starburst's common services, such as query optimization, plan generation, query evaluation, record manipulation, and transaction management. The design of Starburst's memory resident storage component is discussed, contrasted with Starburst's default disk-oriented storage component, and compared to the performance of the two storage components using the Wisconsin Benchmarks. The results show that a memory resident storage component can perform significantly better than a disk-oriented storage component, even when the disk-oriented storage component has all of its data cached in memory. The benchmark results show that, by using memory resident techniques, overall query execution can be improved by up to a factor of four.
The $\cal P^k+1-\cal S^k$ Local Discontinuous Galerkin Method for Elliptic Equations
Authors: Clint Dawson
Venue: SIAM Journal on Numerical Analysis (2002)

A local discontinuous Galerkin (LDG) method using approximating spaces of order k+1 for the gradient and order k for the state variable, with $k \ge 0$, is presented for an elliptic boundary value problem. A priori error estimates are derived and numerical results presented, which demonstrate that this method is order k+1 for both the gradient and state variable in the L2 norm. This improves upon earlier LDG methods which use equal order approximating spaces for both variables, but lose an order of accuracy in the gradient approximation. This approach is also the first convergent LDG method which allows for piecewise constant approximations for the state variable.