ppxscal/embedding_network huggingface dataset:
Usage of artificial intelligence methods in free flowing gated closed conduits for estimation of oxygen transfer efficiency
Authors: A. Baylar, M. Batan
Venue: Advances in Engineering Software (2010)

Oxygen transfer is the process which oxygen is transferred from the gaseous to the liquid phase. The oxygen transfer efficiency depends almost entirely on the amount of surface contact between the air and water. This surface contact can be increased by conduit flow that involves air-water mixture flow. In reality, the physical structure of the air-water interface is complex and still awaits clarification. In the past few years, many artificial intelligence methods have been successfully applied to the solution of complex problems. In this study, models based on Adaptive Network based Fuzzy Inference Systems and Least Squares Support Vector Machines methods were developed to predict oxygen transfer efficiency in free flowing gated closed conduits. Experimental results were compared with the results of these artificial intelligence methods. The best performance was obtained with the Least Squares Support Vector Machine model. Average correlation coefficient (R^2) and average root mean square error (RMSE) in the Least Squares Support Vector Machine model were achieved equal to 0.9927 and 0.0073, respectively. Extremely good agreement between the predicted and measured values proves the validity of the Least Squares Support Vector Machine model.
Timer-based composition of fault-containing self-stabilizing protocols
Authors: Yukiko Yamauchi, Sayaka Kamei, Fukuhito Ooshita, Yoshiaki Katayama, Hirotsugu Kakugawa, Toshimitsu Masuzawa
Venue: Information Sciences: an International Journal (2010)

One of the desired properties of distributed systems is self-adaptability against faults. Self-stabilizing protocols provide autonomous recovery from any finite number of transient faults. However, in practice, catastrophic faults rarely occur, while small-scale faults are more likely to occur. Fault-containing self-stabilizing protocols promise not only self-stabilization but also containment of the effect of small-scale faults, i.e., they promise quick recovery and small effect for small-scale faults. Hierarchical composition of self-stabilizing protocols is expected to ease the design of new self-stabilizing protocols. However, existing composition techniques for self-stabilizing protocols cannot preserve the fault-containment property of source protocols. In this paper, we propose a novel timer-based hierarchical composition of fault-containing self-stabilizing protocols that preserves the fault-containment property of source protocols. To implement timers, we propose a local neighborhood synchronizer that synchronizes limited number of processes during a short time after a fault without involving the entire network into the synchronization. The proposed composition technique facilitates the design of new fault-containing self-stabilizing protocols and enhances the reusability of existing fault-containing self-stabilizing protocols.
Modeling macro–molecular interfaces with Intervor
Authors: Sébastien Loriot, Frédéric Cazals
Venue: Bioinformatics (2010)

Summary:Intervor is a software computing a parameter-free representation of macro–molecular interfaces, based on the α-complex of the atoms. Given two interacting partners, possibly with water molecules squeezed in-between them, Intervor computes an interface model which has the following characteristics: (i) it identifies the atoms of the partners which are in direct contact and those whose interaction is water mediated, (ii) it defines a geometric complex separating the partners, the Voronoi interface, whose geometric and topological descriptions are straightforward (surface area, number of patches, curvature), (iii) it allows the definition of the depth of atoms at the interface, thus going beyond the traditional dissection of an interface into a core and a rim. These features can be used to investigate correlations between structural parameters and key properties such as the conservation of residues, their polarity, the water dynamics at the interface, mutagenesis data, etc. Availability:Intervor can be run from the web site http://cgal.inria.fr/abs/Intervor or upon downloading the binary file. Plugins are also made available for VMD and Pymol. Contact: frederic.cazals@sophia.inria.fr 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
Technical communique: Parameterization theory of balanced truncation method for any evenly distributed RC interconnect circuits and transmission lines
Authors: Sheng-Guo Wang, Ben Wang
Venue: Automatica (Journal of IFAC) (2010)

This paper presents a parameterization theory of balanced truncation method (BTM) for any evenly distributed RC interconnect and transmission lines and their BTM reduction models. The parameterization theory shows that any evenly distributed RC line circuits of the same order have the same balanced gramian, BTM error upper bound, and BTM approximation error, which are independent of their RC parameters. Thus, the prototype model is proposed for research to dramatically reduce the computations for various RC parameters. Under normalized (scaled) time axis and frequency axis, any time responses and the Bode plots of their BTM reduction models are also the same as the ones of the prototype BTM reduction models, respectively. The simulations demonstrate the theory. The reduction model order can be identified by the prototype model. The new results can be applied to not only the model reduction of interconnects or transmission lines, but also control systems with transmission lines, networks, or time delay units.
Measuring the efficiency of securities companies by corporate governance in a financial holding and non-financial holding system
Authors: Chin-Piao Yeh, Kuan-Min Wang, Kuang-Cheng Chai
Venue: Expert Systems with Applications: An International Journal (2010)

This paper applies data envelopment analysis (DEA) and a Tobit regression model with corporate governance variables to analyze and compare the operational efficiency of 14 securities companies in financial holding system, and 12 in non-financial holding system in Taiwan. The results suggest four commonalities in the modules. (1) A securities company's operating results can be enhanced when joining the financial holding system. (2) Board size does not affect the efficiency of a securities company. (3) The holding of concurrent posts of president and general manager would not affect a securities company's operating performance. (4) An increase in the average director bonus would reduce company efficiency. In addition, there are two differences. (1) An increase in the major shareholders' shareholding ratio would increase the operational efficiency of a securities company that has joined the financial holding system; however, the impact on those in the non-financial holding system would be insignificant. (2) Profit from the sale of securities would increase the efficiency of a securities company in a non-financial holding system but would not lead to an increase of those in the financial holding system.
A gain-based lower bound algorithm for real and mixed µ problems
Authors: Pete Seiler, Andrew Packard, Gary J. Balas
Venue: Automatica (Journal of IFAC) (2010)

A new lower bound algorithm for real and mixed @m problems is presented. The basic idea of this algorithm is to use a related worst-case gain problem to compute the real blocks and, if the block structure is mixed, the standard power iteration to compute the complex blocks. Numerical tests indicate that the algorithm is fast and provides good lower bounds for both real and mixed @m problems of small to moderate size.
Extending software component models with the master-worker paradigm
Authors: Hinde Lilia Bouziane, Christian Pérez, Thierry Priol
Venue: Parallel Computing (2010)

Recent advances in computing and networking technologies-such as multi-core processors and high bandwidth wide area networks-lead parallel infrastructures to reach a higher degree of complexity. Programmers have to face with both parallel and distributed programming paradigms when designing an application. This is especially true when dealing with e-Science applications. Moreover, as parallel processing is moving to the mainstream, it does not seem appropriate to rely on low-level solutions requiring expert knowledge. This paper studies how to combine modern programming practices such as those based on software components and one of the most important parallel programming paradigms which is the well-known master-worker paradigm. The goal is to provide a simple and resource transparent model while enabling an efficient utilization of resources. The paper proposes a generic approach to embed the master-worker paradigm into software component models and describes how this generic approach can be implemented within an existing software component model. The overall approach is validated with synthetic experiments on clusters and the Grid'5000 testbed.
The rational child: theories and evidence in prediction, exploration, and explanation
Authors: Laura Schulz
Venue:  (2009)

In this thesis, rational Bayesian models and the Theory-theory are bridged to explore ways in which children can be described as Bayesian scientists. I investigate what it means for children to take a rational approach to processes that support learning. In particular, I present empirical studies that show children making rational predictions, exploration, and explanations. I test the claim that differences in prior beliefs or changes in the observed evidence should affect these behaviors. The studies presented in this thesis encompass two manipulations: in some conditions, children's prior beliefs are equal, but the patterns of evidence are varied; in other conditions, children observe identical evidence but children's prior beliefs are varied. I incorporate an additional approach in this thesis, testing children within a variety of domains, tapping into their intuitive theories of biological kinds, psychosomatic illness, balance, and physical systems. Chapter One introduces the problem. Chapter Two explores how evidence and children's strong beliefs about biological events and psychosomatic illness influence their forced-choice explanations in a story-book task. Chapter Three presents a training study to further investigate the developmental differences discussed in Chapter Two. Chapter Four looks at how children's strong differential beliefs of balance interact with evidence to affect their predictions, play, explanations, and learning. Chapter Five looks at children's exploratory play with a jack-in-the-box, (where children don't have strong, differential beliefs), given different patterns of evidence. Chapter Six investigates children's explanations following theory-neutral evidence about a mechanical toy. Chapter Seven concludes the thesis. The following chapters will suggest that frameworks combining evidence and theories capture children's causal learning about the world. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.) 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
An architecture for object-based storage systems
Authors: Jeffrey Stevens
Venue:  (2009)

Data storage systems have seen massive performance and size improvements in the past decades yet still fail to solve the needs of many users. The vast majority of academic research and commercial inroads in data storage systems focuses on vertical improvement: bigger, faster, more consolidated systems hosted in a centralized location, though at an increasingly high cost. This solution meets the needs of academic, governmental, and large commercial scientific communities but leaves out many small and mid-sized organizations. This user base is in need of a distributed, low-cost solution that is inexpensive to acquire, operate, and maintain. Centralization of storage for a distributed organization requires sufficient network bandwidth to send all data to the central location for storage. The bulk of current research and commercial development today focuses on fabric-attached storage systems, specifically network-attached storage and storage-area networks. Both of these solutions, while extremely efficient in an environment where they fit, are not suited for all environments. It is the thesis of this dissertation that an architecture can be found which will store all organizational data in one distributed storage system, be simple to use, allow any user to access data in any location, include simple management tools, and do all of this at a low cost. The solution utilizes direct-attached storage as the storage hardware architecture, with an object-oriented database as the software basis of the system. Specific performance goals are laid out and testing performed to determine whether this new architecture can meet those goals. 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
Note: Multiple cross-intersecting families of signed sets
Authors: Peter Borg, Imre Leader
Venue: Journal of Combinatorial Theory Series A (2010)

A k-signed r-set on[n]={1,...,n} is an ordered pair (A,f), where A is an r-subset of [n] and f is a function from A to [k]. Families A"1,...,A"p are said to be cross-intersecting if any set in any family A"i intersects any set in any other family A"j. Hilton proved a sharp bound for the sum of sizes of cross-intersecting families of r-subsets of [n]. Our aim is to generalise Hilton's bound to one for families of k-signed r-sets on [n]. The main tool developed is an extension of Katona's cyclic permutation argument.
DASS-GUI
Authors: Jens Hollunder, Maik Friedel, Martin Kuiper, Thomas Wilhelm
Venue: Bioinformatics (2010)

Summary: Many large ‘omics’ datasets have been published and many more are expected in the near future. New analysis methods are needed for best exploitation. We have developed a graphical user interface (GUI) for easy data analysis. Our discovery of all significant substructures (DASS) approach elucidates the underlying modularity, a typical feature of complex biological data. It is related to biclustering and other data mining approaches. Importantly, DASS-GUI also allows handling of multi-sets and calculation of statistical significances. DASS-GUI contains tools for further analysis of the identified patterns: analysis of the pattern hierarchy, enrichment analysis, module validation, analysis of additional numerical data, easy handling of synonymous names, clustering, filtering and merging. Different export options allow easy usage of additional tools such as Cytoscape. Availability: Source code, pre-compiled binaries for different systems, a comprehensive tutorial, case studies and many additional datasets are freely available at http://www.ifr.ac.uk/dass/gui/. DASS-GUI is implemented in Qt. Contact:jehol@psb.vib-ugent.be; thomas.wilhelm@bbsrc.ac.uk Supplementary information:Supplementary data are available at Bioinformatics online. 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
On geometric SDPS-sets of elliptic dual polar spaces
Authors: Bart De Bruyn
Venue: Journal of Combinatorial Theory Series A (2010)

Let n@?N@?{0,1} and let K and K^' be fields such that K^' is a quadratic Galois extension of K. Let Q^-(2n+1,K) be a nonsingular quadric of Witt index n in PG(2n+1,K) whose associated quadratic form defines a nonsingular quadric Q^+(2n+1,K^') of Witt index n+1 in PG(2n+1,K^'). For even n, we define a class of SDPS-sets of the dual polar space DQ^-(2n+1,K) associated to Q^-(2n+1,K), and call its members geometric SDPS-sets. We show that geometric SDPS-sets of DQ^-(2n+1,K) are unique up to isomorphism and that they all arise from the spin embedding of DQ^-(2n+1,K). We will use geometric SDPS-sets to describe the structure of the natural embedding of DQ^-(2n+1,K) into one of the half-spin geometries for Q^+(2n+1,K^').
Some properties of certain classes of meromorphically p-valent functions involving extended multiplier transformations
Authors: R. M. El-Ashwah, M. K. Aouf
Venue: Computers Mathematics with Applications (2010)

In this paper, the authors investigate interesting properties of certain subclasses of meromorphically multivalent functions which are defined here by means of extended multiplier transformations.
Combining information from multiple search engines-Preliminary comparison
Authors: Maria Ganzha, Marcin Paprzycki, Jakub Stadnik
Venue: Information Sciences: an International Journal (2010)

The total number of popular search engines has decreased over time from its peak of the late 1990s. However, when combining the three remaining major ones (Yahoo!, Google, MS Live) with large repositories of information (e.g. BBC.com, NYT.com, Gazeta.pl, etc.), the total number of important information sources can be seen as slowly increasing. Focusing on utilization of search engines only, it is easy to observe that the same query issued to each one of them results in different ''suggestions.'' The question thus arrives, is it possible (and worthy) to combine responses obtained from each one of them into a single answer set. In this paper, we look into three approaches of achieving this goal, which are based on: Game theory, Auction and Consensus methods, while our focus is to study (and compare) their ''performance.''
Rubik's cube watermark technology for grayscale images
Authors: Ester Yen, Li-Hsien Lin
Venue: Expert Systems with Applications: An International Journal (2010)

A new chaotic mixing algorithm based on the concept of Rubik's cube has been proposed in this paper for watermarking images. We use the discrete wavelet transform to decompose the primary image and perform the low frequency sub-band as robustness on embedding watermark. Before embedding the watermark, we obtain noise signals by our Rubik's cube algorithm to protect original watermark. In the embedding phase, the eigenvalues of both reference watermark and primary images are extracted via SVD. We combine the eigenvalues which strongly represent the image and then perform inverse DCT and inverse DWT to result a watermarked image.
GRA method for multiple attribute decision making with incomplete weight information in intuitionistic fuzzy setting
Authors: Gui-Wu Wei
Venue: Knowledge-Based Systems (2010)

The aim of this paper is to investigate the multiple attribute decision-making problems with intuitionistic fuzzy information, in which the information about attribute weights is incompletely known, and the attribute values take the form of intuitionistic fuzzy numbers. In order to get the weight vector of the attribute, we establish an optimization model based on the basic ideal of traditional grey relational analysis (GRA) method, by which the attribute weights can be determined. Then, based on the traditional GRA method, calculation steps for solving intuitionistic fuzzy multiple attribute decision-making problems with incompletely known weight information are given. The degree of grey relation between every alternative and positive-ideal solution and negative-ideal solution are calculated. Then, a relative relational degree is defined to determine the ranking order of all alternatives by calculating the degree of grey relation to both the positive-ideal solution (PIS) and negative-ideal solution (NIS) simultaneously. Finally, an illustrative example is given to verify the developed approach and to demonstrate its practicality and effectiveness.
Fuzzy system-based real-time face tracking in a multi-subject environment with a pan-tilt-zoom camera
Authors: Chia-Feng Juang, Shu-Wew Chang
Venue: Expert Systems with Applications: An International Journal (2010)

This paper proposes real-time face tracking in a multi-subject environment with a pan-tilt-zoom camera using the fuzzy system technique. Tracking is based on detected faces in the Hue-Saturation-Value (HSV) color space. To detect faces, a fuzzy classifier segments skin colors in the HS color space. To reduce the influence of illumination, a fuzzy system is designed to adaptively determine the fuzzy classifier segmentation threshold according the V color space of an image. Detected skin regions are considered face candidates. Shape and color features serve as another fuzzy classifier inputs, leading to a final detection. For face tracking, a Kalman filter algorithm predicts face detection regions and corrects tracking trajectory. When no face is detected, the consecutive frame difference is employed to track the moving person to avoid tracking lost. To track a specific person among multiple persons, a clothing color histogram in the HS space serves as the determination criterion. The performance of the proposed face detection method is compared to other real-time face detection methods. In real-time operations, the tracking system uses camera panning, tilting, and zooming operations to keep the tracked person within the camera view and maintain a suitable face size in the image.
A link between H3K27me3 mark and exon length in the gene promoters of pluripotent and differentiated cells
Authors: Liang Chen
Venue: Bioinformatics (2010)

We conducted a reanalysis of genome-wide histone H3 tail methylation data in mammalian pluripotent and differentiated cells. We show that the promoters marked with histone H3 lysine 27 trimethylation (H3K27me3) tend to have more exonic positions in the promoter regions. However, this is not due to any preferential marking on exons over introns by H3K27me3. The relationship is also independent the status of histone H3 lysine 4 trimethylation (H3K4me3) mark, CpG content and the platforms used in the high-throughput profiling of histone modifications. It provides evidence for the link between histone modifications and transcribed exons in promoter regions. Contact: liang.chen@usc.edu Supplementary information: Supplementary data are available at Bioinformatics online. 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
Java-based HTTP input channel for heterogeneous wireless networks
Authors: J.-Z. Sun, J. Riekki, M. Jurmu, J. Sauvola
Venue: International Journal of Computers and Applications (2008)

HTTP is a key application-level protocol in enabling Internet services. The trend of network convergence and mobile accessibility brings new challenges to the protocol. This paper describes the design and implementation of an architecture for Java-based HTTP input channel for multi-access wireless network. An HTTP input channel can adapt its behavior according to the changing network status in a context-aware fashion. The adaptation includes both selecting and dynamically switching the underlying connection used, as well as coping with disconnection situation. The adaptation is performed at channel level instead of device level, so that multiple connections in one user device can be utilized simultaneously. Experiments were performed in a GPRS-WLAN integrated environment to demonstrate the operational correctness of the architecture. Performance metrics were measured and analyzed.