ppxscal/embedding_network huggingface dataset:
The accessible aquarium: identifying and evaluating salient creature features for sonification
Authors: Anandi Pendse, Michael Pate, Bruce N. Walker
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Informal learning environments (e.g., aquaria, zoos, science centers) are often inaccessible to the visually impaired. Sonification can make such environments more accessible while also adding to the experience of sighted visitors. This study was to determine the salient features of moving creatures in the sort of dynamic display typically found in such environments and to evaluate the efficacy of sonification in improving the experience of viewing such displays by sighted research participants.
User-Feedback on a Feature-Rich Photo Organiser
Authors: David A. Sadlier, Hyowon Lee, Cathal Gurrin, Alan F. Smeaton, Noel E. O'Connor
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

As the proliferation of digital photography increases, the software used to manage our increasingly large collections of digital photos becomes ever more important. In this paper we present the findings of a study which investigates how people view and interact with a set of photo management features. Specifically, a group of users are set the task of managing their own photos using a system built to encompass a wide range of photo organization functionality. They are then quizzed about their experiences in terms of their feature preferences, the general usability of the system, and other suggestions/requirements. Given these opinions, a basic estimation is then formed on what they like/dislike about the various aspects of the system, towards obtaining a more learned understanding of how we may develop a photo organizer that is optimal in terms of user satisfaction.
Moving Locally Predefined Remeshing for Deep Cone Penetration FE Analysis
Authors: Rimantas Kačianauskas, Darius Markauskas
Venue: Informatica (2004)

The paper considers moving locally predefined (MLP) finite element remeshing technique for deep penetration of the rigid cone into homogeneous and porous medium. Remeshing presents a computational tool implemented in the form of postprocessor type software compatible with standard FEM codes. It involves a transfer operation combining both the moving least square method based on stress patch recovery and the interpolation method for transfer of state variables. The developed MLP remeshing is able to overcome numerical difficulties occurring due to large distortions of the Lagrangian mesh and contact sliding and capture steady-state behavior. It shows good performance in modeling of cone penetration into elasto-plastic homogeneous and porous media reaching several diameters of the cone.
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
Authors: Yoram Moses, Michel Raynal
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

Assuming that each process proposes a value, the consensus problem requires the non-faulty processes to agree on the same value that, moreover, must be one of the proposed values. Solutions to the consensus problem in synchronous systems are based on the round-based model, namely, the processes progress in synchronous rounds. The well-known worst-case lower bound for consensus in the synchronous setting is t + 1 rounds, where t is an a priori bound on the number of failures. Simultaneous consensus is a variant of consensus in which the non-faulty processes are required to decide in the exact same round, in addition to the deciding on the same value. Dwork and Moses showed that, in a synchronous system prone to t process crashes, the earliest round at which a common decision can be simultaneously obtained is (t + 1) ¿ W where t is a bound on the number of faulty processes and W is a non-negative integer determined by the actual failure pattern F. In the condition-based approach consensus the consensus requirement is relaxed by assuming that the input vectors (consisting of the proposed initial values) are restricted to belong to a predetermined set C. Initially considered as a means to achieve solvability for consensus in the asynchronous setting, condition-based consensus was shown by Mostéfaoui, Rajsbaum and Raynal to allow solutions with better worst-case behavior. They defined a hierarchy of sets of conditions (where the set contains the condition made up of all possible input vectors). It has been shown that t + 1 ¿ d is a tight lower bound on the minimal number of rounds for synchronous condition-based consensus with a condition in .This paper considers condition-based simultaneous consensus in the synchronous model. It first presents a simple algorithm in which processes decide simultaneously at the end of the round RS t,d,F = (t + 1) ¿ max (W, d). The paper then shows that RS t,d,F is a lower bound for simultaneous condition-based consensus. A consequence of the analysis is that the algorithm presented is optimal in each and every run, and not just in the worst case: For every choice of failure pattern by the adversary (and every input configuration), the algorithm reaches simultaneous agreement as fast as any correct algorithm could do under the same conditions. This shows that, contrary to what could be hoped, when considering condition-based consensus with simultaneous decision, we can benefit from the best of both actual worlds (either the failure world when RS t,d,F = (t + 1) ¿ W, or the condition world when RS t,d,F = d + 1), but we cannot benefit from the sum of savings offered by both. Only the best discount applies.
Comparing and combining off-line feedrate rescheduling strategies in free-form surface machining with feedrate acceleration and deceleration
Authors: Li Qian, Budong Yang, Shuting Lei
Venue: Robotics and Computer-Integrated Manufacturing (2008)

Off-line rescheduling feedrates based on changing surface geometry in free-form surface machining could reduce machining time, increase tool life, and improve surface finish quality. Various feedrate rescheduling strategies have different feedrate rescheduling control parameters. These parameters could be chip thickness, metal removal rate (MRR), or resultant forces. The paper compares these feedrate rescheduling strategies in machining time and feedrate changes. Machining time could be reduced significantly if appropriate values are set for those control parameters. Further, various strategies are combined for better results in two ways: the minimum and the maximum feedrate combination. Machining time could be reduced with both feedrate combinations. The minimum feedrate combination could protect machining against excessive chip thickness, MRR, resultant force, or other conditions that may occur using only one of these rescheduling strategies. The maximum feedrate combination could further reduce machining time with a loose control on those conditions. The paper also points out that advantages of feedrate rescheduling may not been in real if distances between neighboring cutting locations are too small for the machine to arrive at rescheduled feedrates in sharply changing cutting directions and feedrates. The method to calculate real feedrates and machining time is provided in consideration with feedrate ac/deceleration.
Jule G. Charney, 1917-1981
Authors: Norman A. Phillips
Venue: IEEE Annals of the History of Computing (1981)

Jule Gregory Charney, Alfred P. Sloan Professor of Meteorology at the Massachusetts Institute of Technology, died June 16, 1981, at the Sidney Farber Cancer Institute. He was the leading world figure in meteorology ever since he and John von Neumann first introduced the electronic computer into weather prediction in 1950. 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
Novel Quantitative Method for Spleen's Morphometry in Splenomegally
Authors: Tomasz Sołtysiński
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Novel method for spleen's semiautomatic accurate quantitative morphometry adaptable in diagnosis of splenomegally is described. The method is based on multiscale wavelet image decomposition, Bayesian inference that reveals the most probable structure delineation in the image and spectral method to smooth and approximate the most probable representation of a real contour hidden in a noisy or fuzzy data. 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
Secure Public Digital Watermarking Detection Scheme
Authors: Yanjun Hao, Guoqi Bao, Huanguo Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

One of the threats to watermarking security is unauthorized removal. In this paper, a framework based on extended Trusted Computer Platform to solve this problem was presented. Using Trusted Computing Platform could enhance the security of watermarking detection. The TPM as a supervisor that control the watermark detection program and only the legal one can use the secret knowledge, that is, this secret knowledge bind with detection program in crypto format. This can ensure the whole scheme is secure although detection program is public. The security and feasibility about the framework was discussed, especially the resistant to Oracle attack. Finally, it can be conclusion that a traditional watermarking scheme could get the capability of secure public detection after being transformed based on this framework.
Assessing the default risk by means of a discrete-time survival analysis approach
Authors: Daniele De Leonardis, Roberto Rocci
Venue: Applied Stochastic Models in Business and Industry (2008)

In this paper, the problem of company distress is assessed by means of a multi-period model that exploits the potentialities of the survival analysis approach when both survival times and regressors are measured at discrete points in time. The discrete-time hazards model can be used both as an empirical framework in the analysis of the causes of the deterioration process that leads to the default and as a tool for the prediction of the same event. Our results show that the prediction accuracy of the duration model is better than that provided by a single-period logistic model. It is also shown that the predictive power of the discrete-time survival analysis is enhanced when it is extended to allow for unobserved individual heterogeneity (frailty). Copyright &copy; 2008 John Wiley & Sons, Ltd.
Magic Labelings on Cycles and Wheels
Authors: Andrew Baker, Joe Sawada
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we extend the enumeration of the total labelings on these classes of graphs.
New Approaches in Teaching Medical Informatics to Medical Students
Authors: Panagiotis D. Bamidis, Stathis Th. Konstantinidis, Eleni Kaldoudi, Charalambos Bratsas, Maria M. Nikolaidou, Dimitris Koufogiannis, Nicos Maglaveras, Costas Pappas
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

As technologies of information and communication are integrated incrementally with all facets of everyday life, it is reasonable to expect a penetration into educational procedures as well. This is also true for the case of Medical/Health Informatics. In this paper, we describe our approach to facilitate the provision of online medical informatics modules with all those tools (Moodle) and standards (SCORM, HealthcareLOM) required, so as to allow for a proper electronic provision of our modules. The effort is made against the traditional and ineffective concept of simply converting the classical learning material into its corresponding digital form; it is rather attempted here to fully follow the whole educational process by trying to achieve the educational objectives and learning outcomes in parallel to creating and structuring the digital material. Web 2.0 technologies are also incorporated into this process.
Intermanual Transfer of the Curvature Aftereffect in Static and Dynamic Touch
Authors: Bernard J. Horst, Astrid M. Kappers
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

The existence and intermanual transfer of curvature aftereffects was studied for static and dynamic touch, whereby only the index fingers were used. A curvature aftereffect is the phenomenon that a flat surface is judged concave if the preceding touched stimulus was convex and vice versa. Substantial aftereffects were demonstrated when the subsequently presented adaptation and test stimulus were touched by the same index finger. When one index finger was used to touch the adaptation stimulus and the opposite index finger was employed to touch the test stimulus, only a partial transfer of the aftereffect was found for static touch, but a complete transfer was obtained in the dynamic case. These findings suggest that the representation of curvature information depends on the exploration mode.
On Cross-Modal Perception of Musical Tempo and the Speed of Human Movement
Authors: Kathleya Afanador, Ellen Campana, Todd Ingalls, Dilip Swaminathan, Harvey Thornburg, Jodi James, Jessica Mumford, Gang Qian, Stjepan Rajko
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

Studies in crossmodal perception often use very simplified auditory and visual contexts. While these studies have been theoretically valuable, it is sometimes difficult to see how the findings can be ecologically valid or practically valuable. This study hypothesizes that a musical parameter (tempo) may affect the perception of a human movement quality (speed) and finds that although there are clear limitations, this may be a promising first step towards widening both the contexts in which cross-modal effects are studied and the application areas in which the findings can be used.
Proactive process-level live migration in HPC environments
Authors: Chao Wang, Frank Mueller, Christian Engelmann, Stephen L. Scott
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

As the number of nodes in high-performance computing environments keeps increasing, faults are becoming common place. Reactive fault tolerance (FT) often does not scale due to massive I/O requirements and relies on manual job resubmission. This work complements reactive with proactive FT at the process level. Through health monitoring, a subset of node failures can be anticipated when one's health deteriorates. A novel process-level live migration mechanism supports continued execution of applications during much of processes migration. This scheme is integrated into an MPI execution environment to transparently sustain health-inflicted node failures, which eradicates the need to restart and requeue MPI jobs. Experiments indicate that 1-6.5 seconds of prior warning are required to successfully trigger live process migration while similar operating system virtualization mechanisms require 13-24 seconds. This self-healing approach complements reactive FT by nearly cutting the number of checkpoints in half when 70% of the faults are handled proactively.
Comparative Analysis of the Interaction Networks of HIV-1 and Human Proteins
Authors: Kyungsook Han, Byungkyu Park
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Various interactions of human immunodeficiency virus type 1 (HIV-1) proteins with those of the host cell are known, but a large-scale network encompassing all known interactions of HIV-1 proteins and host cell proteins have not been analyzed or visualized. This is partly because large-scale interaction data are not readily available from public databases and individual literatures report small-scale interactions. NCBI recently released a database of all known interactions of HIV-1 proteins and human proteins. Now, a challenging task is to analyze all the interactions in a systematic way and to identify biologically meaningful interaction groups or patterns. This paper presents the development of a web-based system (http://hiv1.hpid.org) for visualizing and analyzing the large-scale interactions between HIV-1 and human proteins and the comparative analysis of the interactions. The whole interaction network contains 1,768 interactions of 65 different types with 810 human proteins. The analysis identified several interesting interaction groups from the comparative analysis of the interaction networks.
Consideration of common cause failures in safety systems
Authors: J. Börcsök, P. Holub
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

Systems in which failure could endanger human life are termed safety-critical. The SIS (Safety Instrumented System) should be designed to meet the required safety integrity level as defined in the safety requirement specification. Moreover, the SIS design should be performed in a way that minimizes the potential for common mode or common cause failures (ccf). The ccf are the biggest part when calculating the probability of failure for redundant safety integrity systems. A ccf can occur, when a random hardware failure leads to a failure of several components. There are several methods to calculate the probability of ccf, which will be shown in this paper. The ccf ratio for the calculation of the overall probability of failure is defined with the beta-factor.
Proteome-Wide Analysis of Amino Acid Absence in Composition and Plasticity
Authors: Yuzhong Zhao, Yun Xu, Zhihao Wang, Changjiang Jin, Xinjiao Gao, Yu Xue, Xuebiao Yao
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Each post-translational modification (PTM) of proteins only modifies one or several limited types of amino acids to ensure regulatory fidelity. Thus proteins without one or several types of amino acids (amino acid absence, AAA) might prohibit some PTMs. We performed a proteome-wide analysis to compute AAA proteins in six eukaryotic organisms. Although most of AAA proteins are generated by random during evolution, there are 1,220 (~10%) AAA proteins conserved in human and mouse, implying the amino acid absence might be important for a small proportion of proteins as an evolutionary mechanism. In addition, five of 25 K-deficient proteins are static keratin-associated proteins, which interact with keratins and play important roles in animal hair organization.
Depicting Negation in Diagrammatic Logic: Legacy and Prospects
Authors: Fabien Schang, Amirouche Moktefi
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Here are considered the conditions under which the method of diagrams is liable to include non-classical logics, among which the spatial representation of non-bivalent negation. This will be done with two intended purposes, namely: to review the basic concepts involved in the definition of logical negation; to account for a variety of epistemological obstacles against the introduction of non-classical negations within diagrammatic logic. It will be mainly argued that non-classical logics don't challenge dichotomy as such but merely show that a logical operator may be a negation without operating as a dichotomy.
Dynamic Consistency Analysis for Convergent Operators
Authors: Alva L. Couch, Marc Chiarini
Venue: Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services (2008)

It has been shown that sets of convergent operators with a shared fixed point can simulate autonomic control mechanisms, but many questions remain about this management technique. We discuss how an autonomous agent can reason about whether its convergent operators share a fixed point with the operators of other agents. Using a concept of time based upon operator repetition, we show that a failure to achieve convergence within specific time limits can be used as a probabilistic indicator of inconsistencies in local policy. We describe a statistical inference technique that determines if an agent's promise strategy is feasible. The strengths of this technique are that it is both scale-invariant and exterior to the operators whose consistency is being evaluated.
Efficient distance computation in configuration space
Authors: Liangjun Zhang, Young J. Kim, Dinesh Manocha
Venue: Computer Aided Geometric Design (2008)

We address the problem of computing a measure of the distance between two configurations of a rigid or an articulated model. The underlying distance metric is defined as the maximum length of the displacement vectors over the vertices of the model between two configurations. Our algorithm is based on Chasles theorem from Screw theory, and we show that for a rigid model the maximum distance is realized by one of the vertices on the convex hull of the model. We use this formulation to compute the distance, and present two acceleration techniques: incremental walking on the dual space of the convex hull and culling vertices on the convex hull using a bounding volume hierarchy (BVH). Our algorithm can be easily extended to articulated models by maximizing the distance over its each link and we also present culling techniques to accelerate the computation. We highlight the performance of our algorithm on many complex models and demonstrate its applications to generalized penetration depth computation and motion planning.
Development of a Wearable Measurement System to Identify Characteristics in Human Gait - eSHOE -
Authors: Harald Jagos, Johannes Oberzaucher
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Measurement and interpretation of human ambulation offers great opportunities for several fields in AAL. In this paper CEIT RALTEC's ongoing development of a wearable measurement system, integrated in a conventional walking shoe, is presented. By combining different kinds of sensors in a sensor network, several characteristic parameters of the human ambulation can be measured. Extensive sensor data fusion and interpretation is used to extract significant features, which will be used for inference purposes. Beside the pure technical development a main goal during the design process is the deployment of an user centred approach. Whereas potential elderly users as well as medical experts and care takers are involved during the whole development process, with the goal of delivering a close-to-market prototype at the end of the project.
Spectral Correspondence Using the TPS Deformation Model
Authors: Jun Tang, Nian Wang, Dong Liang, Yi-Zheng Fan, Zhao-Hong Jia
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper presents a novel algorithm for point correspondences using spectral graph analysis. Firstly, the correspondence probabilities are computed by using the modes of proximity matrix and the method of doubly stochastic matrix. Secondly, the TPS deformation model is introduced into the field of spectral correspondence to estimate the transformation parameters between two matched point-sets. The accuracy of correspondences is improved by bringing one point-set closer to the other in each iteration with transformation parameters estimated from the current correspondences. Experiments on both real-world and synthetic data show that our method possesses comparatively high accuracy.