ppxscal/embedding_network huggingface dataset:
An exact algorithm for the min-cost network containment problem
Venue: Networks (2004)

A network design problem which arises in the distribution of a public utility provided by several competitive suppliers is studied. The problem addressed is that of determining minimum-cost &lpar;generalized&rpar; arc capacities in order to accommodate any demand between given source&ndash;sink pairs of nodes, where demands are assumed to fall within predetermined ranges. Feasible flows are initially considered as simply bounded by the usual arc capacity constraints. Then, more general linear constraints are introduced which may limit the weighted sum of the flows on some subsets of arcs. An exact cutting plane algorithm is presented for solving both of the above cases and some computational results are reported. &copy; 2004 Wiley Periodicals, Inc.
The impact of the proposed standard for floating point arithmetic on languages and systems
Authors: Stuart I. Feldman
Venue: ACM SIGNUM Newsletter (1979)

Most programming languages seem to take a grudging approach to floating point computation. Many processors support these operations, and some peculiar and important users insist on using them, so languages provide some facility for using floating point entities. But very little care seems to be taken with numeric issues. Part of the problem is the wide range of anomalous hardware that must be made to "fit" the language. A language definition can be very vague (the most popular approach), or it can cover the limitations and anomalies by a careful specification (as in Brown's model [1]), or it can restrict its domain to particular hardware (such as the Floating Point Standard). The main impact of the proposed floating point standards may be to force a reconsideration of the role of floating point in programming languages. The following comments apply to all of the major proposals; where details are needed for a specific example, the Kahan, Coonen, and Stone [2] proposal is used.
Lower bounds for sense of direction in regular graphs
Authors: Paolo Boldi, Sebastiano Vigna
Venue: Distributed Computing (2003)

A graph G with n vertices and maximum degree ΔG cannot be given weak sense of direction using less than ΔG colours. It is known that n colours are always sufficient, and it was conjectured that just ΔG + 1 are really needed, that is, one more colour is sufficient. Nonetheless, it has been shown [3] that for sufficiently large n there are graphs requiring Ω(n log log n/log n) more colours than ΔG. In this paper, using recent results in asymptotic graph enumeration, we show that (surprisingly) the same bound holds for regular graphs. We also show that Ω(dG√log log dG) colours are necessary, where dG is the degree of G.
Multileveled Symbiotic Evolutionary Algorithm: Application to FMS Loading Problems
Authors: Jae Yun Kim, Yeo Keun Kim
Venue: Applied Intelligence (2005)

Recently, there has been an increasing effort to address integrated problems that are composed of multiple interrelated sub-problems. Many integrated problems in the real world have a multileveled structure. This paper proposes a new method of solving integrated and multileveled problems. The proposed method is named Multileveled Symbiotic Evolutionary Algorithm (MSEA). MSEA is an evolutionary algorithm that imitates the process of symbiotic evolution, including endosymbiotic evolution. It is designed to promote the balance of population diversity and population convergence. To verify its applicability, MSEA is applied to loading problems of flexible manufacturing systems with various flexibilities. Through computer experiments, the features of MSEA are shown and their effects on search capability are discussed. The proposed algorithm is also compared with existing ones in terms of solution quality. The experimental results confirm the effectiveness of our approach.
Bandwidth Management with a Reconfigurable Data Cache
Authors: Pradeep Nalabalapu, Ron Sass
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

With ever larger FPGA devices, hardware engineers are increasingly relying on automated tools to generate complex designs. However, relatively little attention has focused on automatically generating components of the memory hierarchy. Conventional cache research (despite its extensive study) rarely offers designs that map well to FPGAs. Here we propose an approach that uses compiler technology to analyze an application's predominant array access patterns and then generates a data cache customized for the application. The generic Reconfigurable Data Cache component and the technique used to automatically configure it are described. To demonstrate the feasibility of the proposed approach, a prototype has been implemented. We use the convolution as a representative multimedia operation, and show the benefit of the Reconfigurable Data Cache. Even though the computational structure for convolution is easy to generate automatically (from high-level source code), the resulting design alone is memory-bound and not faster than a comparable microprocessor. However, with the addition of the customized Reconfigurable Data Cache, the resulting system runs 5× faster and outperforms the reference microprocessor.
Information extraction and evaluation
Authors: Lisa F. Rau
Venue: Proceedings of the 5th conference on Message understanding (1993)

This topic session focussed on a variety of issues in evaluation (three presentations) and extraction (one presentation). For the extraction presentation, Tsuyoshi Kitani, a visiting researcher at the Center for Machine Translation at Carnegie-Mellon University gave a presention entitled "Overview of TEXTRACT Template-Filling Solutions". This talk gave an overview of TEXTRACT, which processes articles in the Japanese joint venture and microelectronics domains. Although TEXTRACT was developed at CMU as an optional system of the GE-CMU SHOGUN system, the systems share no code beyond the MAJESTY morphological analyzer, and some of the knowledge in TEXTRACT was used to develop SHOGUN.
Performance of adaptive bridge scheduling in a scatternet with a slave&ndash;slave bridge: Research Articles
Authors: Vojislav B. Mišić, Jelena Mišić, Ka Lok Chan
Venue: Wireless Communications Mobile Computing (2004)

End-to-end packet delays in a Bluetooth scatternet with a Slave&ndash;Slave (SS) bridge can be minimized by adjusting the bridge residence times in accordance with traffic intensity and locality. This paper presents two algorithms to do so. One of these uses a fixed value of the bridge residence time, while the other adjusts the residence time dynamically according to the instantaneous intensity of inter-piconet traffic. We discuss the performance of these algorithms and show that the adaptive algorithm offers better performance than the fixed residence time one, provided the parameters are chosen appropriately. We also consider the stability of both algorithms and show that they have comparable stability limits. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Pose-Robust Face Recognition Using Geometry Assisted Probabilistic Modeling
Authors: Xiaoming Liu, Tsuhan Chen
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Researchers have been working on human face recognition for decades. Face recognition is hard due to different types of variations in face images, such as pose, illumination and expression, among which pose variation is the hardest one to deal with. To improve face recognition under pose variation, this paper presents a geometry assisted probabilistic approach. We approximate a human head with a 3D ellipsoid model, so that any face image is a 2D projection of such a 3D ellipsoid at a certain pose. In this approach, both training and test images are back projected to the surface of the 3D ellipsoid, according to their estimated poses, to form the texture maps. Thus the recognition can be conducted by comparing the texture maps instead of the original images, as done in traditional face recognition. In addition, we represent the texture map as an array of local patches, which enables us to train a probabilistic model for comparing corresponding patches. By conducting experiments on the CMU PIE database, we show that the proposed algorithm provides better performance than the existing algorithms.
The anticipated and assessed contribution of information types in references retrieved for preparing a research proposal
Authors: Sami Serola, Pertti Vakkari
Venue: Journal of the American Society for Information Science and Technology (2005)

This small-scale empirical study focuses on students' anticipated and assessed contribution of references retrieved during the preparation of research proposals. It explores how the expected contribution of types of information before searches differs from the assessed contribution of relevant references found by the types of information. Twenty-two psychology undergraduates searched the PsychINFO database for references at the initial and end stages of a seminar for preparing proposals. Data about their subject knowledge, search goals, and utility assessments were collected using several methods. They were asked to predict and assess the utility of information types provided by relevant references for the proposals. At the beginning of the process, they found fewer general types of information and more specific types of information than they expected. However, the students tended to accept references according to their expectations. By the end of the process, the expected importance of general information types declined and the importance of specific information types increased. At the end of the task, students became more proficient at recognizing the utility and topicality of references. They also became more critical in accepting found information to match their expectations.
Control of Teleoperators with Communication Time Delay through State Convergence
Authors: Jose M. Azorin, Oscar Reinoso, Rafael Aracil, Manuel Ferre
Venue: Journal of Robotic Systems (2004)

This paper describes a new control method of teleoperation systems with communication time delay. This method models the teleoperation system in the state space, considering all the possible interactions that could appear in the operator-master-slave-environment set, and it uses the Taylor expansion to model the time delay. The control system allows that the slave manipulator follows the master in spite of the time delay in the communication channel. The tracking is achieved by state convergence between the master and the slave. The method is also able to establish the desired dynamics of this convergence and the dynamics of the slave manipulator. Furthermore, a simple design procedure is provided to obtain the control system gains. These control gains are calculated solving a set of seven equations. The control method is robust to the uncertainty of the design parameters, so it is not necessary to obtain good estimations of these parameters. Simulations and experiments with a one DOF teleoperation system are presented to verify the control method. &copy; 2004 Wiley Periodicals, Inc.
Background Recognition in Dynamic Scenes with Motion Constraints
Authors: K. E. Ozden, L. Van Gool
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Consider a monocular image sequence which contains independently moving objects and assume it is already segmented. In order to get a realistic 3D reconstruction of such a scene, we have to solve the relative scale ambiguity between the reconstructions of different moving objects. Recently, we demonstrated the usefulness of the so-called ýnon-accidentalness and independence constraintsý to disambiguate the mentioned unknown relative scale. However, this technique requires that the video segment which corresponds to the background is known beforehand. In this paper, we analyze the background detection problem in the vein of the aforementioned constraints and show that the background is not just another moving object but the one which results in the simplest overall scene interpretation.
A Generalized Algorithm for the Generation of Correlated Rayleigh Fading Envelopes in Radio Channels
Authors: Le Chung Tran, Tadeusz A. Wysocki, Jennifer Seberry, Alfred Mertins
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

Although generation of correlated Rayleigh fading envelopes has been intensively considered in the literature, all conventional methods have their own shortcomings, which seriously impede their applicability. In this paper, a very general, straightforward algorithm for generation of an arbitrary number of Rayleigh envelopes with any desired, equal or unequal power, in wireless channels either with or without Doppler frequency shifts, is proposed. The proposed algorithm can be applied in case of spatial correlation, such as with antenna arrays in Multiple Input Multiple Output (MIMO) systems, or spectral correlation between the random processes like in Orthogonal Frequency Division Multiplexing (OFDM) systems. It can also be used for generating correlated Rayleigh fading envelopes in either discrete-time instants or a real-time scenario. Besides being more generalized, our proposed algorithm is more precise, while overcoming all shortcomings of the conventional methods.
Generalized statistics on Sn and pattern avoidance
Authors: Amitai Regev, Yuval Roichman
Venue: European Journal of Combinatorics (2005)

Natural q analogues of classical statistics on the symmetric groups Sn are introduced; parameters like: the q-length, the q-inversion number, the q-descent number and the q-major index. Here q is a positive integer. MacMahon's theorem (Combinatory Analysis I-II (1916)) about the equidistribution of the inversion number and the reverse major index is generalized to all positive integers q. It is also shown that the q-inversion number and the q-reverse major index are equi-distributed over subsets of permutations avoiding certain patterns. Natural q analogues of the Bell and the Stirling numbers are related to these q statistics--through the counting of the above pattern-avoiding permutations.
Flexible timeline user interface using constraints
Authors: Kazutaka Kurihara, David Vronay, Takeo Igarashi
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Authoring tools routinely include a timeline representation to allow the author to specify the sequence of animations and interactions. However, traditional static timelines are best suited for static, linear sequences (such MIDI sequencers) and do not lend themselves to interactive content. This forces authors to supplement their timelines with scripted actions which are not represented. Timelines also force frame-accuracy on the author, which interferes with rapid exploration of different designs. We present a redesign of the timeline in which users can specify the relative ordering and causality of events without specifying exact times or durations. This effectively enables users to "work rough" in time. We then implement a prototype and perform a user study to investigate its efficiency.
Average independence polynomials
Authors: J. I. Brown, R. J. Nowakowski
Venue: Journal of Combinatorial Theory Series B (2005)

The independence polynomial of a graph G is the function i(G, x) = Σ k ≥ 0 ik xk, where ik is the number of independent sets of vertices in G of cardinality k. We investigate here the average independence polynomial, where the average is taken over all independence polynomials of (labeled) graphs of order n. We prove that while almost every independence polynomial has a nonreal root, the average independence polynomials always have all real, simple roots.
A Markov Random Field Approach for Dense Photometric Stereo
Authors: Kam-Lun Tang, Chi-Keung Tang, Tien-Tsin Wong
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a surprisingly simple system that allows for robust normal reconstruction by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint, in the presense of spurious noises caused by highlight, shadows and non-Lambertian reflections. Our system consists of a mirror sphere, a spotlight and a DV camera only. Using this, a dense set of unbiased but noisy photometric data that roughly distributed uniformly on the light direction sphere is produced. To simultaneously recover normal orientations and preserve discontinuities, we model the dense photometric stereo problem into two coupled Markov Random Fields (MRFs): a smooth field for normal orientations, and a spatial line process for normal orientation discontinuities. A very fast tensorial belief propagation method is used to approximate the maximum a posteriori (MAP) solution of the Markov network. We present very encouraging results on a wide range of difficult objects to show the efficacy of our approach.
Adaptive Software for Scientific Computing: Co-Managing Quality-Performance-Power Tradeoffs
Authors: P. Raghavan, M. J. Irwin, L. C. McInnes, B. Norris
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

Current trends in microprocessor design indicate that chips are approaching their packaging thermal limits, and the power-related costs of high-performance clusters and multiprocessors continue to grow as a quadratic function of peak execution rates and clock frequencies. Although a faster scientific simulation, such as one obtained by exploiting quality-performance tradeoffs, is also often one that consumes less power by using fewer compute cycles, a major challenge is developing explicitly power-aware scientific computing tools that can exploit special energy-saving features of the circuit fabric. Such tools are perhaps most natural when scientific computing involved sparse or irregular computations, for example, simulations based on partial differential equations in two or three spatial dimensions solved using implicit or semi-implicit schemes. Sparse kernels typically cannot execute near peak rates of the CPU's, and there is potential for tuning them to co-manage both power and performance characteristics. Furthermore, each sparse kernel often has a variety of implementations offering a wide range of tradeoffs in solution quality (e.g., accuracy, reliability, and scalability) and performance (e.g., execution time/rate and parallel efficiency/speedup). Consequently, proper methodselection to meet changing application quality-of-service requirements and changing technologies can potentially provide dramatic performance improvements and savings in energy by using circuit fabric features such as dynamic voltage scaling. Our goal is to design adaptive tools for sparse computations that deliver reduced-energy realizations without adversely impacting application performance. In this paper, we provide an overview of our project and discuss some initial results.
A CHR-based implementation of known arc-consistency
Authors: Marco Alberti, Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano
Venue: Theory and Practice of Logic Programming (2005)

In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external environment, acquiring the whole domains of variables before the beginning of constraint propagation may cause waste of computation time, or even obsolescence of the acquired data at the time of use. For such cases, the Interactive Constraint Satisfaction Problem (ICSP) model has been proposed (Cucchiara et al. 1999a) as an extension of the CSP model, to make it possible to start constraint propagation even when domains are not fully known, performing acquisition of domain elements only when necessary, and without the need for restarting the propagation after every acquisition. In this paper, we show how a solver for the two sorted CLP language, defined in previous work (Gavanelli et al. 2005) to express ICSPs, has been implemented in the Constraint Handling Rules (CHR) language, a declarative language particularly suitable for high level implementation of constraint solvers.
GESTURE CONSISTENCY FOR TEXT, SPREADSHEET, GRAPHIC AND FORM FILL EDITING
Authors: Mary J. LaLomia, Karen C. Cohen
Venue: ACM SIGCHI Bulletin (1991)

Computer systems that simulate a paper and pen environment have been the focus of considerable development activity. One concern generated from this activity is whether a default set of hand-drawn gestures should be provided to the users. This paper examined whether individuals produced similar gestures for 32 editing functions across four application domains; text, spreadsheet, graphic, and form fill. The individuals (half computer novices and half computer-experienced) indicated gestures for each of the editing functions using each application domain. The results indicated that the consistency of hand-drawn gestures was not affected by the participant's computer experience, by the size and shape of the information to be modified or the application domain.
Drowsy region-based caches: minimizing both dynamic and static power dissipation
Authors: Michael J. Geiger, Sally A. McKee, Gary S. Tyson
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Power consumption within the memory hierarchy grows in importance as on-chip data caches occupy increasingly greater die area. Among dynamic power conservation schemes, horizontal partitioning reduces average power per data access by employing multiple smaller structures or using cache subbanks. For instance, region-based caching places small caches dedicated to stack and global accesses next to the L1 data cache. With respect to static power dissipation, leakage power may be addressed at both circuit and architectural levels. Drowsy caches reduce leakage power by keeping inactive lines in a low-power mode. Here we merge drowsy and region-based caching to reduce overall cache power consumption, showing that the combination yields more benefits than either alone. Applications from the MiBench suite exhibit power reductions in the cache system of up to 68-71%, depending on memory configuration, with a small increase in execution time
Mediation of group cognition
Authors: Gerry Stahl
Venue: ACM SIGGROUP Bulletin (2003)

The term "community-based learning" can refer to a variety of forms of learning. One can, for instance, insist on an individualistic notion of learning and argue that individual learning can be enhanced by factors that may influence it from a supportive community environment. At the other theoretical extreme, one can propose a social conception of learning and claim that most important knowledge building takes place at the community level, while individual learning is a secondary matter of internalization, acculturation or increased participation in community. Here, we will stake out a middle ground: that community-based learning should be analyzed at the intermediate level of small groups of individuals within the community. We point out that small groups typically mediate the relationship of communities to their members and we propose a consideration of small group cognition as an alternative methodological focus to either cognition in the head of individuals or the cultural knowledge of a whole community. This approach has practical implications for CSCL and CSCW: collaboration is taken to be a potential emergent phenomenon of small group interaction, and the computer support of collaboration is analyzed as an enabling technology whose design and use forms and transforms the nature of the interactions.