ppxscal/embedding_network huggingface dataset:
The effect of task domain on search
Authors: Elaine G. Toms, Luanne Freund, Richard Kopak, Joan C. Bartlett
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

The objective of our work is to assess how search interfaces can be personalized according to domain-specific needs. In this study we investigated how people search within diverse domains (consumer health, shopping, travel and general research) to identify differences in searching needs. A mixed method research design was used to observe forty-eight participants interacting with a modified version of Google to complete four search problems from four domains. Results indicated significant differences by domain. Furthermore, analysis of verbal protocols identified specific areas to be addressed in the design of new search interfaces.
A dynamic load distribution strategy for systems under high task variation and heavy traffic
Authors: Bin Fu, Zahir Tari
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Several approaches have been proposed to deal with the issue of load distribution, however they all have similar limitations, such as: (i) tasks are executed in an arbitrary order (which may cause large tasks to be delayed), (ii) the task dispatcher does not take into consideration the server processing capacity (which may cause a large task to be assigned to a server with low processing power) or (iii) they do not consider task deadlines (which if not met, may cause task starvation). This paper proposes an extension of LFF (Least Flow-time First) task assignment policy [9], called LFF-PRIORITY, to deal with these limitations. LFF-PRIORITY dynamically computes two priorities, namely task size and task size priorities, and put them in a priority based multi-section queue. The testing results clearly show that LFF-PRIORITY out performs existing load distribution strategies (that are based on heavy tailed distribution). The testing results also show that more than 80% of tasks meet their task deadline under LFF-PRIORITY.
A greedy algorithm for convex geometries
Authors: Kenji Kashiwabara, Yoshio Okamoto
Venue: Discrete Applied Mathematics (2003)

Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dual of antimatroids. We consider functions defined on the sets of the extreme points of a convex geometry. Faigle-Kern (Math. Programming 72 (1996) 195-206) presented a greedy algorithm to linear programming problems for shellings of posets, and Krüger (Discrete Appl. Math. 99 (2002) 125-148) introduced b-submodular functions and proved that Faigle-Kern's algorithm works for shellings of posets if and only if the given set function is b-submodular. We extend their results to all classes of convex geometries, that is, we prove that the same algorithm works for all convex geometries if and only if the given set function on the extreme sets is submodular in our sense.
Reviewing 25 Years of Testing Technique Experiments
Authors: Natalia Juristo, Ana M. Moreno, Sira Vegas
Venue: Empirical Software Engineering (2004)

Mature knowledge allows engineering disciplines the achievement of predictable results. Unfortunately, the type of knowledge used in software engineering can be considered to be of a relatively low maturity, and developers are guided by intuition, fashion or market-speak rather than by facts or undisputed statements proper to an engineering discipline. Testing techniques determine different criteria for selecting the test cases that will be used as input to the system under examination, which means that an effective and efficient selection of test cases conditions the success of the tests. The knowledge for selecting testing techniques should come from studies that empirically justify the benefits and application conditions of the different techniques. This paper analyzes the maturity level of the knowledge about testing techniques by examining existing empirical studies about these techniques. We have analyzed their results, and obtained a testing technique knowledge classification based on their factuality and objectivity, according to four parameters.
Regular Elements and Global Controllability in SL(d, R)
Authors: Richard M. Mamani Troncoso
Venue: Journal of Dynamical and Control Systems (2004)

We introduce a generalized concept of split-regular elements and study the dynamics of such elements on the flag manifolds corresponding to the Lie group SL(d, R). Based on these concepts, we obtain the stable and unstable manifolds, the Morse decomposition, and obtain the limit sets inside the corresponding control sets. These dynamical aspects are studied with the purpose of applying them in order to extend a result of global controllability of discrete-time bilinear systems defined by elements of sl(d, R).
Submap Density and Asymmetry Results for Two Parameter Map Families
Authors: Edward A. Bender, E. Rodney Canfield, Zhicheng Gao, L. Bruce Ricmond
Venue: Combinatorics, Probability and Computing (1997)

Let &Mscr;n,k(S) be the set of n-edge k-vertex rooted maps in some class on the surface S. Let P be a planar map in the class. We develop a method for showing that almost all maps in &Mscr;n,k(S) contain many copies of P. One consequence of this is that almost all maps in &Mscr;n,k(S) have no symmetries. The classes considered include c-connected maps (c &le; 3) and certain families of degree restricted maps.
NRLM: A Novel Router-Assisted Layered Multicast Scheme
Authors: Feng Shi, Ke Xu, Jianping Wu, Mingwei Xu
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In this paper, we introduce NRLM, a novel equation-based network-supported layered multicast congestion control protocol that solves the previous problems and achieves TCP-friendly with TCP. We use a simple statistical analysis to evaluate the stability of NRLM and the simulation results show that NRLM works well with proper parameters.
Crossing Numbers and Hard Erd&ouml;s Problems in Discrete Geometry
Authors: László A. Székely
Venue: Combinatorics, Probability and Computing (1997)

We show that an old but not well-known lower bound for the crossing number of a graph yields short proofs for a number of bounds in discrete plane geometry which were considered hard before: the number of incidences among points and lines, the maximum number of unit distances among n points, the minimum number of distinct distances among n points.
Unsupervised recognition of multi-view face sequences based on pairwise clustering with attraction and repulsion
Authors: Bisser Raytchev, Hiroshi Murase
Venue: Computer Vision and Image Understanding (2003)

In this paper we propose and investigate the possibilities inherent in a new, unsupervised approach to multi-view face recognition, which can be formulated mathematically as a problem of partitioning of proximity data, obtained from multi-view face image sequences. The proposed approach is implemented in two novel pairwise clustering algorithms, CAR1 and CAR2, which partition the input data into identity clusters by performing combinatorial optimization guided by two types of interaction forces, attraction and repulsion, imposed on the original proximity matrices. Several experiments were conducted in order to test the performance of the proposed algorithms on real-world datasets including both frontal and side-view faces, which have been gathered over a period of several months. The obtained results can be considered encouraging for the general approach proposed here, and the new algorithms compared favorably to two other pairwise clustering algorithms, recently proposed in the image segmentation literature.
Analysis and comparison of Green's function first-passage algorithms with &#x0022;walk on spheres&#x0022; algorithms
Authors: Chi-Ok Hwang, Michael Mascagni
Venue: Mathematics and Computers in Simulation (2003)

We analyze the optimization of the running times of Green's function first-passage (GFFP) algorithms. The running times for these new first-passage (FP) algorithms [J. Chem. Phys. 106 (9) (1997) 3721; Phys. Fluids A 12 (7) (2000) 1699; J. Comput. Phys. 174 (2) (2001) 925; Monte Carlo Meth. Appl. 7 (3-4) (2001) 213], which use exact Green's functions for the Laplacian to eliminate the absorption layer in the "Walk on Spheres" (WOS) method [Ann. Math. Stat. 27 (1956) 569; J. Heat Transfer 89 (1967) 121; J. Chem. Phys. 100 (5) (1994) 3821; J. Appl. Phys. 71 (6) (1992) 2727; J. Comput. Phys. 39 (1981) 396], are compared with those for WOS algorithms. It has been empirically observed that GFFP algorithms are more efficient than WOS algorithms when high accuracy is required [Phys. Fluids A 12 (7) (2000) 1699; J. Comput. Phys. 174 (2) (2001) 925; Monte Carlo Meth. Appl. 7 (3-4) (2001) 213]. Additionally, it has been observed that there is always an optimal distance from the surface of the absorbing boundary, δI, for a GFFP algorithm within which a FP surface can be permitted to intersect the boundary [Phys. Fluids A 12(7) (2000) 1699; J. Comput. Phys. 174 (2) (2001) 925; Monte Carlo Meth. Appl. 7 (3-4) (2001) 213]. In this paper, we will provide a rigorous complexity analysis consistent with these observations. This analysis is based on estimating the numbers of WOS and GFFP steps needed for absorption on the boundary, and the complexity and running times of each WOS and GFFP step. As an illustration, we analyze the running times for calculating the capacitance of the unit cube using both GFFP and WOS.
Detecting Merging and Splitting using Origin Analysis
Authors: Lijie Zou, Michael W. Godfrey
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Merging and splittingsource code artifacts is a commonactivity during the lifespan of a software system; as developersrethink the essential structure of a system or plan fora new evolutionary direction, so must they be able to reorganizethe design artifacts at various abstraction levelsas seems appropriate. However, while the raw effects ofsuch changes may be plainly evident in the new artifacts,the original intent of the design changes is often lost. Inthis paper, we discuss how we have extended origin analysis[10, 5] to aid in the detection of merging and splittingof files and functions in procedural code; in particular,we show how reasoning about how call relationships havechanged can aid a developer in locating where merges andsplits have occurred, thereby helping to recover informationabout the intent of the design change. We also describea case study of these techniques (as implemented inthe Beagle tool) using the PostgreSQL database as the candidatesystem.
Surrogate Programming and Multipliers in Quasi-convex Programming
Authors: Jean-Paul Penot, Michel Volle
Venue: SIAM Journal on Control and Optimization (2003)

A result due to Luenberger on the existence of multipliers in a quasi-convex programming problem is extended to the case of constraints given by an arbitrary convex cone under a constraint qualification condition more general than Slater's condition. The existence of solutions is not assumed. We point out links with even convexity in the sense of Fenchel and quasi subdifferentiability in the sense of Greenberg--Pierskalla, and we observe that the couples of primal-dual optimal solutions reduce to saddle-points of a suitable Lagrangian function.
Confirming Configurations in EFSM Testing
Authors: Alexandre Petrenko, Sergiy Boroday, Roland Groz
Venue: IEEE Transactions on Software Engineering (2004)

Abstract--In this paper, we investigate the problem of configuration verification for the extended FSM (EFSM) model. This is an extension of the FSM state identification problem. Specifically, given a configuration (¿state vector¿) and an arbitrary set of configurations, determine an input sequence such that the EFSM in the given configuration produces an output sequence different from that of the configurations in the given set or at least in a maximal proper subset. Such a sequence can be used in a test case to confirm the destination configuration of a particular EFSM transition. We demonstrate that this problem could be reduced to the EFSM traversal problem, so that the existing methods and tools developed in the context of model checking become applicable. We introduce notions of EFSM projections and products and, based on these notions, we develop a theoretical framework for determining configuration-confirming sequences. The proposed approach is illustrated on a realistic example.
Measuring the perceived visual realism of images
Authors: Pablo Mauricio Rademacher
Venue:  (2003)

One of the main goals of computer graphics research is to develop techniques for creating images that look real&mdash;i.e., indistinguishable from photographs. Most existing work on this problem has focused on image synthesis methods, such as the simulation of the physics of light transport and the reprojection of photographic samples. However, the existing research has been conducted without a clear understanding of how it is that people determine whether an image looks real or not real. There has never been an objectively tested, operational definition of realism for images, in terms of the visual factors that comprise them. If the perceptual cues behind the assessment of realism were understood, then rendering algorithms could be developed to directly target these cues. This work introduces an experimental method for measuring the perceived visual realism of images, and presents the results of a series of controlled human participant experiments. These experiments investigate the following visual factors: shadow softness, surface smoothness, number of objects, mix of object shapes, and number of light sources. The experiments yield qualitative and quantitative results, confirm some common assertions about realism, and contradict others. They demonstrate that participants untrained in computer graphics converge upon a common interpretation of the term real, with regard to images. The experimental method can be performed using either photographs or computer-generated images, which enables the future investigation of a wide range of visual factors.
Best Business Practices for Standards Groups
Authors: Michael LoBue
Venue: Computer (2004)

A new standard raises the bar for association management companies.
Understanding software systems using reverse engineering technology perspectives from the Rigi project
Authors: Hausi A. Müller, Scott R. Tilley, Kenny Wong
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

Software engineering research has focused mainly on software construction and has neglected software maintenance and evolution. Proposed is a shift in research from synthesis to analysis. Reverse engineering is introduced as a possible solution to program understanding and software analysis. Presented is reverse engineering technology developed as part of the Rigi project. The Rigi approach involves the identification of software artifacts in the subject system and the aggregation of these artifacts to form more abstract architectural models. Reported are some analyses on the source code of SQL/DS, performed by the authors while visiting the Program Understanding project at the IBM Centre for Advanced Studies in Toronto.
Problems Creating Task-relevant Clone Detection Reference Data
Authors: Andrew Walenstein, Nitin Jyoti, Junwei Li, Yun Yang, Arun Lakhotia
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

One prevalent method for evaluating the results of automatedsoftware analysis tools is to compare the tools'output to the judgment of human experts. This evaluationstrategy is commonly assumed in the field of software clonedetector research. We report our experiences from a studyusing several human judges who tried to establish "referencesets" of function clones for several medium-sized softwaresystems written in C. The study employed multiplejudges and followed a process typical for inter-coder reliabilityassurance wherein coders discussed classificationdiscrepancies until consensus is reached. A high level ofdisagreement was found for reference sets made specificallyfor reengineering task contexts. The results, although preliminary,raise questions about limitations of prior clonedetector evaluations and other similar tool evaluations. Implicationsare drawn for future work on reference data generation,tool evaluations, and benchmarking efforts.
Higher-order functional languages and intensional logic
Authors: P. Rondogiannis, W. W. Wadge
Venue: Journal of Functional Programming (1999)

In this paper we demonstrate that a broad class of higher-order functional programs can be transformed into semantically equivalent multidimensional intensional programs that contain only nullary variable definitions. The proposed algorithm systematically eliminates user-defined functions from the source program, by appropriately introducing context manipulation (i.e. intensional) operators. The transformation takes place in M steps, where M is the order of the initial functional program. During each step the order of the program is reduced by one, and the final outcome of the algorithm is an M-dimensional intensional program of order zero. As the resulting intensional code can be executed in a purely tagged-dataflow way, the proposed approach offers a promising new technique for the implementation of higher-order functional languages.
Some reflections on the current state of automatic Braille translation
Authors: Philip W. F. Coleman
Venue: Issue 15 (March 1975) (1975)

This paper outlines current work in Britain on Braille translation by computer. It goes on to explore possible programming methods, highlighting problems and suggesting solutions. It finishes by examining the feasibility of an international index of Braille software, suggesting a possible implementation.Before I begin, may I say first, how pleased and privileged I feel to be here today - my pleasure will be all th e greater if this conference achieves something really positive; and second, how grateful I am to Professor Werner for inviting me - I hope he will feel that my presence is worthwhile.So much has been written already about Braille translation by computer that I feel doubtful about how much that is original there is for me to add. However, in this paper, I shall begin by outlining the work proceeding in the United Kingdom; I shall go on to suggest some programming techniques worth investigating when implementing Braille translation systems; and finally I shall talk about the possibility of the international pooling of Braille translation programs and of information about them.
A generic framework for defining domain-specific models
Authors: Arnor Solberg, Jon Oldevik, Audun Jensvoll
Venue: UML and the unified process (2003)

How do you tailor a general-purpose system development methodology to appropriately fit the specific needs of your company and the actual domain or product-family you are working with? Moreover, how do you alter a general-purpose methodology to utilize the domain knowledge possessed by your company? This chapter describes a generic framework for tailoring general-purpose, model-based methodologies in order to deliver domain-specific models.
Packing Ferrers Shapes
Authors: Noga Alon, Miklós Bóna, Joel Spencer
Venue: Combinatorics, Probability and Computing (2000)

Answering a question of Wilf, we show that, if n is sufficiently large, then one cannot cover an n &times; p(n) rectangle using each of the p(n) distinct Ferrers shapes of size n exactly once. Moreover, the maximum number of pairwise distinct, non-overlapping Ferrers shapes that can be packed in such a rectangle is only &Theta;(p(n)&#x002F;log n):
Using pen-based computers across the computer science curriculum
Authors: Dave Berque, Terri Bonebright, Michael Whitesell
Venue: ACM SIGCSE Bulletin (2004)

This paper describes our use of pen-based electronic classrooms to enhance several computer science courses. After presenting our motivation for undertaking this work, and its relevance to the growing interest in using tablet PC's in the classroom, we present an overview of our use of this technology to engage students during class. Finally, we present the students' reaction to the approach as measured through attitude surveys and a focus group.
A Digital Test for First-Order [Sigma-Delta] Modulators
Authors: Gildas Leger, Adoración Rueda
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a digital structural test for first order Sigma-Delta modulators. A periodic digital sequence is used as a stimulus to obtain a signature of the integrator leakage. This parameter is known to be related to the modulator precision and its estimation is of great importance to assess if the modulator works as expected. As the proposed technique is fully digital, it is specially suitable to test modulators embedded in complex Mixed-Signal circuits.
The experienced "sense" of a virtual community: characteristics and processes
Authors: Anita L. Blanchard, M. Lynne Markus
Venue: ACM SIGMIS Database (2004)

E-commerce strategists advise companies to create virtual communities for their customers. But what does this involve? Research on face-to-face communities identifies the concept of "sense of community:" a characteristic of successful communities distinguished by members' helping behaviors and members' emotional attachment to the community and other members. Does a sense of virtual community exist in online settings, and what does it consist of? Answering these questions is key, if we are to provide guidance to businesses attempting to create virtual communities.The paper explores the concept of sense of virtual community in a newsgroup we call Multiple Sports Newsgroup (MSN). We first demonstrate that MSN does indeed have a sense of virtual community, but that the dimensions of the sense of community in MSN differ somewhat from those reported for physical communities. The nature of these differences is plausibly related to the differences between electronic and face-to-face communication. We next describe the behavioral processes that contribute to the sense of virtual community at MSN-exchanging support, creating identities and making identifications, and the production of trust. Again, these processes are similar to those found in non-virtual communities, but they are related to the challenges of electronic communication. Lastly, we consider the question of how sense of community may come about and discuss the implications for electronic business.
Three Cases of Light-Traffic Insensitivity of the Loss Probability in a GI/G/m/0 Loss System to the Shape of the Service Time Distribution
Authors: I. N. Kovalenko, J. B. Atkinson, K. V. Mykhalevych
Venue: Queueing Systems: Theory and Applications (2003)

A GI/G/m/0 loss system is considered. Three cases of light-traffic insensitivity of the loss probability to the shape of the service time distribution, given its first moment, are investigated in a triangle array setting.