ppxscal/embedding_network huggingface dataset:
3D TEE Registration with X-Ray Fluoroscopy for Interventional Cardiac Applications
Authors: Ameet Jain, Luis Gutierrez, Douglas Stanton
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

Live 3D trans-esophageal echocardiography (TEE) and X-ray fluoroscopy provide complementary imaging information for guiding minimally invasive cardiac interventions. X-ray fluoroscopy is most commonly used for these procedures due to its excellent device visualization. However, its challenges include the 2D projection nature of the images and poor soft tissue contrast, both of which are addressed by the use of live 3D TEE imaging. We propose to integrate 3D TEE imaging with X-ray fluoroscopy, providing the capability to co-visualize both the interventional devices and cardiac anatomy, by accurately registering the images using an electro-magnetic tracking system. Phantom trials validating the proposed registration scheme indicate an average accuracy of 2.04 mm with a standard deviation of 0.59 mm. In the future, this system may benefit the guidance and navigation of interventional cardiac procedures such as mitral valve repair or patent foramen ovale closure.
A Binomial Model of Group Probability Judgments
Authors: Daniel E. O'Leary
Venue: Proceeding of the 2008 conference on Collaborative Decision Making: Perspectives and Challenges (2008)

Research in psychology has found that subjects regularly exhibit a conjunction fallacy in probability judgment. Additional research has led to the finding of other fallacies in probability judgment, including disjunction and conditional fallacies. Such analyses of judgments are critical because of the substantial amount of probability judgment done in business and organizational settings. However, previous research has been conducted in the environment of a single decision maker. Since business and other organizational environments also employ groups, it is important to determine the impact of groups on such cognitive fallacies. This paper finds that groups substantially mitigate the impact of probability judgment fallacies among the sample of subjects investigated. A statistical analysis, based on a binomial distribution, suggests that groups investigated here did not use consensus. Instead, if any one member of the group has correct knowledge about the probability relationships, then the group uses that knowledge and does not exhibit fallacy in probability judgment. These results suggest that at least for this setting, groups have a willingness to collaborate and share and use knowledge from the group.
Microsoft Office 12
Authors: R. Pasewark
Venue:  (2007)

This text includes features that make learning easy and enjoyable - yet - challenging for learners. The text includes a wide range of learning experiences from activities with one or two commands to simulations and case studies that challenge and sharpen learners' problem-solving skills. 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
Use of aggregation pheromone density for image segmentation
Authors: Susmita Ghosh, Megha Kothari, Anindya Halder, Ashish Ghosh
Venue: Pattern Recognition Letters (2009)

Ants, bees and other social insects deposit pheromone (a type of chemical) in order to communicate between the members of their community. Pheromone that causes clumping or clustering behavior in a species and brings individuals into a closer proximity, is called aggregation pheromone. This paper presents a novel method for image segmentation considering the aggregation behavior of ants. Image segmentation is viewed as a clustering problem which aims to partition a given set of pixels into a number of homogenous clusters/segments. At each location of a data point, representing a pixel, an ant is placed; and the ants are allowed to move in the search space to find out positions with higher pheromone density. The movement of an ant is governed by the amount of pheromone deposited at different positions of the search space. More the deposited pheromone, more is the aggregation of ants. This leads to the formation of homogenous groups of data. The proposed algorithm is evaluated on a number of different types of images using various cluster validity measures. Results are compared with those obtained using k-means and mean shift clustering algorithms and are found to be superior.
Generating Synthetic Syndromic-Surveillance Data for Evaluating Visual-Analytics Techniques
Authors: Ross Maciejewski, Ryan Hafen, Stephen Rudolph, George Tebbetts, William S. Cleveland, Shaun J. Grannis, David S. Ebert
Venue: IEEE Computer Graphics and Applications (2009)

This system generates synthetic syndromic-surveillance data for evaluating visualization and visual-analytics techniques. Modeling data from emergency room departments, the system generates two years of patient data, into which system users can inject spatiotemporal disease outbreak signals. The result is a data set with known seasonal trends and irregular outbreak patterns.
An analysis of incubation effects in problem solving using a computer-administered assessment tool
Authors: Ronald Zellner
Venue:  (2008)

An insightful solution to a problem may be promoted by temporarily being away from the problem at hand and engaging in other tasks or problems. Wallas (1926) conceptualized such an interruption period between problem solving activities as an incubation period. The present study examines the effect of such activities that are provided as an incubation period in computer-based problem solving tasks. In addition, this study explores the potential interaction between the type of problems and the type of interruption tasks involving two types of problems (verbal and spatial) and two types of interruption activities (verbal and spatial). One hundred eighty five undergraduate volunteers participated. The participants were randomly assigned to one of the six conditions, Spatial Problems: No-Interruption Task, Spatial Problems: Verbal Interruption Task, Spatial Problems: Spatial Interruption Task, Verbal Problems (Anagrams): No-Interruption Task, Verbal Problems (Anagrams): Verbal Interruption Task, and Verbal Problems (Anagrams): Spatial Interruption Task. A computerized technique was developed and incorporated for data collection and material presentation. This technique was considered to have advantages over the conventional data collection format because of its ability to (1) standardize the presentation and assessment of problem solving tasks, (2) allow subjects to manipulate the problem components as they desire, simulating real world problem solving approaches, and (3) monitor the subjects&rsquo; on-going interactions through the use of intricate, covert, data collection techniques. Regression analyses were employed to analyze the data collected using this computerized technique. The findings from the present study partially support the view that problem solvers can benefit from a temporary interruption task in a problem solving sequence. The participants resolved the problems more quickly when distracted by an intervening simple cognitive task than when allowed to work continuously. It was implied that a problem solver could benefit from an interruption that involves stimuli changing visually and spatially and that also demands some degree of cognitive involvement. Although the present study did not demonstrate effects of interaction between the problem types and interruption types, the findings suggested that in the case of spatial problems, engaging in an incubation activity is likely to result in more efficient performance.
OntOWLClean: Cleaning OWL ontologies with OWL
Authors: Chris Welty
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

OWL is now very widely used for ontology development and several attempts have been made at incorporating OntoClean analysis into an OWL-based tool. I present here an OWL ontology representing the basic OntoClean distinctions, and a tool and methodology for applying it to OWL ontologies. I briefly touch on the semantic issues implied by using OWL Full syntax to characterize the OntoClean meta-properties as properties of OWL Classes, and how that was solved to employ an off-the-shelf OWL DL reasoner to check the OntoClean constraints on the taxonomy.
Unlexicalised hidden variable models of split dependency grammars
Authors: Gabriele Antonio Musillo, Paola Merlo
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

This paper investigates transforms of split dependency grammars into unlexicalised context-free grammars annotated with hidden symbols. Our best unlexicalised grammar achieves an accuracy of 88% on the Penn Treebank data set, that represents a 50% reduction in error over previously published results on unlexicalised dependency parsing.
Team competition
Authors: Pingzhong Tang, Yoav Shoham, Fangzhen Lin
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

In a team competition, two participating teams have an equal number of players, and each team orders its players linearly based on their strengths. A mechanism then specifies how the players from the two teams are matched up and how to score them. There are two types of manipulations by a team: Misreporting the strength ordering and deliberately losing a match. To identify these strategically behaviors, we model the team competition problem in a game-theoretical framework, under which we prove necessary and sufficient conditions which ensure that truthful reporting and maximal effort in matches are equilibrium strategies, and which further ensure certain fairness conditions described by choice functions.
Data protection for land consolidation with distortion tolerable LSB watermarking
Authors: Li Li, Chao Zhang, Mingxin Liang, Daoliang Li
Venue: WSEAS Transactions on Information Science and Applications (2009)

With the rapid growth of Internet technology, data security protection has become an important issue. As a tool for improving the effectiveness of land cultivation, land consolidation plays an important role in enlarging farming plots and enhancing crop productivity. To fulfill land consolidation, more and more remote sensing images are widely used. This paper presents a LSB watermarking algorithm to protect the images data security. In the proposed scheme, the land reorganization planning map is embedded into a remote sensing image of the same area for information security and copyright protection. Before being embedded, the land reorganization planning map is compressively encoded. The contradiction between large information quantity and invisibility of digital water marking is perfectly eliminated. To avoid the shortcoming of being easily attacked in the original LSB method, the host image is preprocessed by exclusive-OR (XOR) operation. That is, the value of the least significant bit is decided by the XOR result of the first several bits. The watermark signal is embedded into the LSB of the processed host image by XOR operation. Moreover, by applying an optimal adjustment process, the watermarked image has the ability of distortion tolerance. The experimental results fully illustrate that the embedded watermark is not only imperceptible to the human eyes, but also has better security in the statistical sense. Moreover, the proposed scheme is superior in terms of its distortion tolerance.
Efficient type-ahead search on relational data: a TASTIER approach
Authors: Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have limited knowledge about the data, and have to use a try-and-see approach for modifying queries and finding answers. In this paper we propose a novel approach to keyword search in the relational world, called Tastier. A Tastier system can bring instant gratification to users by supporting type-ahead search, which finds answers "on the fly" as the user types in query keywords. A main challenge is how to achieve a high interactive speed for large amounts of data in multiple tables, so that a query can be answered efficiently within milliseconds. We propose efficient index structures and algorithms for finding relevant answers on-the-fly by joining tuples in the database. We devise a partition-based method to improve query performance by grouping highly relevant tuples and pruning irrelevant tuples efficiently. We also develop a technique to answer a query efficiently by predicting the highly relevant complete queries for the user. We have conducted a thorough experimental evaluation of the proposed techniques on real data sets to demonstrate the efficiency and practicality of this new search paradigm.
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
Authors: Hatice Calık, Sibel A. Alumur, Bahar Y. Kara, Oya E. Karasan
Venue: Computers and Operations Research (2009)

Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over incomplete hub networks and propose an integer programming formulation to this end. The aim of our model is to find the location of hubs, the hub links to be established between the located hubs, and the allocation of non-hub nodes to the located hub nodes such that the travel time between any origin-destination pair is within a given time bound. We present an efficient heuristic based on tabu search and test the performance of our heuristic on the CAB data set and on the Turkish network.
Teachers' Challenges with Constructivist Practices in a Technology-Rich Environment
Authors: Carmen Sicilia
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

This multi-case study investigates the challenges of constructivist teaching practices in a technological-rich secondary school. Challenges can be separated into two categories a) perceived-challenges which are declared by the teachers, namely they include: professional development, time, and technical support, and b) concealed challenges, which include: classroom management and change management. The Activity Theory perspective is used to analyze the problem.
Toward cinematizing our daily lives
Authors: Hansung Kim, Ryuuki Sakamoto, Itaru Kitahara, Tomoji Toriyama, Kiyoshi Kogure
Venue: Multimedia Tools and Applications (2009)

We introduce a cinematographic video production system to create movie-like attractive footage from our indoor daily life. Since the system is designed for ordinary users in non-studio environments, it is composed of standard hardware components, provides a simple interface, and works in near real-time of 5¿~¿6 frames/sec. The proposed system reconstructs a visual hull from acquired multiple videos and then generates final videos from the model by referring to the camera shots used in film-making. The proposed method utilizes "Reliability" to compensate for errors that may have occurred in non-studio environments and to produce the most natural scene from the reconstructed model. By using a virtual camera control system, even non-experts can easily convert the 3D model to movies that look as if they were created by experienced filmmakers.
Physically-coupled replication and resynthesis
Authors: John Lillis
Venue:  (2008)

In modern digital systems, performance is increasingly determined by communication delays rather than logic delays. As a result, optimizations made by traditional logic synthesis tools tend to correlate poorly with post-layout performance. One mechanism for dealing with this disconnect is to replicate and replace multiple logic gates in the design after an initial placement. Of particular interest is the approach of Hrkic et al. in which placement-level static timing analysis is performed and timing-critical fan-in trees are induced via (temporary) replication; the tree is then optimally embedded into the layout area by a dynamic programming algorithm; cell duplication and unification is done implied by the embedding result. This method is referred to as Replication Tree Embedding. We further study on this optimization problem and propose a number of techniques aimed at more fully realizing the potential of the methodology. The main technique is rectilinear Steiner arborescence embedding which is for overcoming the limitation of the reconvergence effect in the netlist. Other techniques are fanout partitioning and cell relocation which are cognizant of both wire-length and timing impact for improved solution quality. The effect of these techniques including new replication cost computation and lower-bounding of clock period are reported. The basic framework of the replication tree enables yet more general logic optimizations while retaining tight coupling with placement&mdash;we generalize the basic replication tree embedding approach so that it also performs Remapping. Timing-critical fan-in trees are reimplemented where the degrees of freedom include functional decomposition of Look-up Tables (LUTs), subject graph covering/mapping, and physical embedding. A dynamic programming algorithm optimizes over all of these freedoms simultaneously. All simple disjoint decompositions (i.e., Ashenhurst style) are encoded in the subject tree/graph using choice nodes. At the same time, because embedding is done simultaneously, interconnect delay is directly taken into account. These frameworks are implemented in Field Programmable Gate Array (FPGA) domain. In many cases they approaches a fixed flip-flop lower-bound on achievable clock period. Promising experimental results are reported with average 17.4% (up to 38.1%) clock period reduction compared with the timing-driven placement from Versatile Place and Route (VPR) and average 6.6% (up to 17.5%) reduction compared with the replication tree embedder.
Multi-modal and multi-purpose case-based reasoning in the health sciences
Authors: Mobyen Uddin Ahmed, Shahina Begum, Peter Funk, Ning Xiong
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

Case-based reasoning systems for medical application are increasingly multi-purpose systems and also multi-modal, using a variety of different methods and techniques to meet the challenges from the medical domain. In this paper, some of the recent medical case-based reasoning systems are classified according to their functionality and development properties. It shows how a particular multi-purpose and multi-modal case-based reasoning system solves these challenges. For this a medical case-based reasoning system in the domain of psychophysiology is used.
On specifying systems that connect to the physical world
Authors: Tom Maibaum
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

Any engineering method is based on the validity of some assumptions about the problem domain and about the artifacts used in any solution of an engineering problem. Engineers have learned, perhaps not perfectly, to lay bare these assumptions and to base their methods on effective use of these assumptions. Software engineers are less good at this, to the detriment of building effective methods. The paper discusses some assumptions that either are false or are not made properly explicit in methods and the detrimental effect on the relevant methods. Some ideas about dealing with these deficiencies are proposed and discussed.
More generality in efficient multiple kernel learning
Authors: Manik Varma, Bodla Rakesh Babu
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Recent advances in Multiple Kernel Learning (MKL) have positioned it as an attractive tool for tackling many supervised learning tasks. The development of efficient gradient descent based optimization schemes has made it possible to tackle large scale problems. Simultaneously, MKL based algorithms have achieved very good results on challenging real world applications. Yet, despite their successes, MKL approaches are limited in that they focus on learning a linear combination of given base kernels. In this paper, we observe that existing MKL formulations can be extended to learn general kernel combinations subject to general regularization. This can be achieved while retaining all the efficiency of existing large scale optimization algorithms. To highlight the advantages of generalized kernel learning, we tackle feature selection problems on benchmark vision and UCI databases. It is demonstrated that the proposed formulation can lead to better results not only as compared to traditional MKL but also as compared to state-of-the-art wrapper and filter methods for feature selection.
Computing branchwidth via efficient triangulations and blocks
Authors: Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
Venue: Discrete Applied Mathematics (2009)

Minimal triangulations and potential maximal cliques are the main ingredients for a number of polynomial time algorithms on different graph classes computing the treewidth of a graph. Potential maximal cliques are also the main engine of the fastest so far, exact (exponential) treewidth algorithm. Based on the recent results of Mazoit, we define the structures that can be regarded as minimal triangulations and potential maximal cliques for branchwidth: efficient triangulations and blocks. We show how blocks can be used to construct an algorithm computing the branchwidth of a graph on n vertices in time (23)^n@?n^O^(^1^).
Compatible quadrangulation by sketching
Authors: Chih-Yuan Yao, Hung-Kuo Chu, Tao Ju, Tong-Yee Lee
Venue: Computer Animation and Virtual Worlds (2009)

Mesh quadrangulation has received increasing attention in the past decade. While previous works have mostly focused on producing a high quality quad mesh of a single model, the connectivity of the quadrangulation is typically difficult to control and varies among models even with similar shapes. In this paper, we propose a novel interactive framework for quadrangulating a set of models collectively with compatible connectivity. Furthermore, we demonstrate its application to 3D mesh morphing. In our approach, the user interactively sketches a skeleton within each model, and our method automatically computes compatible base domains for all models from these skeletons, on which the models are parameterized. With this novel parameterization, it is very easy to generate a pleasing and smooth 3D morphing sequence among these compatible models. The method yields quadrangulation with comparable quality to existing approaches, but greatly simplifies compatible re-meshing among a group of topologically equivalent models, in particular characters and animals models, with direct applications in shape blending and morphing. Copyright &copy; 2009 John Wiley & Sons, Ltd. In this paper, we propose a novel interactive framework for quadrangulating a set of models collectively with compatible connectivity. Furthermore, we demonstrate its application to 3D mesh morphing. In our approach, the user interactively sketches a skeleton within each model, and our method automatically computes compatible base domains for all models from these skeletons, on which the models are parameterized.