ppxscal/embedding_network huggingface dataset:
Foundation Game Design with Flash, 1st edition
Authors: Rex van der Spuy
Venue:  (2009)

We've all sneaked the odd five minutes here or there playing the latest Flash game that someone sent round the office, but creating those games is trickier than it looks. The aim of Foundation Game Design with Flash is to take you, even if you've minimal multimedia or programming experience, through a series of step-by-step examples and detailed case studies to the point where you'll have the skills to independently design any conceivable 2D game using Flash and ActionScript. The book is a non-technical one-stop-shop for all the most important skills and techniques a beginner game designer needs to build games with Flash from scratch. Whether you're creating quick blasts of viral amusement, or more in-depth action or adventure titles, this book is for you. Focused and friendly introduction to designing games with Flash and ActionScript 5 detailed case studies of Flash games Essential techniques for building games, with each chapter gently building on the skills of preceding chapters What you'll learn Learn how to build interactive movies and objects with Flash Get a thorough grounding in ActionScript 3.0 and good programming practices, with minimal prior programming experience required Discover how to build Interactive Storybooks, Space-Shooter, Adventure and Drag and Drop games. Master collision detection, Enemy AI systems, player control, managing game data, basic physics and trigonometry. Make use of Design Patterns and Object Oriented Programming techniques to build robust games. Understand the strategies for making games fun to play and easy to build. Who is this book for? This book is for a non-technical creative person who wants to learn the art of videogame design, but has no idea where to start or where to look for help. It is a lucid, friendly and step-by-step guide though all the technical and creative issues involved in game design with Flash and ActionScript. The book treats the art of programming as a creative artistic tool, and will help anyone who may be afraid of programming to love the subject as much as the author does. The techniques in the book are comprehensive enough to form the basis of career as a game designer, and form a solid foundation for continued study of programming and ActionScript. This book is the missing link that will guide and inspire any curious and creative person turn a good game idea into a reality.
On - line parametric identification and discrete optimal command for the aircrafts' longitudinal movement
Authors: Lungu Romulus, Lungu Mihai, Dinca Liviu, Stoenescu Eleonor
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

This paper presents a new ON-LINE parametric identification and discrete optimal command algorithm for mono or multivariable linear systems. The method may be applied with good results to the automatic command of the flying objects' movement. The simulation results obtained with this real time algorithm, with parametric identification for the longitudinal movement of an aircraft is also presented. This algorithm may be used, with good results, for identification and optimal command of an air-air rocket's movement in vertical plain regarding to target's line [1].
Google Docs 4 Everyone, 1st edition
Authors: Steve Holzner, Nancy Holzner
Venue:  (2009)

Who needs expensive, old-fashioned office software? Now, you can do everything online, free, with Google Docs! Experts Steve and Nancy Holzner offer simple, step-by-step instructions and great insider tips for making the most of Googles powerful online word processing, spreadsheet, and presentation tools. Youll get started fast... learn how to create and format professional-quality documents of all kinds... collaborate with colleagues to build better proposals and presentations... use advanced tools like revision history, templates, and charts... discover Google Docs latest features and shortcuts... and a whole lot more! No matter what kind of documents you create, this book can help you do the job better, faster, and more efficiently... and youll never pay for office software again! Youll Learn How To Get your free Google account and set up iGoogle for instant access to your documents Upload and use the documents youve already created with Microsoft Office Use Google Spreadsheet to create charts to display spreadsheet data Master Google Docs easy, powerful document-editing and formatting tools Insert images into your documents and presentations Share documents securely with your colleagues Back up your documents offline and edit them when you dont have an Internet connection Steven Holzner, former contributing editor at PC Magazine, is author of 108 computer books that have sold more than 2.5 million copies. His most recent Pearson book is Facebook Marketing. Nancy Holzner writes and edits technology books from her home in central New York state. Her recent publications include books on Intuit QuickBase and Zoho. Nancy has also worked as a medievalist, a high school teacher, and a corporate trainer. CATEGORY: Productivity Suites COVERS: Google Docs USER LEVEL: Beginning-Intermediate
On darboux property of fuzzy multimeasures
Authors: Nikos E. Mastorakis, Alina Gavrilut, Anca Croitoru, Gabriela Apreutesei
Venue: Proceedings of the 10th WSEAS international conference on Fuzzy systems (2009)

We present some properties regarding Darboux property, non-atomicity, regular fuzziness of multimeasures taking values in the family of all closed nonvoid subsets of a real normed space.
CISM Review Questions, Answers and Explanations Manual 2008 Supplement
Authors: Isaca
Venue:  (2007)

Developed each year, the CISM Review Questions, Answers & Explanations Manual 2008 Supplement is recommended for use when preparing for the 2008 CISM exam. Each edition consists of 100 new sample questions, answers and explanations based on the current CISM job practice areas, using a similar process for item development as is used to develop actual exam items. The questions are intended to provide the CISM candidate with an understanding of the type and structure of questions that have typically appeared on past exams, and were prepared specifically for use in studying for the CISM exam. 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
Capturing software-engineering tacit knowledge
Authors: Abdulmajid Hissen Mohamed
Venue: Proceedings of the 2nd conference on European computing conference (2008)

Knowledge management systems are aimed to provide knowledge-intensive organisations with tools, and methods to better manage their knowledge capital. A great success is gained in the course of managing explicit knowledge in the form documented knowledge fragments. But, greater part of organisations knowledge is realised in tacit form which is volatile and hardly captured in a formal way. Managing this type of knowledge still represents one of the major challenges in knowledge management research. This paper proposes a knowledge model that caters for capturing both tacit and explicit organisational knowledge in the software-engineering domain.
Toward assessing law students' argument diagrams
Authors: Collin Lynch, Kevin Ashley, Niels Pinkwart, Vincent Aleven
Venue: Proceedings of the 12th International Conference on Artificial Intelligence and Law (2009)

The development of graphical argument models is an active and growing area of research in Artificial Intelligence and Law. The aim is to develop models which may be readily used by legal professionals and novices to produce and parse arguments. If this goal is to be realized it is important to develop models that human reasoners can manipulate and assess consistently. We report on an ongoing study of graph agreement in the context of the LARGO system.
Simulating Activities of the Transportation Company through Multi-Agent System Solving the Dynamic Vehicle Routing Problem
Authors: Dariusz Barbucha
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

A wide range of problems arising in practice of transportation companies has a dynamic character, i.e. the required information is not given a priori to the decision maker but is revealed concurrently with the decision-making process. One of the most important group of such problems are dynamic vehicle routing problems, which involve dynamic decision making with respect to vehicle routing in response to the flow of customer demands. The goal of such routing is to provide the required transportation with minimal service cost subject to various constraints. The paper proposes a new approach to solving the dynamic vehicle routing problem using the multi-agent environment.
Approximate mechanism design without money
Authors: Ariel D. Procaccia, Moshe Tennenholtz
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot be applied efficiently. Recent years have seen the design of various truthful approximation mechanisms that rely on enforcing payments. In this paper, we advocate the reconsideration of highly structured optimization problems in the context of mechanism design. We argue that, in such domains, approximation can be leveraged to obtain truthfulness without resorting to payments. This stands in contrast to previous work where payments are ubiquitous, and (more often than not) approximation is a necessary evil that is required to circumvent computational complexity. We present a case study in approximate mechanism design without money. In our basic setting agents are located on the real line and the mechanism must select the location of a public facility; the cost of an agent is its distance to the facility. We establish tight upper and lower bounds for the approximation ratio given by strategyproof mechanisms without payments, with respect to both deterministic and randomized mechanisms, under two objective functions: the social cost, and the maximum cost. We then extend our results in two natural directions: a domain where two facilities must be located, and a domain where each agent controls multiple locations.
What Did You Do At School Today? Using Tablet Technology to Link Parents to their Children and Teachers
Authors: Joshua Underwood, Rosemary Luckin, Lucinda Kerawalla, Benedict du Boulay, Joe Holmberg, Hilary Tunley, Jeanette O'Connor
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

The Homework project is developing an exemplar system for the delivery of adaptive, interactive numeracy and literacy education for children (5 to 7 year olds) at home and in the classroom. We illustrate how a user centred approach has enabled us to specify and go some way towards developing technology to meet the clear need for a better way of helping parents to engage with their children's homework and understand what they have done at school.
Utilizing Ontologies for Petrochemical Applications
Authors: Eric Little, Joseph Eberle, Fred Turino
Venue: Proceeding of the 2008 conference on Formal Ontologies Meet Industry (2008)

This paper discusses some of the current challenges for knowledge exploitation and sharing in petrochemical domains and provides one approach to utilizing ontologies to solve some of those problems. By building ontological profiles that accurately classify kinds of crude oils, petroleum products and refineries, the ontology proved capable of providing significant inferential capabilities that were useful for optimizing numerous phases of the petrochemical life cycle.
Efficient Learning from Few Labeled Examples
Authors: Jiao Wang, Siwei Luo, Jingjing Zhong
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

Active learning and semi-supervised learning are two approaches to alleviate the burden of labeling large amounts of data. In active learning, user is asked to label the most informative examples in the domain. In semi-supervised learning, labeled data is used together with unlabeled data to boost the performance of learning algorithms. We focus here to combine them together. We first introduce a new active learning strategy, then we propose an algorithm to take the advantage of both active learning and semi-supervised learning. We discuss several advantages of our method. Experimental results show that it is efficient and robust to noise.
Rule induction based on an incremental rough set
Authors: Yu-Neng Fan, Tzu-Liang (Bill) Tseng, Ching-Chin Chern, Chun-Che Huang
Venue: Expert Systems with Applications: An International Journal (2009)

The incremental technique is a way to solve the issue of added-in data without re-implementing the original algorithm in a dynamic database. There are numerous studies of incremental rough set based approaches. However, these approaches are applied to traditional rough set based rule induction, which may generate redundant rules without focus, and they do not verify the classification of a decision table. In addition, these previous incremental approaches are not efficient in a large database. In this paper, an incremental rule-extraction algorithm based on the previous rule-extraction algorithm is proposed to resolve there aforementioned issues. Applying this algorithm, while a new object is added to an information system, it is unnecessary to re-compute rule sets from the very beginning. The proposed approach updates rule sets by partially modifying the original rule sets, which increases the efficiency. This is especially useful while extracting rules in a large database.
Attacks on privacy and deFinetti's theorem
Authors: Daniel Kifer
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by using it to attack a popular data sanitization scheme known as Anatomy. We stress that Anatomy is not the only sanitization scheme that is vulnerable to this attack. In fact, any scheme that uses the random worlds model, i.i.d. model, or tuple-independent model needs to be re-evaluated. The difference between the attack presented here and others that have been proposedin the past is that we do not need extensive background knowledge. An attacker only needs to know the nonsensitive attributes of one individual in the data, and can carry out this attack just by building a machine learning model over the sanitized data. The reason this attack is successful is that it exploits a subtle flaw in the way prior work computed the probability of disclosure of a sensitive attribute. We demonstrate this theoretically, empirically, and with intuitive examples. We also discuss how this generalizes to many other privacy schemes.
Flat band voltage control on low Vt metal-gate/high-κ CMOSFETs with small EOT (Invited Paper)
Authors: Albert Chin, M. F. Chang, S. H. Lin, W. B. Chen, P. T. Lee, F. S. Yeh, C. C. Liao, M. -F. Li, N. C. Su, S. J. Wang
Venue: Microelectronic Engineering (2009)

The unwanted high threshold voltage (V"t) is the major challenge for metal-gate/high-@k CMOS especially at small equivalent-oxide-thickness (EOT). We have investigated the high V"t issue that is due to flat-band voltage (V"f"b) roll-off at smaller EOT. A mechanism of charged oxygen vacancies formed by interface reaction was proposed to explain the V"f"b roll-off effect. This interface reaction can be decreased by inserting a thin interfacial SiON and using novel low temperature process. The self-aligned and gate-first metal-gate/high-@k CMOSFETs using these methods have achieved low V"t and good control of V"f"b roll-off at small 0.6-1.2nm EOT.
The Materials Science of Semiconductors, 1st edition
Authors: Angus Rockett
Venue:  (2007)

The book reviews the most relevant concepts of semiconductor materials and processing including condensed matter physics, electronic device theory, and materials science. It describes the development of energy bands from atomic orbitals and the effect of atomic chemistry on the semiconductor. Semiconductor alloys are described including issues of miscibility, ordering, and electronic properties. Defects in semiconductors are described with particular emphasis on point and line defects, their sources and effects. A chapter on amorphous semiconductors is included as well as a chapter on organic materials used in optical and switching devices. The book concludes with chapters on general aspects of thin film nucleation and growth, physical vapor deposition and chemical vapor deposition methods. Examples of the application of the concepts in each chapter to specific problems or situations is included, along with recommended readings and homework problems. 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
Program locality analysis using reuse distance
Authors: Yutao Zhong, Xipeng Shen, Chen Ding
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2009)

On modern computer systems, the memory performance of an application depends on its locality. For a single execution, locality-correlated measures like average miss rate or working-set size have long been analyzed using reuse distance&mdash;the number of distinct locations accessed between consecutive accesses to a given location. This article addresses the analysis problem at the program level, where the size of data and the locality of execution may change significantly depending on the input. The article presents two techniques that predict how the locality of a program changes with its input. The first is approximate reuse-distance measurement, which is asymptotically faster than exact methods while providing a guaranteed precision. The second is statistical prediction of locality in all executions of a program based on the analysis of a few executions. The prediction process has three steps: dividing data accesses into groups, finding the access patterns in each group, and building parameterized models. The resulting prediction may be used on-line with the help of distance-based sampling. When evaluated on fifteen benchmark applications, the new techniques predicted program locality with good accuracy, even for test executions that are orders of magnitude larger than the training executions. The two techniques are among the first to enable quantitative analysis of whole-program locality in general sequential code. These findings form the basis for a unified understanding of program locality and its many facets. Concluding sections of the article present a taxonomy of related literature along five dimensions of locality and discuss the role of reuse distance in performance modeling, program optimization, cache and virtual memory management, and network traffic analysis.
Calculating zeros of the twisted Euler polynomials
Authors: R. P. Agarwal, Young-Ho Kim, C. S. Ryoo
Venue: Neural, Parallel Scientific Computations (2008)

In this paper we introduce the twisted Euler numbers En,wand polynomials En,w(x). Finally, we investigate the zeros of the twisted Euler polynomials.
Proactive learning for building machine translation systems for minority languages
Authors: Vamshi Ambati, Jaime Carbonell
Venue: Proceedings of the NAACL HLT 2009 Workshop on Active Learning for Natural Language Processing (2009)

Building machine translation (MT) for many minority languages in the world is a serious challenge. For many minor languages there is little machine readable text, few knowledgeable linguists, and little money available for MT development. For these reasons, it becomes very important for an MT system to make best use of its resources, both labeled and unlabeled, in building a quality system. In this paper we argue that traditional active learning setup may not be the right fit for seeking annotations required for building a Syntax Based MT system for minority languages. We posit that a relatively new variant of active learning, Proactive Learning, is more suitable for this task.
Functional Verification Coverage Measurement and Analysis, 1st edition
Authors: Andrew Piziali
Venue:  (2007)

Functional Verification Coverage Measurement and Analysis addresses a means of quantitatively assessing functional verification progress. Without this process, design and verification engineers, and their management, are left guessing whether or not they have completed verifying the device they are designing. Using the techniques described in this book, they will learn how to build a toolset which allows them to know how close they are to functional closure. Functional Verification Coverage Measurement and Analysis is the first book to introduce a useful taxonomy for coverage metric classification. Using this taxonomy, the reader clearly understands the process of creating an effective coverage model. A must read! Harry Foster, Jasper Design Automation, Co-Author of Assertion-Based Design Andrew's book is the most thoughtful and comprehensive treatment of coverage I have seen. I recommend reading (and re-reading) this book to anybody who is really serious about functional verification. Yoav Hollander, CTO, Verisity Design In the last few years, coverage has become a must in hardware verification and in software testing. From having to push people to use coverage, the situation changed to great interest... Andrew's excellent and comprehensive book on coverage, the first of its kind, could not have come at a better time. Shmuel Ur, Research Scientist, IBM
Start Computing Here
Authors: Anthony Saulnier
Venue:  (2007)

This guide is your personal assistant and adviser for purchasing hardware, software, or any type of related service. Topics in this book include: Understanding the Basics before Buying, The Brain & Speed Demon of the Computer: The Processor, The King of Storage: The Hard Drive, The King of Software: The Operating System, Sources for Finding Information, Whether to buy a laptop or home computer, Whether you should upgrade your computer or purchase a new one, Thinking First Before Throwing Out That Old System, Connecting To the Internet, Preventing Carpel Tunnel Syndrome & Other Injuries, Printer Paper, Shopping for Software, Hardware, & Services, Keeping a Cool Head, Warranty and Return Policies, Some Things You Need To Know Before Requesting Servicing, Security Sense, Backing Up Your Computer and Files, Getting the Software, Troubleshooting & Who to Contact, Using Common Sense, Where To Get Training, and Legal Issues. 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
Linking Educational Materials to Encyclopedic Knowledge
Authors: Andras Csomai, Rada Mihalcea
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

This paper describes a system that automatically links study materials to encyclopedic knowledge, and shows how the availability of such knowledge within easy reach of the learner can improve both the quality of the knowledge acquired and the time needed to obtain such knowledge.