ppxscal/embedding_network huggingface dataset:
Heart Cavity Segmentation in Ultrasound Images Based on Supervised Neural Networks
Authors: Marco Mora, Julio Leiva, Mauricio Olivares
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

This paper proposes a segmentation method of heart cavities based on neural networks. Firstly, the ultrasound image is simplified with a homogeneity measure based on the variance. Secondly, the simplified image is classified using a multilayer perceptron trained to produce an adequate generalization. Thirdly, results from classification are improved by using simple image processing techniques. The method makes it possible to detect the edges of cavities in an image sequence, selecting data for network training from a single image of the sequence. Besides, our proposal permits detection of cavity contours with techniques of a low computational cost, in a robust and accurate way, with a high degree of autonomy.
Ehipasiko: A Content-based Image Indexing and Retrieval System
Authors: Shyh Wei Teng, Kai Ming Ting
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

Presently, retrieving images from a digital library requires different retrieval techniques to those used to retrieve text documents. In this paper, we demonstrate the possibility of converting the contents of images into texts, which enables us to utilise text-base retrieval techniques for image retrieval. The potential advantages and applications of this approach are also illustrated in this paper.
Animated solid model of the lung constructed from unsynchronized MR sequential images
Authors: M. S. G. Tsuzuki, F. K. Takase, T. Gotoh, S. Kagei, A. Asakura, T. Iwasawa, T. Inoue
Venue: Computer-Aided Design (2009)

This work discusses a 4D lung reconstruction method from unsynchronized MR sequential images. The lung, differently from the heart, does not have its own muscles, turning impossible to see its real movements. The visualization of the lung in motion is an actual topic of research in medicine. CT (Computerized Tomography) can obtain spatio-temporal images of the heart by synchronizing with electrocardiographic waves. The FOV of the heart is small when compared to the lung's FOV. The lung's movement is not periodic and is susceptible to variations in the degree of respiration. Compared to CT, MR (Magnetic Resonance) imaging involves longer acquisition times and it is not possible to obtain instantaneous 3D images of the lung. For each slice, only one temporal sequence of 2D images can be obtained. However, methods using MR are preferable because they do not involve radiation. In this paper, based on unsynchronized MR images of the lung an animated B-Rep solid model of the lung is created. The 3D animation represents the lung's motion associated to one selected sequence of MR images. The proposed method can be divided in two parts. First, the lung's silhouettes moving in time are extracted by detecting the presence of a respiratory pattern on 2D spatio-temporal MR images. This approach enables us to determine the lung's silhouette for every frame, even on frames with obscure edges. The sequence of extracted lung's silhouettes are unsynchronized sagittal and coronal silhouettes. Using our algorithm it is possible to reconstruct a 3D lung starting from a silhouette of any type (coronal or sagittal) selected from any instant in time. A wire-frame model of the lung is created by composing coronal and sagittal planar silhouettes representing cross-sections. The silhouette composition is severely underconstrained. Many wire-frame models can be created from the observed sequences of silhouettes in time. Finally, a B-Rep solid model is created using a meshing algorithm. Using the B-Rep solid model the volume in time for the right and left lungs were calculated. It was possible to recognize several characteristics of the 3D real right and left lungs in the shaded model.
FileMaker Pro 10 In Depth, 1st edition
Authors: Jesse Feiler
Venue:  (2009)

Advice and techniques that you need to get the job done. Looking for ways to streamline your work so that you can focus on maximizing your time? In Depth provides specific, tested, and proven solutions to the problems you run into every daythings other books ignore or oversimplify. This is the one book that you can rely on to answer all the questions you have now and will have in the future. In Depth offers: Comprehensive coverage, with detailed solutions Breakthrough techniques and shortcuts that are unavailable elsewhere Practical, real-world examples with nothing glossed over or left out Troubleshooting help for tough problems you cant fix on your own Outstanding authors recognized worldwide for their expertise and teaching style Quick information via sidebars, tips, reminders, notes, and warnings In Depth is the only tool you need to get more done in less time! CATEGORY: Databases COVERS: FileMaker Pro
Derivative based global sensitivity measures and their link with global sensitivity indices
Authors: I. M. Sobol', S. Kucherenko
Venue: Mathematics and Computers in Simulation (2009)

A model function f(x"1,...,x"n) defined in the unit hypercube H^n with Lebesque measure dx=dx"1...dx"n is considered. If the function is square integrable, global sensitivity indices provide adequate estimates for the influence of individual factors x"i or groups of such factors. Alternative estimators that require less computer time can also be used. If the function f is differentiable, functionals depending on @?f/@?x"i have been suggested as estimators for the influence of x"i. The Morris importance measure modified by Campolongo, Cariboni and Saltelli @m* is an approximation of the functional @m"i=@!"H"^"n@?f/@?x"idx. In this paper a similar functional is studied@n"i=@!"H"^"n@?f@?x"i^2dxEvidently, @m"i@?@n"i, and @n"i@?C@m"i if @?f/@?x"i@?C. A link between @n"i and the sensitivity index S"i^t^o^t is established:S"i^t^o^t@?@n"i@p^2Dwhere D is the total variance of f(x"1,...,x"n). Thus small @n"i imply small S"i^t^o^t, and unessential factors x"i (that is x"i corresponding to a very small S"i^t^o^t) can be detected analyzing computed values @n"1,...,@n"n. However, ranking influential factors x"i using these values can give false conclusions. Generalized S"i^t^o^t and @n"i can be applied in situations where the factors x"1,...,x"n are independent random variables. If x"i is a normal random variable with variance @s"i^2, then S"i^t^o^t@?@n"i@s"i^2/D.
A local algorithm for dominating sets of quasi-unit disk graphs
Authors: Yonatan Cohen, Jaroslav Opatrny
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

A quasi-unit disk graph has been used as a realistic model of an ad-hoc or a sensor wireless network. A wireless ad-hoc network is location aware if each node knows its geographic coordinates. Some network backbones proposed for data gathering in a wireless network are based on dominating sets of the network graph. The location awareness of ad-hoc networks corresponding to unit disk graph was used in [6] to obtain a local algorithm for a dominating set of a unit disk graph. In this paper we generalize this algorithm to location aware ad-hoc networks corresponding to quasi-unit graphs. The competitive ratio of the algorithm is determined for several ranges of the parameter r of an r--quasi-unit disk graph. For each range of r the competitive ratio is shown to be a constant value. An experimental evaluation of the algorithm is also carried out, which confirms very good performance of our algorithm.
Essential Computing Skills For Working Women or Returners: Everything you need to know to use computers in the workplace
Authors: Jackie Sherman
Venue:  (2007)

For those either starting in, or returning to, the workplace and worried about their computer skills. This book can be used before making job applications so you can feel confident about computer literacy, or to keep at your desk as a reference guide. This book is for anyone either starting in, or returning to, the workplace and worried about their computer skills. It can be used: before making job applications; to feel confident you are computer literate; to prepare for any IT demands at work; to make sure you are up-to-date; and to learn about appropriate IT qualifications. At your desk, you can use it: to keep as a reference guide; to be ready for any unfamiliar task; to master a wide range of common IT activities; to work confidently with shared files; and to get yourself organised. AUTHOR BIOG: Having run workshops and courses for women returners and administrative staff over the past 8 years Jackie Sherman is very much in touch with the concerns women have about working with computers. She is well aware of the fears female learners and work returners have of being out of date. If you are one of these, there is no other book that specifically covers the issues that concern you. 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
Federated trust management for service-oriented computing
Authors: Alfred C. Weaver
Venue:  (2008)

Service-oriented computing introduces the need for trust management that enhances the security and privacy of component services across organizational boundaries without increasing human workload. In this dissertation, the issues of federating distributed and heterogeneous autonomous trust management systems for service-oriented computing are examined from four different aspects: trust establishment, representation, exchange, and enforcement. These four aspects lead to four research areas. Then four building blocks are provided for solving identified issues in four areas. The building block for trust establishment is in charge of building and monitoring direct and indirect trust relationships with privacy protection; the building block for trust representation includes a mechanism to handle uncertainty in trust information from indirect information and subjective judgment; the building block for trust exchange uses a hybrid method to permit interoperation of various types of trust information; the building block for trust enforcement provides a translation approach to bridge the gap between high level policies and low level enforcement mechanisms. Then these four building blocks are incorporated into a unified approach for federated trust management for service-oriented architectures. Meanwhile, because the literature provides little guidance regarding evaluation methodology for trust management systems, a new evaluation framework, including a set of requirements and evaluation metrics, is also provided.
Knowledge Modelling Using UML Profile for Knowledge-Based Systems Development
Authors: Mohd Syazwan Abdullah, Richard Paige, Ian Benest, Chris Kimble
Venue: Proceeding of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies (2007)

Knowledge modelling techniques are widely adopted for designing knowledge-based systems (KBS) used for managing knowledge. This chapter discusses conceptual modelling of KBS in the context of model-driven engineering using standardised conceptual modeling language. An extension to the Unified Modeling Language (UML) for knowledge modelling is presented based on the profiling extension mechanism of UML. The UML profile discussed in this chapter has been successfully captured in a Meta-Object-Facility (MOF) based UML tool --the eXecutable Modelling Framework (XMF) Mosaic. The Ulcer Clinical Practical Guidelines (CPG) Recommendations case study demonstrates the use of the profile, with the prototype system implemented in the Java Expert System Shell (JESS).
Satisfiability and relevance for queries over active documents
Authors: Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

ManyWeb applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems [22] or when monitoring distributed autonomous systems [6]. This is a challenging problem that has generated recently a lot of attention; see Web 2.0 [38]. For capturing interactions between Web components, we use active documents interacting with the rest of the world via streams of updates. Their input streams specify updates to the document (in the spirit of RSS feeds), whereas their output streams are defined by queries on the document. In most of the paper, the focus is on input streams where the updates are only insertions, although we do consider also deletions. We introduce and study two fundamental concepts in this setting, namely, satisfiability and relevance. Some fact is satisfiable for an active document and a query if it has a chance to be in the result of the query in some future state. Given an active document and a query, a call in the document is relevant if the data brought by this call has a chance to impact the answer to the query. We analyze the complexity of computing satisfiability in our core model (insertions only) and for extensions (e.g., with deletions). We also analyze the complexity of computing relevance in the core model.
Multimodal interface within a simulator of service robotic applications
Authors: Enzo Mumolo, Massimiliano Nolich, Gianni Vercelli
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

The use of a multimodal interfaces for human-robot communication is an open issue, with a true market in service robotic applications. This paper describes a service robotic simulator which uses a multimodal interface (audio-video, speech-prosodic communication based) that demonstrates the usefulness of integrating many "modes" of interaction. A typical service robotic architecture is multi-layered: cognitive, deliberative, reactive layers are the most referred terms in literature. The design of each level requires an accurate testing methodology; the system development is thus accelerated and simplified using a simulator. The paradigm we take into account consists of robots and human operators continuously linked to a supervising centre. The operator's natural mode of communication is dialogue-based: so far the system we propose uses a prosody-based visuo-dialogical interface with the robot by means of keywords and prosody extracted from spoken commands. The simulator is based on this paradigm and allows to interact by means of conversational and visual interfaces. The former is composed by: speech recognition, prosody detection, keyword extraction, text to speech conversion; the latter by a visual interface and VRML 3D visualization.
The possibility of standardising blood pressure measurement
Authors: Radu Leca, Voicu Groza
Venue: International Journal of Advanced Media and Communication (2009)

Annus Mirabilis 1905 was marked by fundamental changes in the physics theory which took the attention of the elite of the scientific world, while Dr. Korotkov devised his noninvasive method for measuring blood pressure. More than a century later, his method is still present both in routine medical praxis and as a gold standard to certifying new blood pressure monitors. We comment on this question to show that we still do not have the necessary means for even discussing the issue and that, in the business of modern medicine, this issue is the proverbial butterfly behind the chaos in healthcare. This is an expanded version of a paper presented at the 3rd IEEE International Workshop on Medical Measurements and Applications, 9 10 May 2008, Ottawa, ON, Canada.
An optimum solution for telemetry of distributed wells in South of Tehran
Authors: Esmail Fathi Loshani, Maryam Sharifkhani
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

Some distributed wells located in south of Tehran planned to be controlled locally and also from control center. One safe control method is designed for each well by means of PLCs. For overall process purposes one main controller designed for control center and wells data are logged in a server. Two operators can control and monitor wells from control center by means of two operating station. Communication backbone to exchange data between wells and control center is studied. Offline dial up solution using polling and interrupting method is chosen for this purpose. The most important part of our design is software layers and interfaces used for easy and optimum communication.
Efficient routing in wireless ad hoc networks
Authors: John H. Hartman
Venue:  (2008)

Routing is the fundamental problem for Wireless Ad hoc networks, including Wireless Mobile Ad hoc networks (MANETs) and Wireless Sensor networks (WSNs). Although the problem has been extensively studied in the past decade, the existing solutions have deficiencies in one or more aspects including efficiency, scalability, robustness, complexity, etc. This dissertation proposes several new solutions for routing in WSNs and MANETs. Spiral is a data&ndash;centric routing algorithm for short&ndash;term communication in unstructured static WSNs. Spiral is a biased walk that visits nodes near the source before more distant nodes. This results in a spiral&ndash;like search path that is not only more likely to find a closer copy of the desired data than random walk, but is also able to compute a shorter route because the network around the source is more thoroughly explored. Compared with existing flooding and random walk approaches, Spiral has a lower search cost than flooding and returns better routes than random walk. Closest Neighbor First Search (CNFS) is a query processing algorithm for mobile wireless sensor networks. It is also walk-based and biased to visit nodes close to the source first. Different from Spiral, CNFS collects topology information as the search progresses. The topology information is used to compute the shortest return path for the query result and to tolerate the network topology changes caused by node mobility, which could otherwise cause the query to fail. CNFS requires fewer messages to process a query than flooding&ndash;based algorithms, while tolerating node mobility better than random walk&ndash;based algorithms. Address Aggregation-based Routing (AAR) is a novel routing protocol designed for MANETs. It reactively performs route discovery, but proactively maintains an index hierarchy called a Route Discovery DAG (RDD) to make route discovery efficient. The RDD contains aggregated node address information, requiring fewer packets for route discovery than the flooding used in existing protocols, while handling mobility better than pre-computing routes to all nodes. Compared with some existing popular protocols, AAR shows better performance in delivery rate, message overhead, latency and scalability.
An energy-efficient, transport-controlled MAC protocol for wireless sensor networks
Authors: Jaesub Kim, Kyu Ho Park
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

In wireless sensor networks (WSNs), one major cause of wasted energy is that the wireless network interface is always on to accept possible traffic. Many medium access control (MAC) protocols therefore adopted a periodic listen-and-sleep scheme to save energy, at sacrifice of end-to-end latency and throughput. Another cause is packet dropping due to network congestion, necessitating a lightweight transport protocol for WSNs. In this paper, we suggest a transport-controlled MAC protocol (TC-MAC) that combines the transport protocol into the MAC protocol with the aims of achieving high performance as well as energy efficiency in multi-hop forwarding. Although TC-MAC also works through a periodic listen-and-sleep scheme, it lowers end-to-end latency by reserving data forwarding schedules across multi-hop nodes during the listen period and by forwarding data during the sleep period, all while increasing throughput by piggybacking the subsequent data forwarding schedule on current data transmissions and forwarding data consecutively. In addition, TC-MAC gives a fairness-aware lightweight transport control mechanism based on benefits of using the MAC-layer information. The results show that TC-MAC performs as well as an 802.11-like MAC in end-to-end latency and throughput, and is more efficient than S-MAC in energy consumption, with the additional advantage of supporting fairness-aware congestion control.
Convex Multi-class Image Labeling by Simplex-Constrained Total Variation
Authors: Jan Lellmann, Jörg Kappes, Jing Yuan, Florian Becker, Christoph Schnörr
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We suggest a novel functional based on a multidimensional total variation formulation, allowing for a broad range of data terms. Optimization is carried out in the operator splitting framework using Douglas-Rachford Splitting. In this connection, we compare two methods to solve the Rudin-Osher-Fatemi type subproblems and demonstrate the performance of our approach on single- and multichannel images.
Process Dimension of Concepts
Authors: Vaclav Repa
Venue: Proceeding of the 2008 conference on Information Modelling and Knowledge Bases XIX (2008)

This article discusses the problem of process description in conceptual models. We argue for the idea that also the conceptual elements of the reality should be viewable dynamically --as a process. The article outlines the sense and the methodical way of describing two basic types of the Real World processes: business processes and object life cycles. In more detail the article analyzes basic kinds of the models coherency introducing two main criteria of completeness and correctness of models together with the concept of the structural coherency of models. It also discusses possible ways of describing dynamic aspects of the Real World and outlines some general conclusions.
Factors Influencing Effectiveness in Automated Essay Scoring with LSA
Authors: Fridolin Wild, Christina Stahl, Gerald Stermsek, Yoseba Penya, Gustaf Neumann
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Automated essay scoring by means of latent semantic analysis (LSA) has recently been subject to increasing interest. Although previous authors have achieved grade ranges similar to those awarded by humans, it is still not clear which and how parameters improve or decrease the effectiveness of LSA. This paper presents an analysis of the effects of these parameters, such as text pre-processing, weighting, singular value dimensionality and type of similarity measure, and benchmarks this effectiveness by comparing machine-assigned with human-assigned scores in a real-world case. We show that each of the identified factors significantly influences the quality of automated essay scoring and that the factors are not independent of each other.