Relevant bibliographies by topics / Vertexer

Academic literature on the topic 'Vertexer'

Author: Grafiati
Published: 14 March 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Vertexer.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "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
More sources

Dissertations / Theses on the topic "Vertexer"

1

Kohn, Eduardo. "Vertedor do tipo labirinto." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/3/3147/tde-11122006-142016/.

Full text
Abstract:
A crista ou soleira de um vertedor, que é a parte superior e que está em contato com a água, tem em geral um desenvolvimento em planta linear, no sentido transversal ao do escoamento. Nos vertedores do tipo labirinto esse desenvolvimento em planta não é linear, é composto de um ou mais ciclos, os quais podem ter uma forma triangular ou trapezoidal. A vantagem do uso desse tipo de obra hidráulica é o aumento do comprimento total da soleira para uma mesma largura, o que se traduz em um aumento da capacidade de vazão da estrutura. A utilização de vertedores do tipo labirinto é particularmente vantajosa para cargas pequenas, pois sua eficiência se reduz com o aumento da carga. Um exemplo de aplicação é a utilização em locais nos quais a geologia ou a topografia impõe restrições de espaço para construção. Outro exemplo é o emprego em uma ampliação da capacidade de vazão de um vertedor existente, quando o vertedor labirinto seria construído sobre o mesmo. Foram apresentadas as principais metodologias de projeto publicadas desse tipo de vertedor . Para auxiliar na análise crítica das metodologias de projeto foram apresentados quatro estudos de casos de vertedores labirinto, cujas pesquisas foram realizadas em modelos físicos reduzidos, a saber: Barragem Prado (EUA), Vertedor Labirinto da Estação de Tratamento de Esgotos de Barueri (Brasil), Barragem Ute (EUA) e Barragem Dog River (EUA). Os resultados desses ensaios mostraram que as metodologias de projeto são capazes de predizer o desempenho dos vertedores dentro de uma faixa limitada de desvio, variável com a carga. Recomenda-se que projetos de maior responsabilidade, ou que tenham características diferentes das preconizadas pela bibliografia, sejam estudados em modelo físico reduzido.
The crest or weir of a spilway, that is the superior part and that it is in contact with the water, has usually a linear plan shape, in perpendicular to the flow direction. In the labyrinth spillways the plan shape is not linear, but varies using a triangular or trapezoidal planform. The advantage of the use of this water work is the increase of the total length of the weir for same width, what it is expressed as an increase of the capacity of discharge of the structure. The use of labyrinth spillways is particularly advantageous for small heads, therefore its efficiency reduces with the increase of the head. An application example is the use in sites in which geology or the topography impose restrictions of space for construction, another example is increase of the capacity of discharge of an existing spillway, where the labyrinth spillway would be constructed on it. The main design curves of this type of spillway had been presented. To assist in the critical analysis of the methodologies of design four case studies had been presented, whose research had been done in physical models: Prado Dam (U.S.A.), Labyrinth Spillway of the Wastewater Treatment Plant Barueri (Brazil), Ute Dam (U.S.A.) and Dog River Dam (U.S.A.). The results show that the design curves can predict the performance of the labyrinth spillways in a limited way. It is recommended that designs which have more responsibility (risks for human being) or that have different characteristics than the design methodologies should be studied in physical model.
APA, Harvard, Vancouver, ISO, and other styles
2

Lewis, Jason Robert. "Vertex-edge and edge-vertex parameters in graphs." Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1193079748/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zaccara, Luciana. "Caratterizzazione biomeccanica di vertebre umane." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9305/.

Full text
Abstract:
Le fratture vertebrali sono tra le principali cause dell’incremento della mortalità. Queste sono dovute principalmente a traumi, tumori o particolari patologie metaboliche che colpiscono l’osso. Il tratto maggiormente interessato è quello toraco-lombare in quanto deve sopportare la maggior parte dei carichi. Risulta quindi necessario comprendere come la colonna vertebrale risponde ai carichi così da studiare e sviluppare nuovi protocolli e trattamenti per disordini del tratto spinale. Informazioni quantitative possono essere ottenute mediante test in vitro. Questi hanno alcune limitazioni dovute principalmente alla difficoltà di misurare le tensioni e le deformazioni in zone diverse dalla superficie, alla complessità e al costo delle prove. Un altro limite delle prove in vitro è rappresentato dal fatto che ciascun campione può essere testato a rottura una volta sola. Queste problematiche possono essere superate con l’utilizzo contemporaneo di modelli matematici e test in vitro. In particolare i test in vitro sono utilizzati in fase di validazione del modello matematico, ovvero nella determinazione di quanto il modello è una rappresentazione del comportamento reale che si sta simulando. Il presente lavoro di tesi si inserisce in un progetto di caratterizzazione di vertebre toraco-lombari utilizzate per la validazione di un modello agli elementi finiti. In particolare l’obiettivo dello studio è stata la realizzazione di prove meccaniche in modo da replicare l’anterior wedge fracture. Tali prove sono state effettuate presso il Laboratorio di Biomeccanica del Dipartimento di Ingegneria Industriale dell’Università di Bologna. Gli spostamenti registrati durante le prove sono stati utilizzati dal Laboratorio di Tecnologia Medica dell’Istituto Ortopedico Rizzoli come condizioni al contorno per la realizzazione di un modello FE. Una volta validato e messo a punto, il modello sarà utilizzato per valutare lo stato di salute della colonna vertebrale in vivo.
APA, Harvard, Vancouver, ISO, and other styles
4

Berra, Francesco. "Caratterizzazione Biomeccanica di vertebre umane." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/5296/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

D'Amico, Giulia. "Caratterizzazione biomeccanica di vertebre umane." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8556/.

Full text
Abstract:
Metastasi ossee, osteoporosi e traumi sono le cause più comuni di fratture vertebrali che possono portare a conseguenze severe. In particolare, le fratture determinate da patologie e dall’invecchiamento colpiscono soprattutto il tratto toraco-lombare che è quello che sopporta la maggior parte dei carichi. Inoltre, le attività quotidiane inducono dei complessi scenari di carico sulla colonna vertebrale. Pertanto la misura di carichi in vivo ha un grande interesse clinico e biomeccanico dal momento che può essere necessaria per studiare il mal di schiena, le fratture vertebrali, il progetto di impianti, ecc. Tuttavia, le misure in vivo hanno il limite di essere invasive. Invece, le prove sperimentali hanno il vantaggio di essere non invasive, anche se presentano alcune limitazioni intrinseche quali la difficoltà di misurare le tensioni o le deformazioni che non siano sulla superficie delle vertebre e l’aumento della complessità e del costo delle prove nel momento in cui si vogliano fare misurazioni addizionali o sperimentare condizioni diverse. In alternativa, il comportamento meccanico delle strutture ossee può essere investigato con modelli numerici agli elementi finiti validati da prove sperimentali. È in questo contesto che va inserito il presente lavoro. Questa tesi ha lo scopo di cominciare un progetto sulla caratterizzazione biomeccanica di vertebre toraciche e lombari di soggetti affetti da osteoporosi da cui si ricaveranno i dati necessari per validare un modello agli elementi finiti. In particolare, durante i test meccanici si vuole riprodurre la tipica fattura vertebrale causata dall’osteoporosi, l’anterior wedge fracture. Le prove meccaniche sono state eseguite nel Laboratorio di Biomeccanica del Dipartimento di Ingegneria Industriale dell’Università di Bologna, mentre il modello agli elementi finiti sarà sviluppato dal Laboratorio di Tecnologia Medica dell’Istituto Ortopedico Rizzoli. Una volta validato, il modello sarà utilizzato per fare simulazioni di rottura in vivo.
APA, Harvard, Vancouver, ISO, and other styles
6

Niu, Liang. "The Vertex Primitive and Vertex Bi-primitive s-arc regular graphs." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1221597829.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bianco, Simone [Verfasser]. "Tracking and vertex reconstruction with the PANDA Micro-Vertex-Detector / Simone Bianco." Bonn : Universitäts- und Landesbibliothek Bonn, 2013. http://d-nb.info/104497155X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Roney, J. Michael (John Michael) 1958 OPAL Carleton University Dissertation Physics. "The OPAL vertex detector." Ottawa.:, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Masum, Mohammad. "Vertex Weighted Spectral Clustering." Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etd/3266.

Full text
Abstract:
Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the vertex is close to zero compared to the largest Fiedler coefficient of the graph. We propose a vertex-weighted spectral clustering algorithm which incorporates a vector of weights for each vertex of a given graph to form a vertex-weighted graph. The proposed algorithm predicts association of equidistant or nearly equidistant data points from both clusters while the unweighted clustering does not provide association. Finally, we implemented both the unweighted and the vertex-weighted spectral clustering algorithms on several data sets to show that the proposed algorithm works in general.
APA, Harvard, Vancouver, ISO, and other styles
10

Arauz, Ivan Juncioni de. "Vertedor de superfície e escoamento sob comportas." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/3/3147/tde-12092005-212331/.

Full text
Abstract:
Os vertedores são estruturas hidráulicas construídas para controlar o nível d’água do reservatório, permitindo a passagem das vazões escoadas com a máxima eficiência possível sem provocar problemas à estrutura. Para atingir este objetivo, as condições de aproximação do escoamento à estrutura e a forma geométrica do perfil vertente são muito importantes. O controle da soleira por comportas provoca uma mudança significativa nas condições de escoamento sobre o perfil vertente. O posicionamento e a forma da comporta tem forte influência no comportamento do coeficiente de vazão e nas pressões sobre a soleira. A formação de vórtice é um fenômeno indesejável que pode ocorrer quando a operação da comporta é parcial, prejudicando a capacidade de vazão e provocando vibrações na estrutura. Este trabalho apresenta uma abordagem teórica sobre o assunto vertedor de superfície e escoamento sob comportas, apresentando resultados de diferentes estudos para melhor compreensão do funcionamento do vertedor.
Spillways are hydraulic structures constructed to control the water level of the reservoir, allowing the overflows with the maximum possible efficiency without provoking problems to the structure. The approach flow pattern to the structure and the geometric form of the spillway profile are basic importance. The control of the spillway by the floodgates modifies the draining conditions. The positioning and the form of the gate have strong influence in the behavior of the discharge coefficient and the pressures on the surface profile. A vortex formation is an undesirable phenomenon that it can occur when the operation of the floodgate is partial, reducing the discharge coefficient and produce vibrations in structure. This work presents a theoretical approach about flow over spillway and under of the partial opening of the floodgate, presenting results of different studies for better understanding the function of the spillway.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Vertexer"

1

Rodríguez, Sergio Javier Luna. Vertedero. Guanajuato, México: Universidad de Guanajuato, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dong, Chongying, and James Lepowsky. Generalized Vertex Algebras and Relative Vertex Operators. Boston, MA: Birkhäuser Boston, 1993. http://dx.doi.org/10.1007/978-1-4612-0353-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

J, Lepowsky, ed. Generalized vertex algebras and relative vertex operators. Boston: Birkhäuser, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dong, Chongying. Generalized Vertex Algebras and Relative Vertex Operators. Boston, MA: Birkhäuser Boston, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Villa, Francesco, ed. Vertex Detectors. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gardner, G. G. ADAC Vertex. London: Department of Health, Medical Devices Agency, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Francesco, Villa, ed. Vertex detectors. New York: Plenum Press, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Villa, Francesco. Vertex Detectors. Boston, MA: Springer US, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Anadón, María Angeles Ichaso. Nada ocurre en el vertedero. Madrid: Entrelínea Editores, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Steen, Jan. Jan Steen: Schilder en Verteller. Amsterdam: Rijksmuseum, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Vertexer"

1

Seiden, A. "Tracking at 1 TeV." In Vertex Detectors, 1–17. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lutz, G., P. Holl, J. Kemmer, U. Prechtel, J. Sedlmeir, L. Strüder, and W. Welser. "Present and Future Semiconductor Tracking Detectors." In Vertex Detectors, 195–224. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kirkby, Jasper. "Today and Tomorrow for Scintillating Fibre (SCIFI) Detectors." In Vertex Detectors, 225–96. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aglietta, C., K. Alberini, G. Badino, G. Bari, M. Basile, M. Bassetti, J. Berbiers, et al. "The INFN Eloisatron Project: European Long Intersecting Storage Accelerator." In Vertex Detectors, 297–341. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Villa, Francesco. "General Discussion." In Vertex Detectors, 343–48. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Seiden, A. "B Physics at PEP and SLC." In Vertex Detectors, 19–36. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jaros, John A. "The MARK II Vertex Detectors: Status and Prospects." In Vertex Detectors, 37–69. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Anderhub, H., H. Anders, S. Ansari, A. Boehm, M. Bourquin, J. Burger, M. Chen, et al. "The Mark-J Vertex Detector." In Vertex Detectors, 71–93. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bari, G., M. Basile, G. Cara Romeo, R. Casaccia, L. Cifarelli, F. Cindolo, A. Contin, et al. "A Modified Time Expansion Chamber as a Vertex Detector." In Vertex Detectors, 95–100. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bouclier, R., G. Charpak, J. Garabatos, B. Guérard, J. C. Santiard, N. Solomey, and F. Sauli. "Operation of Multidrift Tubes with Dimethyl Ether." In Vertex Detectors, 101–13. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4899-2545-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Vertexer"

1

Gao, Zhongpai, Junchi Yan, Guangtao Zhai, and Xiaokang Yang. "Learning Spectral Dictionary for Local Representation of Mesh." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/95.

Full text
Abstract:
For meshes, sharing the topology of a template is a common and practical setting in face-, hand-, and body-related applications. Meshes are irregular since each vertex's neighbors are unordered and their orientations are inconsistent with other vertices. Previous methods use isotropic filters or predefined local coordinate systems or learning weighting matrices for each vertex of the template to overcome the irregularity. Learning weighting matrices for each vertex to soft-permute the vertex's neighbors into an implicit canonical order is an effective way to capture the local structure of each vertex. However, learning weighting matrices for each vertex increases the parameter size linearly with the number of vertices and large amounts of parameters are required for high-resolution 3D shapes. In this paper, we learn spectral dictionary (i.e., bases) for the weighting matrices such that the parameter size is independent of the resolution of 3D shapes. The coefficients of the weighting matrix bases for each vertex are learned from the spectral features of the template's vertex and its neighbors in a weight-sharing manner. Comprehensive experiments demonstrate that our model produces state-of-the-art results with a much smaller model size.
APA, Harvard, Vancouver, ISO, and other styles
2

Cardona-Nunez, O., A. Cornejo-Rodriguez, R. Diaz-Uribe, J. Pedraza-Contreras, and A. Cordero-Davila. "Conic that best fits an off-axis conic section." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1986. http://dx.doi.org/10.1364/oam.1986.wm2.

Full text
Abstract:
To help in the fabrication of off-axis conic sections, we present a method of approximating this off-axis section by an on-axis conic centered on the portion desired. This method is based on the continuum least-squares method to obtain the vertex’s curvature and conic constant of the fitted conic on-axis, given the curvature at the vertex and the conic constant of the parent conic from where we want the section and the size of that section. Simple analytic expressions for the curvature and conic constant are derived in terms of the parameters of the off-axis section.
APA, Harvard, Vancouver, ISO, and other styles
3

Anjum, Omer, Chak Ho Chan, Tanitpong Lawphongpanich, Yucheng Liang, Tianyi Tang, Shuchen Zhang, Wen-mei Hwu, Jinjun Xiong, and Sanjay Patel. "Vertext." In CSCW '20: Computer Supported Cooperative Work and Social Computing. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3406865.3418570.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Johnson, Jack L., Jose Garcia-Bravo, Pawan Panwar, and Paul Michael. "Strategies to Minimize Data Sample Size for Regression-Based Pump/Motor Models." In SICFP’21 The 17:th Scandinavian International Conference on Fluid Power. Linköping University Electronic Press, 2021. http://dx.doi.org/10.3384/ecp182p134.

Full text
Abstract:
This work presents an analysis for tracking the evolution of regression coefficients and the Root-Mean-Square of their residuals on a test dataset for a hydraulic pump. The method starts by iteratively regressing data points that are undergoing sequencing by adding one new data sample at a time, then regressing with each iteration. This process was named Progressively Sequenced Regression Analysis, shortened to “PSR analysis” in this paper. The motivating and guiding postulate of PSR analysis is based on the belief that a plateau of the regression coefficients and statistical figures of merit had to exist if sampling theory is accepted to be real. It was anticipated at the outset that both the regression coefficients and the Residual RMS would converge on respective plateau values; however, it was discovered that the coefficients were very volatile, with some, more volatile than others. Tracking the Residual RMS was found to produce the more reliable measure of information saturation because the convergence is more obvious, provided that the sample sequencing was done with the experience learned from performing PSR analysis. This document is focused on explaining how orthogonally sequenced data can be mined for the limits or hyperspace vertexes of the sampled data, and the source data optimally sequenced (rearranged) to produce results that are as efficacious as Latin Hypercube (LHC) sampling for achieving information saturation at a predictable number of samples. PSR analysis has led to an objective method for verifying that the proper arrangement, i.e., optimized sequencing, of the source data set can predict the condition of information saturation and minimum useful sample size. It ends with a postulate of how this can be achieved using a combination of LHC sampling and vertex pre-test planning, or vertex mining of legacy data. The content of this paper has concentrated solely on the output flow model of hydraulic, positive displacement pumps.
APA, Harvard, Vancouver, ISO, and other styles
5

Peters, Brian. "Vertex.3D." In ACADIA 2014: Design Agency. ACADIA, 2014. http://dx.doi.org/10.52842/conf.acadia.2014.083.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhu, Enqiang, Zhongfu Zhang, Zhiwen Wang, Jingwen Li, Fei Wen, and HuiLin Cai. "Adjacent Vertex Reducible Vertex-Total Coloring of Graphs." In 2009 International Conference on Computational Intelligence and Software Engineering. IEEE, 2009. http://dx.doi.org/10.1109/cise.2009.5365082.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Censor-Hillel, Keren, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, and Fabian Kuhn. "Tight Bounds on Vertex Connectivity Under Vertex Sampling." In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973730.133.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Agrawal, Akanksha, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, and Meirav Zehavi. "Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion." In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.90.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wei, Guowu, and Jian S. Dai. "Geometry and Kinematics of a Plane-Symmetric Spatial Eight-Bar Linkage With Exact Straight-Line Motion." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48281.

Full text
Abstract:
In this paper, a novel plane-symmetric spatial eight-bar linkage with exact straight-line motion is proposed for the first time. Geometry and kinematics of the eight-bar linkage are studied and closed-form equations are presented revealing the exact straight-line motion characteristics of the linkage. It is found in this paper that, for the plane-symmetric eight-bar linkage, the angle α between the base and the straight-line traced by the trajectory of the end-effector point is only dependent on the angle φ of the isosceles triangle vertexes of the linkage but independent of the length of the links and dimension of the vertexes. The relationship between α and φ is studied and a special case that leads to parallel translation motion is revealed. Numerical example is then given to illustrate the kinematic properties of the eight-bar linkage.
APA, Harvard, Vancouver, ISO, and other styles
10

Keil, Markus. "ATLAS pixels: Running Experience." In VERTEX 2009 (18th workshop). Trieste, Italy: Sissa Medialab, 2010. http://dx.doi.org/10.22323/1.095.0001.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Vertexer"

1

Yang, Christine. Vertex. Ames: Iowa State University, Digital Repository, 2014. http://dx.doi.org/10.31274/itaa_proceedings-180814-1088.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kashani-Poor, A. The Vertex on a Strip. Office of Scientific and Technical Information (OSTI), November 2004. http://dx.doi.org/10.2172/839587.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Soha, Aria, Brian Eng, Yuri Gotra, and Sergei Boiarinov. CLAS12 Silicon Vertex Tracker Module Test. Office of Scientific and Technical Information (OSTI), September 2013. http://dx.doi.org/10.2172/1128254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Battaglia, Marco, Jean-Marie Bussat, Devis Contarato, Peter Denes, Lindsay Glesener, Leo Greiner, Benjamin Hooberman, et al. ILC Vertex Tracker R&D. Office of Scientific and Technical Information (OSTI), October 2007. http://dx.doi.org/10.2172/923021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vergara López, Laura Isabella, Maryory Vanessa Diazgranados Santos, Alejandro Ortiz Díaz, Maryuris Machacado Salas, and Diana Carolina Rache Arce. Morfotipos bacterianos aislados en el Antiguo Vertedero de Navarro. Editorial Universidad Santiago de Cali, June 2020. http://dx.doi.org/10.35985/morfotipos.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yoo, Andy, Geoffrey Sanders, Van Henson, and Panayot Vassilevski. A Novel Vertex Affinity for Community Detection. Office of Scientific and Technical Information (OSTI), October 2015. http://dx.doi.org/10.2172/1226940.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Frank, M. R. Nonperturbative aspects of the quark-photon vertex. Office of Scientific and Technical Information (OSTI), June 1994. http://dx.doi.org/10.2172/10155805.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Luste, G. The Solenoid Vertex Spectrometer - A Simulation Study. Office of Scientific and Technical Information (OSTI), June 2018. http://dx.doi.org/10.2172/1453909.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Amidei, D. E. Exploitation of vertex detection at the Tevatron. Office of Scientific and Technical Information (OSTI), January 1991. http://dx.doi.org/10.2172/5897873.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Z., and W. S. Gregory. Electronics cooling of Phenix multiplicity and vertex detector. Office of Scientific and Technical Information (OSTI), August 1996. http://dx.doi.org/10.2172/563286.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Vertexer' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography