ppxscal/embedding_network huggingface dataset:
Regular orientable embeddings of complete bipartite graphs
Authors: Jin Ho Kwak, Young Soo Kwon
Venue: Journal of Graph Theory (2005)

In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph Kn,n are in one-to-one correspondence with the permutations on n elements satisfying a given criterion, and the isomorphism classes of them are completely classified when n is a product of any two (not necessarily distinct) prime numbers. For other n, a lower bound of the number of those isomorphism classes of Kn,n is obtained. As a result, many new regular orientable embeddings of the complete bipartite graph are constructed giving an answer of Nedela-&Scaron;koviera's question raised in [12]. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Mapping a specific class with an ensemble of classifiers
Authors: G. M. Foody, D. S. Boyd, C. Sanchez-Hernandez
Venue: International Journal of Remote Sensing (2007)

Often, in remote sensing, interest is focused on just one of the many classes that are typically represented in the area covered by an image. Various binary classifiers may be used to separate this specific class of interest from all others. It can, however, be difficult to identify the most appropriate classifier in advance. The selection of classifier is also often further complicated by a desire for information on classification uncertainty to indicate the spatial variation in classification quality. Here, five classifiers (a discriminant analysis, decision tree, support vector machine, multi-layer perceptron, and radial basis function neural network) were used to map fenland, an important class for conservation activities, from Landsat ETM+data. The classifications derived ranged in accuracy from 81.2 to 96.8%. The outputs of the classifications were also combined using a simple voting procedure to determine class allocation. The accuracy of this ensemble approach was 95.6%. Although marginally, but insignificantly (at 95% level of confidence), less accurate than the most accurate individual classifier, it is difficult to specify the most appropriate classifier in advance. In addition, the ensemble approach yielded class-allocation uncertainty information that may be used to help post-classification refinement operations and later analyses. For example, as only a small proportion of cases were allocated with a high degree of uncertainty and these contained most of the mis-classifications, targeting such sites for fieldwork could be one simple and efficient means of increasing classification accuracy. Alternatively, the cases for which all five classifiers agreed on an allocation could be treated as being correctly labelled with a high degree of confidence.
Towards an FBM model based network calculus framework with service differentiation
Authors: Yu Cheng, Weihua Zhuang, Xinhua Ling
Venue: Mobile Networks and Applications (2007)

In this paper, we exploit traffic modeling with the fractional Brownian motion (FBM) process to develop a network calculus framework for end-to-end performance analysis over a network provisioning differentiated services (DiffServ). The fundamental elements constituting the framework include accurate single-hop queueing analysis and three network calculuses that describe the stochastic behaviors when the traffic process is multiplexed, randomly split, or goes through a buffering system, respectively. Specifically, we develop a generic FBM based analysis for multiclass single-hop analysis where both inter-buffer priority and intra-buffer priority are used for service differentiation. Moreover, we present both theoretical and simulation studies to demonstrate that the output from the multiplexing, splitting, and buffering calculuses can still be modeled or well approximated by a properly parameterized FBM process. It is such preservation of the FBM characteristics that enables the concatenation of FBM based single-hop analysis into a network-wide performance analysis.
Randomized online graph coloring
Authors: S. Vishwanathan
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

It is shown that randomization helps in coloring graphs online, and a simple randomized online algorithm is presented. For 3-colorable graphs the expected number of colors the algorithm uses is O((n log n)/sup 1/2/). The algorithm runs in polynomial time and compares well with the best known polynomial-time offline algorithms. A lower bound is proved for the randomized algorithm.
Optimal replacement period of a two-unit system with failure rate interaction and external shocks
Authors: Min-Tsai Lai, Ying-Chang Chen
Venue: International Journal of Systems Science (2008)

In this article, a periodical replacement model for a two-unit system which is both subjected to failure rate interaction and external shocks will be presented. Without external shocks, each unit 1, whenever it fails, will act as an interior shock to affect the failure rate of unit 2 and increase the failure rate of unit 2 to a certain degree, while each unit 2 failure causes unit 1 into instantaneous failure. Besides failure rate interaction between units, the system is also subjected to external shocks which can be divided into two types. Type A shock causes unit 1 into failure and then converts the damage of such a failure to unit 2, while type B shock makes the system total breakdown. All unit 1 failures are corrected by minimal repairs. The aim of this article is to derive the expected cost rate per unit time by introducing relative costs as a criterion of optimality, and then the optimal replacement period which minimizes that cost will be determined. A numerical example is given to illustrate the method.
A family of Newton-type methods for solving nonlinear equations
Authors: Davod Khojasteh Salkuyeh
Venue: International Journal of Computer Mathematics (2007)

A family of Newton-type methods free from second and higher order derivatives for solving nonlinear equations is presented. The order of the convergence of this family depends on a function. Under a condition on this function this family converge cubically and by imposing one condition more on this function one can obtain methods of order four. It has been shown that this family covers many of the available iterative methods. From this family two new iterative methods are obtained. Numerical experiments are also included.
Proofs from tests
Authors: Nels E. Beckman, Aditya V. Nori, Sriram K. Rajamani, Robert J. Simmons
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

We present an algorithm DASH to check if a program P satisfies a safety property phi. The unique feature of the algorithm is that it uses only test generation operations, and it refines and maintains a sound program abstraction as a consequence of failed test generation operations. Thus, each iteration of the algorithm is inexpensive, and can be implemented without any global may-alias information. In particular, we introduce a new refinement operator WP_alpha that uses only the alias information obtained by executing a test to refine abstractions in a sound manner. We present a full exposition of the Dash algorithm, its theoretical properties, and its implementation.
TaskObserver: a tool for computer aided observations in complex mobile situations
Authors: Tobias Klug, Max Mühlhäuser
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach their limits. This paper investigates the challenge of creating and communicating information about the user's primary task with regards to its fine grained temporal structure. TaskObserver is a TabletPC software that allows real-time logging of events during observations of complex mobile scenarios. The results are communicated to other team members using task trace graphs of the events observed. A user study was performed to estimate the accuracy of the real-time annotations and the amount of time that can be saved by using the system. Additionally the usability of the existing tool was evaluated.
Multiclass classification using neural networks and interval neutrosophic sets
Authors: Pawalai Kraipeerapun, Chun Che Fung, Kok Wai Wong
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

This paper presents a new approach to the problem of multiclass classification. The proposed approach has the capability to provide an assessment of the uncertainty value associated with the results of the prediction. Two feed-forward backpropagation neural networks, each with multiple outputs, are used. One network is used to predict degrees of truth membership and another network is used to predict degrees of false membership. Indeterminacy membership or uncertainty in the prediction of these two memberships is also estimated. Together these three membership values form an interval neutrosophic set. Hence, a pair of single multiclass neural networks with multiple outputs produces multiple interval neutrosophic sets. We experiment our technique to the classical benchmark problems including balance, ecoli, glass, lenses, wine, yeast, and zoo from the UCI machine learning repository. Our approach improves classification performance compared to an existing technique which applied only to the truth membership created from a single neural network with multiple outputs.
Data management projects at Google
Authors: Michael Cafarella, Edward Chang, Andrew Fikes, Alon Halevy, Wilson Hsieh, Alberto Lerner, Jayant Madhavan, S. Muthukrishnan
Venue: ACM SIGMOD Record (2008)

This article describes some of the ongoing research projects related to structured data management at Google today. The organization of Google encourages research scientists to work closely with engineering teams. As a result, the research projects tend to be motivated by real needs faced by Google's products and services, and solutions are put into production and tested rapidly. In addition, because of the sheer scale at which Google operates, the engineering challenges faced by Google's services often require research innovations.
Conflict detection and resolution for workflows constrained by resources and non-determined durations
Authors: Qingtian Zeng, Huaiqing Wang, Dongming Xu, Hua Duan, Yanbo Han
Venue: Journal of Systems and Software (2008)

The correctness of a workflow specification is critical for the automation of business processes. Therefore, errors in the specification should be detected and corrected at build-time. In this paper, we present a conflict verification and resolution approach for a kind of workflow constrained by resources and non-determined duration based on Petri net. In this kind of workflow, there are two timing functions for each activity to present the minimum and maximum duration of each activity, and the implementations of some activities require resources. Based on the Petri net model obtained, the earliest time to start each activity can be calculated and the key activities influencing the implementation of the workflow can be determined, with which the resource consistency between activities can be verified. Key-activity and waiting-short priority strategies are adopted to remove the resource conflicts between activities, which can ensure that most of the subsequent activities start as early as possible and that the whole workflow be finished in a shorter time. Through experiments, it is proved that the proposed removal strategy for resource conflicts is better than other strategies.
On the statistical structure of losses caused by the buffer overflow
Authors: Andrzej Chydzinski
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

The paper gives the answer to the question, whether calculating the cell loss ratio gives us information about the statistical structure of losses caused by the buffer overflow. In other words, can two queueing systems having exactly the same cell loss ratio have quite different consecutive cell loss probabilities? The answer to this question is studied for a variety of queueing systems with different buffer capacities, traffic intensities and the distributions of the service time.
A Multi-layered Approach to the Polysemy Problems in a Chinese to Taiwanese System
Authors: Yih-Jeng Lin, Ming-Shing Yu, Chin-Yu Lin, Yuan-Tsun Lin
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

This paper proposes a novel approach to the polysemy problems in a Chinese to Taiwanese TTS system. Polysemy means there are words with more than one meaning or pronunciation, such as "我們" (we), "不" (no), "你" (you), "我" (I), "要" (want), and so on. The correct pronunciation of a word affects the comprehensibility (or clarity) and fluency of Taiwanese speech. We have shown that using language models to solve the polysemy problems with outstanding results [12]. We use a layered approach to the polymesy problem of the word "&#x4E0D;" (no) in this paper. Results show that the accuracy rate of proposed layered approach is 5% and 17.69% over language models and decision list classifier.
Multi-agent model predictive control for transportation networks: Serial versus parallel schemes
Authors: R. R. Negenborn, B. De Schutter, J. Hellendoorn
Venue: Engineering Applications of Artificial Intelligence (2008)

We consider the control of large-scale transportation networks, like road traffic networks, power distribution networks, water distribution networks, etc. Control of these networks is often not possible from a single point by a single intelligent control agent; instead control has to be performed using multiple intelligent agents. We consider multi-agent control schemes in which each agent employs a model-based predictive control approach. Coordination between the agents is used to improve decision making. This coordination can be in the form of parallel or serial schemes. We propose a novel serial coordination scheme based on Lagrange theory and compare this with an existing parallel scheme. Experiments by means of simulations on a particular type of transportation network, viz., an electric power network, illustrate the performance of both schemes. It is shown that the serial scheme has preferable properties compared to the parallel scheme in terms of the convergence speed and the quality of the solution.
Inter-comparison of ocean colour data products during algal blooms in the Skagerrak
Authors: A. Folkestad, L. H. Pettersson, D. D. Durand
Venue: International Journal of Remote Sensing (2007)

Several ocean colour (OC) Earth observation (EO) sensors are presently collecting data on an operational basis, including the Envisat MERIS sensor. This study aims at quantifying the differences in performance of the ocean colour EO sensors MERIS, MODIS/Aqua, and SeaWiFS for coastal monitoring and for the particular case of coastal algal bloom situations. The standard chlorophyll a, and radiance and reflectance products from the three sensors have been processed and compared for data acquired during the development of an early-spring algal bloom in 2004 in the eastern North Sea region. The study shows a high level of consistency between the Case 1 water Chl a products for all sensors. We conclude that the use of MERIS Chl a and other relevant products enable continued and possibly improved performance of an existing system for harmful algal bloom (HAB) detection and monitoring which up to December 2004 has been based on SeaWiFS.
Optimal multilevel organization modelling for active contributions of principals
Authors: S. P. Mishin
Venue: Automation and Remote Control (2008)

A model of the optimal multilevel organization is described. Its originality is determined by its multilevel character, the optimal hierarchy structure being the internal parameter examined together with the "classical" organization theory parameters, such as technology, number of agents and principals, their types and effort levels, stimulation mechanisms. The key assumption is the additivity of principals' contributions to the total profit of the organization. A particular case of the model with the logarithmic profit function is examined in detail.
Computer-generated conjectures(!) and proofs(!!) in combinatorial game theory (II) (abstract only)
Authors: Thotsaporn "Aek" Thanatipanonda
Venue: ACM Communications in Computer Algebra (2008)

This will be a follow up talk to my wonderful advisor Doron Zeilberger. People like to make fun of me for playing games. But playing games is fun and helps me do math better. I will give more examples of games and show how computers can make conjectures and prove theorems about them. (Received September 19, 2007).
A fuzzy approach to multimodal biometric continuous authentication
Authors: Antonia Azzini, Stefania Marrara, Roberto Sassi, Fabio Scotti
Venue: Fuzzy Optimization and Decision Making (2008)

In the last few years the security of the user's identity has become of paramount importance. In this paper we investigate the opportunity of using a multimodal biometric system as input of a fuzzy controller designed with the aim of preventing user substitution after the initial authentication process.
Evaluating Service Scalability of Network Architectures
Authors: Qi Li, Mingwei Xu, Ke Xu, Jianping Wu
Venue: Proceedings of the Seventh International Conference on Networking (2008)

We propose a new evaluation approach to evaluate the service scalability of network architectures, that aims to study service scalability of network architectures in current Internet architecture and help evaluate designs of next generation Internet (NGI). The key idea is to measure existing network services using the concept of service utility. While service utility indicates whether service deployed in network can get good achievement which considers the index of user satisfaction in network service usage and network costs. After analyzing different types of services existing in current network, we explain the design rationale behind this evaluation approach and present analysis results of different types of services in different network architectures. The analysis results show that our approach is feasible to evaluate service scalability of network architectures, even if it needs further study to evaluate service scalability of the whole Internet architecture with more powerful cost and utility functions.
Tactics Analysis on Women Swimming Athletes in the 800m Freestyle Swimming Race Using Speed Coefficient Theory
Authors: Ting Liao
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Based on the results of 2004 Olympic Games, 2005 world swimming championships and 10th National Games Swimming Competition, a comprehensive analysis is done on the world's elite female athletes in the 800m freestyle swimming about the physical distribution of projects and tactical characteristics. By the selection of the first to sixth's accomplishments, we make some changes and obtain the coefficients of velocity, which we can use to reflect the abilities of sub-athletes physical distribution of run-length features. Upon this theory, we review the tactical application of world elite athletes, identify the gap between Chinese athletes and the world elites, and provide the physical distribution model that is detailed, intuitive, "easy-to-control". Therefore we hope that Chinese athletes can learn from the reasonable physical distribution model, and apply to training practice. We also hope that this article can enhance the Chinese overall level of swimming, and provide the preparation for the 2008 Olympic Games as a reference.
Software Note: TMBETADISC-RBF: Discrimination of β-barrel membrane proteins using RBF networks and PSSM profiles
Authors: Yu-Yen Ou, M.Michael Gromiha, Shu-An Chen, Makiko Suwa
Venue: Computational Biology and Chemistry (2008)

Discriminating outer membrane proteins (OMPs) from other folding types of globular and membrane proteins is an important task both for identifying OMPs from genomic sequences and for the successful prediction of their secondary and tertiary structures. We have developed a method based on radial basis function networks and position specific scoring matrix (PSSM) profiles generated by PSI-BLAST and non-redundant protein database. Our approach with PSSM profiles has correctly predicted the OMPs with a cross-validated accuracy of 96.4% in a set of 1251 proteins, which contain 206 OMPs, 667 globular proteins and 378 @a-helical inner membrane proteins. Furthermore, we applied our method on a dataset containing 114 OMPs, 187 TMH proteins and 195 globular proteins obtained with less than 20% sequence identity and obtained the cross-validated accuracy of 95%. This accuracy of discriminating OMPs is higher than other methods in the literature and our method could be used as an effective tool for dissecting OMPs from genomic sequences. We have developed a prediction server, TMBETADISC-RBF, which is available at http://rbf.bioinfo.tw/~sachen/OMP.html.
Development of a generic activities model of command and control
Authors: N. A. Stanton, C. Baber, G. H. Walker, R. J. Houghton, R. McMaster, R. Stewart, D. Harris, D. Jenkins, M. S. Young, P. M. Salmon
Venue: Cognition, Technology and Work (2008)

This paper reports on five different models of command and control. Four different models are reviewed: a process model, a contextual control model, a decision ladder model and a functional model. Further to this, command and control activities are analysed in three distinct domains: armed forces, emergency services and civilian services. From this analysis, taxonomies of command and control activities are developed that give rise to an activities model of command and control. This model will be used to guide further research into technological support of command and control activities.
New existence proofs ε-nets
Authors: Evangelia Pyrga, Saurabh Ray
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

We describe a new technique for proving the existence of small μ-nets for hypergraphs satisfying certain simple conditions. The technique is particularly useful for proving o(1/μ log 1/μ) upper bounds which the standard VC-dimension theory does not allow. We apply the technique to several geometric hypergraphs and obtain simple proofs for the existence of O(1/μ) size μ-nets for them. This includes the geometric hypergraph in which the vertex set is a set of points in the plane and the hyperedges are defined by a set of pseudo-disks. This result was not known previously. We also get a very short proof for O(1/μ) size μ-nets for half-spaces in R3.