ppxscal/embedding_network huggingface dataset:
Assessment of Common Regions and Specific Footprints of DNA Copy Number Aberrations Across Multiple Affymetrix SNP Mapping Arrays
Authors: Roberta Spinelli, Ingrid Cifola, Stefano Ferrero, Luca Beltrame, Paolo Mocarelli, Cristina Battaglia
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

The application of genome-wide approaches to the molecular characterization of cancer was investigated, identifying footprints that can potentially assist in the subclassification of tumors in order to contribute to diagnosis and clinical management of patients. High resolution DNA copy number analysis by single nucleotide polymorphism mapping array technology has been widely applied to study copy number aberrations and to distinguish among different loss of heterozigosity mechanisms associated with or without copy number changes in tumors. However, assessment of statistically significant common aberrations across the whole data set or a subset of tumor samples is still an open problem. Therefore, we adapted the recently developed STAC algorithm, previously applied to comparative genomic hybridization data, to identify common copy number aberrations in renal carcinoma samples using Affymetrix 100K SNP arrays. SNP copy number data were processed by a homebrew pipeline implemented in R and analyzed using STAC.
Classifier Ensemble Generation for the Majority Vote Rule
Authors: Carlos Orrite, Mario Rodríguez, Francisco Martínez, Michael Fairhurst
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

This paper addresses the problem of classifier ensemble generation. The goal is to obtain an ensemble to achieve maximum recognition gains with the lowest number of classifiers. The final decision is taken following a majority vote rule. If the classifiers make independent errors, the majority vote outperforms the best classifier. Therefore, the ensemble should be formed by classifiers exhibiting individual accuracy and diversity. To account for the quality of the ensemble, this work uses a sigmoid function to measure the behavior of the ensemble in relation to the majority vote rule, over a test labelled data set.
Error Correcting Codes from Quasi-Hadamard Matrices
Authors: V. Álvarez, J. A. Armario, M. D. Frau, E. Martin, A. Osuna
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

Levenshtein described in [5] a method for constructing error correcting codes which meet the Plotkin bounds, provided suitable Hadamard matrices exist. Uncertainty about the existence of Hadamard matrices on all orders multiple of 4 is a source of difficulties for the practical application of this method. Here we extend the method to the case of quasi-Hadamard matrices. Since efficient algorithms for constructing quasi-Hadamard matrices are potentially available from the literature (e.g. [7]), good error correcting codes may be constructed in practise. We illustrate the method with some examples.
Applying US DoD Human Engineering Methods to Reduce Procedural Error Related Outages
Authors: Pat O'Brien
Venue: Proceedings of the 4th international symposium on Service Availability (2007)

Human errors committed by network equipment (NE) maintainers cause the largest portion of all network outages and down time. This paper describes the application of US Department of Defense Human Engineering methods to resolve conflicts in standards; and, to identify and remove the root causes of design induced procedural errors. It demonstrates the application of human Fault Mode and Effects Analysis in the design of Motorola's AdvancedTCA® equipment. It also shows the resulting feedback loop to engineers to change the human-machine interface. The paper gives examples of reduced procedural error rates expected to result from the changes in the interface design.
Application of Fuzzy Integral Control for Output Regulation of Asymmetric Half-Bridge DC/DC Converter
Authors: Gyo-Bum Chung
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

This paper considers the problem of regulating the output voltage of an asymmetric half-bridge (AHB) DC/DC converter via fuzzy integral control. First, we model the dynamic characteristics of the AHB DC/DC converter with the state-space averaging method, and after introducing an additional integral state of the output regulation error, we obtain the Takagi-Sugeno (TS) fuzzy model for the augmented system. Second, the concept of the parallel distributed compensation is applied to the design of the TS fuzzy integral controller, in which the state feedback gains are obtained by solving the linear matrix inequalities (LMIs). Finally, numerical simulations are performed for the considered application. 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
Protean Graphs with a Variety of Ranking Schemes
Authors: Paweł Prałat
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to another. Recently there has been considerable interest in using random graphs to model complex real-world networks to gain an insight into their properties. In this paper, we propose a generalized version of the protean graph (a random model of the web graph) in which the degree of a vertex depends on its age. Classic protean graphs can be seen as a special case of the rank-based approach where vertices are ranked according to age. Here, we investigate graph generation models based on other ranking schemes and show that these models lead to graphs with a power law degree distribution.
Effective Emission Tomography Image Reconstruction Algorithms for SPECT Data
Authors: J. Ramírez, J. M. Górriz, M. Gómez-Río, A. Romero, R. Chaves, A. Lassl, A. Rodríguez, C. G. Puntonet, F. Theis, E. Lang
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Medical image reconstruction from projections is computationally intensive task that demands solutions for reducing the processing delay in clinical diagnosis applications. This paper analyzes reconstruction methods combined with pre- and post-filtering for Single Photon Emission Computed Tomography (SPECT) in terms of convergence speed and image quality. The evaluation is performed by means of an image database taken from a concurrent study investigating the use of SPECT as a diagnostic tool for the early onset of Alzheimer-type dementia. Filtered backprojection (FBP) methods combined with frequency sampling 2D pre- and post-filtering provides a good trade-off between image quality and delay. Maximum likelihood expectation maximization (ML-EM) improves the quality of the reconstructed image but with a considerable increase in processing delay. To overcome this problem the ordered subsets expectation maximization (OS-EM) method is found to be an effective algorithm for reducing the computational cost with an image quality similar to ML-EM.
Iterative interpretation of tail-recursive LISP procedures
Authors: Patrick Greussay
Venue: Issue 2 (July 1978) (1978)

The design of a LISP interpreter that allows tail-recursive procedures to be interpreted iteratively is presented at the machine-language level. Iterative interpretation means that, without any program transformations, no environments and continuations will be stacked unless necessary. We apply a specific modification within a traditional stack-oriented version of LISP interpreter, without any non-recursive control structure. The design is compatible with value-cells as well as a-lists LISP processors. We present a complete modified interpreter written itself in LISP and an informal proof that it meets its requirements.
Goal-Centric Traceability: Using Virtual Plumblines to Maintain Critical Systemic Qualities
Authors: Jane Cleland-Huang, Will Marrero, Brian Berenbach
Venue: IEEE Transactions on Software Engineering (2008)

Successful software development involves the elicitation, implementation, and management of critical systemic requirements related to qualities such as security, usability, and performance. Unfortunately, even when such qualities are carefully incorporated into the initial design and implemented code, there are no guarantees that they will be consistently maintained throughout the lifetime of the software system. Even though it is well known that system qualities tend to erode as functional and environmental changes are introduced; existing regression testing techniques are primarily designed to test the impact of change upon system functionality rather than to evaluate how it might affect qualities such as performance, usability, or portability. The concept of using goal-centric traceability to establish relationships between a set of strategically placed assessment models and system goals is introduced. This paper describes the process, algorithms, and techniques for utilizing goal models to establish executable traces between goals and assessment models, detect change impact points through the use of automated traceability techniques, propagate impact events, and assess the impact of change upon systemic qualities. The approach is illustrated through two case studies respectively representing a small business application and a safety-critical real-time system.
Single Sign on System Architecture Based on SAML in Web Service Environment Using ENUM System
Authors: Jiwon Choi, Keecheon Kim
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

Recently, with development of Internet telephone, we can say that the ENUM could be the most suitable Internet identification system standard in the BcN(NGN). When embody ENUM, there are problems on security for personal information and convergence with existing domain. And it is need that ENUM service provides convenient function to users. In this paper, we design the system that offers Single Sign On without division of user terminal using SAML when it requires URL with a telephone number to ENUM DNS.
Airplane landing gear performance solutions with an electronic analog computer
Authors: D. W. Drake, H. W. Foster
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

The typical airplane landing gear is basically a rather simple shock absorbing device whose characteristics can normally be described with considerable accuracy by a system of three or four simultaneous differential equations. However, due to the fact that the system includes a number of non-linear and discontinuous elements, it has been impractical to obtain analytical solutions of the equations without making simplifying assumptions which severely limited the value of the results. For this reason the shock strut energy absorbing characteristics have generally been developed experimentally by laboratory drop tests of an actual landing gear, and the landing gear evaluation has been accomplished by extensive laboratory and flight tests. This design method is obviously far from ideal, since all structure effected by landing loads must originally be designed to assumed landing gear characteristics, and the landing gear test results do not become available in time to allow design changes to be made economically.
On the increase of the isolation efficacy for the passive elastic devices by the structural configuration optimization
Authors: Silviu Nastac
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

This paper present the main results obtained from the complex study intended for increasing the isolation efficacy on the passive elastic anti-vibrational devices, based on the rubber elements. At first, the author present the main theoretical aspects regarding the dynamic analysis of the passive elastic anti-vibrational devices and their isolation degree evaluation. It have to be mentioned that it was supposed only the systems based on rubber elements. There are also presented the final structural configuration devices, obtained by a selection procedure based on the numerical simulation of dynamic behaviour for each device type. Taking into account the structure of the basic elastic elements, their working principle, and their functional restraints, there was tested a lot of possible configurations, both from the structural, and from the functional points of view. Through the comparative analysis of the acquired results it was fixed the final and operational structural configuration. All the theoretical suppositions, completed by the computer simulation on the numerical models, was entirety validated through the experimental tests on realistic models. The main conclusion of this study integrate the major advantages of a complex structural and functional configuration utilization, with a view to the increasing of the isolation degree and to the raising of the passive anti-vibrational elastic devices performances. The utilization of these inovative anti-vibrational devices leads to the significant increasing of the isolation degree on a large area of technical and industrial applications. If it is necessary, the basic structural configuration could be modified, as a spatial distribution of the components, thus that the device could be used on a practical given application.
Optimizing Building's Environments Performance Using Intelligent Systems
Authors: E. Sierra, A. Hossian, D. Rodríguez, M. García-Martínez, P. Britos, R. García-Martínez
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

This article describes an intelligent system architecture that based on neural networks, expert systems and negotiating agents technologies is designed to optimize intelligent building's performance. By understanding a building as a dynamic entity capable of adapting itself not only to changing environmental conditions but also to occupant's living habits, high standards of comfort and user satisfaction can be achieved. Results are promising and encourage further research in the field of artificial intelligence applications in building automation systems.
Diagnostic checking for multivariate regression models
Authors: Lixing Zhu, Ruoqing Zhu, Song Song
Venue: Journal of Multivariate Analysis (2008)

Diagnostic checking for multivariate parametric models is investigated in this article. A nonparametric Monte Carlo Test (NMCT) procedure is proposed. This Monte Carlo approximation is easy to implement and can automatically make any test procedure scale-invariant even when the test statistic is not scale-invariant. With it we do not need plug-in estimation of the asymptotic covariance matrix that is used to normalize test statistic and then the power performance can be enhanced. The consistency of NMCT approximation is proved. For comparison, we also extend the score type test to one-dimensional cases. NMCT can also be applied to diverse problems such as a classical problem for which we test whether or not certain covariables in linear model has significant impact for response. Although the Wilks lambda, a likelihood ratio test, is a proven powerful test, NMCT outperforms it especially in non-normal cases. Simulations are carried out and an application to a real data set is illustrated.
A literature review of electronic marketplace research: Themes, theories and an integrative framework
Authors: Shan Wang, Shi Zheng, Lida Xu, Dezheng Li, Huan Meng
Venue: Information Systems Frontiers (2008)

In this paper, we presented a literature review of the current status of electronic marketplace (EM) research. It consists of 109 journal articles published in 19 journals that are appropriate outlets for electronic commerce research. The results show that an increasing volume of EM research has been conducted from diverse theoretical perspectives. Based on content analysis, we identified eight research themes, five types of methodologies and six categories of background theories which most EM researches were grounded in. By combining research themes and the patterns of the background theories, an integrative framework of EM was proposed to represent the paradigms of EM researches. The framework shows that EM phenomena can be addressed from three perspectives: information systems, inter-organizational/social structure and strategic management perspectives. This framework suggests a parsimonious and cohesive way to explain key EM research issues such as EM adoption, success and impact.
Non-blocking root scanning for real-time garbage collection
Authors: Wolfgang Puffitsch, Martin Schoeberl
Venue: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems (2008)

Root scanning is a well known source of blocking times due to garbage collection. In this paper, we show that root scanning only needs to be atomic with respect to the thread whose stack is scanned. We propose two solutions to utilize this fact: (a) block only the thread whose stack is scanned, or (b) shift the responsibility for root scanning from the garbage collector to the application threads. The latter solution eliminates blocking due to root scanning completely. Furthermore, we show that a snapshot-at-beginning write barrier is sufficient to ensure the consistency of the root set even if local root sets are scanned independently of each other. The impact of solution (b) on the execution time of a garbage collector is shown for two different variants of the root scanning algorithm. Finally, we evaluate the resulting real-time garbage collector in a real system to confirm our theoretical findings.
Approximating the Generalized Capacitated Tree-Routing Problem
Authors: Ehab Morsy, Hiroshi Nagamochi
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V,E) with a sink s ¿ V and a set M ¿ V ¿ {s} of terminals with a nonnegative demand q(v), v ¿ M, we wish to find a collection ${\mathcal T}=\{T_{1},T_{2},\ldots,T_{\ell}\}$ of trees rooted at s to send all the demands to s, where the total demand collected by each tree T i is bounded from above by a demand capacity ¿> 0. Let ¿> 0 denote a bulk capacity of an edge, and each edge e ¿ E has an installation cost w(e) ¿ 0 per bulk capacity; each edge e is allowed to have capacity k¿ for any integer k, which installation incurs cost kw(e). To establish a tree routing T i , each edge e contained in T i requires ¿ + βq¿ amount of capacity for the total demand q¿ that passes through edge e along T i and prescribed constants ¿,β ¿ 0, where ¿ means a fixed amount used to separate the inside of the routing T i from the outside while term βq¿ means the net capacity proportional to q¿. The objective of GCTR is to find a collection ${\mathcal T}$ of trees that minimizes the total installation cost of edges. Then GCTR is a new generalization of the several known multicast problems in networks with edge/demand capacities. In this paper, we prove that GCTR is $(2[ \lambda/(\alpha+\beta \kappa)] /\lfloor \lambda/(\alpha+\beta \kappa)\rfloor +\rho_{\mbox{\tiny{\sc ST}}})$-approximable if ¿ ¿ ¿ + β¿ holds, where $\rho_{\mbox{\tiny{\sc ST}}}$ is any approximation ratio achievable for the Steiner tree problem.
Predicting bankruptcies using rough set approach: the case of Turkish banks
Authors: Nursel Selver Ruzgar, Fahri Unsal, Bahadtin Ruzgar
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

Evaluation of the reasons for business failures has been a major preoccupation of researchers and practitioners for many years. A large number of methods including multiple regression analysis, discriminant analysis, logit analysis, recursive partitioning algorithm, and several other techniques have been used for the prediction of business failures. This study has followed a different approach using the Rough Set theory to investigate the reasons of bankruptcies in the Turkish banking system. For this purpose, financial ratios of 29-41 commercial banks were examined for the 1995-2007 period. The results showed that this model is a promising alternative to the conventional methods for bankruptcy prediction.
An Efficient Algorithm for Clustering Search Engine Results
Authors: Hui Zhang, Bin Pang, Ke Xie, Hui Wu
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

With the increasing number of Web documents in the Internet, the most popular keyword-matching-based search engines, such as Google, often return a long list of search results ranked based on their relevancy and importance to the query. To cluster the search engine results can help users find the results in several clustered collections, so it is easy to locate the valuable search results that the users really needed. In this paper, we propose a new Key-Feature Clustering (KFC) algorithm which firstly extracts the significant keywords from the results as key features and cluster them, then clusters the documents based on these clustered key features. At last, the paper presents and analyzes the results from experiments we conducted to test and validate the algorithm.
Programming in Ωmega
Authors: Tim Sheard, Nathan Linger
Venue: Central European Functional Programming School: Second Summer School, CEFP 2007, Cluj-Napoca, Romania, June 23-30, 2007, Revised Selected Lectures (2008)

This report was originally prepared as notes for a short course on &Omega;mega taught at the Central-European Functional Programming School held in Cluj, Romania, between 25-30 June, 2007. It can be viewed as a tutorial on the use of the &Omega;mega programming language. It introduces readers to the types as propositions notion based upon the Curry-Howard isomorphism. Such types can express precise properties of programs. The &Omega;mega language allows us to use a single language for the specification of designs, the definition of properties, the implementation of programs, and the production of proofs that programs adhere to their properties. &Omega;mega bundles all these in a coherent manner into a single unified system that appears to the user to be a programming language.
From Logic to Physics: How the Meaning of Computation Changed over Time
Authors: Itamar Pitowsky
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The common formulation of the Church-Turing thesis runs as follows:Every computable partial function is computable by a Turing machineWhere by partial function I mean a function from a subset of natural numbers to natural numbers. As most textbooks relate, the thesis makes a connection between an intuitive notion (computable function) and a formal one (Turing machine). The claim is that the definition of a Turing machine captures the pre-analytic intuition that underlies the concept computation. Formulated in this way the Church-Turing thesis cannot be proved in the same sense that a mathematical proposition is provable. However, it can be refuted by an example of a function which is not Turing computable, but is nevertheless calculable by some procedure that is intuitively acceptable.
Ink Jet Printing of Japanese Kanji Characters
Authors: Takehiko Tomikawa, Kinji Matsumoto
Venue: IEEE Micro (1981)

The generality and flexibility of the microprocessor suit it to this sophisticated control application.