ppxscal/embedding_network huggingface dataset:
Estimating operational benefits of aircraft navigation and air traffic control procedures using an integrated aviation modeling and evaluation platform
Authors: Ralf H. Mayer
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Complex constraints generally define the performance of air transportation systems. These constraints include aircraft operational characteristics, airline operating procedures, and Air Traffic Control (ATC) requirements. The operational variability that is present in complex air transportation systems and their components typically demands a Monte Carlo approach when modeling system performance metrics. However, the inherent variability is generally not known a priori. This calls for a separate model validation approach that yields estimates of system variability and validates baseline model performance. This paper reports on an integrated aviation modeling platform that was developed for comparing and evaluating proposed aircraft flight operations and ATC procedures. It integrates both an agent-based Monte Carlo modeling environment and a data-driven model validation capability. The capabilities are outlined, the validation approach is described, and examples are presented of performance metrics quantifying operational benefits of air navigation procedures that are currently being implemented at major U.S. airports.
A provenly correct translation of Fickle into Java
Authors: D. Ancona, C. Anderson, F. Damiani, S. Drossopoulou, P. Giannini, E. Zucca
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2007)

We present a translation from Fickle, a small object-oriented language allowing objects to change their class at runtime, into Java. The translation is provenly correct in the sense that it preserves the static and dynamic semantics. Moreover, it is compatible with separate compilation, since the translation of a Fickle class does not depend on the implementation of used classes. Based on the formal system, we have developed an implementation. The translation turned out to be a more subtle problem than we expected. In this article, we discuss four possible approaches we considered for the design of the translation and to justify our choice, we present formally the translation and proof of preservation of the static and dynamic semantics, and discuss the prototype implementation. Moreover, we outline an alternative translation based on generics that avoids most of the casts (but not all) needed in the previous translation. The language Fickle has undergone and is still undergoing several phases of development. In this article we are discussing the translation of FickleII.
Improved genetic algorithm for VLSI floorplan design with non-slicing structure
Authors: Yosuke Kimura, Kenichi Ida
Venue: Computers and Industrial Engineering (2006)

Floorplan design is an important engineering problem. This problem can be modeled as a combinatorial optimization problem, in which a given set of rectangles in floorplan must be arranged. The goal is to find the arrangement with minimum area and minimum interconnection. Floorplans can be classified into slicing structure and non-slicing structure problems. In both problem types, it is difficult to obtain a true optimal solution in a time that could be used in practice. We proposed the new immune algorithm for optimization of the slicing structure problem in the past. In this paper, we focus on and analyze the improved points considered to be especially effective, and propose a new genetic algorithm for the non-slicing structure problem. The proposed method is compared with existing methods using well-known benchmark problems.
Local anisotropy analysis for non-smooth images
Authors: Sandra Bergonnier, François Hild, Stéphane Roux
Venue: Pattern Recognition (2007)

Identification of local anisotropy and determination of principal axes are addressed through different methods that are designed to be tolerant to the non-smooth character of images on the pixel scale. These different tools are validated on various examples, and their performances are compared. The most powerful, robust and accurate method consists in computing the curvature tensor of the auto-correlation function of regularized images using fast Fourier transforms.
Programming Excel with VBA and .NET
Authors: Jeff Webb, Steve Saunders
Venue:  (2006)

Why program Excel? For solving complex calculations and presenting results, Excel is amazingly complete with every imaginable feature already in place. But programming Excel isn't about adding new features as much as it's about combining existing features to solve particular problems. With a few modifications, you can transform Excel into a task-specific piece of software that will quickly and precisely serve your needs. In other words, Excel is an ideal platform for probably millions of small spreadsheet-based software solutions. The best part is, you can program Excel with no additional tools. A variant of the Visual Basic programming language, VB for Applications (VBA) is built into Excel to facilitate its use as a platform. With VBA, you can create macros and templates, manipulate user interface features such as menus and toolbars, and work with custom user forms or dialog boxes. VBA is relatively easy to use, but if you've never programmed before, Programming Excel with VBA and .NET is a great way to learn a lot very quickly. If you're an experienced Excel user or a Visual Basic programmer, you'll pick up a lot of valuable new tricks. Developers looking forward to .NET development will also find discussion of how the Excel object model works with .NET tools, including Visual Studio Tools for Office (VSTO). This book teaches you how to use Excel VBA by explaining concepts clearly and concisely in plain English, and provides plenty of downloadable samples so you can learn by doing. You'll be exposed to a wide range of tasks most commonly performed with Excel, arranged into chapters according to subject, with those subjects corresponding to one or more Excel objects. With both the samples and important reference information for each object included right in the chapters, instead of tucked away in separate sections, Programming Excel with VBA and .NET covers the entire Excel object library. For those just starting out, it also lays down the basic rules common to all programming languages. With this single-source reference and how-to guide, you'll learn to use the complete range of Excel programming tasks to solve problems, no matter what you're experience level.
Instruction looping, an extension to conditional execution
Authors: B. Ulmann
Venue: ACM SIGARCH Computer Architecture News (1998)

The following article describes an easy to implement but very powerful extension to simple conditional execution based program flow control as used for example in the ARM RISC processors and others.
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Authors: Sean Hallgren
Venue: Journal of the ACM (JACM) (2007)

We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, Pell's equation is x2 &minus; dy2 &equals; 1 and the goal is to find its integer solutions. Factoring integers reduces to finding integer solutions of Pell's equation, but a reduction in the other direction is not known and appears more difficult. The second problem we solve is the principal ideal problem in real quadratic number fields. This problem, which is at least as hard as solving Pell's equation, is the one-way function underlying the Buchmann--Williams key exchange system, which is therefore broken by our quantum algorithm. Finally, assuming the generalized Riemann hypothesis, this algorithm can be used to compute the class group of a real quadratic number field.
Benchmark test of MPSX/370 vs MPS-III
Authors: P. G. Falk
Venue: Issue 22 (December 1977) (1977)

Provide the Management Systems Division of my previous employer with a Mathematical Programming System, MPS, evaluation and ultimately selection compatible with existing and proposed company hardware and software environment. 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
A parallel explicit/implicit time stepping scheme on block-adaptive grids
Authors: Gábor Tóth, Darren L. De Zeeuw, Tamas I. Gombosi, Kenneth G. Powell
Venue: Journal of Computational Physics (2006)

We present a parallel explicit/implicit time integration scheme well suited for block-adaptive grids. The basic idea of the algorithm is that the time stepping scheme can differ in the blocks of the grid for a given time step: an explicit scheme is used in the blocks where the local stability requirement is not violated and an implicit scheme is used in the blocks where the explicit scheme would be unstable. The implicit scheme is second order in time. The non-linear system of equations is linearized with Newton linearization. The linear system is solved with a preconditioned Krylov subspace iterative scheme. The Schwarz type preconditioning is also based on the block structure of the grid. We discuss load balancing for parallel execution and the optimal choice of the time step for speed and robustness. The parallel efficiency of the scheme is demonstrated for the equations of magnetohydrodynamics with a geophysics application in three dimensions. The control of the numerical divergence of the magnetic field in combination with the explicit/implicit time stepping scheme is also discussed.
Creating a Web Site with Flash 8: Visual QuickProject Guide
Authors: David Morris
Venue:  (2005)

Face it: Poorly designed, static Web sites just don't cut it anymore. The Web (not to mention the technology surrounding it) has been around long enough, and people are used to seeing and expect a little razzle-dazzle when they go online. For just $12.99, this compact guide shows you how to deliver it! Whether your boss wants you to jazz up the company's Web site or you're burning the midnight oil trying to pull together some Web animations for a class project, this tightly focused, project-based guide shows you how to start creating Flash animations in an instant! Using big, bold full- pictures and streamlined instructions, it covers just the need-to-know essentials that will get you animating with the latest version of Flash: using the Flash 8 authoring tool, creating and animating graphics, tweening, adding sound, and more!
Solaris(TM) Performance and Tools: DTrace and MDB Techniques for Solaris 10 and OpenSolaris (Solaris Series)
Authors: Richard McDougall, Jim Mauro, Brendan Gregg
Venue:  (2006)

"The Solaris™Internals volumes are simply the best and most comprehensive treatment of the Solaris (and OpenSolaris) Operating Environment. Any person using Solaris--in any capacity--would be remiss not to include these two new volumes in their personal library. With advanced observability tools in Solaris (like DTrace), you will more often find yourself in what was previously unchartable territory. Solaris™ Internals, Second Edition, provides us a fantastic means to be able to quickly understand these systems and further explore the Solaris architecture--especially when coupled with OpenSolaris source availability."--Jarod Jenson, chief systems architect, Aeysis"The Solaris™ Internals volumes by Jim Mauro and Richard McDougall must be on your bookshelf if you are interested in in-depth knowledge of Solaris operating system internals and architecture. As a senior Unix engineer for many years, I found the first edition of Solaris™ Internals the only fully comprehensive source for kernel developers, systems programmers, and systems administrators. The new second edition, with the companion performance and debugging book, is an indispensable reference set, containing many useful and practical explanations of Solaris and its underlying subsystems, including tools and methods for observing and analyzing any system running Solaris 10 or OpenSolaris."--Marc Strahl, senior UNIX engineerSolaris™ Performance and Tools provides comprehensive coverage of the powerful utilities bundled with Solaris 10 and OpenSolaris, including the Solaris Dynamic Tracing facility, DTrace, and the Modular Debugger, MDB. It provides a systematic approach to understanding performance and behavior, including: Analyzing CPU utilization by the kernel and applications, including reading and understanding hardware counters Process-level resource usage and profiling Disk IO behavior and analysis Memory usage at the system and application level Network performance Monitoring and profiling the kernel, and gathering kernel statistics Using DTrace providers and aggregations MDB commands and a complete MDB tutorialThe Solaris™ Internals volumes make a superb reference for anyone using Solaris 10 and OpenSolaris.
Pinnacle Studio 10 for Windows (Visual QuickStart Guide)
Authors: Jan Ozer
Venue:  (2005)

Pinnacle Studio 10 is the latest version of the industry leading home video editing tool aimed at the Windows consumer market. In Pinnacle Studio 10 for Windows: Visual QuickStart Guide, veteran journalist and teacher Jan Ozer tackles Pinnacle Studio version 10 in classic and popular QuickStart style--with step-by-step instructions, plenty of illustrations, and straightforward language. Jan provides the skinny on all popular Studio 10 features like built-in DVD authoring with motion menus and custom navigation; Pan and Zoom, enabling users to quickly create engaging video slideshows from digital photos; SmartMovie II, a tool that let's you create home movies in minutes; dual monitor display; key framing special effects in real-time; and the Instant DVD Recorder. He also covers key Pinnacle Studio Plus 10 features including picture in picture (PIP); Chroma Key effects (green screen); and full HD editing, particularly creating HD slide shows from digital photos. 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
Rapid and brief communication: Face recognition using common faces method
Authors: Yunhui He, Li Zhao, Cairong Zou
Venue: Pattern Recognition (2006)

In this paper, we propose a face recognition method called the commonface by using the common vector approach. A face image is regarded as a summation of a common vector which represents the invariant properties of the corresponding face class, and a difference vector which presents the specific properties of the corresponding face image such as face appearance, pose and expression. Thus, by deriving the common vector of each face class, the common feature of each person is obtained which removes the differences of face images belonging to the same person. For test face image, the remaining vector with each face class is derived with the similar procedure to the common vector, which is then compared with the common vector of each face class to predict the class label of query face by finding the minimum distance between the remaining vector and the common vector. Furthermore, we extend the common vector approach (CVP) to kernel CVP to improve the performance of CVP. The experimental results suggest that the proposed commonface approach provides a better representation of individual common feature and achieves lower error rates in face recognition.
Enhancement of memory pools toward a multi-threaded implementation of the joint integrated mission model (JIMM)
Authors: David W. Mutschler
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The Joint Integrated Mission Model (JIMM) is a legacy real-time discrete-event simulator. Its initial single threaded implementation employed a memory pool to speed up run-time performance and easily checkpoint simulation state. Unfortunately, when JIMM started migrating to a multi-threaded implementation, this legacy memory pool was quickly identified as a bottleneck. This problem is addressed by dividing the memory into large chunks managed by a global controller but where threadspecific memory managers handled lower level memory allocation. This paper will focus on the legacy memory pool in JIMM and enhancements necessary for an efficient multi-threaded implementation.
Media overlay construction via a Markov chain Monte Carlo method
Authors: Hao Luan, Danny H. K. Tsang, Kin Wah Kwong
Venue: ACM SIGMETRICS Performance Evaluation Review (2006)

In this paper, we consider the fairness issue of BT and tackle the problem with a general framework using proactive topology adaptations. The topology formed possesses a special link-level homogeneity property with each peer having the same capacity per out-degree value. Such property guarantees that each directional link has the same uploading bandwidth. Together with the Tit-for-Tat policy, peers upload and download at the same rate over each connection and therefore achieve fairness.
A framework to deal with interference in connectionist systems
Authors: Vicente Ruiz de Angulo
Venue: AI Communications (2000)

We analyze the conditions under which a memory system is prone to interference between new and old items. Essentially, these are the distributedness of the representation and the lack of retraining. Both are, however, desirable features providing compactness and speed. Thus, a two&dash;stage framework to palliate interference in this type of systems is proposed based on exploiting the information available at each moment. The two stages are separated by the instant at which a new item becomes known: (a) interference prevention, prior to that instant, consists in preparing the system to minimize the impact of learning new items and (b) retroactive interference minimization, posterior to that instant, seeks to learn the new item while minimizing the damages inflicted on the old items. The subproblems addressed at the two stages are stated rigorously and possible methods to solve each of them are presented.
Dazzle dart: reflections on computer games
Authors: Harold Abelson
Venue: ACM SIGCUE Outlook (1975)

One of the striking things about the current crop of "educational computer games" is the generally tame and above all <u>stingy</u> way in which they use computational resources. Computer programs select random numbers, display game boards, and prompt players to guess secret words or numbers. In almost every case these things can be done, not to mention done better, without using a computer at all. It is short-sighted and wasteful to have powerful machines simply replace spinners, game boards, and flash cards.
Behavior of LP models
Authors: C. A. Haverly
Venue: Issue 22 (December 1977) (1977)

An LP analyst or model builder should thoroughly understand the way an LP model behaves. It's behavior is not identical to the behavior of the process which is being modelled. Nor does an LP model select decisions in the same way as human decision makers. However, by thoroughly understanding LP model behavior the analyst and model builder has a much better chance of using an LP model to make or guide rational decisions in the real world. 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
Graph matching and clustering using spectral partitions
Authors: Huaijun Qiu, Edwin R. Hancock
Venue: Pattern Recognition (2006)

Although inexact graph-matching is a problem of potentially exponential complexity, the problem may be simplified by decomposing the graphs to be matched into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework and hence rendered suitable for parallel computation. In this paper we describe a spectral method which can be used to partition graphs into non-overlapping subgraphs. In particular, we demonstrate how the Fiedler-vector of the Laplacian matrix can be used to decompose graphs into non-overlapping neighbourhoods that can be used for the purposes of both matching and clustering.
Efficient inference on known phylogenetic trees using Poisson regression
Authors: Saharon Rosset
Venue: Bioinformatics (2007)

Motivation: We suggest the use of Poisson regression for time inference and hypothesis testing on a bifurcating Phylogenetic tree with known topology. This method is computationally simple and naturally accommodates variable substitution rates across different sites, without requiring the estimation of these rates. We identify the assumptions under which this is a maximum-likelihood inference approach and show that in some realistic situations---in particular, when the probability of repeated mutation within each branch of the tree is small---these assumptions hold with high probability. Results: Our motivating domain is human mitochondrial DNA trees, and we illustrate our method on a problem of estimating the time to most recent common ancestor of all non-African mtDNA, using publicly available data. We test for molecular clock violations using multiple comparisons, and conclude that the global molecular clock hypothesis cannot be rejected based on these data. Contact: srosset@us.ibm.com
An approach to the software quality management
Authors: E. M. Lavrishcheva, G. I. Koval, T. M. Korotun
Venue: Cybernetics and Systems Analysis (2006)

This article is devoted to an engineering approach to software quality management. The approach is oriented toward the attainment of the software maturity, which is a key software quality characteristic. A model of quality and a conceptual model for making decisions on software quality management are developed. They are based on methods of specification of quality requirements to the maturity of software components, defect prediction, and systematic quantitative reliability control during software development. A graphical defect prediction model (a Bayesian Belief Network) is presented.
iSimBioSys: A Discrete Event Simulation Platform for 'in silico' study of biological systems
Authors: Samik Ghosh, Preetam Ghosh, Kalyan Basu, Sajal K. Das, Simon Daefler
Venue: Proceedings of the 39th annual Symposium on Simulation (2006)

With the availability of huge databases cataloguing the various molecular "parts of complex biological systems, researchers from multiple disciplines have focused on developing modeling and simulation tools for studying the variability of cellular behavior at a system level - encompassing the dynamics arising from many species of interacting molecules. In this work, we present a system engineering approach to model biological processes. In this approach, a biological process is modeled as a collection of interacting functions driven in time by a set of discrete events. We focus on the discrete event simulation platform, called "iSimBioSys, which we have developed for studying the dynamics of cellular processes in silico. As a testbed for studying our approach we model the two component PhoPQ system, responsible for the expression of several virulence genes in Salmonella Typhimurium. We analyzed the effect of extra cellular magnesium on the behavioral dynamics of this pathway using our framework and compared the results with an experimental system. We also analyze the performance of iSimBioSys, based on the model biological system, in terms of system usage and response.