Artificial Intelegence Pemanfaatan Metode Hill Climbing Mencari Lintasan Terpendek Objek Wisata Menggunakan sistem Informasi

The search is often used to search for the shortest route, the Hill Climbing Method is a part of the test that uses heuristic functions. The problem that is often encountered is in the form of miscalculations in calculating the distance so that it requires long distances, costs a lot and takes a very long time. To solve this case, it can be solved by making a structure graph by looking at the city points from the two sides of the point to be passed. Using an algorithm can help make it easier to find a location and save time and travel costs that will be passed. This advantage is that all points will be obtained and checked from the right and left sides one by one so as to obtain effective and maximum results. The Hill Climbing method that will be used has the concept of a geographic information system as a guide and is used as a system for decision making. The heuristic search method is one of the methods commonly used in finding a way

Space Layout Method for Carton Conveying System Based on SOSG Matrix

The traditional cigarette conveying system of cigarette industry adopts a one-to-one hard connection method, which has problems such as poor spatial scalability and high equipment coupling. A spatial layout method for carton conveying system based on the SOSG (Solid Orthogonal Structure Graph) matrix is proposed. Through this method, a matrix cigarette conveying system is constructed. Compared with the traditional mode, its space utilization rate is increased by 67%, equipment coupling is reduced, and the downtime rate of carton conveying line due to the shutdown of sealing machine can be reduced from 100% to 0%.

PoreMatMod.jl: Julia package for in silico post-synthetic modification of crystal structure models

PoreMatMod.jl is a free, open-source, user-friendly, and documented Julia package for modifying crystal structure models of porous materials such as metal-organic frameworks (MOFs). PoreMatMod.jl functions as a find-and-replace algorithm on crystal structures by leveraging (i) Ullmann's algorithm to search for subgraphs of the crystal structure graph that are isomorphic to the graph of a query fragment and (ii) the orthogonal Procrustes algorithm to align a replacement fragment with a targeted substructure of the crystal structure for installation. The prominent application of PoreMatMod.jl is to generate libraries of hypothetical structures for virtual screenings via molecular simulations. For example, one can install functional groups on the linkers of a parent MOF, mimicking post-synthetic modification. Other applications of PoreMatMod.jl to modify crystal structure models include introducing defects and correcting artifacts of X-ray structure determination (adding missing hydrogen atoms, resolving disorder, and removing guest molecules).

A Deep Local and Global Scene-Graph Matching for Image-Text Retrieval

Conventional approaches to image-text retrieval mainly focus on indexing visual objects appearing in pictures but ignore the interactions between these objects. Such objects occurrences and interactions are equivalently useful and important in this field as they are usually mentioned in the text. Scene graph presentation is a suitable method for the image-text matching challenge and obtained good results due to its ability to capture the inter-relationship information. Both images and text are represented in scene graph levels and formulate the retrieval challenge as a scene graph matching challenge. In this paper, we introduce the Local and Global Scene Graph Matching (LGSGM) model that enhances the state-of-the-art method by integrating an extra graph convolution network to capture the general information of a graph. Specifically, for a pair of scene graphs of an image and its caption, two separate models are used to learn the features of each graph’s nodes and edges. Then a Siamese-structure graph convolution model is employed to embed graphs into vector forms. We finally combine the graph-level and the vector-level to calculate the similarity of this image-text pair. The empirical experiments show that our enhancement with the combination of levels can improve the performance of the baseline method by increasing the recall by more than 10% on the Flickr30k dataset. Our implementation code can be found at https://github.com/m2man/LGSGM.

Matroid And Its Relations

In this article, the connections amid matroid and other notions have been studied. The structure of matroid could be a reflection of some other structure in lattice theory, group theory, other algebraic structure, graph theory, combinatorics and enumeration theory.

About Structure of Graph Obstructions for Klein Surface with 9 Vertices

The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of j-transformations of the graphs. The problem of establishing the structural properties of 9 vertex obstruction graphs for the surface of the undirected genus 2 by the method of j-transformation of graphs is considered. The article has an introduction and 5 sections. The introduction contains the main definitions, which are illustrated, to some extent, in Section 1, which provides several statements about their properties. Sections 2 – 4 investigate the structural properties of 9 vertex obstruction graphs for an undirected surface by presenting as a j-image of several graphs homeomorphic to one of the Kuratovsky graphs and at least one planar or projective-planar graph. Section 5 contains a new version of the proof of the statement about the peculiarities of the minimal embeddings of finite graphs in nonorientable surfaces, namely, that, in contrast to oriented surfaces, cell boundaries do not contain repeated edges. Also in section 5 the other properties peculiar to embeddings of graphs to non-oriented surfaces and the main result are given. The main result is Theorem 1. Each obstruction graph H for a non-oriented surface N2 of genus 2 satisfies the following. 1. An arbitrary edge u,u = (a,b) is placed on the Mebius strip by some minimal embedding of the graph H in N3 and there exists a locally projective-planar subgraph K of the graph H \ u which satisfies the condition: (tK({a,b},N3)=1)˄(tK\u({a,b},N2)=2), where tK({a,b},N) is the number of reachability of the set {a,b} on the nonorientable surface N; 2. There exists the smallest inclusion of many different subgraphs Ki of a 2-connected graph H homeomorphic to the graph K+e, where K is a locally planar subgraph of the graph H (at least K+e is homemorphic to K5 or K3,3), which covers the set of edges of the graph H. Keywords: graph, Klein surface, graph structure, graph obstruction, non-oriented surface, Möbius strip.