Results 301 to 310 of about 92,304 (328)
Some of the next articles are maybe not open access.
Nonsurgical Medical Penile Girth Augmentation: Experience-Based Recommendations
Aesthetic surgery journal, 2017Penile augmentation is increasingly sought by men who are dissatisfied with the size and/or appearance of their penis. However, augmentation procedures are still considered to be highly controversial with no standardized recommendations reported in the ...
Jayson Oates, G. Sharp
semanticscholar +1 more source
Comparison of girth materials, girth tensions and their effects on performance in racehorses
Australian Veterinary Journal, 2005ObjectiveTo compare the effect of girth materials and commonly used girth tensions on athletic performance of racehorses and to test the length tension properties of commercially available girths.ProcedureSeven horses were exercised at speeds to produce 95% of maximal heart rates on 15 occasions using a randomised block design, and girthed with 5 ...
J Bowers, Ron Slocombe
openaire +3 more sources
Failure assessment on offshore girth welded pipelines due to corrosion defects
, 2016Corrosion is an electrochemical process in offshore pipelines where the material strength begins to decrease as corrosion advances. Numerous studies have been performed to determine the remaining strengths (failure pressure) of corroded pipelines ...
Y. M. Zhang +4 more
semanticscholar +1 more source
IEEE Communications Letters, 2016
In this letter, we consider the construction of q-ary low-density parity-check (LDPC) codes by jointly optimizing the girth and number of shortest cycles in the frame of superposition.
Hengzhou Xu, B. Bai
semanticscholar +1 more source
In this letter, we consider the construction of q-ary low-density parity-check (LDPC) codes by jointly optimizing the girth and number of shortest cycles in the frame of superposition.
Hengzhou Xu, B. Bai
semanticscholar +1 more source
Improved PEG construction of large girth QC-LDPC codes
International Symposium on Turbo Codes and Iterative Information Processing, 2016In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-
M. Diouf +4 more
semanticscholar +1 more source
(1, k)‐Coloring of Graphs with Girth at Least Five on a Surface
Journal of Graph Theory, 2017A graph is (d1,...,dr) ‐colorable if its vertex set can be partitioned into r sets V1,...,Vr so that the maximum degree of the graph induced by Vi is at most di for each i∈{1,...,r} .
Ho‐Jin Choi +3 more
semanticscholar +1 more source
Journal of Graph Theory, 1989
AbstractLet G be 2‐connected graph with girth g and minimum degree d. Then each pair of vertices of G is joined by a path of length at least max{1/2(d − 1)g, (d − 3/2)(g − 4) + 2} if g ⩾ 4, and the length of a longest cycle of G is at least max{[(d − 1)(g − 2) + 2], [(2d − 3)(g − 4) + 4]}.
openaire +2 more sources
AbstractLet G be 2‐connected graph with girth g and minimum degree d. Then each pair of vertices of G is joined by a path of length at least max{1/2(d − 1)g, (d − 3/2)(g − 4) + 2} if g ⩾ 4, and the length of a longest cycle of G is at least max{[(d − 1)(g − 2) + 2], [(2d − 3)(g − 4) + 4]}.
openaire +2 more sources
Subgraphs smaller than the girth
Journal of Graph Theory, 1980AbstractFor graphs A, B, let () denote the number of subsets of nodes of A for which the induced subgraph is B. If G and H both have girth > k, and if () = () for every k‐node tree T, then for every k‐node forest F, () = (). Say the spread of a tree is the number of nodes in a longest path. If G is regular of degree d, on n nodes, with girth > k,
Simoncini L., Taylor H.
openaire +3 more sources
Construction of protographs for large-girth structured LDPC convolutional codes
2015 IEEE International Conference on Communications (ICC), 2015In this paper, we present a method to construct girth-6 protographs that lead to the shortest constraint length in the convolutional structure. A stringent structural constraint is imposed on the protographs such that the decoder can be implemented ...
Junho Cho, L. Schmalen
semanticscholar +1 more source