ppxscal/embedding_network huggingface dataset:
Character orthogonality for the partition algebra and fixed points of permutations
Authors: John Farina, Tom Halverson
Venue: Advances in Applied Mathematics (2003)

We give a closed formula for the trace of the partition algebra Pn(x) acting on an irreducible representation whose basis is indexed by the set partitions of {1,...,n}. This trace counts the set partitions that are fixed under the action of the symmetric group Sn. We use this trace to determine an analog of the "second orthogonality of characters" formula for Pn(x) and to compute the trace of the biregular representation of Pn(x). We use the Schur-Weyl duality between Pn(r) and the symmetric group Sr to study fixed points of random permutations in Sr. In particular, we compute the joint mixed moments of the random variables Tr(σj) for σ ∈ Sr.
A Framework for Performability Modeling of Messaging Services in Distributed Systems
Authors: Srinivasan Ramani, Katerina Goseva-Popstojanova, Kishor S. Trivedi
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Messaging services are a useful component in distributedsystems that require scalable dissemination of messages(events) from suppliers to consumers. These servicesdecouple suppliers and consumers, and take care ofclient registration and message propagation, thus relievingthe burden on the supplier. Recently performance modelsfor the configurable delivery and discard policies found inmessaging services have been developed, that can be usedto predict response time distributions and discard probabilitiesunder failure-free conditions. However, these messagingservice models do not include the effect of failures.In a distributed system, supplier, consumer, and messagingservices can fail independently leading to different consequences.In this paper we consider the expected loss rate associatedwith messaging services as a performability measureand derive approximate closed-form expressions forthree different quality of service settings. These measuresprovide a quantitative framework that allows different messagingservice configurations to be compared and designtrade-off decisions to be made.
Combining Positional Information with Visual Media
Authors: Neill Campbell, Henk Muller, Cliff Randall
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

By integrating visual media with positioning information obtained with our wearable computer, we create new opportunities for using visuals both in the field and at the workstation. The position information we store with each visual is direction, pitch, roll, location, focal length, and zoom. This information allows any system to reconstruct the frustum of the visual, and, if height data is available to reconstruct which parts of the earth are visible in the visual. This enables position based lookup and 3D mosaicing of visuals to reconstruct a 3D model.
Coupled Lighting Direction and Shape Estimation from Single Images
Authors: Dimitrios Samaras, Dimitris Metaxas
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper presents a new method for the simultaneous estimation of lighting direction and shape from shading. The method estimates the shape and the lighting direction using a two step iterative process. We assume an initial (possibly incorrect) estimate of the lighting position. A stiff deformable model is then fitted to the image, assuming this lighting position. Next, a least-squares estimate of the lighting position is derived from the model using the Levenberg-Marquart method.The two steps - model fitting and lighting-position estimation - are iterated. Once the light direction has converged to a stable solution the deformable model stiffness is lowered and the model fits accurately given the lighting model. In addition, we show how the method can be used with either orthographic or perspective projection assumptions. In a variety of experiments on real and synthetic data, the method is robust to errors both to the initial light position and shape estimates.
Object-oriented tree traversal with JJForester
Authors: T. Kuipers, J. M.W. Visser
Venue:  (2000)

We want to use the advanced language processing technology available in the {\sc Asf+Sdf} in combination with general purpose programming languages. In particular, we want to combine the syntax definition formalism {\sc Sdf} and the associated components that support generalized LR parsing, with the object-oriented language Java. To this end, we implemented JJForester, a tool that generates class structures from {\sc Sdf} grammar definitions. The generated class structures implement a number of \emph{design patterns} to facilitate construction and traversal of parse trees represented by object structures. In a detailed case study, we demonstrate how program analyses and transformations can be constructed with JJForester.
Left-looking to Right-looking and vice versa: An Application of Fractal Symbolic Analysis to Linear Algebra Code Restructuring
Authors: Nikolay Mateev, Vijay Menon, Keshav Pingali
Venue:  (2000)

We have recently developed a new program analysis strategy called fractal symbolic analysis that addresses some of limitations of techniques such as dependence analysis. In this paper, we show how fractal symbolic analysis can be used to convert between left-looking and right-looking versions of three kernels of central importance in computational science: Cholesky factorization, LU factorization with pivoting, and triangular solve.
Advanced Computing Research Institute Annual Research Activity Report September 1993 September 1994
Authors: Keshav Pingali
Venue:  (1994)

The Advanced Computing Research Institute (ACRI) is a unit of the Cornell Theory Center and is affiliated with the Cornell Computer Science Department. The ACRI is concerned with research in scientific computation and its application to engineering and scientific problems with the emphasis on the use and potential of advanced computer architecture and environments. Research areas include restructuring compilers for scientific computation, and the design of algorithms for numerical linear algebra, optimization, and differential equations. Currently, ACRI researchers are collaborating on several large-scale applications in the computational sciences, including: protein-folding and related molecular chemistry problems, structural optimization and biomechanics, particle methods for turbulent combustion, discrete-control problems, and the application of boundary element methods. The parallel computers available to ACRI for research include the Theory Center machines a 128-node KSR computer, a 64-node IBM SP, and a network of IBM RS/6000s. This report contains a short summary of the progress made in the last year on each of the four main projects: parallelizing compilers, computational linear algebra, computational optimization, and numerical methods for partial differential equations. Included also are a list of ACRI researchers and their research interests, a list of technical reports produced this last year, and a list of ACRI seminars.
DEPENDABILITY AND PERFORMABILITY ANALYSIS
Authors: Kishor S. Trivedi, Gianfranco Ciardo, Manish Malhotra, Author:
Venue:  (1993)

In this tutorial, we discuss several practical issues regarding specification and solution of dependability and performability models. We compare model types with and without rewards. Continuous-time Markov chains (CTMCs) are compared with (continuous-time) Markov reward models (MRMs) and generalized stochastic Petri nets (GSPNs) are compared with stochastic reward nets (SRNs). It is shown that reward-based models could lead to more concise model specification and solution of a variety of new measures. With respect to the solution of dependability and performability models, we identify three practical issues: largeness, stiffness, and non-exponentiality, and we discuss a variety of approaches to deal with them, including some of the latest research efforts.
HAT: a hardware assisted TOP-DOC inverted index component
Authors: S. Kagan Agun, Ophir Frieder
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

A novel Hardware Assisted Top-Doc (HAT) component is disclosed. HAT is an optimized content indexing device based on a modified inverted index structure. HAT accommodates patterns of different lengths and supports a varied posting list versus term count feature sustaining high reusability and efficiency. The developed component can be used either as an internal slave component or as an external co-processor and is efficient in resource demands as the component controllers take only a minimal percentage of the target device space leaving the majority of the space to term and posting entries. A Very High Speed Integrated Circuit (VHSIC) Hardware Description Language (VHDL) is used to model the HAT system.
A numerical solution of the sine-Gordon equation using the modified decomposition method
Authors: Dogan Kaya
Venue: Applied Mathematics and Computation (2003)

The decomposition method for solving the sine-Gordon equation has been implemented. By using a number of initial values, the explicit and numerical solutions of the equation are calculated in the form of convergent power series with easily computable components. The present method performs extremely well in terms of accuracy, efficiency, simplicity, stability and reliability.
A Case for Knowledge Acquisition in Risk Analysis
Authors: Elizabeth Gurrie, Alan Tickle, Alison Anderson
Venue:  (1995)

It is generally accepted that organisations must give a high priority to protecting their information assets. However, the foundation exercise to this process, risk analysis, is often avoided. Many IT practitioners consider the effort involved in risk analysis does not always lead to a complete and accurate identification of those information assets which need to be protected. 7he difficulties in modelling security knowledge can be parallelled with problems experienced in knowledge modelling in general. 7he knowledge acquisition community has long recognised these obstacles and seeks to develop knowledge acquisition strategies to solve these problems. This paper considers the problems of risk analysis and argues that the application of knowledge acquisition techniques can be used to address these issues.
Efficient Resolution of Singularities of Plane Curves
Authors: Dexter Kozen
Venue:  (1995)

We give a new algorithm for resolving singularities of plane curves. The algorithm is polynomial time in the bit complexity model, does not require factorization, and works over the rationals or finite fields.
On Automorphism Groups of Graphs and Distributive Lattices
Authors: Stephan Foldes
Venue:  (1997)

Birkhoff''s theorem that every group is isomorphic to the automorphism group of a distributive lattice is extended in a direction that parallels similar results in graph theory.
Dynamic Dreamweaver MX, 1 edition
Authors: Rob Turnbull, Omar Elbaga, Glasshaus Author Team, Bob Regan, Alan Foley
Venue:  (2002)

:This book gets you up to speed on using Macromedia Dreamweaver MX, the new version of Macromedia's premier visual web site design tool, to produce dynamic, creative, visually stunning sites that comply with web standards and accessibility guidelines. It gets straight to the heart of the matter so you spend less time reading, and more time building your site. Dreamweaver MX boasts some fantastic new features, including greatly improved support for XHTML and CSS standards, and tools that allow easy creation of accessible sites and effective use of Dreamweaver MX by people with disabilities. However, it doesn't stop there - Dreamweaver MX also features support for a wide range of server-side scripting languages, allowing professional dynamic web applications to be created with ease, using built-in ready-to-use chunks of code called Server Behaviors. Book Info For the working Web professional who needs results now. Provides aggressively pragmatic coverage of the huge leap of functionality in Dreamweaver MX. Softcover. This book is primarily for anyone who wants to learn how to use the new advanced features of Dreamweaver MX to easily create professional static and dynamic web pages (concepts demonstrated using ASP) that are standards-compliant, and as accessible as possible. This book assumes some knowledge of HTML and web development concepts.About the Authors: Rachel Andrew is a member of the Web Standards Project's Dreamweaver Task Force, responsible for improving Dreamweaver's standards compliance and accessibility Omar Elbaga started out as a fine artist and moved to computer graphic arts. He is also a member of Team Macromedia. Bob Regan is the Senior Product Manager for Accessibility at Macromedia. Rob Turnbull is also a member of Team Macromedia and a new media designer.
A Family of Parallel Sorting Algorithms
Authors: Yijie Han
Venue:  (1986)

We generalize Preparata''s sorting algorithm into a family of parallel sorting algorithms. This family of sorting algorithms sorts $n$ keys with $O(n~ log ^ \alpha n)$ processors in $O( \frac {1} { \alpha } log n)$ time units, where $\alpha$ is an arbitrary positive number less than 1. The computation model for this family of algorithms allows simultaneous fetches from the same memory cell. 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
Towards Industrially Applicable Formal Methods: Three Small Steps, and One Giant Leap
Authors: John McDermid, Andy Galloway, Simon Burton, John Clark, Ian Toyn, Nigel Tracey, Sam Valentine
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

In this paper we discuss issues in the development of formal methods for use in aerospace applications, reflecting our experience in working with both Rolls-Royce and British Aerospace. We discuss some of the key factors which we believe govern the application of discrete mathematics to aerospace applications, drawing comparisons with applied engineering mathematics in other domains.We give an overview of three projects (the three "small steps"):+ The development of a domain-specific language for aircraft engine control system specification; + The development of a formal semantics and tool support for state transition systems to facilitate analysis of specifications produced by systems engineers; + The use of formalisms in support of test automation. We then discuss the "gap" we see between the needs of industry and the current focus of the formal methods research community by pointing out important facets of industrially applicable formal methods which are not receiving adequate attention. We refer to this as a "giant leap" due to the need for a cultural shift in the research community, and the need for a coherent approach to the identified research issues rather than piecemeal studies of the issues.Our conclusions are to be optimistic for the future use of formal methods in industry, albeit with concern that their potential will not be realised unless there is a shift in emphasis within the research community.
Tuning Parallel Program through Automatic Program Analysis
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

y Many current performance analysis systems offer little more than basic measurement and analysis facilities for locating the sources of poor performance, such as load imbalance, communication overhead, and synchronization loss. We believe that this is only part of the solution and a system which can provide higher level performance measurement and analysis is highly desirable. In this paper, we describe a new approach to designing performance tuning tools for parallel processing systems. A primary contribution of this work is to explore the way in which the strategies and algorithms used in parallel programs contribute to the poor performance. In order to detect the strategies and algorithms used in parallel programs, a technique called Automatic Program Analysis is used. Our goal is to provide users with higher level performance advices. We present a case study describing how a prototype implementation of our technique was able to identify the performance problem and provide tuning advice.
Towards a rigorous object-oriented analysis and design method
Authors: R. B. France, J.-M. Bruel, M. Larrondo-Petrie, E. Grant, M. Saksena
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

We present techniques for constructing Z specifications from the analysis and design models of the Fusion method. We show how the specifications can be used to more closely tie the Fusion models together. In particular, we outline how the specifications can be used to support rigorous verification of Fusion design models against analysis models.
Mastering Regular Expressions, 2 edition
Authors: Jeffrey E. F. Friedl
Venue:  (2002)

:Regular expressions are an extremely powerful tool for manipulating text and data. They have spread like wildfire in recent years, and are now offered as standard features in Perl, Java, VB.NET and C# (and any language using the .NET Framework), PHP, Python, Ruby, Tcl, MySQL, awk, Emacs, and many other popular tools and languages. If you don't use regular expressions yet, you will discover in this book a whole new world of mastery over your data. If you already use them, you'll appreciate this book's unprecedented detail and breadth of coverage. If you think you know all you need to know about regular expressions, this book is a stunning eye-opener. Despite their wide availability, flexibility, and unparalleled power, regular expressions are frequently underutilized. Regular expressions allow you to code complex and subtle text processing that you never imagined could be automated. Regular expressions can save you time and aggravation. They can be used to craft elegant solutions to a wide range of problems. A command of regular expressions is an invaluable skill. Yet what is power in the hands of an expert can be fraught with peril for the unwary. Mastering Regular Expressions will help you navigate the minefield to becoming an expert. Once you've mastered regular expressions, they'll become an invaluable part of your toolkit. You will wonder how you ever got by without them. Mastering Regular Expressions, Second Edition, has been thoroughly updated to include all the new features of Perl 5.8 as well as several other languages, including Java, VB.NET, C#, Python, JavaScript, Tcl, and Ruby. Written in the lucid, entertaining tone that makes a complex, dry topic crystal-clear to thousands of programmers, and sprinkled with solutions to complex real-world problems, Mastering Regular Expressions offers a wealth of information that you can put to immediate use.
A Join--the--Shortest--Queue Prefetching Protocol for VBR Video on Demand
Authors: Martin Reisslein, Keith W. Ross
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

We present a high-performance prefetching protocol for the delivery of prerecorded VBR video from a server across a packet--switched network to a large number of clients. Not only does the protocol give constant perceptual quality and almost 100% link utilization, but it also allows for immediate commencement of the video upon user request and near instantaneous response to pause/resume and temporal jumps. The protocol requires (1) that each client have a small amount of memory dedicated to the application (2) that there is one bottleneck shared link between the server and the clients. Our protocol is based on the observation that there are frequent periods of time during which the shared link's bandwidth is under utilized. During these periods the server can prefetch frames from any of the ongoing videos and send the frames to the buffers in the appropriate clients. The server chooses prefetched frames according to a join--the--shortest--queue policy. We present simulation results of our prefetch policy that are based on MPEG encoded traces.
A Study of Employee Competency in Software Process Management
Authors: S. Ow, M. Yaacob
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

This paper presents the findings of a questionnaire survey conducted in a company to assess its employees' competency in software process management. An overview of employee competency and its definition in the context of the survey are given. The Knowledge, Awareness and Practice (KAP) Model was specially designed and used to measure the level of competency of the software development team with respect to compliance with the key process areas (KPAs) of the Software Engineering Institute's (SEIs) Capability Maturity Model (CMM). Other analyses made pertain to the aspects of familiarity and adequacy of training on the KPAs. The results of the measurement using the KAP Model, show 73.3% of the company employees are performing their jobs in compliance with the software development guidelines defined in CMM Levels 2 and 3, which the company currently implements.
Product-line development requires sophisticated software configuration management
Authors: W. Schafer
Venue: Proceedings of the 10th International Software Process Workshop (1996)

Software process technology as well as software configuration management (SCM) has focussed very much on supporting the development and evolution of a single software product rather than software product-lines. In the case of SCM this is particular harmful, because current SCM technology only provides very limited support to adjust a tool supporting SCM to the particular needs and requirements of a company producing product-line software. Usually such a tool has a built-in process and to the most provides a shell-script like language to define certain responsibilities or development status attributes for the artifacts produced during development and maintenance. There is virtually no support to adjust a tool to e.g. the definition of special workflows for change management and notification.