ppxscal/embedding_network huggingface dataset:
Digital Holography Microscopy applications: Three Dimensional Object Analysis and Tracking
Authors: Cedric Schockaert
Venue:  (2009)

This book describes general and robust algorithms that are devoted to automate the analysis process in the 3D space and in time of dynamic objects present in a volume studied by a specific microscope that permits to record images containing their 3D information. This imaging system using a coherent light records not only the intensity information of the light, but also the direction of propagation for each pixel in the image. Together with a numerical model for coherent light diffraction, it is possible to generate numerically other images parallel to the recorded plane and as a consequence to refocus numerically objects. The acquisition time of 3D data is as a consequence only limited by the acquisition rate of the CCD camera of in the imaging system. The extraction of 3D information is performed by algorithm applied on the recorded data. The studied objects are either of biological nature or latex particles. A focus criterion to determine the best focus plane of an object is proposed. From the knowledge of the 3D position of objects, several analyses are proposed like shape or object trajectories analysis in time and in 3D. 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
Revisualizing Visualization
Authors: Gary Singh
Venue: IEEE Computer Graphics and Applications (2009)

This installment looks at simulation visualization's created by UC Davis researcher Kwan-Liu Ma's team.
A model for human readable instruction generation using level-based discourse planning and dynamic inference of attributes disambiguation
Authors: Daniel Dionne, Salvador de la Puente, Carlos León, Raquel Hervás, Pablo Gervás
Venue: Proceedings of the 12th European Workshop on Natural Language Generation (2009)

This paper shows a model of automatic instruction giving for guiding human users in virtual 3D environments. A multilevel model for choosing what instruction to give in every state is presented, and so are the different modules that compose the whole generation system. How 3D information in the virtual world is used is explained, and the final order generation is detailed. This model has been implemented as a solution for the GIVE Challenge, an instruction generation challenge.
Improved Quantification of Bone Remodelling by Utilizing Fuzzy Based Segmentation
Authors: Joakim Lindblad, Nataša Sladoje, Vladimir Ćurić, Hamid Sarve, Carina B. Johansson, Gunilla Borgefors
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

We present a novel fuzzy theory based method for the segmentation of images required in histomorphometrical investigations of bone implant integration. The suggested method combines discriminant analysis classification controlled by an introduced uncertainty measure, and fuzzy connectedness segmentation method, so that the former is used for automatic seeding of the later. A thorough evaluation of the proposed segmentation method is performed. Comparison with previously published automatically obtained measurements, as well as with manually obtained ones, is presented. The proposed method improves the segmentation and, consequently, the accuracy of the automatic measurements, while keeping advantages with respect to the manual ones, by being fast, repeatable, and objective.
The regularized EM algorithm
Authors: Haifeng Li, Keshu Zhang, Tao Jiang
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

The EM algorithm heavily relies on the interpretation of observations as incomplete data but it does not have any control on the uncertainty of missing data. To effectively reduce the uncertainty of missing data, we present a regularized EM algorithm that penalizes the likelihood with the mutual information between the missing data and the incomplete data (or the conditional entropy of the missing data given the observations). The proposed method maintains the advantage of the conventional EM algorithm, such as reliable global convergence, low cost per iteration, economy of storage, and ease of programming. We also apply the regularized EM algorithm to fit the finite mixture model. Our theoretical analysis and experiments show that the new method can efficiently fit the models and effectively simplify over-complicated models.
Executing medical guidelines on the web: Towards next generation healthcare
Authors: Mercedes Argüello Casteleiro, Julio Des, Maria Jesus Fernandez Prieto, Rogelio Perez, Hilary Paniagua
Venue: Knowledge-Based Systems (2009)

There is still a lack of full integration between current Electronic Health Records (EHRs) and medical guidelines that encapsulate evidence-based medicine. Thus, general practitioners (GPs) and specialised physicians still have to read document-based medical guidelines and decide among various options for managing common non-life-threatening conditions where the selection of the most appropriate therapeutic option for each individual patient can be a difficult task. This paper presents a simulation framework and computational test-bed, called V.A.F. Framework, for supporting simulations of clinical situations that boosted the integration between Health Level Seven (HL7) and Semantic Web technologies (OWL, SWRL, and OWL-S) to achieve content layer interoperability between online clinical cases and medical guidelines, and therefore, it proves that higher integration between EHRs and evidence-based medicine can be accomplished which could lead to a next generation of healthcare systems that provide more support to physicians and increase patients' safety.
Forward Secure ID-Based Group Key Agreement Protocol with Anonymity
Authors: Hyewon Park, Zeen Kim, Kwangjo Kim
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

ID-based group key agreement (GKA) has been increasingly researched with the advantage of simple public key management. However, identities of group members can be exposed in the ID-based GKA protocol, so eavesdroppers can easily learn who belongs to the specific group. Recently, Wan et al. proposed a solution for this problem, an anonymous ID-based GKA protocol, which can keep group members’ anonymity to outside eavesdroppers; nevertheless, the protocol has some security flaws. This paper shows that Wan et al.’s GKA is insecure against colluding attack and their joining/leaving protocols do not guarantee forward and backward secrecy. We also propose a new forward secure ID-based GKA with anonymity from enhancing Wan et al.’s joining/leaving protocols. Our scheme provides forward and backward secrecy and is essentially just efficient as Wan et al.’s scheme.
Context-Aware Routing for Peer-to-Peer Network on MANETs
Authors: Nadir Shah, Depei Qian
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Peer-to-peer (P2P) network is a decentralized and self organized architecture for the sharing of resources such as files. P2P network on wired network (Internet) has been extensively studied. The advancement in the wireless and mobile technology has lead to the deployment of the P2P filesharing on mobile ad hoc networks (MANETs). The direct deployment of wired P2P network would result in poor performance for mobile ad hoc networks due to node mobility which causes link failure. In this paper we propose an approach based on route lifetime for P2P network on mobile ad hoc networks. With this approach the file is retrieved on the route of maximum lifetime, the more stable one, instead of the shortest (first acquired path) one, as used in current P2P network. This would reduce the link failure, and thus can decrease routing overhead and end-to-end delay, and increase the file delivery ratio. The route lifetime is determined by the context information, such as velocity and inter-node distance. Simulation results show that our approach incomparison with the ORION performs better in term of file delivery ratio, routing overhead and average end-to-end delay.
Algorithm of Pencil-Cut Tool Path Generation for Five-Axis NC Machining of Complex Polyhedron
Authors: Wanjun Li, Dongbiao Zhao, Min Niu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

In this paper, a new method is proposed to detect clean-up regions and generate pencil-cut tool paths for machining complex polyhedron. The pencil-cutting is to remove the uncut volumes left at the regions that a larger cutter cannot machine during finishing process. In this paper, the surface is discrete by a series of quadrilateral grids. The method is used to gain the normal vector and the angle of two normal vector of adjacent surface to detect uncut regions. A technique of grids-scan is presented to overcome the limitation to judge the existing of the jerk points. A method of Reverse-calculate is used to gain the machining regions, which is fast and simple to identify the pencil-cut regions. A technique of the offset angle-bisector generates pencil-cut tool path accurately and availably that improves the machining efficiency of the complex surface. The simulation proves that the method is valid. The proposed techniques can be used in the CAD/CAM systems to generate pencil-cut paths for machining complex polyhedral models.
Flexibility as a Service
Authors: W. M. Aalst, M. Adams, A. H. Hofstede, M. Pesic, H. Schonenberg
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

The lack of flexibility is often seen as an inhibitor for the successful application of workflow technology. Many researchers have proposed different ways of addressing this problem and some of these ideas have been implemented in commercial systems. However, a "one size fits all" approach is likely to fail because, depending on the situation (i.e., characteristics of processes and people involved), different types of flexibility are needed. In fact within a single process/organisation varying degrees of flexibility may be required, e.g., the front-office part of the process may require more flexibility while the back-office part requires more control. This triggers the question whether different styles of flexibility can be mixed and integrated into one system. This paper proposes the Flexibility as a Service (FAAS) approach which is inspired by the Service Oriented Architecture (SOA) and our taxonomy of flexibility. Activities in the process are linked to services. Different services may implement the corresponding activities using different workflow languages. This way different styles of modelling may be mixed and nested in any way appropriate. This paper demonstrates the FAAS approach using the Yawl, Declare, and Worklet services.
Genetic Structure of the Hatchery and Wild Scylla Paramamosain Populations Using RAPD and AFLP Techniques
Authors: Qi Ling, Shaojing Li, Zhongbao Li
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The genetic diversity between 3 wild and 3 hatchery Scylla paramamosain populations were tested by RAPD and AFLP techniques. The results from RAPD technique showed that there was a decline in the mean effective number of alleles per locus, Nei’s gene diversity, the Shannon’s information index and the percentage of polymorphic loci, they ranged from 1.3966 to 1.2693, from 0.1598 to 0.1516, from 0.2083 to 0.2011 and from 41.56% to 40.32%, respectively. Compared with the wild populations, the hatchery population from AFLP technique also showed that there was a reduction in the mean effective number of alleles per locus, Nei’s gene diversity, the Shannon’s information index and the percentage of polymorphic loci, they ranged from 1.3966 to 1.2693, from 0.1598 to 0.1516, from 0.2083 to 0.2011 and from 41.56% to 40.32%, respectively. This showed a reduced genetic diversity in hatchery populations compared with the wild populations
Algorithmic Adventures: From Knowledge to Magic, 1st edition
Authors: Juraj Hromkovic
Venue:  (2009)

There is a considerable, satisfying and underappreciated depth in the science of computing, it offers so much more than simply a driving licence for using a computer. The author of this book is a top researcher working on the fundamentals of informatics, and he has considerable experience teaching complex subjects in a simple manner. In this book he invites the reader to explore the science of computing, convinced that a good explanation of even the most basic techniques can demonstrate the power and magic of the underlying principles. The author starts with the development of computer science, algorithms and programming, and then explains and shows how to exploit the concepts of infinity, computability, computational complexity, nondeterminism and randomness. Finally, he offers some insight into emerging computing paradigms such as biological computing and quantum computing. This book is a fascinating read for students of all levels, and for those curious to learn about the science and magic of algorithmics and its role in other scientific disciplines.
Design for Smart Driving: A Tale of Two Interfaces
Authors: Mark S. Young, Stewart A. Birrell, Neville A. Stanton
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

The environmental and financial costs of road transport are a key issue for governments, car manufacturers and consumers. Alongside these issues remain longstanding concerns about road safety. The `Foot-LITE' project is aimed at designing a `smart' driving advisor to improve safe and eco-driving behaviours. This paper presents part of the human-centred design process to devise an in-car human-machine interface which will facilitate the desired behaviours while avoiding negative consequences of distraction. Two rapid prototyping studies are presented, and the results of feedback from potential users as well as subject matter experts are discussed with respect to implications for the future interface design.
Layer-by-Layer Unfolding of the Tacit Meta Knowledge is the Soul of the Project Curriculum
Authors: Xuan Zhongliang, Wu Caiyan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Guided by the preset tasks, following the five pragmatic thoughts of "What to do", "Why do it", "How to do it", "Why do it that way", and finally "How to do it better" to unfold a project course step by step or in iteration so that the course is presented in a hierarchical, consistent, and flexible way is the soul of the project curriculum. More Concretely, the soul of the project course is layer-by-layer unfolding of the tacit meta knowledge with each specific step of "how to do it" and the approach selected for that step as the logical main line and putting the procedural knowledge as the guide of verbal knowledge
Optimal Parameter Estimation with Homogeneous Entities and Arbitrary Constraints
Authors: Jochen Meidow, Wolfgang Förstner, Christian Beder
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

Well known estimation techniques in computational geometry usually deal only with single geometric entities as unknown parameters and do not account for constrained observations within the estimation.The estimation model proposed in this paper is much more general, as it can handle multiple homogeneous vectors as well as multiple constraints. Furthermore, it allows the consistent handling of arbitrary covariance matrices for the observed and the estimated entities. The major novelty is the proper handling of singular observation covariance matrices made possible by additional constraints within the estimation. These properties are of special interest for instance in the calculus of algebraic projective geometry, where singular covariance matrices arise naturally from the non-minimal parameterizations of the entities.The validity of the proposed adjustment model will be demonstrated by the estimation of a fundamental matrix from synthetic data and compared to heteroscedastic regression [1], which is considered as state-of-the-art estimator for this task. As the latter is unable to simultaneously estimate multiple entities, we will also demonstrate the usefulness and the feasibility of our approach by the constrained estimation of three vanishing points from observed uncertain image line segments.
Moments and sums of squares for polynomial optimization and related problems
Authors: Jean B. Lasserre
Venue: Journal of Global Optimization (2009)

We briefly review the duality between moment problems and sums of squares (s.o.s.) representations of positive polynomials, and compare s.o.s. versus nonnegative polynomials. We then describe how to use such results to define convergent semidefinite programming relaxations in polynomial optimization as well as for the two related problems of computing the convex envelope of a rational function and finding all zeros of a system of polynomial equations.
A descriptive model of information problem solving while using internet
Authors: Saskia Brand-Gruwel, Iwan Wopereis, Amber Walraven
Venue: Computers Education (2009)

This paper presents the IPS-I-model: a model that describes the process of information problem solving (IPS) in which the Internet (I) is used to search information. The IPS-I-model is based on three studies, in which students in secondary and (post) higher education were asked to solve information problems, while thinking aloud. In-depth analyses of the thinking-aloud protocols revealed that the IPS-process consists of five constituent skills: (a) defining information problem, (b) searching information, (c) scanning information, (d) processing information, and (e) organizing and presenting information. Further, the studies revealed that regulation skills prove to be crucial for the on-going IPS-process. The IPS-I-model depicts the constituent skills, regulation skills, and important conditional skills. The model gives an initial impetus for designing IPS-instruction.
Selecting Locations for Follow-the-Sun Software Development: Towards a Routing Model
Authors: Christian Visser, Rini van Solingen
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Deciding where to establish development locations is a strategic decision in the field of Follow-the-Sun software development. Our research has focussed on two factors: a. the optimal time zone difference between locations, and b. the natural ease of communication. The former depends on the required transfer time for handing over work from one location to the other. The latter involves communication aspects such as language. The objective is to construct a routing model, which calculates (sub)optimal deployment routes. The routing model consists of an algorithm that calculates sequences of locations from a dataset containing demographic data about these locations. The possible sequences are prioritized based on a set of parameters. The routing model has been implemented in a website. The website can be used to validate the routing model, but moreover can be used as a first support when considering potential locations for Follow-the-Sun software development.
(α, k)-anonymous data publishing
Authors: Raymond Wong, Jiuyong Li, Ada Fu, Ke Wang
Venue: Journal of Intelligent Information Systems (2009)

Privacy preservation is an important issue in the release of data for mining purposes. The k-anonymity model has been introduced for protecting individual identification. Recent studies show that a more sophisticated model is necessary to protect the association of individuals to sensitive information. In this paper, we propose an (&alpha;, k)-anonymity model to protect both identifications and relationships to sensitive information in data. We discuss the properties of (&alpha;, k)-anonymity model. We prove that the optimal (&alpha;, k)-anonymity problem is NP-hard. We first present an optimal global-recoding method for the (&alpha;, k)-anonymity problem. Next we propose two scalable local-recoding algorithms which are both more scalable and result in less data distortion. The effectiveness and efficiency are shown by experiments. We also describe how the model can be extended to more general cases.
A kernelized fuzzy c-means algorithm for automatic magnetic resonance image segmentation
Authors: E. A. Zanaty, Sultan Aljahdali, Narayan Debnath
Venue: Journal of Computational Methods in Sciences and Engineering (2009)

In this paper, we present alternative Kernelized FCM algorithms (KFCM) that could improve magnetic resonance imaging (MRI) segmentation. Then we implement the proposed KFCM method with considering some spatial constraints on the objective function. The algorithms incorporate spatial information into the membership function and the validity procedure for clustering. We use the intra-cluster distance measure, which is simply the median distance between a point and its cluster centre. The number of the cluster increases automatically according the value of intra-cluster, for example when a cluster is obtained, it uses this cluster to evaluate intra-cluster of the next cluster as input to the KFCM and so on, stop only when intra-cluster is smaller than a prescribe value. The most important aspect of the proposed algorithms is actually to work automatically. Alterative is to improve automatic image segmentation. These methods are applied on two different sets: reference images, for objective evaluation based on estimation of segmentation accuracy and time, and non reference images, for objective evaluation based on combined judgment of opinions of specialists.
Exploiting ASP in Real-World Applications: Main Strengths and Challenges
Authors: Nicola Leone
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We have recently started a couple of spin-off companies which aim at exploiting ASP, and the DLV system in particular, in real-world applications. We briefly report on the first experiences, evidentiating the positive aspects of ASP which allowed us to develop some successful applications, and some obstacles which should be overcome to improve ASP systems, and make them best suited for industry-level applications.
Joint versus independent phonological feature models within CRF phone recognition
Authors: Ilana Bromberg, Jeremy Morris, Eric Fosler-Lussier
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

We compare the effect of joint modeling of phonological features to independent feature detectors in a Conditional Random Fields framework. Joint modeling of features is achieved by deriving phonological feature posteriors from the posterior probabilities of the phonemes. We find that joint modeling provides superior performance to the independent models on the TIMIT phone recognition task. We explore the effects of varying relationships between phonological features, and suggest that in an ASR system, phonological features should be handled as correlated, rather than independent.