Papers by Keyword: Graph

Abstract: The article introduces a method of online social network users’ sentiment evaluation. The advantage of the proposed method consists in its ability to take into account user’s influence as well as the fact that a user could be an author of several messages. Results presented in this paper have been used in the past in mechanical engineering to analyze reviews on products as well as in robotics for developing user communication interfaces. The paper shows the steps of calculation of the sentiment of messages on a certain topic in online social networks. The proposed method is deployed with a view of developing analytic tools and visualizations that make use of more than one such datasets in Web Observatories.

Abstract: In this article we have explored the issue of optimization of HPP site location in a cascade depending on social-economic, environmental and energy limitations taking into account available cadastre of water power resources. A multicriterion problem of optimization on the network was formulated. Pareto optimal solution of this problem was obtained by means of the developed mathematical model of optimization of the HPP site location in the cascade. The optimization algorithm to solve this problem has been developed

Abstract: This paper is devoted to one of the most urgent problems in the automation of fluorine production (FP) processes: the development of a dynamic model of the hydrodynamic regime. The paper suggests a dynamic model represented in the form that provides the effective use of up-to-date methods of synthesis and analysis for control algorithms. The model is a set of dynamic models of individual units and devices that have a significant impact on the processes in the technological scheme.

Abstract: This paper discusses the cooperative control for formation keeping of fractionated spacecraft, which is a new concept in recent years. For system of second-order differential equations of formation flying dynamics, knowledge of graph and consensus theory is introduced in study. By means of the idea of sliding mode control, we design a tracking control law for time-varying desired signal. Via exchanging error information among modules, the control law can make errors synchronized up to zero to achieve tracking. Relative velocity information between modules is not needed in this control law, which will efficiently reduce the requirements for relative navigation between modules. Then we prove the stability of the control system. Finally numerical simulation results show the effectiveness of the control law. By configuring the control parameters reasonably, we can achieve high degree of control accuracy.

Abstract: Because of the weakness of traditional Apriori algorithm, this paper presents an improved algorithm for mining frequent itemsets, which constructs bit vector and graph, the algorithm deletes node and the adjacent edges according to the number of node’s edges, which need traverse graph to generate candidate itemsets and verify candidate itemset by bit vector. Experimental results show that the improved algorithm has better efficiency than Apriori algorithm.

Abstract: Graph indexing is one of the budding dominant current research domains. Varieties of data from different domains pop into the daily updating world in huge volume. There are plenty ways to analyze and to arrange them into an easily accessible index. Here in this paper, we concentrate on the graphical approach. The complete classical algorithms of graph indexing are discussed initially followed by the latest proposed solving methods. Alas, at the end of the paper a complete PLANO frame work is proposed such that the given data can be easily indexed and the updated features can be propelled onto the index.

Abstract: In this paper, given a binary relation, we represented the relationship between a fuzzy graph and a fuzzy concept lattice. We introduced one of the most useful notions in Graph Theory--minimal separator. In order to make decision-making much easier, the number of concepts can be reduced by selecting a sublattice via saturating the minimal separator of a given concept, a method also proposed when converting L-context to classical context. In the end, we discussed a few open issues.

Abstract: In the mechanical design process, the interpretation of geometrical and dimensional tolerances is a common task in a products life cycle because tolerances are of decisive importance in the decisions related to cost and quality. At present, there are numerous approaches and investigations related to the modeling of tolerances in mechanical assemblies, related to Computer Aided Design Systems. The goal of this paper is to show a method to modeling an assembly based on a graph map structure, to guarantee the resolution of dimensional chains and tolerance analysis. In this process, which is based on a graph map structure, the dimensional chains associated to the functional requirements that influence the relative location of the parts are determined. A subset of a belt conveyor as an example, illustrates the proposed method.

Abstract: It has been known that an interconnection network can be modeled by a connected graph whose vertices represent sites of the network and whose edges represent physical communication links. Being the underlying theory of network, graph theory can be used to investigate network issues. In this paper we consider two parameters of graph: the domination number and bondage number b (G). These parameters measure to some extent the robustness of an interconnection network with respect to link failures. By constructing a family of minimum dominating sets we calculate the domination number and bondage number of graph G².

Abstract: Parsing Chinese is a key issue in NLP. Many controversies arise from Chinese special sentence patterns. This paper puts forward a novel model Feature Structure theory to resolve the semantic labeling of Chinese special sentence patterns. We analyze the difficulties in annotating these sentences, and compare Feature Structure with dependency structure. Feature Structure represents more semantic information and more semantic relations. Feature Graph is a recursive undirected graph, allows nesting and multiple correlations.