ppxscal/embedding_network huggingface dataset:
Cutting Angle Method and a Local Search
Authors: A. M. Bagirov, A. M. Rubinov
Venue: Journal of Global Optimization (2003)

The paper deals with combinations of the cutting angle method in global optimization and a local search. We propose to use special transformed objective functions for each intermediate use of the cutting angle method. We report results of numerical experiments which demonstrate that the proposed approach is very beneficial in the search for a global minimum.
On Mapping Complete Binary Trees into Grids and Extended Grids
Authors: Y.-B. Lin, I. H. Sudborough, Z. Miller, D. Pritikin, M. Perkel
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

We consider one-to-one, congestion one layouts of complete binary trees into 2-D grids and extended 2-D grids.
Verification of Arithmetic Functions with Binary Moment Diagrams
Authors: Randy E. Bryant, Yirng Chen
Venue:  (1994)

Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitary functions from Boolean variables to real, rational, or integer values. BMDs can thus model the functionality of data path circuits operating over word level data. Many important functions, including integer multiplication, that cannot be represented efficiently at the bit level with BDDs have simple representations at the word level with BMDs. Furthermore, BMDs can represent Boolean functions with around the same complexity as BDDs. We propose a hierarchical approach to verifying arithmetic circuits, here basic building blocks are first shown to implement a word-level specification. The overall circuit functionality is then verified at the word level. Multipliers with word sizes of up to 62 bits have been verified by this technique.
Bringing computational steering to the user
Authors: Jarke J. Wijk, Robert Liere, Jurriaan D. Mulder
Venue:  (1997)

Computational steering is a technique that combines simulation and visualization. The user is continuously provided with visual feedback about the state of the simulation, and can change parameters on the fly. Designers can vary parameters to optimize their product, users can detect errors in the input early, researchers can do qualitative sensitivity analyses easily. The implementation of computational steering is very tedious. It requires knowledge of the simulation, visualization, user interfacing, and data communication. In this paper we discuss an environment that enables users to implement and use computational steering effectively without much support from user interface experts. We show how the environment is applied to various applications.
QoS-Adaptive Multimedia Resource Regulation Scheme Based on Priority Classification
Authors: Gang Lin, Xueliang Yang
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In this paper, we propose a new QoS-Adaptive resource regulation scheme for multimedia stream. As we take the different QoS requirement of every link and different media priorities into account, we present a new model base on Priority Classification. We also present a Polling Agent on the side of client that make the admission control more flexible. First, the architecture of multimedia transmission is described, and the regulation strategy and method of network detection are presented. Secondly, a resource management algorithm is given to adaptively allocate the network bandwidth to every link of stream. Finally, simulation results are given to demonstrate the effectiveness of our new proposed scheme and algorithms.
ITX Programmer''s Guide
Authors: Donna Bergmark
Venue:  (1999)

ITX is a set of Java packages which allow one to write telephony applications in Java. (Some sample applications are provided with the ITX distribution.) This Guide introduces the reader to the ITX Application Programming Interface (API), starting with an overview. Subsequent sections explain each component of the API in more detail.
Parikh''s Theorem in Commutative Kleene Algebra
Authors: Mark Hopkins, Dexter Kozen
Venue:  (1999)

Parikh''s Theorem says that the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the following general theorem of commutative Kleene algebra, of which Parikh''s and Pilling''s theorems are special cases: Every system of polynomial inequalities $f_i(x_1,\ldots,x_n) \leq x_i$, $1\leq i\leq n$, over a commutative Kleene algebra $K$ has a unique least solution in $K^n$; moreover, the components of the solution are given by polynomials in the coefficients of the $f_i$. We also give a closed-form solution in terms of the Jacobian matrix.
On the Maximum Number of Equilateral Triangles II
Authors: Abrego Bernardo, Fernandez Silvia
Venue:  (1999)

Erd&#x00F6;s and Purdy raised the problem of finding the maximum number of equilateral triangles determined by a set of $n$ points in ${\Bbb R}^{d}$. This question is investigated in the first part of this series. Here we study some variations where the sets in consideration are in convex or general position. Non trivial bounds are given for these problems, as well as for the corresponding questions where the triangles at issue have unit length side.
Estimation of Diffuse and Specular Appearance
Authors: Stephen Lin, Sang W. Lee
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

To account for the variability of object appearance due to differences in illumination, attention has recently been focused on representing the set of images for all possible lighting conditions. Approaches that address this problem have primarily focused on lighting differences for diffuse reflection using the Lambertian model; however, specular reflections can additionally present considerable disparity in appearance.We present a method for representing illumination appearance for both diffuse and specular reflections for objects of uniform surface roughness using four photometric images. This approach uses separation of reflection components, extracts surface reflectances and roughness, and produces arbitrary lighting images without explicit computation of surface shape. Experimental results demonstrate the validity of the proposed method for constructing diffuse and specular appearances.
Preventing Piracy, Reverse Engineering, and Tampering
Authors: Gleb Naumovich, Nasir Memon
Venue: Computer (2003)

As computing becomes pervasive, concerns about data protection have taken on new urgency. What makes securing digital data so difficult is that it is rarely static rather, data is manipulated by software, often in a net-worked environment.Software is increasingly being distributed as mobile code in architecture-independent formats. Using reverse engineering, malicious parties can steal the intellectual property associated with such code with relative ease. Three promising techniques under development--tamper proofing, obfuscation, and watermarking--offer hope for providing more efficient and effective mechanisms for protecting software.
Fault avoidance and recovery for distributed multimedia multicast
Authors: Y. Xu, D. A. Adjeroh, C. U. Orji
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

We present a fault avoidance and recovery algorithm designed for distributed multimedia multicast. Our algorithm is focused on fault avoidance to provide heterogeneous quality of service (QoS) guarantees to applications. We adopt a receiver-oriented approach to fault avoidance and recovery to achieve scalability. The receiver-oriented approach also addresses the heterogeneity of distributed multicast. The QoS of an application is used as an important parameter for fault detection. Both the fault avoidance and fault recovery aspects of the algorithm are based on the estimate of the QoS parameter. To suppress the overhead of multicast, a two-phase commit protocol is used in the algorithm. The key contribution of the algorithm lies in combining proactive and reactive control: (1) to avoid congestion in the network prior to the occurrence of error; (2) to provide heterogeneous QoS to applications by QoS-based fault detection and control; (3) to achieve scalability of distributed multimedia multicasts by receiver-oriented fault control and message suppression. Our algorithm makes very few assumptions about the underlying network, hence it can be easily integrated with popular multicast protocols.
Expert-System Development in Soar: A Tutorial
Authors: Erik Altmann, Gregg R. Yost
Venue:  (1992)

This is a tutorial for building an expert system in Soar, using the TAQL programming language. It provides a self-contained reference for the end-to-end development of a Soar system that accomplishes a particular task. It presents a natural-language task description, a system design, and a sample implementation, including a documented code listing. It also discusses chunking (Soar''s learning mechanism) in the context of the sample implementation.
On an Improved Unusual Stabilized Finite Element Method for theAdvective-Reactive-Diffusive Equation
Authors: L. P. Franca, F. Valentin
Venue:  (1999)

An improved unusual finite element method is studied herein for a second-order linear scalar differential equation including a zero order term. The method consists in subtracting from the standard Galerkin method a mesh dependent term suggested by static condensation of the bubbles. Based on this idea, a new stabilized parameter is constructed, which improves accuracy of the solution. Several numerical tests attest the efficiency of the present method and an error analysis is perfomed.
Evaluation of Bandwidth Broker Signaling
Authors: Manuel Guenter, Torsten Braun
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

The Differentiated Service (DiffServ) architecture for the Internet implements a scalable mechanism for quality-of-service (QoS) provisioning. Bandwidth brokers represent the instances of the architecture, that automate the provisioning of a DiffServ service between network domains. Although several bandwidth broker implementations have been proposed, the alternatives and tradeoffs of the different viable approaches of inter-broker communication were not studied up to now. This paper presents the broker signaling tradeoffs considered in the context of a DiffServ scenario used by the Swiss National Science Foundation project CATI, and it presents results gathered by simulations.
Network Processors, 1 edition
Authors: Panos Lekkas
Venue:  (2003)

Table of contentsPART 1: FUNDAMENTALSChapter 1: The Evolution of Network Technology: Distributed Computing and the Convergence of NetworksChapter 2: Network Processors: JustificationChapter 3: Packet ProcessingPART 2: NETWORK PROCESSOR ARCHITECTUREChapter 4: IBM PowerNP(tm)Chapter 5: Intel IXA(tm) Network ProcessorsChapter 6: AMCC nP(tm) Family of Network ProcessorsChapter 7: Agere PayloadPlus(r) Family of Network ProcessorsChapter 8: Motorola's C-Port(tm) Family of Network ProcessorsChapter 9: Other NPU ArchitecturesChapter 10: Alternative Approaches to Network Processing: Net ASICs and Designing with IP CoresPART 3: PERIPHERAL CHIPS SUPPORTING NETWORK PROCESSORS: STORAGE PROCESSORS, CLASSIFICATION PROCESSORS, SEARCH ENGINES, SWITCH FABRICS, AND TRAFFIC MANAGERSChapter 11: Storage Network Processors (SNPs)Chapter 12: Search EnginesChapter 13: Classification ProcessorsChapter 14: Switch FabricsChapter 15: Traffic ManagersPART 4: PUTTING EVERYTHING TOGETHERChapter 16: Systems Engineering IssuesPART 5: SECURITY COPROCESSORSChapter 17: Security CoprocessorsLIST OF ACRONYMSAPPENDIX I: OVERVIEW OF NETWORK-PROCESSOR PRODUCTS AND PLATFORMSAPPENDIX II: TYPICAL TRAFFIC LOAD (in Millions of Packets per Second) CORRESPONDENCE AT VARIOUS LINK SPEEDS AND PACKET SIZESAPPENDIX III: STANDARDIZATION EFFORTS IN NETWORK PROCESSINGINDEX
Design, Manufacture and Test - Quality Test Estimation
Authors: J. M. Gilbert, D. R. Johnson
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

This paper describes the adaptation of the Conformability Analysis technique to the assessment of functional, manufacturing and test capability of PCB level electronic circuits. It combines process capability indices and Failure Modes and Effects Analysis (FMEA) with cost mapping to allow the quality costs associated with design and manufacture induced faults to be estimated and the effectiveness of test strategies in reducing these costs to be determined. It allows the trade-off between these costs and the component, manufacturing process and test costs to be explored. The technique is particularly applicable to the relatively low complexity analogue & mixed signal, safety critical circuits typically found in automotive and aircraft electronic systems.
The Permanent Requires Large Uniform Threshold Circuits
Authors: Eric Allender
Venue:  (1997)

A recent paper by Caussinus, McKenzie, Therien, and Vollmer shows that there are problems in the counting hierarchy that require superpolynomial-size uniform TC^0 circuits. Their proof uses ``leaf languages'''' as a tool in obtaining their separations, and their proof does not immediately yield larger lower bounds for the complexity of these problems, and it also does not yield a lower bound for any particular problem at any fixed level of the counting hierarchy. (It only shows that hard problems must exist at some level.) In this paper, we give a simple direct proof, showing that any problem that is hard for the complexity class C_=P requires more than size T(n), if for all k, T^{(k)}(n) = o(2^n). Thus, in particular, the permanent, and any problem hard for PP or #P require circuits of this size. Related and somewhat weaker lower bounds are also presented, extending the theorem of (Caussinus et al.) showing that ACC^0 is properly contained in ModPH. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
EuroWordNet Subset2 for Dutch, Spanish and Italian
Authors: Piek Vossen, Laura Bloksma, Salvador Climent, Maria A Marti, Mariona Taule, Julio Gonzalo, Irina Chugur, M. F Verdejo, Gerard Escudero, German Rigau, Horacio Rodriguez, Antonietta Alonge, Francesca Bertagna, Rita Marinelli, Adriana Roventini, Luca Tarasi
Venue:  (1998)

This deliverable describes the wordnets for Dutch, Italian and Spanish after the second building round. The first versions of the wordnets have been compared and the results of the comparison have been used to improve the wordnets. The new comparison, described in this document, indicates a major progress towards the final state of the wordnets. TEL:: +39 50 560481
Optimal Code Motion in the Presence of Large Expressions
Authors: Oliver Rüthing
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

Common algorithms for partial redundancy elimination that are sensitive to register pressure are designed from a single-expression point of view. For each computation under investigation unnecessary code motion is avoided as far as possible. Unfortunately, such a view is only adequate when dealing with a flat universe of expressions. In a more realistic setting where both composite expressions and their subexpressions are subjected to code motion trade-offs among the lifetimes of symbolic registers have to be taken into account. In this paper we present a polynomial time algorithm for the elimination of partially redundant computations that uniformly minimizes the total number of lifetime ranges at each program point. This is achieved by a refinement of our algorithm for lazy code motion that incorporates optimal register trade-offs being computed by means of maximum bipartite graph matchings.
Design and evaluation of an environment APE for automatic parallelization of programs
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

In this paper, we present the design and evaluation of a compiler system, called APE, for automatic parallelization of scientific and engineering applications on distributed memory computers. APE is built on top of SUIF compiler. It extends SUIF with capabilities in parallelizing loops with non-uniform cross-iteration dependencies, and in handling loops that have indirect access patterns. We have evaluated the effectiveness of SUIF with several CFD test codes, and found that SUIF handles uniform loops over dense and regular data structures very well. For non-uniform loops, an innovative and efficient parallelization approach based on convex theory have been proposed and is being implemented. We have also presented a class of scalable algorithms for parallel distribution and redistribution of unstructured data structures during parallelizing irregular loops.
Dynamically Scheduling VLIW Instructions with Dependency Information
Authors: Sunghyun Jee, Kannappan Palaniappan
Venue: Proceedings of the Sixth Annual Workshop on Interaction between Compilers and Computer Architectures (2002)

This paper proposes balancing scheduling effort more evenly between the compiler and the processor, by introducing dynamically scheduled Very Long Instruction Word (VLIW) instructions. Dynamically Instruction Scheduled VLIW (DISVLIW) processor is aimed specially at dynamic scheduling VLIW instructions with dependency information. The DISVLIW processor dynamically schedules each instruction within long instructions using functional unit and dynamic scheduler pairs. Every dynamic scheduler dynamically checks for data dependencies and resource collisions while scheduling each instruction. This scheduling is especially effective in applications containing loops. We simulate the architecture and show that the DISVLIW processor performs significantly better than the VLIW processor for a wide range of cache sizes and across various numerical benchmark applications.
Plural: a computer algebra system for noncommutative polynomial algebras
Authors: Viktor Levandovskyy, Hans Schönemann
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

Singular is a computer algebra system developed for efficient computations with polynomials. We describe Plural as an extension of Singular to noncommutative polynomial rings (G--/GR--algebras): to which structures does it apply, the prerequisites to monomial orderings, left- and two--sided Gr"obner bases. The usual criteria to avoid "useless pairs" are revisited for their applicability in the case of G--/GR--algebras. Benchmark tests are used to evaluate the concepts compare them with other systems.
Intelligent Digitization of Arabic Characters
Venue: Proceedings of the International Conference on Information Visualisation (2000)

There are currently a number of initiatives aiming at introducing the digital age to the Arab world. This includes efforts to expose new technology for both home and commercial usage. Of the leading companies in this area is Sakhr Software, who has just launched their program (SakhrMedia) to support the learning process in the local educational institutions. The objective, here, is to meet the greater requirement of computerizing both the techniques and knowledge which has thus far been oriented alongside traditional platforms.To this regards efforts have been made to computerize Arabic typography and language (often referred to as Arabization). This is vitally important not just to meet everyday (current) needs, but also to harmonize for the Arab audience the interaction with worldwide-accepted application packages, as well as the Internet.The purpose of this paper is to revisit the digitizing process (sometimes called rasterization) of the most valued aspects of a language, its character set. Through using a geometric modeling approach, a computer system has been developed to extract and store features of Arabic fonts. Such a process lends itself to fast reconstruction and rendering of characters, and for text recognition techniques. The discussion, here, provides an insight to the workings of the system, with view to assisting the digitization process for the Arabic case.
Classification Tree Models of Software Quality Over Multiple Releases
Authors: Taghi M. Khoshgoftaar, Edward B. Allen, Wendell D. Jones, John P. Hudepohl
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Software quality models are tools for focusing software enhancement efforts. Such efforts are essential for mission-critical embedded software, such as telecommunications systems, because customer- discovered faults have very serious consequences and are very expensive to repair. This paper presents an empirical study that evaluated software quality models over several releases to address the question, "How long will a model yield useful predictions?"This paper also introduces the Classification And Regression Trees ( cart ) algorithm to software reliability engineering practitioners. We present our method for exploiting cart features to achieve a preferred balance between the two types of misclassification rates. This is desirable because misclassifications of fault-prone modules often have much more severe consequences than misclassifications of those that are not fault-prone.We developed two classification-tree models based on four consecutive releases of a very large legacy telecommunications system. Forty-two software product, process, and execution metrics were candidate predictors. The first software quality model used measurements of the first release as the training data set and measurements of the subsequent three releases as evaluation data sets. The second model used measurements of the second release as the training data set and measurements of the subsequent two releases as evaluation data sets. Both models had accuracy that would be useful to developers. One might suppose that software quality models lose their value very quickly over successive releases due to evolution of the product and the underlying development processes. We found the models remained useful over all the releases studied.Much of the software metrics literature has shown that software product metrics can be significant predictors of fault-prone modules. This case study showed that process and execution metrics can also be significant predictors.
Processor Allocation in k-ary n-cube Multiprocessors
Authors: Po-Jen Chuang, Chih-Ming Wu
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

Composed of various topologies, the k-ary n-cube system is desirable for accepting and executing topologically different tasks. In this paper, we propose a new allocation strategy to utilize the large amount of processor resources in the k-ary n-cubes. Our strategy is an extension of the TC strategy on hypercubes and is able to recognize all subcubes with different topologies. Simulation results show that with such full subcube recognition ability and no internal fragmentation, our strategy depicts constantly better performance than the other strategies, such as the Free-list strategy on k-ary n-cubes and the Sniffing strategy.
APN functions in odd characteristic
Authors: Hans Dobbertin, Donald Mills, Eva Nuria Müller, Alexander Pott, Wolfgang Willems
Venue: Discrete Mathematics (2003)

Recently, the investigation of so-called almost perfect nonlinear (APN) functions has attracted a lot of research interest. In particular, the case of even characteristic has been investigated. The notion of "APN" has been extended to the nonbinary case and several such mappings have been discovered. In this paper, we add some more examples. Our results explain some of the "open cases" in the tables of Helleseth et al. (IEEE Trans. Inform. Theory 45 (1999) 475).