ppxscal/embedding_network huggingface dataset:
Competing in the Information Age: Align in the Sand, 2 edition
Authors: Jerry N. Luftman
Venue:  (2002)

:Most managers realize that information is among their company's most important assets. However, many don't know how to leverage their investments in information technology. Often, says Jerry N. Luftman, companies rush to acquire state-of-the-art systems without considering their long-term impact. For example, in the 1980s, retail banks invested heavily in ATMs--until ATMs ceased to be a competitive advantage and became merely another (and increasingly expensive) cost of doing business. Stemming from IBM's highly regarded Consulting Group, combining the expertise of consultants and leading academics, Competing in the Information Age shows managers how to avoid being blindsided by information technology. It outlines how to match information systems with business strategy to forge a strong competitive edge and bring powerful solutions to bear on real-world problems.
A Logic for Emotions: A Basis for Reasoning About Commonsense Psychological Knowledge
Authors: Kathryn E. Sanders
Venue:  (1989)

There is a body of commonsense knowledge about human psychology that we all draw upon in everyday life to interpret our own actions and those of the people around us. In this paper, we define a logic in which this knowledge can be expressed. We focus on a cluster of emotions, including approval, disapproval, guilt, and anger, most of which involve some sort of ethical evaluation of the action that triggers them. As a result, we are able to draw on well-studied concepts from deontic logic, such as obligation, prohibition, and permission. We formalize a portion of commonsense psychology and show how some simple problems can be solved using our logic. In order to handle concrete problems, since emotions do not occur in a vacuum, it is also necessary to formalize some commonsense knowledge about actions and the probable evaluation of those actions. Specifically, we focus on a cluster of actions having to do with ownership and possession of property --- giving, lending, selling, and stealing. We demonstrate that our logic is sufficiently expressive to handle a variety of information about human actions and responses in a way that is substantially more formal than previous work in this area. 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
Learning Unix for Mac OS X, Second Edition, 2 edition
Authors: Dave Taylor, Jerry Peek, Brian Jepson
Venue:  (2003)

:Now that your favorite operating system, Mac OS X, has Unix under the hood, it's the perfect time for you to uncover its capabilities. This new edition of Learning Unix for Mac OS X is designed to teach Unix basics to traditional Macintosh users. This book tells you what to do when you're faced with that empty command line.
Continuity of weak solutions of a singular parabolic equation
Authors: Ugo Gianazza, Vincenzo Vespri
Venue:  (2000)

We prove the continuity of bounded weak solutions of the singular parabolic equation $$\beta(u)_t=Lu$$ where $Lu$ is a second order, uniformly eliptic operator in divergence form, with bounded measurable coefficients and $\beta(\cdot)$ is a maximal monotone graph in $\Re\times\Re$ exhibiting an arbitrary but finite number of jumps
Truncations of inductively minimal geometries
Authors: Philippe Cara
Venue: Discrete Mathematics (2003)

Inductively minimal geometries form an infinite family of incidence geometries on which finite symmetric groups act flag-transitively. They were introduced in Buekenhout et al. (in: N.L. Johnson (Ed.), Mostly Finite Geometries, Marcel Dekker, New York, 1997, pp. 185-190) and satisfy, among other, the (IP)2 and RWPRI conditions (see Bull. Belg. Math. Soc. Simon Stevin 5 (1998) 213-219). In the present paper we characterize the truncations of inductively minimal geometries which satisfy both of these conditions. We also determine all rank 2 residues in these truncations. This enables one to find the diagram of these truncations.
The graphical demands on medical visualisation systems using the WWW: a case study
Authors: G. J. Clapworthy, M. Krokos
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The Internet provides an excellent facility both for disseminating medical information rapidly and for accumulating a coherent and widely available body of medical reference material, and the medical community has recently begun to tap its potential in a number of ways. The paper describes a service which is available on the WWW and which is designed to provide a 3D visualisation system to advance the education of medical students and the professional development of qualified medical practitioners. Particular reference is made to the type of graphical support demanded by such a system, and the feasibility of providing such a resource, taking into account the equipment currently available to the likely users. A discussion of related issues such as user requirements and medical standards is included, and possible future developments are identified.
Knowbot Programming: system support for mobile agents
Authors: J. Hylton, K. Manheimer, F. L. , . Jr. Drake, B. Warsaw, R. Masse, G. van Rossum
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Knowbot Programs are mobile agents intended for use in widely distributed systems like the Internet. We describe our experiences implementing security, process migration, and inter-process communication in a prototype system implemented using the object-oriented programming language Python. This infrastructure supports applications that are composed of multiple, autonomous agents that can migrate to use network resources more efficiently.
An Extensible Framework for Coherence in Distributed Shared Data Systems
Authors: Harjinder S. Sandhu
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

The choice of sharing model (objects versus plain shared memory), memory consistency model and coherence protocol are all fundamental aspects of the design of distributed shared data systems. Unfortunately, no single sharing model, memory model or coherence protocol is suitable for all applications. In this paper, we describe the design of an extensible distributed shared data framework, called the Extensible Coherence Interface (ECI), that gives the application layer complete control over how data is shared, including whether to share data on a per-object basis or per-page, which memory model to use, and how coherence is enforced for a region of shared memory. The ECI implementation itself simply acts as a layer for transporting and dispatching distributed events among objects at the application layer.
Stroke Level HMMs for On-Line Handwriting Recognition
Authors: T. Artières, P. Gallinari
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

The recent development of new terminals such as phones, mobilecomputers, e-books, etc, raises the needs for new interface modalities, in order to replace or complement the traditional mouse/keyboard interface. Ideally, these new interfaces should use limited computing resources and should be easy to adapt to a specific user and to a large variety of user needs. We propose here a new handwriting recognition system that is an attempt to handle theseconstraints. We evaluate its performances and ability to adapt to new users on a part of the Unipen database.
Dynamic Planar Point Location with Optimal Query Time
Authors: Roberto Tamassia, Franco P. Preparata
Venue:  (1989)

We present a new dynamic technique for locating a point in a convex planar subdivision whose {\em n} vertices lie on a fixed set of {\em N} horizontal lines. The supported update operations are insertion/deletion of vertices and edges and (horizontal) translation of vertices. Our method achieves query time $O(\log n + \log N)$, space $O(N + n \log N)$, and insertion/deletion time $O(\log n \log N)$. Hence, for $N = O(n)$, the query time is $O(\log n)$, which is optimal. The proposed technique, based on the {\em trapezoid method}, provides an efficient solution to many significant applications where the most frequent operation is the point location query, while updates are more rarely executed.
A Correctness Proof for Pipelining in RISC Architecture
Authors: E. Boerger, S. Mazzanti
Venue:  (1996)

We describe a technique for specifying and verifying the control of pipelined microprocessors which can be used where traditional or purely automatic methods do not scale up to complex commercial microprocessor design. We illustrate our approach through a formal specification of Hennessy''s and Patterson''s RISC processor DLX for which we prove the correctness of its pipelined model with respect to the sequential model. First we concentrate our attention on the provably correct refinement of the sequential ground model DLX to the pipelined parallel version DLX_p in which structural hazards (resource conflicts) are eliminated. Then we extend the result to the model DLX_data in which also data hazards for not jump instructions are treated. The next step consists of building the model DLX_control in which control hazards are eliminated. In the last step we define DLX_pipe and prove that it refines DLX_control correctly and takes care also of data hazards relative to jump instructions. Due to the systematic use of successive refinements, which are organized around the different pipelining problems and the methods for their solution, our approach can be applied for the design-driven verification as well as for the verification-driven design of RISC cores at any level of abstraction. The proof method supports the designer''s intuitive reasoning; ``local'''' argumentations, which are typical for incremental design and for optimizations, are supported by the semantical modularity of the design and proof method. The specification method supports the descriptive part of the designer''s actual work; it is general and can be applied to other microprocessors and pipelining techniques as well. Since our models come in the form of evolving algebras, they can be made executable by evolving algebra interpreters and can thereby be used for (prototypical) simulations. NOTE: The first author wants to express his thanks to $DIMACS$ for the hospitality during the Fall of 1995 when part of this work was done.
Advances in Computational Intelligence: Theory and Practice
Authors: Hans-Paul Schwefel
Venue:  (2002)

:The 30 coherently written chapters by leading researchers presented in this anthology are devoted to basic results achieved in computational intelligence since 1997. The book provides complete coverage of the core issues in the field, especially in fuzzy logic and control as well as for evolutionary optimization algorithms including genetic programming, in a comprehensive and systematic way. Theoretical and methodological investigations are complemented by prototypic applications for design and management tasks in electrical engineering, mechanical engineering, and chemical engineering. This book will become a valuable source of reference for researchers active in computational intelligence. Advanced students and professionals interested in learning about and applying advanced techniques of computational intelligence will appreciate the book as a useful guide enhanced by numerous examples and applications in a variety of fields.
On Goedel Speed-Up and Succinctness of Language Representation
Authors: Juris Hartmanis
Venue:  (1982)

In this note we discuss the similarities and differences between Goedel''s result about non-recursive shortening of proofs of formal systems by additional axioms and the corresponding results about the succinctness of different representations of languages.
Parallel Max Cut Approximations
Authors: Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
Venue:  (1993)

Given a graph with positive integer edge weights one may ask whether there exists an edge cut whose weight is bigger than a given number. This problem is NP-complete. We present here an approximation algorithm in NC which provides tight upper bounds to the proportion of edge cuts whose size is bigger than a given number. Our technique is based on the methods to convert randomized parallel algorithms into deterministic ones introduced by Karp and Wigderson. The basic idea of those methods is to replace an exponentially large sample space by one of polynomial size. In this work, we prove the interesting result that the statistical distance of random variables of the small sample space is bigger than the statistical distance of corresponding variables of the exponentially large space, which is the space of all edge cuts taken equiprobably.
Dynamic Window-Based Traffic-Smoothing for Optimal Delivery of Online VBR Media Streams
Authors: Ray-I Chang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Traffic-smoothing for delivery of online VBR media is one of the most important problems in designing streaming multimedia applications. Given the available client buffer b and playback delay D, [21] introduces a window-based approach called SLWIN(k) to smooth online generated traffic for the pre-specified window size W \math and sliding distance k (k _ W). The required time complexity is O(n*W/k) where n is the number of media frames. Note that, by using the maximum sliding distance W, SLWIN(W) has the minimum computation cost O(n). However, the required peak bandwidth is large. Although SLWIN(1) with the minimum sliding distance 1 can achieve small peak bandwidth, it requires O(n*W) computation cost. As there is a tradeoff between the required peak bandwidth and computation cost, it is hard to decide the best sliding distance k for the conventional static window-sliding SLWIN(k) method.In this paper, a novel dynamic window-sliding scheme is proposed. Our approach can dynamically adjust the sliding distance of window to minimize both the computation cost and the peak bandwidth for online traffic smoothing. Given the same client buffer, playback delay and window size, our allocated peak bandwidth can be the same as that achieved by SLWIN(1). Besides, our computation cost is the same as that required for SLWIN(W). 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
Degree-constrained multicasting in point-to-point networks
Authors: F. Bauer, A. Varma
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In this paper, we study algorithms for finding efficient multicast trees in the presence of constraints on the copying ability of the individual switch nodes in the network. We refer to this problem as the degree-constrained multicast tree problem and model it as the degree-constrained Steiner problem in networks. Steiner heuristics for the degree-constrained case are proposed and their simulation results for sparse, point-to-point networks are presented. The results are compared with respect to their quality of solution, cost (running time), and the number of test cases for which no solution could be found. The results of our research indicate that efficient multicast frees can be found in large, sparse networks with small multicast groups even with limited multicast capability in the individual switches. Some of the Steiner heuristics tested yielded degree-constrained multicast trees within 5% of the best heuristic solution found in most of the cases. Even when the fanout of each switch node was restricted to 2, the heuristics we used were able to generate efficient multicast trees in almost all our test networks. Surprisingly few test networks were unsolvable. In those cases where no solution was found by a heuristic, backtracking solved many of the remaining cases. Among the heuristics we used, degree-constrained versions of simple path-distance heuristics such as SPH and SPH-R provided the best tradeoffs between quality of solution and cost.
Algorithms for Drawing Graphs: An Annotated Bibliography
Authors: Peter Eades, Roberto Tamassia
Venue:  (1988)

Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and diagrams for information systems analysis and design. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of computer science. This bibliography constitutes a first attempt to encompass both theoretical and application-oriented papers from disparate areas.
Microsoft ASP.NET Coding Strategies with the Microsoft ASP.NET Team
Authors: Nikhil Kothari, Rob Howard
Venue:  (2003)

Hard-won, real-world knowledge for building world-class ASP.NET applications-based on the experiences of Microsoft developers who have worked with ASP.NET and Microsoft .NET for years.
Agile Database Techniques: Effective Strategies for the Agile Software Developer
Authors: Scott Ambler
Venue:  (2003)

:One of the most fundamental questions object developers face is how to make their objects persist--in other words, how to save them and then restore them at a later time or on a different machine. Although the answer seems simple, in practice object persistence is more complex and more difficult than it looks because the concepts behind object technology and relational databases in which they are saved are so different.This book covers the fundamentals of designing applications that store persistent objects in relational databases. After a basic overview of the technology, the book covers:How to map objects to relational databasesHow implement relationships between objects and between objects and data-basesHow to tackle important implementation issues such as referential integrity, concurency control, historical object support.The detailed examples are provided in Java and are modeled with UML.
Domination in Bounded Interval Tolerance Graphs
Authors: Gur Saran Adhar
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, we present efficient algorithms to solve domination set problem for the class of bounded tolerance graphs. The class of bounded tolerance graphs includes interval graphs and permutation graph as subclasses. Our solution to domination set problem has improved bounds for time complexity than the algorithm for the general co-comparability graphs, which can as well be used for bounded tolerance graphs.
Overview of UltraSAN
Authors: W. D. , . Ii. Obal, M. Akber Quereshi, D. D. Deavours, W. H. Sanders
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

UltraSAN is a software package for model-based evaluation of systems represented as stochastic activity networks (SANs). SANs incorporate features of both stochastic Petri nets and queueing models, where parameters in a model such as case distributions, activity times, state transition rules, and reward variables can be marking dependent. Users may build SAN models using an X-Windows based user interface and choose from a variety of analytic and simulation modules for transient and steady state performance, dependability, and performability measures. Furthermore, the tool facilitates graphical representation of the results obtained by its report generator.
Evolutionary artificial potential field: applications to mobile robot path planning
Authors: Prahlad Vadakkepat, Tong-Heng Lee, Liu Xin
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

This chapter discusses the application of the evolutionary artificial potential field (EAPF) in mobile robot path planning. The parameters of the evolutionary artificial potential field are optimized with the multi-objective evolutionary algorithm. The EAPF is utilized in a robot soccer system.
Software Architect Bootcamp, 2 edition
Authors: Raphael Malveau, Thomas J. Mowbray
Venue:  (2003)

From the Book:PREFACE: PrefaceSoftware architecture is an emerging discipline and an exciting career path for software professionals. We encourage both new and experienced practitioners to read this book as an aid to becoming better software architects. You may have noticed that most software books today do not say much about software architecture. Here, in this volume, we've concentrated the knowledge that you need to be the most effective architect possible.As co-authors, we have lived through the experience of graduating from "member of technical staff" developers to becoming practicing software architects at the most senior levels of our respective companies. We are technical people, not managers, and we enjoy the technical nature of our work. We enjoy parity of salary and benefits with the senior managers at our respective firms. In other words, we are none-the-worse-for-wear as a consequence of choosing a software architecture career. We think that many of our readers would like to gain from our experience. Hence this book.This is more than a book about software architecture. It is a field manual that can train you. We choose the pseudomilitary style, because it embodies an essential attitude. As a software architect, you need many survival skillssome technical, some political, some personal. While neither author has military experience, we have seen software architecture become a battleground in many ways. It is a battleground of ideas, as developers compete to forward their own comcepts. It is a battle ground for control of key design decisions that may be overruled by managers or developers, perhaps covertly. It is a battleground with manyrisks,since architects are responsible for a much wider range of technical and process risks than most managers or individual developers.If you are a practicing software architect, we know that you are a busy professional. After buying this book, we would suggest that you peruse the table of contents and the index for topics that are new to you. Focus on those sections first. When you have time, we suggest that you attempt a cover-to-cover read-through, to familiarize yourself with all of the covered topics and terminology.If you are new to architecture and want to become a software architect, we suggest that you do a cover-to-cover read-through beginning with the first chapter. Work the exercises provided, which will add an experiential learning element to your experience base.Raphael MalveauThomas J. Mowbray, Ph.D.McLean, Virginia, U.S.A.
Establishing Reuse Measurement Practices in SAP Requirements Engineering
Authors: Maya Daneva
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

This paper reports on first attempts to define, apply and fully integrate some reuse measurement practices into the SAP requirements engineering activities. It addresses all the facets of the context for SAP requirements reuse measurement and indicates who reuse metrics data are collected for, where and when during the RE process reuse measurements are made, what counting standards are appropriate, and what action items can be taken based on the reuse measurements.