ppxscal/embedding_network huggingface dataset:
Building problem-solving environments with the Arches framework
Authors: Nathan DeBardeleben, Ron Sass, Daniel Stanzione,  Jr., Walter B. Ligon,  III
Venue: Journal of Systems and Software (2009)

The computational problems that scientists face are rapidly escalating in size and scope. Moreover, the computer systems used to solve these problems are becoming significantly more complex than the familiar, well-understood sequential model on their desktops. While it is possible to re-train scientists to use emerging high-performance computing (HPC) models, it is much more effective to provide them with a higher-level programming environment that has been specialized to their particular domain. By fostering interaction between HPC specialists and the domain scientists, problem-solving environments (PSEs) provide a collaborative environment. A PSE environment allows scientists to focus on expressing their computational problem while the PSE and associated tools support mapping that domain-specific problem to a high-performance computing system. This article describes Arches, an object-oriented framework for building domain-specific PSEs. The framework was designed to support a wide range of problem domains and to be extensible to support very different high-performance computing targets. To demonstrate this flexibility, two PSEs have been developed from the Arches framework to solve problem in two different domains and target very different computing platforms. The Coven PSE supports parallel applications that require large-scale parallelism found in cost-effective Beowulf clusters. In contrast, RCADE targets FPGA-based reconfigurable computing and was originally designed to aid NASA Earth scientists studying satellite instrument data.
Feedback Control in General Complex Delayed Dynamical Networks
Authors: Lilan Tu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Based on feedback control, a problem is discussed in which the state variables of nodes of general complex delayed dynamical networks are controlled to its equilibrium. The delay differential inequality is employed to investigate delay-dependent of this system and some sufficient conditions for asymptotic stability are presented. At the same time, they provide concrete bounds of the delays in terms of explicit expression. A scale-free network is discussed in numerical simulations. They show the effectiveness and feasibility of the proposed conditions.
Measuring evolving data streams' behavior through their intrinsic dimension
Authors: Elaine P. M. de Sousa, Agma J. M. Traina, Caetano Traina, Christos Faloutsos
Venue: New Generation Computing (2007)

The dimension of a dataset has major impact on database management, such as indexing and querying processing. The embedding dimension (i.e., the number of attributes of the dataset) usually overestimates the actual contribution of the attributes to the main characteristics of the data, as the typical assumption of uniform distribution and independence between attributes usually does not hold. In fact, due to dependencies and attribute correlations, real data are typically skewed and exhibit intrinsic dimensionality much lower than the embedding dimension. Similarly, the intrinsic dimension can also be applied to improve data stream processing and analysis. Data streams are generated as sequences of events represented by a predetermined number of numerical attributes. Thus, without loss of generality, we can consider events as elements from a dimensional domain. This paper presents a fast, linear algorithm to measure the intrinsic dimension of a data stream on the fly, following its continuously changing behavior. Experimental studies show that the intrinsic dimension can be used to analyze attribute correlations. The results on well-understood datasets closely follow what is expected from the known behavior of the data.
Review-oriented metadata enrichment: a case study
Authors: Liang Zhang, Jiangqin Wu, Yueting Zhuang, Yin Zhang, Chenxing Yang
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

Book reviews contributed by readers in social sites contain valuable information on books' content, style and merit, many informative words in which can be used to enrich metadata of books in China-Us Million Book Digital Library. In this paper, we present a system for review-oriented metadata enrichment and propose an Book-Centric Diverse Random Walk algorithm on a four-partite graph containing three kinds of relations among authors, books, reviews and words, in order to produce highly relevant as well as diverse keywords for a book. Experimental results of a user study show that our approach significantly outperforms other methods in terms of relevance and diversity. The metadata generated by our approach also has a large overlap with popular social tags and brief introductions from DouBan for books in the coverage experiments.
A Semantic Space Creation Method with an Adaptive Axis Adjustment Mechanism for Media Data Retrieval
Authors: Xing Chen, Yasushi Kiyoki, Kosuke Takano, Keisuke Masuda
Venue: Proceeding of the 2008 conference on Information Modelling and Knowledge Bases XIX (2008)

This paper presents a new semantic space creation method with an adaptive axis adjustment mechanism for media data retrieval. The semantic space is essentially required to search semantically related and appropriate information resources from media databases. In the method, data in the media databases are mapped as vectorized metadata on the semantic space. The distribution of the metadata on the semantic space is the main factor affecting the accuracy of the retrieval results. In the method, an adaptive axis adjustment mechanism is used to rotate and combine the semantic correlated axes on the semantic space, and remove axes from the semantic space. We demonstrated by experiments that when the semantic space is created and adjusted based on the semantic correlated factors, the metadata are appropriately and sharply distributed on the semantic space.
Meta Model Based Architecture for Software Process Instantiation
Authors: Peter Killisperger, Markus Stumptner, Georg Peters, Georg Grossmann, Thomas Stückl
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

In order to re-use software processes for a spectrum of projects they are described in a generic way. Due to the uniqueness of software development, processes have to be adapted to project specific needs to be effectively applicable in projects. This instantiation still lacks standardization and tool support making it error prone, time consuming and thus expensive. Siemens AG has started research projects aiming to improve software process related activities. Part of these efforts has been the development of a New Software Engineering Framework (NSEF) enabling a more effective and efficient instantiation and application of processes. A system supporting project managers in instantiation of software processes is being developed. It aims to execute instantiation decision made by humans and to automatically restore correctness of the resulting process.
Baseline extraction algorithm for online signature recognition
Authors: Azlinah Azlinah Mohamed, Rohayu Yusof, Shuzlina Abdul Rahman, Sofianita Mutalib
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

In this paper, we discuss baseline extraction algorithm for online signature recognition based on vector rules. In order to recognize, verify and analyze a signature, one needs to establish the feasible computational signature features which would be required to be extracted. The main features in this case are direction, slant, baseline, pressure, speed and numbers of pen ups and downs. Method of extracting features signature depends on the requirement features to be extracted. In this paper, we propose the construction of an algorithm to extract the baseline from signature. Signatures are taken from twenty randomly selected individuals with different background. In order to validate the algorithm, the capture image of each signature is use as samples for a developed questionnaire to be given to human expert. These questionnaires are all about identifying the baseline of the signatures. Both results from automatic baseline detector and the questionnaire are compared, and it shows that the algorithm is 90% accurate. It can be concluded that the algorithm proposed are acceptable to represent extraction of signature features based on baseline.
Queuing system evolution in a diffusion approximation scheme
Authors: A. V. Mamonova, Lu. F. Griza
Venue: Cybernetics and Systems Analysis (2009)

An asymptotic diffusion approximation scheme is investigated as applied to the requirement evolution in semi-Markov queuing systems. In proving the diffusion approximation theorem, the compensating operator of the corresponding extended Markov process is used. This problem is solved with the help of a phase merging procedure.
Data warehouse technology by infobright
Authors: Dominik Ślezak, Victoria Eastwood
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

We discuss Infobright technology with respect to its main features and architectural differentiators. We introduce the upcoming research and development projects that may be of special interest to the academic and industry communities.
An optimal algorithm for tree geometrical k-cut problem
Authors: Sang-Young Cho, Hee-Chul Kim
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

Geometrical k-cut problem has numerous applications, particularly in clustering-related setups such as task assignment and VLSI cell placement. This problem is NP-hard in general. We propose an optimal algorithm to solve the problem for tree topology graphs in polynomial time. The time complexity of the algorithm is O(kn3), where n is the number of nodes in a k-terminal graph, with the Goldberg-Tarjan's network flow algorithm.
A Fuzzy QFD Approach for Designing Internal Processes for Air Cargo Transportation Services
Authors: Shuo-Yan Chou, Yao-Hui Chang, Chih-Hsien Chen
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

The objective of this study is to develop an integrated approach to process design for air cargo transportation. This work integrated the methodologies of fuzzy set theory (FST), balanced scorecard (BSC), and theory of constraints (TOC) to ensure that the internal process design meets the needs of employees, shareholders, and customers, concurrently. This integrated approach is constructed by three stages. In the first stage, the strategies, strategic objectives, and key performance indicators (KPIs) of the company are developed through the conceptual framework of BSC. In the second stage, the initiator's actions are developed through the five logic tools of TOC. Furthermore, in the third stage, through the integration of BSC and TOC with fuzzy quality function deployment (QFD), KPIs and initiator's actions were transformed into the design requirements and the technical requirements. Finally, the house of quality (HOQ) is built for designing the service process of air cargo transportation based on fuzzy QFD.
Prediction Models of an Indoor Smart Antenna System Using Artificial Neural Networks
Authors: Nektarios Moraitis, Demosthenes Vouyioukas
Venue: Proceeding of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies (2007)

This study presents the prediction propagation paths of angle of arrivals (AoAs) of a Smart Antenna System in an indoor environment utilizing Artificial Neural Networks (ANN). The proposed models consist of a Multilayer Perceptron and a Generalized Regression Neural Network trained with measurements. For comparison purposes the theoretical Gaussian scatter density model was investigated for the derivation of the power angle profile. The antenna system consisted of a Single Input Multiple Output (SIMO) system with two or four antenna elements at the receiver site and the realized antenna configuration comprised of Uniform Linear Arrays (ULAs). The proposed models utilize the characteristics of the environment, the antenna elements and their spacing for prediction of the angle of arrivals of each one of the propagation paths. The results are presented towards the average error, standard deviation and mean square error compared with the measurements and they are capable for the derivation of accurate prediction models for the case of AoA in an indoor millimeter wave propagation environment.
The maximum gain of increasing the number of preemptions in multiprocessor scheduling
Authors: Kamilla Klonowska, Lars Lundberg, H&#x00e5;kan Lennerstad
Venue: Acta Informatica (2009)

We consider the optimal makespan C(P, m, i) of an arbitrary set P of independent jobs scheduled with i preemptions on a multiprocessor with m identical processors. We compare the ratio for such makespans for i and j preemptions, respectively, where i&#x00a0;<&#x00a0;j. This ratio depends on P, but we are interested in the P that maximizes this ratio, i.e. we calculate a formula for the worst case ratio G(m, i, j) defined as $${G(m,i,j)=\max \frac{C(P,m,i)}{C(P,m,j)},}$$where the maximum is taken over all sets P of independent jobs.
M-chaining scheme for VoD application on cluster-based Markov process
Authors: R. Ashok Kumar, K. Hareesh, K. Ganesan, D. H. Manjaiah
Venue: International Journal of Advanced Media and Communication (2009)

In a Video-on-Demand (VoD) system, by forwarding video segment client by client, a chain-based scheme is obtained, which reduces the server streams. The problem in the existing schemes is that the same video streams are duplicated and streamed to the different clients, which consumes more system resources. To solve this problem, we proved that a single stream is significant to serve different clients without duplicating the streams; this is accomplished from new architecture for the VoD system, which makes use of Markov Process on the client machines. By this way, more number of clients is chained for single server stream.
Backdoors to Combinatorial Optimization: Feasibility and Optimality
Authors: Bistra Dilkina, Carla P. Gomes, Yuri Malitsky, Ashish Sabharwal, Meinolf Sellmann
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient algorithms for solving them. One such concept is that of a backdoor set--a set of variables such that once they are instantiated, the remaining problem simplifies to a tractable form. While backdoor sets were originally defined to capture structure in decision problems with discrete variables, here we introduce a notion of backdoors that captures structure in optimization problems, which often have both discrete and continuous variables. We show that finding a feasible solution and proving optimality are characterized by backdoors of different kinds and size. Surprisingly, in certain mixed integer programming problems, proving optimality involves a smaller backdoor set than finding the optimal solution. We also show extensive results on the number of backdoors of various sizes in optimization problems. Overall, this work demonstrates that backdoors, appropriately generalized, are also effective in capturing problem structure in optimization problems.
Automatically assessing the post quality in online discussions on software
Authors: Markus Weimer, Iryna Gurevych, Max Mühlhäuser
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

Assessing the quality of user generated content is an important problem for many web forums. While quality is currently assessed manually, we propose an algorithm to assess the quality of forum posts automatically and test it on data provided by Nabble.com. We use state-of-the-art classification techniques and experiment with five feature classes: Surface, Lexical, Syntactic, Forum specific and Similarity features. We achieve an accuracy of 89% on the task of automatically assessing post quality in the software domain using forum specific features. Without forum specific features, we achieve an accuracy of 82%.
Study of relationship between ICT and economic growth (neural network approach)
Authors: Omid Khodaveyrdi, Arezoo Mohandessi, Hossien Nemati
Venue: Proceedings of the 10th WSEAS international conference on Neural networks (2009)

In this paper we aim to evaluate the relationship between ICT and economic growths in world. In this study we used Panel data method as an instrument for complicated linear trends and the GMDH-neural network method as an instrument for complicated non-linear trends especially with the limited observations. is it gained that there is a significant relationship between investment in information and communication technology (ICT) and economic growth and from none-linear modeling we discovered that its effect is very strong and important.
Models of Computation: An Introduction to Computability Theory, 1st edition
Authors: Maribel Fernndez
Venue: Undergraduate Topics In Computer Science (2009)

A Concise Introduction to Computation Models and Computability Theory provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing Machines and Recursive Functions, to the modern computation models inspired by quantum physics. An in-depth analysis of the basic concepts underlying each model of computation is provided. Divided into two parts, the first highlights the traditional computation models used in the first studies on computability: - Automata and Turing Machines; - Recursive functions and the Lambda-Calculus; - Logic-based computation models. and the second part covers object-oriented and interaction-based models. There is also a chapter on concurrency, and a final chapter on emergent computation models inspired by quantum mechanics. At the end of each chapter there is a discussion on the use of computation models in the design of programming languages.
Seamless Mobility of Senders Transmitting Multi-user Sessions over Heterogeneous Networks
Authors: Luis Veloso, Eduardo Cerqueira, Paulo Mendes, Edmundo Monteiro
Venue: Proceedings of the 7th International Conference on Wired/Wireless Internet Communications (2009)

The development of wireless technologies together with the increasing portability of telecommunication devices lead to the necessity to develop communication systems capable of supporting a seamless mobility experience to end-users. Moreover, the arising of multi-user real-time services has emphasized the importance of the multicast communication to deliver content to multiple simultaneous receivers. The simultaneous increase in the production and distribution of multimedia content by both mobile service providers and consumers requires an efficient solution for the mobility management of multicast sources. This way, mobility management of multicast senders is a challenging and unsolved task for the successful development of next generation user-centric mobile networks, where the nomadic user is not only a consumer but also a provider of multimedia content. A proposal to constraint losses during the handover of multicast senders, and consequently, to avoid the service degradation perceived by receivers is presented in this paper. Simulation results confirm the ability of the proposed mechanism to reduce or completely avoid packet losses, increasing the perceived quality of the received sessions.
Using Ensemble-Based Reasoning to Help Experts in Melanoma Diagnosis
Authors: Ruben Nicolas, Elisabet Golobardes, Albert Fornells, Sonia Segura, Susana Puig, Cristina Carrera, Joseph Palou, Josep Malvehy
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

New habits in solar exposure have caused an important increase of melanoma cancer during the last few years. However, recent studies demonstrate that early diagnosis drastically improves the treatment of this illness. This work presents a platform called MEDIBE that helps experts to diagnose melanoma. MEDIBE is an ensemble-based reasoning system that uses two of the most important non-invasive image techniques: Reflectance Confocal Microscopy and Dermatoscopy. The combination of both image source improves the reliability of diagnosis.
Iris Feature Extraction Based on the Complete 2DPCA
Authors: Xiuli Xu, Ping Guo
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Iris recognition has been paid more attentions due to its high reliability in personal identification recently. Iris feature extraction is very critical in the identification system. In this paper, in order to obtain the effective iris feature matrices with lower dimension, we explore a feature extraction method called Complete Two-Dimension Principal Component Analysis (C- 2DPCA). We also employed other two methods, Two-Dimension Linear Discriminant Analysis (2DLDA) and 2DPCA for comparison. Experiments with the public iris dataset from Chinese Academy of Science - Institute of Automation (CASIA) indicate that the C-2DPCA performs better than both 2DLDA and 2DPCA with a lower Equal Error Rate (EER) and average computation time.
H<SUB align=right>&infin; control for spatio-temporal switching networks with coupling delays
Authors: J. Yao, W. Xu, Y. Yu
Venue: International Journal of Systems, Control and Communications (2009)

This paper formulates and studies a new model of complex spatio-temporal switching network with coupling delays. The dynamics of each node at different time-interval corresponds to different switching mode, and the whole topology of the network is switched between diverse structures. The switching signals depend not only on instant time t but also on the index of node i. Based on Lyapunov stability theory, sufficient conditions for robust criteria of the corresponding spatio-temporal switching closed-loop network are established. Finally, an illustrative example is included.
Camouflaging mobility for itinerary privacy in mobile ad-hoc networks
Authors: Lei Tang, Xiaoyan Hong, Susan Vrbsky
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

The privacy of wireless communications is becoming an important issue due to the open nature of wireless medium. Much research work has been proposed to address the anonymity of communicating parties, the location privacy of the message source and destination, and the privacy of the network routing paths. However, with the advent of new radio identification and localization techniques, more advanced privacy attacks are possible. We describe a new privacy attack in which the adversary tries to infer the itineraries of the nodes in the network. To protect itinerary privacy, we design an algorithm, called the Δ-mobility camouflaging algorithm, which can be applied upon any mobility model by changing the original motion segments into Δ-shaped camouflaging paths. Our analysis results show that the Δ-mobility camouflaging algorithm is cost-effective, which in most cases decreases the itinerary exposure probability more than 80% at a cost of less than 3% extra travel distance.