ppxscal/embedding_network huggingface dataset:
Fuzzy Comprehensive Evaluation for Power Network Operating Schemes
Authors: Ning Zhang, Hua Ye, Yutian Liu, Xinsheng Niu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Based on the analytic hierarchy process, a fuzzy comprehensive evaluation method is proposed for power network operating schemes. Performance indices and corresponding membership functions are presented to denote their contributions on overall objective. The analytic hierarchy process is used to analyze influencing factors, to establish a hierarchical model and to rank the influencing factors in order of importance. After detailed analyses and calculations for each operating scheme, quantitative evaluation results that considering various factors comprehensively are obtained by a two-level fuzzy comprehensive evaluation. A decision support system using the proposed method is developed. Simulation results of a practical power system show its validity and effectiveness.
B72-27 The Fourth Generation
Authors: U. O. Gagliardi
Venue: IEEE Transactions on Computers (1972)

The book is composed of three major parts: a dialogue on the fourth generation theme, a series of papers (called presentations), and finally six invited papers. 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
SASI: A New Ultralightweight RFID Authentication Protocol Providing Strong Authentication and Strong Integrity
Authors: Hung-Yu Chien
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

As low-cost RFIDs become more and more popular, it is imperative to design ultra-lightweight RFID authentication protocols to resist all possible attacks and threats. However, all the previous ultra-lightweight authentication schemes are vulnerable to various attacks. In this paper, we propose a new ultra-lightweight RFID authentication protocol that provides strong authentication and strong integrity protection of its transmission and of updated data. The protocol requires only simple bit-wise operations on the tag and can resist all the possible attacks. These features make it very attractive to low-cost RFIDs and very low-cost RFIDs.
Gene systems network inferred from expression profiles in hepatocellular carcinogenesis by graphical Gaussian model
Authors: Sachiyo Aburatani, Fuyan Sun, Shigeru Saito, Masao Honda, Shu-ichi Kaneko, Katsuhisa Horimoto
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2007)

Hepatocellular carcinoma (HCC) in a liver with advanced-stage chronic hepatitis C (CHC) is induced by hepatitis C virus, which chronically infects about 170 million people worldwide. To elucidate the associations between gene groups in hepatocellular carcinogenesis, we analyzed the profiles of the genes characteristically expressed in the CHC and HCC cell stages by a statistical method for inferring the network between gene systems based on the graphical Gaussian model. A systematic evaluation of the inferred network in terms of the biological knowledge revealed that the inferred network was strongly involved in the known gene-gene interactions with high significance (P ≤ 10-4), and that the clusters characterized by different cancer-related responses were associated with those of the gene groups related to metabolic pathways and morphological events. Although some relationships in the network remain to be interpreted, the analyses revealed a snapshot of the orchestrated expression of cancer-related groups and some pathways related with metabolisms and morphological events in hepatocellular carcinogenesis, and thus provide possible clues on the disease mechanism and insights that address the gap between molecular and clinical assessments.
Query language support for incomplete information in the MayBMS system
Authors: Lyublena Antova, Christoph Koch, Dan Olteanu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

MayBMS [4, 1, 3, 2] is a data management system for incomplete information developed at Saarland University. Its main features are a simple and compact representation system for incomplete information and a language called I-SQL with explicit operations for handling uncertainty. MayBMS is currently an extension of PostgreSQL and manages both complete and incomplete data and evaluates I-SQL queries.
Software Quality Assurance And CAD User Interfaces
Authors: E. T. Grinthal
Venue: IEEE Design Test (1986)

The author gives an overview of software quality assurance and its relation to user interfaces for CAD systems. some of thebasic concepts as well as the theoretical background and state of the art of software quality assurance are presented. A pragmaticapproach to quality assurance of the software for CAD systems is presented by showing its application to a VLSI layout editor.The emphasis is on making the program reliable and robust for users. 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
Clausal resolution for normal modal logics
Authors: Cláudia Nalon, Clare Dixon
Venue: Journal of Algorithms (2007)

We present a clausal resolution-based method for normal modal logics. Differently from other approaches, where inference rules are based on the syntax of a particular set of axioms, we focus on the restrictions imposed on the binary accessibility relation for each particular normal logic. We provide soundness and completeness results for all fifteen families of multi-modal normal logics whose accessibility relations have the property of being non-restricted, reflexive, serial, transitive, Euclidean, or symmetric.
A Performance Study of 16-bit Microcomputer-Implemented FFT Algorithms
Authors: P. Stigall, R. Ziemer, L. Hudec
Venue: IEEE Micro (1982)

An FFT algorithm operating on a 16-bit microcomputer can calculate a 256-point transform as much as 10 times faster than a similar algorithm on an eight-bit microcomputer.
An upper bound on Jacobi polynomials
Authors: Ilia Krasikov
Venue: Journal of Approximation Theory (2007)

Let P"k^(^@a^,^@b^)(x) be an orthonormal Jacobi polynomial of degree k. We will establish the following inequality:maxx@?[@d"-"1,@d"1](x-@d"-"1)(@d"1-x)(1-x)^@a(1+x)^@bP"k^(^@a^,^@b^)(x)^2=6,@a>=@b>=1+24.
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
Authors: Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods--in particular, a general weighted kernel k-means objective is mathematically equivalent to a weighted graph clustering objective. We exploit this equivalence to develop a fast, high-quality multilevel algorithm that directly optimizes various weighted graph clustering objectives, such as the popular ratio cut, normalized cut, and ratio association criteria. This eliminates the need for any eigenvector computation for graph clustering problems, which can be prohibitive for very large graphs. Previous multilevel graph partitioning methods, such as Metis, have suffered from the restriction of equal-sized clusters; our multilevel algorithm removes this restriction by using kernel k-means to optimize weighted graph cuts. Experimental results show that our multilevel algorithm outperforms a state-of-the-art spectral clustering algorithm in terms of speed, memory usage, and quality. We demonstrate that our algorithm is applicable to large-scale clustering tasks such as image segmentation, social network analysis and gene network analysis.
A Concept Lattice Approach for Requirements Validation with UML State Machine Model
Authors: Pin Ng
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Formal Concept Analysis (FCA) is a mathematical technique for systematically combining and organizing individual concepts of a given context into hierarchically ordered conceptual structure - concept lattice. We are proposing to apply FCA in analyzing the association between a set of test scenarios with a set of transitions specified in a UML state machine model. By applying the concept analysis mechanism, we are able to determine a minimal set of test scenarios that can sufficiently cover all the transitions for the purpose of requirements validation.
Runtime Checking for ISO Standard Pascal
Authors: P. R. Eggert
Venue: IEEE Transactions on Software Engineering (1981)

Changes to Pascal, embodied in the proposed ISO Pascal standard, affected Fischer and LeBlanc's runtime error checking implementation designed for Wirthian Pascal. Three kinds of runtime errors became obsolete; two were introduced, and one was apparently neglected. A criticism is made of Fischer and LeBlanc's conclusion that runtime errors will always be with us.
Detection of Hazards in Combinational Switching Circuits
Authors: Y. Zisapel
Venue: IEEE Transactions on Computers (1979)

This correspondence investigates a systematic binary technique for detecting static and dynamic hazards in combinational networks. The technique is based on deriving the conditions for the occurrence of spikes and considering a hazard as a superposition of spikes.
An Improved Estimation Algorithm for User Vertical Protection Level
Authors: Xijun Zhu, Zhimin Li, Yueming Dai
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

To accurately apply satellite Signal-In-Space (SISE) in GNSS, and to rationally estimate user Vertical Protection Level, is the key of ensuring normal application of GNSS and user safety. This paper presents an estimating model of equivalent range error affected by SISE based on its influence characteristic on the user positioning. And according to the VPL integrity theory, uncertainty law of error measurement, a new algorithm of rationally estimating VPL was established.
Acyclic coloring of graphs of maximum degree five: Nine colors are enough
Authors: Guillaume Fertin, André Raspaud
Venue: Information Processing Letters (2008)

An acyclic coloring of a graph G is a coloring of its vertices such that: (i) no two neighbors in G are assigned the same color and (ii) no bicolored cycle can exist in G. The acyclic chromatic number of G is the least number of colors necessary to acyclically color G. In this paper, we show that any graph of maximum degree 5 has acyclic chromatic number at most 9, and we give a linear time algorithm that achieves this bound.
Flattened Butterfly Topology for On-Chip Networks
Authors: John Kim, James Balfour, William J. Dally
Venue: IEEE Computer Architecture Letters (2007)

With the trend towards increasing number of cores in a multicore processors, the on-chip network that connects the cores needs to scale efficiently. In this work, we propose the use of high-radix networks in on-chip networks and describe how the flattened butterfly topology can be mapped to on-chip networks. By using high-radix routers to reduce the diameter of the network, the flattened butterfly offers lower latency and energy consumption than conventional on-chip topologies. In addition, by properly using bypass channels in the flattened butterfly network, non-minimal routing can be employed without increasing latency or the energy consumption.
The FAST methodology for high-speed SoC/computer simulation
Authors: Derek Chiou, Dam Sunwoo, Joonsoo Kim, Nikhil Patil, William H. Reinhart, D. Eric Johnson, Zheng Xu
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper describes the FAST methodology that enables a single FPGA to accelerate the performance of cycle-accurate computer system simulators modeling modern, realistic SoCs, embedded systems and standard desktop/laptop/server computer systems. The methodology partitions a simulator into (i) a functional model that simulates the functionality of the computer system and (ii) a predictive model that predicts performance and other metrics. The partitioning is crafted to map most of the parallel work onto a hardware-based predictive model, eliminating much of the complexity and difficulty of simulating parallel constructs on a sequential platform. FAST conventions and libraries have been designed to make creating, modifying, using and measuring such simulators straightforward. We describe a prototype FAST system: a full-system, RTL-level cycle-accurate-capable computer system simulator that executes the x86 ISA, boots unmodified Linux and executes unmodified x86 applications. The prototype runs two to three orders of magnitude faster than the fastest Intel and AMD RTL-level cycle-accurate x86 software-based simulators and about six to seven times faster than RTL simulation.
Experiments with test case prioritization using relevant slices
Authors: Dennis Jeffrey, Neelam Gupta
Venue: Journal of Systems and Software (2008)

Software testing and retesting occurs continuously during the software development lifecycle to detect errors as early as possible and to gain confidence that changes to software do not introduce defects. Once developed, test suites are reused and updated frequently, and their sizes grow as software evolves. Due to time and resource constraints, an important goal during regression testing of software is to prioritize the execution of test cases in a suite so as to improve the chances of increasing the rate of fault detection. Prior techniques for test case prioritization are based on the total number of coverage requirements exercised by the test cases. In this paper, we present a new approach to prioritize test cases that takes into account the coverage requirements present in the relevant slices of the outputs of test cases. We have implemented three different heuristics based on our relevant slicing based approach to prioritize test cases and conducted experiments to compare the effectiveness of our techniques with those of the traditional techniques that only account for the total requirement coverage. Our detailed experimental study and results provide interesting insights into the effectiveness of using relevant slices for test case prioritization in terms of ability to achieve high rate of fault detection.
Symbolic Model Checking of Analog/Mixed-Signal Circuits
Authors: D. Walter
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixed-signal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware description language for AMS circuits. The VHDL-AMS description is compiled into labeled hybrid Petri nets (LH-PNs) in which analog values are modeled as continuous variables that can change at rates in a bounded range and digital values are modeled using Boolean signals. System properties are specified as temporal logic formulas using timed CTL (TCTL). The verification proceeds over the structure of the formula and maps separation predicates to Boolean variables. The state space is thus represented as a Boolean function using a binary decision diagram (BDD) and the verification algorithm relies on the efficient use of BDD operations.
Incorporating Good Nodes Set Principle into Evolution Strategy for Constrained Optimization
Authors: Chixin Xiao, Zixing Cai, Yong Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Good Nodes Set(GNS) is a concept in number theory. This paper presents a method that incorporate GNS principle to enhance the crossover operator of the evolution strategy (ES) can make the resulting evolutionary algorithm more robust and statically sound. Traditional crossover operator is split into two steps. The proposed method achieves the same sound results just as the orthogonal method does, but its precision is not confined by the dimension of the space. The simplex selected and diversity mechanism is used to enrich the exploration and exploitation abilities of the approach proposed. Experiment results on a set of benchmark problems show the efficiency of the algorithm.
Positional mapping: keyboard mapping based on characters writing positions for mobile devices
Authors: Ye Kyaw Thu, Yoshiyori Urano
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Keyboard or keypad layout is one of the important factors to increase user text input speed especially on limited keypad such as mobile phones. This paper introduces novel key mapping method "Positional Mapping" (PM) for phonetic scripts such as Myanmar language based on its characters writing positions. Our approach has made key mapping for Myanmar language very simple and easier to memorize. We have developed positional mapping text input prototypes for mobile phone keypad, PDA, customizable keyboard DX1 input system and dual-joystick game pad, and conducted user studies for each prototype. Evaluation was made based on users' actual typing speed of our four PM prototypes, and it has proved that first time users can type at appropriate average typing speeds (i.e. 3min 47sec with DX1, 4min 42sec with mobile phone prototype, 4min 26sec with PDA and 5min 30sec with Dual Joystick Game Pad) to finish short Myanmar SMS message of 6 sentences. Positional Mapping can be extended to other phonetic scripts, which we present with a Bangla mobile phone prototype in this paper.
Using Wikis to Tackle Reuse in Software Projects
Authors: Jörg Rech, Christian Bogner, Volker Haas
Venue: IEEE Software (2007)

An enhanced wiki-centered framework acts as a knowledge-sharing platform for software development teams in small and medium-sized software enterprises.
Comparison of wavelet-SVM and wavelet-adaptive network based fuzzy inference system for texture classification
Authors: Ibrahim Turkoglu, Engin Avci
Venue: Digital Signal Processing (2008)

Texture image is a low-level image feature. Nowadays, there are many different applications involving texture analysis, including endoscope, ultrasonographic images recognition, document classification, radar image classification, and texture-based image retrieval. The texture images analysis and classification becomes an important topic. The greatest hardness of texture analysis and classification in the past was the deficiency of enough methods to characterize. Multi-resolution analysis methods such as wavelet and wavelet packet decompositions are more superior to other classic statistical methods. In this paper, a comparison of wavelet-support vector machine (W-SVM) and wavelet-adaptive network based fuzzy inference system (W-ANFIS) approaches for texture image classification is presented. Both W-SVM and W-ANFIS methods are used for classification of the 22 texture images obtained from Brodatz image album. There, 50 64 x 64 image regions were randomly selected (overlapping or nonoverlapping) for each of these 22 images. 25 of these image regions and other 25 of these image regions are used for training and testing of the W-SVM and W-ANFIS methods, respectively.
Computational methods for estimation of cell cycle phase distributions of yeast cells
Authors: Antti Niemistö, Matti Nykter, Tommi Aho, Henna Jalovaara, Kalle Marjanen, Miika Ahdesmäki, Pekka Ruusuvuori, Mikko Tiainen, Marja-Leena Linne, Olli Yli-Harja
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2007)

Two computational methods for estimating the cell cycle phase distribution of a budding yeast (Saccharomyces cerevisiae) cell population are presented. The first one is a nonparametric method that is based on the analysis of DNA content in the individual cells of the population. The DNA content is measured with a fluorescence-activated cell sorter (FACS). The second method is based on budding index analysis. An automated image analysis method is presented for the task of detecting the cells and buds. The proposed methods can be used to obtain quantitative information on the cell cycle phase distribution of a budding yeast S. cerevisiae population. They therefore provide a solid basis for obtaining the complementary information needed in deconvolution of gene expression data. As a case study, both methods are tested with data that were obtained in a time series experiment with S. cerevisiae. The details of the time series experiment as well as the image and FACS data obtained in the experiment can be found in the online additional material at http://www.cs.tut.fi/sgn/csb/yeastdistrib/.
An Experience of Reuse Based Requirements Engineering in ERP Implementation Projects
Authors: Camille Salinesi, Mohamed Ramzi Bouzid, Esther Elfassy
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

The art of ERP implementation stands in matching ERP features with the requirements of an organisation so as to define how to adapt the system and/or the organisation to reach a synergic functioning. A number of approaches have been developed in practice and elaborated in research to solve the issues posed by this matching activity, for example to solve the conceptual mismatch issue or to systematise similarity analysis between different kinds of models such as business process models and system functionality models. One aspect is not often considered in these approaches: it is the opportunity to reuse experience from one ERP implementation project to another. This paper presents a reuse-based requirements elicitation method for ERP integration. The method was developed in an action research approach in a project held in a charity association that wanted to integrate Microsoft's Dynamics NAV.
An innovative training system by digital terrestrial television: TSC-learning
Authors: Marco Recchioni, Nunzio Casalino, Valentina Castello, Maurizio Roscani
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The term digital video broadcasting (DVB) is today used as a synonym for digital television in many countries. Digital Terrestrial Television (DTT) is an implementation of digital technology to provide a greater number of channels, a better quality of picture and sound through a conventional antenna instead of a satellite dish or cable connection. Digital television isn't just an innovative signal representation; it represents a new multiple-channel data broadcasting that affect not only the technology side but also the content itself. Within this framework, the T-Learning (Television-Learning) has reached a considerable importance in the last years and is emerging as a potentially important media to create opportunities for learning at home. The main aim of the paper is to describe a system to provide the use of a Learning Management System (LMS) on digital-terrestrial platform, respecting the reference standards (SCORM, IMS, AICC, LOM, etc.). This innovative system allows users to get learning services at home, using a LMS that has to meet a number of requirements, including the integration of a multiplicity of contents.
Pose determination and plane measurement using a trapezium
Authors: Fuqing Duan, Fuchao Wu, Zhanyi Hu
Venue: Pattern Recognition Letters (2008)

In this paper, a new affine invariant of trapezia is introduced, and the projection of trapezia is deduced from this invariant. Known the lengths of the two parallel sides of a trapezium, pose estimation and plane measurement can be realized in a very simple way from the projection of the trapezium. Experiments on simulated and real images show that the approach is robust and accurate. Two parallel lines, which can determine a trapezium, are not rare in many structured scenes, the proposed method has wide applicability.