ppxscal/embedding_network huggingface dataset:
Decomposing Berge graphs and detecting balanced skew partitions
Authors: Nicolas Trotignon
Venue: Journal of Combinatorial Theory Series B (2008)

A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge graphs saying that every Berge graph either is in a well understood basic class, or has some kind of decomposition. Then, Chudnovsky proved stronger theorems. One of them restricts the allowed decompositions to 2-joins and balanced skew partitions. We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n^9)-time algorithm for the same problem restricted to Berge graphs. Our algorithm is not constructive: it only certifies whether a graph has a balanced skew partition or not. It relies on a new decomposition theorem for Berge graphs that is more precise than the previously known theorems. Our theorem also implies that every Berge graph can be decomposed in a first step by using only balanced skew partitions, and in a second step by using only 2-joins. Our proof of this new theorem uses at an essential step one of the theorems of Chudnovsky.
Separate Compilation in Modula-2: An Approach to Efficient Symbol Files
Authors: J. Gutknecht
Venue: IEEE Software (1986)

This new way to build symbol files removes the restrictions imposed by a rigid file formnat in favor of universal rules, thus making them more stable and extendable.
Wireless sensor networks: learning and teaching
Authors: Lisa M. Frye
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

There have been many response deficiencies cited regarding a fire department's ability to fight a structure fire. The attacks on the World Trade Center on 9/11 highlighted many of these problems and demanded the attention of the world. Wireless Sensor Networks (WSN) can benefit fire fighters as they bravely enter a structure fire. WSNs are networks consisting of many small sensors or nodes. The sensors can monitor a variety of data, such as the environment, movement and patient health readings. There has been much research completed in the area of WSNs but most of this research is proven via simulations with little actual experimentation or deployment of devices. Wireless sensor networks is an exciting and a new area of research; it has captured the interest of many researchers. The intrigue easily attracts the attention of students as well. With the help of various students, a wireless sensor network will be deployed in a fire training center to test a deployment in a structure. The primary measurement will be the performance of the sensors and the sensor network. Several students have been utilized to assist in writing the necessary programs, and more will continue to contribute to the project. This project will maintain research in utilizing WSNs in a fire fighting scenario and will continue to employ students to get them excited about learning and research.
A General Deterministic Sequence for Sampling d-Dimensional Configuration Spaces
Authors: Jan Rosell, Máximo Roa, Alexander Pérez, Fernando García
Venue: Journal of Intelligent and Robotic Systems (2007)

Previous works have already demonstrated that deterministic sampling can be competitive with respect to probabilistic sampling in sampling-based path planners. Nevertheless, the definition of a general sampling sequence for any d-dimensional configuration space satisfying the requirements needed for path planning is not a trivial issue. This paper makes a proposal of a simple and yet efficient deterministic sampling sequence based on the recursive use, over a multi-grid cell decomposition, of the ordering of the 2 d descendant cells of any parent cell. This ordering is generated by the digital construction method using a d×d matrix T d . A general expression of this matrix (i.e. for any d) is introduced and its performance analyzed in terms of the mutual distance. The paper ends with a performance evaluation of the use of the proposed deterministic sampling sequence in different well known path planners.
Representing Roles in Universal Scheme Interfaces
Authors: D. Maier
Venue: IEEE Transactions on Software Engineering (1985)

Users of a relational database must explicitly navigate between relations in order to establish a connection among a set of attributes spanning several relation schemes. While a universal scheme interface to a relational database provides users with automatic navigation, it usually imposes on the database a unique role assumption. This assumption requires every attribute name to represent a unique role in the database, so that connections among sets of attributes are unambiguous.
Toward a Real-Time Dataflow Language
Authors: A. A. Faustini
Venue: IEEE Software (1986)

This extension of the Lucid language seeks a high-level, real-time software-oriented tool with a formal mathematical semantics in which real time is part of correctness.
Automated gui testing guided by usage profiles
Authors: Penelope A. Brooks, Atif M. Memon
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Most software developed in recent years has a graphical userinterface (GUI). The only way for the end-user to interact with the software application is through the GUI. Hence, acceptance and system testing of the software requires GUI testing. This paper presents a new technique for testing of GUI applications. Information on the actual usage of the application, in the form of "usage profiles," is used to ensure that a new version of the application will function correctly. Usage profiles, sequences of events that end-users execute on a GUI, are used to develop a probabilistic usage model of the application. An algorithm uses the model to generate test cases that represent events the user is most likely to execute. Reverse engineering methods are used to extract the underlying structure of the application. An empirical study on four open source GUI applications reveals that test suites generated from the probabilistic model are 0.2-22% of the size of test suites produced directly from usage profiles. Furthermore, the test suites generated from the model detect more faults per test case than those detected directly from the usage profiles, and detect faults not detected by the original profiles
Dancing on quicksand gracefully: instructional design for rapidly evolving technology courses
Authors: Richard Helps
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

One of the challenges of higher education in technology, especially in computer disciplines, is the rapid change of technical content. In technology disciplines with a tradition of experiential learning instructors need to continually redesign courses to ensure the learning experience for the students is current and relevant. This paper discusses an approach to course design that has been applied to a class in Information Technology that experiences significant changes in course content on a regular basis. The design approach allows many aspects of the course design to remain constant, including much of the class presentation and assessment, while including the latest technology developments and applications in the course. Students collaborate in seeking out new applications in technology and in sharing them with the class. The paper discusses a course module developed using these principles. Different aspects of the design were analyzed. Firstly how successful is this as a mechanism for maintaining course currency with current technological developments, secondly to what extent is this successful for instructors to collaborate with students in acquiring new knowledge in the discipline and thirdly does the instructional design approach adequately support student learning of new application areas in the discipline.
Evaluating a New Reputation Algorithm With Consideration For Fairness
Authors: Adam Wierzbicki
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

The fairness of reputation and trust management systems is rarely taken into account in their evaluation due to the prevalence of the paradigm of the Prisoner's Dilemma. Yet, considering fairness explicitly leads to a different design of reputation algorithms. This paper proves this claim by considering fairness in the design of a new reputation algorithm that uses the concept of implicit negative feedback: the interpretation of missing feedback as a semi-negative feedback. The use of fairness in the evaluation of the new algorithm shows the opportunities and threats of using implicit feedback.
A Quantitative/Method of Speed Comparison Between Analog/Hybrid and Digital Computers
Authors: R. M. Howe
Venue: Computer (1976)

For many years it has been claimed that analog and hybrid computers have a sizeable speed advantage over digital computers in the solution of differential equations. This speed advantage has, in fact, been documented for a number of specific studies, where direct comparisons with all-digital solutions have shown reduced run times and resulting cost savings using analog or hybrid computers. The purpose of this paper is to present a quantitative method of speed comparison that is quite general and allows direct speed comparisons between specific analog and digital computers. The method is based on previous reports written by the authors.1,2Ability to make such speed comparisons is particularly important at this time when faster and faster digital computers are being marketed at generally lower prices.
A Multi-agent, Multi-object and Multi-attribute Intelligent Negotiation Model
Authors: Yulian Fei, Wenjuan Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Automated negotiation among software agents is becoming increasingly important in e-business. Currently, most of these multi-agent negotiation models are focused simply on mono-object negotiations. But in fact, most practical business negotiations are based on multiple objects. In order to improve the intelligent negotiation model to meet the practical requirements, this paper proposes an integrated multi-agent, multi-object and multi-attribute intelligent negotiation model named M3INM. M3INM introduces a scalable multi-agent negotiation framework and integrates various negotiation rules into the model. In order to meet the balance among multiple attributes, the model introduces the idea of simulated annealing (SA) iterative algorithm. This deliberate SA algorithm adjusts dynamically the correlativity among attributes to obtain the optimized negotiation solution. Besides, the relevant negotiation mathematics model is also discussed and simulation results are presented and analyzed in this paper.
Fuzzy trace identification algorithms for non-stationary systems
Authors: R. Ben Abdennour, G. Favier, M. Ksouri
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

In this paper, we propose fuzzy trace identification algorithms for identifying non-stationary stochastic systems. These algorithms are obtained by combining an adaptive trace identification algorithm with a fuzzy logic based supervisor. The supervision level uses the global parametric distance and the signal to noise ratio as inputs. A third input equal to the ratio between short term and long term estimated values of the output prediction error variance can also be used in order to provide faster convergence and better robustness of the parameter estimator in presence of model changes. The efficiency of the proposed identification methods is illustrated by means of simulation examples.
Integrated data management for mobile services in the real world
Authors: C. Hage, C. S. Jensen, T. B. Pedersen, L. Speicys, I. Timko
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Market research companies predict a huge market for services to be delivered to mobile users. Services include route guidance, point-of-interest search, metering services such as road pricing and parking payment, traffic monitoring, etc. We believe that no single such service will be the killer service, but that suites of integrated services are called for. Such integrated services reuse integrated content obtained from multiple content providers. This paper describes concepts and techniques underlying the data management system deployed by a Danish mobile content integrator. While georeferencing of content is important, it is even more important to relate content to the transportation infrastructure. The data management system thus relies on several sophisticated, integrated representations of the infrastructure, each of which supports its own kind of use. The paper covers data modeling, querying, and update, as well as the applications using the system.
A Versatile Text for the Introductory Computational Physics Course
Authors: Eric Ayars
Venue: Computing in Science and Engineering (2007)

This book review examines an interesting new textbook on scientific programming languages.
Hand-Based Personal Identification Using K-Means Clustering and Modified Zernike Moments
Authors: Jun Kong, Hongzhi Li, Yinghua Lu, Miao Qi, Shuhua Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Biometrics-based identity verification is regarded as an effective approach for automatic recognition recently. A novel personal identity verification approach based-on palmprint is proposed in this paper. Both a coarse-to-fine identification strategy and the weight-based self-adaptive feature selection mechanism are adopted to facilitate the verification task and improve veracity. The wavelet transformation and modified Zernike moments techniques are used to extract the texture features of palmprint. In the identification stage, the K-means algorithm is first used to select a small set of similar candidates from the database for further matching. After feature optimization, one-class-one-network (Back Propagation Neural Network (BPNN)) classification structure is employed for final determination. The experimental results show the proposed methods are effectiveness and accuracy.
Development of Digital Image Surface and Its Application to Derived 12-Lead ECG
Authors: Kunio Takahashi, Daming Wei
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The "image surface" is a data collection of spa-tial vectors that reflect relationship between heart vec- tor and measured electrocardiograms, supposing the heart source is a fixed dipole source. For long, the Frank image surface has been used. However, since the Frank model represents an average model of west- ern population, it may not fit other populations like Japanese, and therefore may affect the accuracy of ap- plications In this study, to improve the accuracy of the derived 12-lead ECG, we developed the digital image surface based on the personalized torso models constructed from MRI images. The boundary element method was used to calculate the values of digital image surface by applying electrical current dipole source on the torso- heart model. Further, the valises of the digital image surface for eight subjects were averaged as a represen- tation of typical models of Japanese population. As an application, derived 12-lead ECG is obtained based on the digital image surface and the results is com- pared with those based on the Frank image surface. The results show that the digital image surface can get better accuracy than the Frank image surface.
Distortion Analysis in Scalable Image Compression Scheme based on efficient Codebook selection
Authors: Muhammad Kamran, Haroon-ur-Rashid Khan, Shi Feng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Image compression scheme is divided into different operational phases for reliable, successful and efficient results. In this paper, Layered Scalable Concurrent Image Compression LSCIC pre coder is analyzed which is already proved scalable and stable with respect to data transmission and pixel loss. In the light of available compression schemes associated with vector quantization, codebook is developed using different optimized techniques like pair wise nearest neighbor algorithm, and other modified methods majority of them based on Linde Buzo Gray LBG algorithm. For the accomplishment of the objective, data blocks from LSCIC pre coder reach encoder which selects best code vector with respect to similarity with input vector. Best selection is obtained by the virtue of distortion measurement by utilizing Lloyd algorithm in conjunction with Vector Quantization method. Results are shown to achieve some novel observations when best codebook is selected.
A Multi-clustering Hybrid Recommender System
Authors: Sutheera Puntheeranurak, Hidekazu Tsuji
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Recommender systems have become an important research area because they have been a kind of web intelligence techniques to search through the enormous volume of information available on the internet. Collaborative filtering and content-based methods are two most commonly used approaches in most recommender systems. Although each of them has both advantages and disadvantages in providing high quality recommendations, a hybrid recommendation mechanism incorporating components from both of the methods would yield satisfactory results in many situations. In this paper, we present an elegant and effective framework for combining content and collaboration. Our approach uses a content-based predictor to enhance existing user data and item data, and then provides personalized suggestions through user-based collaborative filtering and item-based collaborative filtering. The proposed system clusters on content-based approach and collaborative approach then it contribute to the improvement of prediction quality of a hybrid recommender system.
Review: Line spectral pairs
Authors: Ian Vince McLoughlin
Venue: Signal Processing (2008)

Linear prediction-based coders commonly utilise line spectral pairs (LSPs) to represent linear prediction coefficients for reasons of filter stability and representational efficiency. LSPs have other useful properties such as an ordering related to the spectral properties of the underlying data, which leads to advantages when used for analysing speech and other signals. This paper reviews the LSP representation, conversion and quantization processes, computational issues associated with the implementation of LSP-based methods, and their use in speech analysis and processing. In addition, this paper presents LSP manipulation methods that can be used to alter frequencies within the represented signal in a consistent and relevant way, and considers the use of LSPs for analysis of non-speech information.
3D Two Spirals Separation Based upon Qualitative Mapping
Authors: Xu Guanglin, Lin Yongchang, Li Hua, Feng Jiali
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Two spirals separation is an important non-linear recognition problem which can be used to test the function of artificial learning system. We design an intelligent method based on qualitative mapping and try to recognize 3D two spirals. The result of the computer based experiment indicates that the mode we use has the following merits: less learning samples, shorter learning time, faster recognition and higher recognizing rate. Also we discuss the value of the mode both in theory and commercial development.
Hardware Verification
Authors: J. P. Roth
Venue: IEEE Transactions on Computers (1977)

The need for verification of hardware designs is particularly important for large-scale-integration technologies because of the great cost, in time and money, for engineering changes. This correspondence describes an efficient means for determining the equivalence of a behavioral, high-level, i.e., flowchart, definition of the design and a detailed regular logic design. It may be used between compatible high-level as well as low-level designs. A compiler RTRAN transforms the high-level to a low-level design and a program VERIFY determines the equivalence of two such regular logic designs. It seeks to compute a counterexample, starting at the outputs, rather than to try exhaustively input patterns. Experimentally, VERIFY is proven vastly superior to exhaustive simulation. These methods have been used routinely for very large designs.
Non-supervised image segmentation based on multiobjective optimization
Authors: A. Nakib, H. Oulhadj, P. Siarry
Venue: Pattern Recognition Letters (2008)

The segmentation process based on the optimization of one criterion only does not work well for a lot of images. In many cases, even when equipped with the optimal value of the threshold of its single criterion, the segmentation program does not produce a satisfactory result. In this paper, we propose to use the multiobjective optimization approach to find the optimal thresholds of two criteria: the within-class criterion and the overall probability of error criterion. In addition we develop a new variant of Simulated Annealing adapted to continuous problems to solve the histogram Gaussian curve fitting problem. Six examples of test images are presented to compare the efficiency of our segmentation method, called Combination of Segmentation Objectives (CSO), based on the multiobjective optimization approach, with that of two classical competing methods: Otsu method and Gaussian curve fitting method. From the viewpoints of visualization, object size and image contrast, our experimental results show that the segmentation method based on multiobjective optimization performs better than the Otsu method and the method based on Gaussian curve fitting.
Independence complexes of claw-free graphs
Authors: Alexander Engström
Venue: European Journal of Combinatorics (2008)

We study the class of independence complexes of claw-free graphs. The main theorem gives good bounds on the connectivity of these complexes, given bounds for a few subcomplexes of the same class. Two applications are presented. Firstly, we show that the independence complex of a claw-free graph with n vertices and maximal degree d is (cn/d+@e)-connected, where c=2/3. This can be compared with the result of Szabo and Tardos that c=1/2 is optimal with no restrictions on the graphs. Secondly, we calculate the connectivity of a family of complexes used in Babson and Kozlov's proof of the Lovasz conjecture.
Letters: Variational Bayesian method for speech enhancement
Authors: Qinghua Huang, Jie Yang, Yue Zhou
Venue: Neurocomputing (2007)

In this paper, we propose to use variational Bayesian (VB) method to learn the clean speech signal from noisy observation directly. It models the probability distribution of clean signal using a Gaussian mixture model (GMM) and minimizes the misfit between the true probability distributions of hidden variables and model parameters and their approximate distributions. Experimental results demonstrate that the performance of the proposed algorithm is better than that of some other methods.