ppxscal/embedding_network huggingface dataset:
Correlation between potato yield and MODIS-derived vegetation indices
Authors: S. K. Bala, A. S. Islam
Venue: International Journal of Remote Sensing (2009)

Monitoring of crop growth and forecasting its yield well before harvest is very important for crop and food management. Remote sensing images are capable of identifying crop health, as well as predicting its yield. Vegetation indices (VIs), such as the normalized difference vegetation index (NDVI), leaf area index (LAI) and fraction of photosynthetically active radiation (fPAR) calculated from remotely sensed data have been widely used to monitor crop growth and to predict crop yield. This study used 8 day TERRA MODIS reflectance data of 500 m resolution for the years 2005 to 2006 to estimate the yield of potato in the Munshiganj area of Bangladesh. The satellite data has been validated using ground truth data from fields of 50 farmers. Regression models are developed between VIs and field level potato yield for six administrative units of Munshiganj District. The yield prediction equations have high coefficients of correlation (R 2) and are 0.84, 0.72 and 0.80 for the NDVI, LAI and fPAR, respectively. These equations were validated by using data from 2006 to 2007 seasons and found that an average error of estimation is about 15% for the study region. It can be concluded that VIs derived from remote sensing can be an effective tool for early estimation of potato yield.
Adaptive CMAC neural control of chaotic systems with a PI-type learning algorithm
Authors: Chun-Fei Hsu, Chao-Ming Chung, Chih-Min Lin, Chia-Yu Hsu
Venue: Expert Systems with Applications: An International Journal (2009)

The cerebellar model articulation controller (CMAC) has the advantages such as fast learning property, good generalization capability and information storing ability. Based on these advantages, this paper proposes an adaptive CMAC neural control (ACNC) system with a PI-type learning algorithm and applies it to control the chaotic systems. The ACNC system is composed of an adaptive CMAC and a compensation controller. Adaptive CMAC is used to mimic an ideal controller and the compensation controller is designed to dispel the approximation error between adaptive CMAC and ideal controller. Based on the Lyapunov stability theorems, the designed ACNC feedback control system is guaranteed to be uniformly ultimately bounded. Finally, the ACNC system is applied to control two chaotic systems, a Genesio chaotic system and a Duffing-Holmes chaotic system. Simulation results verify that the proposed ACNC system with a PI-type learning algorithm can achieve better control performance than other control methods.
OntoComP: A Protégé Plugin for Completing OWL Ontologies
Authors: Barış Sertkaya
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

We describe OntoComP, a Protégé4 plugin that supports ontology engineers in completing OWL ontologies. More precisely, OntoComPsupports an ontology engineer in checking whether an ontology contains all the relevant information about the application domain, and in extending the ontology appropriately if this is not the case. It acquires complete knowledge about the application domain efficiently by asking successive questions to the ontology engineer. By using novel techniques from Formal Concept Analysis, it ensures that, on the one hand, the interaction with the ontology engineer is kept to a minimum, and, on the other hand, the resulting ontology is complete in a certain well-defined sense.
Rotational stability of femoral osteosynthesis in femoral fractures - Navigated measurements
Authors: Mustafa Citak, Daniel Kendoff, Michael J. Gardner, Markus Oszwald, Padhraig F. O'Loughlin, Lucien C. Olivier, Christian Krettek, Tobias Hüfner, Musa Citak
Venue: Technology and Health Care (2009)

Rotational malalignment after intramedullary nailing of femoral fractures is common, and symptoms occur when malrotation reaches 15&deg;. Intraoperative measurement of rotation remains difficult, and multiple techniques have been described to address this. Regardless of the method used, rotational toggling may occur between the interlocking screws and the screw holes. We hypothesized that a clinically significant amount of rotation may occur with standard statically locked intramedullary nails. Mid-shaft diaphyseal fractures were created in 24 cadaveric femurs. Specimens were divided into 4 groups, and were stabilized with a statically locked intramedullary nail, a dynamically locked intramedullary nail, a compression plate, and a locking plate. Six additional femurs were kept intact as a control group. Specimens were mounted in a custom holding jig, which stabilized the constructs proximally and allowed free rotation distally. A computer navigation system was applied, and the femoral anteversion was measured. 4 N-m of internal and external torque was applied, and the change in version was measured. The statically locked nails rotated 14.2&deg;, and the dynamically locked group rotated 15.7&deg;. Both intramedullary nail groups showed significantly greater rotation than the plated groups. The compression plate specimens rotated 6.5&deg; on average, and the locked plate group rotated 3.8&deg;. Intramedullary femoral nailing with static or dynamic interlocking allows 15&deg; of rotation of the femur around the nail under physiologic load. This may exacerbate intraoperative errors in determining and setting rotation. Angular stable plates or nails may minimize this problem.
Overvoltage protective device and method of overvoltage protection
Authors: Hitoshi Kijima
Venue: Proceedings of the 8th WSEAS international conference on Electronics, hardware, wireless and optical communication (2009)

Overvoltage protective devices are used for protecting apparatuses against overvoltage or overcurrent caused by lightning surge. Overvoltage protective components are mainly divided into two categories. One is clamping type and the other is switching type. Typical clamping type overvoltage protective components are varistors and diodes. Typical switching type overvoltage protective components are gas-filled discharge tubes and air gaps. Both clamping type and switching type overvoltage protective components have problems when using them alone. This paper proposes a new technology consisting of both clamping type and switching type overvoltage protective components in order to solve the problems of them. It is that three or more switching type components are connected in series and two or more clamping type overvoltage protective components are connected in parallel. Problems of both them can simultaneously be solved by reducing the maximum voltage with high response time and high current capability, and so on.
Research and Practical Issues of Enterprise Information Systems IIVolume 2: IFIP TC 8 WG 8.9 International Conference on Research and Practical Issues, 1st edition
Authors: Li Xu, Li Xu, A. Min Tjoa, Sohail Chaudhry
Venue:  (2007)

International Federation for Information Processing The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of referred international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing.
Route in Mobile WSN and Get Self-deployment for Free
Authors: Kévin Huguenin, Anne-Marie Kermarrec, Eric Fleury
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

We consider a system consisting of a set of mobile sensors. They are disseminated in a region of interest and their mobility is controlled (as opposed to mobility imposed by the entity on which they are embedded). A routing protocol in this context enables any point of the region to be reached starting from any node, regardless of the initial sensor deployment. This operation involves message forwarding and/or sensor motion. In this paper we present Grasp, a GReedy stAteless Routing Protocol for mobile wireless sensor networks (WSN). Grasp is simple and independent from the underlying communication model, but still provides results close to the optimal, with respect to the self-deployment of sensors over a given region. It ensures that (i) routing is always possible in a mobile WSN irrespective of the number of sensors, and (ii) above a given number of sensors in a considered zone the protocol eventually enables the routing to no longer require sensors to move, which yields to self-deployment. With Grasp, sensors autonomously reach a stable full coverage following geometrical patterns. This requires only 1.5 times the optimal number of sensors to cover a region. A theoretical analysis of convergence proves these properties. Simulation results matching the analysis are also presented.
Mediation in the framework of morpho-logic
Authors: Isabelle Bloch, Ramón Pino-Pérez, Carlos Uzcátegui
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

In this paper we introduce a median operator between two sets of interpretations (worlds) in a finite propositional language. Our definition is based on morphological operations and Hausdorff distance. It provides a result which lies “halfway” between both sets and accounts for the “extension” or “shape” of the sets. We prove several interesting properties of this operator and compare it with fusion operators. This new operator allows performing mediation between two sets of beliefs, preferences, demands, in an original way, showing an interesting behavior that was not possible to achieve using existing operators.
Solving the Response Time Variability Problem by means of metaheuristics
Authors: Alberto García, Rafael Pastor, Albert Corominas
Venue: Proceeding of the 2006 conference on Artificial Intelligence Research and Development (2006)

The Response Time Variability Problem (RTVP) is a combinatorial NP-hard problem which has a wide range of real-life applications. It has recently appeared in the literature and has therefore not been widely discussed to date. The RTVP has been solved in other works by mixed integer linear programming (for small instances) and heuristics, but metaheuristic procedures have not previously been used. In this paper, a solution to the RTVP by means of multi-start, GRASP and PSO procedures is proposed. We report on our computational experiments and draw conclusions.
An integrated decision support environment for organisational decision making
Authors: Shaofeng Liu, Alex H. B. Duffy, Robert Ian Whitfield, Iain M. Boyle
Venue: Proceeding of the 2008 conference on Collaborative Decision Making: Perspectives and Challenges (2008)

Traditional decision support systems are based on the paradigm of a single decision maker working at a stand-alone computer or terminal who has a specific decision to make with a specific goal in mind. Organisational decision support systems aim to support decision makers at all levels of an organisation (from executive, middle management managers to operators), who have a variety of decisions to make, with different priorities, often in a distributed environment. Such systems are designed and developed with extra functionality to meet the challenge. This paper proposes an Integrated Decision Support Environment (IDSE) for organisational decision making. The IDSE is designed and developed based on distributed client/server networking, with a combination of tight and loose integration approaches for information exchange and communication. The prototype of the IDSE demonstrates a good balance between flexibility and reliability.
Unsupervised search-based structured prediction
Authors: Hal Daumé,  III
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We describe an adaptation and application of a search-based structured prediction algorithm "Searn" to unsupervised learning problems. We show that it is possible to reduce unsupervised learning to supervised learning and demonstrate a high-quality un-supervised shift-reduce parsing model. We additionally show a close connection between unsupervised Searn and expectation maximization. Finally, we demonstrate the efficacy of a semi-supervised extension. The key idea that enables this is an application of the predict-self idea for unsupervised learning.
A Study on the Short-Term Prohibition Mechanisms in Tabu Search
Authors: Luca Di Gaspero, Marco Chiarandini, Andrea Schaerf
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Tabu Search (TS) is a well known local search method which has been widely used for solving AI problems. Different versions of TS have been proposed in the literature, and many features of TS have been considered and tested experimentally. The feature that is present in almost all TS variants is the so called (short-term) tabu list which is recognised as the crucial issue of TS. However, the definition of the parameters associated with the tabu list remains in most TS applications still a handcrafted activity. In this work we undertake a systematic study of the relative influence of few relevant tabu list features on the performances of TS solvers. In particular, we apply statistical methods for the design and analysis of experiments. The study focuses on a fundamental theoretical problem (GRAPH COLOURING) and on one of its practical specialisation (EXAMINATION TIMETABLING), which involves specific constraints and objectives. The goal is to determine which TS features are more critical for the good performance of TS in a general context of applicability. The general result is that, when the quantitative parameters are well tuned, the differences with respect to qualitative parameters become less evident.
Chaos Cultural Particle Swarm Optimization and Its Application
Authors: Ying Wang, Jianzhong Zhou, Youlin Lu, Hui Qin, Yongchuan Zhang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

A new version of the classical particle swarm optimization (PSO), namely, Chaos culture particle swam optimization (CCPSO), is proposed to overcome the shortcoming of the premature of the classical PSO. The proposed algorithm integrates PSO with the framework of cultural algorithm model. PSO is utilized as the evolution method of population space. Meanwhile, the chaotic search operator is imported to build the knowledge structure of belief space, with which guiding the evolution process of the proposed algorithm, moving particles to the global optimal solution can be more effective. Then, the proposed algorithm is tested with typical test functions. The result shows that the global searching ability of CCPSO is better than that of PSO. In the last part of the paper, CCPSO was applied to the optimal operation of cascade hydropower station. The operation result shows the feasibility and high efficiency of the proposed algorithm, while compared with tradition method, CCPSO is faster and has the higher precision. Therefore a new method is proposed.
Fuzzy usability evaluation of information systems in public administration
Authors: Miloslav Hub, Michal Zatloukal
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

This paper deals with the problem of evaluating a usability of information systems in public administration based on a theory of fuzzy sets. For such purpose, a completely new methodology has been created. The evaluation of the model is based on a set of criteria that synthesizes commonly used Web usability guidelines. Together with the model, Fuzzy Usability Evaluator - the application that is able to operate with the vague nature of evaluating has been developed. While the inputs are fuzzy measures, the output of the model is a crisp value representing an overall usability score of the Web portals in Public administration.
State-space exploration for concurrent algorithms under weak memory orderings: (preliminary version)
Authors: Bengt Jonsson
Venue: ACM SIGARCH Computer Architecture News (2009)

Several concurrent implementations of familiar data abstractions such as queues, sets, or maps typically do not follow locking disciplines, and often use lock-free synchronization to gain performance. Since such algorithms are exposed to a weak memory model, they are notoriously hard to get correct, as witnessed by many bugs found in published algorithmsWe outline a technique for analyzing correctness of concurrent algorithms under weak memory models, in which a model checker is used to search for correctness violations. The algorithm to be analyzed is transformed into a form where statements may be reordered according to a particular weak memory ordering. The transformed algorithm can then be analyzed by a model-checking tool, e.g., by enumerative state exploration. We illustrate the approach on a small example of a queue, which allows an enqueue operation to be concurrent with a dequeue operation, which we analyze with respect to the RMO memory model defined in SPARC v9.
Enterprise Financial Status Synthetic Evaluation Based on Fuzzy Rough Set Theory
Authors: Ming-Chang Lee, Jui-Fang Chang
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Enterprise financial status synthetic evaluation is an important issue. The weight of synthesis evaluation is determined by expert, lending to subjectivity and without considering the redundancy of attributes exists in traditional synthetic evaluation. Recently, an attempt of integration between the theories of fuzzy set and rough sets has resulted in providing a roughness measure for fuzzy sets. Therefore, in this study, we firstly define the attribute reduction based on rough set theory. Secondly, we create membership function of each attributes. Using membership function, we can easily create the judgment matrix. Thirdly, we discuss the weight of attribute and measure of information. Finally, the methods of the synthesis evaluation are present with an example.
Refactoring corpora
Authors: Helen L. Johnson, William A. Baumgartner,  Jr., Martin Krallinger, K. Bretonnel Cohen, Lawrence Hunter
Venue: Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis (2006)

We describe a pilot project in semiautomatically refactoring a biomedical corpus. The total time expended was just over three person-weeks, suggesting that this is a cost-efficient process. The refactored corpus is available for download at http://bionlp.sourceforge.net.
QuickSelect: history-based selection expansion
Authors: Sara L. Su, Sylvain Paris, Frédo Durand
Venue: Proceedings of Graphics Interface 2009 (2009)

When editing a graphical document, it is common to apply a change to multiple items at once, and a variety of tools exist for selecting sets of items. However, directly selecting large sets can sometimes be cumbersome and repetitive. We propose a method for helping users reuse complex selections by expanding the set of currently selected items. We analyze a document's operation history to determine which items have been frequently edited together. When the user requests it, items that have been previously edited with the current selection can be added to it. The new selection can then be manipulated like any other selection. This approach does not require a semantic model of the document or relations between items. Rather, each expansion is based on what the user has done so far to create the document. We demonstrate this approach in the context of vector graphics editing. Results from a pilot study were encouraging. Reusing selections with pre-existing histories, users were more efficient at editing tasks with our QuickSelect tool. Subjective preferences from a usability study in a free drawing context indicate that selection expansion is easy for users to learn and to apply.
Atomic Dynamic Bayesian Networks for a Responsive Student Model
Authors: Fang Wei, Glenn D. Blank
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Atomic Dynamic Bayesian Networks (ADBNs) combine several valuable features in student models: students' performance history, prerequisite relationships, concept to solution step relationships, and student real time responsiveness. Recent work addresses some of these features but has not combined them. Such a combination is needed in an ITS that helps students learn, step by step, in a complex domain, such as object-oriented design. We evaluated ADBN-based student models 49 human students, investigating their behavior for different types of students and different slip and guess values. Holding slip and guess to equal, small values, ADBNs are able to produce accurate diagnostic rates for knowledge states over each student's learning history.
Designing Domain Work Breakdown Structure (DWBS) Using Neural Networks
Authors: Yongjun Bai, Yong Zhao, Yang Chen, Lu Chen
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

Work breakdown structures are the basis of project management. But there are few researches on the methods or tools to design work breakdown structures effectively. In this paper, a framework which employs neural networks to plan the work breakdown structures has been introduced. The main concepts, including domain tree structure(DTS), domain work breakdown structure(DWBS) and relational work breakdown structure(RWBS), have used to form the outputs of the model. The nature of projects, which have been represented by a limited set of attributes, are considered as the main inputs of the model. Since the work breakdown structure is a hierarchical structure, DWBS has been broken into levels to reduce the complexity of reasoning and calculation. In addition, to make sure the result WBS is optimized and can be mapped into other WBSs effectively, Axiomatic Design Theory was used to verify the RWBSs at each level.
Predicting Students' Performance with SimStudent: Learning Cognitive Skills from Observation
Authors: Noboru Matsuda, William W. Cohen, Jonathan Sewall, Gustavo Lacerda, Kenneth R. Koedinger
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

SimStudent is a machine-learning agent that learns cognitive skills by demonstration. SimStudent was originally built as a building block for Cognitive Tutor Authoring Tools to help an author build a cognitive model without significant programming. In this paper, we evaluate a second use of SimStudent, viz., student modeling for Intelligent Tutoring Systems. The basic idea is to have SimStudent observe human students solving problems. It then creates a cognitive model that can replicate the students' performance. If the model is accurate, it would predict the human students' performance on novel problems. An evaluation study showed that when trained on 15 problems, SimStudent accurately predicted the human students' correct behavior on the novel problems more than 80% of the time. However, the current implementation of SimStudent does not accurately predict when the human students make errors.