ppxscal/embedding_network huggingface dataset:
Marketing on the Internet
Authors: Jan Zimmerman
Venue:  (2002)

:This updated edition reflects the rapid changes in online marketing topics such as effective Web site design, secure payment methods, Web promotion techniques, and building relationships with online customers. Dozens of worksheets help readers sharpen the focus of the online needs and goals of their businesses, and hundreds of screen shots illustrate successful tactics. Case studies of online business successes explain the concepts in the book and illustrate how they work in real-life situations.
Biology Resources in the Electronic Age
Authors: Judith A. Bazler
Venue:  (2003)

:How can students, teachers, parents, and librarians be certain that the information a Web site provides is accurate and age appropriate? In this unique book, experienced science educator Judith A. Bazler reviews hundreds of the most reliable biology-related Web sites. Each review discusses the most appropriate grade level of the site, analyzes its accuracy and usefulness, and provides helpful hints for getting the most out of the resource. 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
A Lower-Bound Algorithm for Minimizing Network Communication in Real-Time Systems
Authors: Cecilia Ekelin, Jan Jonsson
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

In this paper, we propose a pseudo-polynomial-time lower-bound algorithm for the problem of assigning and scheduling real-time tasks in a distributed system such that the network communication is minimized. The key feature of our algorithm is translating the task assignment problem into the so called k-cut problem of a graph, which is known to be solvable in polynomial time for fixed k. Experiments show that the lower bound computed by our algorithm in fact is optimal in up to 89% of the cases and increases the speed of an overall optimization algorithm by a factor of two on the average.
On the incomparability of Gamma and Linda
Authors: G. Zavattaro
Venue:  (1998)

We compare Gamma and Linda, two of the most prominent coordination languages based on generative communication via a shared data space. In Gamma computation is obtained by applying multiset rewriting rules, reminiscent of the way chemical reactions happen in a solution. On the other hand, Linda permits interprocess communication by means of the creation and consumption of shared data. Also a non-blocking input operator is allowed: it terminates indicating if the required datum has been consumed or it is not actually available. We first recall two simple calculi based on Gamma and Linda coordination models. Even if both the languages are Turing powerful, we show that their expressive power is not comparable; in particular, we prove that there exists no program distribution preserving encoding of one language in the other that respects at least the input-output behaviour.
Axiomatising dynamic logics for anaphora
Authors: D. J Eijck
Venue:  (1998)

A new task put on the agenda of philosophical logic by the recent dynamic turn, the account for the dynamics of anaphoric context shifts in reasoning, is taken up. The paper gives a sequent axiomatisation of some well known dynamic anaphora logics. The calculi are shown to be sound and complete. They differ from earlier calculi for the dynamics of anaphoric context in that they take the notion of anaphoric context change from premiss to conclusion as starting point of the analysis, and they do not rely on an implicit translation to first order predicate logic.
Correctness and completeness of the SRP_IC refutation procedure
Authors: Patrizia Asirelli, Paola Inverardi, Giuseppe Plagenza
Venue:  (1996)

In this paper we present a refutation procedure to compute goals in a deductive database ac- cording to particular views of it. Views are dened by a set of constraints rules. The declarative semantics of the constrained database is dened and the given refutation procedure is proved correct and complete for positive range{restricted databases. The extension of the procedure to deal with negation is also outlined. EMAIL:: asirelli@iei.pi.cnr.it
Fast Wavelet Transforms for Matrices Arising from Boundary Element Methods
Authors: David M. Bond, Stephen A. Vavasis
Venue:  (1994)

(The following contains mathematical formulae and symbols that may become distorted in ASCII text.) For many boundary element methods applied to Laplace''s equation in two dimensions, the resulting integral equation has both an integral with a logarithmic kernel and an integral with a discontinuous kernel. If standard collocation methods are used to discretize the integral equation we are left with two dense matrices. We consider expressing these matrices in terms of wavelet bases with compact support via a fast wavelet transform as in Beylkin, Coifman, and Rokhlin. Upper bounds on the size of the wavelet transform elements are obtained. These bounds are then used to show that if the original matrices are of the size N x N, the resulting transformed matrices are sparse, having only O(N log N) significant entries. Some numerical results will also be presented. Unlike Beylkin, Coifman and Rokhlin who use the fast wavelet transform as a numerical approximation to a continuous operator already expressed in a full wavelet basis of L2(IR), we think of the fast wavelet transform as a change of basis matrix for a finite dimension, and apply it to a discretized function or matrix. As a result, we can use this fast wavelet transform as a "black box" transformation in existing boundary element codes.
Personal Web Sites: Top Designers Push the Boundries with Experimental Design and Graphics
Authors: Joe Shepter
Venue:  (2002)

:The whatever.nike.com ad campaign drew on an interface concept that first appeared on a designer's personal Web site. Musicians such as Mick Jagger and Bjork rely on designers who have honed their skills through personal projects. These sites -- whether home pages that show off a designer's work or "business" Web pages that have been turned into creative experiments -- are the breeding grounds for tomorrow's biggest commercial successes. Personal Web Sites examines this critical genre of Web design, showcasing the personal work of more than twenty-five of the field's top web designers. From narrative sites like volumeone.com to communities like the one at archinect.com to portals like k10k.net, this book illustrates how the best in the business use private space as a proving ground for future commercial projects. Insightful text and telling interviews provide an intimate window into each designer's private world of creativity, and compelling images showcase some of the most beautiful examples of online design. Offering a fresh view of how Web designers get their inspiration, this unique volume makes the undeniable connection between personal creative passion and commercial success. 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
SR Scheme: Spatial-match Iconic Image Representation
Authors: Yeon-Jung Kim, Jae-Woo Chang
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

In order to support content-based iconic image retrieval efficiently, we propose a new spatial-match representation scheme, called SR scheme, which combines directional operators with positional operators. Therefore, our scheme can represent spatial relationships between icon objects precisely and can provide ranking for the retrieved images. In addition, we compare our scheme with the conventional 9DLT and SMR schemes in terms of retrieval effectiveness. Finally, we show from our experiments that our SR scheme holds about 7% higher recall and about 20% higher precision, compared with the 9DLT and the SMR.
Performance analysis for dynamic tree embedding in k-partite networks by random walk
Authors: Hong Shen, K. Li, Y. Pan, G. H. Young, S. Q. Zheng
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

We study the problem of dynamic tree embedding in k-partite networks G/sup k/ and analyze the performance on inter-partition load distribution of the embedding. We show that, for ring-connected G/sup k/, if the embedding proceeds by taking uni-directional random walk at length randomly chosen from [0, /spl Delta/-1], where a is a multiple of k, the best-case performance is achievable at probability /spl radic/(2/spl pi/ke/sup -k/), which is much higher than the asymptotically-zero probability at which the worst-case performance may appear. We also show that the same probabilities hold also for fully-connected G/sup k/ if the embedding proceeds by taking random walk at length randomly chosen from [2, /spl infin/). When k=2 (bipartite networks), our results show that if we do the embedding under the above random-walk schemes in their corresponding networks, we will have 50 percent chance to achieve the best-case performance. We also analyze the performances for embedding in these two networks in the expected case, and observe an interesting fact that if a ring- or fully-connected G/sup k/ contains equal-sized partitions, the expected-case performance matches that in the best case.
The Sherrington--Kirkpatrick model with short range ferromagnetic interactions
Authors: Comets F., Giacomin G., Lebowitz J.L.
Venue:  (2000)

We study a model of Ising spins with short range ferromagnetic and long range SK interactions. We generalize the results obtained for the standard SK model, computing in particular the high temperature pressure. R&#x00C9;SUM&#x00C9;. Nous &#x00E9;tudions un mod&#x00E9;le de spins binaires qui est soumis &#x00E1; la fois &#x00E1; des interactions de type Ising et de type Sherrington-Kirkpatrick. Nous g&#x00E9;n&#x00E9;ralisons des r&#x00E9;sultats obtenus dans le cas du mod&#x00E9;le SK seul, en calculant en particulier la pression &#x00E1; haute temp&#x00E9;rature.
Enterprise Architecture It Project: The Urbanisation Paradigm
Authors: Christophe Longepe
Venue:  (2003)

:This book is intended for CIOs (Chief Information Officers) and MIS department architects and designers, enterprise managers and consultants. 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
A New Method of Coding Minorants in Problems of Synthesis of Digital Devices from PLAs
Authors: B. Ye. Rytsar, A. B. Kmet'
Venue: Cybernetics and Systems Analysis (2003)

A new method of coding minorants in decomposing a system of Boolean function is proposed. The method is based on the initial coding obtained from the minimal representation of the system in the so-called set-theoretical decomposition form obtained as a result of q-partitioning of conjuncterms of functions represented in DNF. A distinctive feature of the method is the preservation of the correspondence of the obtained codes of minorants to the block structure of the system being decomposed, which provides the minimum of informational capacity of PLAs.
Off-line Cursive Handwriting Recognition Using Style Parameters
Authors: Berrin A. Yanikoglu, Peter A. Sandon
Venue:  (1993)

(No abstract available).
A Study of Communication and Cooperation in Distributed Software Project Teams
Authors: A. French, P. Layzell
Venue: Proceedings of the International Conference on Software Maintenance (1998)

With a growing demand for software systems and an increase in their complexity, software development and maintenance is no longer the preserve of individual designers and programmers, but is a team-based activity. Indeed, development and maintenance has always involved a wide variety of stakeholders (customers, designers, programmers, maintainers, end-users) making the need for communication and cooperation an inherent characteristic.Changes in support technology, economic factors and globalisation of software development and maintenance is increasingly resulting in the geographical separation of personnel. Where such distribution ofpersonnel occurs, it is clearly important that there is high quality communication and cooperation.This paper presents the results and conclusions from a study of communication and cooperation practices on a range of distributed commercial software projects.
An adaptive collocation method based on interpolating wavelets
Authors: Silvia Bertoluzza
Venue:  (1997)

A wavelet collocation method for the adaptive solution of second order elliptic partial differential equations in dimension $d$ is presented. The method is based of the use of the Deslaurier-Dubuc interpolating functions. The method is tested on an advection dominated advection diffusion problem, and on a Laplace problem posed on a non rectangular domain. EMAIL:: ian@microian.ian.pv.cnr.it
On the quadrilateral Q2-P1 element for the Stokes problem
Authors: Daniele Boffi, Lucia Gastaldi
Venue:  (2000)

The Q2-P1 approximation is one of the most popular Stokes element. Two possible choices are given for the definition of the pressure space: one can either use a global pressure approximation (that is on each quadrilateral the finite element space is spanned by 1 and by the global coordinates x and y) or a local approach (consisting in generating the local space by means of the constants and of the local curvilinear coordinates on each quadrilateral). The former choice is known to provide optimal error estimates on general meshes. This has been shown, as it is standard, by proving a discrete inf-sup condition. In the present paper we check that the latter approach satisfies the inf-sup condition as well. However recent results on quadrilateral finite elements enlight a lack in the approximation properties for the space coming out from the local pressure approach. Numerical results actually show that the second choice (local or mapped pressure approximation) is suboptimally convergent.
Towards Ontological Reconciliation for Agents
Authors: Leon Sterling, Kendall Lister
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

This paper addresses issues faced by agents operating in large-scale multi-cultural environments. We argue for systems that are tolerant of heterogeneity. The discussion is illustrated with a running example of researching and comparing university web sites, which is a realistic scenario representative of many current knowledge management tasks that would benefit from agent assistance. We discuss efforts of the Intelligent Agent Laboratory toward designing such tolerant systems, giving a detailed presentation of the results of several implementations.
Natural language processing in the undergraduate curriculum
Authors: Robert Dale, Diego Mollá-Aliod, Rolf Schwitter
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

The paper has two purposes: first, we argue that natural language processing, and particularly those aspects of that field often referred to as language technology, should play an important role in the computer science curriculum; second, we describe in broad terms the content of an undergraduate program we have developed at Macquarie University that covers this material. We question the industrial relevance of much that is taught in NLP courses, and emphasize the need for a practical orientation as a means to growing the size of the field. We argue that a more evangelical approach, both with regard to students and industry, is required. The paper provides an overview of the material we cover, and makes some observations for the future on the basis of our experiences so far.
Opportunistic Behavior and Its Automatic Adjustment in Dynamic Task Domains
Authors: B. Hamidzadeh, A. Afshar
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In many dynamic application domains, the environment changes during problem solving. A problem solver, in these applications, does not have complete information about the task and resources, a priori. The problem solver is required to use up-to-date information that becomes avail-able on line. It must use this information to avoid producing solutions that are obsolete by the time they are to be executed. The problem solver has to be opportunistic, in order to take immediate advantage of resources that become available and remain available for a short period of time. How opportunistic the algorithm should be depends on the degree of dynamicity in the environment. In this paper, we propose an algorithm which per-forms problem solving on line in order to obtain new information about the availability of resources in the system. The proposed algorithm adjusts itself automatically to adapt to the degree of dynamicity in the environment. We introduce a model of dynamicity in a graph representation of a task. We provide theoretical and empirical analyses of our algorithm for a routing problem in the proposed dynamic model. Our theoretical analyses demonstrate the correctness and completeness properties of our algorithm. Results of our performance- comparison experiments show that the pro-posed algorithm performs as well as the best of the candidate algorithms under a wide range of experiment parameters The results also show that the proposed algorithm is capable of automatically adapting to the degree of dynamicity in the environment.
Skeptical Inheritance: Computing the Intersection of Credulous Extensions
Authors: Lynn A Stein
Venue:  (1989)

Ideally skeptical inheritance supports exactly those inferences true in every credulous extension of an inheritance hierarchy. We provide a formal definition of ideally skeptical inheritance. We then give a linear-time algorithm which computes a plausible approximation of ideally skeptical inheritance. However, we show that there are inheritance hierarchies for which this algorithm computes only a subset of the inferences sanctioned by ideally skeptical inheritance. Reasoning by cases is necessary to compute the complete set of inferences. Finally, we give an algorithm which computes ideally skeptical inheritance using a limited form of Boolean satisfiability. It is not known whether this problem is NP-complete.
A multimedia constraint system (or: do we have it MADE)
Authors: J. E.A. Hintum, Graham J. Reynolds
Venue:  (1995)

The MADE constraint system provides excellent opportunities to introduce constraints in a multimedia application. Multimedia applications are not only a good place to experiment with constraint systems; constraints in a multimedia environment are almost indispensable. Due to the overwhelming amount of data and the number of relations between several parts of this data, multimedia applications almost demand the support of a constraint management system. The MADE constraint system combines the object oriented programming paradigm, inherited from the mC++ language, the declarative constraint programming paradigm and the special requirements imposed upon the constraint system by the multimedia environment. Among other things, the MADE constraint system provides parallel satisfaction techniques; several constraints may be solved simultaneously and this satisfaction process is performed in parallel with the application. This not only reduces the time needed to solve the constraints, it also allows the multimedia application to proceed with its presentation while (beneath the surface) the constraints are maintained. This not only holds for the parts of the presentation that are not constrained at all, but also for those parts that are. Furthermore, the constraint system is transparent to the multimedia application; no special coding or preparation of the objects in the application is necessary. Constraints can be added later to the application without much work. Besides that, it is also possible to add and remove constraints at runtime; objects may be constrained for only a period of the time the application is running.
The Early Search for Tractable Ways of Reasoning about Programs
Authors: Cliff B. Jones
Venue: IEEE Annals of the History of Computing (2003)

This article traces the history-up to around 1990-of research on reasoning about programs. The main focus is on sequential imperative programs but some comments are made on concurrency. The main thesis is that the idea of reasoning about programs has been around since they were first written; the search has been to find tractable methods.
Architectural Techniques for the Description and Validation of Distributed Real-Time Systems
Authors: Laurent Thomas, Thomas Lambolais, Renaud Lesiour
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Our goal is to settle techniques for the validation of real-time distributed systems. We opted for executable models and simulation techniques. Our approach is to work at the architectural level of a system abstraction. The software architecture is understood as a set of structures comprising software components with external properties and relationships among them.We devised a language to describe those components and the logical structure of the architecture. It is a specialization and extension of object-oriented modeling languages designed to deal with concurrency, reactivity and architectural concerns. This language is based on a notion of components defined similarly to the class notion, extended for the timing requirements. Execution and simulation are driven to validate behaviors with respect to desired properties.
Empirical Evaluation of Dissimilarity Measures for Color and Texture
Authors: Jan Puzicha, Joachim M. Buhmann, Yossi Rubner, Carlo Tomasi
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper empirically compares nine image dissimilarity measures that are based on distributions of color and texture features summarizing over 1,000 CPU hours of computational experiments. Ground truth is collected via a novel random sampling scheme for color, and via an image partitioning method for texture. Quantitative performance evaluations are given for classification, image retrieval, and segmentation tasks, and for a wide variety of dissimilarity measures. It is demonstrated how the selection of a measure, based on large scale evaluation, substantially improves the quality of classification, retrieval, and unsupervised segmentation of color and texture images.