ppxscal/embedding_network huggingface dataset:
Fast sorting algorithms on reconfigurable array of processors with optical buses
Authors: M. Hamdi, J. Tong, C. W. Kin
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

The Reconfigurable Array with Spanning Optical Buses (RASOB) has recently received a lot of attention from the research community. By taking advantage of the unique properties of optical transmission, the RASOB provides flexible reconfiguration and strong connectivities with low hardware and control complexities. In this paper, we use this architecture for the design of efficient sorting algorithms on the 1-D RASOB and the 2-D RASOB. Our parallel sorting algorithm on the 1-D RASOB, which sorts N data items using N processors in O(k) time where k is the size of the data items to be in bits, is based on a novel divide-and-conquer scheme. On the other hand, our parallel sorting algorithm on the 2-D RASOB is based on the sorting algorithm on the 1-D RASOB in conjunction with the well known Rotatesort algorithm. This algorithm sorts N data items on a 2-D RASOB of size N in O(k) time. These sorting algorithms outperform state-of-the-art sorting algorithms on reconfigurable arrays of processors with electronic buses.
An inequality limiting the number of maximal frequent sets
Authors: V. G E. Boros, Khachiyan L., Makino K.
Venue:  (2000)

Given an arbitrary $m\times n$ binary matrix $A$ and a threshold $t \in \{1, \ldots, m\}$, a subset $C$ of the columns is called $t$-{\em frequent} if there are at least $t$ rows having a $1$ in each of these columns, and otherwise $C$ is called $t$-{\em infrequent}. Denoting by $\alpha$ the number of maximal $t$-frequent, and by $\beta$ the number of minimal $t$-infrequent column sets in the given matrix $A$, we prove that the inequality $\alpha \leq (m-t+1)\beta$ holds. This inequality is sharp, and allows for an incremental quasi-polynomial algorithm for generating all minimal $t$-infrequent sets, while the analogous problem for maximal $t$-frequent sets is NP-hard. Our proof is based on an inequality from extremal set theory, which may be of independent interest.
Mr. Excel on Excel
Authors: Bill Jelen, Joseph Rubin
Venue:  (2003)

:Designed for accounting and other business professionals, this guide to Microsoft Excel provides information on this feature-rich product that will make users more proficient. Described in detail are the techniques that were introduced since the switch from Lotus to Excel took place in the 1990s. Tips designed to make Excel use more efficient include how to prevent duplicate data entry, deleting unwanted links, importing and refreshing data from the Internet, and adding a running balance column to a pivot table. Other advanced techniques include combining the Vlookup function with a combo box to extract data, comparing lists without using formulas, and adding comments to formulas. Also included are instructions on features such as formulas that calculate loan payments, writing a program, and VBA techniques.About the Author:Bill Jelen is the principal of the MrExcel.com, a leading Excel website. He provides custom Excel and Access applications for hundreds of clients and is the author of Guerilla Data Analysis Using Microsoft Excel. He lives in Akron, Ohio. Joseph Rubin is a certified public accountant and an independent consultant specializing in the development of applications using Microsoft Excel for the financial industry. He has served as a CFO, controller, and has run a private CPA practice.
Higher Order Horn Clauses
Authors: Gopalan Nadathur, Dale Miller
Venue:  (1988)

A generalization of Horn clauses to a higher-order logic is described and examined as a basis for logic programming. In qualitative terms, these higher-order Horn clauses are obtained from the first-order ones by replacing first-order terms with simply typed $\lambda$-terms and by permitting quantification over all occurrences of function symbols and some occurrences of predicate symbols. Several proof-theoretic results concerning these extended clauses are presented. One result shows that although the substitutions for predicate variables can be quite complex in general, the substitutions necessary in the context of higher-order Horn clauses are tightly constrained. This observation is used to show that these higher-order formulas can specify computations in a fashion similar to first-order Horn clauses. A complete theorem proving procedure is also described for the extension. This procedure is obtained by interweaving higher-order unification with backchaining and goal reductions, and constitutes a higher-order generalization of SLD-resolution. These results have a practical realization in the higher-order logic programming language called $\lambda$Prolog.
A Probabilistic Approach to Language Understanding
Authors: Robert P Goldman
Venue:  (1990)

We discuss a new framework for text understanding. Three major design decisions characterize this approach. First, we take the problem of text understanding to be a particular case of the general problem of abductive inference: reasoning from effects to causes. Second, we use probability theory to handle the uncertainty which arises in abductive inference in general, and natural language understanding in particular. Finally, we treat all aspects of the text understanding problem in a unified way. All aspects of natural language processing are treated in the same framework, allowing us to integrate syntactic, semantic and pragmatic constraints. In order to apply probability theory to this problem, we have developed a probabilistic model of text understanding. To make it practical to use this model, we have devised a way of incrementally constructing and evaluating belief networks that is applicable to other abduction problems. We have written a program, Wimp3, to experiment with this framework.
A New Two Dimensional Line Clipping Algorithm for Small Windows
Authors: J. D. Day
Venue:  (1991)

A new algorithm for clipping lines against upright rectangular windows is described. It is suitable for computations in both object space (floating point arithmetic) and image space (integer arithmetic). The algorithm is compared with other object and image space algorithms and shown to be superior for small windows. 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
QuarkXPress 6 Bible
Authors: Galen Gruman, Barbara Assadi
Venue:  (2003)

:This comprehensive classic to the brand-new release of QuarkXPress explains through visual examples how to use the layout program in the context of real work. Written from the perspective of the real-world designer or production specialist, the material addresses the vast audience of QXP users who have been awaiting the OS X version of the product, as well as millions of Windows users.
On Census Complexity and Sparseness of NP Complete Sets
Authors: Juris Hartmanis, Stephen R. Mahaney
Venue:  (1980)

In this note we show that if there are sparse NP complete sets with a polynomial time computable census function then $P=NP$. We also derive related results about the complexity of the census function for context-sensitive languages and $\log n$-tape bounded languages.
Formalized epistemology in a philosophical perspective
Authors: Hervé Barreau
Venue: Quantum mechanics, mathematics, cognition and action: proposals for a formalized epistemology (2002)

The need for a formalized epistemology is recognized by all scholars who think that the relativity of all sciences must not be referred to a social relativism. In XXth century, Husserl was the protagonist of such an epistemic philosophy. But this philosophy was more successful in social and human sciences than in natural sciences. In this latter domain, quantum mechanics obeys the requirements of a Kantien perspective in a more precise sense that was the case with Newtonian mechanics.
A New Warping Technique for Normalizing Likelihood of Multiple Classifiers and Its Effectiveness in Combined On-line/Off-line Japanese Character Recognition
Authors: Ondrej Velek, Stefan Jaeger, Masaki Nakagawa
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We propose a new technique for normalizing likelihood of multiple classifiers prior to their combination. Our technique takes classifier-specific likelihood characteristics into account and maps them to a common, ideal characteristic allowing fair combination under arbitrary combination schemes. For each classifier, a simple warping process aligns the likelihood with the accumulated recognition rate, so that recognition rate becomes a uniformly increasing function of likelihood. For combining normalized likelihood values, we investigate several elementary combination rules, such as sum-rule or max-rule. We achieved a significant performance gain of more than five percent, compared to the best single recognition rate,showing both the effectiveness of our method for classifier combination and the benefit of combining on-line Japanese character recognition with stroke order and stroke number independent off-line recognition. Moreover, our experiments provide additional empirical evidence for the good performance of the sum rule in comparison with other elementary combination rules, as has already been observed by other research groups.
J2EE Open Source Toolkit: Building an Enterprise Platform with Open Source Tools (Java Open Source library)
Authors: John Bell, James Lambros
Venue:  (2003)

:Free J2EE shows experienced Java developers how to build a complete and integrated J2EE development environment with best-of-breed open source tools. The benefits are a free, fast and reliable development environment for J2EE. The book will also show how and when to use open source tools with commercial platforms like WebLogic and WebSphere to boost development speed and efficiency.Free J2EE begins with an overview of J2EE architecture, showing how open source tools can be used to support each component of the architecture. The authors provide a concise overview of the tools, along with selection criteria.They then drill down into each of the major tool categories for building an open source platform, focusing on integration of best of breed tools in each category.The companion Website provides original source code created for this book, including a fully working example of the integrated development environment. It also provides a single site from which readers can download all of the tools described in the book to build their own J2EE platform, plus a section for news and technology updates.
Preconditioners for Nonconforming Element Discrete Problems. I
Authors: Jin Gu, Zian Hu
Venue:  (1995)

We consider the problem of solving the algebraic system of equations arising from the discretization of self-adjoint elliptic problems via the nonconforming finite elements, which are continuous at the quasi-uniform mesh nodes. The condition number of the algebraic system is proved to be O(h-2), where h is the mesh parameter. By substructuring, also known as nonoverlap domain decomposition, we construct a series of preconditioners. The resulting preconditioned algorithms are well suited to emerging parallel computing architectures. A basic theory for the analysis of the condition number of the preconditioned system, which determines the iterative convergence rate of the algorithm, is presented. He condition number of the preconditioned system is bounded by O((1+ln H/h)^2) or O((1+ln H/h)^3), which is the same as that in the conforming finite element discrete cases. Here, H is the maximum diameter of the subdomains.
Proof of a Conjecture of Bollob&#x00E1;s and Eldridge for Graphs with Maximum Degree 3
Authors: Csaba Bela, Shokoufandeh Ali, Szemeredi Endre
Venue:  (1999)

Let $G_1$ and $G_2$ be graphs on $n$ vertices. If there are edge-disjoint copies of $G_1$ and $G_2$ in $K_n$, then we say there is a packing of $G_1$ and $G_2$. A conjecture of Bollob\''as and Eldridge ~\cite{be78} asserts that, if $(\Delta(G_1)+1)(\Delta(G_2)+1)\le n+1$ then there is a packing of $G_1$ and $G_2$. We prove this conjecture when $\Delta(G_1)=3$, for sufficiently large $n$.
Efficiently Detecting Arbitrary Shaped Clusters in Image Databases
Authors: Dantong Yu, Surojit Chatterjee, Aidong Zhang
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Image databases contain data with high dimensions. Finding interesting patterns in these databases poses a very challenging problem because of the scalability, lack of domain knowledge and complex structures of the embedded clusters. High dimensionality adds severely to the scalability problem. In this paper, we introduce WaveCluster+, a novel approach to apply wavelet-based techniques for clustering high dimensional data. Using a hash-based data structure to represent the dataset, we offer a detailed technique to apply wavelet transform on the hashed feature space. We demonstrate that the cost of clustering can be reduced dramatically yet maintaining all the advantages of wavelet-based clustering. This hash-based data representation can be applied for any grid-based clustering approaches. The experimental results show the effectiveness and efficiency of our method on high dimensional datasets.
A set of efficient semaphoring instructions
Authors: Dan Oestreicher, J. I. Strauss
Venue: ACM SIGOPS Operating Systems Review (1980)

A set of instructions is described which facilitates the construction of an operating system implemented as a set of cooperating processes. An unusual feature of the instructions is that they are 'hybrid' -- i.e. they may either operate as conventional machine instructions or give rise to a supervisor - call interrupt, depending on circumstances.
The role of functional prototyping in model validation
Authors: E. Kemp, D. Pacitto, E. Todd, D. Gray
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Summary form only given. Within the KADS framework, a model of domain expertise is built prior to system implementation. Before making important design decisions, it is necessary to check that this model correctly represents the domain and its problem solving aspects. In this paper, a framework which employs functional prototyping for validating a model of expertise is described. Before building the prototype, an object-oriented knowledge representation model is developed based on the model of expertise. This knowledge representation model provides the structure of the prototype. Since mistakes may be made in the translation from one model to another, the knowledge representation model has to be verified to ensure that it accurately depicts the information in the model of expertise. The functional prototype can then be constructed and verified. Finally, the domain experts can test out the functional prototype to see whether it accurately models the domain. This framework was applied to the summer-autumn management domain. Two important areas were prototyped: feed budgeting and production level analysis.
Adobe Illustrator Scripting with Visual Basic and AppleScript
Authors: Ethan Wilde
Venue:  (2002)

:UntitledIf you're a designer, production pro, or Illustrator power user, chances are you repeat tedious tasks over and over in your daily work. Think about it: How many times have you performed the same step on hundreds of images? Save timeand wear-and-tear on your wristswith Adobe Illustrator Scripting, the clearest, quickest route to reducing your workload and making life easier through the power of scripting. Adobe Illustrator Scripting combines the in-depth coverage of a reference book with actual hands-on training that shows you how to create and run scripts in Illustrator, using both AppleScript (for Mac users) and Visual Basic (for the PC). You'll learn how to automate tasks such as linking graphics to a database, transforming images, and performing batch processes. There's no better time to try your hand at scripting, even if you have no prior experiencewith Illustrator 10, the program is more scriptable than ever before. Adobe Illustrator Scripting will help you unlock the true potential of this workhorse application.
The Size and Growth Rate of the Internet
Authors: Coffman K. G., Odlyzko Andrew
Venue:  (1999)

The public Internet is currently far smaller, in both capacity and traffic, than the switched voice network. The private line networks are considerably larger in aggregate capacity than the Internet. They are about as large as the voice network in the U.S., but carry less traffic. On the other hand, the growth rate of traffic on the public Internet, while lower than is often cited, is still about 100% per year, much higher than for traffic on other networks. Hence, if present growth trends continue, data traffic in the U.S. will overtake voice traffic around the year 2002 and will be dominated by the Internet.
Security associations: building blocks for secure communications
Authors: W. D. Maughan, A. B. Reiss, M. J. Schertler
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

History tells us that Julius Cesar shifted each letter in his messages to his generals by three places in the alphabet. The generals knew to shift back by three letters to read the message. Securing information for transfer between entities requires an agreement on how the information will be protected. Modern science and technology has brought more advanced methods of protecting information, but the basic need for an agreement between entities desiring to communicate securely still exists. In modern terms this agreement is a security association (SA). There are varying definitions of a security association in current standards and this paper attempts to clarify, these definitions. Security protocols requiring security associations as well as emerging protocols that establish and manage security associations are presented. If future global interoperability is to be provided securely one of the first building blocks will be the ability to negotiate and establish security associations. Therefore, issues that must be resolved for future global interoperability are discussed. Our work to create a network security research environment for future global needs is also presented.
Scheduling multicasts on unit-capacity trees and meshes
Authors: Monika R. Henzinger, Stefano Leonardi
Venue: Journal of Computer and System Sciences (2003)

This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput model. The problem is a generalization of the edge-disjoint paths problem and is NP-hard both on trees and meshes. We study both the offline and the online version of the problem: In the offline setting, we give the first constant-factor approximation algorithm for trees, and an O((log log n)2)-factor approximation algorithm for meshes. In the online setting, we give the first polylogarithmic competitive online algorithm for tree and mesh topologies. No polylogarithmiccompetitive algorithm is possible on general network topologies (Lower bounds for on-line graph problems with application to on-line circuits and optical routing, in: Proceedings of the 28th ACM Symposium on Theory of Computing, 1996, pp. 531-540) and there exists a polylogarithmic lower bound on the competitive ratio of any online algorithm on tree topologies (Making commitments in the face of uncertainity: how to pick a winner almost every time, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 519-530). We prove the same lower bound for meshes.
A Parallel Reduction Algorithm with Communication Delay
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Simulation is an application area for which high speed computation is critical. Massive parallel computers have appeared so that it is now possible to execute very large-scale and complicated simulation without sacrificing accuracy and simplifying problems. For a kind of problems in which the computation in each element depends on the data of all the other elements, a completely-connected network is required in order to simulate with high efficiency. However in massive parallel computers, efficient simulation of these problems is difficult to realize. Its cause is due to their network structure. In this paper, a new network topology which solves these problems with high efficiency and a computation method based on the topology are described.
Java for Engineers and Scientists, 2 edition
Authors: Stephen J. Chapman
Venue:  (2003)

From the Book:PREFACE: Preface The basic purpose of this book is to simultaneously teach the Java programming language, structured programming techniques, and good programming practice to an audience of science and engineering students. Java is a relatively new programming language, but it is taking the world by storm. The language has enormous appeal for many reasons. One major reason is that it is largely platform independent, meaning that an application written for one computer is very likely to run unchanged on another computer. Thus, a single application can be written to execute across all of a company's computers, whether they are PC's, Macs, or Unix workstations. A second major advantage is that Java has a C-like syntax, but drops many of the more obscure and messier features of C. Having a C-like syntax means that it is already partially familiar to millions of people. This fact aids its acceptance. An example of Java's improvement over C is its treatment of character strings. In Java, strings are treated as objects and are manipulated by a set of standard methods. In C, strings are manipulated with pointers, which is a much more error-prone process. A third major advantage of Java is that it is object oriented, which should make code written in Java more re-usable between applications. With a little forethought, classes and methods written for one application are usable in another application without change, because the way that the data and methods are encapsulated in the objects prevents undesirable interactions among them. A fourth major advantage of Java is that it is possible to write device-independentgraphicsapplications. Languages such as C and Fortran do not provide device-independent graphics, because the programmer must concern himself / herself with the specific details of the hardware being used to display the graphics. The language definitions do mot include standard APIs for working with graphics at a higher level. By contrast, Java's AWT and Swing Graphics classes provide a higher-level abstraction that is the same across any Java implementation, making device-independent graphics practical. A final advantage of Java is that it is free. Sun provides a free Java Development Kit for download from its World Wide Web site (...
Senior Management Perspectives on ISO/IEC Software Engineering Standards
Authors: Kival Weber, Roberto Almeida
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

This panel will focus on the future of the industry, the challenge for new standards, the issues today, and the development and use of international software engineering standards, from a senior management perspective.Major issues to be discussed are: 1) The future of the industry; 2) The challenge for new ISO/IEC software engineering standards; 3) ISO/IEC software engineering standards issues of today; 4) The influence of ISO/IEC 12207 on software engineering standards; 5) The scope, roles, uses, and development trends of the most widely used software engineering standards; 6) The position of those standards in relation to standards for quality and project management, system engineering, dependability, and safety.Panel's key questions are: 1) Why ISO/IEC software engineering standards are not so much used both in the academia and in the marketplace? 2) What are the main corrective actions to improve this?