ppxscal/embedding_network huggingface dataset:
Position paper: The coming of age of artificial intelligence in medicine
Authors: Vimla L. Patel, Edward H. Shortliffe, Mario Stefanelli, Peter Szolovits, Michael R. Berthold, Riccardo Bellazzi, Ameen Abu-Hanna
Venue: Artificial Intelligence in Medicine (2009)

This paper is based on a panel discussion held at the Artificial Intelligence in Medicine Europe (AIME) conference in Amsterdam, The Netherlands, in July 2007. It had been more than 15 years since Edward Shortliffe gave a talk at AIME in which he characterized artificial intelligence (AI) in medicine as being in its ''adolescence'' (Shortliffe EH. The adolescence of AI in medicine: will the field come of age in the '90s? Artificial Intelligence in Medicine 1993;5:93-106). In this article, the discussants reflect on medical AI research during the subsequent years and characterize the maturity and influence that has been achieved to date. Participants focus on their personal areas of expertise, ranging from clinical decision-making, reasoning under uncertainty, and knowledge representation to systems integration, translational bioinformatics, and cognitive issues in both the modeling of expertise and the creation of acceptable systems.
Studies on a Next Generation Access Technology Using Radio over Free-Space Optic Links
Authors: Kamugisha Kazaura, Pham Dat, Alam Shah, Toshiji Suzuki, Kazuhiko Wakamori, Mitsuji Matsumoto, Takeshi Higashino, Katsutoshi Tsukamoto, Shozo Komaki
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

With the continuous emergence of new innovative wireless technologies, standards, services and applications, there is an increase demand for technologies, preferably broadband, for providing seamless connectivity between the various networks elements. This paper proposes an innovative Radio over Free-Space Optics (RoFSO) communication system having potential to be a cost-effective and reliable technology for bridging these various networks facilities. The proposed system can be utilized as a next generation access technology suitable for transmission of heterogeneous wireless service signals especially in areas which lack broadband connectivity. Using an experimental free-space optical (FSO) communication system capable of transmitting RF signals, we conduct initial investigations focusing on studying the deployment environment characteristics which influence the performance of RoFSO systems. Preliminary propagation measurement results characterizing the effects of atmospheric influence on transmission of RF signal using FSO links are presented. The results show that in the absence of strong atmospheric turbulence or severe weather conditions, RoFSO system can effectively be used as access technology for transmission of broadband heterogeneous wireless services signals.
Case-based reasoning tools from shells to object-oriented frameworks
Authors: Essam Amin M. Lotfy Abdrabou, Abdel-Badeeh M. Salem
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

A Case-Based Reasoning (CBR) tool is software that can be used to develop several applications that require cased-based reasoning methodology. CBR shells are kind of application generators with graphical user interface. They can be used by non-programmer users but the extension or integration of new components in these tools is not possible. In this paper we analyzed three CBR object-oriented framework development environments CBR*Tools, CAT-CBR, and JColibri. These frameworks work as open software development environment and facilitate the reuse of their design as well as implementations.
Implementation of an Ada run-time environment
Authors: Herman Fischer, Edgar H. Sibley
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The Ada Programming Support Environment (APSE) has been introduced as a set of tools to support program development systems. This paper introduces the idea that the concepts and facilities of APSEs are valuable not only to host systems (those used to develop software), but also to certain Ada run-time environments (ARTEs) (those in which applications execute) and examines the implementation of large database transaction oriented systems in such an environment. Two examples of actual systems are used to show the benefits gained by using the Ada environment. A cost/benefit analysis for such a transition is also outlined.
A Unified Framework for Certificate and Compilation for QBF
Authors: Igor Stéphan, Benoit Mota
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

We propose in this article a unified framework for certificate and compilation for QBF. We provide a search-based algorithm to compute a certificate for the validity of a QBF and a search-based algorithm to compile a valid QBF in our unified framework.
Efficient location-aided flooding scheme initiated by receiver for MANETs
Authors: Ngoc Duy Pham, Hyunseung Choo
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Flooding is a fundamental, critical, and indispensable operation for supporting various applications and protocols in wireless ad hoc networks. The traditional flooding scheme generates excessive redundant packet retransmissions, however, causing contention and packet collisions, and ultimately wasting precious limited bandwidth and energy. Recently, some flooding schemes have been studied to avoid those problems, but these algorithms either perform well in redundant transmissions or require that the node maintain information about neighbors more than one hop away. One of the most efficient approaches is found in the work of Liu et al., which uses only 1-hop neighbor information. The advantage of this scheme is that it achieves local optimality in terms of the number of retransmitting nodes, although it still produces many redundant transmissions. In this paper, we propose an efficient flooding protocol that minimizes flooding traffic by leveraging location information of 1-hop neighbor nodes. Our scheme is receiver-based, which means that each receiver of a flooding message determines whether it should forward the message based on the given retransmission rule. Simulation results show that our scheme is highly efficient. It is able to reduce the number of forward nodes almost to that of the lower bound but maintains a high delivery ratio.
Maintenance is a management problem and a programmer's opportunity
Authors: John Reutter,  III
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Many installations treat systems maintenance as an afterthought or unwanted stepchild of systems development. The resulting demoralization of maintenance programmers and apparent confusion of maintenance activities can be avoided. Making maintenance visible and placing it in the proper perspective are responsibilities of maintenance managers. This paper defines categories and characteristics of maintenance that highlight the complexities and value of maintenance and its contribution to the corporate bottom line. There is an abundance of opportunities for programmer creativity, management success, and job enrichment in software maintenance. Suggestions are made in this paper on how to achieve proper perspective and assure successful maintenance through application of a "structured maintenance" methodology. The structured maintenance approach defined in this paper enhances programmer morale, improves system quality, assures user satisfaction, and places maintenance in its' proper perspective as a vital, profitable, contributing corporate business function.
From OWL-S Descriptions to Petri Nets
Authors: Antonio Brogi, Sara Corfini, Stefano Iardella
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

While OWL-S advertisements provide a rich (ontological and behavioural) description of Web services, there are no tools that support formal analyses of OWL-S services. In this paper we present a translator from OWL-S descriptions to Petri nets which makes such analyses possible thanks to the many tools available for Petri nets.
A Model Driven Approach to Adapt Instructional Strategies Modelling Language to Different Design Contexts
Authors: Rim Drira, Mona Laroussi, Xavier Le Pallec, Alain Derycke, Henda Ben Ghezala
Venue: Proceedings of the 2009 International Conference on Mobile, Hybrid, and On-line Learning (2009)

Our research focuses on assisting teachers to design their own learning systems in the context of model driven engineering approach. Within this approach, the teacher can create his own modeling language or reuse an existing one. However, the reuse gives rise to a lack of contextual expressiveness and requires teacher's adaptation to the language syntax and semantic. We propose a solution based on the reuse of instructional strategy modelling languages that allow their adaptation to the teacher's vocabulary and their contextual expressiveness improvement.
Comparative evaluation of collapsible versus semi-rigid intravenous containers
Authors: Michael Gabay, Konstantin von Martius
Venue: Journal of Visualization (2008)

Introduction: Comparative information related to the properties of intravenous containers is lacking. Information is important as healthcare providers weigh the strengths and weaknesses of various competing products. The aim of this study is to evaluate and compare three different intravenous containers: two closed-system fully collapsible bags that do not require external venting to empty (containers A and B) and one semi-rigid "bottle pack" that partially collapses unvented (container C). Methods: Through an observational study design, these containers were subjected to the following tests in order to evaluate their performance: determination of total and residual volume, air volume, admixture volume, presence of particulate matter, and a drop test. Results: The mean residual volume of container C was higher compared to containers A and B: between 0.6% and 11.7% with a closed administration set and between 0.7% and 10.8% with an open administration set. The mean air volume measured was increased relative to the nominal volume for container C. In addition, containers A and B exhibited no visible particulate matter after puncture, satisfied the drop test more frequently, and had relatively higher admixture volumes in comparison to container C. Conclusion: The results of these examinations reveal that containers A and B outperformed container C; however, caution must be used when interpreting these observational results in the clinical setting.
Wavelet Transform Adaptive De-noising Algorithm and Application Based on a Novel Variable Step Function
Authors: Jingjing Jin, Xu Wang, Shilong Li, Yingnan Wu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Research on a novel variable step function and use it in orthogonal wavelet transform least mean square (LMS) adaptive de-noising algorithm. The algorithmic principle was explained and the effect of orthogonal wavelet transform to arithmetic convergence speed was analyzed. A novel variable step function based on Sigmoid nonlinear functional relationship was proposed, and its characteristics were analyzed. It is applied to time domain LMS algorithm to analyze convergence speed and steady-state error of model identification. Then, the novel variable step function was used in orthogonal wavelet transform domain adaptive body vibration signal de-noising. The simulating results indicate that the novel variable step function gains well effect.
Distributed image processing over an adaptive Campus Grid
Authors: Simon J. Caton, Omer F. Rana, Bruce G. Batchelor
Venue: Concurrency and Computation: Practice Experience (2009)

A system implemented in MATLAB is described, which may be deployed over a Campus Grid utilizing the Condor job management system. Our approach can re-distribute jobs as node availability changes. The architecture of the system, its components, and their deployment across the Cardiff University Campus Grid (consisting of 2500 machines) are presented. Challenges in image processing applications that can be deployed over such infrastructure are presented, along with performance results that demonstrate the use of our system alongside a standard Condor deployment, demonstrating a significant increase in throughput using our approach&Dagger;. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Three-dimensional point cloud recognition via distributions of geometric distances
Authors: Mona Mahmoudi, Guillermo Sapiro
Venue: Graphical Models (2009)

A geometric framework for the recognition of three-dimensional objects represented by point clouds is introduced in this paper. The proposed approach is based on comparing distributions of intrinsic measurements on the point cloud. In particular, intrinsic distances are exploited as signatures for representing the point clouds. The first signature we introduce is the histogram of pairwise diffusion distances between all points on the shape surface. These distances represent the probability of traveling from one point to another in a fixed number of random steps, the average intrinsic distances of all possible paths of a given number of steps between the two points. This signature is augmented by the histogram of the actual pairwise geodesic distances in the point cloud, the distribution of the ratio between these two distances, as well as the distribution of the number of times each point lies on the shortest paths between other points. These signatures are not only geometric but also invariant to bends. We further augment these signatures by the distribution of a curvature function and the distribution of a curvature weighted distance. These histograms are compared using the @g^2 or other common distance metrics for distributions. The presentation of the framework is accompanied by theoretical and geometric justification and state-of-the-art experimental results with the standard Princeton 3D shape benchmark, ISDB, and nonrigid 3D datasets. We also present a detailed analysis of the particular relevance of each one of the different proposed histogram-based signatures. Finally, we briefly discuss a more local approach where the histograms are computed for a number of overlapping patches from the object rather than the whole shape, thereby opening the door to partial shape comparisons.
Sorting with Complete Networks of Stacks
Authors: Felix G. König, Marco E. Lübbecke
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Knuth introduced the problem of sorting numbers using a sequence of stacks. Tarjan extended this idea to sorting with acyclic networks of stacks (and queues), where items to be sorted move from a source through the network to a sink while they may be stored temporarily at nodes (the stacks). Both characterized which permutations are sortable this way; but they ignored the associated optimization problem (minimize the number of moves) and its complexity. Given a complete, thus cyclic, network of k &ge; 2 stacks, any permutation is obviously sortable. The important question now is how to actually sort with a minimum number of shuffles, i.e., moves in between stacks. This is a natural algorithmic complement to the structural questions asked by Knuth, Tarjan, and others. It is the first time shuffles are considered in stack sorting--despite of the great practical importance of this optimization version. We show that it is NP-hard to approximate the minimum number of shuffles within $\mathcal{O}(n^{1-\epsilon})$ for networks of k &ge; 4 stacks, even when the problem is restricted to complete networks, by relating stack sorting to Min k -Partition on circle graphs (for which we prove a stronger inapproximability result of independent interest). For complete networks, a simple merge sort algorithm achieves an approximation ratio of $\mathcal{O}(n \log n)$ for k &ge; 3; however, closing the logarithmic gap to our lower bound appears to be an intriguing open question. Yet, on the positive side, we present a tight approximation algorithm which computes a solution with a linear approximation guarantee, using a resource augmentation to &alpha;k + 1 stacks, given an &alpha;-approximation algorithm for coloring circle graphs. When there are constraints as to which items may be placed on top of each other, deciding about sortability becomes non-trivial again. We show that this problem is PSPACE-complete, for every fixed k &ge; 3.
It takes variety to make a world: diversification in recommender systems
Authors: Cong Yu, Laks Lakshmanan, Sihem Amer-Yahia
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Recommendations in collaborative tagging sites such as del.icio.us and Yahoo! Movies, are becoming increasingly important, due to the proliferation of general queries on those sites and the ineffectiveness of the traditional search paradigm to address those queries. Regardless of the underlying recommendation strategy, item-based or user-based, one of the key concerns in producing recommendations, is over-specialization, which results in returning items that are too homogeneous. Traditional solutions rely on post-processing returned items to identify those which differ in their attribute values (e.g., genre and actors for movies). Such approaches are not always applicable when intrinsic attributes are not available (e.g., URLs in del.icio.us). In a recent paper [20], we introduced the notion of explanation-based diversity and formalized the diversification problem as a compromise between accuracy and diversity. In this paper, we develop efficient diversification algorithms built upon this notion. The algorithms explore compromises between accuracy and diversity. We demonstrate their efficiency and effectiveness in diversification on two real life data sets: del.icio.us and Yahoo! Movies.
Task-Based Design and Runtime Support for Multimodal User Interface Distribution
Authors: Tim Clerckx, Chris Vandervelpen, Karin Coninx
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

This paper describes an approach that uses task modelling for the development of distributed and multimodal user interfaces. We propose to enrich tasks with possible interaction modalities in order to allow the user to perform these tasks using an appropriate modality. The information of the augmented task model can then be used in a generic runtime architecture we have extended to support runtime decisions for distributing the user interface among several devices based on the specified interaction modalities. The approach was tested in the implementation of several case studies. One of these will be presented in this paper to clarify the approach.
A new mathematical formulation and fast algorithm for fully resolved simulation of self-propulsion
Authors: Anup A. Shirgaonkar, Malcolm A. MacIver, Neelesh A. Patankar
Venue: Journal of Computational Physics (2009)

We present a computational algorithm for fully resolved numerical simulation (FRS) of rigid and deforming bodies moving in fluids. Given the deformation of the body in its own reference frame, the method solves for the swimming velocity of the body together with the surrounding flow field, and the hydrodynamic forces on the body. We provide the mathematical foundation of the algorithm based on distributed Lagrange multipliers, and show that it naturally connects with vortex methods through a vorticity source at the interface. We demonstrate applications to rigid and flexible bodies, membranes, and bodies with a propelling membrane attached to them. In contrast to some existing methods, the swimming velocity of the body is not prescribed but is computed along with the forces, without requiring a body-fitted grid. The algorithm is designed to be fast, efficient, and easy to implement in existing fluid dynamics codes for practical solid-fluid problems in engineering and biology.
Effective modelling of know-how for cyber-informatics practitioners
Authors: Jiri F. Urbanek
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The end-users are dominant clients of cyber-informatics service providers. The Requirements Engineering is bringing new approaches for it, whilst suitable language, modelling, simulating and evaluating apparatus and methodology are fundamental solution of this problem, as is proposed in our new apparatus UML, (UP)/DYVELOP. Any specialists from diverse branches and in many environments can easy manage these apparatus and methodology without sophisticated preliminary disposition. They are available to model on mass serving computers dynamical temporal events even. Here introduced useCase - the CAMouflage will be superior to display & simulate dynamic events in live on-line PowerPoint presentation, which will be dramatized in Santander finally.
Towards Typed Prolog
Authors: Tom Schrijvers, Vítor Santos Costa, Jan Wielemaker, Bart Demoen
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Prolog is traditionally not statically typed. Since the benefits of static typing are huge, it was decided to grow a portable type system inside two widely used open source Prolog systems: SWI-Prolog and Yap. This requires close cooperation and agreement between the two systems. The type system is Hindley-Milner. The main characteristics of the introduction of types in SWI and Yap are that typing is not mandatory, that typed and untyped code can be mixed, and that the type checker can insert dynamic type checks at the boundaries between typed and untyped code. The basic decisions and the current status of the Typed Prolog project are described, as well as the remaining tasks and problems to be solved.
High-gain observers in the presence of measurement noise: A switched-gain approach
Authors: Jeffrey H. Ahrens, Hassan K. Khalil
Venue: Automatica (Journal of IFAC) (2009)

This paper considers output feedback control using high-gain observers in the presence of measurement noise for a class of nonlinear systems. We study stability in the presence of measurement noise and illustrate the tradeoff when selecting the observer gain between state reconstruction speed and robustness to model uncertainty on the one hand versus amplification of noise on the other. Based on this tradeoff we propose a high-gain observer that switches between two gain values. This scheme is able to quickly recover the system states during large estimation error and reduce the effect of measurement noise in a neighborhood of the origin of the estimation error. We argue boundedness and ultimate boundedness of the closed-loop system under switched-gain output feedback.
GPU-based interactive visualization framework for ultrasound datasets
Authors: Sukhyun Lim Koojoo Kwon Byeong-Seok Shin
Venue: Computer Animation and Virtual Worlds (2009)

Ultrasound imaging is widely used in medical areas. By transmitting ultrasound signals into the human body, their echoed signals can be rendered to represent the shape of internal organs. Although its image quality is inferior to that of CT or MR, ultrasound is widely used for its speed and reasonable cost. Volume rendering techniques provide methods for rendering the 3D volume dataset intuitively. We present a visualization framework for ultrasound datasets that uses programmable graphics hardware. For this, we convert ultrasound coordinates into Cartesian form. In ultrasound datasets, however, since physical storage and representation space is different, we apply different sampling intervals adaptively for each ray. In addition, we exploit multiple filtered datasets in order to reduce noise. By our method, we can determine the adequate filter size without considering the filter size. As a result, our approach enables interactive volume rendering for ultrasound datasets, using a consumer-level PC. Copyright &copy; 2009 John Wiley & Sons, Ltd.