ppxscal/embedding_network huggingface dataset:
How accurately can we control the FDR in analyzing microarray data?
Authors: Sin-Ho Jung, Woncheol Jang
Venue: Bioinformatics (2006)

Summary: We want to evaluate the performance of two FDR-based multiple testing procedures by Benjamini and Hochberg (1995, J. R. Stat. Soc. Ser. B, 57, 289–300) and Storey (2002, J. R. Stat. Soc. Ser. B, 64, 479–498) in analyzing real microarray data. These procedures commonly require independence or weak dependence of the test statistics. However, expression levels of different genes from each array are usually correlated due to coexpressing genes and various sources of errors from experiment-specific and subject-specific conditions that are not adjusted for in data analysis. Because of high dimensionality of microarray data, it is usually impossible to check whether the weak dependence condition is met for a given dataset or not. We propose to generate a large number of test statistics from a simulation model which has asymptotically (in terms of the number of arrays) the same correlation structure as the test statistics that will be calculated from the given data and to investigate how accurately the FDR-based testing procedures control the FDR on the simulated data. Our approach is to directly check the performance of these procedures for a given dataset, rather than to check the weak dependency requirement. We illustrate the proposed method with real microarray datasets, one where the clinical endpoint is disease group and another where it is survival. Contact: jung0005@mc.duke.edu
Neutralization theory and online software piracy: An empirical analysis
Authors: Sameer Hinduja
Venue: Ethics and Information Technology (2007)

Accompanying the explosive growth of information technology is the increasing frequency of antisocial and criminal behavior on the Internet. Online software piracy is one such behavior, and this study approaches the phenomenon through the theoretical framework of neutralization theory. The suitability and applicability of nine techniques of neutralization in determining the act is tested via logistic regression analyses on cross-sectional data collected from a sample of university students in the United States. Generally speaking, neutralization was found to be weakly related to experience with online software piracy; other elements which appear more salient are suggested and discussed in conclusion.
Facial Complex Expression Recognition Based on Fuzzy Kernel Clustering and Support Vector Machines
Authors: Hui Zhao, Zhiliang Wang, Jihui Men
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Present methods of facial expression recognition usually designate an expression image as one kind of six facial basic expressions. However, a facial expression usually is a complex expression that consists of several basic expressions. This paper proposes a facial complex expression recognition algorithm based on fuzzy kernel clustering and support vector machines. This algorithm designs the binary facial complex expression classification tree by using fuzzy kernel clustering algorithm, trains support vector machines at each node of the binary classification tree and describes the complexity of a facial expression according as the result of support vector machines classification. Experimental results indicate that the proposed algorithm generates higher accuracy for the JAFFE database and achieves better performance than 1-a-r SVMs. In addition, experimental results show that the result of the proposed method is more accord with practice than the result of traditional expression recognition methods.
A Granular Ranking Algorithm for Mining Market Values
Authors: Xiaofeng Wang, Zhen Cao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper proposes a granular ranking algorithm for mining market values, gives the framework of algorithm and the concrete algorithm steps. The core of new algorithm is the construction of Granular Ranking Function ) (x rG , which guides instances in the testing dataset finish ranking. The ranked result has a strong readability. The new algorithm improves the computation efficiency further relative to existing algorithms, e.g. the Market Value Function. The experiment result shows that the computation accuracy of granular ranking algorithm approaches to the market value function. Meanwhile, Incremental Granular Ranking Algorithm also is discussed in the paper.
Games and Simulation: DS Online's Newest Topic Area
Authors: Swen Stoop, Andy Turner
Venue: IEEE Distributed Systems Online (2007)

Games and simulations are becoming serious business with serious applications, and demand is growing for knowledge about their design and application. This demand currently far outstrips supply; knowledge is dispersed over many organizations and business and academic disciplines, it's strongly individualized, and it's often anecdotal, lacking clear, consistent design and application guidelines. The editors of a new DS Online topic area on games and simulations hope to help remedy this situation.
Input-Output Tools: A Language Facility for Interactive and Real-Time Systems
Authors: J. Van Den Bos
Venue: IEEE Transactions on Software Engineering (1983)

A conceptual model is discussed which allows the hierarchic definition of high-level input driven objects, called input-output tools, from any set of basic input primitives. An input-output tool is defined as a named object. Its most important elements are the input rule, output rule, internal tool definitions, and a tool body consisting of executable statements. The input rule contains an expression with tool designators as operands and with operators allowing for sequencing, selection, interleaving, and repetition. Input rules are similar in appearance to production rules in grammars. The input expression specifies one or more input sequences, or input patterns, in terms of tool designators. An input parser tries, at run-time, to match (physical) input tokens against active input sequences. If a match between an input token and a tool designator is found, the corresponding tool body is executed, and the output is generated according to specifications in the tool body. The control structures in the input expression allow a variety of input patterns from any number of sources. Tool definitions may occur in-line or be stored in a library. All tools are ultimately encompassed in one tool representing the program.
On Linguistic Support for Distributed Programs
Authors: B. Liskov
Venue: IEEE Transactions on Software Engineering (1982)

Technological advances have made it possible to construct systems from collections of computers connected by a network. At present, however, there is little support for the construction and execution of software to run on such a system. Our research concerns the development of an integrated language/system whose goal is to provide the needed support. This paper discusses a number of issues that must be addressed in such a language. The major focus of our work and this paper is support for the construction of robust software that survives node, network, and media failures.
Mitrion-C Application Development on SGI Altix 350/RC100
Authors: Volodymyr V. Kindratenko, Robert J. Brunner, Adam D. Myers
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This paper provides an evaluation of SGI® RASC^TM RC100 technology from a computational science software developer's perspective. A brute force implementation of a two-point angular correlation function is used as a test case application. The computational kernel of this test case algorithm is ported to the Mitrion-C programming language and compiled, targeting the RC100 hardware. We explore several code optimization techniques and report performance results for different designs. We conclude the paper with an analysis of this system based on our observations while implementing the test case. Overall, the hardware platform and software development tools were found to be satisfactory for accelerating computationally intensive applications, however, several system improvements are desirable.
Mining Classification Rules of Cancer Patients for Traditional Chinese Medical Treatments: A Rough Set Based Approach
Authors: Qianchao Pang, Anji Hou, Quanping Hua, Huaping Tang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Data mining is one of the techniques of taking information of unordinary and unknown potential value out of large-scale data. The main idea of rough set method of data mining is to divide knowledge with undistinguishable relationship, to describe the concept with the upper and lower approximation, and to reach the rules of decision-making or classification through the reduction of knowledge. By means of examples, this paper introduces the essential principles and methods of rough set theory, and applies the mining classification rules to the differentiation of symptoms and signs of Traditional Chinese Medicine (TCM) for cancer patients. The application of rough set theory in TCM helps reveal the intrinsic relationship of knowledge in TCM diagnosis and the thinking stringency of TCM, providing theoretical security for the differentiation of cancer patients treated by TCM.
Multi-user Multi-service Random Access and Channel Assignment for mm Wavelength Uplink Broadband Wireless System
Authors: Le Thanh Son, Torbjorn Ekman, Pal Orten
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Multi-carrier OFDMA-CDM has a range of advantages that make it ideal for high data rate wireless access system. In this paper, we propose a multi-user multi-service random access and channel assignment approach for the uplink communication of the mm wavelength multi-carrier OFDMA-CDM BWA system. The OFDMA-CDM solution and the iterative interference cancellation and detection are applied at the system's physical layer to support multi-user multi-service capabilities and to improve the robustness against the flat and frequency selective fading. The proposed scheme grants the uplink random access connections and allocates the radio resources to the active multi-service subscriber stations by using the cooperation between base station and subscriber stations, as well as the diversities in spreading codes, subcarriers, time in OFDM symbols, and time division multiplex. A MAC protocol and its connection and channel assignment procedures are described. Numeric simulations of the uplink BWA system are carried out to evaluate the system's performance.
Web-based inquiry learning environment "young scientist"
Authors: Margus Pedaste, Tago Sarapuu
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Some studies question if web-based inquiry is as practical tasks for developing inquiry skills. We have hypothesised that particular effectiveness depends on the support system that outperforms the guidance of a teacher in a classroom situation. For this reason, a multi-level support system has been developed for the learning environment 'Young Scientist' (http://bio.edu.ee/noor/) on the basis of the results derived from earlier studies of composing web-based learning environments. The main focus of this paper is on the evaluation of students' progress in their skills in designing inquiry process, and formulating research questions and hypotheses. 164 students from the 4th and 6th grades participated in a pilot study where they filled in a pre-test, solved four problems in the learning environment, and answered to a post-test. Students' skills to arrange inquiry steps were evaluated in the theoretical and situational context. The results have demonstrated that the learning environment 'Young Scientist' is applicable for developing learners' inquiry skills: i) it increases students' skills to design an experiment in both theoretical and situational context, and ii) develops statistically significantly students' skills to formulate research questions and hypotheses.
Non-Logic Aspects of Logic Devices
Venue: Computer (1971)

The Western Area Committee of the IEEE Computer Society sponsored a workshop, "Non-Logic Aspects of Logic Devices," at Asilomar Conference Grounds in Pacific Grove, California, April 19-21, 1971. Presentations were made by: Brooks Cowart; Dr. Tsai-Hwa Chen; Walter V. Vilkelis; Dr. John M. Woulbroun; Morris Knapp; Howard L. Parks; John E. Goodwin; Elliot Josephson; Dr. Orin E. Marvel; Dr. Irving T. Ho; C. W. Ho; John T. Polhemus; David Richardson; W. T. Rhoades; Dr. Frank Greene. 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
Image Recognition Using Weighted Two-Dimensional Maximum Margin Criterion
Authors: Haixian Wang, Sibao Chen, Zilan Hu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In image recognition, feature extraction techniques are widely used to enhance discriminatory performance. In this paper, a new method for image feature extraction, called weighted two-dimensional maximum margin criterion (W2DMMC), is proposed. Different from conventional maximum margin criterion (MMC), W2DMMC is directly based on two-dimensional image matrix rather than one-dimensional vector. And W2DMMC has an additional weighted parameterâ that further broadens the margin. W2DMMC completely circumvents the small sample size problem and is computationally efficient. As a connection to 2DLDA, we show that 2DLDA can be recovered from W2DMMC when imposing some constraints. The better performance of W2DMMC in terms of both recognition accuracy and training time is demonstrated by experiments on real data set.
Use of Sensors in Programmable Automation*
Authors: C. A. Rosen
Venue: Computer (1977)

If previous studies1-4 are any indication, there is a national need to develop advanced automation techniques to increase industrial productivity and to enhance the well-being of workers by eliminating hard, dangerous, and dull jobs. Although an ultimate goal might be a completely automated factory in which design, planning, scheduling, and manufacturing are all under computer control, automation will probably evolve slowly with the development of the appropriate technology.
On Universal Logic Primitives
Authors: G. J. Klir
Venue: IEEE Transactions on Computers (1971)

A universal logic primitive (ULP) is a logic function by which every logic function can be composed. The total number of all ULPs and all nondegenerate ULPs for n logic variables is derived and a procedure for determining all of them is presented.
A selective pattern-compression scheme for power and test-data reduction
Authors: Chia-Yi Lin, Hung-Ming Chen
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper proposes a selective pattern-compression scheme to minimize both test power and test data volume during scan-based testing. The proposed scheme will selectively supply the test patterns either through the compressed scan chain whose scanned values will be decoded to the original scan cells, or directly through the original scan chain using minimum transition filling method. Due to shorter length of a compressed scan chain, the potential switching activities and the required storage bits can be both reduced. Furthermore, the proposed scheme also supports multiple scan chains. The experimental results demonstrate that, with few hardware overhead, the proposed scheme can achieve significant improvement in shift-in power reduction and large amount of test data volume reduction.
Guest Editorial: Window on the 80's
Authors: P. Isaacson
Venue: Computer (1980)

 In 1978 Radio Shack was the 44th largest computer company in the US.1 One model of kitchen blender contains one thousand bytes of memory.  The week before Christmas, department stores sold more computers in toys than are presently found in data processing centers worldwide.
Keynote Address: .QL for Source Code Analysis
Authors: Oege de Moor, Mathieu Verbaere, Elnar Hajiyev, Pavel Avgustinov, Torbjorn Ekman, Neil Ongkingco, Damien Sereni, Julian Tibble
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

Many tasks in source code analysis can be viewed as evaluating queries over a relational representation of the code. Here we present an object-oriented query language, named .QL, and demonstrate its use for general navigation, bug finding and enforcing coding conventions. We then focus on the particular problem of specifying metrics as queries.
An XML-based Representation for Generic Bill of Materials (GBOM)
Authors: Fusheng Qiu, Wenjian Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The conventional approach for describing Bill of Material (BOM) as a tabular structure implemented within a relational database system makes it difficult for the generic bills of material (GBOM) in a customer-oriented production, where the number of variants may go into high numbers. This research presents a novel XML-based approach to represent generic bill of material (GBOM), entities that represent and maintain one generic structure that encompasses all variants of a product. This approach combines a produce-oriented notation and gives further a high degree of flexibility to support the user in the product variant specification task. The generic BOM system is then introduced for the particular product variant, and a prototype system has been developed. Finally, conclusion and future works are discussed.
A Software Component Maturity Model (SCMM)
Authors: Alexandre Alvaro, Eduardo Santana de Almeida, Silvio Lemos Meira
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Component-Based Software Development (CBSD) is focused on assembling existing components to build a software system, with a potential benefit of delivering quality systems more fast, thus, increasing its productivity. These benefits are just achieved if the software components used to compose the software system were previously evaluated in order to establish a certain quality level. However, there are a set of different risklevels associated to each software component, depending, mainly, on its application domain. In this way, we aim to propose a software component maturity model in order to assure quality for each kind of software component risk-level, describing its levels, techniques adopted and the guidelines for selecting evaluation levels. A preliminary case study was accomplished in order to prove its real applicability and viability.
Faster suffix sorting
Authors: N. Jesper Larsson, Kunihiko Sadakane
Venue: Theoretical Computer Science (2007)

We propose a fast and memory-efficient algorithm for lexicographically sorting the suffixes of a string, a problem that has important applications in data compression as well as string matching. Our algorithm eliminates much of the overhead of previous specialized approaches while maintaining their robustness for degenerate inputs. For input size n, our algorithm operates in only two integer arrays of size n, and has worst-case time complexity O(nlogn). We demonstrate experimentally that our algorithm has stable performance compared with other approaches.
SwS
Authors: Pascal Auffinger, Yaser Hashem
Venue: Bioinformatics (2007)

Summary: SwS, based on a statistical analysis of crystallographic structures deposited in the NDB, is designed to provide an exhaustive overview of the solvation of nucleic acid structural elements through the generation of 3D solvent density maps. A first version (v1.0) of this web service focuses on the interaction of DNA, RNA and hybrid base pairs linked by two or three hydrogen bonds with water, cations and/or anions. Data provided by SwS are updated on a weekly basis and can be used by: (i) those involved in molecular dynamics simulation studies for validation purposes; (ii) crystallographers for help in the interpretation of solvent density maps; and all those involved in (iii) drug design and, more generally, in (iv) nucleic acid structural studies. SwS provides also statistical data related to the frequency of occurrence of different types of base pairs in crystallographic structures and the conformation of the involved nucleotides. This web service has been designed to allow a maximum of flexibility in terms of queries and has also been developed with didactic considerations in mind. Availability: http://www-ibmc.u-strasbg.fr/arn/sws.html Contact: p.auffinger@ibmc.u-strasbg.fr
Design and Implementation of an Active RFID System for Fast Tag Collection
Authors: Won-Ju Yoon, Sang-Hwa Chung, Seong-Joon Lee, Young-Sik Moon
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Radio Frequency Identification (RFID) technology is an automatic identification method using radio frequencies be- tween RFID readers and tags. In RFID systems, tag col- lection is very important issue to collect data from all the tags in reader communication range using anticollision al- gorithm. There are several researches to develop the effi- cient anticollision algorithm, but they almost focus on pas- sive RFID systems and show the simulation results. This paper focuses on tag collection in active RFID systems com- plying with ISO/IEC 18000-7 standard. We propose the modified tag collection algorithm based on the standard and develop an active RFID reader and tags which comply with ISO/IEC 18000-7 and utilize the modified algorithm. As the experiments are achieved with a reader and 30 tags in the real-world environment, the modified algorithm shows better performance of tag collection than the standard al- gorithm in our active RFID system.
Measurement and Evaluation of Alternative Computer Architectures
Authors: S. H. Fuller
Venue: Computer (1977)

The Army/Navy Computer Family Architecture Committee has developed an approach for quantifying the relative performance of alternative computer architectures.
On the decay of crossing numbers
Authors: Jacob Fox, Csaba D. Tóth
Venue: Journal of Combinatorial Theory Series B (2008)

The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [B. Richter, C. Thomassen, Minimal graphs with crossing number at least k, J. Combin. Theory Ser. B 58 (1993) 217-224] conjectured that there is a constant c such that every graph G with crossing number k has an edge e such that cr(G-e)>=k-ck. They showed only that G always has an edge e with cr(G-e)>=25cr(G)-O(1). We prove that for every fixed @e>0, there is a constant n"0 depending on @e such that if G is a graph with n>n"0 vertices and m>n^1^+^@e edges, then G has a subgraph G^' with at most (1-@e24)m edges such that cr(G^')>=(128-o(1))cr(G).
Dependable security: testing network intrusion detection systems
Authors: Carrie Gates, Carol Taylor, Matt Bishop
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

The Network security systems have unique testing requirements. Like other systems, they need to be tested to ensure that they perform as expected, and to specify the conditions under which they might fail. However, un-like other systems, the data required to perform such testing is not easily or publicly available. In this paper we present the requirements for appropriate network traces for testing such systems, along with the challenges of creating public network traces. We make recommendations for tackling these challenges and suggest approaches to developing a public suite of network traces for use by the security community.