ppxscal/embedding_network huggingface dataset:
Proceedings of the 38th conference on Winter simulation
Authors: L. Felipe Perrone, Barry G. Lawson, Jason Liu, Frederick P. Wieland
Venue: Winter Simulation Conference (2006)

The Winter Simulation Conference (WSC) is recognized as the premiere international conference for simulation professionals in discrete and combined discrete-continuous simulation; WSC is always located in stimulating locations, in 2006 we are delighted to hold the conference for the first time in Monterey, CA.The conference theme this year is New Horizons, emphasizing exciting new directions in simulation that our program reflects. For the first time WSC'06 offers an intensive pre-conference workshop on simulation, Simulation 101, where participants learn about discrete-event simulation in a day-long setting that includes lecture and hands-on laboratory exercises. Forward looking, WSC'06 includes timely offerings in Computational Systems Biology, in Homeland Security, and case studies from industry. WSC'06 continues its long history of providing high quality introductory and advanced tutorials taught by leaders in the field, and 11 tracks and 12 mini-tracks allowing one to concentrate in one industry, or sample the most current work from the full range of simulation specialties.For almost forty years the Winter Simulation Conference (WSC) has brought together academics, practitioners, and vendors interested in discrete and combined discrete-continuous simulation. WSC enjoys the reputation of being the largest conference in these areas, with the highest quality program. It is a conference organized primarily by volunteers. WSC is governed by a Board of Directors, who represent the sponsoring organizations.
QUICKPIC: a highly efficient particle-in-cell code for modeling wakefield acceleration in plasmas
Authors: C. Huang, V. K. Decyk, C. Ren, M. Zhou, W. Lu, W. B. Mori, J. H. Cooley, T. M. Antonsen,  Jr., T. Katsouleas
Venue: Journal of Computational Physics (2006)

A highly efficient, fully parallelized, fully relativistic, three-dimensional particle-in-cell model for simulating plasma and laser wakefield acceleration is described. The model is based on the quasi-static or frozen field approximation, which reduces a fully three-dimensional electromagnetic field solve and particle push to a two-dimensional field solve and particle push. This is done by calculating the plasma wake assuming that the drive beam and/or laser does not evolve during the time it takes for it to pass a plasma particle. The complete electromagnetic fields of the plasma wake and its associated index of refraction are then used to evolve the drive beam and/or laser using very large time steps. This algorithm reduces the computational time by 2-3 orders of magnitude. Comparison between the new algorithm and conventional fully explicit models (OSTRIS) is presented. The agreement is excellent for problems of interest. Direction for future work is also presented.
Multi-agent learning model with bargaining
Authors: Haiyan Qiao, Jerzy Rozenblit, Ferenc Szidarovszky, Lizhi Yang
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Decision problems with the features of prisoner's dilemma are quite common. A general solution to this kind of social dilemma is that the agents cooperate to play a joint action. The Nash bargaining solution is an attractive approach to such cooperative games. In this paper, a multi-agent learning algorithm based on the Nash bargaining solution is presented. Different experiments are conducted on a testbed of stochastic games. The experimental results demonstrate that the algorithm converges to the policies of the Nash bargaining solution. Compared with the learning algorithms based on a non-cooperative equilibrium, this algorithm is fast and its complexity is linear with respect to the number of agents and number of iterations. In addition, it avoids the disturbing problem of equilibrium selection.
Advanced VBScript for Microsoft Windows Administrators
Authors: Don Jones, Jeffery Hicks
Venue:  (2006)

Get in-depth instruction, advanced techniques, and best practices for scripting with Microsoft Visual Basic® Scripting Edition (VBScript). The book features ready-to-run scripts with each chapter and a companion CD with sample scripts and utilities.
Microsoft Office 2003 PowerPoint: A Professional Approach, Comprehensive w/ Student CD, 1 edition
Authors: Deborah Hinkle, Pat R. Graves, Margaret Marple
Venue:  (2004)

McGraw-Hill Technology Education’s Professional Approach Series presents exercises in real-life business situations so students get hands-on experience working on actual projects--the best way to prepare them for the on-the-job challenges they'll face. Each lesson contains up to 25 skill-applications and 5 end-of-unit skill-applications that take students from simple to complex situations. The Office 2003 texts complete instruction in all skill sets and activities for the appropriate Microsoft Office Specialist Certification (MOS) Exams.Table of contents PAS Office PowerPoint 2003 Unit 1 Basic Skills Lesson 1: What is PowerPoint? Lesson 2: Basic Presentation Tools Unit 2 Developing a Presentation Lesson 3: Creating a Presentation Lesson 4: Outlines, Hyperlinks and HTML Lesson 5: Working with Text Unit 3 Customizing a Presentation Lesson 6: Working with Objects Lesson 7: Working with Lines, Fills, and Colors Lesson 8: Formatting Objects Unit 4 Advanced Techniques Lesson 9: Customizing Templates Lesson 10: Controlling Layout Options Lesson 11: Animation and Slide Show Effects Unit 5 Charts, Tables, and Diagrams Lesson 12: Creating a Chart Lesson 13: Modifying a Table Lesson 14: Creating Diagrams for Processes and Relationships Unit 6 Making Presentations Available to Others Lesson 15: Distributing and Presenting Your Work
Acceleration of Test Generation for Sequential Circuits Using Knowledge Obtained from Synthesis for Testability
Authors: Masato Nakazato, Satoshi Ohtake, Kewal K. Saluja, Hideo Fujiwara
Venue: IEICE - Transactions on Information and Systems (2007)

In this paper, we propose a method of accelerating test generation for sequential circuits by using the knowledge about the availability of state justification sequences, the bound on the length of state distinguishing sequences, differentiation between valid and invalid states, and the existence of a reset state. We also propose a method of synthesis for testability (SfT) which takes the features of our test generation method into consideration to synthesize sequential circuits from given FSM descriptions. The SfT method guarantees that the test generator will be able to find a state distinguishing sequence. The proposed method extracts the state justification sequence from the FSM produced by the synthesizer to improve the performance of its test generation process. Experimental results show that the proposed method can achieve 100% fault efficiency in relatively short test generation time.
Correspondence matching using kernel principal components analysis and label consistency constraints
Authors: Hong Fang Wang, Edwin R. Hancock
Venue: Pattern Recognition (2006)

This paper investigates spectral approaches to the problem of point pattern matching. We make two contributions. First, we consider rigid point-set alignment. Here we show how kernel principal components analysis (kernel PCA) can be effectively used for solving the rigid point correspondence matching problem when the point-sets are subject to outliers and random position jitter. Specifically, we show how the point- proximity matrix can be kernelised, and spectral correspondence matching transformed into one of kernel PCA. Second, we turn our attention to the matching of articulated point-sets. Here we show label consistency constraints can be incorporated into definition of the point proximity matrix. The new methods are compared to those of Shapiro and Brady and Scott and Longuet-Higgins, together with multidimensional scaling. We provide experiments on both synthetic data and real world data.
Symbolic modeling of signal transduction in pathway logic
Authors: Carolyn Talcott
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Pathway Logic is a step towards a vision of symbolic systems biology. It is an approach to modeling cellular processes based on formal methods. In particular, formal executable models of processes such as signal transduction, metabolic pathways, and immune system cell-cell signaling are developed using the rewriting logic language Maude and a variety of formal tools are used to query these models. An important objective of Pathway Logic is to reflect the ways that biologists think about problems using informal models, and to provide bench biologists with tools for computing with and analyzing these models that are natural. In this paper we describe the Pathway Logic approach to the modeling and analysis of signal transduction, and the use of the Pathway Logic Assistant tool to browse and query these models. The Rac1 signaling pathway is used to illustrate the concepts.
Learning PHP and MySQL
Authors: Michele E. Davis, Jon A. Phillips
Venue:  (2006)

The PHP scripting language and MySQL open source database are quite effective independently, but together they make a simply unbeatable team. When working hand-in-hand, they serve as the standard for the rapid development of dynamic, database-driven websites. This combination is so popular, in fact, that it's attracting many programming newbies who come from a web or graphic design background and whose first language is HTML. If you fall into this ever-expanding category, then this book is for you.Learning PHP and MySQL starts with the very basics of the PHP language, including strings and arrays, pattern matching and a detailed discussion of the variances in different PHP versions. Next, it explains how to work with MySQL, covering information on SQL data access for language and data fundamentals like tables and statements. Finally, after it's sure that you've mastered these separate concepts, the book shows you how to put them together to generate dynamic content. In the process, you'll also learn about error handling, security, HTTP authentication, and more.If you're a hobbyist who is intimidated by thick, complex computer books, then this guide definitely belongs on your shelf. Learning PHP and MySQL explains everything--from basic concepts to the nuts and bolts of performing specific tasks--in plain English.Part of O'Reilly's bestselling Learning series, the book is an easy-to-use resource designed specifically for newcomers. It's also a launching pad for future learning, providing you with a solid foundation for more advanced development.
Complexity of argument-based default reasoning with specificity
Authors: Xishun Zhao
Venue: AI Communications (2003)

In this paper we investigate the complexity of Dung and Son's approach to default reasoning with specificity. We show that the three decision problems: existence of extensions, brave reasoning and cautious reasoning are generally complete for the second level of the polynomial hierarchy. For some restricted cases, e.g., Horn and 2CNF default theories, all the three problems are intractable although classical brave reasoning in these cases is tractable. Finally, we show that stratification can not reduce the complexity of brave and cautious reasoning although it guarantees the existence of extensions.
Fuzzy Cognitive Maps for stereovision matching
Authors: Gonzalo Pajares, Jesús M. de la Cruz
Venue: Pattern Recognition (2006)

This paper outlines a method for solving the stereovision matching problem using edge segments as the primitives. In stereovision matching the following constraints are commonly used: epipolar, similarity, smoothness, ordering and uniqueness. We propose a new matching strategy under a fuzzy context in which such constraints are mapped. The fuzzy context integrates both Fuzzy Clustering and Fuzzy Cognitive Maps. With such purpose a network of concepts (nodes) is designed, each concept represents a pair of primitives to be matched. Each concept has associated a fuzzy value which determines the degree of the correspondence. The goal is to achieve high performance in terms of correct matches. The main findings of this paper are reflected in the use of the fuzzy context that allows building the network of concepts where the matching constraints are mapped. Initially, each concept value is loaded via the Fuzzy Clustering and then updated by the Fuzzy Cognitive Maps framework. This updating is achieved through the influence of the remainder neighboring concepts until a good global matching solution is achieved. Under this fuzzy approach we gain quantitative and qualitative matching correspondences. This method works as a relaxation matching approach and its performance is illustrated by comparative analysis against some existing global matching methods.
A framework for new generation transportation simulation
Authors: Daiheng Ni
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper discussed the evolution and future trend of simulation in general domain and in transportation. Some challenges facing transportation modeling and simulation were identified. As an effort to address these challenges, a framework of new generation transportation simulation was developed. The framework is envisioned to be multi-scale in resolution, parallel in execution, and driven by objects. The paper further discussed strategies of transportation simulation at a nanoscopic level which offers a level of modeling detail beyond the state-of-the-art.
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks
Authors: Poompat Saengudomlert, Eytan Modiano, Robert G. Gallager
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

We develop on-line routing and wavelength assignment (RWA) algorithms for WDM bidirectional ring and torus networks with N nodes. The algorithms dynamically support all k-allowable traffic matrices, where k denotes an arbitrary integer vector [k1, k2,..., kN], and node i, 1 ≤ i ≤ N, can transmit at most ki wavelengths and receive at most ki wavelengths. Both algorithms support the changing traffic in a rearrangeably nonblocking fashion. Our first algorithm, for a bidirectional ring, uses ⌈(Σi=1N ki)/3⌉ wavelengths in each fiber and requires at most three lightpath rearrangements per new session request regardless of the number of nodes N and the amount of traffic k. When all the ki's are equal to k, the algorithm uses ⌈kN/3⌉ wavelengths, which is known to be the minimum for any off-line rearrangeably nonblocking algorithm. Our second algorithm, for a torus topology, is an extension of a known off-line algorithm for the special case with all the ki's equal to k. For an R × C torus network with R ≥ C nodes, our on-line algorithm uses ⌈kR/2⌉ wavelengths in each fiber, which is the same as in the off-line algorithm, and is at most two times a lower bound obtained by assuming full wavelength conversion at all nodes. In addition, the on-line algorithm requires at most C - 1 lightpath rearrangements per new session request regardless of the amount of traffic k. Finally, each RWA update requires solving a bipartite matching problem whose time complexity is only O(R), which is much smaller than the time complexity O(kCR2) of the bipartite matching problem for an off-line algorithm.
Microsoft Office Word 2003 QuickSteps, 1 edition
Authors: Martin S. Matthews, John Cronan, Lisa McCoy
Venue:  (2004)

We know a picture is worth a thousand words--so we went heavy on pictures and light on words in this easy-to-use guide. Color screenshots and brief instructions show you how to use all of Microsoft Word’s features in no time. Follow along and learn to format text, include graphics, use templates, track and merge comments, create mailing labels, design a great-looking resume, and much more. Each chapter’s “How to” list and color-coded tabs make it easy to flip straight to the tasks you need to do. Get the book that gets you started using Word 2003 right away.Table of contents Chapter 1: Stepping into Word Chapter 2: Working with Documents Chapter 3: Formatting a Document Chapter 4: Customizing a Document Chapter 5: Printing and Using Mail Merge Chapter 6: Using Tables Chapter 7: Working with Graphics Chapter 8: Using Special Features Chapter 9: Creating Web Pages Chapter 10: Using Word with Other People
Axiomatizing the Skew Boolean Propositional Calculus
Authors: R. Veroff, M. Spinks
Venue: Journal of Automated Reasoning (2006)

The skew Boolean propositional calculus ( ${SBPC}$ ) is a generalization of the classical propositional calculus that arises naturally in the study of certain well-known deductive systems. In this article, we consider a candidate presentation of ${SBPC}$ and prove it constitutes a Hilbert-style axiomatization. The problem reduces to establishing that the logic presented by the candidate axiomatization is algebraizable in the sense of Blok and Pigozzi. In turn, this process is equivalent to verifying four particular formulas are derivable from the candidate presentation. Automated deduction methods played a central role in proving these four theorems. In particular, our approach relied heavily on the method of proof sketches.
GRASP with path relinking for the weighted MAXSAT problem
Authors: Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
Venue: Journal of Experimental Algorithmics (JEA) (2007)

A GRASP with path relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper. GRASP, or Greedy Randomized Adaptive Search Procedure, is a randomized multistart metaheuristic, where, at each iteration, locally optimal solutions are constructed, each independent of the others. Previous experimental results indicate its effectiveness for solving weighted MAX-SAT instances. Path relinking is a procedure used to intensify the search around good-quality isolated solutions that have been produced by the GRASP heuristic. Experimental comparison of the pure GRASP (without path relinking) and the GRASP with path relinking illustrates the effectiveness of path relinking in decreasing the average time needed to find a good-quality solution for the weighted maximum satisfiability problem.
Polychronous design of embedded real-time applications
Authors: Abdoulaye Gamatié, Thierry Gautier, Paul Le Guernic, Jean-Pierre Talpin
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2007)

Embedded real-time systems consist of hardware and software that controls the behavior of a device or plant. They are ubiquitous in today's technological landscape and found in domains such as telecommunications, nuclear power, avionics, and medical technology. These systems are difficult to design and build because they must satisfy both functional and timing requirements to work correctly in their intended environment. Furthermore, embedded systems are often critical systems, where failure can lead to loss of life, loss of mission, or serious financial consequences. Because of the difficulty in creating these systems and the consequences of failure, they require rigorous and reliable design approaches. The synchronous approach is one possible answer to this demand. Its mathematical basis provides formal concepts that favor the trusted design of embedded real-time systems. The multiclock or polychronous model stands out from other synchronous specification models by its capability to enable the design of systems where each component holds its own activation clock as well as single-clocked systems in a uniform way. A great advantage is its convenience for component-based design approaches that enable modular development of increasingly complex modern systems. The expressiveness of its underlying semantics allows dealing with several issues of real-time design. This article exposes insights gained during recent years from the design of real-time applications within the polychronous framework. In particular, it shows promising results about the design of applications from the avionics domain.
Constrained free form deformation as a tool for rapid manufacturing
Authors: Leonardo Orazi
Venue: Computers in Industry (2007)

In this study an application of free form deformation for the editing of clouds of points or tessellated surfaces representing industrial parts is presented. The application is based on an efficient implementation of NURBS based free form deformation and the implementation of functions for imposing constraints to position, directions and curvatures of embedded objects. The developed functions permit the direct manipulation of triangulated surfaces eliminating the surface reconstruction stage, reducing the time requested in the reverse engineering process and, at the end, reducing the time to market.
Iterative solution methods
Authors: Robert Beauwens
Venue: Applied Numerical Mathematics (2004)

This presentation is intended to review the state-of-the-art of iterative methods for solving large sparse linear systems such as arising in finite difference and finite element approximations of boundary value problems. However, in order to keep this review within reasonable bounds, we only review those methods for which an algebraic analysis has been achieved.We first review the basic principles and components of iterative solution methods and describe in more detail the main devices used to design preconditioners, showing how the present day complex preconditioners are built through additive and/or multiplicative composition of simpler ones. We also note that acceleration methods may sometimes be viewed, and thus used, as preconditioners.Next, using approximate factorizations as basic flamework, we show how their development led to the study of so-called modified methods and why attention then shifted to specific orderings, of multilevel type. Finally we show how the successful development of multigrid and hierarchical basis methods prompted the introduction of equivalent algebraic techniques: besides recursive orderings, an additional step called stabilization by polynomial preconditioning that plays here the role of the W-cycles of the multigrid method and an algebraic version of V-cycles with smoothing.
Macromedia Flash Professional 8: Training from the Source
Authors: Tom Green, Jordan L. Chilcott
Venue:  (2005)

Offering breakthrough video capabilities and powerful run-time effects, Macromedia Flash Professional 8 is poised to upend the Web video market, posing a serious challenge to Microsoft, RealNetworks, and Apple's efforts in the process. Here to make sure you're ready for itï¾and can start taking advantage of its creative tools, authoring power, flexibility, and rich video capabilities immediatelyï¾is the official Macromedia training for the program. Through 20-plus hours of project-based instruction, you'll learn how to program for the enhanced Flash Player; use ActionScript to create dynamic interactivity; take advantage of new Flash 8 features like the improved script editor (which includes a visual interface), revamped library interface, and new Undo feature; and more. Simple step-by-step instructions peppered with plenty of visual aids and a CD that includes lesson files and a trial version of Flash Professional 8 leave you with a solid understanding of Flash development and the techniques required to tap your creative potential by producing dynamic, interactive content.