ppxscal/embedding_network huggingface dataset:
GCIP: exploiting the generation and optimization of integration processes
Authors: Matthias Boehm, Uwe Wloka, Dirk Habich, Wolfgang Lehner
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

As a result of the changing scope of data management towards the management of highly distributed systems and applications, integration processes have gained in importance. Such integration processes represent an abstraction of workflow-based integration tasks. In practice, integration processes are pervasive and the performance of complete IT infrastructures strongly depends on the performance of the central integration platform that executes the specified integration processes. In this area, the three major problems are: (1) significant development efforts, (2) low portability, and (3) inefficient execution. To overcome those problems, we follow a model-driven generation approach for integration processes. In this demo proposal, we want to introduce the so-called GCIP Framework (Generation of Complex Integration Processes) which allows the modeling of integration process and the generation of different concrete integration tasks. The model-driven approach opens opportunities for rule-based and workload-based optimization techniques.
New Results on Optimizing Rooted Triplets Consistency
Authors: Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time approximability of two related optimization problems called the maximum rooted triplets consistency problem ($\textsc{MaxRTC}$) and the minimum rooted triplets inconsistency problem ($\textsc{MinRTI}$) in which the input is a set $\mathcal{R}$ of rooted triplets, and where the objectives are to find a largest cardinality subset of $\mathcal{R}$ which is consistent and a smallest cardinality subset of $\mathcal{R}$ whose removal from $\mathcal{R}$ results in a consistent set, respectively. We first show that a simple modification to Wu&rsquo;s Best-Pair-Merge-First heuristic [25] results in a bottom-up-based 3-approximation for $\textsc{MaxRTC}$. We then demonstrate how any approximation algorithm for $\textsc{MinRTI}$ could be used to approximate $\textsc{MaxRTC}$, and thus obtain the first polynomial-time approximation algorithm for $\textsc{MaxRTC}$ with approximation ratio smaller than 3. Next, we prove that for a set of rooted triplets generated under a uniform random model, the maximum fraction of triplets which can be consistent with any tree is approximately one third, and then provide a deterministic construction of a triplet set having a similar property which is subsequently used to prove that both $\textsc{MaxRTC}$ and $\textsc{MinRTI}$ are NP-hard even if restricted to minimally dense instances. Finally, we prove that $\textsc{MinRTI}$ cannot be approximated within a ratio of &Omega;(logn) in polynomial time, unless P&thinsp;=&thinsp;NP.
Exact wirelength of hypercubes on a grid
Authors: Paul Manuel, Indra Rajasingh, Bharati Rajan, Helda Mercy
Venue: Discrete Applied Mathematics (2009)

Grid embeddings are used not only to study the simulation capabilities of a parallel architecture but also to design its VLSI layout. In addition to dilation and congestion, wirelength is an important measure of an embedding. There are very few papers in the literature which provide the exact wirelength of grid embedding. As far as the most versatile architecture hypercube is concerned, only approximate estimates of the wirelength of grid embedding are available. In this paper, we give an exact formula of minimum wirelength of hypercube layout into grids and thereby we solve completely the wirelength problem of hypercubes into grids. We introduce a new technique to estimate the wirelength of a grid embedding. This new technique is based on a Congestion Lemma and a Partition Lemma which we study in this paper.
Applied Algebra: Codes, Ciphers and Discrete Algorithms, 2nd edition
Authors: Darel W. Hardy, Fred Richman, Carol L. Walker
Venue:  (2009)

Using mathematical tools from number theory and finite fields, Applied Algebra: Codes, Ciphers, and Discrete Algorithms, Second Edition presents practical methods for solving problems in data security and data integrity. It is designed for an applied algebra course for students who have had prior classes in abstract or linear algebra. While the content has been reworked and improved, this edition continues to cover many algorithms that arise in cryptography and error-control codes. New to the Second Edition A CD-ROM containing an interactive version of the book that is powered by Scientific Notebook, a mathematical word processor and easy-to-use computer algebra system New appendix that reviews prerequisite topics in algebra and number theory Double the number of exercises Instead of a general study on finite groups, the book considers finite groups of permutations and develops just enough of the theory of finite fields to facilitate construction of the fields used for error-control codes and the Advanced Encryption Standard. It also deals with integers and polynomials. Explaining the mathematics as needed, this text thoroughly explores how mathematical techniques can be used to solve practical problems.
Probabilistic fusion-based parameter estimation for visual tracking
Authors: Bohyung Han, Larry S. Davis
Venue: Computer Vision and Image Understanding (2009)

In object tracking, visual features may not be discriminative enough to estimate high dimensional motion parameters accurately, and complex motion estimation is computationally expensive due to a large search space. To tackle these problems, a reasonable strategy is to track small components within the target independently in lower dimensional motion parameter spaces (e.g., translation only) and then estimate the overall high dimensional motion (e.g., translation, scale and rotation) by statistically integrating the individual tracking results. Although tracking each component in a lower dimensional space is more reliable and faster, it is not trivial to combine the local motion information and estimate global parameters in a robust way because the individual component motions are frequently inconsistent. We propose a robust fusion algorithm to estimate the complex motion parameters using variable-bandwidth mean-shift. By employing correlation-based uncertainty modeling and fusion of individual components, the motion parameter that is robust to outliers can be detected with variable-bandwidth density-based fusion (VBDF) algorithm. In addition, we describe a method to update target appearance model for each component adaptively based on the component motion consistency. We present various tracking results and compare the performance of our algorithm with others using real video sequences.
Correlating low-level image statistics with users - rapid aesthetic and affective judgments of web pages
Authors: Xianjun Sam Zheng, Ishani Chakraborty, James Jeng-Weei Lin, Robert Rauschenberger
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper, we report a study that examines the relationship between image-based computational analyses of web pages and users' aesthetic judgments about the same image material. Web pages were iteratively decomposed into quadrants of minimum entropy (quadtree decomposition) based on low-level image statistics, to permit a characterization of these pages in terms of their respective organizational symmetry, balance and equilibrium. These attributes were then evaluated for their correlation with human participants' subjective ratings of the same web pages on four aesthetic and affective dimensions. Several of these correlations were quite large and revealed interesting patterns in the relationship between low-level (i.e., pixel-level) image statistics and design-relevant dimensions.
Transverse full-wave analysis of diffraction by a 2-D metallic strip
Authors: Tarek Bdour, Noemen Ammar, Taoufik Aguili, Henri Baudrand
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

The WCIP (Wave Concept iterative Process), a new iterative method based on wave concept, previously used to characterize scattering by cylindrical structures, is now extended to the investigation of electromagnetic diffraction in free space by planar structures using a cylindrical formulation. The basic case of scattering by a perfectly conducting plane is studied to validate this extension.
A rate result for simulation optimization with conditional value-at-risk constraints
Authors: Soumyadip Ghosh
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We study a stochastic optimization problem that has its roots in financial portfolio design. The problem has a specified deterministic objective function and constraints on the conditional value-at-risk of the protfolio. Approximate optimal solutions to this problem are usually obtained by solving a sample-average approximation. We derive bounds on the gap in the objective value between the true optimal and an approximate solution so obtained. We show that under certain regularity conditions the approximate optimal value converges to the true optimal at the canonical rate O(n-1/2), where n represents the sample size. The constants in the expression are explicity defined.
An expert system for fault diagnosis, repairing and maintenance of electrical machines
Authors: V. Kontargyri, C. Tsirekis, S. Kabanaros, A. Sakarellos, A. Moronis, N. Kolliopoulos, S. Kaminaris
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

This paper presents an original software tool based on a model of expert system that has been developed to satisfy the requirements of fault diagnosis, repair and maintenance of electrical machines in industrial, educational or other applications. This software comprises an SQL server database and provides different user levels (simple user, power user and administrator). By the introduction of suitable weighting factors concerning the priority of knowledge base questions, an artificial intelligence approach is achieved. A simple, user-friendly and flexible interface is used, while low hardware requirements are needed. This software provides efficient monitoring of the operational condition of electrical machines, reduces time and cost of repair and improves maintenance procedures.
An investigation of the Internet's IP-layer connectivity
Authors: Li Tang, Jun Li, Yanda Li, Scott Shenker
Venue: Computer Communications (2009)

The Internet's tremendous value is undoubtedly dependent on its universal connectivity among a great number of heterogeneous networks that are distributed over the world. In recent years, while the Internet's scale has expanded exponentially, the current status of its connectivity is still in the lack of comprehensive and formal study. In this paper, we contribute to the understanding of Internet's IP-layer connectivity by quantitatively measuring the reachability from 124 PlanetLab nodes towards 197869 diversely distributed destination IP addresses. We first demonstrate our methodology to meet the challenges in experiment design, and then statistically analyze the Internet's IP-layer connectivity in various aspects, including the directly reachable proportion, packet loss, delay variation, and the effect of domain and geographic distance. Finally, we investigate main causes of IP-layer unreachability by revealing some intentional insulation policies based on empirical study on a few special cases and analyzing its correlation to typical routing issues.
Adaptive multi-constraints in hardware-software partitioning for embedded multiprocessor FPGA systems
Authors: Trong-Yen Lee, Yang-Hsin Fan, Chia-Chun Tsai
Venue: WSEAS Transactions on Computers (2009)

An embedded multiprocessor field programmable gate array (FPGA) system has a powerful and flexible architecture that the interaction between hardware circuits and software applications. Modern electronic products, such as portable devices, consumer electronics and telematics, can be evaluated rapidly in this platform via the implementation of a set of hardware and software tasks. However, the functionality is markedly increased, resulting in a significant raise in the number of hardware and software tasks. Consequently, too large of a solution space is formed to achieve hardware-software partitioning. Moreover, a partitioning result with low power consumption and fast execution time is difficult to obtain since meeting simultaneously multi-constraints from hundreds of thousands of combinations of hardware-software partitions is difficult. Thus, this work presents a hardware-software partitioning scheme that can obtain a partitioning result that satisfies multi-constraints from massive solution space. Specifically, this study attains a partitioning result with low power consumption and fast execution time. The effectiveness of the proposed approach is demonstrated by assessing a JPEG encoding system and a benchmark with 199 tasks.
Sourcerer: mining and searching internet-scale software repositories
Authors: Erik Linstead, Sushil Bajracharya, Trung Ngo, Paul Rigor, Cristina Lopes, Pierre Baldi
Venue: Data Mining and Knowledge Discovery (2009)

Large repositories of source code available over the Internet, or within large organizations, create new challenges and opportunities for data mining and statistical machine learning. Here we first develop Sourcerer, an infrastructure for the automated crawling, parsing, fingerprinting, and database storage of open source software on an Internet-scale. In one experiment, we gather 4,632 Java projects from SourceForge and Apache totaling over 38 million lines of code from 9,250 developers. Simple statistical analyses of the data first reveal robust power-law behavior for package, method call, and lexical containment distributions. We then develop and apply unsupervised, probabilistic, topic and author-topic (AT) models to automatically discover the topics embedded in the code and extract topic-word, document-topic, and AT distributions. In addition to serving as a convenient summary for program function and developer activities, these and other related distributions provide a statistical and information-theoretic basis for quantifying and analyzing source file similarity, developer similarity and competence, topic scattering, and document tangling, with direct applications to software engineering an software development staffing. Finally, by combining software textual content with structural information captured by our CodeRank approach, we are able to significantly improve software retrieval performance, increasing the area under the curve (AUC) retrieval metric to 0.92--- roughly 10---30% better than previous approaches based on text alone. A prototype of the system is available at: http://sourcerer.ics.uci.edu .
Knowledge Assessment: A Modal Logic Approach
Authors: Vineet Padmanabhan, Guido Governatori, Subhasis Thakur
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

The possible worlds semantics is a fruitful approach used in Artificial Intelligence (AI) for both modelling as well as reasoning about knowledge in agent systems via modal logics. In this work our main idea is not to model/reason about knowledge but to provide a theoretical framework for knowledge assessment (KA) with the help of Monatague-Scott (MS) semantics of modal logic. In KA questions asked and answers collected are the central elements and knowledge notions will be defined from these (i.e., possible states of knowledge of subjects in a population with respect to a field of information).
Plenary lecture II: artificial social systems for workflow chart
Authors: Calin I. Ciufudean
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

We focus on the control of the performance characteristics of workflows modelled with stochastic Petri nets (SPN's). This goal is achieved using a new model for Artificial Social Systems (ASS's) behaviours, and by introducing equivalent transfer functions for SPN's. ASS's exist in practically every multi-agent system, and play a major role in the performance and effectiveness chart of the agents. This is the reason why we introduce a suggestive model for ASS's. To model complex systems, such as flexible manufacturing ones, a class of Petri nets is adopted, and briefly introduced. This class allows representing the flow of physical resources and control information data of the ASS's components. In the analysis of SPN we use simulations in respect to timing parameters in a generalized semi-Markov process (GSMP). By using existing results on perturbation analysis (e.g., delays in supply with raw materials, equipment failure, etc.), and by extending them to new physical interpretations we address unbiased sensitivity estimators correlated with practical solutions in order to attenuate the perturbations. The novelty of the approach is that the construction of large Markov chains is not required. Using a structural decomposition, the construction system is divided into cells. We can simplify the structure of the SPN using the presented approach, which is useful when we deal with complex Petri nets, and we need to simplify these structures (e.g. graphs) in order to analyze them properly. For each cell a Markov model was derived and the probability was determined of at least Ni working machines in cell i, for i = 1,2,..,n and j , where j=1, ..., m, working material handling system (MHS) at time t, where Ni and j satisfy the system production capacity requirements. An example illustrates this approach. The results reported here form the basis of several enhancements, such as conducting performance studies of complex systems with multiple part types.
Polarization maintaining air-core bandgap terahertz fiber
Authors: Guobin Ren, Xia Yu, Yandong Gong, Juanjuan Hu, Ping Shum, Guanghui Wang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We proposed a novel polarization maintaining air-core bandgap polymer fiber for terahertz (THz) wave guiding. The periodic arrangement of square holes with round corners in cladding offers bandgap effect for mode guiding. The guiding properties including transmission bandwidth, numerical aperture, phase-index birefringence, modal absorption loss and bend loss are systematically investigated. Numerical simulations show that the bandgap effect repels the modal power from the absorbent background polymers, resulting in a significant suppression of absorption loss of polymers by a factor of more than 25. The phase-index birefringence of the proposed THz fiber is on the order of 10-3.
Information fusion in underwater sonar simulation
Authors: Yanshen Zhu, Maria Bull, Haluk Akin, José Sepúlveda, Luis Rabelo
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper discusses information fusion methodologies, selection of one of these methodologies, and application of these fusion methodologies to underwater sonar simulation. Bayesian Inference and Dempster-Shafer are the two methods that have been studied in detail. In conclusion, the Dempster-Shafer approach was selected as the preferred method. Dempster-Shafer's main advantage is that it does not need conditional likelihoods. Also, Dempster-Shafer does not have computational complexity problems when multiple hypotheses and multiple conditional dependent events are examined. This method was applied to the multisensor information fusion problem in a simulation which includes a passive sonar, an active sonar, and a radar. The simulation is conducted on a geographical information system.
Reinforcement numbers of digraphs
Authors: Jia Huang, Jian-Wei Wang, Jun-Ming Xu
Venue: Discrete Applied Mathematics (2009)

The reinforcement number of a graph G is the minimum cardinality of a set of extra edges whose addition results in a graph with domination number less than the domination number of G. In this paper we consider this parameter for digraphs, investigate the relationship between reinforcement numbers of undirected graphs and digraphs, and obtain further results for regular graphs. We also determine the exact values of the reinforcement numbers of de Bruijn digraphs and Kautz digraphs.
A Relay-Assisted Transmission Technique for Multihop TDD-CDMA Networks
Authors: Qingmin Meng, Yan Wang, Xiaohu You, Baoyu Zheng
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Compensation for near-far effects is critical for error performance of a direct sequence code-division multiple-access system. In this paper, we attempt to explore the potential of cooperative relaying to overcome fading and near-far effect in a wideband multihop time-division duplex CDMA (TDD-CDMA) system. A simple adaptive successive interference cancellation scheme in combination with a simple power control is presented for a two-user one-relay multihop cooperative network. Numerical results show that a significant bit error rate performance improvement can be achieved over the direct transmission while both the SIC at each receive user and the power control at the stronger transmit user are considered.
End-to-end adaptation scheme for ubiquitous remote experimentation
Authors: Christophe Salzmann, Denis Gillet, Philippe Mullhaupt
Venue: Personal and Ubiquitous Computing (2009)

Remote experimentation is an effective e-learning paradigm for supporting hands-on education using laboratory equipment at distance. The current trend is to enable remote experimentation in mobile and ubiquitous learning. In such a context, the remote experimentation software should enable effective telemonitoring and teleoperation, no matter the kind of device used to access the equipment. It should also be sufficiently lenient so as to handle the rapidly evolving wireless and mobile communication environment. While the current Internet bandwidth allows remote experimentation to work flawlessly on fixed connections such as LANs, mobile users suffer from both the versatile nature of wireless communications and the limitation of the mobile devices. These conditions impose that the remote experimentation software should integrate adaptation features. For effective ubiquitous remote experimentation, it should ideally be guaranteed that the information representing the state of the remote equipment is rendered (to the end user) at the same pace at which it has been acquired, yet possibly at the cost of a somewhat minimal time delay between the acquisition and rendering phases. In this respect, an end-to-end adaptation scheme is proposed that explicitly handles the inherent variability of the connection and the versatility of the mobile devices considered in ubiquitous remote experimentation. Instead of relying on a stochastic approach, the proposed adaptation scheme relies on a deterministic mass-balance equivalence model. The effectiveness of the proposed adaptation scheme is demonstrated in critical conditions corresponding to remote experimentation carried out using a PDA over a Bluetooth link.