ppxscal/embedding_network huggingface dataset:
Python Scripting for Computational Science, 3rd edition
Authors: Hans Petter Langtangen
Venue:  (2009)

The goal of this book is to teach computational scientists how to develop tailored, flexible, and human-efficient working environments built from small programs (scripts) written in the easy-to-learn, high-level language Python. The focus is on examples and applications of relevance to computational scientists: gluing existing applications and tools, e.g. for automating simulation, data analysis, and visualization; steering simulations and computational experiments; equipping old programs with graphical user interfaces; making computational Web applications; and creating interactive interfaces with a Maple/Matlab-like syntax to numerical applications in C/C++ or Fortran. In short, scripting with Python makes you much more productive, increases the reliability of your scientific work and lets you have more fun - on Unix, Windows and Macintosh. All the tools and examples in this book are open source codes. The third edition is compatible with the new NumPy implementation and features updated information, correction of errors, and improved associated software tools.
Simulation of doubly-fed machine with improved wind turbine
Authors: Hengameh Kojooyan Jafari
Venue: WSEAS Transactions on Circuits and Systems (2009)

Most of wind turbines use induction generators that are very reliable with low costs [2], but when it is straightly connected to the grid, maximum power is not accessible [1] and only a few change of speed between maximum speed and synchronous speed is possible [1]. In this report, a doubly-fed induction generator with winding-rotor configuration, external rotor resistance and external rotor source that has a variable phase and amplitude is used. This doubly-fed induction generator has larger range of change of speed than induction generator and its application in wind systems is very common. Also in doubly-fed machine, both active and reactive power control is possible [3]. In this report, a doubly-fed induction machine with an improved wind turbine has been simulated, then with selecting suitable control parameters by open loop controlling, maximum turbine active power at an adapted speed is exerted to the grid and the results is presented.
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
Authors: Reinhard Bauer, Dorothea Wagner
Venue: Proceedings of the 8th International Symposium on Experimental Algorithms (2009)

A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully-dynamic batch algorithms for single-source shortest paths in directed graphs with positive edge weights. We give an extensive experimental study of the existing algorithms for the single-edge and the batch case, including a broad set of test instances. We further present tuned variants of the already existing SWSF-FP-algorithm being up to 15 times faster than SWSF-FP. A surprising outcome of the paper is the astonishing level of data dependency of the algorithms. More detailed descriptions and further experimental results of this work can be found in [1].
Relational Learning by Imitation
Authors: Grazia Bombini, Nicola Mauro, Teresa M. Basile, Stefano Ferilli, Floriana Esposito
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Imitative learning can be considered an essential task of humans development. People use instructions and demonstrations provided by other human experts to acquire knowledge. In order to make an agent capable of learning through demonstrations, we propose a relational framework for learning by imitation. Demonstrations and domain specific knowledge are compactly represented by a logical language able to express complex relational processes. The agent interacts in a stochastic environment and incrementally receives demonstrations. It actively interacts with the human by deciding the next action to execute and requesting demonstration from the expert based on the current learned policy. The framework has been implemented and validated with experiments in simulated agent domains.
Opera of Meaning: film and music performance with semantic associative search
Authors: Shlomo Dubnov, Yasushi Kiyoki
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

Recently artists are exploring ways for incorporating large amounts of information and networking as part of their medium. One of the main challenges in applying information technology to film and opera is in relating different types of media to the meaning of story narrative. Opera of Meaning is a new format for distributed, collaborative and interactive viewing where the association of different media elements is done dynamically by semantic and impression search that is performed by the public during the performance in context of a main story. This opens new research questions in database modeling and semantic technology related to story meaning, media auto-tagging, automatic editing and mixing, user interaction, social networking and more. We plan to offer this format to artists, producers and the public, opening a new venue for social creation and experiencing of impression and meaning in digital media.
Robust Human Pose Recognition Using Unlabelled Markers
Authors: Yi Wang, Gang Qian
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

In this paper, we tackle robust human pose recognition using unlabelled markers obtained from an optical marker-based motion capture system. A coarse-to-fine fast pose matching algorithm is presented with the following three steps. Given a query pose, firstly, the majority of the non-matching poses are rejected according to marker distributions along the radius and height dimensions. Secondly, relative rotation angles between the query pose and the remaining candidate poses are estimated using a fast histogram matching method based on circular convolution implemented using the fast Fourier transform. Finally, rotation angle estimates are refined using nonlinear least square minimization through the Levenberg-Marquardt minimization. In the presence of multiple solutions, false poses can be effectively removed by thresholding the minimized matching scores. The proposed framework can handle missing markers caused by occlusion. Experimental results using real motion capture data show the efficacy of the proposed approach.
Letters: Exponential stability of hybrid stochastic neural networks with mixed time delays and nonlinearity
Authors: Wuneng Zhou, Hongqian Lu, Chunmei Duan
Venue: Neurocomputing (2009)

This paper is concerned with the problem of robust exponential stability for a class of hybrid stochastic neural networks with mixed time-delays and Markovian jumping parameters. In this paper, free-weighting matrices are employed to express the relationship between the terms in the Leibniz-Newton formula. Based on the relationship, a linear matrix inequality (LMI) approach is developed to establish the desired sufficient conditions for the mixed time-delays neural networks with Markovian jumping parameters. Finally, two simulation examples are provided to demonstrate the effectiveness of the results developed.
Software development governance challenges of a middle-sized company in agile transition
Authors: Ilkka Lehto, Kristian Rautiainen
Venue: Proceedings of the 2009 ICSE Workshop on Software Development Governance (2009)

We studied how a middle-sized Finnish company employing agile methods governs its software product development. Through observations and interviews we followed the trace from strategic plans in the form of roadmaps to various backlogs and all the way to daily work. The governance roles, responsibilities and deliverables seemed to be in place on different organizational levels. However, closer inspection revealed challenges in the practical implementation. There were too many roles and hierarchy levels with information consistency problems in between. Prioritization of the high-level goals was unclear and made it difficult to plan and organize development work based on business value. The trace from high-level goals to more detailed plans was easily corrupted due to poor planning practices. Progress monitoring of daily work was poorly done and not linked to high-level plans. Consequently, the required feedback loops were inadequate, making it impossible for management to take corrective actions in time.
Using Wikipedia knowledge to improve text classification
Authors: Pu Wang, Jian Hu, Hua-Jun Zeng, Zheng Chen
Venue: Knowledge and Information Systems (2009)

Text classification has been widely used to assist users with the discovery of useful information from the Internet. However, traditional classification methods are based on the &#x201c;Bag of Words&#x201d; (BOW) representation, which only accounts for term frequency in the documents, and ignores important semantic relationships between key terms. To overcome this problem, previous work attempted to enrich text representation by means of manual intervention or automatic document expansion. The achieved improvement is unfortunately very limited, due to the poor coverage capability of the dictionary, and to the ineffectiveness of term expansion. In this paper, we automatically construct a thesaurus of concepts from Wikipedia. We then introduce a unified framework to expand the BOW representation with semantic relations (synonymy, hyponymy, and associative relations), and demonstrate its efficacy in enhancing previous approaches for text classification. Experimental results on several data sets show that the proposed approach, integrated with the thesaurus built from Wikipedia, can achieve significant improvements with respect to the baseline algorithm.
Pair dynamics in team collaboration
Authors: Kyungsub Steve Choi, Fadi P. Deek, Il Im
Venue: Computers in Human Behavior (2009)

From a recent field survey with a group of professional pair programmers, it was revealed that the programmers perceive a partner's personality, cognitive style and communication skills as the top three factors that lead to prudent pair programming. Based on this finding, the factors personality and communication skills, along with gender were selected for an experiment to analyze if a partner's human, intrinsic values influence the pair programming experience, specifically in the levels of satisfaction, compatibility, communication, and confidence. A total of 128 students majoring in Management Information Systems, Information Systems, and Information Technology participated in the experiment. Of the 68 undergraduates, 40 were first-year students and 28 were juniors; the remaining 60 were Master's degree graduate students. The students were formed into a total of 64 pairs based on their personality, level of communication skills, and gender. A total of three visits were made. During the first two visits, a set of four programming problems was used in four programming sessions lasting 45min each; two were individual programming sessions and two were pair programming sessions. At the end of each visit, a questionnaire was administered and collected. The questionnaire results revealed that the various Myers-Briggs Type Indicator (MBTI) personality combinations did not significantly influence the levels of communication, satisfaction, confidence, and compatibility. The pairs that exhibited a high level of communication between partners did not necessarily experience a high level of satisfaction or exhibit compatibility between partners, nor did they have a high level of confidence regarding the finished product. The communication skill level seemed to have an impact on communication only. Similar to many previous gender-focused literatures, the same gender pairs did exhibit significantly higher levels of communication, satisfaction and compatibility than the mixed gender pairs. Within the same gender pairs, the female-female pairs showed a much higher level than the male-male pairs in those categories. Contrariwise, the same gender pairs did not show a significantly higher confidence level than the mixed gender pairs about their finished product.
Smart Phone Interaction with Registered Displays
Authors: Nick Pears, Daniel G. Jackson, Patrick Olivier
Venue: IEEE Pervasive Computing (2009)

Display registration allows the composition of a camera-equipped smart phone and a public display. By tracking dynamic markers on a public display, researchers can compute the mapping between the pixels on the smart phone's screen and those on the display. Display registration allows interaction through the smart phone image, facilitating both conventional direct-manipulation interaction techniques and the use of the smart phone as a tangible tool. This article describes the theory and practice of display registration with smart phones, findings in initial user studies, and the opportunities for developing markerless display registration schemes.
Scheduling tasks on heterogeneous chip multiprocessors with reconfigurable hardware
Authors: Fusun Ozguner
Venue:  (2008)

This dissertation presents several methods to more efficiently use the computational resources available on a Heterogeneous Chip Multiprocessor (H-CMP). Using task scheduling techniques, three challenges to the effective usage of H-CMPs are addressed: the emergence of reconfigurable hardware in general purpose computing, utilization of the network on a chip (NoC), and fault tolerance. To utilize reconfigurable hardware, we introduce the Mutually Exclusive Processor Groups reconfiguration model, and an accompanying task scheduler, the Heterogeneous Earliest Finish Time with Mutually Exclusive Processor Groups (HEFT-MEG) scheduling heuristic. HEFT-MEG schedules reconfigurations using a novel backtracking algorithm to evaluate how different reconfiguration decisions affect previously scheduled tasks. In both simulation and real execution, HEFT-MEG successfully schedules reconfiguration allowing the architecture to adapt to changing application requirements. After an analysis of IBM&rsquo;s Cell Processor NoC and generation of a simple stochastic model, we propose a hybrid task scheduling system using a Compile- and Run-time Scheduler (CtS and RtS) that work in concert. The CtS, Contention Aware HEFT (CA-HEFT), updates task start and finish times when scheduling to account for network contention. The RtS, the Contention Aware Dynamic Scheduler (CADS), adjusts the schedule generated by CA-HEFT to account for variation in the communication pattern and actual task finish times, using a novel dynamic block algorithm. We find that using a CtS and RtS in concert improves the performance of several application types in real execution on the Cell processor. To enhance fault tolerance, we modify the previously proposed hybrid scheduling system to accommodate variability in the processor availability. The RtS is divided into two portions, the Fault Tolerant Re-Mapper (FTRM) and the Reconfiguration and Recovery Scheduler (RRS). FTRM examines the current processor availability and remaps tasks to the available set of processors. RRS changes the reconfiguration schedule so that the reconfigurations more accurately reflect the new hardware capabilities. The proposed hybrid scheduling system enables application performance to gracefully degrade when processor availability diminishes, and increase when processor availability increases.
A hybrid approach to solving coarse-grained DisCSPs
Authors: David Lee, Inés Arana, Hatem Ahriz, Kit-Ying Hui
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

A coarse-grained Distributed Constraint Satisfaction Problem (DisCSP) consists of several loosely connected constraint satisfaction subproblems, each assigned to an individual agent. We present Multi-Hyb, a two-phase concurrent hybrid approach for solving DisCSPs. In the first phase, each agent's subproblem is solved using systematic search which generates the key partial solutions to the global problem. Concurrently, a penalty-based local search algorithm attempts to find a global solution from these partial solutions. If phase 1 fails to find a solution, a phase 2 systematic search algorithm solves the problem using the knowledge gained from phase 1. We show that our approach is highly competitive in comparison with other coarse-grained DisCSP algorithms.
The study of the financial equilibrium reflected on grounds of the information provided by the accounting balance sheet
Authors: Lucian Patrascu, Ioan-Gheorghe Ratiu, Claudia-Georgeta Carstea, Doru Plesea
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

The analysis of the financial equilibrium of a company pursues to reflect the equality relations between the financing sources and the use of the financial resources, between the income and the expenses and costs deriving from the company's activity, all this on long, medium and short term 0.
Back Propagation Neural Network Based Lifetime Analysis of Wireless Sensor Network
Authors: Wenjun Yang, Bingwen Wang, Zhuo Liu, Xiaoya Hu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

As large amount of energy constrained nodes are randomly distributed in network, the entire lifetime of wireless sensor network is difficult to estimate. In this paper, a back propagation (BP) neural network based Markov model is presented to calculate the lifetime of wireless sensor network. BP neural network is employed to reduce the calculation difficulty of Markov state equation. The simulation results indicate that this method gives the value of maximum lifetime exactly and its computing complexity is low. The quantitative degree of computing reliability relative error between the results of three layer BP neural network and the Markov model is 10¿ 4.
Evaluation of continuous controls for radial menus
Authors: Bo Sauden
Venue:  (2008)

This research focuses on a computer human interaction technique well suited toward ever-increasing display areas found on larger monitors, multiple monitors, and large interactive displays such as whiteboards. Specifically, a new type of interface control is explored; one that helps move the user interface from the edges of the screen to the location where the user is currently working. Existing techniques of moving the user interface to the user, such as gesturing or radial (pie) menus, allow the user to choose an item, but suffer from the inability to choose the value of an item. The introduction of continuous controls for radial menus allows for the selection of an item, such as with pie menus, but in addition allows for the selection of a value for that item. An example of this might be an audio menu where the items are volume, bass, treble, and balance, and the item and its associated value can be chosen in one action. This research evaluates continuous radial menus through an empirical experiment. The results for the experiment show that (1) a visual mark to act as an indicator of the value about to be selected is not necessary, but may be desirable; (2) the direction of increasing value (top-to-bottom versus clockwise) does not effect performance, but perhaps clockwise is preferable; (3) the menu should have an outside radius of at least 100 pixels or approximately 2.5 cm, but an unbounded menu is best; (4) a menu can support up to eight continuous control items without seriously degrading performance; and (5) the proposed menu is easy to learn.
Optimization system for operation of gas cogeneration power plant
Authors: Ion Miciu
Venue: Proceedings of the 2nd conference on European computing conference (2008)

The paper presents a distributed control system for the realization of cogenerative supply of electricity and heat and, in given case, for their combination with waste heat recovery, particularly in combined (gas-steam) cycle industrial power plants. Modern electric power plants are large complex systems with many processes whose operations need to be optimized. The electrical networks are designed for transmission, repartition and distribution of electrical energy, so that they present various structures. An optimization problem is usually a mathematical model, where we wish to minimize a numerical value that represents something like costs, energy losses, risks, errors etc or maximize something like profit, quality, efficiency. Today all the systems that manage the security are characterized by the complexity of their major functions like identification, authentication, access control and data protection. The implementation of these functions is usually and objectively based on a trusted model that uses a trusted architecture, which is the platform of the security architectures.
A Tableau Algorithm for Handling Inconsistency in OWL
Authors: Xiaowang Zhang, Guohui Xiao, Zuoquan Lin
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

In Semantic Web, the knowledge sources usually contain inconsistency because they are constantly changing and from different view points. As is well known, as based on the description logic, OWL is lack of the ability of tolerating inconsistent or incomplete data. Recently, the research in handling inconsistency in OWL becomes more and more important. In this paper, we present a paraconsistent OWL called quasi-classical OWL to handle inconsistency with holding important inference rules such as modus tollens, modus ponens, and disjunctive syllogism. We propose a terminable, sound and complete tableau algorithm to implement paraconsistent reasoning in quasi-classical OWL. In comparison with other approaches to handle inconsistency in OWL, our approach enhances the ability of reasoning by integrating paraconsistent reasoning with important classical inference rules.