ppxscal/embedding_network huggingface dataset:
Prime normal form and equivalence of simple grammars
Authors: Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Venue: Theoretical Computer Science (2006)

A prefix-free language is prime if it cannot be decomposed into a concatenation of two prefix-free languages. We show that we can check in polynomial time if a language generated by a simple context-free grammar is prime. Our algorithm computes a canonical representation of a simple language, converting its arbitrary simple grammar into prime normal form (PNF); a simple grammar is in PNF if all its nonterminals define primes. We also improve the complexity of testing the equivalence of simple grammars. The best previously known algorithm for this problem worked in O(n13) time. We improve it to O(n7 log2 n) and O(n5 polylog v) time, where n is the total size of the grammars involved, and v is the length of a shortest string derivable from a nonterminal, maximized over all nonterminals.
Linux Handbook a Guide to IBM Linux Solutions And Resources
Venue:  (2005)

IBM has a strong commitment to Linux as an operating system and Linux-based solutions. This IBM WhitepaperRedpaper Redbook gives a broad understanding of IBM products and how they relate to the Linux operating system. It tries to encapsulate the IBM Software Solutions that are available for Linux-based servers. It also describes the Linux enablement throughout the IBM eServer product line. This second edition includes a new chapters on Linux Solutions and IBM Storage in a Linux environment. All the other chapters have been revised to cover new IBM announcements, and the amazing growth in Linux adoption. This IBM Redbook offers enough information to give you a high-level understanding of Linux. Therefore, it is not meant to be a highly technical document. It also provides pointers to further sources of information. This redbook is intended for IBM representatives, business partners, and customers who are involved in considering and planning Linux-based software solutions. You will find this redbook particularly helpful if you are planning to test or implement Linux in an enterprise. 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
Tutorial on agent-based modeling and simulation part 2: how to model with agents
Authors: Charles M. Macal, Michael J. North
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Agent-based modeling and simulation (ABMS) is a new approach to modeling systems comprised of interacting autonomous agents. ABMS promises to have far-reaching effects on the way that businesses use computers to support decision-making and researchers use electronic laboratories to do research. Some have gone so far as to contend that ABMS is a new way of doing science. Computational advances make possible a growing number of agent-based applications across many fields. Applications range from modeling agent behavior in the stock market and supply chains, to predicting the spread of epidemics and the threat of bio-warfare, from modeling the growth and decline of ancient civilizations to modeling the complexities of the human immune system, and many more. This tutorial describes the foundations of ABMS, identifies ABMS toolkits and development methods illustrated through a supply chain example, and provides thoughts on the appropriate contexts for ABMS versus conventional modeling techniques.
A novel approach to the fast computation of Zernike moments
Authors: Sun-Kyoo Hwang, Whoi-Yul Kim
Venue: Pattern Recognition (2006)

This paper presents a novel approach to the fast computation of Zernike moments from a digital image. Most existing fast methods for computing Zernike moments have focused on the reduction of the computational complexity of the Zernike 1-D radial polynomials by introducing their recurrence relations. Instead, in our proposed method, we focus on the reduction of the complexity of the computation of the 2-D Zernike basis functions. As Zernike basis functions have specific symmetry or anti-symmetry about the x-axis, the y-axis, the origin, and the straight line y=x, we can generate the Zernike basis functions by only computing one of their octants. As a result, the proposed method makes the computation time eight times faster than existing methods. The proposed method is applicable to the computation of an individual Zernike moment as well as a set of Zernike moments. In addition, when computing a series of Zernike moments, the proposed method can be used with one of the existing fast methods for computing Zernike radial polynomials. This paper also presents an accurate form of Zernike moments for a discrete image function. In the experiments, results show the accuracy of the form for computing discrete Zernike moments and confirm that the proposed method for the fast computation of Zernike moments is much more efficient than existing fast methods in most cases.
Microprogram documentation with design in mind
Authors: C. R. Stevens
Venue: ACM SIGMICRO Newsletter (1983)

This paper discusses the dilemmas of microcode documentation. It discusses the traditional relationship between "designing" microcode and "documenting" microcode. It establishes a different relationship between designing and documenting, one where the primary emphasis is shifted to documentation. The activities of documenting become the "process" by which a quality design can be achieved. A strategic documentation framework combined with a high-level design language to form and test the proper solution is suggested as a means of achieving quality designs. 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
Programming .NET Components, 2nd Edition
Authors: Juval Lowy
Venue:  (2005)

Brilliantly compiled by author Juval Lowy, Programming .NET Components, Second Edition is the consummate introduction to the Microsoft .NET Framework--the technology of choice for building components on Windows platforms. From its many lessons, tips, and guidelines, readers will learn how to use the .NET Framework to program reusable, maintainable, and robust components. Following in the footsteps of its best-selling predecessor, Programming .NET Components, Second Edition has been updated to cover .NET 2.0. It remains one of the few practical books available on this topic. This invaluable resource is targeted at anyone who develops complex or enterprise-level applications with the .NET platform--an ever-widening market. In fact, nearly two million Microsoft developers worldwide now work on such systems. Programming .NET Components, Second Edition begins with a look at the fundamentals of component-oriented programming and then progresses from there. It takes the time to carefully examine how components can simplify and add flexibility to complex applications by allowing users to extend their capabilities. Next, the book introduces a variety of .NET essentials, as well as .NET development techniques. Within this discussion on component development, a separate chapter is devoted to each critical development feature, including asynchronous calls, serialization, remoting, security, and more. All the while, hazardous programming pitfalls are pointed out, saving the reader from experiencing them the hard way. A .NET expert and noted authority on component-oriented programming, Lowy uses his unique access to Microsoft technical teams to the best possible advantage, conveying detailed, insider information in easy-to-grasp, activity-filled language. This hands-on approach is designed to allow individuals to learn by doing rather than just reading. Indeed, after digesting Programming .NET Components, Second Edition, readers should be able to start developing .NET components immediately. Programming .NET Components, Second Edition is the consummate introduction to the Microsoft .NET Framework--the technology of choice for building components on Windows platforms. From its many lessons, tips, and guidelines, readers will learn how to use the .NET Framework to program reusable, maintainable, and robust components. Following in the footsteps of its best-selling predecessor, Programming .NET Components, Second Edition has been updated to cover .NET 2.0. This invaluable resource is targeted at anyone who develops complex or enterprise-level applications with the .NET platform--an ever-widening market.
The impact of loss recovery on congestion control for reliable multicast
Authors: Feng Xie, Gang Feng, Chee Kheong Siew
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Most existing reliable multicast congestion control (RMCC) mechanisms try to emulate TCP congestion control behaviors for achieving TCP-compatibility. However, different loss recovery mechanisms employed in reliable multicast protocols, especially NAK-based retransmission and local loss recovery mechanisms, may lead to different behaviors and performance of congestion control. As a result, reliable multicast flows might be identified and treated as non-TCP-friendly by routers in the network. It is essential to understand those influences and take them into account in the development and deployment of reliable multicast services. In this paper, we study the influences comprehensively through analysis, modelling and simulations. We demonstrate that NAK-based retransmission and/or local loss recovery mechanisms are much more robust and efficient in recovering from single or multiple packet losses within a single round-trip time (RTT). For a better understanding on the impact of loss recovery on RMCC, we derive expressions for steady-state throughput of NAK-based RMCC schemes, which clearly brings out the throughput advantages of NAK-based RMCC over TCP Reno. We also show that timeout effects have little impact on shaping the performance of NAK-based RMCC schemes except for extremely high loss rates (>0.2). Finally, we use simulations to validate our findings and show that local loss recovery may further increase the throughput and deteriorate the fairness properties of NAK-based RMCC schemes. These findings and insights could provide useful recommendations for the design, testing and deployment of reliable multicast protocols and services.
Interacting neural networks and the emergence of social structure: Research Articles
Authors: Christina Stoica-Klüver, Jürgen Klüver
Venue: Complexity (2007)

The article describes a computational model for the simulation of the emergence of social structure or social order, respectively. The model is theoretically based on the theory of social typifying by Berger and Luckmann. It consists of interacting artificial actors (agents), which are represented by two neural networks, an action net, and a perception net. By mutually adjusting of their actions, the agents are able to constitute a self-organized social order in dependency of their personal characteristics and certain features of their environment. A fictitious example demonstrates the applicability of the model to problems of extra-terrestrial robotics. &copy; 2007 Wiley Periodicals, Inc. Complexity 12: 41&ndash;52, 2007(This paper was submitted as an invited paper resulting from the &ldquo;Understanding Complex Systems&rdquo; conference held at the University of Illinois&ndash;Urbana Champaign, May 2005. Much of this material in this article is based on the author's monograph, Dynamical Modeling of the Onset of War (World Scientific Press, 1999). See the monograph for figures, references, and additional discussion.)
Mitigating Dictionary Attacks with Text-Graphics Character CAPTCHAs*Based on "A Text-Graphics Character CAPTCHA for Password Authentication," by M.N. Dailey and C. Namprempre, which appeared in the TENCON 2004 Conference Proceedings, ©2004, IEEE.
Authors: Chanathip Namprempre, Matthew N. Dailey
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

We propose a new construct, the Text-Graphics Character (TGC) CAPTCHA, for preventing dictionary attacks against password authentication systems allowing remote access via dumb terminals. Password authentication is commonly used for computer access control. But password authentication systems are prone to dictionary attacks, in which attackers repeatedly attempt to gain access using the entries in a list of frequently-used passwords. CAPTCHAs (Completely Automated Public Turing tests to tell Computers and Humans Apart) are currently being used to prevent automated "bots" from registering for email accounts. They have also been suggested as a means for preventing dictionary attacks. However, current CAPTCHAs are unsuitable for text-based remote access. TGC CAPTCHAs fill this gap. In this paper, we define two TGC CAPTCHAs and incorporate one of them in a prototype based on the SSH (Secure Shell) protocol suite. We also prove that, if a TGC CAPTCHA is easy for humans and hard for machines, then the resulting CAPTCHA is secure. We provide empirical evidence that our TGC CAPTCHAs are indeed easy for humans and hard for machines through a series of experiments. We believe that a system exploiting a TGC CAPTCHA will not only help improve the security of servers allowing remote terminal access, but also encourage a healthy spirit of competition in the fields of pattern recognition, computer graphics, and psychology.
Simulation of a multiple operating room surgical suite
Authors: Brian T. Denton, Ahmed S. Rahman, Heidi Nelson, Angela C. Bailey
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Outpatient surgery scheduling involves the coordination of several activities in an uncertain environment. Due to the very customized nature of surgical procedures there is significant uncertainty in the duration of activities related to the intake process, surgical procedure, and recovery process. Furthermore, there are multiple criteria which must be traded off when considering how to schedule surgical procedures including patient waiting, operating room (OR) team waiting, OR idling, and overtime for the surgical suite. Uncertainty combined with the need to tradeoff many criteria makes scheduling a complex task for OR managers. In this article we present a simulation model for a multiple OR surgical suite, describe some of the scheduling challenges, and illustrate how the model can be used as a decisions aid to improve strategic and operational decision making relating to the delivery of surgical services. All results presented are based on real data collected at Mayo Clinic in Rochester, MN.
Comparing FB and PS scheduling policies
Authors: Patrick Brown
Venue: ACM SIGMETRICS Performance Evaluation Review (2006)

In this paper we obtain new results concerning the expected response time of the foreground-background (FB) scheduling discipline and its comparison with processor sharing (PS). Some results previously derived for job sizes with finite second moment or bounded sizes, are extended to infinite second moments. New bounds and asymptotic results are also derived. We show that for job sizes with infinite second moment large jobs may benefit from the FB scheduling discipline although this discipline favors short jobs. For certain distributions all jobs sizes may even benefit from FB with respect to PS showing that the performance benefits obtained by some job sizes need not be obtained at the expense of others.
Feature ranking in rough sets
Authors: Keyun Hu, Yuchang Lu, Chunyi Shi
Venue: AI Communications (2003)

The paper proposes a novel feature ranking technique using discernibility matrix. Discernibility matrix is used in rough set theory for reduct computation. By making use of attribute frequency information in discernibility matrix, the paper develops a fast feature ranking mechanism. Based on the mechanism, two heuristic reduct computation algorithms are proposed. One is for optimal reduct and the other for approximate reduct. Empirical results are also reported.
Model composability
Authors: Hessam S. Sarjoughian
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Composition of models is considered essential in developing heterogeneous complex systems and in particular simulation models capable of expressing a system's structure and behavior. This paper describes model composability concepts and approaches in terms of modeling formalisms. These composability approaches along with some of the key capabilities and challenges they pose are presented in the context of semiconductor supply chain manufacturing systems.
IBM Websphere Mq Version 6 and Web Services
Venue:  (2006)

This IBM Redbook illustrates how to integrate WebSphere MQ technology in a Web Services environment. This book provides information about and examples pertaining to this topic, including the fundamental concepts, the technology, and the advanced programming features to help you succeed in your projects. Web Services are fast becoming the platform for application integration. In fact, they are being referred to as the fundamental building blocks of Service-Oriented Architectures. Web Services expedite the move to distributed computing on the Internet or between businesses. WebSphere MQ, the key component of IBM's Enterprise Service Bus, ensures single and reliable message delivery. Multiplatform support enables application integration on heterogeneous networks. WebSphere MQ's application programming interface, features, and adaptors include support for transactional request/reply, tiered, and publish/subscribe application models. The use of WebSphere MQ as a transport mechanism for Web Services is enabled by the support for Apache Axis and Microsoft .NET SOAP infrastructure in WebSphere MQ V6. 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
Java & XML
Authors: Brett McLaughlin, Justin Edelson
Venue:  (2006)

Java and XML, 3rd Edition, shows you how to cut through all the hype about XML and put it to work. It teaches you how to use the APIs, tools, and tricks of XML to build real-world applications. The result is a new approach to managing information that touches everything from configuration files to web sites.After two chapters on XML basics, including XPath, XSL, DTDs, and XML Schema, the rest of the book focuses on using XML from your Java applications. This third edition of Java and XML covers all major Java XML processing libraries, including full coverage of the SAX, DOM, StAX, JDOM, and dom4j APIs as well as the latest version of the Java API for XML Processing (JAXP) and Java Architecture for XML Binding (JAXB). The chapters on web technology have been entirely rewritten to focus on the today's most relevant topics: syndicating content with RSS and creating Web 2.0 applications. You'll learn how to create, read, and modify RSS feeds for syndicated content and use XML to power the next generation of websites with Ajax and Adobe Flash.Topics include:The basics of XML, including DTDs, namespaces, XML Schema, XPath, and TransformationsThe SAX API, including all handlers, filters, and writersThe DOM API, including DOM Level 2, Level 3, and the DOM HTML moduleThe JDOM API, including the core and a look at XPath supportThe StAX API, including StAX factories, producing documents and XMLPullData Binding with JAXB, using the new JAXB 2.0 annotationsWeb syndication and podcasting with RSSXML on the Presentation Layer, paying attention to Ajax and Flash applicationsIf you are developing with Java and need to use XML, or think that you will be in the future; if you're involved in the new peer-to-peer movement, messaging, or web services; or if you're developing software for electronic commerce, Java and XML will be an indispensable companion.
Algorithm 863: L2WPMA, a Fortran 77 package for weighted least-squares piecewise monotonic data approximation
Authors: Ioannis C. Demetriou
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

Fortran software is developed that calculates a best piecewise monotonic approximation to n univariate data contaminated by random errors. The underlying method minimizes the weighted sum of the squares of the errors by requiring k &minus; 1 sign changes in the first divided differences of the approximation, where k is a given positive integer. Hence, the piecewise linear interpolant to the fit consists of k monotonic sections, alternately increasing and decreasing. This calculation can have about O(nk) local minima, because the positions of the turning points of the fit are integer variables of the problem. The method, however, by employing a dynamic programming technique divides the data into at most k disjoint sets of adjacent data and solves a k &equals; 1 problem (monotonic fit or isotonic regression) for each set. So it calculates efficiently a global solution in only O(n&sigma; &plus; k&sigma;2) computer operations when k &ge; 3, where &sigma; is the number of local minima of the data, always bounded by n/2. This complexity reduces to only O(n) when k &equals; 1 or k &equals; 2 (unimodal case). At the end of the calculation a spline representation of the solution and the corresponding Lagrange multipliers are provided. The software package has been tested on a variety of data sets showing a performance that does provide in practice shorter computation times than the complexity indicates in theory. An application of the method on identifying turning points and monotonic trends of data from 1947--1996 on the U.K. pound over the U.S. dollar exchange rate is presented. Generally, the method may have useful applications as, for example, in estimating the turning points of a function from some noisy measurements of its values, or in image and signal processing, or in providing a preliminary or complementary smoothing phase to further analyses of the data.
O'Leary Series: Microsoft Office 2003 Volume II, 1 edition
Authors: Timothy J. O'Leary, Linda I. O'Leary
Venue:  (2004)

The goal of the O’Leary Series is to give students a basic understanding of computing concepts and to build the skills necessary to ensure that an “O’Leary” student has an advantage in whatever career they choose. The text design emphasizes step-by-step instructions with full screen captures that illustrate the results of each step performed. This method allows students to learn at their own pace. Each Tutorial (chapter) combines conceptual coverage with detailed software-specific instructions. A running case that is featured in each tutorial highlights the real-world applications of each software program and leads students step-by-step from problem to solution. Table of contents Microsoft Word 2003 Tutorial 4: Creating a Newsletter Tutorial 5: Creating Complex Tables and Merging Documents Tutorial 6: Creating a Web Site Working Together 2: Linking and Document Collaboration Microsoft Excel 2003 Tutorial 4: Using Solver, Creating Templates, and Evaluating Scenarios Tutorial 5: Using Data Tables, Creating Macros, and Designing Onscreen Forms Tutorial 6: Creating and Using Lists and Web Pages Working Together 2: Reviewing a Workbook and Importing Access Data Microsoft Access 2003 Tutorial 4: Working with Multiple Tables Tutorial 5: Creating Custom Forms Tutorial 6: Creating Custom Reports, Macros, and Switchboards Working Together 2: Exporting and Creating Data Access Pages Microsoft PowerPoint 2003 Tutorial 3: Using Advanced Presentation Features Tutorial 4: Creating a Presentation for a Kiosk and the Web Working Together 2: Reviewing, Embedding, and Broadcasting a Presentation