ppxscal/embedding_network huggingface dataset:
Virtual Teams: People Working Across Boundaries with Technology, Second Edition, 2nd edition
Authors: Jessica Lipnack, Jeffrey Stamps
Venue:  (2000)

:"Virtual teams and networks-effective, value-based, swiftly reconfiguring, high-performing, cost-sensitive, and decentralized-will profoundly reshape our shared world. As members of many virtual groups, we will all contribute to these ephemeral webs of relationships that together weave our future.&$151;from Virtual Teams, Second Edition There are no such things as boundaries in today's work environment. Virtual teams from all over the world use technologies like the Internet, intranets, and groupware to work together on projects-but the major drawback to these teams is their high failure rate. Virtual Teams examines the numerous problems that arise and provides you with proven techniques to solve them. Written by the two leading experts in networked organizations, this Second Edition shows you how to effectively start, implement, and maintain virtual teams in your own organization. Lipnack and Stamps present a comprehensive framework that makes virtual teams accessible and practical, describing the best practices to use in order to make your group excel. The authors present the 90/10 Rule, which stresses how a virtual team's success is based 90% on the people involved and 10% on the technology. They also take you through the seven steps that every team must complete in order to achieve their results. These include: Creating a team identity Drafting a mission statement and setting goals Determining milestones and establishing a schedule Identifying team members and their roles Choosing the appropriate media Along with the authors' experiences, case studies from Sun Microsystems, Shell Oil, Pfizer, Motorola, Ernst & Young, and others are integrated throughout, offering insights from key executives on virtual teams and adapting to the virtual workplace. With its in-depth look at this increasingly important way to work, Virtual Teams, Second Edition gives you the tools you'll need to create and build a winning virtual team for your own organization. About the Authors: JESSICA LIPNACK and JEFFREY STAMPS, PhD, are cofounders and Directors of NetAge Inc., developers of virtualteams.com&reg;. They are considered the world's leading experts in virtual teams and networked organizations. For over twenty years, they have lectured, consulted, and been widely published. They have also launched virtual organizations (teams) for Fortune 100 companies, small and medium-sized businesses, nonprofit organizations, and more.
Invariant inference for static checking:
Authors: Jeremy W. Nimmer, Michael D. Ernst
Venue: Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering (2002)

Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effectively: it can be difficult to determine a specification and tedious to annotate programs. Automated tools that aid the annotation process can decrease the cost of static checking and enable it to be more widely used.This paper describes an evaluation of the effectiveness of two techniques, one static and one dynamic, to assist the annotation process. We quantitatively and qualitatively evaluate 41 programmers using ESC/Java in a program verification task over three small programs, using Houdini for static inference and Daikon for dynamic inference. We also investigate the effect of unsoundness in the dynamic analysis.Statistically significant results show that both inference tools improve task completion; Daikon enables users to express more correct invariants; unsoundness of the dynamic analysis is little hindrance to users; and users imperfectly exploit Houdini. Interviews indicate that beginning users found Daikon to be helpful; Houdini to be neutral; static checking to be of potential practical use; and both assistance tools to have unique benefits.Our observations not only provide a critical evaluation of these two techniques, but also highlight important considerations for creating future assistance tools.
A Parallel Schwarz Method for a Convection-Diffusion Problem
Authors: M. Garbey, Yu. A. Kuznetsov, Yu. V. Vassilevski
Venue: SIAM Journal on Scientific Computing (2000)

This paper describes a parallel convection-diffusion solver which may be used as part of a Navier--Stokes solver for three-dimensional channel flow at moderately large Reynolds numbers [S. Turek, Efficient Solvers for Incompessible Flow Problems: An Algorithmic Approach in View of Computational Aspects, Springer-Verlag, 1999]. The solver uses a multiplicative Schwarz domain decomposition with overlapping subdomains to solve singularly perturbed convection-diffusion equations where convection is dominant. Upwind finite differences are used for the spatial discretization. The algorithm uses special features of the singularly perturbed convection-diffusion operator. The error due to a local perturbation of the boundary conditions decays extremely fast, in the upwind as well as the crosswind direction, so the overlap in the domain decomposition can be kept to a minimum. The algorithm parallelizes well and is particularly suited for applications in three dimensions. Results of two- and three-dimensional numerical experiments are presented.
People and Project Management in It
Authors: Hadi Jassim, Sue Craig
Venue:  (1995)

:Provides a guide to IT project management. This text can be used either as a means of fast access to ideas and guidelines which can be applied directly at work, or as a more considered guide aimed at promoting an understanding of project management.
Mous Essentials, 1st edition
Authors: Robert Ferrett, John Preston, Sally Preston
Venue:  (2000)

:The authors follow the proven approach of Prentice Hall's Essentials series with an emphasis on step-by-step tutorials with large screen shots, outstanding student pedagogy, and plenty of exercises. This text also includes a number of elements designed to help students study for the MOUS exams. As an additional test preparation tool, the series also includes live computer-based training and assessment with the MOUS Kelly PinPoint CD-ROM. Key Features All MOUS Essentials books are certified to the Expert Level by Microsoft as approved test preparation guides for the MOUS exams. A unique appendix entitled Preparing for MOUS Certification provides information on how to register, what is covered in the tests, how the tests work, and levels of certification. Each Project opens with Required Activities for both levels of the exam objectives. These activities are indicated throughout the Projects by icons distinguishing core vs. expert objectives. Exam Notes and Instide Stuff sidebars provide students with extra tips and tricks on preparing for and taking the MOUS exams. MOUS PinPoint software provides computer-based training and assessment tools for students to complete the projects and practice for the MOUS exams. MOUS PinPoint includes Project Review Tests along with "Show Me" training for each MOUS Exam Skill Set covered within the Project. In addition, each MOUS PinPoint has a capstone final exam that mirrors the actual MOUS exams.
1-2-3 Release 4 for Windows QuickStart
Authors: Paul Freeland, Pat Freeland
Venue:  (1994)

:Pat Freeland provides a complete introduction to Release 4 for Windows. The book is spiral bound with a disk-based exercises designed specifically for the corporate channel. A 32-page insert with exercises and samples is included.
Using 1-2-3 97 for Windows (Special Edition), 1st edition
Authors: Joyce J. Nielsen, Joce Nielson, Susan Plumley
Venue:  (1995)

:With this complete reference, users will learn all of the program features thoroughly, from formatting cells and printing documents, to using pivot tables and developing powerful business presentations. Comprehensive coverage and special sections with expert advice make this a "must-have" for the 1-2-3 user!Includes sections on Techniques from the Pros, Integrating 1-2-3 for Windows with the other SmartSuite applicationsThoroughly covers creating and formatting charts, as well as managing lists/databasesExtensive Index helps readers find information quickly and easily
Using directional antennas for medium access control in ad hoc networks
Authors: Romit Roy Choudhury, Xue Yang, Ram Ramanathan, Nitin H. Vaidya
Venue: Proceedings of the 8th annual international conference on Mobile computing and networking (2002)

Previous research in wireless ad hoc networks typically assumes the use of omnidirectional antennas at all nodes. With omnidirectional antennas, while two nodes are communicating using a given channel, MAC protocols such as IEEE 802.11 require all other nodes in the vicinity to stay silent. With directional antennas, two pairs of nodes located in each other's vicinity may potentially communicate simultaneously, depending on the directions of transmission. This can increase spatial reuse of the wireless channel. In addition, the higher gain of directional antennas allows a node to communicate with other nodes located far away, implying that messages could be delivered to the destination in fewer hops. In this paper, we propose a MAC protocol that exploits the characteristics of directional antennas. Our design focuses on using multi-hop RTSs to establish links between distant nodes, and then transmit CTS, DATA and ACK over a single hop. Results show that our directional MAC protocol can perform better than IEEE 802.11, although we find that the performance is dependent on the topology configuration and the flow patterns in the system.
Electronic Commerce
Authors: Paul Timmers
Venue:  (1999)

:Drawing on case studies of companies such as Marshall Industries, FedEx, Industry.Net, Amazon.com, Citius Belgium and TradeZone, Paul Timmers addresses the critical issues facing managers today as they endeavour to move into a new business environment. Looking at the opportunities and the risks involved, the book provides in-depth practical examples of how innovative companies are developing competitive advantage by doing business on the Internet. The author then goes on to show companies how they can organize their business, by providing a systematic classification of electronic commerce business models and a range of tools for the development of Internet marketing strategies. Finally, a number of scenarios provide a window on the future of business-to-business electronic commerce.
Software Engineering Standards: A User's Road Map, 1st edition
Authors: James W. Moore
Venue:  (1998)

:Describes the scope, roles, uses, and development trends of the most widely used software engineering standards. The book concentrates on important software engineering activities - quality and project management, system engineering, dependability, and safety. The analysis and regrouping of the standard collections exposes you to key relationships between standards. James Moore provides valuable insights that allow you to select standards to fill your specific needs with precision. Software Engineering Standards: A User's Road Map presents two types of diagrams that will guide you in designating and selecting the standards that meet your specific goals. The first is a layered view of standards that illustrates the internal relationships among standards within a collection. The road map, the second type, illustrates the external relationships among standards in same or different collections. By using the road map diagrams each chapter begins at a different starting point and leads you toward the selection of the software engineering standards that achieve your goals.
Provably Good Global Routing of Integrated Circuits
Authors: T. Lengauer, M. Lügering
Venue: SIAM Journal on Optimization (2000)

This paper investigates the global routing problem for integrated circuits. We introduce a formulation on the basis of integer programming which minimizes the routing area among a limited set of Steiner trees for each net. Indeed, the involved cost function depends on the channel density of the routing which has a direct influence on the routing area.Our methods for solving the global routing problem employ local search heuristics, sequential routing, genetic routing, and randomized procedures. Our methods for computing lower bounds are based on linear and Lagrange relaxation. An analysis on the tightness of the bounds indicates that the difference between the cost of the optimal integer solutions and the cost of the optimal fractional solutions is only a small number of tracks in practice. Moreover, the analysis leads to the concept of linear preprocessing by which we exclude a large number of high-cost solutions.We introduce several versions of preprocessing, one of which preserves the opportunity of obtaining a globally optimal solution in general; all of them do so in practice. Linear preprocessing enables us to solve problem instances with several thousand nets provably optimal or at least provably close to optimal.All methods have been implemented in the software package Eridanus. We present computational results.The global routing problem assumes the placement of the chip components to be fixed. An extension of the problem, which we call global layout of integrated circuits, allows the placement to be variable and searches for a placement that minimizes the routing area among a limited set of alternatives. We show that the results concerning the global routing problem can be easily extended to global layout.
Effectively prioritizing tests in development environment
Authors: Amitabh Srivastava, Jay Thiagarajan
Venue: ACM SIGSOFT Software Engineering Notes (2002)

Software testing helps ensure not only that the software under development has been implemented correctly, but also that further development does not break it. If developers introduce new defects into the software, these should be detected as early and inexpensively as possible in the development cycle. To help optimize which tests are run at what points in the design cycle, we have built Echelon, a test prioritization system, which prioritizes the application's given set of tests, based on what changes have been made to the program.Echelon builds on the previous work on test prioritization and proposes a practical binary code based approach that scales well to large systems. Echelon utilizes a binary matching system that can accurately compute the differences at a basic block granularity between two versions of the program in binary form. Echelon utilizes a fast, simple and intuitive heuristic that works well in practice to compute what tests will cover the affected basic blocks in the program. Echelon orders the given tests to maximally cover the affected program so that defects are likely to be found quickly and inexpensively. Although the primary focus in Echelon is on program changes, other criteria can be added in computing the priorities.Echelon is part of a test effectiveness infrastructure that runs under the Windows environment. It is currently being integrated into the Microsoft software development process. Echelon has been tested on large Microsoft product binaries. The results show that Echelon is effective in ordering tests based on changes between two program versions.
Skew handling techniques in sort-merge join
Authors: Wei Li, Dengfeng Gao, Richard Thomas Snodgrass
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Joins are among the most frequently executed operations. Several fast join algorithms have been developed and extensively studied; these can be categorized as sort-merge, hash-based, and index-based algorithms. While all three types of algorithms exhibit excellent performance over most data, ameliorating the performance degradation in the presence of skew has been investigated only for hash-based algorithms. However, for sort-merge join, even a small amount of skew present in realistic data can result in a significant performance hit on a commercial DBMS. This paper examines the negative ramifications of skew in sort-merge join and proposes several refinements that deal effectively with data skew. Experiments show that some of these algorithms also impose virtually no penalty in the absence of data skew and are thus suitable for replacing existing sort-merge implementations. We also show how sort-merge band join performance is significantly enhanced with these refinements.
Passionate Engines: What Emotions Reveal about Mind and Artificial Intelligence
Authors: Craig Delancey
Venue:  (2001)

:In this unique contribution to philosophical debate, Craig DeLancy shows that our best understanding of emotion provides essential insight on key issues in philosophy of mind and artificial intelligence. DeLancy offers us a bold new approach to the study of the mind based on the latest scientific research and provides an accessible overview of the science of emotion, with minimal jargon and explanation of the technical issues that arise.
Classification, Data Analysis, and Data Highways: Proceedings of the 21st Annual Conference of the Gesellschaft Fur Klassifikation E.V., University of Potsdam, March 12-14, 1997
Authors: Ingo Balderjahn, Martin Schader, Rudolf Mathar
Venue:  (1998)

:This volume contains 43 articles dealing with models and methods of data analysis and classification, statistics and stochastics, information systems and WWW - and Internet-related topics as well as many applications. These articles are selected from more than 100 papers presented at the 21st Annual Conference of the Gesellschaft fur Klassifikation.
ARC Macro Language, Developing ARC/INFO Menus and Macros with AML, For UNIX and Windows NT, 2nd edition
Authors: Editors of ESRI Press, l Environmental Systems Research Institute
Venue:  (1999)

:This workbook is designed to help you get work done. AML provides a wide variety of operations to complement ARC/INFO. AML programs organize ARC/INFO commands into sophisticated geoprocessing operations and AML menus provide the basis for combining these operations into a structured, easy-to-use graphical user interface. AML is a programming language which teaches you the programming concepts and techniques necessary to accomplish ARC/INFO tasks and solve application problems. Each lesson includes numerous examples as well as questions and exercises. In summary, AML provides a wide variety of operations to complement ARC/INFO. The best way to learn what AML can do is use it, so buy this book and get started. Be sure to visit the discussion forum for the ARC Macro Language workbook on the World Wide Web at www.esri.com/esribooks. You'll find user discussions and ESRI support information related to the book and CD.
Models of Parallel Applications with Large Computation and I/O Requirements
Authors: Emilia Rosti, Giuseppe Serazzi, Evgenia Smirni, Mark S. Squillante
Venue: IEEE Transactions on Software Engineering (2002)

A fundamental understanding of the interplay between computation and I/O activities in parallel applications that manipulate huge amounts of data is critical to achieving good application performance, as well as correctly characterizing the workloads of large-scale high-performance parallel systems. In this paper, we present a formal model of the behavior of CPU and I/O interactions in scientific applications, from which we derive various formulas that characterize application performance. Our model captures the I/O and CPU activity at different levels of granularity, where results from the model are shown to be in excellent agreement with measurement data from a set of I/O-intensive applications. Using the formulas from our model, which explicitly take I/O activity into account, we also present examples of possible applications of the model.
Primal--Dual Path-Following Algorithms for Semidefinite Programming
Authors: Renato D. C. Monteiro
Venue: SIAM Journal on Optimization (1997)

This paper deals with a class of primal--dual interior-point algorithms for semidefinite programming (SDP) which was recently introduced by Kojima, Shindoh, and Hara [SIAM J. Optim., 7 (1997), pp. 86--125]. These authors proposed a family of primal-dual search directions that generalizes the one used in algorithms for linear programming based on the scaling matrix X1/2S-1/2. They study three primal--dual algorithms based on this family of search directions: a short-step path-following method, a feasible potential-reduction method, and an infeasible potential-reduction method. However, they were not able to provide an algorithm which generalizes the long-step path-following algorithm introduced by Kojima, Mizuno, and Yoshise [Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddor, ed., Springer-Verlag, Berlin, New York, 1989, pp. 29--47]. In this paper, we characterize two search directions within their family as being (unique) solutions of systems of linear equations in symmetric variables. Based on this characterization, we present a simplified polynomial convergence proof for one of their short-step path-following algorithms and, for the first time, a polynomially convergent long-step path-following algorithm for SDP which requires an extra $\sqrt{n}$ factor in its iteration-complexity order as compared to its linear programming counterpart, where n is the number of rows (or columns) of the matrices involved.
Integrating Awareness in CooperativeApplications through the Reaction-DiffusionMetaphor
Authors: Carla Simone, Stefania Bandini
Venue: Computer Supported Cooperative Work (2002)

The paper discusses the notion of awareness from the point of view of the design of a supportive technology. This perspective requires a deeper understanding of the ways and means people adopt to deal with awareness information as well as considering the integration of awareness tools with tools supporting other forms of coordination. First, we suggest to consider two types of awareness: by-product awareness that is generated in the course of the activities people must do in order to accomplish their cooperative tasks; and add-on awareness that is the outcome of an additional activity, which is a neat cost for the cooperating actors in relation to what they must do and is discretional in that it depends on actors' evaluation of the contingent situation. Secondly, we propose a reaction-diffusion metaphor to describe the awareness phenomenology and to take into account the two above-mentioned types of awareness integration. The model of awareness derived from the metaphor makes visible and accessible by different types of users a set of elemental primitives whose flexible composition allows them to construct the awareness mechanisms they dynamically need. These primitives are incorporated in a software module that can be used in combination with coordinative applications for sake of promoting awareness information. The main architecture of the module is presented together with its interoperability with the target application; moreover, a simple example illustrates how the incorporated primitives can be used to build awareness mechanisms.