ppxscal/embedding_network huggingface dataset:
Temporal abstract classes and virtual temporal specifications for real-time systems
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2002)

The design and development of real-time systems is often a difficult and time-consuming task. System realization has become increasingly difficult due to the proliferation of larger and more complex applications. To offset some of these difficulties, real-time developers have turned to object-oriented methodology. The success of object-oriented concepts in the development of non-real-time programs motivates the relevance of these concepts to achieve similar gains from encapsulation and code reuse in the real-time domain. This article presents an approach of integrating real-time constraint specifications within the constructs of an object-oriented language, affording these constraints a status equivalent to other language elements. This has led to the definition of such novel concepts as temporal abstract classes, virtual temporal constraints, and temporal specification inheritance, which extends inheritance mechanisms to accommodate real-time constraint specifications. These extensions provide real-time developers with the ability to manage and maintain the temporal behavior of a real-time program in a comparable manner to its functional behavior.
Using SPSS to Solve Statistical Problems: A Self Instruction Guide, 1st edition
Authors: Mark A. Davenport, David M. Shannon
Venue:  (2000)

:This book helps users learn to use a variety of SPSS procedures to solve statistical problems and analyze the output. Its step-by-step, screen-by-screen approach explores every SPSS dialog box and window that SPSS users will encounter as they solve statistical problems. It is designed as a self-instructional guide so users can easily follow and learn SPSS while actually using the program. The author(s) provide a brief rationale and real-life examples for each statistical procedure addressed in the book. Presents an illustration of each procedure followed with a thorough discussion and interpretation of the output generated using SPSS. Topics covered include: Retrieving and Saving SPSS Files; Data Entry and Definition; Importing and Merging Data Files; Frequency Analysis; Measures of Central Tendency and Variability; Selecting and Describing Subgroups; Recoding Variables; Computing New Variables; Reliability Analysis; Introduction to Hypothesis Testing; Crosstabulation of Variables; Displaying & Describing Relationships; T-Tests; One-Way and Factorial ANOVA; Paired-Samples T-Test; Within-Subjects and Mixed -Model ANOVA; and Bivariate and Multiple Regression. Intended as a supplemental self-instructional guide for those learning SPSS to solve statistical problems.
Towards semantic software engineering environments
Authors: Ricardo A. Falbo, Giancarlo Guizzardi, Ana C. C. Natali, Gleidson Bertollo, Fabiano F. Ruy, Paula G. Mian
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

Software tools processing partially common set of data should share an understanding of what these data mean. Since ontologies have been used to express formally a shared understanding of information, we argue that they are a way towards Semantic SEEs. In this paper we discuss an ontology-based approach to tool integration and present ODE, an ontology-based SEE.
E-Mail Trouble: Love and Addiction at the Matrix
Authors: S. Paige Baty, Paige Baty
Venue:  (1999)

:"This is about a society of isolates who all communicate with one another from terminal sites. This is about being disembodied, distanced, distinct, and that sort of boundary-thing. It is not about being present. It is not about being there. It is not about a shared history, or a shared meal, or a shared story, or any kind of mutuality. It is about contact between virtual strangers. . . . It happens when you feel that you are so alone that you need anybody to talk to-anybody at all-because you believe that your connections have failed you. This kind of connection leaves you cold and dead inside, because it lacks history and a language of belonging."In this daring, postmodern autobiography, S. Paige Baty recounts her search for love and community on the Internet. Taking Jack Kerouac's On the Road as a point of departure, Baty describes both an actual road trip to meet the object of an e-mail romance and the cyber-search for connection that draws so many people into the matrix of the Internet. Writing in a bold, experimental style that freely mixes e-mails, poems, fragments of quotations, and puns into expository text, she convincingly links e-mail trouble with "female trouble" in the displacement of embodied love and accountable human relationships to opaque screens and alienated identities. Her book stands as a vivid feminist critique of our culture's love affair with technology and its dehumanizing effect on personal relationships. The late S. Paige Baty was also the author of American Monroe: The Making of a Body Politic.
Photoshop, Painter, and Illustrator Side-by-Side, 1st edition
Authors: Wendy Crumpler
Venue:  (2000)

:Photoshop, Illustrator, and Painter are three popular graphics software packages commonly used by production artists and fine artists. When graphic artists use these programs in conjunction, they can achieve effects unknown in any one application. Graphic artist and writer Wendy Crumpler has devised this full-color, one-of-a-kind guide to using these three popular applications together. Her book also features a gallery of artwork illustrating the effects described, reference charts for a quick visual guide to comparing all three programs, and access to a companion Web site with updated charts and information when new versions of the software are released. Shows everyone, at every level, how to unlock new worlds of possibilities by taking advantage of all three applications. Complete with color-coded reference tables, a full-color artist gallery, and a companion Web site, this book is the ultimate reference for designers, illustrators, production artists, and fine artists.
Microsoft Office Quick Reference
Authors: Sue Plumley
Venue:  (1994)

:This is the first quick reference for the variety of applications of the Microsoft Office suite! This handy guide contains alphabetical listings of the essential commands of Word, Excel, PowerPoint, and Microsoft Mail.Includes special tips, cautions, and shortcuts for increased proficiencyA-to-Z organization makes for fast and easy referencingIn-depth information on integrating all the applications
Cyberterrorism and Information Warfare: Threats and Responses
Authors: Yonah Alexander, Michael S. Swetnam
Venue:  (2001)

:About the Author Prof. Yonah Alexander is Senior Fellow and Director, International Center for Terrorism Studies, Potomac Institute for Policy Studies, as well as Director, Inter-University Center for Terrorism Studies and Co-Director, Inter-University Center for Legal Studies. He has published over 70 books in the field of terrorism and international affairs and is founding editor of Terrorism: An International Journal. Michael S. Swetnam is President and Chairman of the Board, Potomac Institute for Policy Studies and serves as a member of the Technical Advisory Group to the U.S. Senate Special Committee on Intelligence. He has published a four-volume set on Cyber Terrorism and Information Warfare (with Prof. Alexander). Table of Contents Governments Perspectives Industrial Perspectives Legal Perspectives Academic Perspectives Bio-Cyber Terrorism: Case Study Selected Documents
Tree-like properties of cycle factorizations
Authors: Ian Goulden, Alexander Yong
Venue: Journal of Combinatorial Theory Series A (2002)

We provide a bijection between the set of factorizations, that is, ordered (n-1)- tuples of transpositions in Jn whose product is (12...n), and labelled trees on n vertices. We prove a refinement of a theorem of J. Dénes (1959, Publ. Math. Inst. Hungar. Acad. Sci. 4, 63-71) that establishes new tree-like properties of factorizations. In particular, we show that a certain class of transpositions of a factorization corresponds naturally under our bijection to leaf edges (incident with a vertex of degree 1) of a tree. Moreover, we give a generalization of this fact.
Benchlearning: Good Examples as a Lever for Development
Authors: Bengt Karlof, Kurt Lundgren, Marie Edenfeldt Froment
Venue:  (2001)

:Further to the success of Bencharking - A Signpost to Excellence in Quality & Productivity, this latest book creates a new concept, 'Benchlearning'. Building from an established level of understanding, this innovative new approach combines the practical technique of benchmarking with the more topical ideas of knowledge management and organisational learning. By so doing, the authors show that it is possible to move on from pure comparison to benefit from the knowledge and experience of others and create a real learning organisation. Examples from a range of organisations including Ericsson, show how to minitor efficiency, provide inspiration for a development drive, and illustrate how to influence people's attitudes. Learning from other people's experience, in combination with the principles of organisational learning, is critical for successful organisational development. Benchlearning principles can be applied to almost any group or company to promote a win-win-win situation: employees performance improves as they learn to develop, customers gain more value and choice, and owners benefit from a more competitive organisation.
Director 8 and Lingo Authorized with Cdrom, 3rd edition
Authors: Phil Gross, Karen Tucker, Macromedia Press, Frank Elley, Kelly Ryer
Venue:  (2000)

:A short course in online movie-making. Learn to use Macromedia Director 8, the powerful, cross-platform application that helps you create dynamic interactive movies for multimedia and Internet productions. Presented in manageable step-by-step sessions, this book helps you learn to use Director 8 at your own pace. The enclosed cross-platform CD-ROM contains all the files you need to work through the lessons, plus completed versions with which you can compare your own results.
Grading essays in computer ethics: rubrics considered helpful
Authors: Barbara Moskal, Keith Miller, L. A. Smith King
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

Computer ethics courses differ from technical courses in the manner in which they are taught and assessed. A common assignment in a computer ethics course is to write an essay that addresses a technical dilemma. Computer science faculty typically do not have training or experience in grading essays. The purpose of this paper is to present a scoring rubric that has been successfully used to grade and track students' knowledge development as they progress through a computer ethics course. Although this paper focuses upon a specific rubric, general principles will be emphasized to show how scoring rubrics can be used across different courses.
Notice: Erratum and Comments on"Initialization of the Simplex Algorithm: An Artificial-Free Approach"
Authors: Jack Macki
Venue: SIAM Review (1998)

Two sets of authors have commented on the Classroom Note by H. Arsham that appeared in the December 1997 issue of SIAM Review (SIAM Rev., 39 (1997), pp. 736-744). The first group consists of Professors Richard W. Cottle of Stanford University, Jong-Shi Pang of Johns Hopkins University, Richard E. Stone of Burnsville, Minnesota, and Craig A. Tovey of Georgia Tech. The second group consists of Andreas Enge and Petra Huhn of the University of Augsburg, Germany. For the details, see http://epubs.siam.org/sirev/97014.htm.
Construction III: using belief networks to assess risk
Authors: Brenda McCabe, Donald Ford
Venue: Proceedings of the 33nd conference on Winter simulation (2001)

This paper reviews two commonly used risk assessment tools, namely weighted scores and expected value. The limitations of weighted scores have been outlined. One of the more difficult aspects of the expected value method is to determine the probability of an event. A probabilistic modeling environment called belief networks, has been proposed as an effective means of modeling the situation. An example application has been provided to show how the integrated system may work.
NetWare for Dummies, 2nd edition
Authors: Ed Tittel, Deni Connor, Earl Follis
Venue:  (1995)

:If you're a NetWare user who's been thrust kicking and screaming onto the network, Networking with NetWare For Dummies, 3rd Edition, is your completely updated lifeline! You'll find plain-English explanations for cryptic commands, curious menus, and offbeat NetWare utilities so that you can successfully navigate -- or manage -- a NetWare network. Get your NetWare network up and running the fun and easy way: Set up and manage a simple NetWare network in no time flat Discover common networking tasks explained in everyday language Find out about IntranetWare, Novell's new approach to TCP/IP-based networking Discover lifesaving information about network cabling, interfaces, servers, and more Get a handle on network interfaces and find out which is best for your needs Configure NetWare for SCSI devices to get the best from CD-ROM players, disk drives, RAID arrays, and scanners -- without hanging up the network Revive failed networks, cure ailing ones, and find out where to get help if you need it Plus, Top Ten Lists of NetWare Tips: Ten things to do when the network's broken Ten things you must know before anyone else can help you Ten unbeatable backup benefits
Embedding of fault-tolerant trees in the Josephus Cube
Authors: Peter K. K. Loh, W. J. Hsu, Amos Omondi
Venue: Proceedings of the seventh Asia-Pacific conference on Computer systems architecture (2002)

The tree interconnection network lends itself to several suitably structured applications. However, the low connectivity at each node, traffic congestion and single point of failure at the root node reduce reliability and availability. Both the hypertree and X-tree are fault-tolerant variants of the basic tree network and have been the focus of more recent implementation and research interest. In this paper, we introduce a recently proposed family of interconnection networks known as the Josephus Cubes and show how hypertrees, X-trees and ringed X-trees of arbitrary height can be near-optimally embedded in this novel interconnection network. Embedding techniques used for both hypertree and X-trees are simple and may be recursively applied.
Specifying Java thread semantics using a uniform memory model
Authors: Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

Standardized language level support for threads is one of the most important features of Java. However, defining the Java Memory Model (JMM) has turned out to be a major challenge. Several models produced to date are not as easily comprehensible and comparable as first thought. Given the growing interest in multithreaded Java programming, it is essential to have a sound framework that would allow formal specification and reasoning about the JMM.This paper presents the Uniform Memory Model (UMM), a generic memory model specification framework. Based on guarded commands, UMM can be easily integrated with a model checking utility, providing strong built-in support for formal verification and program analysis. With a flexible and simple architecture, UMM is configurable to capture different memory consistency requirements for both architectural and language level memory models. An alternative formal specification of the JMM, primarily based on the semantics proposed by Manson and Pugh, is implemented in UMM. Systematic analysis has revealed interesting properties of the proposed semantics. Inconsistencies from the original specification have also been uncovered.
On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
Authors: Liqun Qi, Zengxin Wei
Venue: SIAM Journal on Optimization (1999)

In this paper, we introduce a constant positive linear dependence condition (CPLD), which is weaker than the Mangasarian--Fromovitz constraint qualification (MFCQ) and the constant rank constraint qualification (CRCQ). We show that a limit point of a sequence of approximating Karush--Kuhn--Tucker (KKT) points is a KKT point if the CPLD holds there. We show that a KKT point satisfying the CPLD and the strong second-order sufficiency conditions (SSOSC) is an isolated KKT point. We then establish convergence of a general sequential quadratical programming (SQP) method under the CPLD and the SSOSC. Finally, we apply these results to analyze the feasible SQP method proposed by Panier and Tits in 1993 for inequality constrained optimization problems. We establish its global convergence under the SSOSC and a condition slightly weaker than the Mangasarian--Fromovitz constraint qualification, and we prove superlinear convergence of a modified version of this algorithm under the SSOSC and a condition slightly weaker than the linear independence constraint qualification.
Mastering Windows NT Workstation 4, 2nd edition
Authors: Mark Minasi, Todd Phillips
Venue:  (1999)

:Thoroughly revised and updated for Service Pack 4, Mastering Windows NT Workstation 4 is the ultimate reference for Windows NT Workstation. Every NT Workstation user - from system administrators to corporate and power users - needs this remarkably readable, beginner-to-advanced discussion of essential operations, undocumented features, and secrets from the world's #1 Windows NT authority, Mark Minasi. Comprehensive coverage takes you from simple system navigation to sophisticated optimization and networking techniques.
On the Linear Complexity of the Naor&ndash;Reingold Pseudo-random Function from Elliptic Curves
Authors: Igor E. Shparlinski, Joseph H. Silverman
Venue: Designs, Codes and Cryptography (2001)

We show that the elliptic curve analogue of the pseudo-random number function, introduced recently by M. Naor and O. Reingold, produces a sequence with large linear complexity. This result generalizes a similar result of F. Griffin and I. E. Shparlinski for the linear complexity of the original function of M. Naor and O. Reingold. The proof is based on some results about the distribution of subset-products in finite fields and some properties of division polynomials of elliptic curves.
Analysis of the evolution of peer-to-peer systems
Authors: David Liben-Nowell, Hari Balakrishnan, David Karger
Venue: Proceedings of the twenty-first annual symposium on Principles of distributed computing (2002)

In this paper, we give a theoretical analysis of peer-to-peer (P2P) networks operating in the face of concurrent joins and unexpected departures. We focus on Chord, a recently developed P2P system that implements a distributed hash table abstraction, and study the process by which Chord maintains its distributed state as nodes join and leave the system. We argue that traditional performance measures based on run-time are uninformative for a continually running P2P network, and that the rate at which nodes in the network need to participate to maintain system state is a more useful metric. We give a general lower bound on this rate for a network to remain connected, and prove that an appropriately modified version of Chord's maintenance rate is within a logarithmic factor of the optimum rate.
American McGee's Alice
Authors: Prima Temp Authors, Greg Kramer
Venue:  (2000)

:Remember Lewis Carroll's popular tale, Alice's Adventures in Wonderland? Well, Alice is back in a Wonderland you won't believe! American McGee's Alice features an all-new Alice struggling to save Wonderland from the hands of the evil Queen of Hearts. The third-person adventure game features creepy new locations, frightening enemies, and puzzles that will make your head spin. Inside American McGee's Alice: Prima's Official Strategy Guide, you'll find:In-depth info on all Toysfrom the killer Vorpal Blade to the powerful JackbombComprehensive combat tactics and gameplay trainingThorough details on each character, including Alice and the Queen of HeartsExhaustive puzzle solutionsVital walkthroughs of every landfrom the Village of the Doomed to Queensland
Easy PCs, 2nd edition
Venue:  (1993)

:The revolutionary, full-color way to learn about PCs!Features a unique, easy format that helps even the most intimidated computer userLots of notes and tips to keep the user learningIllustrative before and after screen shots 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
Chance discoveries for making decisions in complex real world
Authors: Yukio Ohsawa
Venue: New Generation Computing (2002)

Chance discovery is to become aware of a chance and to explain its significance, especially if the chance is rare and its significance is unnoticed. This direction matches with various real requirements in human life. This paper presents the significance, viewpoints, theories, methods, and future work of chance discovery. Three keys for the progress are extracted from fundamental discussions on how to realize chance discovery: (1) communication, (2) imagination, and (3) data mining. As an approach to chance discovery, visualized data mining methods are formalized as tools aiding chance discoveries on the basis of these keys.
Peachtree Made Easy, 5th edition
Authors: John V. Hedtke, Connie Brenden
Venue:  (2000)

:Learn Peachtree the Made Easy Way!Peachtree offers a dynamic and easy-to-understand approach for all accounting functions. Expert authors John Hedtke and Connie Brenden provide real-world techniques for mastering accounting mattes such as general ledgers,journals,payrolls,purchase orders,and fixed asset data. Plus,step-by-step "Putting it to Work" sections show you how to streamline your work while offering valuable timesaving advice. This book is your complete guide to managing finances,reducing downtime and,most important,saving money! With expert advice,real-world examples,and in-depth explanations,Peachtree made easy helps you save time and money! Understand daily accounting functions with tutorials and references that show you how to install and configure Peachtree Accounting for Windows Create customized reports,set up general ledgers,and build up your business accounting information Manage your accounts payable transactions and purchase orders Set up payrollsenter and track employee information,calculate federal,state,and local taxes,and create quarter-to-date and year-to-date reports Organize time and billing information to increase accuracy in tracking hours Update and maintain inventory records through Peachtree's automated inventory tracking feature Learn to backup data quickly and easily with the new Backup Wizard Track job costs by job,phase,and cost code Add and dispose of fixed asset data and generate fixed asset management reports Inside! Money-saving coupons for Peachtree services and support from leading third-party vendors.
Internetworking LANs: Operation, Design, and Management
Authors: Robert P. Davidson, Nathan J. Muller
Venue:  (1992)

:Internetworking LANs describes the impact of LAN internets on the business enterprise, providing practical advice on how to navigate the rapidly changing communication environment for competitive advantage. You'll find a thorough description of the various products, services, and technologies that can help your organization streamline its network for optimal efficiency and economy.