ppxscal/embedding_network huggingface dataset:
A framework for program development based on schematic proof
Authors: David Basin, Alan Bundy, Ina Kraan, Sean Matthews
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

Often, calculi for manipulating and reasoning about programs can be recast as calculi for synthesizing programs. The difference involves often only a slight shift of perspective: admitting metavariables into proofs. We propose that such calculi should be implemented in logical frameworks that support this kind of proof construction and that such an implementation can unify program verification and synthesis. Our proposal is illustrated with a worked example developed in Paulson's Isabelle system. We also give examples of existent calculi that are closely related to the methodology we are proposing and others that can be profitably recast using our approach.
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
Authors: Brendan D. McKay, Robert W. Robinson
Venue: Combinatorics, Probability and Computing (1998)

We determine the asymptotic behaviour of the number of Eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, constrained to use each edge at most once, is taken on Kn, then the probability that all the edges are eventually used is asymptotic to e3&#x002F;4n&minus;&frac12;. Some similar results are obtained about Eulerian circuits and spanning trees in random regular tournaments. We also give exact values for up to 21 nodes.
New Tricks: How Open Source Changed the Way My Team Works
Authors: Stephane Lussier
Venue: IEEE Software (2004)

A commercial software team contributed to an open source implementation of the Windows API on X-Windows and Unix. Expecting chaos in the organization and code, the team instead found a structured community with procedures all its own.
An investigation of GISM issues for successful management of the globalization process
Authors: Yi-chen Lan
Venue: Managing globally with information technology (2003)

This chapter investigates issues related to the global transition of an enterprise through the application of information technology and information systems. It starts with the discussion of the issues that are critical to the successful transition of an enterprise to transborder business operations using information systems. The expected outcome of such transition would be a globalized organization that would not be limited by geographical and time zone barriers, nor restricted by cultural differences. The global transition issues are further classified into five categories embracing business information systems management, information technology management, people management, end user management, and culture. It is then followed by a comprehensive examination of individual issues that is vital in understanding their impact on the transition and how to alleviate that impact. The chapter concludes by indicating a future research direction that might augment the development of this emerging field.
Trained Space-Time Block Decoding for Flat Fading Channels with Frequency Offsets
Authors: Petre Stoica, Girish Ganesan
Venue: Wireless Personal Communications: An International Journal (2003)

Space-time block coding (STBC) is a recent appealing solution to the problem of exploiting transmit diversity in multi-antenna systems for communications over flat fading channels. In a standard STBC scheme the receiver requires Channel State Information (CSI), which can be acquired via training at the expense of a reduced information rate. Alternatively, the requirement of CSI can be avoided altogether by using differential encoding. The existing trained or differential schemes for STBC assume that the channel is time-invariant during the transmission of at least two data blocks. However, wireless channels may often be time varying owing to frequency offsets induced by either Doppler shifts or carrier frequency mismatches. In this paper we present a simple trained STBC scheme for fading channels with frequency offsets.
Information technology outsourcing in Australia
Authors: Nicholas Beaumont, Christina Costa
Venue: Advanced topics in information resources management (2003)

In Australia, popular discussion of the growing market in outsourcing information technology (IT) has been spurred by decisions of several large companies and the Australian government to outsource IT operations, but there has been little academic research into outsourcing in Australia. This chapter reports research into Australian IT outsourcing based on data collected in 1999. The research objectives were to measure the incidence of outsourcing among Australian firms, identify the functions outsourced, the reasons why managers considered outsourcing, the costs and benefits of outsourcing, possible changes in modes of and motivations for outsourcing and factors that are associated with successful outsourcing arrangements. The nature of and motivations for outsourcing have evolved; for example, cost saving is not (if it ever was) the prime motivator. The three most important factors driving outsourcing in Australia are access to skills, improved service quality and increasing managers' ability to focus on core business activities. Decisions to outsource are weakly correlated with company size, but are not related to industry sectors. The factors most associated with successful IT outsourcing were the cultural match between the vendor and client, and the nature of the contractual arrangements--partnerships are more fruitful than rigidly interpreted black letter contracts. Outsourcing (not just of IT) is becoming increasingly popular; we suggest reasons for this and propose further research. The research used quantitative and qualitative data. A survey was used to collect data from 277 informants, and six interviews were used to explore managers' reasons for outsourcing and relate these to the success of outsourcing arrangements. Outsourcing of many business processes (not just IT) is becoming increasingly frequent in Australia. Where appropriate, themes are illustrated by outsourcing activities other than IT.
Adaptive biorthogonal spline schemes for advection-reaction equations
Authors: Richard E. Ewing, Jiangguo Liu, Hong Wang
Venue: Journal of Computational Physics (2004)

In this paper, based on Eulerian-Lagrangian localized adjoint method (ELLAM), we use biorthogonal spline wavelets to develop numerical schemes for multidimensional advection-reaction equations. The derived schemes produce accurate numerical solutions even if large time steps are used. These schemes are explicit but unconditionally stable. They also have the ability to carry out adaptive compression while preserving the total mass. Numerical experiments including observations on their convergence rates are presented to show the strong potential of these methods.
From the Editors
Authors: Edward Grossman
Venue: Queue (2004)

You may recall some of the hype last year as AMD announced and then released its 64-bit processor, the AMD Opteron. What you may not remember is that one of the key groups AMD was going after with its promotional blitz was gamers. You see, at the high-end (read: high-margin) side of the PC business, power-hungry users drive the business, and more and more often those power users are gamers looking to get that millisecond advantage needed to claim bragging rights for the week.
On a hypergeometric identity of Gelfand, Graev and Retakh
Authors: C. Krattenthaler, H. Rosengren
Venue: Journal of Computational and Applied Mathematics (2003)

A hypergeometric identity equating a triple sum to a single sum, originally found by Gelfand, et al. (Russian Math. Surveys 47 (1992)) by using systems of differential equations, is given hypergeometric proofs. As a bonus, several q-analogues can be derived.
Greedy Tree Growing Heuristics on Block-Test Scheduling Under Power Constraints
Authors: Valentin Mureşan, Xiaojun Wang, Valentina Mureşan, Mircea Vlăduţiu
Venue: Journal of Electronic Testing: Theory and Applications (2004)

Greedy scheduling algorithms are proposed here to improve the test concurrency under power limits. An extended tree growing technique is used to model the power-constrained test scheduling problem in these algorithms. A constant additive model is employed for power dissipation analysis and estimation. The efficiency of this approach is assessed with test scheduling examples and the experimental results are presented. Known list scheduling approaches are proven to give acceptable power-constrained test scheduling results quickly, but not guaranteed to be optimal.
De-aliasing on non-uniform grids: algorithms and applications
Authors: Robert M. Kirby, George Em Karniadakis
Venue: Journal of Computational Physics (2003)

We present de-aliasing rules to be used when evaluating non-linear terms with polynomial spectral methods on non-uniform grids analogous to the de-aliasing rules used in Fourier spectral methods. They are based upon the idea of super-collocation followed by a Galerkin projection of the non-linear terms. We demonstrate through numerical simulation that both accuracy and stability can be greatly enhanced through the use of this approach. We begin by deriving from the numerical quadrature rules used by Galerkin-type projection methods the number of quadrature points and weights needed for quadratic and cubic non-linearities. We then present a systematic study of the effects of super-collocation when using both a continuous Galerkin and a discontinuous Galerkin method to solve the one-dimensional viscous Burgers equation. We conclude by examining three direct numerical simulation flow examples: incompressible turbulent flow in a triangular duct, incompressible turbulent flow in a channel at Reτ = 395, and compressible flow past a pitching airfoil at Re = 45,000.
Semidirect product constructions of directed strongly regular graphs
Authors: Art M. Duval, Dmitri Iourinski
Venue: Journal of Combinatorial Theory Series A (2003)

We construct a new infinite family of directed strongly regular graphs, as Cayley graphs of certain semidirect product groups. This generalizes an earlier construction of Klin, Munemasa, Muzychuk, and Zieschang on some dihedral groups.
Simnet: a neural network architecture for pattern recognition and data mining
Authors: Cihan H. Dagli
Venue:  (2003)

In this study, an artificial neural network architecture called &ldquo;SimNet&rdquo; is designed and implemented. SimNet is built with the following concepts in mind: simulation, simplicity, and simultaneity. It combines the general neural network structure with the subsethood concept of fuzzy logic to produce a rapid data clustering system that works somewhat similar to the well known Adaptive Resonance Theory and Self-Organizing Maps. This architecture contains both an unsupervised learning model and a supervised learning model. The former one is a 2-layer unsupervised learning paradigm, and the latter one is a 3-layer supervised learning paradigm. To demonstrate the performance of SimNet, it is applied on two applications. First, an automatic license plate recognition system (ALPReS) is designed using SimNet. In this system, 400 sample images were tested with a license plate recognition success rate of 91.25%. Moreover, the success rate of character recognition is 94.38% and the success rate of license plate identification is 98.75%. Secondly, a keypage-based data mining system using SimNet is also presented. SimNet is used in the kernel of the keypage-based data mining system for finding the similarity of the keypage and the candidate pages. The system attempts to dig out the related information from the distributed environment, the World Wide Web, according to a given webpage. SimNet has demonstrated its excellent performance in pattern recognition with the application on vehicle license plate recognition. It has also been applied on the keypage-based data mining system with promising results. Nevertheless, the preprocessing issues that occur on most of the real-life applications remain unsolved. To achieve this, domain-specific architectures with automatic preprocessing capability should be further designed for the existing neural networks, including SimNet.
Piecewise-linear surface approximation from noisy scattered samples
Authors: Michael Margaliot, Craig Gotsman
Venue: Proceedings of the conference on Visualization '94 (1994)

We consider the problem of approximating a smooth surface f(x,y), based on n scattered samples {(xi, yi, zi)ni=1} where the sample values {zi} are contaminated with noise: zi = f(xi, yi) + &epsilon;i. We present an algorithm that generates a PLS (Piecewise Linear Surface) f1, defined on a triangulation of the sample locations V = {(xi, yi)ni=1}, approximating f well. Constructing the PLS involves specifying both the triangulation of V and the values of f1 at the points of V. We demonstrate that even when the sampling process is not noisy, a better approximation for f is obtained using our algorithm, compared to existing methods. This algorithm is useful for DTM (Digital Terrain Map) manipulation by polygon-based graphics engines for visualization applications.
A Flexible Framework for Replication in Distributed Systems
Authors: Eul Gyu Im, B. Clifford Neuman
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

The goal of the work described in this paper was to builda flexible framework for different replication mechanismsin distributed systems that would be suitable for a wide varietyof users and applications. A framework was developedthat supports multiple replication mechanisms, allowsdifferent objects to be maintained with different replicationmechanisms, and enables application programmers to providetheir own replication mechanisms. It will be arguedthat this framework allowed the needs of diverse users andapplications in large distributed systems to be met.Our work has produced two significant contributions.First, after an examination of replication mechanisms usedin distributed systems, a flexible framework that supportsmultiple replication mechanisms together was designed anddeveloped. Second, following an examination of differentlevels of replication between replicas, a unified frameworkfor them was produced. This multi-level replication allowsthe framework to work well with mobile computing by placingdifferent replicas on mobile sites.
Evolutionary Synthesis of Arithmetic Circuit Structures
Authors: Takafum Aoki, Naofumi Homma, Tatsuo Higuchi
Venue: Artificial Intelligence Review (2003)

This paper presents an efficient graph-based evolutionary optimization technique called Evolutionary Graph Generation (EGG), and its application to arithmetic circuit synthesis. Key features of EGG are to employ a graph-based representation of individuals and to manipulate the graph structures directly by evolutionary operations. The potential capability of EGG is demonstrated through experimental synthesis of arithmetic circuits with different levels of abstraction. Design examples include (i) combinational multipliers using word-level arithmetic components (such as parallel counters and parallel shifters), (ii) bit-serial multipliers using bit-level arithmetic components (such as 1-bit full adders and 1-bit registers), and (iii) multiple-valued current-mode arithmetic circuits using transistor-level components (such as current sources and current mirrors).
Exact communication costs for consensus and leader in a tree
Authors: Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Venue: Journal of Discrete Algorithms (2003)

We continue the study of communication costs of Consensus and Leader initiated in a previous paper. We deal with all scenarios with linear complexity in a tree topology, and prove exact (as opposed to asymptotic) tight bounds for the bit and message complexities. A particular scenario depends on whether the tree size or the size parity is known to the processors.
Global Weather Prediction and High-End Computing at NASA
Authors: Shian-Jiann Lin, Robert Atlas, Kao-San Yeh
Venue: Computing in Science and Engineering (2004)

The authors demonstrate the current capabilities of NASA's finite-volume General Circulation Model in high-resolution global weather prediction and discuss its development path in the foreseeable future. This model is a prototype of a future NASA Earth-modeling system intended to unify development activities across various disciplines within NASA's Earth Science Enterprise.
Web site usability and the theory of multiple intelligences (howard gardner)
Authors: John Bunch
Venue:  (2003)

This study investigated Web site usability issues with 12 children, ages 3&ndash;6, within the framework of Howard Gardner's theory of multiple intelligences. This study explored (a) what specific usability issues children encounter when using Web sites, (b) what design elements are most or least effective, (c) what role intelligence type plays in usability and (d) what other factors affect Web usability. This qualitative field study employed a contextual inquiry approach used in usability research. The design was balanced for age and gender. Children used Playhouse Disney and Sesame Street, two popular Web sites for preschool-aged children. Data were collected via the Teele Inventory for Multiple Intelligences (TIMI), interviews, observations, questionnaires and click-stream logs over three research sessions. The highest intelligence types for children in the study were kinesthetic (M = 4.67, SD = 0.78), spatial (M = 4.67, SD = 1.61) and intrapersonal (M = 4.50, SD = 1.38). The medium intelligence types were musical (M = 3.92, SD = 1.38), interpersonal (M = 3.83, SD = 1.75) and logical (M = 3.42, SD = 1.98). The lowest was linguistic (M = 3.0, SD = 1.28). Children with high logical intelligence had the greatest success, while children with high linguistic intelligence had the greatest satisfaction. Children were categorized as &ldquo;adventurous&rdquo; or &ldquo;ambivalent&rdquo; based on their interest in the Web sites. Analysis of their comments and usage patterns revealed which aspects of Web design they liked and disliked and what caused usability problems. The biggest navigation obstacles were inability to read, poor mouse control and problems with the interface design. Children did not use search, map, index or help tools if they were available. Children did not scroll or use the back or forward arrows in the Web browser. Age, gender, previous Internet experience, siblings, computer configurations and poor ergonomics affected usability. Examples of design features (and their engaged intelligence) that positively affected usability were: sound effects (musical), characters that interacted with the children (interpersonal), audio instructions (linguistic), large clickable areas (kinesthetic), limited choices (logical), positive reinforcement (intrapersonal) and navigation metaphors (spatial). Results suggest that simpler navigation schemes, interface designs that engage spatial rather than linguistic intelligence, and features that positively engage a variety of intelligence types will make Web sites easier for children to use.
A framework for applet animations with controls
Authors: Chenglie Hu
Venue: ACM SIGCSE Bulletin (2003)

A generic Java&trade; applet animation with controls is presented in this paper. This framework implementation promotes software reusability in terms of applying modularity and factorization using inheritance, delegation, and template classes with cohesive methods. It can be used either as an example or a project in a typical object-oriented design and analysis class.
Proactive resource allocation for asynchronous real-time distributed systems in the presence of processor failures
Authors: Binoy Ravindran, Peng Li, Tamir Hegazy
Venue: Journal of Parallel and Distributed Computing (2003)

We present two proactive resource allocation algorithms, RBA*-FT and OBA-FT, for fault-tolerant asynchronous real-time distributed systems. The algorithms consider an application model where task timeliness is specified by Jensen's benefit functions and the anticipated application workload during future time intervals is described by adaptation functions. In addition, we assume that reliability functions of processors are available a priori. Given these models, our objective is to maximize aggregate task benefit and minimize aggregate missed deadline ratio in the presence of processor failures. Since determining the optimal solution is computationally intractable, the algorithms heuristically compute sub-optimal resource allocations, but in polynomial time. Experimental results reveal that RBA*-FT and OBA-FT outperform their non-fault-tolerant counterparts in the presence of processor failures. Furthermore, RBA*-FT performs better than OBA-FT, although OBA-FT incurs better worst-case and amortized computational costs. Finally, we observe that both algorithms robustly withstand errors in the estimation of anticipated failures.
Perceptually based brush strokes for nonphotorealistic visualization
Authors: Christopher G. Healey, Laura Tateosian, James T. Enns, Mark Remple
Venue: ACM Transactions on Graphics (TOG) (2004)

An important problem in the area of computer graphics is the visualization of large, complex information spaces. Datasets of this type have grown rapidly in recent years, both in number and in size. Images of the data stored in these collections must support rapid and accurate exploration and analysis. This article presents a method for constructing visualizations that are both effective and aesthetic. Our approach uses techniques from master paintings and human perception to visualize a multidimensional dataset. Individual data elements are drawn with one or more brush strokes that vary their appearance to represent the element's attribute values. The result is a nonphotorealistic visualization of information stored in the dataset. Our research extends existing glyph-based and nonphotorealistic techniques by applying perceptual guidelines to build an effective representation of the underlying data. The nonphotorealistic properties the strokes employ are selected from studies of the history and theory of Impressionist art. We show that these properties are similar to visual features that are detected by the low-level human visual system. This correspondence allows us to manage the strokes to produce perceptually salient visualizations. Psychophysical experiments confirm a strong relationship between the expressive power of our nonphotorealistic properties and previous findings on the use of perceptual color and texture patterns for data display. Results from these studies are used to produce effective nonphotorealistic visualizations. We conclude by applying our techniques to a large, multidimensional weather dataset to demonstrate their viability in a practical, real-world setting.
Analytical and numerical results for the Fuč&#x00ED;k spectrum of the Laplacian
Authors: J. Horák, W. Reichel
Venue: Journal of Computational and Applied Mathematics (2003)

Nontrivial solutions of Δu + µu+ - vu- = 0 in Ω ⊂ Rn with zero Dirichlet condition on ∂Ω are studied. The collection of the pairs (µ, v) is the so called Fucík spectrum σF. A new variational formulation for parts of σF is presented and analyzed. Based on this formulation a minimization algorithm for the computation of a part of σF is developed. Alternatively, an approach using an implicit function argument is discussed analytically and, via Newton's method, also numerically. By combining the variational minimization method with Newton's method a new bifurcation result is first observed numerically and then proved rigorously. By replacing the variational minimization method by the Mountain Pass Algorithm higher curves in σF are found numerically. Several numerical results are discussed including a further example of the previously recorded phenomenon of crossing of Fucík curves originating from different eigenvalues.