ppxscal/embedding_network huggingface dataset:
How Would You Move Mount Fuji?: Microsoft's Cult of the Puzzle
Authors: William Poundstone
Venue:  (2003)

:For years, Microsoft and other high-tech companies have been posing riddles and logic puzzles like these in their notoriously grueling job interviews. Now "puzzle interviews" have become a hot new trend in hiring. From Wall Street to Silicon Valley, employers are using tough and tricky questions to gauge job candidates' intelligence, imagination, and problem-solving ability -- qualities needed to survive in today's hypercompetitive global marketplace. For the first time, William Poundstone reveals the toughest questions used at Microsoft and other Fortune 500 companies -- and supplies the answers. He traces the rise and controversial fall of employer-mandated IQ tests, the peculiar obsessions of Bill Gates (who plays jigsaw puzzles as a competitive sport), the sadistic mind games of Wall Street (which reportedly led one job seeker to smash a forty-third-story window), and the bizarre excesses of today's hiring managers (who may start off an interview with a box of Legos or a game of virtual Russian roulette). How Would You Move Mount Fuji? is an indispensable book for anyone in business. Managers seeking the most talented employees will learn to incorporate puzzle interviews in their search for the top candidates. Job seekers will discover how to tackle even the most brain-busting questions and gain the advantage that could win the job of a lifetime. And anyone who has ever dreamed of going up against the best minds in business may discover that these puzzles are simply a lot of fun. Why are beer cans tapered at the top and bottom, anyway?
On the Complexity of Semidefinite Programs
Authors: Lorant Porkolab, Leonid Khachiyan
Venue:  (1996)

We show that the feasibility of a system of $m$ linear inequalities over the cone of symmetric positive semidefinite matrices of order $n$ can be tested in $mn^{O(\min\{m,n^2\})}$ arithmetic operations over $ln^{O(\min\{m,n^2\})}$-bit numbers, where $l$ is the maximum binary size of the input coefficients. We also show that any feasible system of dimension $(n,m)$ has a solution $\M{X}$ such that $\log \|\M{X}\| \le ln^{O(\min\{m,n^2\})}$.
Formal description of autopoiesis for analytic models of life and social systems
Authors: Tatsuya Nomura
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Since the concept of autopoiesis was proposed as a model of minimal living systems by Maturana and Varela, and applied to social systems by Luhmann, there has been still few mathematically strict models to represent the characteristics of it because of its difficulty for interpretation. In order to verify the validity of this concept, this paper proposes a formal description of autopoiesis based on the theory of category and Rosen's perspective of "closure under efficient cause", provides analytic models of life and social systems, and discusses the effectiveness of autopoiesis in systems sciences through implication from the model.
Evaluating Uniform Expressions Within Two Steps of Minimum Parallel Time
Authors: A R Wagner
Venue:  (1992)

Consider an array of Processing Elements [PEs], connected by a 2-dimensional grid network, and holding at most one operand of an expression in each PE. Suppose that each PE is allowed, in any one parallel step, to receive one item of data from any of its 4 immediate neighbors, and to transmit one datum, as well. How can an associative operator, such as addition, combine all the operands, using as little time for communication as possible? An expression using such a single oeprator is termed a uniform expression. When the total number of communications links used is the measure of goodness, this problem becomes a Steiner Tree problem, in the Manhattan Distance metric. When the measure is minimizing the parallel time to completion, a method for solving this problem is given which is optimal to within an additive constant of 2 time-steps. The method has applications when the operands are matrices, spread over an array of PE''s, as well. Some lower bounds for this problem, in more general networks, are also proven.
Removing Node and Edge Overlapping in Graph Layouts by A Modified EGENET Solver
Authors: Vincent Tam
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Graph layout problems such as node and edge overlapping occur widely in many industrial computer-aided design applications. Usually, these problems are handled in an ad hoc manner by some specially designed algorithms. GENET and its extended model EGENET are local search methods used to solve constraint satisfaction problems such as the car-sequencing problems efficiently. Both models use the min-conflict heuristic to update every finite-domain variable for finding local minima, and then apply heuristic learning rule(s) to escape the local minima not representing solution(s). In the past, few researchers have ever considered to apply any local search method like the EGENET approach to solve graph layout problems. In this paper, we consider how to modify the original EGENET model for solving the graph layout problems formulated as continuous constrained optimization problems. The empirical evaluation of different approaches on the graph layout problems demonstrated some advantages of our modified EGENET approach, which requires further investigation. More importantly, this interesting proposal opens up numerous opportunities for exploring the other possible ways to modify the original EGENET model, or using the other local search methods to solve these graph layout problems.
Testing Software Requirements via Task Analysis
Authors: Hong Zhu, Lingzi Jin, Dan Diaper, Ganghong Bai
Venue:  (1999)

As a baseline of software development, a correct and complete requirements definition is a foundation of software quality. Previously, a novel approach to static testing of software requirements was proposed in which requirements definitions are tested on a set of task scenarios by examining software behaviour in each scenario described by an activity list. Such descriptions of software behaviour can be generated automatically from requirements models. This paper investigates various testing methods for selecting test scenarios. Data flow testing, state transition testing and entity testing methods are studied. A variety of test adequacy criteria and their combinations are formally defined and the subsume relations between the criteria are proved. Empirical studies of the testing methods and the construction of a prototype testing tool are reported.
The excluded minors for GF(4)--representable matroids
Authors: James F. Geelen, Albertus M.H. Gerards, Ajai Kapoor
Venue:  (1997)

There are exactly seven excluded minors for the class of GF(4)--representable matroids.
Some Results on Kolmogorov-Chaitin Complexity
Authors: David L Schweizer
Venue:  (1986)

No abstract available.
Toward Human Centered Ubiquitous IP Environment
Authors: Hideyuki Nakashima
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

What will be the simplest and yet useful interface? A single click on a button (one bit) is the minimum information to command a device to initiate a service for the owner. This simple interface, however, requires enormous computing and intelligence in the background. The device must recognize the situation, learn preferences and understand the intention of the owner, and plan for its own action. The task is obviously too heavy for a single portable device. Therefore it must utilize the information processing (IP) capabilities embedded in the environment as well as getting multi-modal information from sensors in various kinds. Software agents must cooperate with each other for acquiring and processing information.
Reuse of Design Processes Based on Domain Analysis
Authors: Mari Natori, Akira Kagaya, Shinichi Honiden
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

This paper presents a technique for reusing design processes which aims at facilitating software reuse. The authors have constructed a specification reuse model based on two major ideas. One is to extract domain-specific specification parts, and the other is to reuse design processes represented by reuse histories. In addition, a domain analysis method is proposed to construct the specification reuse model. This model has been evaluated through experimental applications. The results show that the model facilitates software reuse, and that the domain analysis clarifies the application scope of the model. Applicability of our model to other domains is also discussed in this paper.
Time-Space Tradeoffs for Nondeterministic Computation
Authors: Fortnow Lance, Melkebeek Dieter van
Venue:  (2000)

We show new lower bounds for satisfiability and nondeterministic linear time. Satisfiability cannot be solved on general purpose random-access Turing machines in time n1.618 and space no(1). This improves recent results of Fortnow and of Lipton and Viglas. In general, for any constant a less than the golden ratio, we prove that satisfiability cannot be solved in time na and space nb for some positive constant b. Our techniques allow us to establish this result for b > ((a+2)/a2-a)/2. We can do better for a close to the golden ratio, for example, satisfiability cannot be solved by a random-access Turing machine using n1.46 time and n.11 space. We also show the first nontrivial lower bounds on machines using sublinear space. For example, there exists a language computable in nondeterministic linear time and n.619 space that cannot be computed in deterministic n1.618 time and no(1) space. Higher up the polynomial-time hierarchy we can get better bounds. We show that linear-time alternating computations with a most k alternations require essentially nk time if we only allow no(1) space. We also show new lower bounds on conondeterministic versus nondeterministic computation.
A General Framework for Symbol and Rule Extraction in Neural Networks
Authors: B. Apolloni, C. Orovas, J. Taylor, W. Fellenz, Stan Gielen, Machiel Westerdijk
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

We split the rule extraction task in to a sub-symbolic and a symbolic phase and present a set of neural networks for filling the former. Under the two general commitments of: i) having a learning algorithm that is sensitive to feedback signals coming from the latter phase, and ii) extracting Boolean variables whose meaning is determined by the further symbolic processing, we introduce three unsupervised learning algorithms and show related numerical examples for a multilayer perceptron, recurrent neural networks, and a specially devised vector quantizer.
Describing the problem situation in IS studies using SSM: a practitioners view
Authors: P. F. Fillery, A. Rusli, H. L. James
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

The rich picture technique is probably the tool most quoted to be used in describing a problem situation within Soft Systems Methodology, particularly in the academic literature. As this paper indicates, the authors' practical experience however show that there are numerous supplementary techniques known to have been used in the agreement and expression of the current problem situation. This paper describes those tools and techniques.
Reliabilities of Two Fault-Tolerant Interconnection Networks
Authors: T J Blake, S K Trivedi
Venue:  (1987)

The purpose of adding redundancy to unique-path multistage interconnection networks is to increase their reliability. In this paper, we examine the Augmented Shuffle-Exchange Network (ASEN), a network with low switch and link complexity. Exact reliability expressions for small networks and upper and lower bounds for evaluating larger networks are derived. The reliability of the ASEN is compared with the extra-stage interconnection network. We also analyze the effects of imperfect coverage and on-line repair on the reliability of large ASEN networks using a novel approach.
RNA Based Computing
Authors: Laura F. Landweber
Venue:  (1997)

This report will focus on a combined treatment of the fields of RNA evolution and DNA computers. Using examples of in vitro selection of functional RNA molecules from large pools of random sequences, I show that these experiments can be viewed as an "RNA computer", in the language of DNA computation. By applying a strict set of criteria to a pool of heterogeneous DNA or RNA sequences, both types of experiments find sequences that contain solutions to hard molecular computational problems. These can even be nondigital problems that an electronic computer cannot solve. For example, a problem I addressed using a pool of RNA molecules was one of catalysis, or the ability to ligate a small substrate RNA molecule to itself. In vitro evolution searches for the best solution or class of solutions contained within a large library of approximately 10^15 unique sequences. The advantage of these "molecular computers" is their ability to examine and eliminate billions of possible solutions in parallel. We also describe an example of a cellular paradigm for RNA-based computing: RNA editing. From the Second Annual DIMACS Meeting on DNA Based Computers, June 10-12, 1996 and the DIMACS Special Focus on DNA Computing.
Modelling the Reliability of SPICE Based Assessments
Authors: Khaled El Emam, Pierfrancesco Fusaro, Bob Smith
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

An area of major investigation in the SPICE trials is the reliability of assessments. In particular, their evaluation and improvement. Previous reliability studies in the trials have focused on evaluating reliability. In this paper we report on a study that focused on generating recommendations for improving the reliability of assessments through the construction of a model. The study attempted to identify factors that have an impact on reliability. Using data from three assessments we constructed a model that explains some of the variation in the reliability of assessments. The two factors considered were the capability of processes and when ratings are made during an assessment (other factors such as assessor experience were held constant). Our model suggests that future assessment processes should have two contiguous phases in order to increase reliability. The first phase focuses only on data collection. During the second phase, ratings are made.
Comparative Analysis of Multistage Interconnection Networks
Authors: T J Blake
Venue:  (1987)

This thesis provides a comparative analysis of various interconnection networks and multiprocessor systems. The principal interest is in the analysis of the reliability and composite measures of performance and reliability of interconnection networks that connect processors to memories in large multiprocessor systems. Specifically, the Shuffle-Exchange multistage interconnection Network (SEN) and its variants are evaluated and compared. Comparison is based on reliability, composite measures of performance and reliability, and cost. Closed-form expressions for the computation of the available bandwidth for multiprocessor systems with a capability for graceful degradation are developed. Then, the time-dependent reliability of the SEN and three fault-tolerant schemes aimed at improving system reliability are examined. These schemes are the redundant network, the extra-stage network, and the network augmented with intrastage links. Exact closed-form expressions for the time-dependent reliability of the $N$ x $N$ Shuffle-Exchange Network (SEN), the $8$ x $8$ and $16$ x $16$ SEN with an additional stage (SEN+), and the $4$ x $4$ and $8$ x $8$ Augmented SEN (ASEN) are derived. Upper and lower bounds useful for the analysis of larger SEN+ and ASEN networks are derived. Numerical results for networks as large as $1024$ x $1024$ are provided. A comparison of these networks shows that, on the basis of reliability, the ASEN is superior to the SEN, SEN+, and the redundant SEN (2-SEN). The results for the SEN+ are extended to the case of an (uniform) Omega network. Further, through the novel use of hierarchical decomposition, results on the reliability of ASENs are extended to include imperfect coverage and on-line repair. In the last chapter, performability analysis of a complete multiprocessor system is conducted. The crossbar and the Omega networks are used to represent the interconnection network and two levels of detail are presented for analyzing the crossbar. Bottleneck and sensitivity analysis of the multiprocessor system are also performed. Markov chains and Markov reward models are used in the analysis. In addition, the criteria for the lumping of states in a Markov chain is extended to Markov reward models.
Finite element approximation for the viscoelastic fluid motion problem
Authors: Yinnian He, Yanping Lin, Samuel S. P. Shen, Weiwei Sun, Robert Tait
Venue: Journal of Computational and Applied Mathematics (2003)

In this article, the variational formulation of the two-dimensional viscoelastic fluid motion problem and its finite element approximation are considered. An local error estimate for the velocity with H1-norm and the pressure with L2-norm is obtained; and a uniform error estimate for the velocity and pressure with the above norms is provided if the given data satisfies the uniqueness condition.
Microsoft Office Frontpage 2003 Step by Step
Venue:  (2003)

Teach yourself how to use the Web site creation and management capabilities in FrontPage 2003-one step at a time! Learn how to create professional-looking Web sites using easy, self-paced lessons and hands-on practice exercises. 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
The Design and Implementation of A Real-Time Data Dispatching System
Authors: Nei-Chiung Perng, Neung-Tsung Tsai, Jen-Wei Hsieh, Tei-Wei Kuo
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

This paper describes the design of a real-time data dispatching system (RTDDS), which is motivated by the needs of a performance guarantee on real-time data services by front-end clients. RTDDS consists of homogeneous machines with a quality of service performance guarantee. We address the resource allocation problems and consider Bin-Packing algorithms to assign requests to machines of RT-DDS. Processes scheduling over each machine is done autonomously by SRP-based algorithms. The goal is to maximize the number of concurrent clients and to meet the individual quality of service requirements of clients at the same time.
Reviews in Computational Chemistry, Vol. 18
Authors: Kenny B. Lipkowitz
Venue:  (2003)

:* Provides detailed author and subject indices for quick reference.* Presents chapters in non-mathematical terms for cross-expertise access.
The Application of Automatic Differentiation to Problems in Engineering Analysis
Authors: Shirish Chinchalkar
Venue:  (1993)

Automatic differentiation is a technique of computing the derivative of a function or a subroutine written in a higher level language such as FORTRAN or C. Significant progress has been made in this field in the last few years. Here, we give a short exposition to automatic differentiation and demonstrate its applicability to several fields of engineering analysis.
Correction of Geometeric Perceptual Distortions in Pictures
Authors: Denis N. Zorin
Venue:  (1995)

We suggest an approach for correcting several types of perceived geometric distortions in computer-generated and photographic images. The approach is based on a mathematical formalization of desirable properties of pictures. We provide a review of perception of pictures and identify perceptually important geometric properties of images. From a small set of simple assumptions we obtain perceptually preferable projections of three-dimensional space into the plane and show that these projections can be decomposed into a perspective or parallel projection followed by a planar transformation. The decomposition is easily implemented and provides a convenient framework for further analysis of the image mapping. We prove that two perceptually important properties are incompatible and cannot be satisfied simultaneously. It is impossible to construct a projection such that the images of all lines are straight and the images of all spheres are exact circles. Perceptually preferable tradeoffs between these two types of distortions can depend on the content of the picture. We construct parametric families of projections with parameters representing the relative importance of the perceptual characteristics. By adjusting the settings of the parameters we can minimize the overall distortion of the picture. It turns out that a simple family of transformations produces results that are sufficiently close to optimal. We implement the proposed transformations and apply them to computer-generated and photographic perspective projection images. Our transformations can considerably reduce distortion in wide-angle motion pictures and computer-generated animations.
Design and Implementation of Triveni: a Process-algebraic API for Threads + Events
Authors: Christopher Colby, Radha Jagadeesan, Konstantin Laufer, Lalita Jategaonkar Jagadeesan, Carlos Puchol
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

We describe Triveni, a framework and API for integrating threads and events. The design of Triveni is based on an algebra, including preemption combinators, of processes. Triveni is compatible with existing threads standards, such as Pthreads and Java threads, and with the event models structured on the Observer pattern. We describe the software architecture and algorithms underlying a concrete implementation of Triveni in Java. This environment includes specification-based testing of safety properties. The results described in this paper have been used to integrate process-algebraic methods into (concurrent) object oriented programming.
Specification and Verification of Real-Time Properties Using LOTOS and SQTL
Authors: A. Lakas, G. S. Gordon, A. Chetwynd
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

In this paper we present a new approach to the formal specification of distributed real-time systems using the formal description technique LOTOS together with a real-time temporal logic SQTL. This approach characterized by a separation of concerns, aims to construct abstractly a model from the a functional specification according to real-time constraints. The functional behaviour is described in LOTOS without regard for the time critical constraints. The specification is then extended with precise real-time properties written in SQTL. We present a method to generate a timing event scheduler from the properties in order to monitor the functional behaviour. The model of event schedulers is based on timed automata and intended to be used for an automata-based verification technique.
A comparative analysis of disk scheduling policies
Authors: Toby J. Teorey, Tad B. Pinkerton
Venue: ACM SIGOPS Operating Systems Review (1972)

Five well-known scheduling policies for movable head disks are compared using the performance criteria of expected seek time (system oriented) and expected waiting time (individual I/O request oriented). Both analytical and simulation results are obtained. The variance of waiting time is introduced as another meaningful measure of performance, showing possible discrimination against individual requests. Then the choice of a utility function to measure total performance including system oriented and individual request oriented measures is described. Such a function allows one to differentiate among the scheduling policies over a wide range of input loading conditions. The selection and implementation of a maximum performance two-policy algorithm are discussed.