|
|
| Line 311: |
Line 311: |
| | | | |
| | .h2,h2 { | | .h2,h2 { |
| − | font-size: 2rem | + | font-size: 2.5rem |
| | } | | } |
| | | | |
| Line 2,944: |
Line 2,944: |
| | float: left; | | float: left; |
| | min-width: 10rem; | | min-width: 10rem; |
| − | padding: .5rem 0; | + | padding: 0rem 1.5rem; |
| | + | padding-bottom:1rem; |
| | margin: .125rem 0 0; | | margin: .125rem 0 0; |
| | font-size: 1rem; | | font-size: 1rem; |
| Line 5,732: |
Line 5,733: |
| | -ms-flex-pack: center; | | -ms-flex-pack: center; |
| | justify-content: center; | | justify-content: center; |
| − | width: 15%; | + | width: 1%; |
| − | color: #fff; | + | color: #ff9ea6; |
| | text-align: center; | | text-align: center; |
| | opacity: .5 | | opacity: .5 |
| Line 6,048: |
Line 6,049: |
| | | | |
| | .d-inline { | | .d-inline { |
| − | display: inline!important | + | display: inline!important; |
| | + | font-size:1.75rem |
| | } | | } |
| | | | |
| Line 9,197: |
Line 9,199: |
| | .post-content a{ | | .post-content a{ |
| | color:#40E0D0; | | color:#40E0D0; |
| | + | } |
| | + | |
| | + | .post-content p1{ |
| | + | color:#000000; |
| | + | font-size: 1.5rem; |
| | + | } |
| | + | |
| | + | .post-content li{ |
| | + | color:#000000; |
| | + | font-size: 1.5rem; |
| | } | | } |
| | | | |
| Line 9,529: |
Line 9,541: |
| | <a class="navbar-brand" href="https://2019.igem.org/Team:CAU_China"> | | <a class="navbar-brand" href="https://2019.igem.org/Team:CAU_China"> |
| | <img src="https://2019.igem.org/wiki/images/e/e1/T--CAU_China--logo.png" alt="logo" style="width:70px;height:28px"> | | <img src="https://2019.igem.org/wiki/images/e/e1/T--CAU_China--logo.png" alt="logo" style="width:70px;height:28px"> |
| − | <h5 class="d-inline ml-3">CAU_China</h5> | + | <h5 class="d-inline ml-3">CAU_China</h5> |
| | </a> | | </a> |
| | <button class="navbar-toggler" type="button" data-toggle="collapse" data-target="#collapsibleNavbar"> | | <button class="navbar-toggler" type="button" data-toggle="collapse" data-target="#collapsibleNavbar"> |
| Line 9,583: |
Line 9,595: |
| | </a> | | </a> |
| | <div class="dropdown-menu"> | | <div class="dropdown-menu"> |
| − | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Human_Practices">Human Practices</a> | + | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Human_Practices">Overview</a> |
| | + | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Integrated_HP">Integrated_HP</a> |
| | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Public_Engagement">Education & Engagement</a> | | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Public_Engagement">Education & Engagement</a> |
| | </div> | | </div> |
| Line 9,589: |
Line 9,602: |
| | <li class="nav-item dropdown mx-3"> | | <li class="nav-item dropdown mx-3"> |
| | <a class="nav-link dropdown-toggle" href="#" id="navbardrop" data-toggle="dropdown"> | | <a class="nav-link dropdown-toggle" href="#" id="navbardrop" data-toggle="dropdown"> |
| − | AWARDS | + | MODEL |
| | </a> | | </a> |
| | <div class="dropdown-menu"> | | <div class="dropdown-menu"> |
| − | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Measurement">Measurement</a>
| |
| | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Model">Model</a> | | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Model">Model</a> |
| | + | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Decision_Model">Decision Model</a> |
| | + | <a class="dropdown-item" href="https://2019.igem.org/Team:CAU_China/Dynamics_Model">Dynamics Model</a> |
| | </div> | | </div> |
| | </li> | | </li> |
| Line 9,796: |
Line 9,810: |
| | </aside> | | </aside> |
| | </aside> | | </aside> |
| − | <main class="post-content"> | + | <main class="post-content"> |
| − | <h2>1 Decision Model</h2>
| + | <h1 class="text-center">Decision Model</h1> |
| − | <h3>1.1 Introduction</h3>
| + | <h2>Introduction</h2> |
| − | <div class="row">
| + | <div class="row"> |
| − | <div class="col-12">
| + | <div class="col-12"> |
| − | <p> In our project, we develop a mathematical method to decide which pathway we could use because we have several candidates and need to conduct a scientific and rational method to find out the most suitable one. Therefore, an Analytic Hierarchy Process (AHP) is performed. By doing so, we can combine our subjective and objective factors into consideration and finally get the one from candidates.</p>
| + | <p> In our project, we develop a mathematical method to decide which pathway we could use because we have several candidates and need to conduct a scientific and rational method to find out the most suitable one. Therefore, an Analytic Hierarchy Process (AHP) is performed. By doing so, we can combine our subjective and objective factors into consideration and finally get the one from candidates.</p> |
| − | <h3>1.2 Construct hierarchy model</h3>
| + | <h2>Construct hierarchy model</h2> |
| − | <p> To use the AHP model, we need to list our candidates first. Combining with our project design and references we have read, we finally select 3 candidate pathways, which are Astaxanthin pathway, Ginsenosides pathway1, and Cannabinoid pathway2 respective- ly. In addition, during our discussion and interviews with different expertise, we select 5 most critical criteria we need to consider. Thanks for our human practice working, we can finally determine the criteria we need to use in our AHP model.</p>
| + | <p> To use the AHP model, we need to list our candidates first. Combining with our project design and references we have read, we finally select 3 candidate pathways, which are Astaxanthin pathway, Ginsenosides pathway1, and Cannabinoid pathway2 respective- ly. In addition, during our discussion and interviews with different expertise, we select 5 most critical criteria we need to consider. Thanks for our human practice working, we can finally determine the criteria we need to use in our AHP model.</p> |
| − | <p> By using 3 candidates and 5 criteria, the hierarchy model is established. (Figure 1)</p>
| + | <p> By using 3 candidates and 5 criteria, the hierarchy model is established. (Figure 1)</p> |
| | | | |
| | + | </div> |
| | </div> | | </div> |
| − | </div>
| + | <div class="row"> |
| − | <div class="row">
| + | <div class="col-xs-12" > |
| − | <div class="col-xs-12" >
| + | <img src="https://2019.igem.org/wiki/images/9/9d/T--CAU_China--Mod1.png" style="width:450px;height:300px;margin-left: 32%;margin-top: 0%;" class="figure-img img-fluid rounded text-center" alt="A generic square placeholder image with rounded corners in a figure." > |
| − | <img src="https://2019.igem.org/wiki/images/9/9d/T--CAU_China--Mod1.png" style="width:450px;height:300px;margin-left: 35%;margin-top: 0%;" class="figure-img img-fluid rounded text-center" alt="A generic square placeholder image with rounded corners in a figure." >
| + | <b style="margin-left: 45%;">Figure 1:</b> Hierarchy Model Structure |
| − | <b style="margin-left: 50%;">Figure 1:</b> Hierarchy Model Structure
| + | </div> |
| | </div> | | </div> |
| − | </div>
| + | <h2>Construct Comparison Matrix</h2> |
| − | <h3>1.3 Construct Comparison Matrix</h3>
| + | <div class="row"> |
| − | <div class="row">
| + | <div class="col-12"> |
| − | <div class="col-12">
| + | <p> After having the hierarchy structure, we further construct comparison matrix. When comparing the relative importance of the ith element to the jth element to the factor above, we use the quantified relative weight $a_{ij}$ to describe. Suppose there are a total of n elements to participate in the comparison, then matrix $ A={\{a_{ij}\}}_{n\times n}$ called comparison matrix. The value of $a_{ij}$ in the comparison matrix is assigned according to the following scale.</p> |
| − | <p> After having the hierarchy structure, we further construct comparison matrix. When comparing the relative importance of the ith element to the jth element to the factor above, we use the quantified relative weight $a_{ij}$ to describe. Suppose there are a total of n elements to participate in the comparison, then matrix $ A={\{a_{ij}\}}_{n\times n}$ called comparison matrix. The value of $a_{ij}$ in the comparison matrix is assigned according to the following scale.</p>
| + | |
| | | | |
| | | | |
| | + | </div> |
| | </div> | | </div> |
| − | </div>
| |
| | | | |
| − | <div class="row" style="background-color: white;">
| + | <div class="row" style="background-color: white;"> |
| − | <div class="col-12">
| + | <div class="col-12"> |
| − | <ul style="">
| + | <ul style=""> |
| − | <li>$a_{ij}=1$ which implies that element $i$ and element $j$ have the same importance to the previous level factor.</li>
| + | <li>$a_{ij}=1$ which implies that element $i$ and element $j$ have the same importance to the previous level factor.</li> |
| − | <li>$a_{ij}=3$ which implies that element $i$ is slightly more important than element $j$.</li>
| + | <li>$a_{ij}=3$ which implies that element $i$ is slightly more important than element $j$.</li> |
| − | <li>$a_{ij}=5$ which implies that element $i$ is more important than element $j$.</li>
| + | <li>$a_{ij}=5$ which implies that element $i$ is more important than element $j$.</li> |
| − | <li>$a_{ij}=7$ which implies that element $i$ is much more important than element $j$.</li>
| + | <li>$a_{ij}=7$ which implies that element $i$ is much more important than element $j$.</li> |
| − | <li>$a_{ij}=9$ which implies that element $i$ is extremely more important than element$j$.</li>
| + | <li>$a_{ij}=9$ which implies that element $i$ is extremely more important than element$j$.</li> |
| − | <li>$a_{ij}=2n, n=1,2,3,4$ which implies that the importance of the elements $i$ and$j$ is between $a_{ij}=2n-1$ and $a_{ij}=2n+1$.</li>
| + | <li>$a_{ij}=2n, n=1,2,3,4$ which implies that the importance of the elements $i$ and$j$ is between $a_{ij}=2n-1$ and $a_{ij}=2n+1$.</li> |
| − | <li>$a_{ij}=\frac{1}{n}, n=1,2,\cdots,9,$ if and only if $a_{ij}=n$.</li>
| + | <li>$a_{ij}=\frac{1}{n}, n=1,2,\cdots,9,$ if and only if $a_{ij}=n$.</li> |
| − | </ul>
| + | </ul> |
| | + | </div> |
| | </div> | | </div> |
| − | </div>
| + | <div class="row"> |
| − | <div class="row">
| + | <div class="col-12"> |
| − | <div class="col-12">
| + | <p> By using the scale above, we construct our comparison matrix as follows.</p> |
| − | <p> By using the scale above, we construct our comparison matrix as follows.</p>
| + | \begin{equation} |
| − | \begin{equation}
| + | Goal\:\:Matrix:\quad |
| − | Goal\:\:Matrix:\quad
| + | \left( |
| − | \left(
| + | \begin{array}{ccccc} |
| − | \begin{array}{ccccc}
| + | 1 & 2 & 7 & 5 & 5 \\ |
| − | 1 & 2 & 7 & 5 & 5 \\
| + | 1/2 & 1 & 4 & 3 & 3 \\ |
| − | 1/2 & 1 & 4 & 3 & 3 \\
| + | 1/7 & 1/4 & 1 & 1/2 & 1/3 \\ |
| − | 1/7 & 1/4 & 1 & 1/2 & 1/3 \\
| + | 1/5 & 1/3 & 2 & 1 & 1 \\ |
| − | 1/5 & 1/3 & 2 & 1 & 1 \\
| + | 1/5 & 1/3 & 3 & 1 & 1 |
| − | 1/5 & 1/3 & 3 & 1 & 1
| + | \end{array} |
| − | \end{array}
| + | \right) |
| − | \right)
| + | \end{equation} |
| − | \end{equation}
| + | <p> Criteria Matrix</p> |
| − | <p> Criteria Matrix</p>
| + | \begin{equation} |
| − | \begin{equation}
| + | B1:\quad |
| − | B1:\quad
| + | \left( |
| − | \left(
| + | \begin{array}{ccc} |
| − | \begin{array}{ccc}
| + | 1 & 1/8 & 1/3 \\ |
| − | 1 & 1/8 & 1/3 \\
| + | 3 & 1 & 1/3 \\ |
| − | 3 & 1 & 1/3 \\
| + | 8 & 3 & 1 |
| − | 8 & 3 & 1
| + | \end{array} |
| − | \end{array}
| + | \right) |
| − | \right)
| + | \end{equation} |
| − | \end{equation}
| + | \begin{equation} |
| − | \begin{equation}
| + | B2:\quad |
| − | B2:\quad
| + | \left( |
| − | \left(
| + | \begin{array}{ccc} |
| − | \begin{array}{ccc}
| + | 1 & 2 & 5 \\ |
| − | 1 & 2 & 5 \\
| + | 1/2 & 1 & 2 \\ |
| − | 1/2 & 1 & 2 \\
| + | 1/5 & 1/2 & 1 |
| − | 1/5 & 1/2 & 1
| + | \end{array} |
| − | \end{array}
| + | \right) |
| − | \right)
| + | \end{equation} |
| − | \end{equation}
| + | \begin{equation} |
| − | \begin{equation}
| + | B3:\quad |
| − | B3:\quad
| + | \left( |
| − | \left(
| + | \begin{array}{ccc} |
| − | \begin{array}{ccc}
| + | 1 & 1 & 3 \\ |
| − | 1 & 1 & 3 \\
| + | 1 & 1 & 3 \\ |
| − | 1 & 1 & 3 \\
| + | 1/3 & 1/3 & 1 |
| − | 1/3 & 1/3 & 1
| + | \end{array} |
| − | \end{array}
| + | \right) |
| − | \right)
| + | \end{equation} |
| − | \end{equation}
| + | \begin{equation} |
| − | \begin{equation}
| + | B4:\quad |
| − | B4:\quad
| + | \left( |
| − | \left(
| + | \begin{array}{ccc} |
| − | \begin{array}{ccc}
| + | 1 & 3 & 4 \\ |
| − | 1 & 3 & 4 \\
| + | 1/3 & 1 & 1 \\ |
| − | 1/3 & 1 & 1 \\
| + | 1/4 & 1 & 1 |
| − | 1/4 & 1 & 1
| + | \end{array} |
| − | \end{array}
| + | \right) |
| − | \right)
| + | \end{equation} |
| − | \end{equation}
| + | \begin{equation} |
| − | \begin{equation}
| + | B5:\quad |
| − | B5:\quad
| + | \left( |
| − | \left(
| + | \begin{array}{ccc} |
| − | \begin{array}{ccc}
| + | 1 & 4 & 1/4 \\ |
| − | 1 & 4 & 1/4 \\
| + | 1 & 1 & 1/4 \\ |
| − | 1 & 1 & 1/4 \\
| + | 4 & 1 & 1 |
| − | 4 & 1 & 1
| + | \end{array} |
| − | \end{array}
| + | \right) |
| − | \right)
| + | \end{equation} |
| − | \end{equation}
| + | <p> Where, the Goal Matrix represents different degrees of impor- tance of criteria to the final goal(pathway selection), and Criteria Matrix B1 to B5 represent different degrees of capablity of alter- native pathway to each criteria.</p> |
| − | <p> Among these equations, the equation (1) represents different degrees of importance of
| + | <h2>Consistency test</h2> |
| − | criteria to the final goal(pathway selection), and equation (2) to (5) represents different degrees of capablity of alternative pathway to each criteria.</p>
| + | <p> Obviously, we can find out the matrix above has a characteristic:</p> |
| − | <h3>1.4 Consistency test</h3>
| + | $$ a_{ij}>0 $$ |
| − | <p> Obviously, we can find out the matrix above has a characteristic:</p>
| + | $$ a_{ji}=\frac{1}{a_{ij}} $$ |
| − | $$ a_{ij}>0 $$
| + | <p> which means our matrix is a Reciprocal matrix: Further analysis finds that if $A$ is a completely consistent reciprocal matrix, we have a relationship $a_{ij}a_{jk}=a_{ik},\;\; \forall i,j,k=1,2,\cdots,n$. In fact, however, it is impossible to satisfy the equations above when constructing a comparison matrix. As a result, we use CR, which called Random Consistency Ratio to measure the degree of inconsistancy of a matrix and evaluate whether we could accept such an inconsistancy. The algorithm is listed as follows. </p> |
| − | $$ a_{ji}=\frac{1}{a_{ij}} $$
| + | <h4>Step 1</h4> |
| − | <p> which means our matrix is a Reciprocal matrix: Further analysis finds that if $A$ is a completely consistent reciprocal matrix, we have a relationship $a_{ij}a_{jk}=a_{ik},\;\; \forall i,j,k=1,2,\cdots,n$. In fact, however, it is impossible to satisfy the equations above when constructing a comparison matrix. As a result, we use CR, which called Random Consistency Ratio to measure the degree of inconsistancy of a matrix and evaluate whether we could accept such an inconsistancy. The algorithm is listed as follows. </p>
| + | <p> Calculate an indicator CI (Consistency Index) that measures the degree of inconsistency in a comparison matrix A ($n>1$ matrix)</p> |
| − | <h4>Step 1</h4> | + | \begin{equation}\nonumber |
| − | <p> Calculate an indicator CI (Consistency Index) that measures the degree of inconsistency in a comparison matrix A ($n>1$ matrix)</p>
| + | CI=\frac{\lambda_{max}-n}{n-1} |
| − | \begin{equation}\nonumber
| + | \end{equation} |
| − | CI=\frac{\lambda_{max}-n}{n-1}
| + | <p> $\lambda_{max}$ means the maximum eigenvalue, and $n$ is the order of the matrix</p> |
| − | \end{equation}
| + | <h4>Step 2</h4> |
| − | <p> $\lambda_{max}$ means the maximum eigenvalue, and $n$ is the order of the matrix</p>
| + | <p> Calculate an indicator $RI$ (Random consistency Index), a comparison matrix consistency test standards, which only determined by the order of the matrix.</p> |
| − | <h4>Step 2</h4>
| + | <p> Instead of using theRI presented by Saaty (1980) direct- ly,we conduct a new method to calculateRI by ourselves. By doing so, our model can be more precise. The improved algorithm is presented below.</p> |
| − | <p> Calculate an indicator $RI$ (Random consistency Index), a comparison matrix consistency test standards, which only determined by the order of the matrix.</p>
| + | </div> |
| − | <p> Instead of using the $RI$ list on the website, we conduct a new method to calculate $RI$ by ourselves. By doing so, our model can be more precise. The algorithm is presented below.</p>
| + | |
| | </div> | | </div> |
| − | </div>
| + | <div class="row" style="background-color: white;"> |
| − | <div class="row" style="background-color: white;">
| + | <div class="col-12"> |
| − | <div class="col-12">
| + | <ul style=""> |
| − | <ul style="">
| + | <li>i For a certain matrix order 5, we randomly extract $10$ values from 1, 2, ..., 9, 1/2, 1/3, ..., 1/9 as the upper triangular element, the main diagonal element takes 1 and the lower triangular element goes to the reciprocal of the triangular element, thereby obtaining the matrix R.</li> |
| − | <li>i For a certain matrix order 5, we randomly extract $10$ values from 1, 2, ..., 9, 1/2, 1/3, ..., 1/9 as the upper triangular element, the main diagonal element takes 1 and the lower triangular element goes to the reciprocal of the triangular element, thereby obtaining the matrix R.</li>
| + | <li>ii Calculate CI value of the matrix R.</li> |
| − | <li>ii Calculate CI value of the matrix R.</li>
| + | <li>iii Iterate the previous step.</li> |
| − | <li>iii Iterate the previous step.</li>
| + | <li>iv Calculate the average of all CI values.</li> |
| − | <li>iv Calculate the average of all CI values.</li>
| + | |
| | | | |
| − | </ul>
| + | </ul> |
| | + | </div> |
| | </div> | | </div> |
| − | </div>
| + | <div class="row"> |
| − | <div class="row">
| + | <div class="col-12"> |
| − | <div class="col-12">
| + | <p> After 10 iterations, we get the value of RI when matrix order is 5. And the value of RI is 1.1108.</p> |
| − | <p> After 10 iterations, we get the value of RI when matrix order is 5. And the value of RI is 1.1108.</p>
| + | <h4>Step 3</h4> |
| − | <h4>Step 3</h4>
| + | <p> Calculate the $CR$ (Consistency Ratio) of the comparison matrix $A$ according to the following formula,</p> |
| − | <p> Calculate the $CR$ (Consistency Ratio) of the comparison matrix $A$ according to the following formula (8).</p>
| + | \begin{equation} |
| − | \begin{equation}
| + | CR=\frac{CI}{RI} |
| − | CR=\frac{CI}{RI}
| + | \end{equation} |
| − | \end{equation}
| + | <h4>Step 4</h4> |
| − | <h4>Step 4</h4>
| + | <p> When $CR < 0.1$, we can determine that the comparison matrix $A$ has satisfactory consistency, or the degree of inconsistency is acceptable; otherwise, the comparison matrix $A$ is adjusted until satisfactory consistency is achieved.</p> |
| − | <p> When $CR < 0.1$, we can determine that the comparison matrix $A$ has satisfactory consistency, or the degree of inconsistency is acceptable; otherwise, the comparison matrix $A$ is adjusted until satisfactory consistency is achieved.</p>
| + | <h3>1.5 Calculate weight value and hierarchical total order</h3> |
| − | <h3>1.5 Calculate weight value and hierarchical total order</h3>
| + | <p> After getting the relatively consistant matrix, we use MATLAB to calculate |
| − | <p> After getting the relatively consistant matrix, we use MATLAB to calculate
| + | eigenvector of each matrix. And then use Z-score standardization to ensure all values in eigenvector are within the range of 0-1. The vector which is standardized is called weight vector. </p> |
| − | eigenvector of each matrix. And then use Z-score standardization to ensure all values in eigenvector are within the range of 0-1. The vector which is standardized is called weight vector. </p>
| + | <p> By calculating matrixes above, we get 6 weight vectors. Where, $\omega_{U}$ represents the weight vector of Goal Matrix (1)</p> |
| − | <p> By calculating matrix (1) to (6), we get 6 weight vectors. Among them, $\omega_{U}$ represents the weight vector of Goal Matrix (1)</p>
| + | $$\omega_{U}=(0.475,0.263,0.051,0.103,0.126)^{T}$$ |
| − | $$\omega_{U}=(0.475,0.263,0.051,0.103,0.126)^{T}$$
| + | <p>and $\omega_{B_{i}},\;\;i=1,2,3,4$ represents the weight values of Criteria Matrix B1 to B5</p> |
| − | <p>and $\omega_{B_{i}},\;\;i=1,2,3,4$ represents the weight values of Criteria Matrix (2) to (6)</p>
| + | $$\omega_{B1}=(0.082,0.236,0.682)^{T}$$ |
| − | $$\omega_{B1}=(0.082,0.236,0.682)^{T}$$
| + | $$\omega_{B2}=(0.606,0.265,0.129)^{T}$$ |
| − | $$\omega_{B2}=(0.606,0.265,0.129)^{T}$$
| + | $$\omega_{B3}=(0.429,0.429,0.143)^{T}$$ |
| − | $$\omega_{B3}=(0.429,0.429,0.143)^{T}$$
| + | $$\omega_{B4}=(0.636,0.185,0.179)^{T}$$ |
| − | $$\omega_{B4}=(0.636,0.185,0.179)^{T}$$
| + | $$\omega_{B5}=(0.167,0.167,0.667)^{T}$$ |
| − | $$\omega_{B5}=(0.167,0.167,0.667)^{T}$$
| + | <p>And also, they could be regarded as Our lab’s Capability score, Degree of Innovation score, Time Consuming score, Market Potential score and Experiment Cost score of each candidate. </p> |
| − | <p>And also, they could be regarded as Our lab’s Capability score, Degree of Innovation score, Time Consuming score, Market Potential score and Experiment Cost score of each candidate. </p>
| + | <p> Finally, according to the weight vectors above, we can get a total score of each candidate.</p> |
| − | <p> Finally, according to the weight vectors above, we can get a total score of each candidate.</p>
| + | \begin{equation} |
| − | \begin{equation}
| + | Total\;\;Score=\sum_{n=1}^{5}\omega_{Ui}\times\omega_{Bnj}\quad\quad (i=1,2,3,4,5;\;j=1,2,3) |
| − | Total\;\;Score=\sum_{n=1}^{5}\omega_{Ui}\times\omega_{Bnj}\quad\quad (i=1,2,3,4,5;\;j=1,2,3)
| + | \end{equation} |
| − | \end{equation}
| + | |
| | | | |
| | + | </div> |
| | </div> | | </div> |
| − | </div>
| |
| | | | |
| − | <div class="row">
| + | <div class="row"> |
| − | <div class="col-xs-12" >
| + | <div class="col-xs-12" > |
| − | <img src="https://2019.igem.org/wiki/images/d/d3/T--CAU_China--Mod2.png" style="width:800px;height:300px;margin-left: 0%;margin-top: 0%;" class="figure-img img-fluid rounded text-center" alt="A generic square placeholder image with rounded corners in a figure." >
| + | <img src="https://2019.igem.org/wiki/images/d/d3/T--CAU_China--Mod2.png" style="width:800px;height:300px;margin-left: 5%;margin-top: 0%;" class="figure-img img-fluid rounded text-center" alt="A generic square placeholder image with rounded corners in a figure." > |
| − | <b style="margin-left: 33%;">Figure 2:</b> Total score of each candidate
| + | <b style="margin-left: 38%;">Figure 2:</b> Total score of each candidate |
| | + | </div> |
| | </div> | | </div> |
| − | </div>
| |
| | | | |
| − | <div class="row">
| + | <div class="row"> |
| − | <div class="col-12">
| + | <div class="col-12"> |
| − | <P> According to the total score of each candidate, we choose the one with highest score, which is Astaxanthin pathway From now on, our project starts!</P>
| + | <P> According to the total score of each candidate, we choose the one with highest score, which is Astaxanthin pathway From now on, our project starts!</P> |
| | + | </div> |
| | </div> | | </div> |
| − | </div>
| |
| | | | |
| | | | |
| | | | |
| − | <div id="phareferences" class="row"> | + | <div id="phareferences" class="row"> |
| − | <h2>References</h2>
| + | <h2>References</h2> |
| − | <div class="col-12">
| + | <div class="col-12"> |
| − | <ol>
| + | <ol> |
| | | | |
| − | <li id="ref_1"> <a href=>Dai, Z., Liu, Y., Zhang, X., Zhang, X., Shi, M., Wang, D., . . . Huang, L. (2013). Metabolic engineering of saccharomyces cerevisiae for production of ginsenosides. Metabolic Engineering, 20, 146-156. doi:10.1016/j.ymben.2013.10.004</a></li>
| + | <li id="ref_1"> <a href=>Dai, Z., Liu, Y., Zhang, X., Zhang, X., Shi, M., Wang, D., . . . Huang, L. (2013). Metabolic engineering of saccharomyces cerevisiae for production of ginsenosides. Metabolic Engineering, 20, 146-156. doi:10.1016/j.ymben.2013.10.004</a></li> |
| − | <li id="ref_2"> <a href=>Luo, X., Reiter, M. A., d'Espaux, L., Wong, J., Denby, C. M., Lechner, A., . . . Keasling, J. D. (2019). Complete biosynthesis of cannabinoids and their unnatural analogues in yeast. Nature, 567(7746), 123-126. doi:10.1038/s41586-019-0978-9</a></li>
| + | <li id="ref_2"> <a href=>Luo, X., Reiter, M. A., d'Espaux, L., Wong, J., Denby, C. M., Lechner, A., . . . Keasling, J. D. (2019). Complete biosynthesis of cannabinoids and their unnatural analogues in yeast. Nature, 567(7746), 123-126. doi:10.1038/s41586-019-0978-9</a></li> |
| | | | |
| − | </ol>
| + | </ol> |
| − | </div>
| + | </div> |
| − | </div> | + | </div> |
| | | | |
| − | </main> | + | </main> |
| | </div> | | </div> |
| | | | |
| Line 10,249: |
Line 10,262: |
| | | | |
| | .navbar-collapse:after{clear:both;} | | .navbar-collapse:after{clear:both;} |
| − | body{font-size:14px;line-height:1.42857143;color:#000;background-color:#ffffff;} | + | body{font-size:16px;line-height:1.42857143;color:#000;background-color:#ffffff;} |
| − | a{color: #2f4a98;text-decoration:none;} | + | a{font-size:16px;color: #2f4a98;text-decoration:none;padding-left: 4px;padding-right: 24px} |
| | a:hover, | | a:hover, |
| | a:focus{color:#23527c;text-decoration:underline;} | | a:focus{color:#23527c;text-decoration:underline;} |
| Line 10,387: |
Line 10,400: |
| | <div class="footer_address"> | | <div class="footer_address"> |
| | <h4>China Agricultural University</h4> | | <h4>China Agricultural University</h4> |
| − | <p>Tsinghua East Road 17#<br> | + | <p style="font-size: 14px">Tsinghua East Road 17#<br> |
| | Haidian District <br> | | Haidian District <br> |
| | Beijing 100083<br> | | Beijing 100083<br> |
| Line 10,395: |
Line 10,408: |
| | <h4>Registered in China </h4> | | <h4>Registered in China </h4> |
| | | | |
| − | <p><a href="tel:+86(0)-6273 7682"><i class="fa fa-phone"></i> +86(0)-6273 7682 </a><br> | + | <p><a href="tel:+86(0)-6273 7682"style="font-size: 14px"><i class="fa fa-phone"></i> +86(0)-6273 7682 </a><br> |
| − | <a href="mailto:igem2019cau@gmail.com"><i class="fa fa-envelope"></i> igem2019cau@gmail.com </a></p> | + | <a href="mailto:igem2019cau@gmail.com"style="font-size: 14px"><i class="fa fa-envelope"></i> igem2019cau@gmail.com </a></p> |
| | | | |
| | </div> | | </div> |
| | <div class="footer_links"> | | <div class="footer_links"> |
| | <a href="http://utcaerospacesystems.com/Pages/Default.aspx"><img src="https://2019.igem.org/wiki/images/e/e1/T--CAU_China--logo.png" alt="UTC" target="_blank" rel="nofollow"style="width:150px;height:35;padding-right: 40%"></a> | | <a href="http://utcaerospacesystems.com/Pages/Default.aspx"><img src="https://2019.igem.org/wiki/images/e/e1/T--CAU_China--logo.png" alt="UTC" target="_blank" rel="nofollow"style="width:150px;height:35;padding-right: 40%"></a> |
| − | <p>Follow us on: <a href="https://twitter.com/CollinsAero" target="_blank"><i class="fa fa-twitter" style="color: #55acee"></i> </a> <a href="https://mp.weixin.qq.com/s/Uti4lVH3ikfKt5vqaLG_AA" target="_blank"><i class="fa fa-wechat"></i> </a></p> | + | <p style="font-size: 14px">Follow us on: <a href="https://twitter.com/CollinsAero" target="_blank" style="padding: 0rem 0rem"><i class="fa fa-twitter" style="color: #55acee"></i> </a> <a href="https://mp.weixin.qq.com/s/Uti4lVH3ikfKt5vqaLG_AA" target="_blank"style="padding: 0rem 0rem"><i class="fa fa-wechat"></i> </a></p> |
| | </div> | | </div> |
| | </div> | | </div> |
| Line 10,424: |
Line 10,437: |
| | <div class="footer-bottom"> | | <div class="footer-bottom"> |
| | <div class="row"> | | <div class="row"> |
| − | <div class="col-sm-7 col-md-6 "><a href="" target="_blank" class="ue1"> | + | <div class="col-sm-7 col-md-6 "><a href="" target="_blank" class="ue1" style="font-size:14px;padding: 0rem 0rem"> |
| | Copyright © | | Copyright © |
| | 2019 | | 2019 |
| − | CAU_ESPA. All rights reserved | | + | CAU_ESPA. All rights reserved | <a href="" target="_blank" class="ue1"style="font-size:14px;padding: 0rem 0rem">Website Design by</a><a href="https://2019.igem.org/Team:CAU_China/Team" target="_blank" class="ue" style="font-size:14px;padding: 0rem 0rem"> Leland</a> |
| − | <a href="" target="_blank" class="ue1">Website Design by</a><a href="https://2019.igem.org/Team:CAU_China/Team" target="_blank" class="ue"> Leland</a>
| + | |
| | </div> | | </div> |
| | </div> | | </div> |