PC home集团董事长詹宏志、资深编辑人郑林钟、一群出身于《天下杂志》的媒体工作者碰到一起的时候,一本新的月刊《数位时代》诞生了。 詹宏志指出,这是一本为了因应新的科技时代来临,而产生的管理杂志。《数位时代》由詹宏志担任发行人...PC home集团董事长詹宏志、资深编辑人郑林钟、一群出身于《天下杂志》的媒体工作者碰到一起的时候,一本新的月刊《数位时代》诞生了。 詹宏志指出,这是一本为了因应新的科技时代来临,而产生的管理杂志。《数位时代》由詹宏志担任发行人,郑林钟担任编辑总监。展开更多
Let k, m and n be three positive integers such that 2^m= 1 （mod n） and k ≥ 2. The Bouwer graph, which is denoted by B（k,m,n）, is the graph with vertex set {（a,b） ｜ a ∈Zm, b ∈Zn×…×Zn} k-1 times and...Let k, m and n be three positive integers such that 2^m= 1 （mod n） and k ≥ 2. The Bouwer graph, which is denoted by B（k,m,n）, is the graph with vertex set {（a,b） ｜ a ∈Zm, b ∈Zn×…×Zn} k-1 times and two vertices being adjacent if they can be written as （a,b） and （a＋ 1,c）, where either c ： b or c = （cl,c2 …,ck-1） differs from b = （b1, b2,…, bk-1） in exactly one position, say the jth position, where cj = bj ＋ 2^a. Every B（k, m, n） is a vertex- and edge-transitive graph, and Bouwer proved that B（k, 6, 9） is half-arc-transitive for every k ≥ 2. In 2016, Conder and Zitnik gave the classification of half-arc-transitive Bouwer graphs. In this paper, the full automorphism group of every B（k, m, n） is determined.展开更多
Signal transduction pathways play important roles in various biological processes such as cell cycle, apoptosis, proliferation, differentiation and responses to the external stimuli. Efficient computational methods ar...Signal transduction pathways play important roles in various biological processes such as cell cycle, apoptosis, proliferation, differentiation and responses to the external stimuli. Efficient computational methods are of great demands to map signaling pathways systematically based on the interactome and microarray data in the post-genome era. This paper proposes a novel approach to infer the pathways based on the network flow well studied in the operation research. The authors define a potentiality variable for each protein to denote the extent to which it contributes to the objective pathway. And the capacity on each edge is not a constant but a function of the potentiality variables of the corresponding two proteins. The total potentiality of all proteins is given an upper bound. The approach is formulated to a linear programming model and solved by the simplex method. Experiments on the yeast sporulation data suggest this novel approach recreats successfully the backbone of the MAPK signaling pathway with a low upper bound of the total potentiality. By increasing the upper bound, the approach successfully predicts all the members of the Mitogen-activated protein kinases （MAPK） pathway responding to the pheromone. This simple but effective approach can also be used to infer the genetic information processing pathways underlying the expression quantitative trait loci （eQTL） associations, illustrated by the second example.展开更多
基金This work was partially supported by the National Natural Science Foundation of China （11671030） and the Fundamental Research Funds for the Central Universities （2015JBM110）.
文摘Let k, m and n be three positive integers such that 2^m= 1 （mod n） and k ≥ 2. The Bouwer graph, which is denoted by B（k,m,n）, is the graph with vertex set {（a,b） ｜ a ∈Zm, b ∈Zn×…×Zn} k-1 times and two vertices being adjacent if they can be written as （a,b） and （a＋ 1,c）, where either c ： b or c = （cl,c2 …,ck-1） differs from b = （b1, b2,…, bk-1） in exactly one position, say the jth position, where cj = bj ＋ 2^a. Every B（k, m, n） is a vertex- and edge-transitive graph, and Bouwer proved that B（k, 6, 9） is half-arc-transitive for every k ≥ 2. In 2016, Conder and Zitnik gave the classification of half-arc-transitive Bouwer graphs. In this paper, the full automorphism group of every B（k, m, n） is determined.
基金This research is supported by the National Natural Science Foundation of China under Grant Nos. 10631070, 60873205, the grant kjcx-yw-s7 from Chinese Academy of Sciences, and 2006CB503905 from Ministry of Science and Technology of China.
文摘Signal transduction pathways play important roles in various biological processes such as cell cycle, apoptosis, proliferation, differentiation and responses to the external stimuli. Efficient computational methods are of great demands to map signaling pathways systematically based on the interactome and microarray data in the post-genome era. This paper proposes a novel approach to infer the pathways based on the network flow well studied in the operation research. The authors define a potentiality variable for each protein to denote the extent to which it contributes to the objective pathway. And the capacity on each edge is not a constant but a function of the potentiality variables of the corresponding two proteins. The total potentiality of all proteins is given an upper bound. The approach is formulated to a linear programming model and solved by the simplex method. Experiments on the yeast sporulation data suggest this novel approach recreats successfully the backbone of the MAPK signaling pathway with a low upper bound of the total potentiality. By increasing the upper bound, the approach successfully predicts all the members of the Mitogen-activated protein kinases （MAPK） pathway responding to the pheromone. This simple but effective approach can also be used to infer the genetic information processing pathways underlying the expression quantitative trait loci （eQTL） associations, illustrated by the second example.
