ppxscal/embedding_network huggingface dataset:
Probability and logic
Authors: Colin Howson
Venue: Journal of Applied Logic (2003)

The paper is an attempt to show that the formalism of subjective probability has a logical interpretation of the sort proposed by Frank Ramsey: as a complete set of constraints for consistent distributions of partial belief. Though Ramsey proposed this view, he did not actually establish it in a way that showed an authentically logical character for the probability axioms (he started the current fashion for generating probabilities from suitably constrained preferences over uncertain options). Other people have also sought to provide the probability calculus with a logical character, though also unsuccessfully. The present paper gives a completeness and soundness theorem supporting a logical interpretation: the syntax is the probability axioms, and the semantics is that of fairness (for bets).
AppleScript: The Definitive Guide
Authors: Matt Neuburg
Venue:  (2003)

AppleScript: The Definitive Guide explores and teaches the language from the ground up. If you're a beginner and want to learn how to write your first script or just understand what the excitement is all about, you'll be able to do so after reading this book. Experienced AppleScripters will love having the most definitive, up-to-date AppleScript language reference available.
Idea of the national system of education and verification traffic's knowledge as a tool of traffic safety increasing
Authors: Przemysław Rózewski, Antoni Wiliński, Oleg Zaikine, Krzysztof Gizycki
Venue: Artificial intelligence and security in computing systems (2003)

Due to large number of the traffic's accidents necessity of immediately traffic safety increasing is appearing. The most reliable way to achieve safety increase of traffic safety is to pay more attention to the driver's education process. The authors introduced the National System of Education and Verification Traffic's Knowledge as a solution of the education issue. The proposed system is based on the up to data computer technologies and ensured the complete education and testing environments. The system is developed for the sake of the European drivers' education standards. The economical factors are under heavy consideration as well as the quality of education's materials. In addition, the idea of the integrated information network of driver's school is discussed.
Estimating the upper limit of the number of signals
Authors: Pinyuen Chen
Venue: Signal Processing (2003)

This paper considers a multi-step selection procedure to estimate the upper limit of the number of signals. The unknown number of signals present in a radar data can be formulated as the difference between the total number of components in the observed multivariate data vector and the multiplicity of the smallest eigenvalue. We propose a selection procedure to estimate the lower limit for the multiplicity of the common smallest eigenvalue, which is significantly smaller than the other eigenvalues. As a consequence, an estimate for the upper limit of the number of signals can be obtained. With a guaranteed probability requirement, the proposed procedure selects a subset that contains the smallest eigenvalues. The size of the subset is random from sample to sample. The number of signals present is estimated as the difference of the number of components and the cardinality of the selected subset. Therefore, our estimate gives an upper bound for the number of signals present. Numerical examples are presented to illustrate our proposed procedure.
An Efficient Defect Estimation Method for Software Defect Curves
Authors: Chenggang Bai, Kai-Yuan Cai, T. Y. Chen
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Software defect curves describe the behavior of theestimate of the number of remaining software defects assoftware testing proceeds. They are of two possiblepatterns: single-trapezoidal-like curves or multiple-trapezoidal-like curves. In this paper we present some necessary and/or sufficient conditions for software defectcurves of the Goel-Okumoto NHPP model. Theseconditions can be used to predict the effect of thedetection and removal of a software defect on thevariations of the estimates of the number of remainingdefects. A field software reliability dataset is used tojustify the trapezoidal shape of software defect curves andour theoretical analyses. The results presented in thispaper may provide useful feedback information forassessing software testing progress and have potentials inthe emerging area of software cybernetics that exploresthe interplay between software and control.
Face Value? Customer Views of Appropriate Formats for Embodied Conversational Agents (ECAs) in Online Retailing
Authors: Kathy Keeling, Susan Beatty, Peter McGoldrick, Linda Macaulay
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Although the motivational benefits of Embodied Conversational Agents in other areas have been demonstrated their potential for relationship building within e-tailing has been little utilized. In this exploratory paper we consider customer perceptions of what types of ECA are appropriate to retailing websites using data from semi-structured interviews with 30 Internet shoppers. Extrapolating the findings from the advertising literature concerning match-up between endorser and brand, product or retailer we find this will be an important element in the acceptability and viability of ECAs on retail websites. It is apparent that great care has to be taken in matching not only the physical characteristics of the ECA to perceptions of the brand, product or retailer but also to the goals and motivations of potential customers of a website. We also find that introducing customer interaction into the match-up' mix introduces a new level of complexity, that of matching customer expectations. It is this level of service that maybe most difficult for technology and organizations to meet.
Improving table compression with combinatorial optimization
Authors: Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo
Venue: Journal of the ACM (JACM) (2003)

We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [2000], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on partitioning and heuristic observations on column permutation, all of which are used to improve compression rates. Based on this theory, we devise the first on-line training algorithms for table compression, which can be applied to individual files, not just continuously operating sources; and also a new, off-line training algorithm, based on a link to the asymmetric traveling salesman problem, which improves on prior work by rearranging columns prior to partitioning. We demonstrate these results experimentally. On various test files, the on-line algorithms provide 35--55&percnt; improvement over gzip with negligible slowdown; the off-line reordering provides up to 20&percnt; further improvement over partitioning alone. We also show that a variation of the table compression problem is MAX-SNP hard.
Increasing high school girls' self confidence and awareness of CS through a positive summer experience
Authors: Lori Pollock, Kathleen McCoy, Sandra Carberry, Namratha Hundigopal, Xiaoxin You
Venue: ACM SIGCSE Bulletin (2004)

This paper describes the design, implementation, and impact evaluation of a summer program designed to attract high school girls to entering an information technology field for their college major. Our main contributions include an analysis of immediate and longer term surveys from both the student participants and the female teaching assistants, curriculum and pedagogy highlights of the program, and lessons learned from the planning and implementation experiences.
Profile Guided Management of Code Partitions for Embedded Systems
Authors: Shukang Zhou, Bruce R. Childers, Naveen Kumar
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Researchers have proposed to divide embedded applications into code partitions and to download partitions on demand from a wireless code server to enable a diverse set of applications for very tightly constrained embedded systems. This paper describes a new approach for managing the request and storage of code partitions and we explore the benefits of our scheme.
Tactile interfaces for small touch screens
Authors: Ivan Poupyrev, Shigeaki Maruyama
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

We present the design, implementation, and informal evaluation of tactile interfaces for small touch screens used in mobile devices. We embedded a tactile apparatus in a Sony PDA touch screen and enhanced its basic GUI elements with tactile feedback. Instead of observing the response of interface controls, users can feel it with their fingers as they press the screen. In informal evaluations, tactile feedback was greeted with enthusiasm. We believe that tactile feedback will become the next step in touch screen interface design and a standard feature of future mobile devices.
Compact representations for fast nonrigid registration of medical images
Authors: Samson J. Timoner
Venue:  (2003)

We develop efficient techniques for the non-rigid registration of medical images by using representations that adapt to the anatomy found in such images. Images of anatomical structures typically have uniform intensity interiors and smooth boundaries. We create methods to represent such regions compactly using tetrahedra. Unlike voxel-based representations, tetrahedra can accurately describe the expected smooth surfaces of medical objects. Furthermore, the interior of such objects can be represented using a small number of tetrahedra. Rather than describing a medical object using tens of thousands of voxels, our representations generally contain only a few thousand elements. Tetrahedra facilitate the creation of efficient non-rigid registration algorithms based on finite element methods (FEM). We create a fast, FEM-based method to non-rigidly register segmented anatomical structures from two subjects. Using our compact tetrahedral representations, this method generally requires less than one minute of processing time on a desktop PC. We also create a novel method for the non-rigid registration of gray scale images. To facilitate a fast method, we create a tetrahedral representation of a displacement field that automatically adapts to both the anatomy in an image and to the displacement field. The resulting algorithm has a computational cost that is dominated by the number of nodes in the mesh (about 10,000), rather than the number of voxels in an image (nearly 10,000,000). For many non-rigid registration problems, we can find a transformation from one image to another in five minutes. This speed is important as it allows use of the algorithm during surgery. We apply our algorithms to find correlations between the shape of anatomical structures and the presence of schizophrenia. We show that a study based on our representations outperforms studies based on other representations. We also use the results of our non-rigid registration algorithm as the basis of a segmentation algorithm. That algorithm also outperforms other methods in our tests, producing smoother segmentations and more accurately reproducing manual segmentations. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Radial basis function interpolation: numerical and analytical developments
Authors: Grady Barrett Wright
Venue:  (2003)

The Radial Basis Function (RBF) method is one of the primary tools for interpolating multidimensional scattered data. The methods' ability to handle arbitrarily scattered data, to easily generalize to several space dimensions, and to provide spectral accuracy have made it particularly popular in several different types of applications. Some of the more recent of these applications include cartography, neural networks, medical imaging, and the numerical solution of partial differential equations (PDEs). In this thesis we study three issues with the RBF method that have received very little attention in the literature. First, we focus on the behavior of RBF interpolants near boundaries. Like most interpolation methods, a common feature of the RBF method is how relatively inaccurate the interpolants are near boundaries. Such boundary induced errors can severely limit the utility of the RBF method for numerically solving certain PDEs. With that as motivation, we investigate the behavior of RBF interpolants near boundaries and propose the first practical techniques for ameliorating the errors there. We next focus on some numerical developments for the RBF method based on infinitely smooth RBFs. Most infinitely smooth RBFs feature a free &ldquo;shape&rdquo; parameter &epsiv; such that, as the magnitude of &epsiv; decreases, the RBFs become increasingly flat. While small values of &epsiv; typically result in more accurate interpolants, the direct method of computing the interpolants suffers from severe numerical ill-conditioning as &epsiv; &rarr; 0. Until recently, this ill-conditioning has severely limited the range of &epsiv; that could be considered in the RBF method. We present a novel numerical approach that largely overcomes the numerical ill-conditioning and allows for the stable computation of RBF interpolants for all values of &epsiv;, including the limiting &epsiv; = 0 case. This new method provides the first tool for the numerical exploration of RBF interpolants as &epsiv; &rarr; 0. The third focus of the thesis is on the behavior of RBF interpolants as &epsiv; &rarr; 0. In most cases the interpolants converge to a finite degree multivariate polynomial interpolant as &epsiv; &rarr; 0. However, in rare situations the interpolants may diverge. We investigate this phenomenon in great detail both numerically and analytically, and link it directly to the failure of a condition known as &ldquo;polynomial unisolvency&rdquo;. We also find that the Gaussian RBF is inherently different from the other standard infinitely smooth RBFs in that it appears to result in an interpolant that never diverges as &epsiv; &rarr; 0. We conclude with a brief overview of two future research opportunities related to the topics of the thesis. The first involves using RBF interpolants to generate scattered-node finite difference formulas. The second involves using RBF interpolants to generate linear multistep methods for solving ordinary differential equations.
Providing an E-Learning Platform in a University Context -- Balancing the Organisational Frame for Application Service Providing
Authors: Wolf-Gideon Bleek, Iver Jackewitz
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Universities have severe difficulties in using e-learning applications successfully due to organisational problems to provide them. Providing a web-based learning environment is an enormous effort not only from the didactical and organisational perspective, but also from an administrative and technical point of view. In this paper we critically review two case studies for making software available in a university context by applying a model for application service providing.ASP in the university context is a different business than ASP between companies. A much more flexible relation between service provider and consumer needs to be established. We describe the necessary process that is based on an evolutionary approach consisting ofrepeated loops that help to balance the organisational frame for application service providing on the four different levels: application domain, organization, services, and contracts.
Teletraffic engineering of multi-band W-CDMA systems
Authors: Villy B. Iversen, Eustachio Epifania
Venue: Network control and engineering for Qos, security and mobility II (2003)

Multi-band Wide- Band Code Division Multiple Access (W--CDMA) systems are considered to be among the best alternatives for Universal Mobile Telecommunications System (UMTS). To evaluate the performance of multi-band W--CDMA systems many parameters have to be taken into account. In this paper we present a method to evaluate the state space of multi-band overlaid W-CDMA system, and we present a very powerful algorithm, the Convolution Algorithm, to evaluate time, call and traffic blocking probabilities for each service. A service is modelled as BPP (Binomial-Poisson-Pascal) multi-rate traffic.
Building a custom client-side research tool for online web-based experiments
Authors: Stu Westin
Venue: Computing information technology: the human side (2003)

This chapter describes a general software-based approach to conducting online Web research through the development of a custom research tool. Specifically, the tool is an Internet Explorer-like Web browser that can be designed to deliver experimental treatments and to collect experimental data with great precision and flexibility. The purpose of the manuscript is to introduce this approach to Web-based research, and to discuss the most salient issues, techniques, and problems that are involved in the development and use of such a research instrument.Programming custom event handlers, for a preexisting software object called the WebBrowser Control, constitutes a major part of the research approach. Event handling techniques having to do with downloading and navigation, with browser interface emulation, and with window and session control are presented. Other relevant issues such as cache management, keyboard handling, and accessing HTML page elements through the Document Object Model are also presented.
Hierarchical video content description and summarization using unified semantic and visual similarity
Authors: Xingquan Zhu, Jianping Fan, Ahmed K. Elmagarmid, Xindong Wu
Venue: Multimedia Systems (2003)

Video is increasingly the medium of choice for a variety of communication channels, resulting primarily from increased levels of networked multimedia systems. One way to keep our heads above the video sea is to provide summaries in a more tractable format. Many existing approaches are limited to exploring important low-level feature related units for summarization. Unfortunately, the semantics, content and structure of the video do not correspond to low-level features directly, even with closed-captions, scene detection, and audio signal processing. The drawbacks of existing methods are the following: (1) instead of unfolding semantics and structures within the video, low-level units usually address only the details, and (2) any important unit selection strategy based on low-level features cannot be applied to general videos. Providing users with an overview of the video content at various levels of summarization is essential for more efficient database retrieval and browsing. In this paper, we present a hierarchical video content description and summarization strategy supported by a novel joint semantic and visual similarity strategy. To describe the video content efficiently and accurately, a video content description ontology is adopted. Various video processing techniques are then utilized to construct a semi-automatic video annotation framework. By integrating acquired content description data, a hierarchical video content structure is constructed with group merging and clustering. Finally, a four layer video summary with different granularities is assembled to assist users in unfolding the video content in a progressive way. Experiments on real-word videos have validated the effectiveness of the proposed approach.
An Improved Algebraic Multigrid Method for Solving Maxwell's Equations
Authors: Pavel B. Bochev, Christopher J. Garasi, Jonathan J. Hu, Allen C. Robinson, Raymond S. Tuminaro
Venue: SIAM Journal on Scientific Computing (2003)

We propose two improvements to the Reitzinger and Schöberl algebraic multigrid (AMG) method for solving the eddy current approximations to Maxwell's equations. The main focus in the Reitzinger/Schöberl method is to maintain null space properties of the weak $\nabla \times \nabla \times$ operator on coarse grids. While these null space properties are critical, they are not enough to guarantee h-independent convergence of the overall multigrid method. We illustrate how the Reitzinger/Schöberl AMG method loses h-independence due to the somewhat limited approximation property of the grid transfer operators. We present two improvements to these operators that not only maintain the important null space properties on coarse grids but also yield significantly improved multigrid convergence rates. The first improvement is based on smoothing the Reitzinger/Schöberl grid transfer operators. The second improvement is obtained by using higher order nodal interpolation to derive the corresponding AMG interpolation operators. While not completely h-independent, the resulting AMG/CG method demonstrates improved convergence behavior while maintaining low operator complexity.
Taming the tiger: teaching the next version of Java
Authors: Jeremy D. Frens
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

The next version of the Java language (Software Development Kit 1.5) will include generics, an enhanced for loop, boxing and unboxing of primitive types, typesafe enumerated types, static import, variable arguments, and metadata. This new version is a significant change of the language itself, adding many features that will impact the use of Java in computer science curricula. Fortunately, this new version provides several features that instructors have wanted in the language from its beginning.
Solidification of Pb pre-covered Cu(111) surface
Authors: E. Vamvakopoulos, G. A. Evangelakis, D. G. Papageorgiou
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We present Molecular Dynamics simulation results based on a semi-empirical potential model in analogy to the Tight Binding scheme in the second moment approximation, concerning the Pb overlayer behaviour deposited on the Cu(111) surface as a function of concentration. We found that the adlayer's character changes from fluid to solid as the Pb concentration passes a characteristic value θc=37.5%. Specifically, for concentration less than θc the deposited Pb atoms exhibit the behaviour of a dilute fluid, while above θc 2D liquid like character appears, to recover typical solid behaviour above the saturation concentration that is dictated from the lattice mismatch at θs=56.3%. These conclusions are deduced from the calculated structural and diffusive properties of the overlayer, namely the Pb lattice parameter and its relative relaxed positions with respect to the bulk lattice spacing as well as the atomic diffusion coefficient. It is found that for concentrations up to θc the adlayer exhibits important expansion with Pb atoms flowing over the substrate and diffusing very fast, while at θs the Pb adlayer is compressed by as much as - 2.65% with respect to the lattice spacing of the bulk Pb material, in agreement with experimental findings.