Describe method to enumerate shortest cyclesin bipartite graph. Consider example and provide implementation of this method (https://yadi.sk/d/nMza892Y3PVR3U). Show way to improve under structured graphs
C2 discrete time signals and systems in the frequency-domainPei-Che Chang
Discrete-Time Signals and Systems in the Frequency-Domain
Discrete-Time Fourier Transform
time domain convolution theorem
frequency domain convolution theorem
Z transform
Informe proyecto señales y sistemas ,ingenieria electronica-UNSAACAndres Ccolque Sandy
procesamiento de imagenes ,el nombre del proyecto es"rojo sobre grises",resaltamiento del color rojo sobre los grises,presentado para el curso de señales y sistemas.
C2 discrete time signals and systems in the frequency-domainPei-Che Chang
Discrete-Time Signals and Systems in the Frequency-Domain
Discrete-Time Fourier Transform
time domain convolution theorem
frequency domain convolution theorem
Z transform
Informe proyecto señales y sistemas ,ingenieria electronica-UNSAACAndres Ccolque Sandy
procesamiento de imagenes ,el nombre del proyecto es"rojo sobre grises",resaltamiento del color rojo sobre los grises,presentado para el curso de señales y sistemas.
En este documento se hace un analisis del retardo de extremo a extremo usando como muestra unas trazas de retardo tomadas del sitio de Sue Moon y se utiliza el lenguaje awk para su desarrollo
En esta presentación se realiza una descripción de las tramas AX.25 empleadas en el modo APRS y una descripción breve de los medios posibles para la modulación y demodulación de las mismas.
Error control coding using bose chaudhuri hocquenghem bch codesIAEME Publication
Information and coding theory has applications in telecommunication, where error detection
and correction techniques enable reliable delivery of data over unreliable communication channels.
Many communication channels are subject to noise. BCH technique is one of the most reliable error
control techniques and the most important advantage of BCH technique is both detection and
correction can be performed. The technique aims at detecting and correcting of two bit errors in a
code-word of length 15 bits. A seven bit message was specifically chosen so that ASCII characters
can be easily transmitted.
Sistemas ópticos de comunicaciones
Estudiante: José Bello
C.I: 27.287.508
Asignatura: Electiva V
Instituto Universitario Politécnico "Santiago Mariño" (Extensión Maturín)
Fecha: 20/06/2019
En este documento se hace un analisis del retardo de extremo a extremo usando como muestra unas trazas de retardo tomadas del sitio de Sue Moon y se utiliza el lenguaje awk para su desarrollo
En esta presentación se realiza una descripción de las tramas AX.25 empleadas en el modo APRS y una descripción breve de los medios posibles para la modulación y demodulación de las mismas.
Error control coding using bose chaudhuri hocquenghem bch codesIAEME Publication
Information and coding theory has applications in telecommunication, where error detection
and correction techniques enable reliable delivery of data over unreliable communication channels.
Many communication channels are subject to noise. BCH technique is one of the most reliable error
control techniques and the most important advantage of BCH technique is both detection and
correction can be performed. The technique aims at detecting and correcting of two bit errors in a
code-word of length 15 bits. A seven bit message was specifically chosen so that ASCII characters
can be easily transmitted.
Sistemas ópticos de comunicaciones
Estudiante: José Bello
C.I: 27.287.508
Asignatura: Electiva V
Instituto Universitario Politécnico "Santiago Mariño" (Extensión Maturín)
Fecha: 20/06/2019
Demonstrating Quantum Speed-Up with a Two-Transmon Quantum Processor Ph.D. d...Andreas Dewes
The accompanying slides of my PhD defense presentation on experimental quantum computing, held at the CEA Saclay in November 2012.
Please not that some slides appear "broken" due to the animation sequences they contain, to get a correct view of the presentation, just download the PPTX.
metadata/coreProperties.xml
Model2015-07-13T03:01:04Zthua3267thua32672016-08-11T01:35:03Z1.330R2015b
metadata/mwcoreProperties.xml
application/vnd.mathworks.simulink.modelSimulink ModelR2015b
metadata/mwcorePropertiesExtension.xml
8.6.0.264259
simulink/blockdiagram.xml
windows-1252
nSubCar=10;
nOFDMSym=12;
0.035000
on
off
UseLocalSettings
AllNumericTypes
UseLocalSettings
Overwrite
Run 1
120
UpdateHistoryNever
%<Auto>
%<Auto>
392815836
1.%<AutoIncrement:330>
off
off
disabled
off
on
off
off
on
off
off
on
on
on
on
off
on
on
on
off
off
off
on
on
off
off
normal
5
1
10
10
0
none
off
MATLABWorkspace
accel.tlc
accel_default_tmf
make_rtw
off
off
on
manual
normal
1
any
1000
auto
0
0
rising
0
off
off
off
off
off
on
off
on
on
off
off
off
landscape
auto
A4
centimeters
[1.270000, 1.270000, 1.270000, 1.270000]
1
off
off
200
white
black
white
off
normal
Helvetica
10
normal
normal
on
0
off
center
middle
black
white
off
Helvetica
10
normal
normal
off
Helvetica
9
normal
normal
off
on
on
off
none
default
autoscale
on
on
off
off
off
on
on
on
1
on
Sample based
[]
[]
Inherit: Inherit from 'Constant value'
off
inf
inf
off
4
none
off
short
10
off
off
-1
A
Tag
local
A
Tag
local
1
off
[]
[]
Inherit: auto
off
off
-1
Inherit
-1
auto
auto
off
off
on
One-based contiguous
3
{1,2,3}
Last data port
Error
off
on
[]
[]
Inherit: Inherit via internal rule
off
Floor
on
-1
off
1
[]
[]
Inherit: auto
off
off
-1
Inherit
-1
auto
auto
Dialog
held
[]
1-D array
[1,1]
system
''
[]
FromPortIcon
ReadWrite
All
off
off
off
off
-1
Auto
Auto
Auto
void_void
off
Inherit from model
Inherit from model
Inherit from model
Inherit from model
Inherit from model
off
UseLocalSettings
AllNumericTypes
UseLocalSettings
off
off
NONE
off
off
off
[-8, 0, 1928, 1056]
on
[1.270000, 1.270000, 1.270000, 1.270000]
125
simulink-default.rpt
137
Ideal upconverter, Channel and downconverter
[1, 1]
[685, 254, 785, 296]
39
off
off
[-8, -8, 1928, 1048]
off
[1.270000, 1.270000, 1.270000, 1.270000]
100
[75, 243, 105, 257]
-1
Port number
[235, 160, 300, 190]
7
ChanSelect
off
1
6
Inherit: Inherit via back propagation
[1, 1]
[235, 237, 305, 283]
2
1.32
Stateflow.Translate.translate
ExplicitOnly
on
off
MATLAB Function
off
[223, 338, 826, 833]
off
[1.270000, 1.270000, 1.270000, 1.270000]
100
21
[20, 101, 40, 119]
-1
Port number
[1, 1]
[270, 230, 320, 270]
11
1
Stateflow S-Function Simple_Resource_Grid_Start_Student_2016 3
[1, 2]
[180, 100, 230, 160]
10
sf_sfun
[1 2]
off
on
2
y
Auto
SignalName
[460, 241, 480, 259]
12
[460, 101, 480, 119]
-5
Port number
9
69::1#out:1
69::19#in:1
y
10
[0, 0]
69::19#out:2
69::5#in:1
11
69::20#out:1
69::21#in:1
12
69::19#out:1
69::20#in:1
[1, 1]
[235, 317, 305, 363]
11
1.32
Stateflow.Translate.translate
ExplicitOnly
on
off
MATLAB Function
off
[223, 338, 826, 833]
off
[1.270000, 1.270000, 1.270000, 1.270000]
100
21
[20, 101, 40, 119]
-1
Port number
[1, 1]
[270, 230, 320, 270]
11
1
Stateflow S-Function Simple_Resource_Grid_Start_Student_2016 8
[1, 2]
[180, 100, 230, 160]
10
sf_sfun
[1 2]
off
on
2
y
A ...
Tsp 2018 presentation Simulated Annealing Method for Construction of High-Gi...Usatyuk Vasiliy
Presentation which present a simulated annealing method that
construct high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. The proposed method is applicable to both
regular and irregular protograph codes. The method show
improvement in term of minimal circulant size compare with
previous described methods: Hill-Climbing and improved PEG.
Simulated results are presented to demonstrate performance gain of proposed construction method in error-floor region under base graph 2 (BG2) using 5G eMBB standard length adaption method.
Computing the code distance of linear binary and ternary block codes using p...Usatyuk Vasiliy
We introduce a probabilistic algorithm for minimum distance of linear codes. Algorithm use Kannan embeding techniques to construct lattice from binary and ternary block code. Using permutation of code basis and QR-transformation we optimize Exp and Var for area of search under probabalistical shortest vector problem
In this short survey we consider example of most promising practical approach to improve coding gain under Factor graph in high performance regime (when we have enougth iteration budget [complexity and power comsumption for asic] to waiting recovery of variable nodes) Multi-Edge Type LDPC codes.
Solving channel coding simulation and optimization problems using GPUUsatyuk Vasiliy
Based on several important examples we show great potencial of GPU in codes on the graph optimization (probabalistical graphical model). We consider error-floor estimation weighed of Trapping Sets, Matrix multiplication operation (which important for fast sieving of LDPC using spectral graph analisys Tanner bound and cycle enumerating using lollipop cycles count in LDPC) and Monte-Carlo simulation of LDPC and Turbo Codes.
In this presentation we consider several main methods for contruction regular QC-LDPC codes using algebraic approach. Consider existance of non broken by circulant permutation matrix cycles (short balanced cycles). Using Vontobel approach illustrate way to estimate girth bound and it influence on error-floor properties of QC-LDPC codes
Cycle’s topological optimizations and the iterative decoding problem on gener...Usatyuk Vasiliy
We consider several problem related to graph model related to error-correcting codes. From base problem of cycle broken, trapping set elliminating and bypass to fundamental problem of graph model. Thanks to the hard work of Michail Chertkov, Michail Stepanov and Andrea Montanari which inspirit me...
Slides presented at Applied Mathematics Day, Steklov Mathematical Institute of the Russian Academy of Sciences September 22, 2017 http://www.mathnet.ru/conf1249
Professional air quality monitoring systems provide immediate, on-site data for analysis, compliance, and decision-making.
Monitor common gases, weather parameters, particulates.
This pdf is about the Schizophrenia.
For more details visit on YouTube; @SELF-EXPLANATORY;
https://www.youtube.com/channel/UCAiarMZDNhe1A3Rnpr_WkzA/videos
Thanks...!
The increased availability of biomedical data, particularly in the public domain, offers the opportunity to better understand human health and to develop effective therapeutics for a wide range of unmet medical needs. However, data scientists remain stymied by the fact that data remain hard to find and to productively reuse because data and their metadata i) are wholly inaccessible, ii) are in non-standard or incompatible representations, iii) do not conform to community standards, and iv) have unclear or highly restricted terms and conditions that preclude legitimate reuse. These limitations require a rethink on data can be made machine and AI-ready - the key motivation behind the FAIR Guiding Principles. Concurrently, while recent efforts have explored the use of deep learning to fuse disparate data into predictive models for a wide range of biomedical applications, these models often fail even when the correct answer is already known, and fail to explain individual predictions in terms that data scientists can appreciate. These limitations suggest that new methods to produce practical artificial intelligence are still needed.
In this talk, I will discuss our work in (1) building an integrative knowledge infrastructure to prepare FAIR and "AI-ready" data and services along with (2) neurosymbolic AI methods to improve the quality of predictions and to generate plausible explanations. Attention is given to standards, platforms, and methods to wrangle knowledge into simple, but effective semantic and latent representations, and to make these available into standards-compliant and discoverable interfaces that can be used in model building, validation, and explanation. Our work, and those of others in the field, creates a baseline for building trustworthy and easy to deploy AI models in biomedicine.
Bio
Dr. Michel Dumontier is the Distinguished Professor of Data Science at Maastricht University, founder and executive director of the Institute of Data Science, and co-founder of the FAIR (Findable, Accessible, Interoperable and Reusable) data principles. His research explores socio-technological approaches for responsible discovery science, which includes collaborative multi-modal knowledge graphs, privacy-preserving distributed data mining, and AI methods for drug discovery and personalized medicine. His work is supported through the Dutch National Research Agenda, the Netherlands Organisation for Scientific Research, Horizon Europe, the European Open Science Cloud, the US National Institutes of Health, and a Marie-Curie Innovative Training Network. He is the editor-in-chief for the journal Data Science and is internationally recognized for his contributions in bioinformatics, biomedical informatics, and semantic technologies including ontologies and linked data.
Multi-source connectivity as the driver of solar wind variability in the heli...Sérgio Sacani
The ambient solar wind that flls the heliosphere originates from multiple
sources in the solar corona and is highly structured. It is often described
as high-speed, relatively homogeneous, plasma streams from coronal
holes and slow-speed, highly variable, streams whose source regions are
under debate. A key goal of ESA/NASA’s Solar Orbiter mission is to identify
solar wind sources and understand what drives the complexity seen in the
heliosphere. By combining magnetic feld modelling and spectroscopic
techniques with high-resolution observations and measurements, we show
that the solar wind variability detected in situ by Solar Orbiter in March
2022 is driven by spatio-temporal changes in the magnetic connectivity to
multiple sources in the solar atmosphere. The magnetic feld footpoints
connected to the spacecraft moved from the boundaries of a coronal hole
to one active region (12961) and then across to another region (12957). This
is refected in the in situ measurements, which show the transition from fast
to highly Alfvénic then to slow solar wind that is disrupted by the arrival of
a coronal mass ejection. Our results describe solar wind variability at 0.5 au
but are applicable to near-Earth observatories.
Seminar of U.V. Spectroscopy by SAMIR PANDASAMIR PANDA
Spectroscopy is a branch of science dealing the study of interaction of electromagnetic radiation with matter.
Ultraviolet-visible spectroscopy refers to absorption spectroscopy or reflect spectroscopy in the UV-VIS spectral region.
Ultraviolet-visible spectroscopy is an analytical method that can measure the amount of light received by the analyte.
Slide 1: Title Slide
Extrachromosomal Inheritance
Slide 2: Introduction to Extrachromosomal Inheritance
Definition: Extrachromosomal inheritance refers to the transmission of genetic material that is not found within the nucleus.
Key Components: Involves genes located in mitochondria, chloroplasts, and plasmids.
Slide 3: Mitochondrial Inheritance
Mitochondria: Organelles responsible for energy production.
Mitochondrial DNA (mtDNA): Circular DNA molecule found in mitochondria.
Inheritance Pattern: Maternally inherited, meaning it is passed from mothers to all their offspring.
Diseases: Examples include Leber’s hereditary optic neuropathy (LHON) and mitochondrial myopathy.
Slide 4: Chloroplast Inheritance
Chloroplasts: Organelles responsible for photosynthesis in plants.
Chloroplast DNA (cpDNA): Circular DNA molecule found in chloroplasts.
Inheritance Pattern: Often maternally inherited in most plants, but can vary in some species.
Examples: Variegation in plants, where leaf color patterns are determined by chloroplast DNA.
Slide 5: Plasmid Inheritance
Plasmids: Small, circular DNA molecules found in bacteria and some eukaryotes.
Features: Can carry antibiotic resistance genes and can be transferred between cells through processes like conjugation.
Significance: Important in biotechnology for gene cloning and genetic engineering.
Slide 6: Mechanisms of Extrachromosomal Inheritance
Non-Mendelian Patterns: Do not follow Mendel’s laws of inheritance.
Cytoplasmic Segregation: During cell division, organelles like mitochondria and chloroplasts are randomly distributed to daughter cells.
Heteroplasmy: Presence of more than one type of organellar genome within a cell, leading to variation in expression.
Slide 7: Examples of Extrachromosomal Inheritance
Four O’clock Plant (Mirabilis jalapa): Shows variegated leaves due to different cpDNA in leaf cells.
Petite Mutants in Yeast: Result from mutations in mitochondrial DNA affecting respiration.
Slide 8: Importance of Extrachromosomal Inheritance
Evolution: Provides insight into the evolution of eukaryotic cells.
Medicine: Understanding mitochondrial inheritance helps in diagnosing and treating mitochondrial diseases.
Agriculture: Chloroplast inheritance can be used in plant breeding and genetic modification.
Slide 9: Recent Research and Advances
Gene Editing: Techniques like CRISPR-Cas9 are being used to edit mitochondrial and chloroplast DNA.
Therapies: Development of mitochondrial replacement therapy (MRT) for preventing mitochondrial diseases.
Slide 10: Conclusion
Summary: Extrachromosomal inheritance involves the transmission of genetic material outside the nucleus and plays a crucial role in genetics, medicine, and biotechnology.
Future Directions: Continued research and technological advancements hold promise for new treatments and applications.
Slide 11: Questions and Discussion
Invite Audience: Open the floor for any questions or further discussion on the topic.
Richard's entangled aventures in wonderlandRichard Gill
Since the loophole-free Bell experiments of 2020 and the Nobel prizes in physics of 2022, critics of Bell's work have retreated to the fortress of super-determinism. Now, super-determinism is a derogatory word - it just means "determinism". Palmer, Hance and Hossenfelder argue that quantum mechanics and determinism are not incompatible, using a sophisticated mathematical construction based on a subtle thinning of allowed states and measurements in quantum mechanics, such that what is left appears to make Bell's argument fail, without altering the empirical predictions of quantum mechanics. I think however that it is a smoke screen, and the slogan "lost in math" comes to my mind. I will discuss some other recent disproofs of Bell's theorem using the language of causality based on causal graphs. Causal thinking is also central to law and justice. I will mention surprising connections to my work on serial killer nurse cases, in particular the Dutch case of Lucia de Berk and the current UK case of Lucy Letby.
Enumerating cycles in bipartite graph using matrix approach
1. HUAWEI TECHNOLOGIES CO., LTD.
47pt
www.huawei.com
Usatyuk Vasiliy, 2013
L [dog] Lcrypto.com
Enumerating cycles
in bipartite graphs
using matrix approach
2. HUAWEI TECHNOLOGIES CO., LTD.
Let consider arbitrary codes on the graph
parity-check matrix
Enumerate cycle 4
girth_four_num=0;
for i=1:rows-1
for j=1:cols-1
if H(i,j)==1
%save to array (i,j)
x1=i;y1=j;
for j1=j+1:cols
if H(i,j1)==1
%save to array (i,j)
x2=i;y2=j1;
for i1=i+1:rows
if H(i1,j1)==1
%save to array (i,j)
x3=i1;y3=j1;
if H(i1,j)==1 %the forth point;
%save to array (i,j)
x4=i1;y4=j;
girth_four_num=girth_four_num+1;
else
%delete all saved element location for symbols and checks;
end
end
end
end
end
end
end
end
,
11
11
H
Poor solution, complexity too high
Fan J.,Yang X., "A Method of Counting the Number of Cycles in LDPC Codes," Signal
Processing, 2006 8th International Conference on , vol.3, no., pp.,, 16-20 2006
3. HUAWEI TECHNOLOGIES CO., LTD.
Let consider arbitrary codes on the graph
parity-check matrix
Enumerate cycle 4
girth_four_num=0;
for i=1:rows-1
for j=1:cols-1
if H(i,j)==1
%save to array (i,j)
x1=i;y1=j;
for j1=j+1:cols
if H(i,j1)==1
%save to array (i,j)
x2=i;y2=j1;
for i1=i+1:rows
if H(i1,j1)==1
%save to array (i,j)
x3=i1;y3=j1;
if H(i1,j)==1 %the forth point;
%save to array (i,j)
x4=i1;y4=j;
girth_four_num=girth_four_num+1;
else
%delete all saved element location for symbols and checks;
end
end
end
end
end
end
end
end
,
11
11
H
Poor solution, complexity too high
Fan J.,Yang X., "A Method of Counting the Number of Cycles in LDPC Codes," Signal
Processing, 2006 8th International Conference on , vol.3, no., pp.,, 16-20 2006
4. HUAWEI TECHNOLOGIES CO., LTD.
Let try to estimate number of cycle using
properties of adjacency matrix
Hmatrixcheck-parityofmatrixadjacency,
0
0
isA
H
H
A T
22
equallengthwholepathsofnumbergivesA
gequallengthwholepathsofnumbergivesAg
But powers of the adjacency matrix takes into account not only the trail(simple way,
edges that form the walk distinct), but also way those go through the same edge
many times.
5. HUAWEI TECHNOLOGIES CO., LTD.
lollipop walk
Cycles of length 2m are thus lollipop walks.
All cycles in bipartite graphs contain an even number
of edges and all lollipop walk paths have
mnm,
naaa ,...,, 21
m2,0
mnm,
.2mod0 mn
1v 3v 4v 6v 2v 5v
4v 3v 5v
2v 6v
1v
2,4 lollipop walk where
while are distinct.
57 aa
is n length walks where are distinct and
for some
11 mn aa
].,1[ nm
1a
2a 3a 4a 5a 6a
7a
1a 2a
3a
4a 5a
6a
7a
621 ,...,, aaa
4,2 lollipop walk where
while are distinct.
37 aa
621 ,...,, aaa
Halford, T.R.; Chugg, K.M., "An algorithm for counting short cycles in bipartite graphs,"
Information Theory, IEEE Transactions on , vol.52, no.1, pp.287,292, Jan. 2006
6. HUAWEI TECHNOLOGIES CO., LTD.
v c v
c
c
1a 2a 3a
4a
lollipop walk from to 6,2 .39 aa 1a
Subtract non-trail way
v
c
v
5a
6a
7a8a9a
cv
LH 6,1 Count lollipop walk and walks where
sv
L 6,2 715131 ,, aaaaaa
which necessary to substract to get
sv
L 6,2
7. HUAWEI TECHNOLOGIES CO., LTD.
Let define number of paths length 2k from variable i to j variable
and from i check node i to j check nodes
ss
v
k VVP s
,2
cc
v
k VVsizeP c
,2
Let define number of paths length 2k+1 from variable i to j check node
and from i check node i to j symbol nodes
cs
v
k VVP s
,12
sc
v
k VVsizeP c
,12
Let define number lollipop walks from check i to j check
and from i check node to j symbol nodes
cc
v
kkk VVL c
,22,2 kkk 22,2
sc
v
kkk VVL c
,22,12
kkk 22,12
1
0
22,12212
k
i
v
iki
v
k
v
k
ccc
LHPP
1
0
22,2122
k
i
v
iki
Tv
k
v
k
ccc
LHPP
1
0
22,121212
k
i
v
iki
Tv
k
v
k
sss
LHPP
1
0
22,2122
k
i
v
iki
v
k
v
k
sss
LHPP
IHPL Tv
k
v
k
cc
12)2,0(
IHPL ss v
k
v
k 12)2,0(
sc v
k
v
kk LTr
k
LTr
k
N )2,0()2,0(2
2
1
2
1
Number of cycles 2k length:
8. HUAWEI TECHNOLOGIES CO., LTD.
v c v c v c
1a 2a 3a ga 1ga 2ga
3ga
...
lollipop walk from to 2,g .13 gg gg1a
sssssccs vv
g
vvv
g
v
g
v
g
v
g PILLPPLHILHL 2)2,2()2,0(22)2,1()2,1()2,( 0,1max
v c v
c
c
1a 2a 3a
4a
2ga
lollipop walk from to g,2 .33 agg
1a
3
6 2
),1(),1()2,(
s
ccs
v
v
g
v
g
v
g
P
ILHILHL
Substract non-trail ways
Substract non-trail ways
Lollipop-matrix equation
9. HUAWEI TECHNOLOGIES CO., LTD.
Lollipop-matrix equation
vv
vcv
v
g
v
v
g
v
g
v
g
LL
HPHLL
)2,3()2,0(
1)2,2()2,1(
0,1max
vvvvv
ccv
vvv
g
v
g
v
v
g
v
g
v
g
IPPPLL
HLdiagHLL
222)2,2()2,0(
)2,1()2,1()2,(
0,1max
cv
LTo get just replace toH T
H
vv
L To
cv
L
HPH
P
I
HPHL
HLP
LL
HPLLHLL
v
v
vv
cv
vv
vvvcv
v
v
v
g
v
g
vv
g
v
g
v
v
g
vv
g
v
g
v
g
3
2
1)2,1(
)2,0(1
)2,1()2,0(
1)2,1(),0()2,()2,1(
2
2
2
0,2max2
0,1max
3
6
2
2
),1(),1(),2(
1),0(),1(
v
ccv
vcv
v
v
g
v
g
v
g
v
g
v
g
v
g
P
IHLdiagHLL
HPHLL
HPH
P
I
HP
P
HI
H
P
I
P
I
LLHLL
v
v
v
v
vv
vvcv
v
v
v
v
vv
v
g
vv
g
v
3
2
3
2
33
),1()2,0(),2()2,3(
2
4
2
6
2
4
3
6
0,1max
HPH
P
I
HP
P
HI
H
P
I
HPHLL
v
v
v
c
v
vcv
v
v
v
v
v
v
g
v
g
v
g
3
2
3
2
3
1)2,0()2,1(
2
2
2
2
2
2
2
19. HUAWEI TECHNOLOGIES CO., LTD.
Girth point of view
Labeling problem
Target girth >=6 length cycle
00
00
10
0***
0***
0***
II
II
II
?*is
20. HUAWEI TECHNOLOGIES CO., LTD.
Girth point of view
Target girth >=6 length cycle
Circulant 8
00
00
10
0***
0***
0***
II
II
II
}1,0{,
0***
0***
0**
00
00
10
A
II
II
IIIA
}1,0{,
0***
0**
0**
00
00
100
B
II
III
III
B
}6,7{
08mod)016(
,
0**
0**
0**
00
006
100
C
c
III
III
III
c
}0{,
0**
0**
0*
003
006
100
D
III
III
IIII D
}6,0{,
0**
0*
0*
003
006
1000
E
III
IIII
IIII
E
}7,5,1,0,3{,
0
0
0
00813
00376
10000
J
IIIII
IIIII
IIIII
and so on for
Girth>4