Journal articles: 'Vertexer'

1

Li, Peilin. "Analysis of Combination of Four, Five Six Crease Vertices Waterbomb." Highlights in Science, Engineering and Technology 18 (November 13, 2022): 59–66. http://dx.doi.org/10.54097/hset.v18i.2569.

Full text

Abstract:

Origami combination is reliable because of great stabilization and controllable deployable. Potential and extensive applied in medical field, as a soft robot gripper. To investigate a possible stabilization structure, this design contained a combination of three four-crease vertexes, one five-crease vertex and one six-crease vertex. The design theory is based on waterbomb pattern design and obey the two design principles. The degree of freedom in this combination would be proof is zero, which demonstrates an over-constrained structure, and also the poor control performance and reliability. The reason might be the compelling in five-crease vertex and multiple Dof in the four-crease vertexes (which might be one Dof), which cause the overall outputs dihedral angles could not be controlled by overall inputs. Additionally, this design has faster equilibrium state because of smaller dihedral angle (smaller than 90 degrees) in each vertex, as an overstrained structure. The future improvement might be done by reduce the Dof in the four-crease vertex and promotion in five-crease vertex.

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, De Sheng, and Ai Ping Zhou. "Practical Optimization Algorithm for Discrete Variables." Applied Mechanics and Materials 42 (November 2010): 39–42. http://dx.doi.org/10.4028/www.scientific.net/amm.42.39.

Full text

Abstract:

In order to solve the optimization problems of discrete variable in mechanism design, beginning vertexes to meet all of performance restriction conditions can be given by the technician from upper boundary of design variables by means of man-machine interactive method. Objective function of each beginning vertex is calculated and arranged from small to large, the vertex of maximum and minimum of objective function are found. The difference between the vertex of minimum and maximum of objective function are calculated and new point is made up from the minimum point and the difference. The new point is used in stead of the vertex of the maximum objective function if the objective function of the new point is less than the maximum of beginning vertexes. The new composite figure is made up again and the new point is calculated until all design variables reach to under boundary. Then the vertex of minimum objective function is regarded to as the optimization point. This method is very fit for the optimization of discrete variables of low dimension and is higher calculation efficiency because the hominine brightness is combined with the high speed calculation ability.

APA, Harvard, Vancouver, ISO, and other styles

3

Li, Kai, and Hong Tao Gao. "A Subgraph-Based Selective Classifier Ensemble Algorithm." Advanced Materials Research 219-220 (March 2011): 261–64. http://dx.doi.org/10.4028/www.scientific.net/amr.219-220.261.

Full text

Abstract:

To improve the generalization performance for ensemble learning, a subgraph based selective classifier ensemble algorithm is presented. Firstly, a set of classifiers are generated by bootstrap sampling technique and support vector machine learning algorithm. And a complete undirected graph is constructed whose vertex is classifier and weight of edge between a pair of classifiers is diversity values. Secondly, by searching technique to find an edge with minimum weight and to calculate similarity values about two vertexes which is related to the edge, vertex with smaller similarity value is removed. According to this method, a subgraph is obtained. Finally, we choose vertexes of subgraph, i.e. classifiers, as ensemble members. Experiments show that presented method outperforms the traditional ensemble learning methods in classification accuracy.

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Peng, Chenxiao Wu, Teng Huang, and Yizhang Chen. "A Supervised Link Prediction Method Using Optimized Vertex Collocation Profile." Entropy 24, no. 10 (October 14, 2022): 1465. http://dx.doi.org/10.3390/e24101465.

Full text

Abstract:

Classical link prediction methods mainly utilize vertex information and topological structure to predict missing links in networks. However, accessing vertex information in real-world networks, such as social networks, is still challenging. Moreover, link prediction methods based on topological structure are usually heuristic, and mainly consider common neighbors, vertex degrees and paths, which cannot fully represent the topology context. In recent years, network embedding models have shown efficiency for link prediction, but they lack interpretability. To address these issues, this paper proposes a novel link prediction method based on an optimized vertex collocation profile (OVCP). First, the 7-subgraph topology was proposed to represent the topology context of vertexes. Second, any 7-subgraph can be converted into a unique address by OVCP, and then we obtained the interpretable feature vectors of vertexes. Third, the classification model with OVCP features was used to predict links, and the overlapping community detection algorithm was employed to divide a network into multiple small communities, which can greatly reduce the complexity of our method. Experimental results demonstrate that the proposed method can achieve a promising performance compared with traditional link prediction methods, and has better interpretability than network-embedding-based methods.

APA, Harvard, Vancouver, ISO, and other styles

5

Liu, Fu Yan, and Chong Yuan Fan. "An Algorithm for Mesh Simplification Based on Energy-Aware." Applied Mechanics and Materials 543-547 (March 2014): 1757–63. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.1757.

Full text

Abstract:

Mesh simplification should not only emphasize high compression ratio, but also maximize retention of a mesh representation which is another objective of mesh compression. In one of our 3D projects, in order to pursue the optimization model display, we proposed a new mesh simplification algorithm. This article describes the algorithm based on energy-aware which used to simplify a mesh of 3D model. Our approach has two major contributions. Firstly, we used an optimization method based on energy-aware, which seeks to collect low energy value vertexes of a mesh. Vertex energy is calculated by an energy function that describes the potential energy between the vertex and its directly related vertexes in a space. Secondly, our optimization method transforms a mesh into a series of triangle stripes, and reduces low energy vertexes of those stripes effectively. The process of compression is simple, efficient and adjustable for users. From the result of experiments, we can learn that our algorithm is suitable for processing several kinds of grid, and retains the characterization from original mesh very well. Our approach solved the problem of obvious distortions of a simplified mesh of 3D model, and significantly improved the efficiency of simplification process.

APA, Harvard, Vancouver, ISO, and other styles

6

BEVERIDGE, ANDREW. "A Hitting Time Formula for the Discrete Green's Function." Combinatorics, Probability and Computing 25, no. 3 (June 29, 2015): 362–79. http://dx.doi.org/10.1017/s0963548315000152.

Full text

Abstract:

The discrete Green's function (without boundary)$\mathbb{G}$is a pseudo-inverse of the combinatorial Laplace operator of a graphG= (V, E). We reveal the intimate connection between Green's function and the theory of exact stopping rules for random walks on graphs. We give an elementary formula for Green's function in terms of state-to-state hitting times of the underlying graph. Namely,$\mathbb{G}(i,j) = \pi_j \bigl( H(\pi,j) - H(i,j) \bigr),$where πiis the stationary distribution at vertexi,H(i, j) is the expected hitting time for a random walk starting from vertexito first reach vertexj, andH(π,j) = ∑k∈VπkH(k, j). This formula also holds for the digraph Laplace operator.The most important characteristics of a stopping rule are its exit frequencies, which are the expected number of exits of a given vertex before the rule halts the walk. We show that Green's function is, in fact, a matrix of exit frequencies plus a rank one matrix. In the undirected case, we derive spectral formulas for Green's function and for some mixing measures arising from stopping rules. Finally, we further explore the exit frequency matrix point of view, and discuss a natural generalization of Green's function for any distribution τ defined on the vertex set of the graph.

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Hua Bing, Wei Jun Liu, and Hong You Bian. "A Connecting Method for Offset Contour of Planar Polygon." Applied Mechanics and Materials 215-216 (November 2012): 1232–35. http://dx.doi.org/10.4028/www.scientific.net/amm.215-216.1232.

Full text

Abstract:

Triangular mesh is a digital representation mode widely used in CAD and CAM. And the connection of the offset vertexes is an important step in the edge isometry based polygon offset operation in path planning of layer milling complicated surfaces represented by triangular mesh. A vertex classification based connectiong method was presented. It avoids the vertex reflection, shortens the length of the contour and improves the performance of edge isometry based offset algorithm.

APA, Harvard, Vancouver, ISO, and other styles

8

Hao, Long. "A Novel Algorithm Based on the Degree Tree for Graph Isomorphism." Advanced Materials Research 225-226 (April 2011): 417–21. http://dx.doi.org/10.4028/www.scientific.net/amr.225-226.417.

Full text

Abstract:

The graph isomorphism problem is to study the relationship between two graphs which seem to be different, but essentially identically. A novel algorithm based on the degree tree is proposed, where each node of the tree describes a given vertex and its neighboring information of a graph. Two vertexes in different graphs are regarded as mapping if the corresponding nodes and all their junior nodes are similar. Hence by comparing their degree trees, two graphs can be determined whether matching or not, and the mapping vertexes can be found. Experimental results show the approach’s performance.

APA, Harvard, Vancouver, ISO, and other styles

9

Yu, Ling Tao, Tao Wang, Hua Jian Song, Zhen Gyu Wang, and Bao Yu Zhang. "A Method of Reconstructing a Virtual Gallbladder Geometric Model Based on OpenGL." Applied Mechanics and Materials 380-384 (August 2013): 2419–22. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.2419.

Full text

Abstract:

The paper puts forward a method of reconstructing a vivid virtual gallbladder geometric modeling. We use Visual C++ to write import program, save the geometry information of gallbladder contour which is related to reconstruction, and discarded something irrelevant such as materials, textures and so on. In the process of reconstruction, it need to import the data of gallbladder contour vertexes and facets, but not to read the entire 3DS file again, which will undoubtedly save more time and benefit more to real-time interactive. Then we change the independent facets into an interrelated whole through indexing and finding out storage location of triangular facets vertexes in vertex array. So that we can change the position and the shape of the gallbladder by changing the coordinate values of vertexes.

APA, Harvard, Vancouver, ISO, and other styles

10

Ivanko, Evgeny. "On One Approach to TSP Structural Stability." Advances in Operations Research 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/397025.

Full text

Abstract:

In this paper we study an inverse approach to the traveling salesman reoptimization problem. Namely, we consider the case of the addition of a new vertex to the initial TSP data and fix the simple “adaptation” algorithm: the new vertex is inserted into an edge of the optimal tour. In the paper we consider the conditions describing the vertexes that can be inserted by this algorithm without loss of optimality, study the properties of stability areas, and address several model applications.

APA, Harvard, Vancouver, ISO, and other styles

11

Larsen, Dag, and Anastasia Merzlaya. "Open Charm measurements at the NA61 experiment at CERN SPS." EPJ Web of Conferences 191 (2018): 05003. http://dx.doi.org/10.1051/epjconf/201819105003.

Full text

Abstract:

The strong interactions programme of the NA61/SHINE experiment at CERN SPS has been extended through the use of new silicon Vertex Detector which provides precise measurements of exotic particles with short lifetime. The detector was designed to meet the challenges of primary and secondary vertexes reconstruction at high spatial resolution. An initial version of the Vertex Detector called SAVD (Small Acceptance Vertex Detector) was installed last end of 2016, and data was from Pb+Pb collisions was collected in 2016, for Xe+La in 2017, as well as further Pb+Pb collisions this year. First indication of a D0 peak at SPS energies has been observed. The physics motivation behind the open charm measurements will be discussed, as well as the analysis of collected data on open charm production and the future plans of open charm measurements in NA61/SHINE experiment related to the upgraded version of the vertex detector.

APA, Harvard, Vancouver, ISO, and other styles

12

Zhu, Hu, Nan Li, and Zhi Jun Liu. "The Method for the Accuracy Improvement of STL Offset Model Based on Vertex Offset." Advanced Materials Research 308-310 (August 2011): 1600–1603. http://dx.doi.org/10.4028/www.scientific.net/amr.308-310.1600.

Full text

Abstract:

On the basis of the analysis for the reason that causes the errors of the vertex offset, the accuracy improvement method for the STL offset model which was generated by the vertex offset algorithm was proposed by using the surface subdivision algorithm based on the center of gravity on triangular facets. The offset point of the center of gravity was generated by offset the center of gravity along the normal vectors of the triangular facets on which the center of gravity is located, and the new triangular facets are formed by connecting the offset points of the center of gravity and the offset vertexes of the triangular facets so that the more accurate offset model to be built. The case study shows that the proposed algorithm has higher accuracy than the existing vertex offset algorithm.

APA, Harvard, Vancouver, ISO, and other styles

13

He, Yi Yue, Guo Hua Geng, Ming Quan Zhou, Jie Qiong He, Jia Jia, Kang Li, Hong Qiang Du, and Xiao Wei He. "Hierarchical Correspondence of 3D Faces Based on Thin Plate Spline Deformation (HCTD)." Advanced Materials Research 479-481 (February 2012): 2235–41. http://dx.doi.org/10.4028/www.scientific.net/amr.479-481.2235.

Full text

Abstract:

Aiming at establishing physiological consistent point correspondence between 3D faces, this paper proposes a new hierarchical correspondence method based on thin plate spline deformation called HCTD by introducing local geometric constraints. Firstly, mark feature points in unified Frankfurt Coordinate and the sample face deform based on thin plate spline function according to strict correspondences of feature points, so the sample face approximately coincide with the template; Secondly, build voxel models respectively and select vertexes with salient feature from the template as the current under-corresponding vertex, and the candidate set of the corresponding vertex on sample face is determined by local relative position geometric constraint and Euclidean Distance constraint. Finally, the optimal corresponding vertex is selected according to the weighted distance of local geometric features. Experimental results prove that HCTD can establish point correspondence of faces with higher precision than existing methods.

APA, Harvard, Vancouver, ISO, and other styles

14

Olifer, Dmitrij, Nikolaj Goranin, Antanas Cenys, Arnas Kaceniauskas, and Justinas Janulevicius. "Defining the Minimum Security Baseline in a Multiple Security Standards Environment by Graph Theory Techniques." Applied Sciences 9, no. 4 (February 17, 2019): 681. http://dx.doi.org/10.3390/app9040681.

Full text

Abstract:

One of the best ways to protect an organization’s assets is to implement security requirements defined by different standards or best practices. However, such an approach is complicated and requires specific skills and knowledge. In case an organization applies multiple security standards, several problems can arise related to overlapping or conflicting security requirements, increased expenses on security requirement implementation, and convenience of security requirement monitoring. To solve these issues, we propose using graph theory techniques. Graphs allow the presentation of security requirements of a standard as graph vertexes and edges between vertexes, and would show the relations between different requirements. A vertex cover algorithm is proposed for minimum security requirement identification, while graph isomorphism is proposed for comparing existing organization controls against a set of minimum requirements identified in the previous step.

APA, Harvard, Vancouver, ISO, and other styles

15

Mikhailov, Alexander, Anatoly Baykov, and Ilya Navka. "Nature of the Elastic Grinding Tools Working Surface in the Contact Area with the Workpiece." Applied Mechanics and Materials 809-810 (November 2015): 81–86. http://dx.doi.org/10.4028/www.scientific.net/amm.809-810.81.

Full text

Abstract:

Formation of the ground surface is the result of the interaction of the cutting elements of the diamond tool with the material being processed, so the nature of the working surface geometry of the grinding wheel (WSW) has principal value on processed surface quality. One of the main parameters that characterize the geometry of the WSW is the law of the grain distribution vertex in height. However, statistical models do not reflect the real picture of the tool interaction with the material being processed in the modelling process of grinding tool on the elastic ligament used for final operations. In the process of contact with the material being processed each diamond grain is moved with an adjacent block ligament, changing the position of the cutting vertex relative to both the midrange cords level and the other grains vertexes. As a result the nature of the grain vertexes distribution changes and the conditions of interaction with the material being processed change too. Studies have shown that the density distribution in height of diamond grains elastic grinding tool vertexes in a static state can be described by different distribution laws. For practical use in the calculation of the processed surface roughness and processing capacity is sufficient to approximate the distribution in height only the most protruding grains. In the area of contact with the processed material the distribution density of the grains elastic tool in height significantly differs from the static characteristics and is defined by the elasticity degree of the grinding tool ligament and machinability index of the workpiece material. The obtained results can serve as initial data for the calculation of the processed surface roughness.

APA, Harvard, Vancouver, ISO, and other styles

16

Ji, Shi Jun. "Research on Compression Methods for ASCII STL File." Advanced Materials Research 108-111 (May 2010): 1254–58. http://dx.doi.org/10.4028/www.scientific.net/amr.108-111.1254.

Full text

Abstract:

Two new types of ASCII format STL file are presented under lossless data compression and lossy implicit data compression respectively. In these new format file, a vertex with three coordinates which has degree n is stored only once rather than n times and three vertexes of a facet are saved by their indexes instead of by their three coordinates (x, y, z). As a result, the storage space of the vertex reduces to about 1/3 of its original space. It is very convenience for the file transmitting of network manufacturing. Moreover, the reading, writing and pretreatment time of data file are shortened greatly because of the decreasing of the file length.

APA, Harvard, Vancouver, ISO, and other styles

17

Zeng, Li Li. "A Method of Numbered STL File Format for Recording Data." Applied Mechanics and Materials 462-463 (November 2013): 1102–5. http://dx.doi.org/10.4028/www.scientific.net/amm.462-463.1102.

Full text

Abstract:

The paper has proposed an improved method of recording data in STL file format against disadvantages, such as high repetition of recording triangular meshes data and complex computation of vertex coordinate. Vertexes and normal vectors of triangular meshes are renumbered, and meshes data expressed by coordinate is changed into data stored by number. It facilitates the recording of triangular meshes data of depth images and provides a more simple way for establishing data storage model.

APA, Harvard, Vancouver, ISO, and other styles

18

Gao, Ya, and Xia Gao. "An Optical Distribution Network Partitioning Method Based on the Branch-and-Bound." Applied Mechanics and Materials 427-429 (September 2013): 2399–402. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2399.

Full text

Abstract:

Optical Distribution Network is a kind of optical transmission path connecting Optical Line Terminal and Optical Network Unit. This article mainly studies how to optimize broadband loan problems of the backbone network. In order to get the best allocation scheme of the Optical Distribution Network problems, we propose a solution which is converting the Optical Distribution Network partitioning problem into a graph partitioning model, and solve the problem by adopting Graph partitioning algorithms. Graph partitioning is about the undirected graph , is the collection of all vertexes. is the collection of all sides. Any vertex in the vertex set has weight value of a positive integer. Any side in a side set has weight value of a positive integer. The vertex set is divided into non-intersecting subsets , and .As to every subset , it has ,,.What we need to solve is to get the minimum sum of weight values between m non-intersecting subsets. The experimental results show that Graph partitioning algorithm is efficient.

APA, Harvard, Vancouver, ISO, and other styles

19

Nozawa, Akio, and Hideto Ide. "Study of Individual Feature Extraction from Range Data of Human Nose." Journal of Robotics and Mechatronics 15, no. 4 (August 20, 2003): 451–57. http://dx.doi.org/10.20965/jrm.2003.p0451.

Full text

Abstract:

We extracted individual and gender features from range data on the human nose measured by a three-dimensional digitizer. We propose extracting individual and gender features from range data measured for the nose based on a solid model, which gives feature vectors for volume, length between vertexes, and angles around vertex. We determined elements of feature vectors by statistical analysis and authentication tests. We achieved an 83.67% individual identification rate and a 98.01% gender identification rate, verifying the effectiveness of our proposed method.

APA, Harvard, Vancouver, ISO, and other styles

20

Ren, Xiangmin, and Dexun Jiang. "A Personalized α , β , l , k -Anonymity Model of Social Network for Protecting Privacy." Wireless Communications and Mobile Computing 2022 (April 20, 2022): 1–11. http://dx.doi.org/10.1155/2022/7187528.

Full text

Abstract:

By mining the data published on social network, we can discover the hidden value of information including the privacy of individuals and organizations. Protecting privacy of individuals and organizations on social network has become the focus of more and more researchers. Based on the actual privacy protection need of edge sensitive attribute and vertexes sensitive attribute, we propose a new personalized α , β , l , k -anonymity technology of privacy preserving to reduce distortion extent of the data in the privacy processing of data of social network. Experimental results of personalized α , β , l , k -anonymity algorithm show that d -neighborhood attack of graph, background knowledge attack, and homogeneity attack can be prevented effectively by using anonymous vertexes and edges, as well as the influence matrix based on background knowledge. The diversity of vertex sensitive attribute can be achieved. Personalized protecting privacy requirements can be met by using such parameter as α , β , l , k .

APA, Harvard, Vancouver, ISO, and other styles

21

Yu, Xin, Gao Cai Wang, and Yan Yu. "Internally Vertex-Disjoint Paths in Crossed Cube-Connected Ring Networks." Applied Mechanics and Materials 321-324 (June 2013): 2715–20. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.2715.

Full text

Abstract:

Crossed cube is a variation of hypercube, but some properties of the former are superior to those of the latter. However, it is difficult to extend the scale of crossed cube networks. As a kind of hierarchical ring interconnection networks, crossed cube-connected ring interconnection network CRN can effectively overcome the disadvantage. Hence, it is a good topology for interconnection networks. In this paper, we prove that there exist n internally vertex-disjoint paths between any two vertexes in CRN, and analyze the lengths of the paths.

APA, Harvard, Vancouver, ISO, and other styles

22

Rhouma, Aymen, Sami Hafsi, and Kaouther Laabidi. "Stabilizing and Robust Fractional PID Controller Synthesis for Uncertain First-Order plus Time-Delay Systems." Mathematical Problems in Engineering 2021 (May 24, 2021): 1–10. http://dx.doi.org/10.1155/2021/9940634.

Full text

Abstract:

In this paper, by using the noninteger P I λ D μ controllers, we conduct an investigation into the subject of robust stability area of time-delay interval process. Our method is based on setting up of the noninteger interval closed-loop characteristic equation using the inferior and superior bounds of uncertain parameters into several vertexes. We have combined the composition of the value set of vertex with the zero exclusion principle to analyse the stability of the uncertain process. A generalized version of the Hermite–Biehler theorem, applicable to fractional quasipolynomials, is exploited to determine the stability region of each vertex. The robust stability region of the noninteger regulator can be given by the crossing of the stability area of all the vertex characteristic noninteger quasipolynomials. By using the value set method and zero exclusion theory, the effectiveness of the stability region can be tested. Also, we propose a suitable procedure to determine the whole of stabilizing parameters for an interval process. An explicative example is given to point out the advantage and reliability of the approach.

APA, Harvard, Vancouver, ISO, and other styles

23

You, Lihua, Jieshan Yang, Yingxue Zhu, and Zhifu You. "The Maximal Total Irregularity of Bicyclic Graphs." Journal of Applied Mathematics 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/785084.

Full text

Abstract:

In 2012, Abdo and Dimitrov defined the total irregularity of a graphG=(V,E)asirrtG=1/2∑u,v∈VdGu-dGv, wheredGudenotes the vertex degree of a vertexu∈V. In this paper, we investigate the total irregularity of bicyclic graphs and characterize the graph with the maximal total irregularity among all bicyclic graphs onnvertices.

APA, Harvard, Vancouver, ISO, and other styles

24

Cicotti, Pietro, Manu Shantharam, and Laura Carrington. "Reducing communication in parallel graph search algorithms with software caches." International Journal of High Performance Computing Applications 33, no. 2 (April 15, 2018): 384–96. http://dx.doi.org/10.1177/1094342018762510.

Full text

Abstract:

In many scientific and computational domains, graphs are used to represent and analyze data. Such graphs often exhibit the characteristics of small-world networks: few high-degree vertexes connect many low-degree vertexes. Despite the randomness in a graph search, it is possible to capitalize on the characteristics of small-world networks and cache relevant information of high-degree vertexes. We applied this idea by caching remote vertex ids in a parallel breadth-first search benchmark. Our experiment with different implementations demonstrated significant performance improvements over the reference implementation in several configurations, using 64 to 1024 cores. We proposed a system design in which resources are dedicated exclusively to caching and shared among a set of nodes. Our evaluation demonstrates that this design reduces communication and has the potential to improve performance on large-scale systems in which the communication cost increases significantly with the distance between nodes. We also tested a memcached system as the cache server finding that its generic protocol, which does not match our usage semantics, hinders significantly the potential performance improvements and suggested that a generic system should also support a basic and lightweight communication protocol to meet the needs of high-performance computing applications. Finally, we explored different configurations to find efficient ways to utilize the resources allocated to solve a given problem size; to this extent, we found utilizing half of the compute cores per allocated node improves performance, and even in this case, caching variants always outperform the reference implementation.

APA, Harvard, Vancouver, ISO, and other styles

25

Raman, Indhumathi. "On Counting and Embedding a Subclass of Height-Balanced Trees." Modelling and Simulation in Engineering 2014 (2014): 1–5. http://dx.doi.org/10.1155/2014/748941.

Full text

Abstract:

A height-balanced tree is a rooted binary tree in which, for every vertexv, the difference in the heights of the subtrees rooted at the left and right child ofv(called the balance factor ofv) is at most one. In this paper, we consider height-balanced trees in which the balance factor of every vertex beyond a level is0. We prove that there are22t-1such trees and embed them into ageneralized join of hypercubes.

APA, Harvard, Vancouver, ISO, and other styles

26

Wen, Hao, Jian Gao, and Xin Chen. "Polygonal model based cutter location data generation with offset error compensation." Rapid Prototyping Journal 22, no. 3 (April 18, 2016): 559–68. http://dx.doi.org/10.1108/rpj-01-2015-0001.

Full text

Abstract:

Purpose As manufacturing technology has developed, digital models from advanced measuring devices have been widely used in manufacturing sectors. To speed up the production cycle and reduce extra errors introduced in surface reconstruction processes, directly machining digital models in the polygonal stereolithographyformat has been considered as an effective approach in rapid digital manufacturing. In machining processes, Cutter Location (CL) data for numerical control (NC) machining is generated usually from an offset model. This model is created by offsetting each vertex of the original model along its vertex vector. However, this method has the drawback of overcut to the offset model. The purpose of this paper is to solve the overcut problem through an error compensation algorithm to the vertex offset model. Design/methodology/approach Based on the analysis of the vertex offset method and the offset model generated, the authors developed and implemented an error compensation method to correct the offset models and generated the accurate CL data for the subsequent machining process. This error compensation method is verified through three polygonal models and the tool paths generated were used for a real part machining. Findings Based on the analysis of the vertex offset method and the offset model generated, the authors developed an error compensation method to correct the offset models and generated the accurate CL data for the subsequent machining process. The developed error compensation algorithm can effectively solve the overcut drawback of the vertex offset method. Research limitations/implications The error compensation method to the vertex offset model is used for generating the CL data with the using of a ball-end cutter. Practical implications On the study of CL data generation for a STL model, most of the current studies are focused on the determination of the offset vectors of the vertexes. The offset distance is usually fixed to the radius of the cutter used. Thus, the overcut problem to the offset model is inevitable and has not been much studied. The authors propose an effective approach to compensate the insufficient distance of the offset vertex and solve the overcut problem. Social implications The directly tool paths generation from a STL model can reduce the error of surface reconstruction and speed up the machining progress. Originality/value The authors investigate the overcut problem occurred in vertex offset for CL data generation and present a new error compensation algorithm for generating the CL data that can effectively solve the overcut problem.

APA, Harvard, Vancouver, ISO, and other styles

27

Štíbr, Bohumil. "Acyl chloride carbon insertion into dicarbaborane cages – new route to tricarbollide cages." Pure and Applied Chemistry 87, no. 2 (February 1, 2015): 135–42. http://dx.doi.org/10.1515/pac-2014-0937.

Full text

Abstract:

AbstractReactions between the arachno-6,9-C2B8H14 dicarbaborane and acyl chlorides, RCOCl, in the presence of amine bases in CH2Cl2, followed by acidification with conc. H2SO4 at 0 °C, generate in high yields a series of neutral alkyl and aryl tricarbollides of structure 8-R-nido-7,8,9-C3B8H11 (where R=alkyls and aryls). These skeletal alkylcarbonation (SAC) reactions are consistent with an aldol-type condensation between the RCO group and open-face dicarbaborane hydrogen atoms, which is associated with the insertion of the acyl chloride RC unit into the structure under elimination of three extra hydrogen atoms as H2O and HCl. The reactions thus result in an effective cross-coupling between R and the tricarbollide cage. High-temperature reactions between 8-Ar-nido-7,8,9-C3B8H11 (where Ar=Ph, 1-C10H7, and 2-C10H7) compounds and [CpFe(CO)2]2 produced the first types of monoaryl substituted twelve-vertex ferratricarbollide complexes of general constitution [1-(CpFe)-closo-ArC3B8H10] with three different arrangements of cluster carbon vertexes. The Fe-complexation is accompanied by extensive rearrangement of the cluster carbon atoms over the twelve-vertex cage and the complexes isolated can be regarded as ferrocene analogues.

APA, Harvard, Vancouver, ISO, and other styles

28

Zikra, Fakhri, DES WELYYANTI, and LYRA YULIANTI. "The Locating-chromatic Number of Disjoint Union of Fan Graphs." Jurnal Matematika UNAND 11, no. 3 (July 30, 2022): 159. http://dx.doi.org/10.25077/jmua.11.3.159-170.2022.

Full text

Abstract:

Let G = (V,E) is a connected graph and c is a k-coloring of G. The color class of G is the set of colored vertexs i, denoted by Ci for 1 <= i <= k. Let phi is a ordered partition from V (G) to independent color classes that is C1;C2; ...;Ck, with vertexs of Ci given color by i, 1 <= i <= k. Distance of a vertex v in V to Ci denoted by d(v,Ci) is min {d(v, x)|x in Ci}. The color codes of a vertex v in V is the ordered k-vector c(Phi|v) = (d(v,C1), d(v,C2), ..., d(v,Ck)) where d(v,Ci) = min {d(v, x | x in Ci)} for 1 <= i <= k. If distinct vertices have distinct color codes, then c is called a locating-coloring of G. The locating-chromatic numberXL(G) is the minimum number of colors in a locating-coloring of G. Let H is a disconnected graph and c is a k-coloring of H then induced partition of Phi from V(H). The coloring c is locating k-coloring of H if all vertices of H have distinct color codes. The locating-chromatic number of H, denoted by XL'(H), is the smallest k such that H admits a locating-coloring with k colors. In this paper, we study the locating-chromatic number of disjoint union of fan graphs.

APA, Harvard, Vancouver, ISO, and other styles

29

Zhu, Yun. "Analysis and Simulation on SVD-Based 3D Mesh Digital Watermark Algorithm." Advanced Materials Research 846-847 (November 2013): 1052–55. http://dx.doi.org/10.4028/www.scientific.net/amr.846-847.1052.

Full text

Abstract:

The paper mainly discusses the digital watermark algorithm for 3D grid model. Traditional algorithm cannot coordinate the contradiction between invisibility and robustness of digital watermark. In order to improve the security, this paper proposes a 3D grid digital watermark algorithm based on singular value decomposition (SVD). Firstly, we set the matrix formed by distance from the vertexes to center of 3D mesh model as the vertex modulus matrix. Then the matrix is decomposed by SVD, and finally the watermark is embedded into the diagonal matrix to get the 3D mesh model containing watermark signal. The simulation results show that the algorithm effectively solves the problem of invisibility and robustness of watermark, and the watermark formed here can resist various attacks which enforce the protection of 3D mesh models Rights.

APA, Harvard, Vancouver, ISO, and other styles

30

Tao, Fangyun, Ting Jin, and Yiyou Tu. "On the Strong Equitable Vertex 2-Arboricity of Complete Bipartite Graphs." Mathematics 8, no. 10 (October 14, 2020): 1778. http://dx.doi.org/10.3390/math8101778.

Full text

Abstract:

An equitable partition of a graph G is a partition of the vertex set of G such that the sizes of any two parts differ by at most one. The strong equitable vertexk-arboricity of G, denoted by vak≡(G), is the smallest integer t such that G can be equitably partitioned into t′ induced forests for every t′≥t, where the maximum degree of each induced forest is at most k. In this paper, we provide a general upper bound for va2≡(Kn,n). Exact values are obtained in some special cases.

APA, Harvard, Vancouver, ISO, and other styles

31

Kanna, M. R. Rajesh, B. N. Dharmendra, G. Sridhara, and R. Pradeep Kumar. "Some results on the degree of a vertex of a graph with respect to any vertexset." International Journal of Contemporary Mathematical Sciences 8 (2013): 125–31. http://dx.doi.org/10.12988/ijcms.2013.13012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Zhou, Chao, and Yan Ping Liu. "Study on Parameter Transfer Structure of Generalized Modular Based Graph Theory." Advanced Materials Research 562-564 (August 2012): 1323–26. http://dx.doi.org/10.4028/www.scientific.net/amr.562-564.1323.

Full text

Abstract:

For the purpose of reducing product structure levels and shorting transfer chain of parameter, in this paper the product structure levels are expressed with generalized modular. The concept of directed graph of parameter connection structure for generalized modular is proposed with the use of directed graph theory, generalized modular, sub-modular and part represented by vertex, the driven relations of parameter connection represented by directed edge, and the properties of directed graph of parameter connection structure for generalized modular are gained. The directed graph of parameter connection structure for generalized modular is divided into a number of sub-graphs according to the relations of product-level modular structure. And the horizontal edges of sub-graphs among vertexes are decomposed. Therefore, a standardized relation of parameter connection structure is established by given the decomposition algorithm and the mathematical description of parameters connection that are provide the theoretical basis for parameters connection analysis of variant design.

APA, Harvard, Vancouver, ISO, and other styles

33

Muranov, Yuri V., and Anna Szczepkowska. "On Path Homology of Vertex Colored (Di)Graphs." Symmetry 12, no. 6 (June 5, 2020): 965. http://dx.doi.org/10.3390/sym12060965.

Full text

Abstract:

In this paper, we construct the colored-path homology theory in the category of vertex colored (di)graphs and describe its basic properties. Our construction is based on the path homology theory of digraphs that was introduced in the papers of Grigoryan, Muranov, and Shing-Tung Yau and stems from the notion of the path complex. Any graph naturally gives rise to a path complex in which for a given set of vertices, paths go along the edges of the graph. We define path complexes of vertex colored (di)graphs using the natural restrictions that are given by coloring. Thus, we obtain a new collection of colored-path homology theories. We introduce the notion of colored homotopy and prove functoriality as well as homotopy invariance of homology groups. For any colored digraph, we construct the spectral sequence of colored-path homology groups which gives the effective method of computations in the general case since any (di)graph can be equipped with various colorings. We provide a lot of examples to illustrate our results as well as methods of computations. We introduce the notion of homotopy and prove functoriality and homotopy invariance of introduced vertexed colored-path homology groups. For any colored digraph, we construct the spectral sequence of path homology groups which gives the effective method of computations in the constructed theory. We provide a lot of examples to illustrate obtained results as well as methods of computations.

APA, Harvard, Vancouver, ISO, and other styles

34

Xu, Jia Chuan, and Deng Feng Wang. "Vertexes Arraying in Class A Surfaces Smoothing for Auto-Body." Applied Mechanics and Materials 63-64 (June 2011): 86–89. http://dx.doi.org/10.4028/www.scientific.net/amm.63-64.86.

Full text

Abstract:

Vertexes arraying is the fundamental factor which influenced the qualities and efficiency in auto-body smoothing. Favorable vertexes arraying not only can make the surfaces satisfy styling but also improve quality and efficiency of surfaces smoothing. According to the expressing methods and matched condition of surfaces the vertexes arraying rules of auto-body surfaces are given. And the rules are validated by examples. The result verified that rational vertexes arraying can improve the quality and efficiency in auto-body surfaces smoothing.

APA, Harvard, Vancouver, ISO, and other styles

35

Chen, Meng-Cheng, Xue-Cheng Ping, Huttning Xie, and Zhanwei Liu. "P-34 Experilnent Studies on Singularities around V-Shaped Notch Vertexes in Piezoelectric Materials." Abstracts of ATEM : International Conference on Advanced Technology in Experimental Mechanics : Asian Conference on Experimental Mechanics 2007.6 (2007): _P—34–1_—_P—34–6_. http://dx.doi.org/10.1299/jsmeatem.2007.6._p-34-1_.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Leng, Ming, Ling-yu Sun, and Kai-qiang Guo. "Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem." Journal of Intelligent Systems 26, no. 3 (July 26, 2017): 407–20. http://dx.doi.org/10.1515/jisys-2015-0058.

Full text

Abstract:

AbstractThe formal description of weighted hypergraph partitioning problem is presented. We describe the solution of the weighted hypergraph partitioning problem based on the multi-level method. We propose the multi-level discrete particle swarm optimization refinement algorithm, whose each particle’s position in |V|-dimensional can be considered as the corresponded partitioning. During the refinement process of the uncoarsening phase, the algorithm projects successively each particle’s corresponded partitioning back to the next-level finer hypergraph, and the degree of particle’s freedom increases with the increase in solution space’s dimension. The algorithm also regards the gain of vertex as particle information for the heuristic search and successfully searches the solution space based on the intelligent behavior between individuals’ collaboration. Furthermore, the improved compressed storage format of weighted hypergraph is presented and the two-dimensional auxiliary array is designed for counting the vertices of each hypergraph in different partitions. The rapid method of calculating the vertex’s gain and the cut’s size are proposed to avoid traversing each vertex of hyperedge and reduce the algorithm’s time complexity and space complexity. Experimental results show that the algorithm not only can find the better partitioning of weighted hypergraph than the move-based method but also can improve the search capability of the refinement algorithm.

APA, Harvard, Vancouver, ISO, and other styles

37

Liu, Xu Min, Wei Xiang Xu, Jing Xu, and Yong Guan. "G¹/C¹ Matching of Spline Curves." Applied Mechanics and Materials 20-23 (January 2010): 202–8. http://dx.doi.org/10.4028/www.scientific.net/amm.20-23.202.

Full text

Abstract:

The research is mainly made on the G1/C1 matching condition of spline curves. On the basis of the analysis on the basic function of T-B spline curves and the features of curve endpoints, we proposed the n+1 order T-B spline basic function and the solving method. The G1/C1 matching condition of C-B spline curves and T-B spline curves is put forward in this paper. On this condition, when matching C-B spline curves and T-B spline curves, the controlling vertexes can be added to make C-B spline curve tangent with the first and last edge by the first and last vertex of controlling polygon. Application instances were put up in this paper which illustrated that the G1/C1 matching between T-B spline curve and C-B spline curve using the feature of T-B spline curve which can represents semiellipse arc (semicircle arc) precisely can solve the problem that C-B spline curve cannot represents semiellipse arc (semicircle arc) precisely.

APA, Harvard, Vancouver, ISO, and other styles

38

Prasad, K. C. Rajendra. "Vertex Semi Middle Domination in Graphs." Journal of Advanced Research in Dynamical and Control Systems 12, no. 8 (August 19, 2020): 83–89. http://dx.doi.org/10.5373/jardcs/v12i8/20202449.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Ikeda, Hisato, Tohru Masuoka, Yoshiharu Sawabe, Mitsutoshi Endo, Kuninori Iwamoto, and Yohji Nishijima. "Vertex Epidural Hematoma : A Report of Two Cases." Japanese Journal of Neurosurgery 10, no. 2 (2001): 116–19. http://dx.doi.org/10.7887/jcns.10.116.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Estaire, José,
Fernando Pardo de Santayana, and
Gracia Olivenza. "Stability analysis of a landfill lined with geosynthetics." Geotecnia 131 (July 2014): 5–27. http://dx.doi.org/10.24849/j.geot.2014.131.02.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Han, Keun-Hee, and Chan-Soo Kim. "Applying Genetic Algorithm to the Minimum Vertex Cover Problem." KIPS Transactions:PartB 15B, no. 6 (December 31, 2008): 609–12. http://dx.doi.org/10.3745/kipstb.2008.15-b.6.609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Kassenova, Т. К. "PARAMETRIZED EIGHT-VERTEX MODEL AND KNOT INVARIANT." Eurasian Physical Technical Journal 19, no. 1 (39) (March 28, 2022): 119–26. http://dx.doi.org/10.31489/2022no1/119-126.

Full text

Abstract:

The article discusses and expands the known elements of the eight-vertex model, paying special attention to the parameterization of the matrix. The matrix values are interconnected with the knot through the braids and this model is valid on finite square lattices in two-dimensional space. A new solution of the parametrized eight-vertex model of free fermions with a complex version of elliptic functions, which is valid on a finite lattice, will be constructed. The range of applicability of the eight-vertex model with elements of the Jacobi elliptic function and the construction of a knot invariant on its basis is discussed by comparing the results obtained analytically for the model. The construction of the knot invariant using the Clebsch-Gordan coefficients and the main tool of statistical mechanics of the Yang-Baxter equation will be studied in detail

APA, Harvard, Vancouver, ISO, and other styles

43

Bauer, D., A. Nevo, and E. Schmeichel. "Vertex Arboricity and Vertex Degrees." Graphs and Combinatorics 32, no. 5 (April 12, 2016): 1699–705. http://dx.doi.org/10.1007/s00373-016-1697-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

PETROV, DMYTRO, and ANDRYY BOICHUK. "CLUSTERIZATION METHOD BASED ON BREADTH FIRST SEARCH OR BFS FOR A GRAPH." Herald of Khmelnytskyi National University. Technical sciences 307, no. 2 (May 2, 2022): 87–91. http://dx.doi.org/10.31891/2307-5732-2022-307-2-87-91.

Full text

Abstract:

Clusterization is one of the types of algorithms of unsupervised learning. The idea behind it is that an algorithm learns patterns from untagged data. Such type of algorithm helps to find unseen dependencies in the untagged data itself. This paper presented algorithms based on Breadth-First Search or BFS for a Graph. The method was built based on the basic theory of clusterization. To the theory of clusterization, the calculated distance between the two farthest points in the cluster should be less than the distance between the closest two points from different clusters. By this rule, we defined that two parameters of the method should be the maximum distance between points by which these can be connected and assumed to be in one cluster. The second had to be the maximum distance in the cluster, aka the cluster’s diameter. A cluster’s diameter is the farthest distance between two points within a cluster. With these hyperparameters and the defined distance method, we can assume that every point is a vertex of a graph, two points within the threshold of the distance between pairs of ones are neighbours, and count the connection between counts as an edge of a graph. The group of connected vertexes or a particular vertex is a graph. The diameter hyperparameter ought to keep the data homogeneity in a cluster. We can define every graph as a cluster with defined rules based on previous assumptions. Later in this paper will be visualized the clusterization of three-dimensional data points. We took one of the most popular clusterization dataset – the iris dataset for visualizing purposes. The paper contains several examples of clusterization of the dataset with different hyperparameters. We took KMeans [3] as an example of the clusterization method. The method based on BFS is a flexible clusterization method that relies on meta-information about distancing between data points.

APA, Harvard, Vancouver, ISO, and other styles

45

Bastian, Dennis. "Containermangel verteuert Importe." VDI nachrichten 75, no. 14 (2021): 18. http://dx.doi.org/10.51202/0042-1758-2021-14-18-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Kühn, Iki. "Haltungsform verteuert Milch." Lebensmittel Zeitung 74, no. 11 (2022): 52. http://dx.doi.org/10.51202/0947-7527-2022-11-052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Lopes, J. W. B., J. C. De Araújo, and F. C. Conrado. "Caracterización de las presas de tierra empleadas para el control de la desertificación en la región de Gilbués, Noreste de Brasil." Cuadernos de la Sociedad Española de Ciencias Forestales 45, no. 1 (May 14, 2019): 1–10. http://dx.doi.org/10.31167/csecfv2i45.19508.

Full text

Abstract:

Se describe el estado y el papel de la construcción de represas para el control de los procesos de degradación en la región de Gilbués (Brasil). Esta región se caracteriza por intensos procesos de degradación del suelo y de la cobertura vegetal, de extensión considerable (3745 km²). Las investigaciones en la región se realizan en el área desde 2003, en un área experimental de 53 ha. La construcción de pequeñas presas de tierra fue una de las medidas aplicadas para controlar los procesos de degradación. Se construyeron más de 130 presas, con dimensiones variadas y bien distribuidas espacialmente en el área. En un número reducido de presas se verifica la eficiencia en la retención de los sedimentos y el establecimiento inicial de la vegetación. Los problemas de infiltración del agua por la base de la estructura favorecen su ruptura. Alrededor del 50% de las primeras estructuras construidas rompieron por tubificación y la inexistencia de vertedero, ocasionándose el vertido del agua por la cresta de la presa. La construcción de vertederos de tierra con material local fue eficaz durante un año hidrológico, produciéndose el avance de la erosión sobre la cresta del vertedor ya observado ese mismo año.

APA, Harvard, Vancouver, ISO, and other styles

48

Yan, Shiyao, Zequn Zhang, Xian Sun, Guangluan Xu, Shuchao Li, Qing Liu, Nayu Liu, and Shensi Wang. "PolygonE: Modeling N-ary Relational Data as Gyro-Polygons in Hyperbolic Space." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 4 (June 28, 2022): 4308–17. http://dx.doi.org/10.1609/aaai.v36i4.20351.

Full text

Abstract:

N-ary relational knowledge base (KBs) embedding aims to map binary and beyond-binary facts into low-dimensional vector space simultaneously. Existing approaches typically decompose n-ary relational facts into subtuples (entity pairs, triples or quintuples, etc.), and they generally model n-ary relational KBs in Euclidean space. However, n-ary relational facts are semantically and structurally intact, decomposition leads to the loss of global information and undermines the semantical and structural integrity. Moreover, compared to the binary relational KBs, n-ary ones are characterized by more abundant and complicated hierarchy structures, which could not be well expressed in Euclidean space. To address the issues, we propose a gyro-polygon embedding approach to realize n-ary fact integrity keeping and hierarchy capturing, termed as PolygonE. Specifically, n-ary relational facts are modeled as gyro-polygons in the hyperbolic space, where we denote entities in facts as vertexes of gyro-polygons and relations as entity translocation operations. Importantly, we design a fact plausibility measuring strategy based on the vertex-gyrocentroid geodesic to optimize the relation-adjusted gyro-polygon. Extensive experiments demonstrate that PolygonE shows SOTA performance on all benchmark datasets, generalizability to binary data, and applicability to arbitrary arity fact. Finally, we also visualize the embedding to help comprehend PolygonE's awareness of hierarchies.

APA, Harvard, Vancouver, ISO, and other styles

49

Thornton, Christopher, Frances Hutchings, Richard Tomsett, and Marcus Kaiser. "VERTEX." Scholarpedia 15, no. 6 (2020): 53365. http://dx.doi.org/10.4249/scholarpedia.53365.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Zharkov, I. P., V. V. Safronov, V. O. Khodunov, V. M. Konoval, V. A. Maslov, A. V. Selivanov, A. G. Solonetskiy, et al. "Expansion of Bruker Vertex 70v FTІR Spectrometer Capabilities." Science and innovation 13, no. 5 (November 21, 2017): 73–77. http://dx.doi.org/10.15407/scine13.05.073.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Vertexer'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles