Zobrazeno 1 - 10
of 2 801
pro vyhledávání: '"Transposition (telecommunications)"'
Publikováno v:
Annals of Vascular Surgery. 80:113-119
To compare the tunnel transposition and elevation transposition methods used for superficialization of the basilic vein in terms of complication and patency rates.This retrospective study included patients who underwent 2-stage basilic vein transposi
Publikováno v:
IEEE Journal of Photovoltaics. 12:145-151
Publikováno v:
Theoretical Computer Science. 896:158-167
Modelling of chromosomes with permutations has triggered the research of sorting permutations using global rearrangement operations in computational molecular biology. One such rearrangement is transposition which swaps two adjacent substrings. If on
Publikováno v:
International Journal of Ophthalmology, Vol 14, Iss 12, Pp 1921-1927 (2021)
Int J Ophthalmol
Int J Ophthalmol
AIM: To describe the experience with half-width vertical muscles transposition (VRT) augmented with posterior fixation sutures. METHODS: The clinical charts of all patients, who underwent half-width VRT augmented with posterior fixation sutures for s
Publikováno v:
IEEE Transactions on Transportation Electrification. 7:2812-2821
The 3-D finite element method (FEM) has been widely used for accurate analysis of winding loss with winding axial transposition angle considered. However, its application is limited due to long computation time and complex modeling processes. To addr
Autor:
Hyo Jeong Kwon, Jangyoun Choi, Suk-Ho Moon, Young Joon Jun, Chae Rim Lee, Jung Hyeou Kim, Deuk Young Oh
Publikováno v:
Archives of Aesthetic Plastic Surgery, Vol 27, Iss 4, Pp 125-131 (2021)
Background Keloids can occur anywhere in the human body. They are difficult to remove and can cause distress in patients. Although many options are available to treat keloids, no single method is considered the optimal treatment of choice. The author
Publikováno v:
Theoretical & Applied Science. 102:566-572
Publikováno v:
The Computer Journal. 66:384-398
A bipartite graph is Hamiltonian laceable if any two of its vertices in different partite sets are connected by a Hamiltonian path. A Hamiltonian laceable graph $G$ is called strongly Hamiltonian laceable if any two of its vertices in the same partit
Publikováno v:
International Journal of Foundations of Computer Science. 33:33-43
The Cayley graph generated by a transposition tree [Formula: see text] is a class of Cayley graphs that contains the star graph and the bubble sort graph. A graph [Formula: see text] is called strongly Menger (SM for short) (edge) connected if each p
Publikováno v:
IEEE Transactions on Power Delivery. 36:2839-2850
A method for fault type discrimination and faulted phase identification using instantaneous local current measurements is proposed. Seven current components are obtained from the measured three-phase instantaneous currents through a transformation an