ppxscal/embedding_network huggingface dataset:
Complete Guide to Digital Illustration
Authors: Steve Caplin, Adam Banks
Venue:  (2003)

:Todays professional illustrator is light years beyond ink wells and drafting boards: the present and foreseeable future of the art of illustration is digital, and there is no more complete resource on the tools and techniques of this thoroughly modern practice than The Complete Guide to Digital Illustration. Written by veteran art professionals Steve Caplin and Adam Banks, this guide will take any digital artist to the next level. It examines all the key areas where digital illustration is utilized - covering the traditional arenas such as print, corporate identity, and advertising as well as multimedia presentations and the new media of the Internet. It demonstrates the vast array of incredible effects open to todays digital artists, along with how they can be achieved. It also offers indispensable advice on the type of software and hardware the beginning digital illustrator may need for his own studio. Packed with more than 400 stunning full-color illustrations and profiles of the newsmakers and groundbreakers within the industry, The Complete Guide to Digital Illustration is a virtual encyclopedia on the art of digital illustration and a fast-track tutorial no serious illustrator should be without. Third title in series Provides a complete and in-depth analysis of the current state of digital illustration technology Offers advice on choosing appropriate hardware and software Covers every area, from comic strips to 3-D rendering Includes a foreword by Nigel Holmes, former graphics director of Time magazine and highly renowned author, lecturer, and illustrator
A Parallel Algorithm for Finding Fill in a Sparse Symmetric Matrix
Authors: John R. Gilbert, Hjalmtyr Hafsteinsson
Venue:  (1986)

We describe a parallel algorithm for finding the fill that occurs when a sparse symmetric positive definite matrix A is factored into its Cholesky factor L. The algorithm is in two steps: First we determine the elimination forest F for A. Then from F and A we compute the fill. The algorithm takes $O(\log^{2} n)$ time, using $m + n$ processors to find the elimination forest and $m^{*}+ n$ processors to find the fill.
On Algebraic Surfaces Meeting with Geometric Continuity
Authors: Joe D. Warren
Venue:  (1986)

An increasingly prominent area of computer science is Computer Aided Geometric Design or CAGD. The main task of CAGD is to automate, to the greatest extent possible, the process of designing physical objects. A designer typically models an object as a collection of surfaces. For many objects, design specifications indicate only a few critical surfaces, with the remaining surfaces to be chosen so as to make the surface of the resulting object smooth. Smoothness is important because, in many mechanical objects, sharp edges are undesirable for functional or aesthetic reasons. For example, sharp edges on the interior surface of a gate valve retard fluid flow. Automatically calculating these remaining surfaces, called blending surfaces is an important task in any CAGD system. Therefore, an understanding of the mathematics of surfaces that meet smoothly is fundamental to CAGD. Specifically, this thesis investigates the following problem: given a surface V and a point or curve W on that surface, construct surfaces that meet with V with a specified degree of smoothness along W. Working from a measure of smoothness known as geometric continuity, the first half of this thesis establishes that the space of all surfaces meeting V with the k-th order geometric continuity along W is directly related to certain algebraic structures called ideals. For example, let Z(M) (the set of point for which a polynomial M is zero) be an irreducible surface that intersects another surface Z(N) transversally (nontangentially) in an irreducible curve Z(M) $\frown$ Z(N). It is shown that a surface Z(F) meets Z(M) with order k geometric continuity along Z(M) $\frown$ Z(N) if and only if F is a polynomial of the form $AM = BN^{k+1}$ where A and B are free polynomials and A is nonzero on Z(M) $\frown$ Z(N). The second half of this work applies these results to the problem of generating blending surfaces. Using the geometric properties of blending surfaces, it is shown that any surface Z(F) that smooths the intersection of two surfaces Z(M) and Z(N) must have certain algebraic properties. In particular, the degree of F must be greater than or equal to the maximum of the degrees of $M^{2}$ and $N^{2}$. Finally, existing methods for constructing blending surfaces are shown to be consistent within the above algebraic framework. In fact, we demonstrate that these distinct methods are instances of a single general method for generating blending surfaces. Moreover, this general method is shown to generate blending surfaces of the lowest possible degree.
Browsing and Searching Software Architectures
Authors: Susan Elliott Sim, Charles L. A. Clarke, Richard C. Holt, Anthony M. Cox
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Software architecture visualization tools tend to support browsing, that is, exploration by following concepts. If architectural diagrams are to be used during daily software maintenance tasks, these tools also need to support specific fact-finding through searching. Searching is essential to program comprehension and hypothesis testing. Furthermore, searching allows users to reverse the abstractions in architectural diagrams and access facts in the underlying program code. In this paper, we consider the problem of searching and browsing software architectures using perspectives from information retrieval and program comprehension. After analyzing our own user studies and results from the literature, we propose a solution: the Searchable Bookshelf, an architecture visualization tool that supports both navigation styles. We also present a prototype of our tool which is an extension of an existing architecture visualization tool.
A study of the construction and application of a Daubechies wavelet-based beam element
Authors: Junxing Ma, Jijun Xue, Shengjun Yang, Zhengjia He
Venue: Finite Elements in Analysis and Design (2003)

Wavelet theory provides various basis functions and multi-resolution methods for finite element method. In this paper, a wavelet-based beam element is constructed by using Daubechies scaling functions as an interpolating function. Since the nodal lateral displacements and rotations are used as element degrees of freedom, the connection between neighboring elements and boundary conditions can be processed simply as done for traditional elements. Then, it is realized that the complicated beams such as those with unequal cross section, local load and so on, can be analyzed by this wavelet-based element. The numerical examples illustrate that the wavelet-based element has high analytical accuracy for beam bending problems with various boundary conditions and structures. A new approach is presented for finite element method.
Partial Implementations in Program Derivation
Authors: Jan F. Prins
Venue:  (1987)

A partial implementation of an abstract notation provides an implementation for some of the notations operations on some of the values in the notation. A collection of partial implementations of a fixed notation -differing in the selection of values and operations implementedcaters to different patterns of usage of the notation in individual programs. Partial implementations of a general mathematical notation are more appropriate to the formal development of programs than the more familiar paradigm of abstract data types with complete implementations. Furthermore, partial implementations provide the only realistic account of the implementation of finite machinery of many familiar mathematical notations. From a practical point of view, partial implementations of a fixed notation exhibit great reusability and provide a convenient approach to early prototyping in program development. The incorporation of mathematical notations into a programming system is studied, with particular regard to the formal development of programs in the style of Dijkstra and Gries. A new notion of encapsulation is presented to define partial implementations and a predicate-transformer characterization of implementation correctness is defined. The implementation correctness criterion simplifies and extends the original data-type implementation criterion of Hoare, generalizes implementation criterion for algebraic abstract data types, and accommodates the implementation of non-deterministic operations. Different variables of the same type may have different representations and implementations of operations within the same program. Not all implementations are adequate in a given program, so syntactic and semantic conditions are given to ensure that a proposed implementation of a variable is adequate. 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
Chromatic-Index Critical Graphs of Even Order
Authors: Stefan Grunewald, Eckhard Steffen
Venue:  (1997)

A $k$-critrical graph $G$ has maximum degree $k \geq 0$, chromatic index $\chi''(G) = k+1$ and $\chi''(G-e) > k+1$ for each edge $e$ of $G$. The Critical Graph Conjecture independently stated by I.T. Jakobsen (On critical graphs with chromatic index 4, Disc. Math. 9 (1974) 265-276), and L. W. Beineke, R. J. Wilson (On the edge chromatic number of a graph, Disc. Math. 5 (1973) 15-20) claims that every $k$-critical graph is of odd order. S. Fiorini, R. J. Wilson (Edge-colourings of graphs, in L. W. Beineke, R. J. Wilson (eds.) Selected Topics in Graph Theory, Academic Press London (1978) 103-126) conjectured that every $k$-critical graph of even order has a 1-factor. A. G. Chetwynd and H. P. Yap (Chromatic index critical graphs of order 9, Disc. Math. 47 (1983) 23-33) stated the problem whether it is true that if $G$ is a $k$-critical graph of odd order, then $G-v$ has a 1-factor for every vertex $v$ of minimum degree. These conjectures are disproved and the problem is answered in the negative for $k \in \{3,4\}$. We disprove these conjectures and answer the problem in the negative for all $k \geq 3$. We also construct $k$-critical graphs on $n$ vertices with degree sequence $23^24^{n-3}$, answering a question of Yap (Some topics in graph theory, London Math.~Soc.~LNS 108, Cambridge University Press (1986)).
Structures with Many-Valued Information and their Relational Proof Theory
Authors: Ivo Düntsch, Wendy MacCaull, Ewa Orlowska
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

We present a uniform relational framework for developing proof systems for theories of much valuedness that may have the form of a logical system, of a class of algebra or of an information system. We outline a construction of proof systems for SHn logics, mv-algebras and many-valued information systems.
How CIOs manage their superiors' expectations
Authors: Richard E. Potter
Venue: Communications of the ACM (2003)

Survival of the chief information officer isn't easy. It takes a keen sense of what the boss anticipates from IT projects as well as a diplomatic understanding of what the boss really does---and does not---know about IT.
The logic of public announcements, common knowledge, and private suspicions
Authors: Alexandru Baltag, L. S. Moss, S. Solecki
Venue:  (1999)

This paper presents a logical system in which various group-level epistemic actions are incorporated into the object language. That is, we consider the standard modeling of knowledge among a set of agents by multi-modal Kripke structures. One might want to consider actions that take place, such as announcements to groups privately, announcements with suspicious outsiders, etc. In our system, such actions correspond to additional modalities in the object language. That is, we do not add machinery on top of models (as in Fagin et alia), but we reify aspects of the machinery in the logical language. Special cases of our logic have been considered in Plaza, Gerbrandy, and Gerbrandy and Groeneveld. The latter group of papers introduce a language in which one can faithfully represent all of the reasoning in examples such as the Muddy Children scenario. In that paper we find operators for updating worlds via announcements to groups of agents who are isolated from all others. We advance this by considering many more actions, and by using a more general semantics. Our logic contains the infinitary operators used in the standard modeling of common knowledge. We present a sound and complete logical system for the logic, and we study its expressive power.
Scene Augmentation via the Fusion of Industrial Drawings and Uncalibrated Images with a View to Marker-Less Calibration
Authors: Nassir Navab, Benedicte Bascle, Mirko Appel, Echeyde Cubillo
Venue: Proceedings of the 2nd IEEE and ACM International Workshop on Augmented Reality (1999)

The application presented in this paper is to augment uncalibrated images of factories with industrial drawings. Industrial drawings are among the most important documents used during the lifetime of industrial environments. They are the only common documents used during design, installation, monitoring and control, maintenance, update and finally dismantling of industrial units. Leading traditional industries towards the full use of virtual and augmented reality technology is impossible unless industrial drawings are integrated into our systems. Here we provide the missing link between industrial drawings and digital images of industrial sites.On one hand, this could enable us to calibrate the cameras and build the 3D model of the scene without using any calibration markers. On the other hand it brings industrial drawings, floor map, images and 3D models into one unified framework. This provides a solid foundation for building efficient enhanced virtual industrial environments.The augmented scene is obtained by perspective warping of an industrial drawing of the factory onto its floor, wherever floor is visible. The visibility of the floor is determined using probabilistic reasoning over a set of clues including (1) floor color/intensity (2) image warping and differencing between an uncalibrated stereoscopic image pair using the ground plane homography. Experimental results illustrate the approach.
Compressed Code Execution on DSP Architectures
Authors: Paulo Centoducatte, Guido Araujo, Ricardo Pannain
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Decreasing the program size has become an important goal in the design of embedded systems target to mass production. This problem has led to a number of efforts aimed at designing processors with shorter instruction formats (e.g. ARM Thumb and MIPS16), or that can execute compressed code (e.g. IBM CodePack PowerPC). Much of this work has been directed towards RISC architectures though.This paper proposes a solution to the problem of executing compressed code on embedded DSPs. The experimental results reveal an average compression ratio of 75% for typical DSP programs running on the TMS320C25 processor.This number includes the size of the decompression engine. Decompression is performed by a state machine that translates Codewords into instruction sequences during program execution. The decompression engine is synthesized using the AMS standard cell library and a 0.6_m 5V technology. Gate level simulation of the decompression engine reveals minimum operation frequencies of 150MHz.
Fault-tolerant Wait-free Shared Objects
Authors: Prasad Jayanti, D. C Chandra, Sam Toueg
Venue:  (1996)

Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of implementing shared objects that tolerate the failure of both processes and base objects. We identify two classes of object failures: responsive and non-responsive. With responsive failures, a faulty object responds to every operation, but its responses may be incorrect. With non-responsive failures, a faulty object may also ``hang'''' without responding. In each class, we define crash, omission, and arbitrary modes of failure. We show that all responsive failure modes can be tolerated. More precisely, for all responsive failure modes F, object types T, and t, we show how to implement a shared object of type T which is t-tolerant for F. Such an object remains correct and wait-free even if up to t base objects fail according to F. In contrast to responsive failures, we show that even the most benign non-responsive failure mode cannot be tolerated. We also show that randomization can be used to circumvent this impossibility result. Graceful degradation is a desirable property of fault-tolerant implementations: the implemented object never fails more severely than the base objects it is derived from, even if all the base objects fail. For several failure modes, we show whether this property can be achieved, and, if so, how.
Design of a Framework for Multi-User/Application Oriented WebGIS Services
Authors: Yingwei Luo, Xiaolin Wang, Zhuoqun Xu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In this paper, a framework is presented to provide a new mode for WebGIS services. This framework consists of three layers: User layer, Application layer and WebGIS service layer. User Layer supports users to access WebGIS services via different network environment; application layer represents WebGIS applications constructed by different organizations or companies, which integrate GIS services to solve some domain-oriented problems; WebGISservice layer is the core layer in the framework, which provides different GIS services. Professionals maintain WebGIS service layer unitedly. WebGIS services can dynamically modified and added, but WebGIS application needn't adjust. If there are no appropriate GIS services in WebGIS service layer, the WebGIS application constructors can order them from WebGIS service layer. WebGIS service layer is a multi-agent system, where WebGIS services are implemented as agents, which can match the use of different users/applications.
Analysis of three hybrid systems in time $\mu$ CRL
Authors: Jan F Groote, Jos J. Wamel
Venue:  (1998)

We study three simple hybrid control systems in timed $\mu$CRL \cite{Gr97}. A temperature regulation system, a bottle filling system and a railway gate control system are specified component-wise and expanded to linear process equations. Some basic properties of the systems are analysed and a few correctness requirements are proven to be satisfied. Although not designed for this purpose, timed $\mu$CRL seems to allow detailed analysis and verification of hybrid systems. The operators for parallelism and encapsulation are handled using some basic results from \cite{GvW98}. It turns out that the expansion and encapsulation of a parallel composition of processes generally leads to a considerable number of potential {\it time deadlocks\/}, which generally turn out to be harmless. Also inherent to parallelism are the multiple time dependencies between the summands of the separate components. As a consequence, expansions tend to lead to large numbers of terms. Various techniques, such as the use of invariants \cite{BG94}, have to be employed to master these complications.
Reliability and availability of a wide area network-based education system
Authors: P. Dixit, M. A. Vouk, D. L. Bitzer, C. Alix
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

An important class of quality of service (QoS)-dependent network-based applications are computer-based education systems. A successful network-based education (NBE) system needs to provide appropriate QoS at the user level. This includes adequate end-to-end response delay and adequate system reliability and availability. This paper presents results from a reliability and availability evaluation of NovaNET. NovaNET is a successful low-overhead multimedia education system which serves thousands of users on a daily basis. We analyze eight years of failure data and examine correlations among system failure events. The NovaNET data are used to discuss practical bounds on the reliability and availability of an NBE system.
The PURE Family of Object-Oriented Operating Systems for Deeply Embedded Systems
Authors: Danilo Beuche, Abdelaziz Guerrouat, Holger Papajewski, Wolfgang Schröder-Preikschat, Olaf Spinczyk, Ute Spinczyk
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Deeply embedded systems are forced to operate under extreme resource constraints in terms of memory, CPU, time, and power consumption. Typical examples are automotive systems. Today's limousines can be considered (large scale) distributed systems on wheels. There are cars in daily operation consisting of over 60 networked processors (i. e. µ-controllers). Reserved estimations say that in the near future every car will be equipped with about 20 networked µ-controllers, on average. The complexity of these "decentralized computer architectures" can be managed no longer by the application alone. Dedicated embedded operating systems are required to ensure manageability, adaptability, portability, and yet efficiency of the software. Resource sparing operation under (hard) real-time constraints must be the maxim. This paper discusses the design and implementation of a portable, universal runtime executive,
Relevance terminological logics Towards logic-based information retrieval
Authors: Umberto Straccia
Venue:  (1995)

Information Retrieval (IR) is presented as the task of retrieving the documents that are relevant to a given query. In the context of a Terminological Logic (TL) based approach to IR, this amounts to embodying a notion of relevance in the logical implication relation of the chosen TL. Among the many possible readings of the term ``relevance'''', the one captured by relevance logic, and in particular by first-order tautological entailment, can be viewed as a promising source of inspiration, to the end of incorporating a logic-based form of relevance in the inference mechanism of TLs. In semantical terms, this amounts to adopting a four-valued semantics for TLs, thus obtaining Relevant Terminological Logics. Logics of this kind have already been used in Knowledge Representation in order to avoid the so-called paradoxes of logical implication and to improve the computational complexity when reasoning on concepts and individuals. Unfortunately, we have observed that the adoption of the, by now classical, four-valued semantics results in a too drastic loss of inferential capabilities. The aim of this paper is to present a less restrictive four-valued semantics for TLs, which could be considered as a suitable core for IR purposes, while maintaining the desired ``relevance'''' flavour of relevance logics. In order to perform automated reasoning on this logic, we will also present a new, general and modular inference algorithm based on Gentzen-style calculus and a four-valued version of Craig''s interpolation theorem. This theorem states that the defined entailment relation captures a close (structural) relationship between a knowledge base and a query. Therefore, the defined entailment relation could arguably be a good theoretical and practical bases for a logic-based approach to I EMAIL:: straccia@iei.pi.cnr.it