ppxscal/embedding_network huggingface dataset:
Feasibility of Case-Based Beam Generation for Robotic Radiosurgery
Authors: Alexander Schlaefer, Sonja Dieterich
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Robotic radiosurgery uses the kinematic flexibility of a robotic arm to target tumors and lesions from many different directions. This approach allows to focus the dose to the target region while sparing healthy surrounding tissue. However, the flexibility in the placement of treatment beams is also a challenge during treatment planning. So far, a randomized beam generation heuristic has been proven to be most robust in clinical practice. Yet, for prevalent types of cancer similarities in patient anatomy and dose prescription exist. We propose a case-based method to solve the planning problem for a new patient by adapting beam sets from successful previous treatments. Preliminary experimental results indicate that the novel method could lead to faster treatment planning.
The Complexity of the Annihilating Polynomial
Authors: Neeraj Kayal
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

Let F be a field and f_1, ..., f_k in F[x_1, ..., x_n] be a set of k polynomials of degree d in n variables over the field F. These polynomials are said to be algebraically dependent if there exists a nonzero k-variate polynomial A(t_1, ..., t_k) in F[t_1, ..., t_k] such that A(f_1, ..., f_k) = 0. A is then called an (f_1, ..., f_k)-annihilating polynomial. Within computer science, the notion of algebraic dependence was used in Dvir, Gabizon and Wigderson to construct explicit deterministic extractors from low-degree polynomial sources. They also observed that given (f_1, ..., f_k) as arithmetic circuits, there exists an efficient randomized algorithm for testing their algebraic independence. The problems of determining good bounds on the degree of the annihilating polynomial and of computing it explicitly were posed as open questions. We solve the two posed problems in the following way: >> We give closely matching upper and lower bounds for the degree of the annihilating polynomial. >> We show that it is NP-hard to decide if A(0, .. ,0) equals zero. Indeed the annihilating polynomial A(t_1, .., t_k)$ does not even admit a small circuit representation unless the polynomial hierarchy collapses. This then, to the best of our knowledge, is the only natural computational problem where determining the existence of an object (the annihilating polynomial in our case) can be done efficiently but the actual computation of the object is provably hard.
Update-efficient indexing of moving objects in road networks
Authors: Jidong Chen, Xiaofeng Meng
Venue: Geoinformatica (2009)

Recent advances in wireless sensor networks and positioning technologies have boosted new applications that manage moving objects. In such applications, a dynamic index is often built to expedite evaluation of spatial queries. However, the development of efficient indexes is a challenge due to frequent object movement. In this paper, we propose a new update-efficient index method for moving objects in road networks. We introduce a dynamic data structure, called adaptive unit, to group neighboring objects with similar movement patterns. To reduce updates, an adaptive unit captures the movement bounds of the objects based on a prediction method, which considers road-network constraints and the stochastic traffic behavior. A spatial index (e.g., R-tree) for the road network is then built over the adaptive unit structures. Simulation experiments, carried on two different datasets, show that an adaptive-unit based index is efficient for both updating and querying performances.
NUS-ML: improving word sense disambiguation using topic features
Authors: Jun Fu Cai, Wee Sun Lee, Yee Whye Teh
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

We participated in SemEval-1 English coarse-grained all-words task (task 7), English fine-grained all-words task (task 17, subtask 3) and English coarse-grained lexical sample task (task 17, subtask 1). The same method with different labeled data is used for the tasks; SemCor is the labeled corpus used to train our system for the all-words tasks while the labeled corpus that is provided is used for the lexical sample task. The knowledge sources include part-of-speech of neighboring words, single words in the surrounding context, local collocations, and syntactic patterns. In addition, we constructed a topic feature, targeted to capture the global context information, using the latent dirichlet allocation (LDA) algorithm with unlabeled corpus. A modified na&iuml;ve Bayes classifier is constructed to incorporate all the features. We achieved 81.6%, 57.6%, 88.7% for coarse-grained all-words task, fine-grained all-words task and coarse-grained lexical sample task respectively.
Image Categorization Based on a Hierarchical Spatial Markov Model
Authors: Lihua Wang, Zhiwu Lu, Horace H. Ip
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In this paper, we propose a Hierarchical Spatial Markov Model (HSMM) for image categorization. We adopt the Bag-of-Words (BoW) model to represent image features with visual words, thus avoiding the heavy work of manual annotation in most Markov model based approaches. Our HSMM is designed to describe the spatial relations of these visual words by modeling the distribution of transitions between adjacent words over each image category. A novel idea of semantic hierarchy is exerted in the model to represent the composition relationship of visual words at semantic level. Experiments demonstrate that our approach outperforms Bayesian hierarchical model based categorization approach with 12.5% and it also performs better than the previous Markov model based approach with 11.8% on average.
Modelling Systems: Practical Tools and Techniques in Software Development, 2nd edition
Authors: John Fitzgerald, Peter Gorm Larsen
Venue:  (2009)

How can we make sure that the software we build does what it is supposed to? This book provides an insight into established techniques which help developers to overcome the complexity of software development by constructing models of software systems in early design stages. It uses one of the leading formal methods, VDM (Vienna Development Method), and combines training in the formalism with industry-strength tool support and examples derived from real industrial applications. The principles taught here also apply to many of the current generation of formal methods. This second edition has been updated to include advanced online tool support for formal modeling as well as up-to-date reports on real commercial applications in areas as diverse as business information systems and firmware design.
An ASP System with Functions, Lists, and Sets
Authors: Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We present DLV-Complex, an extension of the DLV system that features the support for a powerful (possibly recursive) use of functions, list and set terms in the full ASP language with disjunction and negation.Any computable function can be encoded in a rich and fully declarative KRR language, ensuring termination on all programs belonging to the recently introduced class of finitely-ground programs; furthermore, termination can be "a priori" guaranteed on demand by means of a syntactic restriction check that ensures a finite-domain property.The system, which is already successfully used in many universities and research institutes, comes also equipped with a rich library of built-in functions and predicates for the manipulation of complex terms.
Using Heterogeneity to Enhance Random Walk-based Queries
Authors: Marco Zuniga, Chen Avin, Bhaskar Krishnamachari
Venue: Journal of Signal Processing Systems (2009)

It is a well-known property of random walks that nodes with higher degree are visited more frequently. Based on this property, we propose the use of cluster-heads (high-degree nodes) together with a simple push-pull mechanism to enhance the performance of random walk-based querying: events are pushed towards high-degree nodes (cluster-heads) and pulled from the cluster-heads by a random-walk originated at the sink. Following this simple mechanism, we show that having even a small percentage of cluster-heads (degree-heterogeneity) can provide significant improvements in query performance. For linear topologies, we use connections between random walks and electrical resistances to prove that placing uniformly a fraction of 4/5k cluster-heads (where 2k is the degree of each cluster-head), can reduce querying costs from ¿(n 2) to ¿(n 2/k 2), an improvement of ¿(k 2). For more realistic two-dimensional topologies, we use Markov chain analysis and simulations to show a similar trend--using about 10% of the nodes as cluster-heads provides a query cost improvement between 30% and 70% depending on the coverage of the high-degree nodes.
A Framework for Real-Time Service-Oriented Architecture
Authors: Mark Panahi, Weiran Nie, Kwei-Jay Lin
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Service-oriented architectures (SOA), thoughwidely accepted in a variety of industries, must be enhancedto support real-time activities in order to gain evengreater adoption.We present RT-Llama, a novel architecturefor real-time SOA to support predictability in businessprocesses. Based on a user-specified process and deadline,our architecture, containing global resource managementand business process composition components, can reserveresources in advance for each service in the process toensure it meets its end-to-end deadline. This is facilitatedby also creating a real-time enterprise middleware thatmanages utilization of local resources by using efficient datastructures and handles service requests via reserved CPUbandwidth. We demonstrate that RT-Llama’s reservationcomponents are both efficient and adaptable to dynamicreal-time environments.
Autonomous Navigation Based on a Novel Topological Map
Authors: Yanqing Wang, Deyun Chen, Chaoxia Shi
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

A novel topological map is proposed in this paper. By virtue of the topological map whose nodes are represented with the range finder’s free beams together with the visual scale-invariant features, the mobile robot can autonomously navigates in unknown, large-scale and indoor environments. Different from the traditional navigation methods that rely on accurate global localization, the robot locates itself imprecisely by location recognition rather than calculating its global pose in the world reference frame. By combining the reactive navigational method, BCM, with the topological map, a smooth, real-time navigation without global localization can be realized.
A Research in Using Particle Swarm to Optimize Da Qing's Industrial Structure of Agriculture
Authors: Zhang Hong, Meng Jun
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Direct against the question of the agricultural structure of Da Qing, this text have set up the optimization model of the sustainable agricultural structure of this area after integrated survey of economy, ecology, society to optimize the model, utilize particle swarm algorithms improved to optimize the model, have offered the theoretical foundation for dependemand of Da Qing. The investigation has certain theories meaning of direction and praxis valuable application with regard to study and enact reasonable efficiency regulate policy of estate structure current, certainly promote to develop of sustain and high-speed about agriculture and countryside economy and raise peasant's income.
Performance Analysis of Downlink Inter Cell Interference Coordination in the LTE-Advanced System
Authors: Sang Goo Kim, Kyongkuk Cho, Dongweon Yoon, Young-Jo Ko, Jae Kyun Kwon
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

In the LTE-Advanced system, cell edge User Equipments (UEs) are affected by interference signals transmitted from other cells. For this reason, an Inter Cell Interference Coordination (ICIC) technique is required. The goal of ICIC is to improve cell coverage and increase cell edge throughput. In this paper, through a system level simulation, we show the user throughput of each Multiple-Input Multiple-Output (MIMO) transmission mode according to ICIC algorithms, and analyze the practical effects of ICIC on the throughput performance of various MIMO modes.
Technology Research on Energy-Saving Transform of Exterior Wall of Existing Emporium Building in Handan
Authors: Chang-long Wang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

In order to research energy-saving transform of public building, six the large and medium-scale emporiums in Handan were selected as object. On the basis of investigation into typical department emporium, set an elementary model ofemporium building, made out the four different transform program to improve heat preservation of exterior wall, such as used double-layer window and added heat insulation layer and air-interstratified to exterior wall etc., and separately used the energy consumption of exterior walls and economic indicators for comparative study. According to the local climate characteristics, proposed an effective energy-saving measures for the exterior walls ofemporium building in Handan，provided the basis and reference on the energy-saving policy of existing the large and medium-scale public building.
E-Learning: The Strategies of Learning Culture and Arts
Authors: Chen-Wo Kuo, Jiann-Min Yang, Quo-Ping Lin, Maiga Chang
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Culture and arts could be very much of hi-tech. Taiwan government has announced that e-learning as the featured policy of Taiwan since 2003. Almost all culture and arts e-learning programs designed by Council for Cultural Affairs and National Palace Museum. Both of them have started e-learning programs and developed a series of e-learning courses in multiple languages, moreover, they keep update related art and literature knowledge which are embedded in the e-learning courses from year to year. The e-learning program of CCA and NPM offers the public opportunity to understand Chinese arts and culture virtually, furthermore, to learn the related knowledge about the collections online. This paper reveals the key issues of how CCA and NPM plan and runs the e-learning program and how this successful model can be apply to other culture organizations.
A Dynamic Model for Posttraumatic Stress Disorder Among U.S. Troops in Operation Iraqi Freedom
Authors: Michael P. Atkinson, Adam Guetz, Lawrence M. Wein
Venue: Management Science (2009)

We develop a dynamic model in which Operation Iraqi Freedom (OIF) servicemembers incur a random amount of combat stress during each month of deployment, develop posttraumatic stress disorder (PTSD) if their cumulative stress exceeds a servicemember-specific threshold, and then develop symptoms of PTSD after an additional time lag. Using Department of Defense deployment data and Mental Health Advisory Team PTSD survey data to calibrate the model, we predict that---because of the long time lags and the fact that some surveyed servicemembers experience additional combat after being surveyed---the fraction of Army soldiers and Marines who eventually suffer from PTSD will be approximately twice as large as in the raw survey data. We cannot put a confidence interval around this estimate, but there is considerable uncertainty (perhaps ±30%). The estimated PTSD rate translates into ≈300,000 PTSD cases among all Army soldiers and Marines in OIF, with ≈20,000 new cases each year the war is prolonged. The heterogeneity of threshold levels among servicemembers suggests that although multiple deployments raise an individual's risk of PTSD, in aggregate, multiple deployments lower the total number of PTSD cases by ≈30% relative to a hypothetical case in which the war was fought with many more servicemembers (i.e., a draft) deploying only once. The time lag dynamics suggest that, in aggregate, reserve servicemembers show symptoms ≈1--2 years before active servicemembers and predict that >75% of OIF servicemembers who self-reported symptoms during their second deployment were exposed to the PTSD-generating stress during their first deployment.
Dendritic Cell Trafficking: From Immunology to Engineering
Authors: Emma Hart, Despina Davoudani
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

The field of Artificial Immune Systems (AIS) has derived inspiration from many different elements of the natural immune system in order to develop engineered systems that operate in environments with constraints similar to those faced by the immune system [1]. A recent shift in thinking in AIS advocates developing a greater understanding of the underlying biological systems that serve as inspiration for engineering such systems by developing abstract computational models of the immune system in order to better understand the natural biology [2]. In this paper, we present results from a study in which agent-based modelling techniques were used to construct a model of dendritic-cell trafficking in the natural immune system with the aim of translating this model to an engineered system: a large-scale wireless sensor network. Our results highlight some generic issues which may arise when modelling biology with the intention of applying the results to AIS, rather than when modelling in order to replicate observed biological data. We suggest that the constraints of the engineered system must be considered when iterating the model, and that certain aspects of the biology may not be appropriate for the engineered system in question.
Adaptive Lip Feature Point Detection Algorithm for Real-Time Computer Vision-Based Smile Training System
Authors: Youngkyoon Jang, Woontack Woo
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

This paper presents an adaptive lip feature point detection algorithm for the proposed real-time smile training system using visual instructions. The proposed algorithm can detect a lip feature point irrespective of lip color with minimal user participation, such as drawing a line on a lip on the screen. Therefore, the proposed algorithm supports adaptive feature detection by real-time analysis for a color histogram. Moreover, we develop a supportive guide model as visual instructions for the target expression. By using the guide model, users can train their smile expression intuitively because they can easily identify the differences between their smile and target expression. We also allow users to experience the smile training system using the proposed methods and we evaluated the effectiveness of these methods through usability tests. As experimental results, the proposed algorithm for feature detection had 3.4 error pixels and we found that the proposed methods could be an effective approach for training smile expressions in real-time processing.
RETRACTED: The functional singular value decomposition for bivariate stochastic processes
Authors: Daniel Gervini
Venue: Computational Statistics Data Analysis (2010)

This article has been retracted at the request of the Editor-in-Chief with approval by the Co-Editors. Please see Elsevier Policy on Article Withdrawal (http://www.elsevier.com/locate/withdrawalpolicy). Reason: This article was submitted on January 26, 2009 to Computational Statistics and Data Analysis (CSDA) and the same paper was submitted on January 27, 2009 to Journal of Multivariate Analysis (JMVA). The paper was rejected by JMVA and after two revisions it was accepted by CSDA in July 2009. On November 17, 2009, the Editor-in-Chief was notified by one of the CSDA Associate Editors that the Associate Editor was aware that the paper was submitted to two journals around the same time. In response to an inquiry made by the Editor-in-Chief, the author indicated that he submitted it to two journals (JMVA and CSDA) to ensure prompt publication. One of the conditions of submission of a paper for publication is that authors declare explicitly that the paper is not under consideration for publication elsewhere. As such this article represents a severe abuse of the scientific publishing system. The scientific community takes a very strong view on this matter and we apologize to readers of the journal that this was not detected during the submission process. 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
The 'Joy-of-Use'-Button: Recording Pleasant Moments While Using a PC
Authors: Robert Schleicher, Sandra Trösterer
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

This paper describes the conceptualization and implementation of a free software tool to record positive moments while using a PC. The application runs in the background and is only visible as an icon in the system tray. Once called, the user is prompted to quantify the Joy-of-Use experience with a five-point rating which is saved together with a screenshot of the currently active window. The user can also mark areas in the screenshot that were relevant to the positive experience. In the advanced mode, the event can additionally be characterized by selecting typical aspects of such moments that were determined empirically, or by giving an own description in a free text field. A running version for Microsoft Windows XP and its source code are available online for other researchers and practitioners who wish to collect their own data on Joy-of-Use.
Socially embedded learning of the office-conversant mobile robot Jijo-2
Authors: Hideki Asoh, Satoru Hayamizu, Isao Hara, Yoichi Motomura, Shotaro Akaho, Toshihiro Matsui
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

This paper explores a newly developing direction of machine learning called "socially embedded learning". In this research we have been building an office-conversant mobile robot which autonomously moves around in an office environment, actively gathers information through close interaction with this environment including sensing multi-modal data and making dialog with people in the office, and acquires knowledge about the environment with which it ultimately becomes conversant. Here our major concerns are in how the close interaction between the learning system and its social environment can help or accelerate the systems learning process, and what kinds of prepared mechanisms are necessary for the emergence of such interactions. The office-conversant robot is a platform on which we implement our ideas and test their feasibility in a real-world setting. An overview of the system is given and two examples of implemented ideas, i.e. dialog-based map acquisition and route acquisition by following, are described in detail.