ppxscal/embedding_network huggingface dataset:
Space-efficient inference in dynamic probabilistic networks
Authors: John Binder, Kevin Murphy, Stuart Russell
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Dynamic probabilistic networks (DPNs) are a useful tool for modeling complex stochastic processes. The simplest inference task in DPNs is monitoring- that is, computing a posterior distribution for the state variables at each time step given all observations up to that time. Recursive, constant-space algorithms are well-known for monitoring in DPNs and other models. This paper is concerned with hindsight -that is, computing a posterior distribution given both past and future observations. Hindsight is an essential subtask of learning DPN models from data. Existing algorithms for hindsight in DPNs use O(SN) space and time, where N is the total length of the observation sequence and S is the state space size for each time step. They are therefore impractical for hindsight in complex models with long observation sequences. This paper presents an O(S log N) space, O(SN log N) time hindsight algorithm. We demonstrates the effectiveness of the algorithm in two real-world DPN learning problems. We also discuss the possibility of an O(S)-space, O(SiV)-time algorithm.
Conditions for Segmentation of 2D Translations of 3D Objects
Authors: Shafriza Nisha Basah, Alireza Bab-Hadiashar, Reza Hoseinnezhad
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Various computer vision applications involve recovery and estimation of multiple motions from images of dynamic scenes. The exact nature of objects' motions and the camera parameters are often not known a priori and therefore, the most general motion model (the fundamental matrix) is applied. Although the estimation of a fundamental matrix and its use for motion segmentation are well understood, the conditions governing the feasibility of segmentation for different types of motions are yet to be discovered. In this paper, we study the feasibility of separating 2D translations of 3D objects in a dynamic scene. We show that successful segmentation of 2D translations depends on the magnitude of the translations, average distance between the camera and objects, focal length of the camera and level of noise. Extensive set of controlled experiments using both synthetic and real images were conducted to show the validity of the proposed constraints. In addition, we quantified the conditions for successful segmentation of 2D translations in terms of the magnitude of those translations, the average distance between the camera and objects in motions for a given camera. These results are of particular importance for practitioners designing solutions for computer vision problems.
Application-Level and Job-Flow Scheduling: An Approach for Achieving Quality of Service in Distributed Computing
Authors: Victor Toporkov
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

This paper presents the scheduling strategies framework for distributed computing. The fact that architecture of the computational environment is distributed, heterogeneous, and dynamic along with autonomy of processor nodes, makes it much more difficult to manage and assign resources for job execution which fulfils user expectations for quality of service (QoS).The strategies are implemented using a combination of job-flow and application-level techniques of scheduling and resource co-allocation within virtual organizations of Grid. Applications are regarded as compound jobs with a complex structure containing several tasks. Strategy is considered as a set of possible job scheduling variants with a coordinated allocation of the tasks to the processor nodes. The choice of the specific variant depends on the load level of the resource dynamics and is formed as a resource request, which is sent to a local batch-job management system.
Strategies for collaborative writing and phases of knowledge construction in CSCL environments
Authors: Javier Onrubia, Anna Engel
Venue: Computers Education (2009)

Within the framework of research that describes the processes of collaborative knowledge construction in computer-supported collaborative learning (CSCL) environments, the present work has three objectives: (i) the identification of the strategies of six small groups of university students for the elaboration of written products in a CSCL environment; (ii) seek relations between the identified writing strategies and the processes and phases of collaborative knowledge construction in the groups; and (iii) relate these strategies and phases with the learning results obtained by the groups. We carried out a multiple-case study, with the analysis of four different didactic sequences, in two different virtual learning and teaching settings. In each setting, three student groups were studied, where each had to collaboratively develop between four and eight written products. For all the studied groups, the analysis enabled the identification of five types of strategies in the preparation of the elaboration of written products, and four types of phases of collaborative knowledge construction, which are interrelated and also connected with the grades that the groups obtained in each case.
A Web-Based 3D System for Home Design
Authors: Anthony Chong, Ji-Hyun Lee, Jieun Park
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

Buying a home is a big investment and is one of the most important decisions made in one's life. Home owners after purchasing the apartments are interested in having their own home unique design identity. They often seek expert interior designers to assist in designing the homes and bringing out the uniqueness in them. In current interior design industry, designers have to meet the owners often to discuss the designs and alter the housing layout design accordingly to the owners' preferences. This process is often repeated many times before a finalized housing design layout will be accepted by the owners. In this paper, we propose a rule-based housing design system to generate many sets of alternatives housing design layouts based on the initial designer's housing design layout. Designers, therefore, are able to produce alternative housing designs for the owners and also able to explore various alternatives done by the rule-based design system that they have not encountered before.
Load Balancing of Parallel Block Overlapped Incomplete Cholesky Preconditioning
Authors: Igor Kaporin, Igor Konshin
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

A modification of the second order Incomplete Cholesky (IC) factorization with controllable amount of fill-in is described and analyzed. This algorithm is applied to the construction of well balanced coarse-grain parallel preconditioning for the Conjugate Gradient (CG) iterative solution of linear systems with symmetric positive definite matrix. The efficiency of the resulting parallel algorithm is illustrated by a series of numerical experiments using large-scale ill-conditioned test matrices taken from the collection of the University of Florida.
Facilitating Controlled Tests of Website Design Changes Using Aspect-Oriented Software Development and Software Product Lines
Authors: Javier Cámara, Alfred Kobsa
Venue: Transactions on Large-Scale Data- and Knowledge-Centered Systems I (2009)

Controlled online experiments in which envisaged changes to a website are first tested live with a small subset of site visitors have proven to predict the effects of these changes quite accurately. However, these experiments often require expensive infrastructure and are costly in terms of development effort. This paper advocates a systematic approach to the design and implementation of such experiments in order to overcome the aforementioned drawbacks by making use of Aspect-Oriented Software Development and Software Product Lines.
Orientation Responsive Touch Interaction
Authors: Jinwook Kim, Jong-Gil Ahn, Heedong Ko
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

A novel touch based interaction method by use of orientation information of a touch region is proposed. To capture higher dimensional information of touch including a position and an orientation as well, we develop robust algorithms to detect a contact shape and to estimate its orientation angle. Also we suggest practical guidelines to use our method through experiments considering various conditions and show possible service scenarios of aligning documents and controlling a media player.
The Access Principle: The Case for Open Access to Research and Scholarship
Authors: John Willinsky
Venue:  (2009)

An argument for extending the circulation of knowledge with new publishing technologies considers scholarly, economic, philosophical, and practical issues. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Global Requirements Engineering: Decision Support for Globally Distributed Projects
Authors: Christian Lescher
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Research Area: Decision Making in Global Requirements Engineering Research Proposal: introduce a framework for decision support in global requirements engineering, based on theories and experiences in decision making under consideration of chaordic organization
Drugs and Drug-Like Compounds: Discriminating Approved Pharmaceuticals from Screening-Library Compounds
Authors: Amanda C. Schierz, Ross D. King
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

Compounds in drug screening-libraries should resemble pharmaceuticals. To operationally test this, we analysed the compounds in terms of known drug-like filters and developed a novel machine learning method to discriminate approved pharmaceuticals from "drug-like" compounds. This method uses both structural features and molecular properties for discrimination. The method has an estimated accuracy of 91% in discriminating between the Maybridge HitFinder library and approved pharmaceuticals, and 99% between the NATDiverse collection (from Analyticon Discovery) and approved pharmaceuticals. These results show that Lipinski's Rule of 5 for oral absorption is not sufficient to describe "drug-likeness" and be the main basis of screening-library design.
Brief paper: Receding horizon control of switching systems
Authors: Young Il Lee, Basil Kouvaritakis
Venue: Automatica (Journal of IFAC) (2009)

This paper exploits the concept of periodic invariance in order to derive a novel predictive control algorithm for switched systems. The offline computation here concerns the definition of sequences of switches which return the state vector to a set after a given number of moves, while an online optimization is used to improve performance by exploiting information available on the value of the state at each time instant. The algorithm is shown to have closed loop stability and to ensure that the state is steered to a bounded set of ellipsoids centered on the target state. The results of the paper are illustrated by means of a numerical example.
Architecture for dense matrix multiplication on a high-performance reconfigurable system
Authors: Viviane L. S. de Souza, Victor W. C. de Medeiros, Manoel E. de Lima
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

The recent evolution of the programmable logic devices, such as FPGAs (Field Programmable Gate Array), associated with the growing demand for performance improvements in scientific computing applications, has attracted the attention of supercomputers vendors. They have been developing hybrid platforms that links general-purpose processors with co-processors based on FPGAs, aiming computing acceleration. In this work we present the analysis and development of an important scientific computing operation: matrix multiplication, targeting the commercial hybrid platform RASC (Reconfigurable Application-Specific Computing), developed by Silicon Graphics. The proposed architecture aims to reach better performance than conventional architectures, dissipating less power. To achieve this goal, we investigated the possibilities of implementation in parallel and data reuse intrinsic to the algorithm. Based on this investigation we propose a case study that uses the available resources in the target platform to explore these features.
Interpersonal Privacy Management in Distributed Collaboration: Situational Characteristics and Interpretive Influences
Authors: Sameer Patil, Alfred Kobsa, Ajita John, Lynne S. Brotman, Doree Seligmann
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

To understand how collaborators reconcile the often conflicting needs of awareness and privacy, we studied a large software development project in a multinational corporation involving individuals at sites in the U.S. and India. We present a theoretical framework describing privacy management practices and their determinants that emerged from field visits, interviews, and questionnaire responses. The framework identifies five relevant situational characteristics: issue(s) under consideration, physical place(s) involved in interaction(s), temporal aspects, affordances and limitations presented by technology, and nature of relationships among parties. Each actor, in turn, interprets the situation based on several simultaneous influences: self, team, work site, organization, and cultural environment. This interpretation guides privacy management action(s). Past actions form a feedback loop refining and/or reinforcing the interpretive influences. The framework suggests that effective support for privacy management will require that designers follow a socio-technical approach incorporating a wider scope of situational and interpretive differences.
Surface motion of single crystals driven by anisotropic surface diffusion
Authors: Wen Zhang
Venue: Computing and Visualization in Science (2009)

In this paper we compute a mathematical model for the evolution of single crystal with a particular kind of anisotropic surface free energies that yields equilibrium crystal shapes close to octahedrons. Employing the developed model we exhibit the entire evolution path of single crystals to equilibrium with different levels of anisotropic surface free energy. We find that with a mildly anisotropic surface free energy, the crystal morphology is smooth in evolution and evolves to a unique equilibrium crystal shape. With a severely anisotropic surface free energy, edges, corners and faceting by hill-and-valley structures on crystal surface occur. The equilibrium crystal shape reached in computation approaches the analytic octahedron Wulff shape as the anisotropy in the surface free energy becomes more severe.
A New Suggestion for Data Clustering
Authors: Sunil Bhooshan, Vinay Kumar, Gaurav Gayawar, Sah Geetansh Krishna, Kapil Sachdeva
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

This paper introduces a new method for data clustering.This method is proposed to divide data into clusters or regions. Different regions or clusters, which are used to calculate code words, have been designed by using the line of symmetry approach. This line of symmetry is rotated by a predefined angle to divide the complete data set into small clusters. These codewords are then used to represent the complete data set.The algorithm discussed is for lossy data compression.
Introducing Zones to a Web Site: A Test Based Evaluation on Semantics, Content, and Business Goals
Authors: Natascha Hoebel, Naveed Mushtaq, Clemens Schefels, Karsten Tolle, Roberto V. Zicari
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Content providers compete for the user's attention on information services offered. The placement of content within a Web site is an important factor, influencing behavior of and choices made by users.The Gugubarra project aims at understanding the interests of registered users, by evaluating their behavior and actions performed while visiting the site. For this purpose, we have introduced the concept of ``zones'', which allows segmentation of a Web page, thereby enabling us to consider the placement of information and the possible actions takenby users within these zones. This paper describes the evaluation of the use of zones and their applicability in different scenarios. Several tests were performed using one of our tools to create zones on different Web sites. The main focus is to evaluate aspects of the zoning concept and to test how zones are used in real life situation. The test results should show how the chosen semantics of topic weights influences the use of zones and topics.
Uncertainty quantification in the damage assessment of a cable-stayed bridge by means of fuzzy numbers
Authors: D. Degrauwe, G. De Roeck, G. Lombaert
Venue: Computers and Structures (2009)

Cables offer interesting possibilities in bridge design, but are rather susceptible to damage. Since damage in a cable changes its natural vibration frequency, it can be assessed with a vibration-based finite element updating procedure. However, the natural frequency of a cable is also influenced by the temperature, and the measured frequencies are prone to measurement errors. Therefore, it is useful to check the sensitivity of the identified damage with respect to these factors. This paper presents a methodology based on fuzzy numbers to investigate the propagation of measurement errors and uncertainty on the structural temperature throughout the updating procedure.
Discovering Sparse Functional Brain Networks Using Group Replicator Dynamics (GRD)
Authors: Bernard Ng, Rafeef Abugharbieh, Martin J. Mckeown
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

Functional magnetic resonance imaging (fMRI) has become increasingly used for studying functional integration of the brain. However, the large inter-subject variability in functional connectivity renders detection of representative group networks very difficult. In this paper, we propose a new iterative method that we refer to as "group replicator dynamics," for detecting sparse functional networks that are common across subjects within a group. The proposed method uses replicator dynamics, which we show to be equivalent to non-negative sparse PCA, and incorporates group information for identifying common networks across subjects with subject-specific weightings of the identified brain regions reflecting individual differences. Finding a separate network for each subject, as opposed to employing traditional averaging approaches, permits statistical testing of group significance. We validated our method on synthetic data, and applying it to real fMRI data detected task-specific group networks that conform well with prior neuroscience knowledge.
Cortical Correspondence with Probabilistic Fiber Connectivity
Authors: Ipek Oguz, Marc Niethammer, Josh Cates, Ross Whitaker, Thomas Fletcher, Clement Vachet, Martin Styner
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

This paper presents a novel method of optimizing point-based correspondence among populations of human cortical surfaces by combining structural cues with probabilistic connectivity maps. The proposed method establishes a tradeoff between an even sampling of the cortical surfaces (a low surface entropy) and the similarity of corresponding points across the population (a low ensemble entropy). The similarity metric, however, isn't constrained to be just spatial proximity, but uses local sulcal depth measurements as well as probabilistic connectivity maps, computed from DWI scans via a stochastic tractography algorithm, to enhance the correspondence definition. We propose a novel method for projecting this fiber connectivity information on the cortical surface, using a surface evolution technique. Our cortical correspondence method does not require a spherical parameterization. Experimental results are presented, showing improved correspondence quality demonstrated by a cortical thickness analysis, as compared to correspondence methods using spatial metrics as the sole correspondence criterion.
Algebraic Programming with Magma II: An Introduction to the Magma Categories, 1st edition
Authors: John Cannon, Catherine Playoust, Wieb Bosma
Venue:  (2009)

This book, written in two volumes, is an introductory manual for Magma, a programming language designed for the investigation of algebraic, geometric and combinatorial structures, or "magmas". It presumes no knowledge of computer programming, and its examples are chosen to illustrate language and algorithmic features as simply as possible. Magma is a sophisticated tool for experimentation, education, and computer-aided proof, useful for both students and professional mathematicians. Volume I explains the language and user environment in detail, whereas Volume II deals with the major algebraic, geometrical and combinatorial structures implemented in the system.
Exhaustive Greedy Algorithm for Optimizing Intermediate Result Sizes of Join Queries
Authors: Areerat Trongratsameethong, Jarernsri L. Mitrpanont
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

The size of the intermediate results produced while executing queries has a direct impact on query optimizers. Larger size of intermediate results requires more memory usage and more computational power to evaluate their join predicates. Furthermore, if memory size is not big enough, secondary storage will be needed. This paper proposes the Exhaustive Greedy (EG) algorithm to optimize the intermediate result sizes of join queries. Exhaustive search and greedy algorithm are combined and modified to identify good join orders. Based on the similar concept of the Greedy Operator Ordering (GOO) algorithm, in order to determine join order selection at subsequent steps, our algorithm also updates join graphs to reflect new size of join nodes and new join selectivities of edges associated with the join nodes at each step. Experiments are conducted and the results reveal that the EG algorithm determines the good join orders. In addition, most intermediate result sizes of join queries estimated by the EG algorithm are comparable to the results estimated by the Exhaustive Search algorithm that is modified to update join graphs, we name it ESU algorithm.