Point-Graph Neural Network Based Novel Visual Positioning System for Indoor Navigation

Indoor localization is a basic element in location-based services (LBSs), including seamless indoor and outdoor navigation, location-based precision marketing, spatial recognition in robotics, augmented reality, and mixed reality. The popularity of LBSs in the augmented reality and mixed reality fields has increased the demand for a stable and efficient indoor positioning method. However, the problem of indoor visual localization has not been appropriately addressed, owing to the strict trade-off between accuracy and cost. Therefore, we use point cloud and RGB characteristic information for the accurate acquisition of three-dimensional indoor space. The proposed method is a novel visual positioning system (VPS) capable of determining the user’s position by matching the pose information of the object estimated by the improved point-graph neural network (GNN) with the pose information label of a voxel database object addressed in predefined voxel units. We evaluated the performance of the proposed system considering a stationary object in indoor space. The results verify that high positioning accuracy and direction estimation can be efficiently achieved. Thus, spatial information of indoor space estimated using the proposed novel VPS can aid in indoor navigation.

A note on the degree conjecture for separability of multipartite quantum states

The degree conjecture for bipartite quantum states which are normalized graph Laplacians was first put forward by Braunstein et al. [Phys. Rev. A 73 (2006) 012320]. The degree criterion, which is equivalent to PPT criterion, is simpler and more efficient to detect the separability of quantum states associated with graphs. Hassan et al. settled the degree conjecture for the separability of multipartite quantum states in [J. Math. Phys. 49 (2008) 0121105]. It is proved that the conjecture is true for pure multipartite quantum states. However, the degree condition is only necessary for separability of a class of quantum mixed states. It does not apply to all mixed states. In this paper, we show that the degree conjecture holds for the mixed quantum states of nearest point graph. As a byproduct, the degree criterion is necessary and sufficient for multipartite separability of [Formula: see text]-qubit quantum states associated with graphs.

Certain topological indices and polynomials for the semitotal-point graph and line graph of semitotal-point graph for Dutch windmill graph

<p>Dutch windmill graph [1, 2] and denoted by <em>Dnm</em>. Order and size of Dutch windmill graph are (<em>n</em>−1)<em>m</em>+1 and mn respectively. In this paper, we computed certain topological indices and polynomials i.e. Zagreb polynomials, hyper Zagreb, Redefined Zagreb indices, modified first Zagreb, Reduced second Zagreb, Reduced Reciprocal Randi´c, 1st Gourava index, 2nd Gourava index, 1st hyper Gourava index, 2nd hyper Gourava index, Product connectivity Gourava index, Sum connectivity Gourava index, Forgotten index, Forgotten polynomials, <em>M</em>-polynomials and some topological indices in term of the <em>M</em>-polynomials i.e. 1st Zagreb index, 2nd Zagreb index, Modified 2nd Zagreb, Randi´c index, Reciprocal Randi´c index, Symmetric division, Harmonic index, Inverse Sum index, Augmented Zagreb index for the semitotal-point graph and line graph of semitotal-point graph for Dutch windmill graph.</p>

Batas Bawah Bilangan Ramsey pada Graf Bintang S_10 Versus Roda W_12 Lower Bound of the Ramsey Number for the Star Graph S_10 Versus Wheels W_12

Bilangan Ramsey untuk graf terhadap graf , dinotasikan dengan adalah bilangan bulat terkecil sedemikian sehingga untuk setiap graf dengan orde akan memenuhi sifat berikut: memuat graf atau komplemen dari memuat graf .Penelitian ini bertujuan untuk menentukan graf kritis maksimum dan dengan genap. Berdasarkan batas bawah tersebut di tentukan batas atas minimum sehingga diperoleh nilai bilangan Ramsey untuk graf bintang versus , atau . Dengan demikian penentuan batas bawah bilangan Ramsey dilakukan dengan cara batas bawah yang diberikan oleh Chavatal dan Harary, untuk bilangan Ramsey pada graf bintang versus adalah , dengan adalah bilangan kromatik titik graf roda dan adalah kardinalitas komponen terbesar graf . Berdasarkan batas bawah Chavatal dan Harary tersebut dikonstruksi graf kritis untuk dan yang ordenya lebih besar dari nilai batas bawah yang diberikan Chavatal dan Harary. Orde dari graf kritis tersebut merupakan batas bawah terbaik untuk . Kata kunci: Bilangan Ramsey, bintang, roda AbstractRamsey Numbers for a graph to a graph , denoted by is the smallest integer n such that for every graph of order either the following meeet: contains a graph or the complement of contains the graph . This aims of the study to determine the maximum critical graph and . Based on the lower bound of the specified minimum upper bound in order to obtain numerical values for the Ramsey graph Star versus , or . Thus the determination of Ramsey numbers . is done by determine the lower boundary and upper bound. The lower bound given by Chavatal and Harary, for ramsey number for star graph versus wheel is , is a point graph of chromatic number wheel and is the cardinality of the largest component of the graph . Based on the lower bound Chavatal and Harary graph is constructed critical to and are poin greater than the lower bound value given Chavatal and Harary. Order of the critical graph is the best lower bound for . Keywords : Ramsey number, Stars, and Wheels

Complex Evaluation of Safety Culture Determinants in Manufacturing Companies in Slovakia

The paper addresses complex evaluation of safety culture in Slovak manufacturing enterprises by utilizing specific determinants. To accommodate conditions of enterprises in Slovakia, a specific research method was developed for the study of safety culture, which can also be used for manufacturing and non-manufacturing enterprises. We have selected the questionnaire method. Due to the scope of the research, we have defined ten determinants, which form the basis for evaluation of safety culture elements. When determining the level of the specific ten determinants of safety culture, we studied interdependence between the enterprise’s industry, its size (small, medium, large) and points assigned to each determinant. The results of the study are evaluated using a 3D point graph. The discussion shows parts that were evaluated the highest or lowest and outlines suggested approaches to improve the current state.

Sharp Bounds for the General Sum-Connectivity Indices of Transformation Graphs

Given a graph G, the general sum-connectivity index is defined as χα(G)=∑uv∈E(G)dGu+dGvα, where dG(u) (or dG(v)) denotes the degree of vertex u (or v) in the graph G and α is a real number. In this paper, we obtain the sharp bounds for general sum-connectivity indices of several graph transformations, including the semitotal-point graph, semitotal-line graph, total graph, and eight distinct transformation graphs Guvw, where u,v,w∈+,-.

AUTOMATIC DATA CLASSIFICATION BASED ON THE TRIANGULAR GRAPH FOR THEMATIC MAPS

A triangular point graph helps in the process of data classification for a thematic map. A triangular graph can be used for a situation that is described by three variables. The total sum of variables is 100%. The proportion of three variables is plotted in an equilateral triangular graph where each side represents a coordinate for one variable. A triangular graph displays the proportions of the three variables. The position of the point indicates the type (class) of the situation in the triangular graph. The typology of the situation can be subsequently expressed in the map. We have created a “Triangular Graph” program which represents a helpful automatic tool for ArcGIS software. This new program classifies input data based on a triangular graph. It is realized by two python scripts located in a custom toolbox as two programs. The first program calculates X and Y coordinates in an equilateral triangular graph. The second program compares plotted points and suggested zones of a division produced by the first program. Finally, a new attribute is added to the source data. The user can create a new thematic map, based on that attribute in order to express the typology of the given situation. The programming language Python and essential module ArcPy have been used for solving these tasks. To test the created programs several maps were made, based on the classification often used in demography. For example, the new program helped to create a sample map of age categories in districts of the Czech Republic. The program is available to download from the Esri web pages and web pages of the Department of Geoinformatics, Palacký University Olomouc.