ppxscal/embedding_network huggingface dataset:
A self documenting technique for systems analysis
Authors: Lois A. Rose
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1978)

Probably the biggest, messiest, most onerous task in systems analysis is documentation. Typically, we produce enormous amounts of highly detailed narrative, together with some fairly general flowcharts. If anybody ever actually reads these documents, they often find redundant and contradictory information. Even though the documents are laden with all the detail we could think of to include, the reader typically walks away muttering, "But what's the system supposed to do?" The feeling is something like expecting floor plans and renderings of your new custom house from the architect, and instead receiving an accounting of the barrels of nails, board-feet of lumber, reels of copper wire, and a carpentry manual. 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
Non-Markovian Quantum Error Deterrence by Dynamical Decoupling in a General Environment
Authors: K. Shiokawa, B. L. Hu
Venue: Quantum Information Processing (2007)

A dynamical decoupling(DD) scheme for the prevention of errors in the non-Markovian (usually corresponding to low temperature, short time, and strong coupling) regimes suitable for qubits constructed out of a multilevel structure is studied. We use the effective spin-boson model (ESBM) introduced recently [K. Shiokawa and B. L. Hu, Phys. Rev. A70, 062106 (2004)] as a low temperature limit of the quantum Brownian oscillator model, where one can obtain exact solutions for a general environment with colored noises. In our decoupling scheme, a train of pairs of strong pulses are used to evolve the interaction Hamiltonian instantaneously. Using this scheme we show that the dynamical decoupling method can suppress 1/f noise with slower and hence more accessible pulses than previously studied, but it still fails to decouple super-Ohmic types of environments.
Macromedia Dreamweaver 8 with ASP, ColdFusion, and PHP: Training from the Source
Authors: Jeffrey Bardzell
Venue:  (2005)

Learn by doing! Follow along, step-by-step, as you upgrade a static HTML site that uses obsolete code to an XML standard-compliant, CSS-formatted dynamic site using Microsoft Active Server Pages (ASP), Macromedia ColdFusion, or the open source PHP. Create several integrated applications for a fictional travel tour operator, including a searchable listing for tour descriptions, country profiles, and a tour price calendar. In this official Macromedia guide, you'll learn how to: Use a relational database-Microsoft Access or MySQL-as the driving force behind a site Use Dreamweaver's built-in server behaviors and application objects to assist in the rapid development of dynamic Web applications Read and hand-code ASP VBScript, ColdFusion Markup Language, and PHP scripts well enough to understand how dynamic Web pages work, troubleshoot errors, and customize scripts Collect andï¾ manipulate user-entered data, performing calculations on the fly Use SQL to pass information between your pages and the database Validate forms using client-side and server-side scripts
Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: a case study based on the apparel industry
Authors: Z. X. Guo, W. K. Wong, S. Y. S. Leung, J. T. Fan, S. F. Chan
Venue: Computers and Industrial Engineering (2006)

An effective job shop scheduling (JSS) in the manufacturing industry is helpful to meet the production demand and reduce the production cost, and to improve the ability to compete in the ever increasing volatile market demanding multiple products. In this paper, a universal mathematical model of the JSS problem for apparel assembly process is constructed. The objective of this model is to minimize the total penalties of earliness and tardiness by deciding when to start each order's production and how to assign the operations to machines (operators). A genetic optimization process is then presented to solve this model, in which a new chromosome representation, a heuristic initialization process and modified crossover and mutation operators are proposed. Three experiments using industrial data are illustrated to evaluate the performance of the proposed method. The experimental results demonstrate the effectiveness of the proposed algorithm to solve the JSS problem in a mixed- and multi-product assembly environment.
IT Certification Success Exam Cram 2
Authors: Ed Tittel, Kim Lindros
Venue:  (2003)

IT Certification Success Exam Cram 2 provides you with a detailed explanation of the certification arena from Ed Tittel, one of the most respected figures in the industry. The book explains the various certification programs, their prerequisites, what can be done with them, and where you might want to go next. Readers preparing for a certification exam find the best-selling Exam Cram 2 series to be the smartest, most efficient way to become certified. This book focuses exactly on what you need to know to get certified now!
Help!!: The Lost Reference: (A Modified Newton Method for Square Roots)
Authors: David G. Carta
Venue: ACM SIGNUM Newsletter (1974)

Around 1970 I saw a journal article describing a modified Newton iteration for square roots. It involved changing the usual factor of 0.5 in xn+1 = 0.5 (xn + a/xn) to cn where cn &rarr; 0.5, thereby increasing the asymptotic rate of convergence from en+1 = 0.5 en2 to en+1 = 0.25 en2. 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
VizScript: visualizing complex interactions in multi-agent systems
Authors: Jing Jin, Rajiv T. Maheswaran, Romeo Sanchez, Pedro Szekely
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

We address the problem of users creating visualizations to debug and understand multi-agent systems. The key challenges are that (1) needs arise dynamically, i.e., it is difficult to know a priori what visualizations one wants, (2) extensive expertise on the system, the algorithms and visualization tools are often needed for implementation, and (3) agents can be running in a distributed environment. We have developed VizScript, a collection of tools to expedite the process of creating visualizations. VizScript combines a generic application instrumentation, a knowledge base, and simple scene definition primitives with a reasoning system, to produce an easy to use visualization system. Using VizScript we were able to recreate the visualizations for a complex multi-agent system with an order-of-magnitude less effort than was required in a Java implementation.
Efficient distributed SAT and SAT-based distributed Bounded Model Checking
Authors: Malay K. Ganai, Aarti Gupta, Zijiang Yang, Pranav Ashar
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2006)

SAT-based Bounded Model Checking (BMC), though a robust and scalable verification approach, still is computationally intensive, requiring large memory and time. Even with the recent development of improved SAT solvers, the memory limitation of a single server rather than time can become a bottleneck for doing deeper BMC search for large designs. Distributing computing requirements of BMC over a network of workstations can overcome the memory limitation of a single server, albeit at increased communication cost. In this paper, we present (a) a method for distributed SAT over a network of workstations using a Master/Client model where each Client workstation has an exclusive partition of the SAT problem and uses knowledge of partition topology to communicate with other Clients, (b) a method for distributing SAT-based BMC using the distributed SAT. For the sake of scalability, at no point in the BMC computation does a single workstation have all the information. We experimented on a network of heterogeneous workstations interconnected with a standard Ethernet LAN. To illustrate, on an industrial design with &#x223c;13 K FFs and &#x223c;0.5 million gates, the non-distributed BMC on a single workstation (with 4 GB memory) ran out of memory after reaching a depth of 120; on the other hand, our SAT-based distributed BMC over 5 similar workstations was able to go up to 323 steps with a communication overhead of only 30%.
Absolute motion and structure from stereo image sequences without stereo correspondence and analysis of degenerate cases
Authors: Jae-Hean Kim, Myung Jin Chung
Venue: Pattern Recognition (2006)

This paper deals with the estimation of motion and structure with an absolute scale factor from stereo image sequences without stereo correspondence. We show that the absolute motion and structure can be determined using only motion correspondences. This property is very useful in two aspects: first, motion correspondence is easier to solve than stereo correspondence because sequences of images can be taken at short time intervals; second, it is not necessary that the rigid scene be included in the intersection of the field of view of the two cameras. It is also shown that the degenerate cases reported in this paper constitute all of the degenerate cases for the scheme and can be easily avoided.
Mobile ad hoc networking and the IETF
Authors: Ian D. Chakeres, Joseph P. Macker
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2006)

This article is part of a continuing series to discuss ongoing activities within the mobile ad hoc networking (MANET) working group (WG) of the IETF. This article provides a brief overview of recent events.
Automated documentation
Authors: Gary Berosik, Kim H. Helseth
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1975)

At General Mills, we tried an automated package on the computer main frame, and we participated in the development of an "industry standard" for documentation. Both experiences yielded largely negative results.
A direct approach to linear programming bounds for codes and tms-nets
Authors: Jürgen Bierbrauer
Venue: Designs, Codes and Cryptography (2007)

Based on a self-contained account of the classical linear programming bounds for codes and orthogonal arrays we give a simplified description of the linear programming bounds for ordered codes, ordered orthogonal arrays (OOA) and tms-nets. The main result is a description in terms of a family of polynomials which generalize the Kravchouk polynomials of coding theory. The Plotkin bound and the sphere packing bound for ordered codes are consequences. We also derive a quadratic bound and illustrate by giving some improvements for bounds on the parameters of tms-nets.
Sams Teach Yourself Perl in 24 Hours (3rd Edition) (Teach Yourself -- Hours)
Authors: Clinton Pierce
Venue:  (2005)

Learn Perl programming quickly and easily with 24 one-hour lessons in Sams Teach Yourself Perl in 24 Hours. The book's step-by-step lessons teach you the basics of Perl and how to apply it in web development and system administration. Plus, the third edition has been updated to include five chapters on new technologies, information on the latest version of Perl, and a look ahead to Perl 6. Sams Teach Yourself Perl in 24 Hours focuses on real-world development, teaching you how to: Effectively use Perl for large development projects using Perl modules Use Perl for data processing Utilize Perl as a "glue" language with other programming languages Use Perl as a web development language 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
Tax Loopholes for eBay Sellers, 1 edition
Authors: Diane Kennedy, Janelle Elms
Venue:  (2005)

Hundreds of Legal Deductions for eBay Sellers! If you’re an online seller, take note: now you can reduce--or even eliminate--the taxes you pay using the insider tips in Tax Loopholes for eBay Sellers. You’ll discover hundreds of little-known, completely legal tax deductions and reporting tips that are unique to eBay and designed to benefit small business owners. Learn what the IRS is looking for when sorting out a real business from a hobby and why it matters. You’ll get step-by-step advice on everything from setting up your business and getting a business license to creating a bookkeeping system. Use the power of eBay and the tax strategies in this book to increase your wealth, protect your assets--and lower your tax bill. How much can you fit into your eBay tax loophole? Learn what the best tax-advantaged business structures are for your type of eBay business Get the free “The 9 Steps to Business Test” to see if your business measures up against IRS guidelines Identify and take advantage of hundreds of legal deductions for eBay business owners Determine how often you will prepare a sales and use tax report based on volume Set up a payroll system with the proper withholding deductions for all employees including yourself Create an accounting system to pay bills, input transactions, record sales, keep track of PayPal fees, and balance your business checkbook
Timing on computers
Authors: W. M. Gentleman, B. A. Wichmann
Venue: ACM SIGARCH Computer Architecture News (1973)

Most computers today provide some form of clock which can be read by software. The purpose of this note is to illustrate why in many existing systems, the facilities offered are inadequate for ordinary programmers. Proposals are made for changes in both hardware and software to remedy these deficiencies.
Architectural assistance to software debugging aids
Authors: Karl Schank
Venue: ACM SIGARCH Computer Architecture News (1973)

It has been observed [1] that 45 to 50% of programming effort is spent in debugging, checkout and testing, yet the architecture of most modern computer systems does little if anything to facilitate ease of debugging. In most batch systems the programmer is sufficiently removed from the execution of his program as to be severely handicapped in diagnosing errors. There is only so much information that can be easily obtained from a voluminous coredump, for instance. Even programmers on large timesharing systems have available at most an interactive software debugging package which operates through a combination of insertions and replacements of object code and interpretation (rather than execution) of machine code. This can get to be quite inefficient when carried to the extreme and often is useful only if the program has been processed by a special compiler.
Aggregation via set partitioning for natural language generation
Authors: Regina Barzilay, Mirella Lapata
Venue: Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics (2006)

The role of aggregation in natural language generation is to combine two or more linguistic structures into a single sentence. The task is crucial for generating concise and readable texts. We present an efficient algorithm for automatically learning aggregation rules from a text and its related database. The algorithm treats aggregation as a set partitioning problem and uses a global inference procedure to find an optimal solution. Our experiments show that this approach yields substantial improvements over a clustering-based model which relies exclusively on local information.
Symbolic representation of two-dimensional shapes
Authors: D. S. Guru, H. S. Nagendraswamy
Venue: Pattern Recognition Letters (2007)

In this paper, we present a method for representing a two-dimensional shape by symbolic features. A shape is represented in terms of multi-interval valued type features. A similarity measure defined over symbolic features that is useful for retrieval of shapes from a shape database is also presented. Unlike other shape representation schemes, the proposed scheme is capable of preserving both contour as well as region information. The proposed method of shape representation and retrieval is shown to be invariant to image transformations (translation, rotation, reflection and scaling) and robust to minor deformations and occlusions. Several experiments have been conducted to demonstrate the feasibility of the methodology and also to highlight its advantages over an existing methodology.
Understanding user behavior in large-scale video-on-demand systems
Authors: Hongliang Yu, Dongdong Zheng, Ben Y. Zhao, Weimin Zheng
Venue: ACM SIGOPS Operating Systems Review (2006)

Video-on-demand over IP (VOD) is one of the best-known examples of "next-generation" Internet applications cited as a goal by networking and multimedia researchers. Without empirical data, researchers have generally relied on simulated models to drive their design and developmental efforts. In this paper, we present one of the first measurement studies of a large VOD system, using data covering 219 days and more than 150,000 users in a VOD system deployed by China Telecom. Our study focuses on user behavior, content access patterns, and their implications on the design of multimedia streaming systems. Our results also show that when used to model the user-arrival rate, the traditional Poisson model is conservative and overestimates the probability of large arrival groups. We introduce a modified Poisson distribution that more accurately models our observations. We also observe a surprising result, that video session lengths has a weak inverse correlation with the video's popularity. Finally, we gain better understanding of the sources of video popularity through analysis of a number of internal and external factors.
Fuzzy risk analysis based on the ranking of generalized trapezoidal fuzzy numbers
Authors: Shi-Jay Chen, Shyi-Ming Chen
Venue: Applied Intelligence (2007)

In this paper, we present a new method for fuzzy risk analysis based on the ranking of generalized trapezoidal fuzzy numbers. The proposed method considers the centroid points and the standard deviations of generalized trapezoidal fuzzy numbers for ranking generalized trapezoidal fuzzy numbers. We also use an example to compare the ranking results of the proposed method with the existing centroid-index ranking methods. The proposed ranking method can overcome the drawbacks of the existing centroid-index ranking methods. Based on the proposed ranking method, we also present an algorithm to deal with fuzzy risk analysis problems. The proposed fuzzy risk analysis algorithm can overcome the drawbacks of the one we presented in [7].
Statistics Hacks: Tips & Tools for Measuring the World and Beating the Odds (Hacks)
Authors: Bruce Frey
Venue:  (2006)

Want to calculate the probability that an event will happen? Be able to spot fake data? Prove beyond doubt whether one thing causes another? Or learn to be a better gambler? You can do that and much more with 75 practical and fun hacks packed into Statistics Hacks. These cool tips, tricks, and mind-boggling solutions from the world of statistics, measurement, and research methods will not only amaze and entertain you, but will give you an advantage in several real-world situations-including business. This book is ideal for anyone who likes puzzles, brainteasers, games, gambling, magic tricks, and those who want to apply math and science to everyday circumstances. Several hacks in the first chapter alone-such as the "central limit theorem,", which allows you to know everything by knowing just a little-serve as sound approaches for marketing and other business objectives. Using the tools of inferential statistics, you can understand the way probability works, discover relationships, predict events with uncanny accuracy, and even make a little money with a well-placed wager here and there.Statistics Hacks presents useful techniques from statistics, educational and psychological measurement, and experimental research to help you solve a variety of problems in business, games, and life. You'll learn how to:Play smart when you play Texas Hold 'Em, blackjack, roulette, dice games, or even the lotteryDesign your own winnable bar bets to make money and amaze your friendsPredict the outcomes of baseball games, know when to "go for two" in football, and anticipate the winners of other sporting events with surprising accuracyDemystify amazing coincidences and distinguish the truly random from the only seemingly random--even keep your iPod's "random" shuffle honestSpot fraudulent data, detect plagiarism, and break codesHow to isolate the effects of observation on the thing observedWhether you're a statistics enthusiast who does calculations in your sleep or a civilian who is entertained by clever solutions to interesting problems, Statistics Hacks has tools to give you an edge over the world's slim odds. 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
Maya 7 for Windows & Macintosh (Visual QuickStart Guide)
Authors: Danny Riddell, Morgan Robinson, Nathaniel Stein
Venue:  (2006)

Adding tools that allow users to realize the 2D Toon look of comic books, cartoons, manga and anime; create spectacular clothing, fur or long hair for characters; and move data quickly back and forth between Maya and Adobe Photoshop or Illustrator, an already cool program just got even cooler. Here to take budding animators and modelers from 0 to 60 fast in Maya 7 is the eagerly anticipated update to everybody's favorite Maya tome: Maya 7: Visual QuickStart Guide! In these pages, best-selling authors Danny Riddell and Steve Anzovin use a combination of task-based instruction and strong visual aids to take readers step by step through all of Maya's essentials: unsurpassed character rigging and posing, integration with essential production tolls such as Photoshop, Illustrator, Flash and more. Both beginning users, who want a thorough introduction to the topic, and more advanced users, who are looking for a convenient reference, will find what they need here in straightforward language and through readily accessible examples, peppered with tons of timesaving tips and tricks. By the end of the volume, users will be creating their own alternate universes in Maya 7!
Keyframe control of complex particle systems using the adjoint method
Authors: Chris Wojtan, Peter J. Mucha, Greg Turk
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

Control of physical simulation has become a popular topic in the field of computer graphics. Keyframe control has been applied to simulations of rigid bodies, smoke, liquid, flocks, and finite element-based elastic bodies. In this paper, we create a framework for controlling systems of interacting particles -- paying special attention to simulations of cloth and flocking behavior. We introduce a novel integrator-swapping approximation in order to apply the adjoint method to linearized implicit schemes appropriate for cloth simulation. This allows the control of cloth while avoiding computationally infeasible derivative calculations. Meanwhile, flocking control using the adjoint method is significantly more efficient than currently-used methods for constraining group behaviors, allowing the controlled simulation of greater numbers of agents in fewer optimization iterations.