ppxscal/embedding_network huggingface dataset:
Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms
Authors: Jinyan Li, Guimei Liu, Haiquan Li, Limsoon Wong
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Enumerating maximal biclique subgraphs from a graph is a computationally challenging problem. In this paper, we efficiently enumerate them through the use of closed patterns of the adjacency matrix of the graph. For an undirected graph $G$ without self-loops, we prove that: (i) the number of closed patterns in the adjacency matrix of $G$ is even; and (ii) for every maximal biclique subgraph, there always exists a unique pair of closed patterns that matches the two vertex sets of the subgraph. Therefore, the problem of enumerating maximal bicliques can be solved by using efficient algorithms for mining closed patterns, which are algorithms extensively studied in the data mining field. However, this direct use of existing algorithms causes a duplicated enumeration. To achieve high efficiency, we propose an $O(mn)$ time delay algorithm for a non-duplicated enumeration, in particular for enumerating those maximal bicliques with a large size, where $m$ and $n$ are the number of edges and vertices of the graph respectively. We evaluate the high efficiency of our algorithm by comparing it to state-of-the-art algorithms on many graphs.
Students respond to IT ethics
Authors: Elizabeth V. Howard
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Students enrolled in an introductory course on Ethical Issues in Information Technology completed a survey on various aspects of the course. The course was designed as a reading, writing, and discussion-intensive course with a number of guest speakers and the instructor was especially interested in the students' reactions. Students reported that they found all of the sessions with the IT professionals to be interesting, useful, and would recommend inviting them to future sections of the course. Students also reported that they increased their knowledge of ethical theories and that the design of the class encouraged them to be better prepared to participate in class discussions. This paper describes the course design and presents both quantitative and qualitative results of the student survey.
A Statistical Method for Software Quality Control
Authors: K. Okumoto
Venue: IEEE Transactions on Software Engineering (1985)

This paper proposes a statistical method that can be used to monitor, control, and predict the quality (measured in terms of the failure intensity) of a software system being tested. The method consists of three steps: estimation of the failure intensity (failures per unit of execution time) based on groups of failures, fitting the logarithmic Poisson model to the estimated failure intensity data, and constructing confidence limits for the failure intensity process. The proposed estimation method is validated through a simulation study. A method for predicting the additional execution time required to achieve a failure intensity objective is also discussed. A set of failure data collected from a real-time command and control system is used to demonstrate the proposed method.
TERCOS: A Novel Technique for Exploiting Redundancies in Fault-Tolerant and Real-Time Distributed Systems
Authors: Wei Luo, FuMin Yang, Gang Tu, LiPing Pang, Xiao Qin
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper, we propose a novel fault-tolerant technique, which is seamlessly integrated with fixedpriority- based scheduling algorithm to explore redundancies to enhance schedulability in faulttolerant and real-time distributed systems. Our faulttolerant technique makes use of the primary-backup scheme to tolerate permanent hardware failures. Most importantly, the proposed technique (referred to as Tercos) terminates the execution of active backup copies when corresponding primary copies are successfully completed, therefore Tercos can reduce scheduling lengths in fault-free scenario to enhance schedulability by virtue of executing portions of active backup copies in passive forms. Experimental results show that compared with existing algorithm in literature, Tercos can significantly improve schedulability by up to 17.0% (with an average of 9.7%).
SOS: The Next 111ll Years
Authors: E. Tomash
Venue: Computer (1976)

About the title. In the early days of the computer industry, acronyms, like wild flowers in a meadow, seemed to pop up everywhere. Their disappearance in these days of emphasis on corporate image is lamentable. Years after they were first created, UNIVAC and Fortran still ring true, while System 360 and VM/370 just don't conjure up images. For an acronym to be right, it must both convey meaning and be euphonious. The joy of LARC and the vigor of RAMAC compared to the blandness of models 360/195 or 3330 are even better examples. 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
Citation Analysis using Formal Concept Analysis: A case study in Software Engineering
Authors: Thomas Tilley, Peter Eklund
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper Formal Concept Analysis (FCA) is used as a means to analyse a field of research using published academic papers as its input. In particular, results are presented based on a case study of 47 academic papers in a scientific field of study. The analysis includes inferences about the field of study based on the domain background knowledge derived from the ISO12207 software engineering standard. Additionally, a number of alternative classifications based on the target application language and the reported application size are introduced. FCA reveals useful insights about the nature of the subject matter: identifying fruitful areas of research as well as producing details about characteristics of the community under examination.
Comparing Model Generated with Expert Generated IV&V Activity Plans
Authors: Haruka Nakao, Shigeo Yoshikawa, Daniel Port, Yuko Miyamoto, Masa Katahira
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

An IV&V activity plan describes what assurance activities to perform, where to do them, when, and to what extent. Meaningful justification for an IV&V budget and evidence that activities performed actually provide high assurance has been difficult to provide from plans created (generally ad hoc) by experts. JAXA now uses the "strategic IV&V planning and cost model" to addresses these issues and complement expert planning activities. This research presents a grounded empirical study that compares plans generated by the strategic model to those created by experts on several past IV&V projects. Through this research, we found that the model generated plan typically is a superset of the experts' plan. We found that experts tended to follow the most cost-effective route but had a bias in their particular activity selections. Ultimately we found increased confidence in both expert and model based planning and now have new tools for assessing and improving them.
Detection of Hidden Information in Webpage
Authors: Huajun Huang, Xingming Sun, Zishuai Li, Guang Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Invisible characters, such as spaces and tabs, can be hidden at the end of each line of webpage, and covert communication happens. To determine whether there is hidden information in webpage, the statistical analysis of stego-webpage is anatomized, and a detection method is presented. The detection method is easy to achieve, and experiments prove the efficiency and reliability of the method.
Fault Testing and Diagnosis in Combinational Digital Circuits
Authors: W. H. Kautz
Venue: IEEE Transactions on Computers (1968)

Abstract he problem of designing test schedules for the testing or diagnosis of a small number of nontransient faults in combinational digital circuits (switching networks) is considered in detail. By testing and diagnosis we mean the following: 1) detection of a fault, 2) location of a fault, and 3) location of a fault within the confines of a prescribed package or module. It is shown that minimal test schedules can be readily derived-using procedures already worked out for solving certain problems in pattern recognition and switching theory-under the assumption that the selection of the test inputs in the schedule is independent of the response of the circuit under test. When this assumption is not made, it is shown that much shorter test schedules are sometimes possible, and procedures are offered for obtaining good ones. Finally, the general status of diagnostics for digital circuits is reviewed and evaluated, and specific problems remaining to be solved are described.
Molecular image segmentation based on improved fuzzy clustering
Authors: Jinhua Yu, Yuanyuan Wang
Venue: Journal of Biomedical Imaging (2007)

Segmentation of molecular images is a difficult task due to the low signal-to-noise ratio of images. A novel two-dimensional fuzzy C-means (2DFCM) algorithm is proposed for the molecular image segmentation. The 2DFCM algorithm is composed of three stages. The first stage is the noise suppression by utilizing a method combining a Gaussian noise filter and anisotropic diffusion techniques. The second stage is the texture energy characterization using a Gabor wavelet method. The third stage is introducing spatial constraints provided by the denoising data and the textural information into the two-dimensional fuzzy clustering. The incorporation of intensity and textural information allows the 2DFCM algorithm to produce satisfactory segmentation results for images corrupted by noise (outliers) and intensity variations. The 2DFCM can achieve 0.96 ± 0.03 segmentation accuracy for synthetic images under different imaging conditions. Experimental results on a real molecular image also show the effectiveness of the proposed algorithm.
Self-tuning database systems: a decade of progress
Authors: Surajit Chaudhuri, Vivek Narasayya
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In this paper we discuss advances in self-tuning database systems over the past decade, based on our experience in the AutoAdmin project at Microsoft Research. This paper primarily focuses on the problem of automated physical database design. We also highlight other areas where research on self-tuning database technology has made significant progress. We conclude with our thoughts on opportunities and open issues.
Automatic mesh-healing technique for model repair and finite element model generation
Authors: C. S. Chong, A. Senthil Kumar, H. P. Lee
Venue: Finite Elements in Analysis and Design (2007)

It has been accepted by many researchers that modification of a model is often a necessity as a precursor to effective mesh generation. However, editing the geometry directly is often found to be cumbersome, tedious and expensive. In preparing a CAD model for numerical simulation, one of the critical issues involves the rectification of geometrical and topological errors. Though visually insignificant, these errors hinder the creation of a valid finite element model with a good mesh quality. Most current state-of-the-art works have been trying to heal geometric models directly. The novelty of the method proposed in this paper is that the mesh-healing process includes both model repair and mesh generation in one black box. The mesh-healing algorithm essentially simplifies the problems of the imperfect models and allows one to deal with simple polygons rather than complex surface representations. This paper addresses errors such as gaps, overlaps, T-joints and simple holes.
An alternative distribution model for the Molecular Dynamics study of liquid Propane on a grid platform
Authors: Alessandro Costantini, Antonio Lagana, Leonardo Pacifici, Osvaldo Gervasi
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The density of liquid propane has been estimated using molecular dynamics calculations performed on the EGEEGrid distributed platform and adopting an OPLS/AMBER force field. The difficulty of determining the pressure of the system using the same sample and the same distribution model has motivated us to develop an alternative approach.
Dynamic stereoscopic selective visual attention (DSSVA): Integrating motion and shape with depth in video segmentation
Authors: Antonio Fernández-Caballero, María T. López, Sergio Saiz-Valverde
Venue: Expert Systems with Applications: An International Journal (2008)

Depth inclusion as an important parameter for dynamic selective visual attention is presented in this article. The model introduced in this paper is based on two previously developed models, dynamic selective visual attention and visual stereoscopy, giving rise to the so-called dynamic stereoscopic selective visual attention method. The three models are based on the accumulative computation problem-solving method. This paper shows how software reusability enables enhancing results in vision research (video segmentation) by integrating earlier works. In this article, the first results obtained for synthetic sequences are included to show the effectiveness of the integration of motion and shape features with depth parameter in video segmentation.
A framework and tool supports for testing modularity of software design
Authors: Yuanfang Cai, Sunny Huynh, Tao Xie
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Modularity is one of the most important properties of a software design, with significant impact on changeability and evolvability. However, a formalized and automated approach is lacking to test and verify software design models against their modularity properties, in particular, their ability to accommodate potential changes. In this paper, we propose a novel framework for testing design modularity. The software artifact under test is a software design. A test input is a potential change to the design. The test output is a modularity vector, which precisely captures quantitative capability extents of the design for accommodating the test input (the potential change). Both the design and the test input are represented as formal computable models to enable automatic testing. The modularity vector integrates the net option value analysis with well-known design principles. We have implemented the framework with tool supports and tested aspect-oriented and object-oriented design patterns in terms of their ability to accommodate sequences of possible changes. The results showed that previous informal, implementation-based analysis can be conducted by our framework automatically and quantitatively at the design level. This framework also opens the opportunities of applying testing techniques, such as coverage criteria, on software designs
Patterns for Automated Management of Security and Dependability Solutions
Authors: Francisco Sanchez-Cid, Antonio Mana
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Current processes for providing security and dependability (S&D) in computing systems require a detailed a priori knowledge about the target systems and their environments. However, in many emergent computing scenarios like ubiquitous computing or ambient intelligence, it is not possible to foresee all possible situations that may arise at runtime so the necessary knowledge is not available at development time. In this paper we present the concept of S&D Pattern and the artefacts that we use to implement it, as the basis for the automated provision of S&D Solutions to running applications in highly dynamic and heterogeneous environments.
Improving business intelligence speed and quality through the OODA concept
Authors: Morten Middelfart
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

This article introduces the Observation-Orientation-Decision-Action (OODA) concept as a mean to identify three new desired technologies in business intelligence applications that improve the speed and quality in the decision making processes.
Image Recognition using SVM-weighted Non-negative Matrix Factorization
Authors: Chen Pan, Hongjuan Gao, Shaohua Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

This paper presents a new image classification method by learning with non-negative matrix factorization (NMF) and SVM. Firstly, NMF is utilized to extract effective features from the high dimensional feature vector. Then the weight coefficients of features are estimated automatically using relevance feedback strategy by linear SVM. NMF and SVM construct a neural network actually. Finally, classification depends on the K-nearest neighbor rule. Experimental results on the ORL face database and the 9-class task of cells from blood smears show high classification accuracy of the method.
A Novel Intrusion Detection Method Based on Combining Ensemble Learning With Induction-Enhanced Particle Swarm Algorithm
Authors: Fang Min
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

As traditional network intrusion detection based on pattern recognition can just get better classification accurately only with lots of prior knowledge which is difficult to obtain, a novel ensemble learning algorithm for fuzzy classification rules is presented. The fuzzy antecedent is adjusted based on the combination of ensemble learning and induction-enhanced particle swarm optimization for intrusion detection. By tuning the distribution of training instances and joining the distribution factor in computing of the fitness function, the collaboration of rules is taken into account during producing rules phase. So the classification error rate is reduced and the process of those rules in latter don't need. The results of experiments show that this method does not need plenty of prior knowledge about intrusion detection, can get good generalization and high classification rate.
Using Distributed-Shared Memory Mechanisms for Agents Communication in a Distributed System
Authors: Thiago Gonzaga, Cristina Bentes, Ricardo Farias, Maria Clicia Castro, Ana Cristina Garcia
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In multi-agent systems, blackboard communication pro- vides an easy way for agents to communicate. However, in a distributed architecture, the blackboard is commonly im- plemented in a single node, that is the "blackboard server". This approach may work well for a small number of agents. Nevertheless, when the number of agents increases, the blackboard server becomes the bottleneck for the system scalability. In this work we propose a novel agent com- munication system based on distributed-shared mechanisms that allows the implementation of a shared address space on a distributed system, without centralizing the blackboard. Our idea is to distribute the shared data over the nodes and use a message passing sub-system, totally transparent to the agents. We implemented this idea in a multi-agent system based on social laws, and used a distributed-shared mem- ory system to handle the messaging. We created a conflict simulator, and showed that the distributed-shared mecha- nisms easy the implementation of a truly distributed black- board.
Macro Testing: Unifying IC And Board Test
Authors: F. P. M. Beenker, K. j. e. Eerdewijk, R. B. W. Gerritsen, F. N. Peacock, M. Der Star
Venue: IEEE Design Test (1986)

Historically, IC testing and board testing have been considered two separate subjects. However, today's increasing complexityin both design and technology has given rise to a number of efforts to produce a consistent test strategy that smoothly couplesboth types of testing. This article describes one such effort by Philips, a design for testability methodology for semicustomVLSI circuits. The methodology is based on the partitioning of a design into testable macros, hence the term ?macro testing.?The challenges in this approach are the partitioning itself, the selection of a test technique suited to the separate macrosand the chip's architecture, the execution of a macro test independent of its environment, and the assembly of macro testsinto a chip test.
An Efficient Feature Extraction and Dimensionality Reduction Scheme for Isolated Greek Handwritten Character Recognition
Authors: G. Vamvakas, B. Gatos, S. Petridis, N. Stamatopoulos
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, we present an off-line methodology for isolated Greek handwritten character recognition based on efficient feature extraction followed by a suitable feature vector dimensionality reduction scheme. Extracted features are based on (i) horizontal and vertical zones, (ii) the projections of the character profiles, (iii) distances from the character boundaries and (iv) profiles from the character edges. The combination of these types of features leads to a 325- dimensional feature vector. At a next step, a dimensionality reduction technique is applied, according to which the dimension of the feature space is lowered down to comprise only the features pertinent to the discrimination of characters into the given set of letters. In this paper, we also present a new Greek handwritten database of 36,960 characters that we created in order to measure the performance of the proposed methodology.
Motif Extraction with Indicative Events for System Call Sequence Classification
Authors: Jiwei Li, Xianghua Zhang, Chun Yuan, Zhaohui Jiang, Huanqing Feng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Various approaches have been proposed to extract patterns from system call sequences invoked by applications to better model their behaviors. They use fixed-length or variable-length patterns to represent the sequences. However, these techniques are all based on mathematical rules and do not consider the underlying mechanism of the program execution. In this paper, we propose a method that extracts the motifs --subroutines conserved across sequences--in an efficient way by using the semantic call graph model. We focus on two cases: one is intrusion detection; the other is automatic problem diagnosis, and show that the presences of our defined motifs are highly discriminative features to represent different application behaviors. This is in agreement with the idea that taking these motifs to be the building blocks of program execution. Using these features, we can achieve higher detection rate while maintaining lower false positive.
Virtual vision: visual sensor networks in virtual reality
Authors: Faisal Z. Qureshi, Demetri Terzopoulos
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

The virtual vision paradigm features a unique synergy of computer graphics, artificial life, and computer vision technologies. Virtual vision prescribes visually and behaviorally realistic virtual environments as a simulation tool in support of research on large-scale visual sensor networks. Virtual vision has facilitated our research into developing multi-camera control and scheduling algorithms for next-generation smart video surveillance systems.