Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.

Abstract This paper builds a patent-based knowledge graph, patent-KG, to represent the facts in patents for engineering design. The arising patent-KG approach proposes new unsupervised mechanism extract patent, by searching attention graph language models. extracted entities are compared with other benchmarks criteria of recall rate. result reaches highest 0.8 rate standard list mechanical rela...

Background: In recent years, there has been an increase in the amount and variety of data generated in the field of healthcare, (e.g., data related to the prevalence of contagious diseases in the society). Various patterns of individuals’ relationships in the society make the analysis of the network a complex, highly important process in detecting and preventing the incidence of diseases....

The stability graph method for open stope design is one of the most widely used approaches predicting stopes in underground metalliferous mines. primary purpose this work to propose a new chart, which includes all relevant case histories, and exclude parameters with uncertainties determining number. modified number was achieve goal, Extended Mathews database recalculated compared graph. In stud...