Uncovering the miRNA-mediated regulatory network involved in Ma bamboo(Dendrocalamus latiflorus)de novo shoot organogenesis

Bamboo is an important non-timber forest product and is well-known for its reluctance to regenerate.Recently we have established a de novo shoot organogenesis(DNSO)protocol in Ma bamboo(Dendrocalamus latiflorus)and revealed the transcriptomic dynamics during Ma bamboo regeneration,which suggested the potential roles of Ma bamboo microRNAs(DlamiRNAs)in this process.However,how DlamiRNAs regulate bamboo DNSO is poorly understood.Here we performed integrated analysis with sRNAome,degradome,and transcriptome sequencing by using samples covering the four stages of the bamboo DNSO process.A total of 727 DlamiRNAs showed differential expression during the bamboo DNSO process,and the core DlamiRNA-DlamRNA-mediated regulatory networks for bamboo DNSO were constructed.Based on the results,DlamiR156 was selected for further functional characterization of its potential roles in bamboo DNSO.Transgenic bamboos with increased DlamiR156 levels exhibited an enhancement in their regeneration efficiency.Conversely,when DlamiR156 levels were downregulated,the regeneration efficiencies of transgenic bamboos decreased.Our findings show that the DlamiRNA-mediated regulatory pathways are significant in the process of bamboo regeneration and will contribute to our understanding of the molecular mechanisms governing plant organogenesis in a more comprehensive manner.

The Research on the Psychological Tactic of Covering the Dagger With a Smile

Thirty-Six Stratagems is one of the most important military works of ancient China.As the name of the book,it totally includes 36 stratagems that can be used in many different fields such as military,business,and politics.Covering the dagger with a smile is one of the most common ones in these stratagems.At the same time,it is the most insidious one.As a kind of psychological tactic,it usually acts as the secret weapon of the weak.Though this stratagem should not be seen as a kind of predominant strategy,it is still worth being researched deeply,because knowing more about this psychological tactic will offer a good reference for the researchers of ancient art of war.

求解Opt-Covering问题的一个降维策略

本文是对模Opt-Covering问题的降维策略进行研究.通过分块算法将原问题划分成若干子问题,然后逐一解决子问题,这样就达到降维的目的.

求解Covering问题的拟物方法——NP难度问题的一个处理途径

本文提出的算法模拟了由万有引力和屏蔽现象所引起的力学过程.这种拟物的方案可为许多NP难度的问题得出有价值的近似算法.该算法对拟物类型的选择与现代递归论中的有穷损害优先方法的精神是一致的.

The Sequence-covering Compact Images of Paracompact Locally Compact Spaces

This paper gives internal characterizations of some sequence covering compact images and compact covering compact images of paracompact locally compact spaces, which improve some results on compact images of locally compact metric spaces.

Properties and Relations of Several Operators Based on Covering Rough Sets

The coveting rough sets theory is a generalization of traditional rough set theory, and can also describe information with incompleteness and fuzziness in information systems. In this paper, we first provide the definitions of several upper and lower covering approximation operators on the covering approximation space. Then, we study the properties of these operators. Finally, we propose the mutual relations between approximation operators and similar relations of the operator （ I ） based on the covering rough sets.

GF(2)上向量的相对长度,Packing及Covering界

本文证明向量的相对长度与Hamming距离非常类似,即在一定条件下也存在packing与covering界。

Minimum Covering RandićEnergy of a Graph

Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy REC (G) of a graph G in this paper. This paper contains computation of minimum covering Randićenergies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randićenergy are also presented.

Clinical observation of removal of the necrotic corneal tissue combined with conjunctival flap covering surgery under the guidance of the AS-OCT in treatment of fungal keratitis

AIM: To study the clinical observation of removal of the necrotic corneal tissue combined with conjunctival flap covering surgery under the guidance of the AS-OCT in treatment of fungal keratitis. METHODS:A retrospective study was done to 10 patients (10 eyes) who had accepted removal of the necrotic corneal tissue combined with conjunctival flap covering surgery for fungal keratitis,the diagnosis by corneal scraping and smear examination or confocal microscopy check hyphae. Local and systemic antifungal therapy more than one week for all patients, corneal ulcer enlarge or no shrink. Slit lamp microscope examination the diameter of corneal ulcer about 2mm-4mm. Anterior segment optical coherence tomography (AS-OCT)examine the depth of corneal ulcer between 1/3-1/2, infiltrate corneal stroma about 20um-80um,the diameter of corneal ulcer about 3mm-6mm.Type-B ultrasonic exclusion endophthalmitis. Complete removal lesions until transparent of stoma, make conjunctival flap equal or greater than ulcer 1mm nearby conjunctiva. Continued antifungal therapy. The vision, fungal recurrence, conjunctival flap rollback or desquamate were analysed. ' RESULTS:Ten patients had success done this surgery, the corneal ulcer was not enlarge and healing afteroperation. 7 cases were bridging conjunctival flap and 3cases were single conjunctival flap. Preoperation vision above 0.1 had 8 cases,7 cases had vision above 0.1 one week after surgery, while 1 cases vision droped from 0.3 to 0.05.There was not recurrent for fungal,2 cases conjunctival flap rollback:1 case was bridging and 1case was single flap, no conjunctival flap desquamate. CONCLUSION: It is safe and effective to perform removal of the necrotic corneal tissue combined with conjunctival flap covering surgery under the guidance of the AS-OCT in treatment of fungal keratitis which werenot sensitive or aggravate for antifungal drugs.

Effects of V-pits covering layer position on the optoelectronic performance of InGaN green LEDs

The impact of the V-pits covering layer(VCL) position on the optoelectronic performance of InGaN-based green light-emitting diodes(LEDs) was investigated. It is found that earlier covering of V-pits will hinder the hole injection via the sidewall of V-pits, and then result in less quantum wells(QWs) participating in radioluminescence. The current-voltage characteristics show that the LEDs with earlier covering of V-pits have higher operating voltage at room temperature, and a more dramatic voltage rise with the reduction of temperature. Meanwhile, more manifested emission peaks for sidewall QWs and deeper QWs near to ntype layer was observed in the sample with earlier coveing of V-pits at cryogenic temperatures, for the reason that the holes being injected via V-pits sidewall have higher kinetic energy and could transport to deeper QWs.

ON THE SHARP GROWTH,COVERING THEOREMS FOR NORMALIZED BIHOLOMORPHIC MAPPINGS IN C^n

In this article, a normalized biholomorphic mapping f defined on bounded starlike circular domain in Cn is considered, where z = 0 is a zero of order k ＋ 1 of f（z） - z. The sharp growth, covering theorems for almost starlike mappings of order α and starlike mappings of order α are established. Meanwhile, the construction of the above mappings on bounded starlike circular domain in Cn is also discussed, it provides the extremal mappings for the growth, covering theorems of the above mappings.

Gravity-based heuristic for set covering problems and its application in fault diagnosis

A novel algorithm named randomized binary gravita- tional search （RBGS） algorithm is proposed for the set covering problem （SCP）. It differs from previous SCP approaches because it does not work directly on the SCP matrix. In the proposed algo- rithm, the solution of SCP is viewed as multi-dimension position of objects in the binary search space. All objects in the space attract each other by the gravity force, and this force causes a global movement of all objects towards the objects with heavier masses which correspond to good solutions. Computation results show that the proposed algorithm is very competitive. In addition, the proposed aigodthm is extended for SCP to solve the fault diagno- sis problem in graph-based systems.

Effects of a covering layer in a circular-arc canyon on incident plane SV waves

An analytical solution for scattering of incident plane SV waves by a circular-arc canyon with a covering layer was derived by Fourier-Bessel series expansion technique, and the solution was utilized to analyze the effects of the covering layer on incident plane SV waves. It was shown that the covering layer in a canyon, even if it is very thin, amplifies incident plane SV waves tremendously, and the amplification can be two and half times more than that for a simple canyon; the stiffness and thickness of the covering layer also have great effects on incident plane SV waves.

Parallel machine covering with limited number of preemptions

In this paper, we investigate the/-preemptive scheduling on parallel machines to maximize the minimum machine completion time, i.e., machine covering problem with limited number of preemptions. It is aimed to obtain the worst case ratio of the objective value of the optimal schedule with unlimited preemptions and that of the schedule allowed to be preempted at most i times. For the m identical machines case, we show the worst case ratio is 2m-i-1/m and we present a polynomial time algorithm which can guarantee the ratio for any 0 〈 i 〈2 m - 1. For the /-preemptive scheduling on two uniform machines case, we only need to consider the cases of i = 0 and i = 1. For both cases, we present two linear time algorithms and obtain the worst case ratios with respect to s, i.e., the ratio of the speeds of two machines.

Binary Fruit Fly Swarm Algorithms for the Set Covering Problem

Currently,the industry is experiencing an exponential increase in dealing with binary-based combinatorial problems.In this sense,metaheuristics have been a common trend in the field in order to design approaches to solve them successfully.Thus,a well-known strategy consists in the use of algorithms based on discrete swarms transformed to perform in binary environments.Following the No Free Lunch theorem,we are interested in testing the performance of the Fruit Fly Algorithm,this is a bio-inspired metaheuristic for deducing global optimization in continuous spaces,based on the foraging behavior of the fruit fly,which usually has much better sensory perception of smell and vision than any other species.On the other hand,the Set Coverage Problem is a well-known NP-hard problem with many practical applications,including production line balancing,utility installation,and crew scheduling in railroad and mass transit companies.In this paper,we propose different binarization methods for the Fruit Fly Algorithm,using Sshaped and V-shaped transfer functions and various discretization methods to make the algorithm work in a binary search space.We are motivated with this approach,because in this way we can deliver to future researchers interested in this area,a way to be able to work with continuous metaheuristics in binary domains.This new approach was tested on benchmark instances of the Set Coverage Problem and the computational results show that the proposed algorithm is robust enough to produce good results with low computational cost.

APPLICATIONS OF BERNSTEIN-DURRMEYER OPERATORS IN ESTIMATING THE COVERING NUMBER

The paper deals with estimates of the covering number for some Mercer kernel Hilbert space with Bernstein-Durrmeyer operators. We first give estimates of l2- norm of Mercer kernel matrices reproducing by the kernelsK（α,β）（x,y）：=∑∞k=0 Ck（α,β）（x）Qk（α,β）（y）,where Qk（α,β） （x） are the Jacobi polynomials of order k on （0, 1 ）, Ck（α,β） 〉 0 are real numbers, and from which give the lower and upper bounds of the covering number for some particular reproducing kernel Hilbert space reproduced by Kα,β （x, y）.

Study on covering rough sets with topological methods

The authors study the covering rough sets by topological methods. They combine the covering rough sets and topological spaces by means of defining some new types of spaces called covering rough topological (CRT) spaces based on neighbourhoods or complementary neighbourhoods. As the separation axioms play a fundamental role in general topology, they introduce all these axioms into covering rough set theories and thoroughly study the equivalent conditions for every separation axiom in several CRT spaces. They also investigate the relationships between the separation axioms in these special spaces and reveal these relationships through diagrams in different CRT spaces.

Dualities in Covering Rough Operations

Rough set theory is a technique of granular computing. In this paper, we study a type of generalized rough sets based on covering. There are several literatures[1,40-43] exploring covering-based rough sets. Our focus of this paper is on the dualities in rough operations.

Myotomy with Omentum Covering and Cardio-valvoplasty for Treatment of Achalasia

Thirty one cases of the achalasia underwent myotomywith omentum covering and cardio-valvoplasty from 1983to 1988 at our hospital. Follow-up study, one to 4 yearspostoperatively, showed that 29 cases (93.5%) of themwith excellent results, only 2 cases(6.5%)showed slightdysphagia. The advantages of this procedure are as fol-lows: 1. relief of obstruction at lower end of esophagusand cardia preventing the recurrence of stenosis; 2. pre-vention of occurence of reflux esophagitis; 3. no altera-tion of normal anatomy of the esophagocardia region andno intervention of mucosa; 4. simplicity and safety ofthis procedure.

Analysis of VIV for Barrel-Shaped Mast with Covering Ice by HPD-S Method

The vortex-induced vibrations （VIV） of barrel-shaped mast are calculated by three numerical metods, i.e. New- mark- β, HPD-L （High Precision Direct integration scheme-Linear form）, and HPD-S （High Precision Direct integration scheme-Sinusoidal form）. According to the measured value, the accuracy curves are given to show the advantages of HPD-S method over others. Based on the comparison above, HPD-S method is used to calculate the influence of ice covering on the mast to VIV responses. It has been proved that the vortex-induced responses of barrel-shaped mast are changed along with ice thicknesses and types.