The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper illustrated the characteristics of UTP-5 and Hub-spoken topology, and presented the concept of margin motion coefficient and reliability coefficient based on graph theory and relation matrix and made thorough analysis and comparison. Suggestions are made on resolution of topology problems on cabling infrastructure of intelligent buildings.
The evolutions computation is the best proceeding algorithm for all kinds of optimization problem in the world. Bayesian optimization algorithm (BOA) is one kind of the evolution algorithm which is advantage on others for high order, hierarchical and correlative on anther optimization problem. For improving the ability of the BOA, the decision graph was introduced to enhance the represent and learn...
The data structure diagram is abstracted from the diagram of railway yard signal arrangement. HBACA (hybrid behavior based ant colony algorithm) is presented to search the shortest route of railway yard. The route searching program based on HBACA is developed. The graphical representation of railway yard is given on the console. According to the designated beginning node and the designated ending...
An abstraction of a problem of rearranging group of mobile robots is addressed in this paper (the problem of multi-robot path planning). The robots are moving in an environment in which they must avoid obstacles and each other. An abstraction where the environment is modeled as an undirected graph is adopted throughout this work. A case when the graph modeling the environment is biconnected is particularly...
Given an undirected graph with weights on the vertices, the maximum weight clique problem requires to find the clique of the graph which has the maximum weight. The problem is a general form of the maximum clique problem. In this paper, we encoded weight of vertex into a unique fixed length oligonucleotide segment and employed sticker model to solve the problem. The proposed method has two distinct...
The existence DNA computing models can solve most hard NP problems in theory. The graph isomorphism problem is a classical NP-hard problem. In this paper we proposed a DNA-based sticker algorithm, which uses the concept of incidence degree sequence to solve the graph isomorphism problem. The proposed algorithm is simplicity of operation and only O(2n) DNA strands is required in the worst case, where...
An adaptive Graph-cut algorithm to video moving objects segmentation was proposed. By the Kalman prediction of the number of objectives pixels and objectives-background pixel-pairs, and adaptive updating of the nodes flux, the Graph-cut algorithm was successfully applied to video moving objects segmentation. It was achieve to continuous global optimization segmentation of video moving objects. Experimental...
Application-specific integrated circuits (ASICs) are physical implementations of algorithms, so implementation metrics are determined in large part by the algorithm specification. However, the system abstraction layers that have been developed to manage the ever-increasing complexity of digital systems separate algorithm designers from hardware designers, forcing the latter to work within the design...
To solve the problem of process instances adaptation caused by dynamic process changes in workflow systems, a solution of workflow instance migration based on automatic planning mechanism was proposed, in which AI planning methods were used in migrating workflow system. The initial state and the target state of migrating instance were expressed with disjunction of an order prediction, the HTN method...
In this paper the problem of reducing congestion in WDM networks based on unidirectional de Bruijn graphs has been addressed in the presence of node faults. We propose a polynomial time routing algorithm for reducing congestion and analyze its time complexity. Congestion is defined as the maximum of the number of lightpaths propagating through a link over all links in the network. Congestion optimization...
In order to enhance the hull erection efficiency and realize the supervisory control dynamically to construction course, this paper applies Fuzzy-timed place Petri net to simulate the process of hull erection. Triangular Fuzzy Number is utilized to denote the uncertain duration, and an advanced Minkowski subtraction is presented in the model. We eliminate the Hatch Coaming Sections, combine the Compartment...
In connection with the network realization problem the main questions of the algorithm are which edges to choose and what is the budget consequence of that. These problems can be solved by exact optimization methods, but in this case the number of computational steps (additions and comparisons) is an exponential function of the number of nodes. For this reason usually heuristic methods are chosen...
The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents. As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining. In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between...
As a famous problem in combinatorics, small Ramsey number is very hard to solve, because it needs to enumerate all possible graphs in exponential time. We propose a new DNA algorithm for constructing Ramsey graphs, which is a complete process for a small-scale instance to construct all the R(3,3)-graphs of order five from theory to experiment. Based on in-depth analysis of Ramsey graph and bio-manipulation,...
Many mesh-pull P2P live streaming systems deployed in Internet catch a large number of users during recent years. While they have high scalability and low cost, they suffer from bad delay performance. In this paper, we aim at reducing the delay caused by chunk scheduling for mesh-pull P2P live streaming in the environment of heterogeneous upload bandwidth, heterogeneous and dynamic propagation delays...
One of the important properties of a reliable communication network is the robustness to the environmental changes. This paper looks at the design of robust networks from a new perspective. A graph-theoretical metric, betweenness, in combination with network weight matrix is used to define a global quantity, network criticality, to characterize the robustness of a network. We show that network criticality...
For arbitrarily small constants epsilon, delta ??.?? > 0, we present a long code test with one free bit, completeness 1-epsilon and soundness delta. Using the test, we prove the following two inapproximability results:1. Assuming the Unique Games Conjecture of Khot, given an n-vertex graph that has two disjoint independent sets of size (1/2-??)n each, it is NP-hard to find an independent set of...
Wireless sensor networks have attracted much research attention in recent years and can be used in many different applications.In this paper ,we analyze the impact of energy efficiency in Wireless sensor networks, as a result is clustering technique has been proven to be an effective approach for reducing energy consumption.lt also can increase the scalability and lifetime of the network, we propose...
In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel optimization for solving a set of examination timetabling problems. Both components interact adaptively to determine the best ordering of examinations to be processed at each iteration. A variety of approaches using different...
Graph theory is the theoretical fundamental of network technologies. This paper reports an investigation of stability issues of the network technologies based on the graph theory. It also presents solutions of the geodetic number of graph Cm times Cn. There are many parameters which can measure to some extent the robustness of an interconnection network with respect to link failures, such as domination...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.