ppxscal/embedding_network huggingface dataset:
Entropy numbers of vector-valued diagonal operators
Authors: Eduard Belinsky
Venue: Journal of Approximation Theory (2002)

Let <i>I<inf>α</inf>:l<inf>q</inf>(l<inf>p</inf><sup>2j</sup>) → l<inf>q</inf> (l<inf>∞</inf><sup>2j</sup>)</i> be a diagonal operator assigning to vector-coordinate <i>x<inf>j</inf></i> ∈ <i>l<inf>p</inf><sup>2j</sup></i> the vector-value <i>j<sup>-α</sup>x<inf>j</inf></i>. We prove the estimates of entropy numbers of <i>I<inf>α</inf></i>. The results confirm the conjecture stated in a recent paper by Cobos and Kühn, and extend their results to quasi-Banach setting.
Resolving Database Incompatibility: An Approach to Performing Relational Operations over Mismatched Domains
Authors: L. G. DeMichiel
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

A solution to the problem of supporting relational database operations despite domain mismatch is presented. Mismatched domains occur when information must be obtained from databases that were developed independently. Domain differences are resolved by mapping conflicting attributes to common domains by means of a mechanism of virtual attributes and then applying a set of extended relational operations to the resulting values. When one-one mappings cannot be established between domains, the values that result from attribute mappings may be partial. A set of extended relational operators that formalize operations over partial values and thus manipulate the incomplete information that results from resolving domain mismatch is defined.
The Intel IA-64 Compiler Code Generator
Authors: Jay Bharadwaj, William Y. Chen, Weihaw Chuang, Gerolf Hoflehner, Kishore Menezes, Kalyan Muthukumar, Jim Pierce
Venue: IEEE Micro (2000)

The IA-64 architecture was designed to allow the compiler to exploit a high level of instruction-level parallelism. Predication, control and data speculation, register rotation, loop branches, and a large register file are powerful features that the compiler can utilize to generate high-performance code. The task of making the best use of these features falls primarily upon the code-generation phase of the compiler. This article describes the important phases of the code generator of Intel's IA-64 production compiler. Specifically, it describes the predicator, global code scheduler, software pipeliner, and register allocator.
On Theory and Fast Algorithms for Error Correction in Residue Number System Product Codes
Authors: H. Krishna, J. -D. Sun
Venue: IEEE Transactions on Computers (1993)

The authors develop a coding theory approach to error control in residue number system product codes. Based on this coding theory framework, computationally efficient algorithms are derived for correcting single errors, double errors, and multiple errors, and simultaneously detecting multiple errors and additive overflow. These algorithms have lower computational complexity than previously known algorithms by at least an order of magnitude. In addition, it is noted that all the literature published thus far deals almost exclusively with single error correction.
Fault Diagnosis in Analog Circuits Using Element Modulation
Authors: Alvernon Walker, Winser E. Alexander, Parag K. Lala
Venue: IEEE Design Test (1992)

Analog fault diagnostic methods are reviewed. A branch fault-diagnosis technique that requires a single excitation source at one test frequency is introduced. The technique lets users construct linearly independent branch-diagnosis equations by modulating selected network elements. An example of the technique applied to a two-stage amplifier is given.
Flag-Transitive Affine Planes of Order 64
Authors: Alan R. Prince
Venue: Designs, Codes and Cryptography (1999)

We determine all the flag-transitive affine planes of order 64. There are three: the Desarguesian plane, the L&uuml;neburg plane and the plane given by a construction due to Kantor.
Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments
Authors: K. -C. Guh, C. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

A data structure is used to store materialized generalized transitive closure so that the evaluation of generalized transitive closure queries, deletions, and insertions of tuples can be performed efficiently in centralized and parallel environments. Some techniques to manage materialized transitive closure are presented and generalized to more general recursions. The proposed algorithms and the associated data structures are simple conceptually and in implementation. In a multiprocessor environment, the time complexities for insertion and deletion of the authors schemes are reduced. Only two rounds of communication are needed.
A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting
Authors: S. Jajodia, D. Mutchler
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

A hybrid scheme that integrates the static voting protocol and dynamic voting with linearly ordered copies is proposed. A stochastic model is used to compare the file availability afforded by the proposed hybrid scheme with the availabilities of voting, dynamic voting, and dynamic voting with linearly ordered copies. The hybrid scheme has the most availability of these four algorithms for all reasonable repair/failure ratios tested.
An Adaptive Access Method for Broadcast Data under an Error-Prone Mobile Environment
Authors: Shou-Chih Lo, Arbee L. P. Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

A ubiquitous information environment can be achieved by the mobile computing technologies. In this environment, users carrying their portable computers can retrieve local or remote information anywhere and at anytime. Data broadcast, with its advantages, has become a powerful means to disseminate data in wireless communications. Indexing methods for the broadcast data have been proposed to speedup access time and reduce power consumption. However, the influence of access failures has not been discussed. For the error-prone mobile environment, the occurrence of access failures is often due to disconnections, handoffs, and communication noises. In this paper, based on the distributed indexing scheme, we propose an adaptive access method which tolerates the access failures. The basic idea is to use index replication to recover from the access failures. One mechanism, named search range, is provided to dynamically record the range where the desired data item may exist. According to the search range, an unfinished search can be efficiently resumed by finding an available index replicate. A performance analysis is given to show the benefits of the method. Also, the concept of version bits is applied to deal with the updates of the broadcast data.
Peirce: A Tool for Experimenting with Abduction
Authors: W. F. Punch,  III, M. C. Tanner, J. R. Josephson, J. W. Smith
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

Abduction, defined as the stating and entertaining of a hypothesis, is addressed. The Red system for blood antibody identification, which comprises the authors' primary domain for research into abductive problem solving, is described. How viewing it and other abductive systems in terms of the goals is aiding in understanding abduction in general and allows experimentation with abduction techniques is discussed. A description is also given of Peirce, a tool providing a programmable interface between the goals of abduction and the abductive-assembly method for meeting those goals. Peirce's simple interface allows knowledge engineers to determine when a method is appropriate for invocation and how the process selects a method for invocation.
Sequential Debugging at a High Level of Abstraction
Authors: Ronald A. Olsson, Richard H. Crawford, W. Wilson Ho, Christopher E. Wee
Venue: IEEE Software (1991)

Efforts to build a better mousetrap for bugs in sequential programs are described. The resulting debugger, called Dalek, is intended to remedy limitations in conventional execution harnesses. Beyond the simple 'stop and look' features offered by typical breakpoint debuggers, Dalek offers a rich control and query language. Dalek's linguistic capabilities for treating sequences of program events offer an improvement over scratch paper as a compensatory technology for human memory limitations. Example applications are given. The very interactive, dynamic style of debugging encouraged by Dalek is discussed.
A Form-Based Natural Language Front-End to a CIM Database
Authors: Nabil R. Adam, Aryya Gangopadhyay
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

This paper presents a methodology for developing a user interface that combines fourth generation interface tools (SQL forms) with a natural language processor for a database management system. The natural language processor consists of an index, a lexicon, and a parser. The index is used to uniquely identify each form in the system through a conceptual representation of its purpose. The form fields specify database or nondatabase fields whose values are either entered by the user (user-defined) or are derived by the form (system-defined) in response to user input. A set of grammar rules are associated with each form. The lexicon consists of all words recognized by the system, their grammatical categories, roots, their associations (if any) with database objects and forms. The parser scans a natural language query to identify a form in a bottom-up fashion. The information requested in the user query is determined in a top-down manner by parsing through the grammar rules associated with the identified form. Extragrammatical inputs with limited deviations from the grammar rules are supported. Combining a natural language processor with SQL forms allows processing data modification tasks without violating any database integrity constraint, having duplicate records, or entering invalid data. A prototype natural language interface is described as a front-end to an ORACLE database for a computer integrated manufacturing system.
Design of optimum high-order finite-wordlength digital FIR filters with linear phase
Authors: Gennaro Evangelista
Venue: Signal Processing (2002)

A novel iterative quantization procedure for the design of finite wordlength linear-phase FIR filters of high order and minimum frequency domain error is proposed: a one-by-one increased number of filter coefficients is quantized where the augmented frequency domain error is re-minimized in each case. This new approach achieves a smaller frequency domain error than rounding of the optimal non-quantized coefficients. It is also successfully applied to the design of Lth band filters with minimum frequency domain error. FIR filters up to a filter order 1500 are designed.
Reduced-Memory Direct Digital Frequency Synthesizer Using Parabolic Initial Guess
Authors: Amir M. Sodagar, G. Roientan Lahiji, Ali Azarpeyvand
Venue: Analog Integrated Circuits and Signal Processing (2003)

Based on the parabolic approximation, which was recently introduced by the authors, a new architecture for sine-output direct digital frequency synthesizers has been developed. Due to using this approximation, and also considering several memory-reduction techniques, the proposed architecture is so designed that needs only 728 bits read-only memory for mapping a 12-bit phase address to 10-bit sine amplitude. The synthesizer has also been implemented and the experimental results show its desired operation and performance.
CLASP: Integrating Term Subsumption Systems and Production Systems
Authors: J. Yen, R. Neches, R. MacGregor
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The general architecture and an implementation of a classification-based production system (CLASP) are presented. The main objective is to extend the benefits of classification capabilities in frame systems to the developers of rule-based systems. Two major processes of CLASP, a semantic pattern matcher and a pattern classifier, are described. The semantic pattern matcher extends the pattern matching capabilities of rule-based systems through the use of terminological knowledge. The pattern classifier enables the system to compute a rule's specificity, which is useful for conflict resolution, based on the semantics of its left-hand side. The paradigm not only enhances the reasoning capabilities of rule-based systems, but also helps to reduce the cost of maintaining such systems because definitional knowledge is explicitly represented in a form that facilitates sharing and minimizes duplication of effort.
A Polynomial Time Algorithm for Reconfiguring Multiple-Track Models
Authors: T. A. Varvarigou, V. P. Roychowdhury, T. Kailth
Venue: IEEE Transactions on Computers (1993)

A polynomial time algorithm for solving the combinatorial problem that underlies the reconfiguration issues in the m1/2-track-m-spare model, for any arbitrary m, is discussed. The following combinatorial problem is solved: Given a set of points in a two-dimensional grid, find a set of noninteracting straight lines such that every line starts at a point and connects to one of the boundaries of the grid, there are no more than m lines overlapping in any row or column of the grid, and there are no near-miss situations. The time complexity of the algorithm is shown to be O(m mod F mod /sup 2/), where mod F is the number of faulty processors.
The neighborhood method and its coupling with the wavelet method for signal separation of chaotic signals
Authors: Satish T. S. Bukkapatnam, Soundar R. T. Kumara, Akhlesh Lakhtakia, Parthasarathy Srinivasan
Venue: Signal Processing (2002)

Signal separation, i.e., the elimination or suppression of extraneous components from measured signals, is an essential module of modern signal analysis. We report the development of two novel signal separation methods--(i) the neighborhood method (NM) and (ii) a modified wavelet method (MWM)--that seem to be aptly suited for signals acquired from machining process sensors, i.e., for chaotic signals with small, uniform Lyapunov exponents. For the NM, a variant of shadowing signal separation methods used for signal separation of chaotic signals, we establish theoretical bounds on performance under various noisy conditions and analyze its algorithmic complexity. Our MWM is an adaptation of Donoho's wavelet method to nonlinear, and possibly chaotic, signals with multiplicative noise. It incorporates certain features of the NM and it has lower algorithmic complexity than the NM, and is, therefore, more suitable for on-line implementation. Both methods were tested on chaotic signals corresponding to the reconstructed Rossler attractor. A discussion on the application of both methods to signals obtained from actual machining process sensors is provided in order to motivate their suitability to real-world nonlinear processes.
A Robust Snake Implementation; A Dual Active Contour
Authors: Steve R. Gunn, Mark S. Nixon
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

A conventional active contour formulation suffers difficulty in appropriate choice of an initial contour and values of parameters. Recent approaches have aimed to resolve these problems but can compromise other performance aspects. To relieve the problem in initialization, we use a dual active contour, which is combined with a local shape model to improve the parameterization. One contour expands from inside the target feature, the other contracts from the outside. The two contours are interlinked to provide a balanced technique with an ability to reject "weak" local energy minima.
Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation
Authors: Ning Jing, Yun-Wu Huang, Elke A. Rundensteiner
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Efficient path computation is essential for applications such as intelligent transportation systems (ITS) and network routing. In ITS navigation systems, many path requests can be submitted over the same, typically huge, transportation network within a small time window. While path precomputation (path view) would provide an efficient path query response, it raises three problems which must be addressed: 1) precomputed paths exceed the current computer main memory capacity for large networks; 2) disk-based solutions are too inefficient to meet the stringent requirements of these target applications; and 3) path views become too costly to update for large graphs (resulting in out-of-date query results). We propose a hierarchical encoded path view (HEPV) model that addresses all three problems. By hierarchically encoding partial paths, HEPV reduces the view encoding time, updating time and storage requirements beyond previously known path precomputation techniques, while significantly minimizing path retrieval time. We prove that paths retrieved over HEPV are optimal. We present complete solutions for all phases of the HEPV approach, including graph partitioning, hierarchy generation, path view encoding and updating, and path retrieval. In this paper, we also present an in-depth experimental evaluation of HEPV based on both synthetic and real GIS networks. Our results confirm that HEPV offers advantages over alternative path finding approaches in terms of performance and space efficiency.
Behavioral-Level DFT via Formal Operator Testability Measures
Authors: Sandhya Seshadri, Michael S. Hsiao
Venue: Journal of Electronic Testing: Theory and Applications (2002)

The focus of this research is on the testability analysis of the operators in the behavioral description prior to synthesis. The controllabilities of the inputs to an operator and the observabilities of the outputs of the operation are computed from the value ranges of the variables that serve as the inputs and outputs. Candidate hard-to-test operations are selected for testability enhancement based on the computed testability measures for all the involved operations in the behavioral description. While value ranges have been applied to compute variable testability measures, this paper addresses computation of the operator testability. Experimental results show that circuits synthesized using our technique exhibit higher testability than variable selection while keeping the area-performance overhead to a minimum.
Extension Modules in Behavioral Linear Systems Theory
Authors: Eva Zerz
Venue: Multidimensional Systems and Signal Processing (2001)

For certain signal spaces, the algebraic concept of extension modules yields a full classification of system theoretic properties such as controllability and autonomy. The present paper summarizes the results of various authors on the subject, and unifies them in the language of extension modules. The computation of extension modules is based on the computation of syzygies (i.e., kernels of module homomorphisms). This can be done constructively, using the theory of Gr&ouml;bner bases.
ATM connection handover in LEO satellite networks
Authors: Paul Grosser
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

There is interest in providing global communications service by using a Low Earth Orbit (LEO) satellite network, resulting in many proposals, the most ambitious of which is Teledesic, and the commercial implementation of constellations including Iridium and Globalstar. Many proposals intend to use ATM or an ATM-like switch fabric, and may also use ATM signaling. LEO satellite networks are mobile with respect to a fixed point on the earth, and therefore require an efficient ATM handover mechanism to provide continuous network connectivity. The Wireless ATM working group of the ATM Forum is standardising wireless extensions to ATM, of which connection handover is a major component. We identify weaknesses in the ATM Forum handover procedure when applied to LEO satellite networks, resulting in degradation of quality of service (QoS) during handover. We also propose a handover procedure, based on the handover framework established by the ATM Forum, which addresses these weaknesses and minimises the QoS degradation during handover.
Trigger Inheritance and Overriding in an Active Object Database System
Authors: Elisa Bertino, Giovanna Guerrini, Isabella Merlo
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

An active database is a database in which some operations are automatically executed when specified events happen and particular conditions are met. Several systems supporting active rules in an object-oriented data model have been proposed. However, several issues related to the integration of triggers with object-oriented modeling concepts have not been satisfactorily addressed. In this paper, we discuss issues related to trigger inheritance and refinement in the context of the Chimera active object-oriented data model. In particular, we introduce a semantics for an active object language that takes into account trigger inheritance and supports trigger overriding. Moreover, we state conditions on trigger overriding ensuring that trigger semantics is preserved in subclasses.
Defending Yourself: The Role of Intrusion Detection Systems
Authors: John McHugh, Alan Christie, Julia Allen
Venue: IEEE Software (2000)

Intrusion detection systems are an important component of defensive measures protecting computer systems and networks from abuse. This article considers the role of IDSs in an organization's overall defensive posture and provides guidelines for IDS deployment, operation, and maintenance.
Direct adaptive fuzzy output tracking control of nonlinear systems
Authors: Shaocheng Tong, Han-Xiong Li
Venue: Fuzzy Sets and Systems (2002)

A stable direct adaptive fuzzy output tracking control scheme is developed for the single-input-single-output (SISO) unknown nonlinear systems. Using a high-gain observer, the proposed adaptive fuzzy algorithm does not require the state variables to be measurable. First, a direct adaptive fuzzy state controller is constructed with the aid of its H∞ control technique to achieve the H∞ tracking performance. Afterwards, a high-gain observer is used to estimate the system states, by which the above adaptive fuzzy state controller becomes an adaptive fuzzy output feedback control. The proposed control scheme can guarantee the stability of the closed-loop system and the good tracking performance as well.
Are We Forgetting the Risks of Information Technology?
Authors: Thomas A. Longstaff, Clyde Chittister, Rich Pethia, Yacov Y. Haimes
Venue: Computer (2000)

The emerging dominance of software in the lifecycle of our information systems, coupled with the risk and uncertainty associated with its development and maintenance, are increasing information systems vulnerability. Global interconnected-ness through the Internet and the increasing use of supervisory control and data acquisition systems to remotely operate the critical infrastructure through the telecommunications network have rendered our information systems more vulnerable to intrusion and the transmission of malicious misinformation and signals.For all practical purposes, international boundaries have been eliminated in cyber-space. The growth of information technology and almost universal access to computers have enabled hackers and would-be terrorists to attack information systems and critical infrastructures worldwide.The authors describe the hierarchical holographic modeling framework, which promotes a systemic process for assessing risk to critical infrastructures.