ppxscal/embedding_network huggingface dataset:
Application of Unascertained Measure in Evaluation Model of College Students' Personal Credit
Authors: Yan-ming Qi, Wang Chang-long
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In order to improve college students’ employment evaluation system, it becomes more and more important to establish index system of personal credit evaluation. A new method of quantitative and qualitative combining has been put forward to evaluate college students’ personal credit, establish the evaluation model based on the unascertained measure and index categorization weight with information entropy. The example shows that it has high theoretical and practical value with the method of unascertained measure to evaluate college students’ personal credit.
Robotics and Automation in Regenerative Medicine for Musculoskeletal Applications
Authors: Luminita Simion, Paul Botez, Florin Zugun-Eloae
Venue: Proceedings of the 2009 Advanced Technologies for Enhanced Quality of Life (2009)

Aiming to structurally and functionally replace missing or damaged tissues, regenerative medicine can offer revolutionary therapeutical solution in addressing musculoskeletal conditions. Translation from basic research to affordable cost effective therapeutic procedures implies using advanced robotic and automatized technology for research, processing, quality control and future development. This paper overviews present status of robotics and automation applications for cell culturing, scaffold fabrication, imaging and process monitoring in the field of regenerative medicine for musculoskeletal conditions.
Mapping Social Networks into P2P Directory Service
Authors: Lukasz Zaczek, Anwitaman Datta
Venue: Proceedings of the 2009 International Workshop on Social Informatics (2009)

This paper presents our approach to use social network information in P2P networks in order to efficiently retrieve relevant information by exploiting existing trust relations of the social network links. The novelty of our work is to demonstrate that only a subset of the whole social network is adequate to build an efficient and reliable service. We use our P2P network, which is an adaptation of virtual ring routing mechanisms originally proposed for ad-hoc networks, to deploy a directory service facilitating search for friends - a common functionality required in online social networks as well. We expect our mechanism can be used in facilitating the deployment of peer-to-peer online social networks. Small scale experiment results, using both artificial as well as real social network graphs, show that with even only small subset of nodes from the whole social network, the approach achieves a high level of query success.
On the prospects for building a working model of the visual cortex
Authors: Thomas Dean, Glenn Carroll, Richard Washington
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Human visual capability has remained largely beyond the reach of engineered systems despite intensive study and considerable progress in problem understanding, algorithms and computing power. We posit that significant progress can be made by combining existing technologies from computer vision, ideas from theoretical neuroscience and the availability of large-scale computing power for experimentation. From a theoretical standpoint, our primary point of departure from current practice is our reliance on exploiting time in order to turn an otherwise intractable unsupervised problem into a locally semi-supervised, and plausibly tractable, learning problem. From a pragmatic perspective, our system architecture follows what we know of cortical neuroanatomy and provides a solid foundation for scalable hierarchical inference. This combination of features promises to provide a range of robust object-recognition capabilities.
Temporal Process Discovery in Many Guises
Authors: Naren Ramakrishnan, Debprakash Patnaik, Vandana Sreedharan
Venue: Computer (2009)

The dynamics of important temporal processes can now be automatically reconstructed from data.
Likelihood-maximizing-based multiband spectral subtraction for robust speech recognition
Authors: Bagher BabaAli, Hossein Sameti, Mehran Safayani
Venue: EURASIP Journal on Advances in Signal Processing (2009)

Automatic speech recognition performance degrades significantly when speech is affected by environmental noise. Nowadays, the major challenge is to achieve good robustness in adverse noisy conditions so that automatic speech recognizers can be used in real situations. Spectral subtraction (SS) is a well-known and effective approach; it was originally designed for improving the quality of speech signal judged by human listeners. SS techniques usually improve the quality and intelligibility of speech signal while speech recognition systems need compensation techniques to reduce mismatch between noisy speech features and clean trained acoustic model. Nevertheless, correlation can be expected between speech quality improvement and the increase in recognition accuracy. This paper proposes a novel approach for solving this problem by considering SS and the speech recognizer not as two independent entities cascaded together, but rather as two interconnected components of a single system, sharing the common goal of improved speech recognition accuracy. This will incorporate important information of the statistical models of the recognition engine as a feedback for tuning SS parameters. By using this architecture, we overcome the drawbacks of previously proposed methods and achieve better recognition accuracy. Experimental evaluations show that the proposed method can achieve significant improvement of recognition rates across a wide range of signal to noise ratios.
Marginal Space Learning for Efficient Detection of 2D/3D Anatomical Structures in Medical Images
Authors: Yefeng Zheng, Bogdan Georgescu, Dorin Comaniciu
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

Recently, marginal space learning (MSL) was proposed as a generic approach for automatic detection of 3D anatomical structures in many medical imaging modalities [1]. To accurately localize a 3D object, we need to estimate nine pose parameters (three for position, three for orientation, and three for anisotropic scaling). Instead of exhaustively searching the original nine-dimen-sional pose parameter space, only low-dimensional marginal spaces are searched in MSL to improve the detection speed. In this paper, we apply MSL to 2D object detection and perform a thorough comparison between MSL and the alternative full space learning (FSL) approach. Experiments on left ventricle detection in 2D MRI images show MSL outperforms FSL in both speed and accuracy. In addition, we propose two novel techniques, constrained MSL and nonrigid MSL, to further improve the efficiency and accuracy. In many real applications, a strong correlation may exist among pose parameters in the same marginal spaces. For example, a large object may have large scaling values along all directions. Constrained MSL exploits this correlation for further speed-up. The original MSL only estimates the rigid transformation of an object in the image, therefore cannot accurately localize a nonrigid object under a large deformation. The proposed nonrigid MSL directly estimates the nonrigid deformation parameters to improve the localization accuracy. The comparison experiments on liver detection in 226 abdominal CT volumes demonstrate the effectiveness of the proposed methods. Our system takes less than a second to accurately detect the liver in a volume.
Treebank grammar techniques for non-projective dependency parsing
Authors: Marco Kuhlmann, Giorgio Satta
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

An open problem in dependency parsing is the accurate and efficient treatment of non-projective structures. We propose to attack this problem using chart-parsing algorithms developed for mildly context-sensitive grammar formalisms. In this paper, we provide two key tools for this approach. First, we show how to reduce non-projective dependency parsing to parsing with Linear Context-Free Rewriting Systems (LCFRS), by presenting a technique for extracting LCFRS from dependency treebanks. For efficient parsing, the extracted grammars need to be transformed in order to minimize the number of nonterminal symbols per production. Our second contribution is an algorithm that computes this transformation for a large, empirically relevant class of grammars.
Research on Electromagnetism Torque of the Six-Phase Induction Machine with Special Phase Current Waveform
Authors: Ai Bao, Ai Yong-le, Niu Lian-bo
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

With the characteristic which the control of the multiphase machine is more complex compared with three-phase ac machine, a novel control method is proposed in this paper, namely six-phase motor trapezoidal wave phase current control. By using the trapezoidal phase current waveform, the stator winding is separated into the field winding and the torque winding. The function which is about the field and torque control in directed and separated mode can be realized without the complex Park transformation. The performance of the output torque of the six-phase induction motor using trapezoidal wave phase current is investigated in this paper. Three methods are used to verify the torque of the motor namely conventional analytical calculation, Finite Element calculation and practical measurements. K-value is analyzed and calculated as MMF decoupling. The result of the output torque obtained from these methods show good agreement.
Study on Vignetting Simulation Method of Infrared Optical System
Authors: Min Zhu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Vignetting effect reflects a geometric phenomenon that the radiation illumination which reaches the detector decreases gradually with the increase of off-axis distance. Vignetting effect has become one of the defects of infrared image, and it can’t be ignored. So the exact modeling of the vignetting effect is vital for generating an infrared simulation image through optical system. A simulation method of the vignetting effect resulted from infrared optical system is presented. The cause of the vignetting effect is analyzed theoretically by using ray tracing method, and the model of the vignetting effect is established. Then simulation is carried out for the vignetting effect based on image pixel processing. The simulated result is presented. Experiments show that the simulation method of vignetting effect is effective, which is useful for increasing the fidelity of the generated infrared image.
Organization Diagnosis Tools Based on Social Network Analysis
Authors: Takanori Ugai, Kouji Aoyama
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Many organizations have challenges such as inter-organizational barriers and motivation of employees. However, these kinds of problems are not easy to visualize, and it is even more difficult to derive, implement and assess appropriate measures to deal with them. We developed a tool to visualize the dynamic structure of cooperative relationships between employees in organizations based on questionnaires given to employees of those organizations. This tool is used for visualizing barriers between teams and the effects of measures. In this paper we explain some features of this tool and verify its capabilities and effectiveness with a case study. The case study is some field research based on interviews that we conducted in which we applied measures to improve the employees' communication. We collected a set of data about relationships in an organization with questionnaires before and after implementing the measures. And we compared the observed result produced by the visualization tool with the result from the field research.
An erp investigation on visuotactile interactions in peripersonal and extrapersonal space: Evidence for the spatial rule
Authors: Chiara F. Sambo, Bettina Forster
Venue: Journal of Cognitive Neuroscience (2009)

The spatial rule of multisensory integration holds that cross-modal stimuli presented from the same spatial location result in enhanced multisensory integration. The present study investigated whether processing within the somatosensory cortex reflects the strength of cross-modal visuotactile interactions depending on the spatial relationship between visual and tactile stimuli. Visual stimuli were task-irrelevant and were presented simultaneously with touch in peripersonal and extrapersonal space, in the same or opposite hemispace with respect to the tactile stimuli. Participants directed their attention to one of their hands to detect infrequent tactile target stimuli at that hand while ignoring tactile targets at the unattended hand, all tactile nontarget stimuli, and any visual stimuli. Enhancement of ERPs recorded over and close to the somatosensory cortex was present as early as 100 msec after onset of stimuli (i.e., overlapping with the P100 component) when visual stimuli were presented next to the site of tactile stimulation (i.e., perihand space) compared to when these were presented at different locations in peripersonal or extrapersonal space. Therefore, this study provides electrophysiological support for the spatial rule of visual-tactile interaction in human participants. Importantly, these early cross-modal spatial effects occurred regardless of the locus of attention. In addition, and in line with previous research, we found attentional modulations of somatosensory processing only to be present in the time range of the N140 component and for longer latencies with an enhanced negativity for tactile stimuli at attended compared to unattended locations. Taken together, the pattern of the results from this study suggests that visuotactile spatial effects on somatosensory processing occur prior and independent of tactile-spatial attention.
Analysing Wikipedia and gold-standard corpora for NER training
Authors: Joel Nothman, Tara Murphy, James R. Curran
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

Named entity recognition (ner) for English typically involves one of three gold standards: muc, conll, or bbn, all created by costly manual annotation. Recent work has used Wikipedia to automatically create a massive corpus of named entity annotated text. We present the first comprehensive cross-corpus evaluation of ner. We identify the causes of poor cross-corpus performance and demonstrate ways of making them more compatible. Using our process, we develop a Wikipedia corpus which outperforms gold standard corpora on cross-corpus evaluation by up to 11%.
Concavely-Priced Probabilistic Timed Automata
Authors: Marcin Jurdziński, Marta Kwiatkowska, Gethin Norman, Ashutosh Trivedi
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-complete for automata with one clock. Previous work on expected price problems for probabilistic timed automata was restricted to expected reachability for linearly-priced automata and integer valued initial states. This work uses the boundary region graph introduced by Jurdziński and Trivedi to analyse properties of concavely-priced (non-probabilistic) timed automata.
A Systematic Framework for Grammar Testing
Authors: Lixiao Zheng, Haiming Chen
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Grammars, especially context-free grammars, are widely used within and even outside the field of computer science. In this paper, we present a systematic framework for grammar testing, in which some commonly used techniques for testing programs such as module testing and integration testing are adapted and applied to the testing of grammars. We propose a nonterminal-based approach for grammar modularization, combined with an iterative process for grammar testing in which a grammar is tested with respect to both a generator and a recognizer. Experiments on grammars for some non-trivial programming languages such as C and Java demonstrate the feasibility and efficiency of the testing framework and the proposed approaches.
Computing minimal diagnoses by greedy stochastic search
Authors: Alexander Feldman, Gregory Provan, Arjan Van Gemund
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Most algorithms for computing diagnoses within a model-based diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are Σ2P-hard. To overcome this complexity problem, which prohibits the computation of high-cardinality diagnoses for large systems, we propose a novel approximation approach for multiple-fault diagnosis, based on a greedy stochastic algorithm called SAFARI (StochAstic Fault diagnosis Algo-RIthm). We prove that SAFARI can be configured to compute diagnoses which are of guaranteed minimality under subsumption. We analytically model SAFARI search as a Markov chain, and show a probabilistic bound on the minimality of its minimal diagnosis approximations. We have applied this algorithm to the 74XXX and ISCAS85 suites of benchmark combinatorial circuits, demonstrating order-of-magnitude speedups over two state-of-the-art deterministic algorithms, CDA* and HA*, for multiple-fault diagnoses.
Greek word segmentation using minimal information
Authors: C. Anton Rytting
Venue: Proceedings of the Student Research Workshop at HLT-NAACL 2004 on XX (2004)

Several computational simulations have been proposed for how children solve the word segmentation problem, but most have been tested only on a limited number of languages, often only English. In order to extend the cross-linguistic dimension of word segmentation research, a finite-state framework for testing various models of word segmentation is sketched, and a very simple cue is tested in this framework. Data is taken from Modern Greek, a language with phonological patterns distinct from English. A small-scale simulation shows using this cue performs significantly better than chance. The utility and flexibility of the finite-state approach is confirmed; suggestions for improvement are noted and directions for future work outlined.
Design of a New Magnetoelastic Stress Sensor
Authors: Yanping Shi, Yifei Shi
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

To measure precisely the stress acted on mechanical equipment on—line and make the fault diagnosis, we designed a new the non-contact sensor with three magnetic poles based on magnetoelastic effect, analyzed and derived its operation principle and the mathematical model of induced voltage output in this paper. The output characteristic of the sensor affected by field current intensity, frequency, and the gap between the probe of the sensor and the surface of the material tested was analyzed by testing. The calculation result based on the output model found by the paper accord basically with the test result. The results of the test have showed that the measuring precision and sensitivity of the sensor can meet the demands of the general practical application.
A Novel Approach for Word Spotting Using Merge-Split Edit Distance
Authors: Khurram Khurshid, Claudie Faure, Nicole Vincent
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Edit distance matching has been used in literature for word spotting with characters taken as primitives. The recognition rate however, is limited by the segmentation inconsistencies of characters (broken or merged) caused by noisy images or distorted characters. In this paper, we have proposed a Merge-split edit distance which overcomes these segmentation problems by incorporating a multi-purpose merge cost function. The system is based on the extraction of words and characters in the text and then attributing each character with a set of features. Characters are matched by comparing their extracted feature sets using Dynamic Time Warping (DTW) while the words are matched by comparing the strings of characters using the proposed Merge-Split Edit distance algorithm. Evaluation of the method on 19th century historical document images exhibits extremely promising results.
Adaptive Link Cost Reduction by Generic Topology Construction in Ad-Hoc Networks
Authors: Reu-Ching Chen, Cheng-Min Lin
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Many works have been done on improving the performance of the ad-hoc networks, in which a stringent issue is concentrated on proper topology establishment with least link connections due to the cost considerations. In this paper, a generic method based on network topology design, called "the spider network topology" is proposed to achieve link cost reduction between distinct nodes communications in the modern ad-hoc networks. In our approach, the link cost reduction using the spider topology is compared with the complete graph topology [1] for ad-hoc networks (link is thought as the system resource for cost estimation in the following sections). Our contribution is concentrated on less total link cost as compared with the complete graph construction under the constraint that average connection links between distinct nodes is less than some constant. The spider network topology technique adopted in this paper is superior than other network topology in some conditions, especially when there are no clear relationship between node pairs for link constructions. The spider network behaves the advantage both in easy implementation and less congestion occurring. This characteristic will benefit on the system performance improving, especially in reliability guarantees. The new architecture presented here can be widely applied in topology design for the modern ad-hoc networks due to the efficient link constructions.
Autonomous Planning and Execution for a Future Titan Aerobot
Authors: Daniel Gaines, Tara Estlin, Steve Schaffer, Caroline Chouinard, Alberto Elfes
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

We are developing onboard planning and execution technologies to provide robust and opportunistic mission operations for a future Titan aerobot. Aerobot have the potential for collecting a vast amount of high priority science data. However, to be effective, an aerobot must address several challenges including communication constraints, extended periods without contact with Earth, uncerttain and changing environmental conditions, maneuvarability constraints and potentially short-lived science opportunities. We are developing the AerOASIS system to develop and test technology to support autonomous science operations for a future Titan Aerobot. The planning and execution component of AerOASIS is able to generate mission operations plans that achieve science and engineering objectives while respecting mission and resource constraints as well as adapt the plan to respond to new science opportunities. Our technology leverages prior work on the OASIS system for autonomous rover exploration. In this paper we describe how the OASIS planning component was adapted to address the unique challenges of a Titan Aerobot and we describe a field demonstration of the system with the JPL prototype aerobot.