ppxscal/embedding_network huggingface dataset:
Intelligent risk management tools for software development
Authors: John Dhlamini, Isaai Nhamu, Admire Kaihepa
Venue: Proceedings of the 2009 Annual Conference of the Southern African Computer Lecturers' Association (2009)

Software tools have been used in software development for a long time now. They are used for, among other things, performance analysis, testing and verification, debugging and building applications. Software tools can be very simple and lightweight, e.g. linkers, or very large and complex, e.g. computer-assisted software engineering (CASE) tools and integrated development environments (IDEs). Some tools support particular phases of the project cycle while others can be used with a speicfic software development model or technology. Some aspects of software development, like risk management, are done throughout the whole project from inception to commissioning. The aim of this paper is to demonstrate the need for an intelligent risk assessment and management tool for both agile or traditional (or their combination) methods in software development. The authors propose a model, whose development is subject of further research, which can be investigated for use in developing intelligent risk management tools
A thin mobile client for a groupware application
Authors: Kiran Madala, Ivan Tomek, Elhadi Shakshuki, Rick Giles
Venue: Proceeding of the 2006 conference on Cooperative Systems Design: Seamless Integration of Artifacts and Conversations -- Enhanced Concepts of Infrastructure for Communication (2006)

Until recently, desktop clients were sufficient platforms for running groupware. The dramatic increase in the use of mobile devices, user mobility and the growth of sophistication of device resources now requires the exploration of alternative clients running on devices such as PDAs and mobile phones. This paper describes our exploration of a BlackBerry thin client for an open source groupware application called the Collaborative Virtual Workspace (CVW). It outlines our development process and implementation and the challenges that we encountered, and outlines our plans for future work.
Xl: a communication-efficient routing algorithm
Authors: Ramamohan Paturi, Stefan Savage
Venue:  (2008)

We describe and analyze a new communication-efficient routing algorithm for packet forwarding networks such as the Internet. The explicit design objective of our routing algorithm, called XL, is to reduce the communication overhead of routing, allowing the routing algorithm to support larger networks without resorting to artificial network partitioning techniques such as OSPF areas. We achieve this by allowing suboptimal forwarding paths up to a user-specified stretch factor. (By setting stretch to 1 it is also possible to force optimal routing.) The XL routing algorithm is a link state algorithm, meaning that network nodes disseminate information about the state of links in the network. The essential difference between XL and the classical link state algorithm used by OSPF and IS-IS is in the semantics of link state updates: in the classical algorithm, a link state update specifies the exact link cost, while in XL it specifies an upper bound on the actual cost. This allows XL to suppress updates when the route cost do not decrease significantly. In addition to the formal specification and correctness proof, we also compare XL to four existing routing algorithms in simulation. Two of these algorithms are the classical distance vector algorithm and the link state algorithm which are the basis of the RIP and OSPF routing protocols, respectively. The other two are state-of-the art experimental protocols: distance vector with parent pointer, and the link vector algorithm, both based on the idea of restricting updates to those about links in a node's shortest-path tree. Experimental results show that our algorithm consistently generates fewer updates in response to network changes, in some cases by nearly an order of magnitude.
Solving the RCPSP/max Problem by the Team of Agents
Authors: Piotr Jedrzejowicz, Ewa Ratajczak-Ropel
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

The paper proposes an agent-based approach to solving instances of the resource constrained project scheduling problem with minimal and maximal time lags (time windows). Since the problem is known to be NP-hard, the proposed solution takes advantage of the parallel and distributed computations abilities of the E-JABAT which is a middleware supporting the construction of the dedicated A-Team architectures based on the population-based approach. In this paper the E-JABAT-based A-Team architecture dedicated for solving the RCPSP/max problem instances is proposed and experimentally validated. The paper contains the RCPSP/max problem formulation, overview of the E-JABAT environment, a detailed description of the E-JABAT architecture implemented for solving the RCPSP/max problem instances and a discussion of the computational experiment results.
Tools for Text Mining over Biomedical Literature
Authors: Fabio Rinaldi, Gerold Schneider, Kaarel Kaljurand, Michael Hess
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)

This poster describes OntoGene: an environment, based on a deep-linguistic parser, aimed at supporting the process of Text Mining from Biomedical Scientific Literature. We will illustrate in particular the Relation Extraction component and the development support facilities.
Brief paper: Passive stability and synchronization of complex spatio-temporal switching networks with time delays
Authors: Jing Yao, Hua O. Wang, Zhi-Hong Guan, Weisheng Xu
Venue: Automatica (Journal of IFAC) (2009)

In this paper, a new model of complex spatio-temporal switching network is established. Each subsystem of the network at a different time interval corresponds to a different switching mode. Switching the signal depends on both the instant time t and the index of node i. Based on passivity property, the passive stability and synchronization of this kind of network with time delays are taken into account. An example and simulation results are included.
Stochastic methods for l1 regularized loss minimization
Authors: Shai Shalev-Shwartz, Ambuj Tewari
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We describe and analyze two stochastic methods for l1 regularized loss minimization problems, such as the Lasso. The first method updates the weight of a single feature at each iteration while the second method updates the entire weight vector but only uses a single training example at each iteration. In both methods, the choice of feature/example is uniformly at random. Our theoretical runtime analysis suggests that the stochastic methods should outperform state-of-the-art deterministic approaches, including their deterministic counterparts, when the size of the problem is large. We demonstrate the advantage of stochastic methods by experimenting with synthetic and natural data sets.
Quantitative Tool for the Assessment of Myocardial Perfusion during X-Ray Angiographic Procedures
Authors: Jean Liénard, Régis Vaillant
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

During interventional procedures, cardiologists revascularize the ischemic heart by opening occluded arteries. Patency of the artery is assessed by selective injection of dye. Reperfusion of the myocardium is more difficult to estimate in the dim signal produced by the contrast agent in the microcirculation. Some researchers [1-2] have proposed and studied qualitative evaluations based on the observation of contrast appearance and wash-out in the heart muscle. In this paper, we describe a set of tools designed to assist the cardiologist in the assessment of myocardial perfusion. First, we apply synchronized subtraction in order to enhance the tissue opacification by removing the background. Secondly, to quantify the microcirculation temporal behavior, we compute time-density curves normalized with respect to the injection characteristics. Thirdly, we create parametric images that summarize in a single picture the dynamic information directly usable in the interventional setting.
Energy Efficient and Scalable Search in Dense Wireless Sensor Networks
Authors: Kiran K. Rachuri, C. Siva Ram Murthy
Venue: IEEE Transactions on Computers (2009)

In this paper, we consider the problem of information discovery in a densely deployed Wireless Sensor Network (WSN), where the initiator of search is unaware of the location of target information. We propose two protocols: Increasing Ray Search (IRS), an energy efficient and scalable search protocol, and k-IRS, an enhanced variant of IRS. The priority of IRS is energy efficiency and sacrifices latency whereas k-IRS is configurable in terms of energy-latency trade-off and this flexibility makes it applicable to varied application scenarios. The basic principle of these protocols is to route the search packet along a set of trajectories called rays that maximizes the likelihood of discovering the target information by consuming least amount of energy. The rays are organized such that if the search packet travels along all these rays, then the entire terrain area will be covered by its transmissions while minimizing the overlap of these transmissions. In this way, only a subset of total sensor nodes transmits the search packet to cover the entire terrain area while others listen. We believe that query resolution based on the principles of area coverage provides a new dimension for conquering the scale of WSN. We compare IRS and k-IRS with existing query resolution techniques for unknown target location such as Expanding Ring Search (ERS), Random walk search, and variants of Gossip search. We show by analysis, simulation, and implementation in testbed that IRS and k-IRS are highly scalable, the cost of search (total number of transmitted bytes) is independent of node density, and it is much lower than that of existing proposals under high node density.
Learning Tutorial Rules Using Classification Based On Associations
Authors: Xin Lu, Barbara Di Eugenio, Stellan Ohlsson
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Rules have been showed to be appropriate representations to model tutoring and can be easily applied to intelligent tutoring systems. We applied a machine learning technique, Classification based on Associations, to automatically learn tutorial rules from annotated tutoring dialogues of a human expert tutor. The rules we learn concern the tutor's attitude, the domain concepts to focus on, and the tutor moves. These rules have very good accuracy. They will be incorporated in the feedback generator of an Intelligent Tutoring System.
Virtual automated system for DC voltage calibration of a DMM
Authors: Vladislav Slavov, Tasho Tashev
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

This paper describes the creation of a calibrator-digital multimeter system for calibration based on Lab View. The virtual approach was applied as a result of the modernization not only in the educational process but also in calibrating laboratories. The purpose of the experiment described in this paper is to show the principles and to propose algorithms for creating a DC voltage DMM automated calibration system when the developer has to create his own application using virtual instruments methods.
Guest Editors' Introduction: Smarter Phones
Authors: James A. Landay, Anthony D. Joseph, Franklin Reynolds
Venue: IEEE Pervasive Computing (2009)

Mobile phones tend to be very personal devices. It's this property, as much as anything, that makes them so interesting to pervasive computing and offers the potential to enable whole new classes of adaptive, context-aware applications. This special issue's articles offer new architectures, tools, and applications that point the way to this exciting future of smarter phones.
Evolution of functional specialization in a morphologically homogeneous robot
Authors: Joshua Auerbach, Josh C. Bongard
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

A central tenet of embodied artificial intelligence is that intelligent behavior arises out of the coupled dynamics between an agent's body, brain and environment. It follows that the complexity of an agents's controller and morphology must match the complexity of a given task. However, more complex task environments require the agent to exhibit different behaviors, which raises the question as to how to distribute responsibility for these behaviors across the agents's controller and morphology. In this work a robot is trained to locomote and manipulate an object, but the assumption of functional specialization is relaxed: the robot has a segmented body plan in which the front segment may participate in locomotion and object manipulation, or it may specialize to only participate in object manipulation. In this way, selection pressure dictates the presence and degree of functional specialization rather than such specialization being enforced a priori. It is shown that for the given task, evolution tends to produce functionally specialized controllers, even though successful generalized controllers can also be evolved. Moreover, the robot's initial conditions and training order have little effect on the frequency of finding specialized controllers, while the inclusion of additional proprioceptive feedback increases this frequency.
Towards OpenMP Execution on Software Distributed Shared Memory Systems
Authors: Ayon Basumallik, Seung-Jai Min, Rudolf Eigenmann
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

In this paper, we examine some of the challenges present in providing support for OpenMP applications on a Software Distributed Shared Memory(DSM) based cluster system. We present detailed measurements of the performance characteristics of realistic OpenMP applications from the SPEC OMP2001 benchmarks. Based on these measurements, we discuss application and system characteristics that impede the efficient execution of these programs on a Software DSM system. We point out pitfalls of a naive translation approach from OpenMP into the API provided by a Software DSM system, and we discuss a set of possible program optimization techniques.
Knowledge production and integration for diagnosis, treatment and prognosis in medicine
Authors: John A. Bohada, David Riaòo
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

Diagnosis, treatment and prognosis are three of the most frequent labours of physician in health care institutions. In decision making, these activities can be tackled from two approaches: decision and planning. Decision structures are designed to help physician in their task of taking atemporal decisions. Planning structures are designed to guide physicians in the time-dependant complex medical procedures. The goal of this article is to present a model that integrates several learning tools to develop decision and planning structures in the medical domain, specifically in the support of decision making.
Analogy Based Cost Estimation Configuration with Rules
Authors: Stamatia Bibi, Ioannis Stamelos
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Analogy-based estimation is a widely adopted method in software cost estimation that identifies analogous projects to the one under estimation and uses their data to derive an estimate, i.e. it is a Case Based Reasoning approach. The similarity measures between pairs of projects are critical for identifying the most appropriate historical data from which the estimation will be generated. Usually the similarity measures are selected empirically, using jackknife-like procedures. Typically, the measures that identify the most similar projects in most of the cases are considered the most appropriate ones and are applied in every new estimation procedure. However there are situations that the default similarity measures may not be the most appropriate ones. In this study we determine the situations in which the default parameters are not the best and we propose the similarity measures for these cases. In particular we provide rules that point out which projects are not accurately estimated with the default parameters.
Parallax cues in the design of graphics used in technical education to illustrate complex spatial problems
Authors: Santiago Martín, Ramón Rubio
Venue: Computers Education (2009)

The explanation of certain 3D concepts is based on 2D drawings. These drawings should contain certain depth cues, such as perspective and overlapping. Until recently, parallax has not been used as a depth cue. Nevertheless, new technologies allow it to be incorporated. This forms the background to our study of the design of interactive educational resources and stereoscopic graphics. The results obtained demonstrate that (1) the use of parallax cues improves the interpretation of the figures and (2) that the assistance they afford is most appreciated by the students with less highly developed spatial perception.
Identifying experimental techniques in biomedical literature
Authors: Meeta Oberoi, Craig A. Struble, Sonia Sugg
Venue: Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis (2006)

Named entity recognition of gene names, protein names, cell-lines, and other biologically relevant concepts has received significant attention by the research community. In this work, we considered named entity recognition of experimental techniques in biomedical articles. In our system to mine gene and disease associations, each association is categorized by the techniques used to derive the association. Categories are used to weight or remove associations, such as removing associations derived from microarray experiments.
Sr excess accommodation in ALD grown SrTiO3 and its impact on the dielectric response
Authors: S. Clima, G. Pourtois, N. Menou, M. Popovici, A. Rothschild, B. Kaczer, S. Van Elshocht, X. P. Wang, J. Swerts, D. Pierreux, S. De Gendt, D. J. Wouters, J. A. Kittl
Venue: Microelectronic Engineering (2009)

A first-principles Density Functional Theory (DFT) approach was employed to predict the effective charges, phonon modes, band-gap and dielectric constant of a series of Sr-rich SrTiO"3. The fabricated MIM capacitors confirm the theoretical trends obtained for the dielectric constants, the later showing a possible upper limit of the dielectric response.
A-Team Middleware on a Cluster
Authors: Ireneusz Czarnowski, Piotr Jedrzejowicz, Izabela Wierzbowska
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

JABAT (Jade-based A-Team) is a middleware that allows to design and implement multiagent architectures for solving combinatorial optimization problem. So far JABAT has been implemented in environments of local/global networks, in which the users were able to adjoin computer to the system for the work of the system's agents.The paper describes implementation of the middleware called JABAT (JADE-based A-Team) on a cluster of computers at the TASK Academic Computer Centre. It also presents the results of first tests carried out in this new environment.
Developing an Autonomic System Engineering Testbed Using Virtualization - Virtualization of Operating Systems
Authors: Tarek Al-Bagikni
Venue:  (2007)

This thesis is on developing an Autonomic System Engineering testbed using operating-system-level virtualization technologies. The ASE testbed is a basis on which autonomic applications are to be developed, experimented with, and demonstrated. The thesis identifies and examines different virtualization concepts and technologies. Various solutions are compared, measured and benchmarked in order to find out, which product can be adapted best to and deployed for the ASE testbed. Finally, based on the virtualization measurements taken, the realization of the ASE testbed is described. 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
Model-driven development of multi-core embedded software
Authors: Pao-Ann Hsiung, Shang-Wei Lin, Yean-Ru Chen, Nien-Lin Hsueh, Chih-Hung Chang, Chih-Hsiong Shih, Chorng-Shiuh Koong, Chao-Sheng Lin, Chun-Hsien Lu, Sheng-Ya Tong, Wan-Ting Su, William C. Chu
Venue: Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering (2009)

Model-driven development is worthy of further research because of its proven capabilities in increasing productivity and ensuring correctness. However, it has not yet been explored for multi-core processor-based embedded systems, whose programming is even more complex and difficult that that for conventional uni-processor systems. We propose a new VERTAF/Multi-Core (VMC) framework to bridge this gap. In this work, we mainly show how VMC generates code automatically from user-specified SysML models for multi-core embedded systems. We illustrate how model-driven design based on SysML can be seamlessly integrated with Intels threading building blocks (TBB) and the Quantum Framework middleware. We use a digital video recording system to illustrate the benefits of VMC. Our experiments show how SysML/QF/TBB make multi-core embedded system programming easy, efficient, and effortless.
SoundPark: Towards Highly Collaborative Game Support in a Ubiquitous Computing Architecture
Authors: Romain Pellerin, Nicolas Bouillot, Tatiana Pietkiewicz, Mike Wozniewski, Zack Settel, Eric Gressier-Soudan, Jeremy R. Cooperstock
Venue: Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems (2009)

Ubiquitous computing architectures enable interaction and collaboration in multi-user applications. We explore the challenges of integrating the disparate services required in such architectures and describe how we have met these challenges in the context of a real-world application that operates on heterogeneous hardware and run-time environments. As a compelling example, we consider the role of ubiquitous computing to support the needs of a distributed multi-user game, including mobility, mutual awareness, and geo-localization. The game presented here, "SoundPark", is played in a mixed-reality environment, in which the physical space is augmented with computer-generated audio and graphical content, and the players communicate frequently over a low-latency audio channel. Our experience designing and developing the game motivates significant discussion related to issues of general relevance to ubiquitous game architectures, including integration of heterogeneous components, monitoring, remote control and scalability.