ppxscal/embedding_network huggingface dataset:
Stroma classification for neuroblastoma on graphics processors
Authors: Antonio Ruiz, Olcay Sertel, Manuel Ujaldon, Umit Catalyurek, Joel Saltz, Metin N. Gurcan
Venue: International Journal of Data Mining and Bioinformatics (2009)

Neuroblastoma is one of the most common childhood cancers. We are developing an image analysis system to assist pathologists in their prognosis. Since this system operates on relatively large-scale images and requires sophisticated algorithms, computerised analysis takes a long time to execute. In this paper, we propose a novel approach to benefit from high memory bandwidth and strong floating-point capabilities of graphics processing units. The proposed approach achieves a promising classification accuracy of 99.4&#37; and an execution performance with a gain factor up to 45 times compared to hand-optimised C&#43;&#43; code running on the CPU.
On Characterizations of Rigid Graphs in the Plane Using Spanning Trees: On Characterizations of Rigid Graphs in the Plane
Authors: Sergey Bereg
Venue: Graphs and Combinatorics (2009)

We study characterizations of generic rigid graphs and generic circuits in the plane using only few decompositions into spanning trees. Generic rigid graphs in the plane can be characterized by spanning tree decompositions [5,6]. A graph G with n vertices and 2n&#x00a0;&#x2212;&#x00a0;3 edges is generic rigid in the plane if and only if doubling any edge results in a graph which is the union of two spanning trees. This requires 2n&#x00a0;&#x2212;&#x00a0;3 decompositions into spanning trees. We show that n&#x00a0;&#x2212;&#x00a0;2 decompositions suffice: only edges of G&#x00a0;&#x2212;&#x00a0;T can be doubled where T is a spanning tree of G. A recent result on tensegrity frameworks by Recski [7] implies a characterization of generic circuits in the plane. A graph G with n vertices and 2n&#x00a0;&#x2212;&#x00a0;2 edges is a generic circuit in the plane if and only if replacing any edge of G by any (possibly new) edge results in a graph which is the union of two spanning trees. This requires $$(2n-2)({n\choose 2} - 1)+1$$decompositions into spanning trees. We show that 2n&#x00a0;&#x2212;&#x00a0;2 decompositions suffice. Let $$e_1,e_2,\ldots,e_{2n-2}$$be any circular order of edges of G (i.e. $$e_0 = e_{2n-2}$$). The graph G is a generic circuit in the plane if and only if $$G + e_i - e_{i-1}$$is the union of two spanning trees for any $$i = 1,2, \ldots, 2n-2$$. Furthermore, we show that only n decompositions into spanning trees suffice.
Multi-cost job routing and scheduling in Grid networks
Authors: T. Stevens, M. De Leenheer, C. Develder, B. Dhoedt, K. Christodoulopoulos, P. Kokkinos, E. Varvarigos
Venue: Future Generation Computer Systems (2009)

A key problem in Grid networks is how to efficiently manage the available infrastructure, in order to satisfy user requirements and maximize resource utilization. This is in large part influenced by the algorithms responsible for the routing of data and the scheduling of tasks. In this paper, we present several multi-cost algorithms for the joint scheduling of the communication and computation resources that will be used by a Grid task. We propose a multi-cost scheme of polynomial complexity that performs immediate reservations and selects the computation resource to execute the task and determines the path to route the input data. Furthermore, we introduce multi-cost algorithms that perform advance reservations and thus also find the starting times for the data transmission and the task execution. We initially present an optimal scheme of non-polynomial complexity and by appropriately pruning the set of candidate paths we also give a heuristic algorithm of polynomial complexity. Our performance results indicate that in a Grid network in which tasks are either CPU- or data-intensive (or both), it is beneficial for the scheduling algorithm to jointly consider the computational and communication problems. A comparison between immediate and advance reservation schemes shows the trade-offs with respect to task blocking probability, end-to-end delay and the complexity of the algorithms.
@Note: A workbench for Biomedical Text Mining
Authors: Anália Lourenço, Rafael Carreira, Sónia Carneiro, Paulo Maia, Daniel Glez-Peña, Florentino Fdez-Riverola, Eugénio C. Ferreira, Isabel Rocha, Miguel Rocha
Venue: Journal of Biomedical Informatics (2009)

Biomedical Text Mining (BioTM) is providing valuable approaches to the automated curation of scientific literature. However, most efforts have addressed the benchmarking of new algorithms rather than user operational needs. Bridging the gap between BioTM researchers and biologists' needs is crucial to solve real-world problems and promote further research. We present @Note, a platform for BioTM that aims at the effective translation of the advances between three distinct classes of users: biologists, text miners and software developers. Its main functional contributions are the ability to process abstracts and full-texts; an information retrieval module enabling PubMed search and journal crawling; a pre-processing module with PDF-to-text conversion, tokenisation and stopword removal; a semantic annotation schema; a lexicon-based annotator; a user-friendly annotation view that allows to correct annotations and a Text Mining Module supporting dataset preparation and algorithm evaluation. @Note improves the interoperability, modularity and flexibility when integrating in-home and open-source third-party components. Its component-based architecture allows the rapid development of new applications, emphasizing the principles of transparency and simplicity of use. Although it is still on-going, it has already allowed the development of applications that are currently being used.
Distinct-value synopses for multiset operations
Authors: Kevin Beyer, Rainer Gemulla, Peter J. Haas, Berthold Reinwald, Yannis Sismanis
Venue: Communications of the ACM (2009)

The task of estimating the number of distinct values (DVs) in a large dataset arises in a wide variety of settings in computer science and elsewhere. We provide DV estimation techniques for the case in which the dataset of interest is split into partitions. We create for each partition a synopsis that can be used to estimate the number of DVs in the partition. By combining and extending a number of results in the literature, we obtain both suitable synopses and DV estimators. The synopses can be created in parallel, and can be easily combined to yield synopses and DV estimates for "compound" partitions that are created from the base partitions via arbitrary multiset union, intersection, or difference operations. Our synopses can also handle deletions of individual partition elements. We prove that our DV estimators are unbiased, provide error bounds, and show how to select synopsis sizes in order to achieve a desired estimation accuracy. Experiments and theory indicate that our synopses and estimators lead to lower computational costs and more accurate DV estimates than previous approaches.
Plenary lecture 9: convergence of data management technologies: potential uses for digital ecosystems for collaborative intelligence analysis
Authors: Geoff Skinner
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

The first dimension of this presentation discusses the idea of a Digital Ecosystem. Since its first introduction in 2002, the newly emerging concept of Digital Ecosystem (DE) has received increasing attention from researchers, businesses, ICT professionals and communities around the world. The DE concept utilizes an open framework infrastructure to encourage a wide use of information in solving potential digital divide issues between collaborating entities. The DE objective is the promotion and dynamic formation of knowledge based economies that can be utilised by the various member entities of the DE. The second dimension of this presentation looks at a number of current issues the intelligence community is facing when it comes to effectively managing, or more precisely 'sharing' Intel (or intelligence and information). Recent global incidents and the subsequent actions responding to those events, including academic research has shown that intelligence analysis processes are lacking when it comes to the providing effective, efficient and complete information on required subjects. Reviews of many Intelligence Agencies have found a common theme in that there is an unacceptable and potentially dangerous lack of collaboration for sharing data within and between intelligence communities of the world. Hence, the third and key dimension of this talk looks at the potential for effectively implementing and utilising Digital Ecosystems for Collaborative Intelligence Analysis.
System optimization for peer-to-peer multi hop video broadcasting in wireless ad hoc networks
Authors: Volkan Dedeoglu, Cagdas Atici, Sibel Salman, M. Oguz Sunay
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

We consider peer-to-peer video broadcasting using cooperation among peers in an ad hoc wireless network. As opposed to the traditional single hop broadcasting, multiple hops cause an increase in broadcast video quality while creating interference and increasing transmission delay. We develop heuristics for the NP-complete problem of finding the subset of cooperating peers and the number of hops to maximize the data rate and to minimize the maximum observed delay in the system. Simulations show that using the proposed heuristics, different video sequences can be viewed at high qualities with acceptable delay among all peers.
Project Management for Information Systems, 5th edition
Authors: James Cadle, Donald Yeates
Venue:  (2007)

Cadle and Yeates' Project Management for Information Systems is suitable for undergraduate students studying Project Management within the IT environment. This comprehensive and practical book is an excellent starting point for any students of Project Management for Information Systems, whether they are from a computing or a business background, at undergraduate or masters level. The authors strike a good balance - covering both the mechanics of project management and the human factors involved and include plenty of case studies and exercises as well as good and bad examples from real life. This fifth edition has new material on: development life-cycles and approaches (including agile approaches) different types of IS projects and how to manage them implementing change through information systems updated coverage of leadership and management.
Movement curvature planning through force field internal models
Authors: Biljana Petreska, Aude Billard
Venue: Biological Cybernetics (2009)

Human motion studies have focused primarily on modeling straight point-to-point reaching movements. However, many goal-directed reaching movements, such as movements directed towards oneself, are not straight but rather follow highly curved trajectories. These movements are particularly interesting to study since they are essential in our everyday life, appear early in development and are routinely used to assess movement deficits following brain lesions. We argue that curved and straight-line reaching movements are generated by a unique neural controller and that the observed curvature of the movement is the result of an active control strategy that follows the geometry of one&#x2019;s body, for instance to avoid trajectories that would hit the body or yield postures close to the joint limits. We present a mathematical model that accounts for such an active control strategy and show that the model reproduces with high accuracy the kinematic features of human data during unconstrained reaching movements directed toward the head. The model consists of a nonlinear dynamical system with a single stable attractor at the target. Embodiment-related task constraints are expressed as a force field that acts on the dynamical system. Finally, we discuss the biological plausibility and neural correlates of the model&#x2019;s parameters and suggest that embodiment should be considered as a main cause for movement trajectory curvature.
An Orientation towards Social Interaction: Implications for Active Support
Authors: Maarten Overdijk, Wouter van Diggelen
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Collaborative technologies mediate participants' communicative interactions. Because interaction data is stored, it can be used for further analysis. This implies that collaborative technologies can be extended with models that analyse interaction data and provide participants with 'on the spot' information about their performance. These models are based on some formal analysis that aggregates interaction data into meaningful information. However, we state that such a model should not solely focus on the interaction between learners, but that a broader understanding of learner-technology interaction is a prerequisite for development of 'active' support. Moreover, research findings indicate that interaction rules are not stable, but arise and evolve during interaction. The active system should be able to transform data to useful information, and moreover, it has to deal with changes in the way that rules and resources govern users' actions and interactions. This paper presents an exploratory orientation towards learner-technology interaction from a social-conceptual perspective, and discusses some implications for active support.
Estimation of arm movement from the neural activities of the primary motor cortex
Authors: Kyuwan Choi, Hideaki Hirose, Yoshio Sakurai, Toshio Iijima, Yasuharu Koike
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

We succeeded in reconstructing muscle activities from neural activities and in reconstructing joint angles during static condition. However, the reconstructed joint angles during movement did not have a good correlation with the real joint angles. Therefore, we adopted a servo mechanism to compensate for the error in the joint angles. This error mainly arises due to muscle properties such as the velocity-tension relationship or the length-tension relationship. In order to overcome the limitations due to these muscle properties, we divided an artificial neural network into two networks-one for movement control and one for posture control. We also trained the gating network to switch between the two neural networks. As a result, the gating network switched the modules properly, and the accuracy of the estimated angles improved.
Greedy Algorithm for Construction of Partial Association Rules
Authors: Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko
Venue: Fundamenta Informaticae (2009)

Partial association rules can be used for representation of knowledge, for inference in expert systems, for construction of classifiers, and for filling missing values of attributes. This paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It is shown that under some natural assumptions on the class NP, a greedy algorithm is close to the best polynomial approximate algorithms for solving of this NP-hard problem. The paper contains various bounds on precision of the greedy algorithm, bounds on minimal length of rules based on an information obtained during the greedy algorithm work, and results of theoretical and experimental study of association rules for the most part of binary information systems.
euHeartDB: A Web-Enabled Database for Geometrical Models of the Heart
Authors: Daniele Gianni, Steve Mckeever, Nic Smith
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

Achieving patient specific treatments is of fundamental importance in the future provision of cost and patient effective health care services for cardiovascular diseases. Implementing this view requires that software and data are reused and shared over the investigation process and within each single process phase. Within the heart modeling and simulation phase, geometrical models can be reused and shared with interoperable markup languages and a central repository. A markup language has been recently proposed to describe such models whereas a repository is still needed. In this paper we introduce euHeartDB, a publicly accessible database that aims to satisfy this role by providing the functionalities to upload, to search and to integrate geometrical models. The database is web-enabled and allows the visualization of the models which functionality is fundamental to human users. In addition, euHeartDB uses the Foundational Model of Anatomy ontology to classify the models and to support semantic-based queries.
Educational Data Mining: a Case Study
Authors: Agathe Merceron, Kalina Yacef
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

In this paper, we show how using data mining algorithms can help discovering pedagogically relevant knowledge contained in databases obtained from Web-based educational systems. These findings can be used both to help teachers with managing their class, understand their students' learning and reflect on their teaching and to support learner reflection and provide proactive feedback to learners.
Information Nation: Seven Keys to Information Management Compliance, 2nd edition
Authors: Randolph Kahn, Barclay Blair
Venue:  (2009)

This fully updated edition demonstrates how businesses can succeed in creating a new culture of information management compliance (IMC) by incorporating an IMC philosophy into a corporate governance structure. Expert advice and insight reveals the proven methodology that adopts the principles, controls, and discipline upon which many corporate compliance programs are built and explains how to apply this methodology to develop and implement IMC programs that anticipate problems and take advantage of opportunities. Plus, youll learn how to measure information management compliance through the use of auditing and monitoring, following the proper delegation of program roles and components, and creating a culture of information management awareness.
The algorithm of obstacle avoidance based on improved fuzzy neural networks fusion for exploration vehicle
Authors: Shunming Li, Jianghui Xin, Weiyan Shang, Shen Huan, Wenqing Xiu
Venue: WSEAS Transactions on Systems and Control (2009)

In order to improve the vehicle steering stability, and avoid the obstacles fast and accurately, the fuzzy neural networks has been developed, in detail introduced this algorithm control principle. Advance control algorithm usually needs much more prior knowledge and depends on the accuracy model of process. However, fuzzy logic control technology is applied to control the plants having fuzzy, uncertainty, high-order, heavy lag without accurate mathematics model. The neural network has the advantage of self-learning, memory ability, fault-tolerant and parallel processing etc. The back propagation neural network was taken as framework, combining an improved fuzzy control algorithm, to realize the fuzzy-neural control of the exploration vehicle's navigation. It can use the improved fuzzy theory and neural networks together to form an improved fuzzy neural networks control system. So it can auto pick-up the fuzzy rule and build the subordinate function, it's self-organizing and self-learning the control knowledge which is needed for steering process and precise obstacle avoidance. The result of simulation analyses indicate that the method proposed in the paper can achieve safe and stability in steering control of obstacle avoidance of exploration vehicle.
Geographical location based RFID tracking system
Authors: Sungjun Kim, Doohyun Ko, Sunshin An
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

A large number of RFID system support location based service. This RFID Location System based on the general purposed geographic location code supports monitoring of the RFID tags in real time effectively. To identify the RFID tags, we allocate the general purposed geographic location code for each region. Throughout this system, the distribution and services related with RFID can easily manage the objects.
A Conceptual Model for Analysis Method of Extracting Unexpected Obstacles of Embedded Systems
Authors: Keiichi Katamine, Yasufumi Shinyashiki, Toshiro Mise, Masaaki Hashimoto, Naoyasu Ubayashi, Takako Nakatani
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

This paper proposes a conceptual model for analysis method of extracting unexpected obstacles in order to improve the quality of embedded systems. Although embedded software has become increasingly large in scale and complexity, companies are requiring the software to be developed with in shorter periods of time. This trend in the industry has resulted in the oversight of unexpected obstacles and consequently has affected the quality of embedded software. In order to prevent the oversight of unexpected obstacles, we have already proposed two methods for requirements analysis: the Embedded Systems Improving Method (ESIM) using an Analysis Matrix, and a method that uses an Information Flow Diagram (IFD). However, these analysis methods have been developed separately. This paper proposes the conceptual model including both methods, and clarifies abstraction mechanisms of expert engineers for extracting unexpected obstacles of embedded systems. It also describes a case study and discussion of the domain model.
Efficient Authorization in Delegation Chains with Strong Non-Repudiation
Authors: Richard W. C. Lui, S. M. Yiu, Lucas C. K. Hui
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

In an organization, it is a common practice for a user (the delegator) to delegate some rights, in particular the signing right, to another user (the delegate). From the perspective of digital signature, a secure scheme is required to handle the delegation process so that the authorization as well as the signature of the delegate can be verified efficiently. In general, delegation can occur more than one level, thus forming a delegation chain. Among the existing approaches, delegation certificate [1] is a popular technique for performing delegation and handling chained delegation. However, it is not scalable because the verification of authorization is inefficient. In this paper, we extend Kim et al.'s proxy signature [6], which only handles one level of delegation, to support efficient verification for a delegation chain. We first show that a straight-forward extension of Kim et al.'s scheme does not support strong non-repudiation. Wepropose a possible way to modify the scheme to support the property.
Run-time management of custom instructions on a partially reconfigurable architecture
Authors: Siew-Kei Lam, Huang Fan, Thambipillai Srikanthan, Wu Jigang
Venue: International Journal of Information and Communication Technology (2009)

Run-time reconfiguration can increase the cost efficiency and hardware specialisation of reconfigurable processors by dynamically changing the configuration of the reconfigurable logic to the required functionality. In this paper, we propose a scheme for managing the run-time reconfiguration of custom instructions on a partially reconfigurable architecture that incorporates multi-bit logic blocks. The proposed scheme relies on the dynamic execution profile to replace the functionality of the logic blocks with the goal of minimising the overall reconfiguration overhead. Experimental results show that the proposed scheme for run-time customisation can lead to an average speedup of three times and average area savings of over 30&#37; when compared to a method that relies on compile-time customisation.