ppxscal/embedding_network huggingface dataset:
Approximating Independent Set and Coloring in Random Uniform Hypergraphs
Authors: Kai Plociennik
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

We consider the problems Independent Set and Coloring in uniform hypergraphs with n vertices. If $\mathcal{NP} \not \subseteq \mathcal{ZPP}$, there are no polynomial worst case running time approximation algorithms with approximation guarantee n 1 ¿ ¿ for any ¿> 0. We show that the problems are easier to approximate in polynomial expected running time for random hypergraphs. For d ¿ 2, we use the H d (n,p) model of random d-uniform hypergraphs on n vertices, choosing the edges independently with probability p. We give deterministic algorithms with polynomial expected running time for random inputs from H d (n,p), and approximation guarantee O(n 1/2·p ¿ (d ¿ 3)/(2d ¿ 2)/(ln n)1/(d ¿ 1)). 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
Proceedings of the first ACM SIGPLAN symposium on Haskell
Venue: Haskell (2008)

Welcome to the 1st ACM SIGPLAN Haskell Symposium -- Haskell'08. The Haskell Symposium continues in the tradition of the Haskell Workshops; a forum for discussing experiences with Haskell, and exploring possible future developments for the language, including all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. The name change reflects the steady increase of influence of the Haskell Workshop on the wider community, as well as sustained high quality submissions making the acceptance process highly competitive. The call for papers attracted 28 submissions. Each paper was given to three members to review, and in several cases additional reviews were solicited. The submissions were discussed during a 5 day virtual PC meeting using easychair, and the Program Committee selected ten submissions for presentation and publication in these proceedings.
A Framework for the Automatic Generation of Instruction-Set Extensions for Reconfigurable Architectures
Authors: Carlo Galuzzi, Koen Bertels
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

In this paper we present a framework for the automatic identification and selection of convex MIMO instruction-set extensions for reconfigurable architecture. The framework partitions the analysis of the problem into phases of different computational complexity and it generates instruction-set extensions of different granularity. The framework is retargetable and additional clustering policies can be added with just small modification on the design.
Fuzzy Symmetry Based Real-Coded Genetic Clustering Technique for Automatic Pixel Classification in Remote Sensing Imagery
Authors: Sriparna Saha, Sanghamitra Bandyopadhyay
Venue: Fundamenta Informaticae (2008)

The problem of classifying an image into different homogeneous regions is viewed as the task of clustering the pixels in the intensity space. In particular, satellite images contain landcover types some of which cover significantly large areas, while some (e.g., bridges and roads) occupy relatively much smaller regions. Automatically detecting regions or clusters of such widely varying sizes presents a challenging task. In this paper, a newly developed real-coded variable string length genetic fuzzy clustering technique with a new point symmetry distance is used for this purpose. The proposed algorithm is capable of automatically determining the number of segments present in an image. Here assignment of pixels to different clusters is done based on the point symmetry based distance rather than the Euclidean distance. The cluster centers are encoded in the chromosomes, and a newly developed fuzzy point symmetry distance based cluster validity index, FSym-index, is used as a measure of the validity of the corresponding partition. This validity index is able to correctly indicate presence of clusters of different sizes and shapes as long as they are internally symmetrical. The space and time complexities of the proposed algorithm are also derived. The effectiveness of the proposed technique is first demonstrated in identifying two small objects from a large background from an artificially generated image and then in identifying different landcover regions in remote sensing imagery. Results are compared with those obtained using the well known fuzzy C-means algorithm both qualitatively and quantitatively.
Excitation controller design for wind turbine generator using H&#8734 control
Authors: A. K. Boglou, D. V. Bandekas, C. Potolias
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

An optimal excitation controller design based on multirate-output controllers (MROCs) having a multirate sampling mechanism with different sampling period in each measured output of the system is presented. The proposed H∞ -control technique is applied to the discrete linear open-loop system model which represents a wind turbine generator supplying an infinite bus through a transmission line.
Evaluation of election outcomes under uncertainty
Authors: Noam Hazon, Yonatan Aumann, Sarit Kraus, Michael Wooldridge
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

We investigate the extent to which it is possible to evaluate the probability of a particular candidate winning an election, given imperfect information about the preferences of the electorate. We assume that for each voter, we have a probability distribution over a set of preference orderings. Thus, for each voter, we have a number of possible preference orderings -- we do not know which of these orderings actually represents the voters' preferences, but we know for each one the probability that it does. We give a polynomial algorithm to solve the problem of computing the probability that a given candidate will win when the number of candidates is a constant. However, when the number of candidates is not bounded, we prove that the problem becomes #P-Hard for the Plurality, Borda, and Copeland voting protocols. We further show that even evaluating if a candidate has any chance to win is NP-Complete for the Plurality voting protocol, in the weighted voters case. We give a polynomial algorithm for this problem when the voters' weights are equal.
Pollarder: An Architecture Concept for Self-adapting Parallel Applications in Computational Science
Authors: Andreas Schäfer, Dietmar Fey
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Utilizing grid computing resources has become crucial to advances in today's computational science and engineering. To sustain efficiency, applications have to adapt to changing execution environments. Suitable implementations require huge efforts in terms of time and personnel. In this paper we describe the design of the Pollarder framework, a work in progress which offers a new approach to grid application componentization. It is based on a number of specialized design patterns to improve code reusability and flexibility. An adaptation layer handles environment discovery and is able to construct self-adapting applications from a user supplied library of components. We provide first experiences gathered with a prototype implementation.
Robust Stabilization of Uncertain Nonlinear Differential-Algebraic Subsystem Using ANN with Application to Power Systems
Authors: Qiang Zang, Xianzhong Dai
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

The controlled system is an uncertain nonlinear differential-algebraic subsystem (DASs) in a large-scale system. The problem of robust stabilization for such class of uncertain nonlinear DASs is considered in this paper. The robust stabilization controller is proposed based on backstepping approach using two-layer Artificial Neural Networks (ANN) whose weights are updated on-line. The closed-loop error systems are uniformly ultimately bounded (UUB) and the error of convergence can be made arbitrarily small. Finally, using the design scheme proposed in this paper, a governor controller is designed for one synchronous generator in a multi-machine power systems. The simulation results demonstrate the effectiveness of the proposed scheme.
The effects of a computer-assisted instructional multimedia compact disc on student performance of hotel knowledge test in taiwan
Authors: A. W. Strickland
Venue:  (2008)

The purpose of this study was to measure the learning achievement of 92 students who majored in recreation related fields in a technology university in southern Taiwan. Additional instructional materials were provided to the treatment group in preparation for the Hotel Knowledge section of the Class C Skills Written Test in Hospitality Service. The retention of materials of participants who used a Computer-Assisted Instructional multimedia Compact Disc (CAI-CD) created by following the ADDIE instructional systems design model were investigated. A quasi-experimental research design was used. The participants were students from two intact class sessions assigned as the experimental and the control groups with the treatment group receiving instruction using the CAI-CD and the control group receiving traditional instruction using printed text materials. Both groups took a Hotel Knowledge Pretest prior to the instruction, a three-hour class per week in a continuous six-week period during an 18-week semester. A nine-item demographic survey was administered to both groups, as well as a Posttest 1. Eleven weeks later a time-delayed Posttest 2 was administered to measure the long-term learning effects of this instruction. All data were conducted by T-test, Chi-Square Test, a One-Way Analysis of Variance (ANOVA), an Analysis of Covariance (ANCOVA), and Pearson's Product Moment Correlation Coefficient over the software package SPSS 12.0. The findings demonstrated no significance for Posttest 1. However, participants in the experimental group appeared to have better long term retention than students in the control group as determined by the delayed Posttest 2.
Evaluating Degree of Success in Power Plant Construction Projects Based on Variable Weight Grey Cluster
Authors: Yuansheng Huang, Qingchao Liu, Li Tian
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

The paper uses variable weight grey cluster to evaluate the degree of success in power plant which is this paper’s innovative points. First we give an index system for the project degree of success evaluation, which contains four second-indexes (implementation process, operation situation, financial benefit and the effect of environment) and each second-index contains third-index, then use variable weight grey cluster method to evaluate. Lastly, we give an example, and get a satisfaction result; it is fit well with the actual situation. This can be guiding the project construction.
Polyphase Downsampling Based Redundant Picture Coding for SVC Error Resiliency
Authors: Jie Jia, Hae-Kwang Kim, Hae-Chul Choi
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

Scalable video coding (SVC) is currently being developed as an extension to the H.264/AVC by the Joint Video Team (JVT). The SVC addresses coding schemes for reliable video delivery over heterogenous network for diverse clients using available system resources. SVC error resilience strives for reliability as well as efficiency of video transmission under unreliable network conditions. This paper presents a polyphase downsampling based redundant picture coding for SVC error resilience. Simulation results report that the proposed method outperforms the SVC error concealment method by 1.7 dB on average in terms of the PSNR.
Numerical treatment of stochastic models used in statistical systems and financial markets
Authors: Ameen Alawneh, Kamel Al-Khaled
Venue: Computers Mathematics with Applications (2008)

In this paper, by means of the variational iteration method, numerical solutions are computed for some stochastic models, without any linearization or weak assumptions. Two stochastic models, the Fokker-Planck equation for non-equilibrium statistical systems and the Black-Scholes model for pricing stock options, are solved numerically. In this approach, the solution is found in the form of a convergent series with easily computed components. The behavior of the approximate solutions is shown graphically.
Techniques for modeling and analyzing rna and protein folding energy landscapes
Authors: Nancy M. Amato
Venue:  (2007)

RNA and protein molecules undergo a dynamic folding process that is important to their function. Computational methods are critical for studying this folding process because it is difficult to observe experimentally. In this work, we introduce new computational techniques to study RNA and protein energy landscapes, including a method to approximate an RNA energy landscape with a coarse graph (map) and new tools for analyzing graph-based approximations of RNA and protein energy landscapes. These analysis techniques can be used to study RNA and protein folding kinetics such as population kinetics, folding rates, and the folding of particular subsequences. In particular, a map-based Master Equation (MME) method can be used to analyze the population kinetics of the maps, while another map analysis tool, map-based Monte Carlo (MMC) simulation, can extract stochastic folding pathways from the map. To validate the results, I compared our methods with other computational methods and with experimental studies of RNA and protein. I first compared our MMC and MME methods for RNA with other computational methods working on the complete energy landscape and show that the approximate map captures the major features of a much larger (e.g., by orders of magnitude) complete energy landscape. Moreover, I show that the methods scale well to large molecules, e.g., RNA with 200+ nucleotides. Then, I correlate the computational results with experimental findings. I present comparisons with two experimental cases to show how I can predict kinetics-based functional rates of ColE1 RNAII and MS2 phage RNA and their mutants using our MME and MMC tools respectively. I also show that the MME and MMC tools can be applied to map-based approximations of protein energy landscapes and present kinetics analysis results for several proteins.
From model-based strategies to intelligent control systems
Authors: Ioan Dumitrache
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

This paper presents the evolution of control systems and trends in the field of integrated computer, communication and cognitive sciences for control applications. There have been selected and presented the most efficient control strategies used in complex process control, as well as the limitations of model-based approaches in cases that imply complex, non-linear and uncertain process models. Concepts for autonomous control of complex systems by the integration of intelligent methodologies are analyzed. Some aspects of hybrid intelligent control are considered and new directions of research towards creating a new generation of control systems are presented. The paper also includes a review of the evolution of computer controlled applications and a new paradigm - C4 - is analyzed from concept to application. Therefore, the transition from C2 to C4 paradigm is illustrated in the context of integrating computers, communication and cognition in control. Finally, advanced control techniques for manufacturing are presented, including intelligent agents, leading to large Intelligent Manufacturing Systems. Some trends in the control of complex systems are presented, including multi-agent technology and hybrid systems formalism.
Network Traffic Classification by Common Subsequence Finding
Authors: Krzysztof Fabjański, Tomasz Kruk
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The paper describes issues related to network traffic analysis. The scope of this article includes discussion regarding the problem of network traffic identification and classification. Furthermore, paper presents two bioinformatics methods: Clustal and Center Star. Both methods were precisely adapted to the network security purpose. In both methods, the concept of extraction of a common subsequence, based on multiple sequence alignment of more than two network attack signatures, was used. This concept was inspired by bioinformatics solutions for the problems related to finding similarities in a set of DNA, RNA or amino acids sequences. Additionally, the scope of the paper includes detailed description of test procedures and their results. At the end some relevant evaluations and conclusions regarding both methods are presented.
Tight wavelet frames for subdivision
Authors: Maria Charina, Joachim Stöckler
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper we construct multivariate tight wavelet frame decompositions for scalar and vector subdivision schemes with nonnegative masks. The constructed frame generators have one vanishing moment and are obtained by factorizing certain positive semi-definite matrices. The construction is local and allows us to obtain framelets even in the vicinity of irregular vertices. Constructing tight frames, instead of wavelet bases, we avoid extra computations of the dual masks. In addition, the frame decomposition algorithm is stable as the discrete frame transform is an isometry on @?"2, if the data are properly normalized.
Design of Row-Based Flexible Manufacturing System with Evolutionary Computation
Authors: Mirko Ficko, Joze Balic
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

This paper discusses design of flexible manufacturing systems (FMSs) in one or multiple rows. Evolutionary computation, particularly genetic algorithms (GAs) proved to be successful in search of optimal solution for this type of problems. The model of solution, the most suitable way of coding the solutions into the organisms and the selected evolutionary and genetic operators are presented. In this connection, the most favourable number of rows and the sequence of devices in the individual row are established by means of genetic algorithms (GAs). In the end the test results of the application made and the analysis are discussed.
EMD Approach to Multichannel EEG Data - The Amplitude and Phase Synchrony Analysis Technique
Authors: Tomasz M. Rutkowski, Danilo P. Mandic, Andrzej Cichocki, Andrzej W. Przybyszewski
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Human brains expose the possibility to be connected directly to the intelligent computing applications in form of brain computer/ machine interfacing (BCI/BMI) technologies. Neurophysiological signals and especially electroencephalogram (EEG) are the forms of brain electrical activity which can be easily captured and utilized for BCI/BMI applications. Those signals are unfortunately highly contaminated by noise due to a very low level of electrophysiological signals and presence of different devices in the environment creating electromagnetic interference. In the proposed approach we first decompose each of the recorded channels, in multichannel EEG recording environment, into intrinsic mode functions (IMF) which are a result of empirical mode decomposition (EMD) extended to multichannel analysis in this paper. We present novel and interesting results on human mental and cognitive states estimation based on analysis of the above mentioned stimuli-related IMF components.
Generalized Graph Matching for Data Mining and Information Retrieval
Authors: Alexandra Brügger, Horst Bunke, Peter Dickinson, Kaspar Riesen
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

Graph based data representation offers a convenient possibility to represent entities, their attributes, and their relationships to other entities. Consequently, the use of graph based representation for data mining has become a promising approach to extracting novel and useful knowledge from relational data. In order to check whether a certain graph occurs, as a substructure, within a larger database graph, the widely studied concept of subgraph isomorphism can be used. However, this conventional approach is rather limited. In the present paper the concept of subgraph isomorphism is substantially extended such that it can cope with don't care symbols, variables, and constraints. Our novel approach leads to a powerful graph matching methodology which can be used for advanced graph based data mining.
Simulating the Coalescence and Separation of Bubble and Foam by Particle Level Set Method
Authors: Ryo Shimada, Sejuti Rahman, Yoichiro Kawaguchi
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

In this paper, we present a physics-based computer graphics technique for simulating and rendering foams and bubbles floating on the calm surface of fluid. We integrate rendering of bubble and foam, fluid simulation and the interactions between them to create the appearance of realistic liquids. As a whole, the animation of bubble that floats on the surface of fluid becomes possible by the technique of this research.
Shortest path network interdiction with asymmetric information
Authors: Halil Bayrak, Matthew D. Bailey,  M. D.
Venue: Networks (2008)

We consider an extension of the shortest path network interdiction problem. In this problem an evader attempts to minimize the length of the shortest path between the origin and the destination in a network, while an interdictor attempts to maximize the length of this shortest path by interdicting network arcs using limited resources. We consider the case where there is asymmetric information, i.e., the evader and the interdictor have different levels of information about the network. We formulate this problem as a nonlinear mixed integer program and show that this formulation can be converted to a linear mixed integer program. Computational results demonstrate improvements in the objective function values over the shortest path network interdiction problem with symmetric information. &copy; 2008 Wiley Periodicals, Inc. NETWORKS, 2008
FFT Implementation Alternatives in Advanced Measurement Systems
Authors: H. Der Auweraer, R. Snoeys
Venue: IEEE Micro (1987)

In choosing between FFT alternatives in DSP implementations, you'll need to consider the nature of the main processing device as well as execution times and cost.
Social Responses to Virtual Humans: Automatic Over-Reliance on the "Human" Category
Authors: Sung Park, Richard Catrambone
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In the human computer interaction (HCI) literature, responding socially to virtual humans means that people exhibit behavioral responses to virtual humans as if they are humans. Based partly on the work of Nass and his colleagues (for a review, see [1]), there is general agreement in the research community that people do respond socially to virtual humans. What seems to be vital, in terms of understanding why people respond socially to virtual humans, is how we respond socially to another person and how we know about others' temporary states (e.g., emotions, intentions) and enduring dispositions (e.g., beliefs, abilities).