|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Curve fitting and optimal interpolation on CNC machines based on quadratic B-splines显示文摘In this paper,curve fitting of 3-D points generated by G01 codes and interpolation based on quadratic B-splines are studied.Feature points of G01 codes are selected using an adaptive method.Next,quadratic B-splines are obtained as the fitting curve by interpolating these feature points.Computations required in implementing the velocity planning algorithm mentioned by Timer et al.are very complicated because of the appearance of high-order curves.An improved time-optimal method for the quadratic B-spline curves is presented to circumvent this issue.The algorithms are verified with simulations as well as on real CNC machines. | ZHANG Mei YANWei YUAN ChunMing WANG DingKang GAO XiaoShan | 2011 | Science China(Information Sciences)2011，54，7： | 21 |
| 2 | A novel mechanism controls anther opening and closing in Paris polyphylla var. Yunnanensis显示文摘The phenomena of anther opening and closing in Paris polyphylla var. yunnanensis (Franch) Hand.-Mazz were described in detail, and the effects of ecological factors on those phenomena related to anther opening, closing and the fly-pollination mechanism were discussed. Anthers of P. polyphylla var. yunnanensis open in the morning and close in the evening every day during an over 20 days’ period of anthesis. Light was detected as the main factor controlling this daily anther opening and closing. Anther opening can be reversed in response to rain and re-opens when rain stops. Relative humidity (RH) has a slight effect on anther opening and closing. Flower spans can be prolonged under laboratory conditions. This novel behavior of anther is likely to be a mechanism to enhance the male fitness in this species, of which has no inherited structure to protect pollen from the perianth. | WANG DingKang SUN GuiFang WANG LiFang ZHAI ShuHua CEN XiaoJiang | 2009 | Chinese Science Bulletin2009，54，2： | 5 |
| 3 | TransCrowd:weakly-supervised crowd counting with transformers显示文摘The mainstream crowd counting methods usually utilize the convolution neural network(CNN)to regress a density map,requiring point-level annotations.However,annotating each person with a point is an expensive and laborious process.During the testing phase,the point-level annotations are not considered to evaluate the counting accuracy,which means the point-level annotations are redundant.Hence,it is desirable to develop weakly-supervised counting methods that just rely on count-level annotations,a more economical way of labeling.Current weakly-supervised counting methods adopt the CNN to regress a total count of the crowd by an image-to-count paradigm.However,having limited receptive fields for context modeling is an intrinsic limitation of these weakly-supervised CNN-based methods.These methods thus cannot achieve satisfactory performance,with limited applications in the real world.The transformer is a popular sequence-to-sequence prediction model in natural language processing(NLP),which contains a global receptive field.In this paper,we propose TransCrowd,which reformulates the weakly-supervised crowd counting problem from the perspective of sequence-to-count based on transformers.We observe that the proposed TransCrowd can effectively extract the semantic crowd information by using the self-attention mechanism of transformer.To the best of our knowledge,this is the first work to adopt a pure transformer for crowd counting research.Experiments on five benchmark datasets demonstrate that the proposed TransCrowd achieves superior performance compared with all the weakly-supervised CNN-based counting methods and gains highly competitive counting performance compared with some popular fully-supervised counting methods. | Dingkang LIANG Xiwu CHEN Wei XU Yu ZHOU Xiang BAI | 2022 | Science China(Information Sciences)2022，65，6： | 5 |
| 4 | Targeting PFKL with penfluridol inhibits glycolysis and suppresses esophageal cancer tumorigenesis in an AMPK/FOXO3a/BIM-dependent manner显示文摘As one of the hallmarks of cancer,metabolic reprogramming leads to cancer progression,and targeting glycolytic enzymes could be useful strategies for cancer therapy.By screening a small molecule library consisting of 1320 FDA-approved drugs,we found that penfluridol,an antipsychotic drug used to treat schizophrenia,could inhibit glycolysis and induce apoptosis in esophageal squamous cell carcinoma(ESCC).Gene profiling and Ingenuity Pathway Analysis suggested the important role of AMPK in action mechanism of penfluridol.By using drug affinity responsive target stability(DARTS)technology and proteomics,we identified phosphofructokinase,liver type(PFKL),a key enzyme in glycolysis,as a direct target of penfluridol.Penfluridol could not exhibit its anticancer property in PFKL-deficient cancer cells,illustrating that PFKL is essential for the bioactivity of penfluridol.High PFKL expression is correlated with advanced stages and poor survival of ESCC patients,and silencing of PFKL significantly suppressed tumor growth.Mechanistically,direct binding of penfluridol and PFKL inhibits glucose consumption,lactate and ATP production,leads to nuclear translocation of FOXO3a and subsequent transcriptional activation of BIM in an AMPK-dependent manner.Taken together,PFKL is a potential prognostic biomarker and therapeutic target in ESCC,and penfluridol may be a new therapeutic option for management of this lethal disease. | Cancan Zheng Xiaomei Yu Yiyao Liang Yidong Zhu Yan He Long Liao Dingkang Wang Yanming Yang Xingfeng Yin Ang Li Qingyu He Bin Li | 2022 | Acta Pharmaceutica Sinica B2022，12，3： | 4 |
| 5 | A Survey on Algorithms for Computing Comprehensive Gröbner Systems and Comprehensive Gröbner Bases显示文摘Weispfenning in 1992 introduced the concepts of comprehensive Gr?bner system/basis of a parametric polynomial system, and he also presented an algorithm to compute them. Since then,this research ?eld has attracted much attention over the past several decades, and many effcient algorithms have been proposed. Moreover, these algorithms have been applied to many different ?elds,such as parametric polynomial equations solving, geometric theorem proving and discovering, quanti?er elimination, and so on. This survey brings together the works published between 1992 and 2018, and we hope that this survey is valuable for this research area. | LU Dong SUN Yao WANG Dingkang | 2019 | Journal of Systems Science & Complexity2019，32，1： | 3 |
| 6 | Solving the Perspective-Three-Point Problem Using Comprehensive Grobner Systems显示文摘A complete solution classification of the perspective-three-point(P3P) problem is given by using the Gr?bner basis method. The structure of the solution space of the polynomial system deduced by the P3P problem can be obtained by computing a comprehensive Gr?bner system. Combining with properties of the generalized discriminant sequences, the authors give the explicit conditions to determine the number of distinct real positive solutions of the P3P problem. Several examples are provided to illustrate the effectiveness of the proposed conditions. | ZHOU Jie WANG Dingkang | 2016 | Journal of Systems Science & Complexity2016，29，5： | 3 |
| 7 | THE F5 ALGORITHM IN BUCHBERGER'S STYLE显示文摘为计算 Gr 的著名 F5 算法 ? bner 基础被 Faug | Yao SUN Dingkang WANG | 2011 | Journal of Systems Science & Complexity2011，24，6： | 3 |
| 8 | Computing polynomial univariate representations of zero-dimensional ideals by Grbner basis显示文摘Rational Univariate Representation(RUR) of zero-dimensional ideals is used to describe the zeros of zero-dimensional ideals and RUR has been studied extensively.In 1999,Roullier proposed an efficient algorithm to compute RUR of zero-dimensional ideals.In this paper,we will present a new algorithm to compute Polynomial Univariate Representation(PUR) of zero-dimensional ideals.The new algorithm is based on some interesting properties of Grbner basis.The new algorithm also provides a method for testing separating elements. | MA XiaoDong SUN Yao WANG DingKang | 2012 | Science China Mathematics2012，55，6： | 3 |
| 9 | Predicting the Potential Distribution of Rubia cordifolia L.in China显示文摘[Objectives]We intend to conduct a study to predict habitat suitability and geographic distribution of Rubia cordifolia L.,to find the most suitable ecological environment for its growth,and to provide a theoretical basis for the development and cultivation of R.cordifolia L.industry.[Methods]Based on the environmental factors and the occurrence data,we predicted the potential geographic distribution of R.cordifolia L.in China by combining the MaxEnt model and ArcGIS.[Results]The training set and test set AUC were respectively 0.963 and 0.946,indicating that the MaxEnt model predicted well.The wettest monthly precipitation,precipitation in July,precipitation of driest season,and average monthly temperature in September and April were the dominant environmental factors affecting the distribution of R.cordifolia L.The highly habitable areas were mainly concentrated in central,eastern and northern China.[Conclusions]The results of this study can be used as a reference for the development of R.cordifolia L.industry in related areas. | Wei QIN Suping JIANG Xueke ZHANG Dingkang CHEN Shoujin LIU Daiyin PENG | 2021 | Medicinal Plant2021，12，3： | 2 |
| 10 | On computing Grbner bases in rings of differential operators显示文摘Insa and Pauer presented a basic theory of Grbner basis for differential operators with coeffcients in a commutative ring in 1998,and a criterion was proposed to determine if a set of differential operators is a Gro¨bner basis.In this paper,we will give a new criterion such that Insa and Pauer's criterion could be concluded as a special case and one could compute the Grbner basis more effciently by this new criterion. | MA XiaoDong SUN Yao WANG DingKang | 2011 | Science China Mathematics2011，54，6： | 2 |
| 11 | On Implementing the Symbolic Preprocessing Function over Boolean Polynomial Rings in Gr?bner Basis Algorithms Using Linear Algebra显示文摘Some techniques using linear algebra was introduced by Faugère in F4 to speed up the reduction process during Gr?bner basis computations.These techniques can also be used in fast implementations of F5 and some other signature-based Gr?bner basis algorithms.When these techniques are applied,a very important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function(given in F4).Since multiplications of monomials and polynomials are involved in the Symbolic Preprocessing function,this step can be very costly when the number of involved polynomials/monomials is huge.In this paper,multiplications of monomials and polynomials for a Boolean polynomial ring are investigated and a specific method of implementing the Symbolic Preprocessing function over Boolean polynomial rings is reported.Many examples have been tested by using this method,and the experimental data shows that the new method is very efficient. | SUN Yao HUANG Zhenyu LIN Dongdai WANG Dingkang | 2016 | Journal of Systems Science & Complexity2016，29，3： | 2 |
| 12 | A new proof for the correctness of the F5 algorithm显示文摘In 2002,Faugère presented the famous F5 algorithm for computing Grbner basis where two criteria,syzygy criterion and rewritten criterion,were proposed to avoid redundant computations.He proved the correctness of the syzygy criterion,but the proof for the correctness of the rewritten criterion was left.Since then,F5 has been studied extensively.Some proofs for the correctness of F5 were proposed,but these proofs are valid only under some extra assumptions.In this paper,we give a proof for the correctness of F5B,an equivalent version of F5 in Buchberger's style.The proof is valid for both homogeneous and non-homogeneous polynomial systems.Since this proof does not depend on the computing order of the S-pairs,any strategy of selecting S-pairs could be used in F5B or F5.Furthermore,we propose a natural and non-incremental variant of F5 where two revised criteria can be used to remove almost all redundant S-pairs. | SUN Yao WANG DingKang | 2013 | Science China Mathematics2013，56，4： | 2 |
| 13 | Identification of Postharvest Pathogens of Amorphophallus muelleri and Indoor Screening of Fungicides显示文摘 | Lei Yu Jianrong Zhao Jiani Liu Xu Wu Dingkang Wang Shengguan Xu Georges Sigismond Srzednicki | 2015 | Journal of Agricultural Science and Technology(A)2015，5，7： | 1 |
| 14 | An Improvement of the Rational Representation for High-Dimensional Systems显示文摘Based on the rational univariate representation of zero-dimensional polynomial systems,Tan and Zhang proposed the rational representation theory for solving a high-dimensional polynomial system,which uses so-called rational representation sets to describe all the zeros of a high-dimensional polynomial system.This paper is devoted to giving an improvement for the rational representation.The idea of this improvement comes from a minimal Dickson basis used for computing a comprehensive Grobner system of a parametric polynomial system to reduce the number of branches.The authors replace the normal Grobner basis G satisfying certain conditions in the original algorithm(Tan-Zhang’s algorithm)with a minimal Dickson basis G_(m) of a Grobner basis for the ideal,where G_(m) is smaller in size than G.Based on this,the authors give an improved algorithm.Moreover,the proposed algorithm has been implemented on the computer algebra system Maple.Experimental data and its performance comparison with the original algorithm show that it generates fewer branches and the improvement is rewarding. | XIAO Fanghui LU Dong MA Xiaodong WANG Dingkang | 2021 | Journal of Systems Science & Complexity2021，34，6： | 1 |
| 15 | An efficient algorithm for factoring polynomials over algebraic extension field显示文摘An efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Grbner basis, no extra Grbner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a characteristic polynomial of a generic linear map. Then this polynomial is factorized over the ground field. From its factors, the factorization of the polynomial over the extension field is obtained. The algorithm has been implemented in Magma and computer experiments indicate that it is very efficient, particularly for complicated examples. | SUN Yao WANG DingKang | 2013 | Science China Mathematics2013，56，6： | 1 |
| 16 | Speeding Up the GVW Algorithm via a Substituting Method显示文摘The GVW algorithm is an effcient signature-based algorithm for computing Gr?bner bases.In this paper, the authors consider the implementation of the GVW algorithm by using linear algebra,and speed up GVW via a substituting method. As it is well known that, most of the computing time of a Gr?bner basis is spent on reductions of polynomials. Thus, linear algebraic techniques, such as matrix operations, have been used extensively to speed up the implementations. Particularly, one-direction(also called signature-safe) reduction is used in signature-based algorithms, because polynomials(or rows in matrices) with larger signatures can only be reduced by polynomials(rows) with smaller signatures. The authors propose a new method to construct sparser matrices for signature-based algorithms via a substituting method. Speci?cally, instead of only storing the original polynomials in GVW, the authors also record many equivalent but sparser polynomials at the same time. In matrix construction, denser polynomials are substituted by sparser equivalent ones. As the matrices get sparser, they can be eliminated more effciently. Two speci?cal algorithms, Block-GVW and LMGVW, are presented, and their combination is the Sub-GVW algorithm. The correctness of the new proposed method is proved, and the experimental results demonstrate the effciency of this new method. | LI Ting SUN Yao HUANG Zhenyu WANG Dingkang LIN Dongdai | 2019 | Journal of Systems Science & Complexity2019，32，1： | 1 |
| 17 | Increased Granulysin Expression in Peripheral Blood Cells of Patients with Primary Biliary Cirrhosis and Its Clinical Implications显示文摘 | Cheng Qian Sunxiao Chen Dingkang Yao Chuanyong Wu Tingwang Jiang Jinshan Ke Ye Zhou Mingli Gu Bo Chen Anmei Deng Renqian Zhong | 2008 | Journal of Clinical Immunology2008，，5： | 1 |
| 18 | On surface-fitting problem in CAGD显示文摘 | WU Wentsun WANG Dingkang | 1994 | Mathemtics in Practice and Theory1994，3，： | 1 |
| 19 | Direct field-to-pattern monolithic design of holographic metasurface via residual encoderdecoder convolutional neural network显示文摘Complex-amplitude holographic metasurfaces(CAHMs)with the flexibility in modulating phase and amplitude profiles have been used to manipulate the propagation of wavefront with an unprecedented level,leading to higher image-reconstruction quality compared with their natural counterparts.However,prevailing design methods of CAHMs are based on Huygens-Fresnel theory,meta-atom optimization,numerical simulation and experimental verification,which results in a consumption of computing resources.Here,we applied residual encoder-decoder convolutional neural network to directly map the electric field distributions and input images for monolithic metasurface design.A pretrained network is firstly trained by the electric field distributions calculated by diffraction theory,which is subsequently migrated as transfer learning framework to map the simulated electric field distributions and input images.The training results show that the normalized mean pixel error is about 3%on dataset.As verification,the metasurface prototypes are fabricated,simulated and measured.The reconstructed electric field of reverse-engineered metasurface exhibits high similarity to the target electric field,which demonstrates the effectiveness of our design.Encouragingly,this work provides a monolithic field-to-pattern design method for CAHMs,which paves a new route for the direct reconstruction of metasurfaces. | Ruichao Zhu Jiafu Wang Tianshuo Qiu Dingkang Yang Bo Feng Zuntian Chu Tonghao Liu Yajuan Han Hongya Chen Shaobo Qu | 2023 | Opto-Electronic Advances2023，6，8： | 0 |
| 20 | Construction Strategy of Sponge City in the Old Urban Area of Kunming Based on LID Concept显示文摘Sponge city construction,as an important measure of ecological construction in China,can effectively solve a series of problems such as large annual runoff,serious non-point source pollution,regional water shortage,low utilization rate of rain and flood resources,unsustainable ecological benefits of water landscape and poor landscape functions in urbanization construction. This paper uses LID concept to construct sponge city in the old urban area of Kunming,to reduce the total runoff and promote the utilization of rainfall and flood resources so as to rebuild,upgrade and optimize the regional environment and provide some reference for the regional construction of small-scale sponge city. | Jinzhu HUA Zebin CHEN Dingkang WANG Jingxiang HU Liyuan YAO Yuyu ZHANG Lifang YIN Hao LI | 2018 | Asian Agricultural Research2018，10，5： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员