Search

Additional file 1: Table S1. AIC values of the model fits.

Background Respiratory tract infections are the most common infections that lead to morbidity and mortality worldwide. Early recognition and precise diagnosis of microbial etiology is important to treat LRTIs promptly, specifically and effectively. Objectives To establish a method based on multiplex reverse transcription (MRT)-PCR and MassARRAY technology for the simultaneous detection of 27 respiratory pathogens and explore its clinical application value. Methods Analytical sensitivity and specificity of the MRT-PCR-MassARRAY system were validated using inactivated bacterial and viral strains. Also we analyzed samples from 207 patients by MassARRAY methods and compared the results with consensus PCR/reverse transcription (RT)-PCR. Results The minimum detection limit of our MRT-PCR-MassARRAY method for pathogens was 10–100 copies/μl, with high specificity. Comparison test with consensus PCR/RT-PCR on 207 clinical samples, the positive, negative, and total correlation rates were 100, 98.68, and 99.03%, respectively. There was a high degree of agreement between the test results of the two methods (P Conclusion Our detection system of 27 respiratory pathogens based on MassARRAY technology has high sensitivity and specificity, high throughput, and is simple to operate. It provides diagnostic value for the clinical diagnosis of respiratory pathogens and is of great significance in the screening of respiratory pathogens.

We study the canonical orbit category of the bounded derived category of finite dimensional representations of the quiver of type $D_{\infty}$. We prove that this orbit category is a cluster category, that is, its cluster-tilting subcategories form a cluster structure as defined in [\ref{BIRS}]., 21 pages, 5 figures. arXiv admin note: text overlap with arXiv:1505.06062 by other authors

In this paper we study the poset of basic tilting $kQ$-modules when $Q$ is a Dynkin quiver, and the poset of basic support $\tau$-tilting $kQ$-modules when $Q$ is a connected acyclic quiver respectively. It is shown that the first poset is a distributive lattice if and only if $Q$ is of types $\mathbb{A}_{1}, \mathbb{A}_{2}$ or $\mathbb{A}_{3}$ with a nonlinear orientation and the second poset is a distributive lattice if and only if $Q$ is of type $\mathbb{A}_{1}$., Comment: 9 pages, 6 figures

In this paper we study the poset of basic tilting $kQ$-modules when $Q$ is a Dynkin quiver, and the poset of basic support $��$-tilting $kQ$-modules when $Q$ is a connected acyclic quiver respectively. It is shown that the first poset is a distributive lattice if and only if $Q$ is of types $\mathbb{A}_{1}, \mathbb{A}_{2}$ or $\mathbb{A}_{3}$ with a nonlinear orientation and the second poset is a distributive lattice if and only if $Q$ is of type $\mathbb{A}_{1}$., 9 pages, 6 figures

In general, representation rings are well-known as Green rings from module categories of Hopf algebras. In this paper, we study Green rings in the context of monoidal categories such that representations of Hopf algebras can be investigated through Green rings of various levels from module categories to derived categories in the unified view-point. Firstly, as analogue of representation rings of Hopf algebras, we set up the so-called Green rings of monoidal categories, and then list some such categories including module categories, complex categories, homotopy categories, derived categories and (derived) shift categories, etc. and the relationship among their corresponding Green rings. The main part of this paper is to characterize representation rings and derived rings of a class of inite dimensional Hopf algebras constructed from the Nakayama truncated algebras $KZ_{n}/J^{d}$ with certain constraints. For the representation ring $r(KZ_{n}/J^{d})$, we completely determine its generators and the relations of generators via the method of Pascal triangle. For the derived ring $dr(KZ_{n}/J^{2})$(i.e., $d=2$), we determine its generators and give the relations of generators. In these two aspects, the polynomial characterizations of the representation ring and the derived ring are both given., Comment: 34 pages, 7 figures

As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevisky \cite{[4]}, in this paper, we give the test method of positive definite matrices via the planar networks and the so-called cluster subalgebra respectively, introduced here originally. This work firstly gives a combinatorial realization of all matrices through planar network, and then sets up a test method for positive definite matrices by $LDU$-decompositions and the horizontal weightings of all lines in their planar networks. On the other hand, mainly the relationship is built between positive definite matrices and cluster subalgebras., Comment: 11 pages, 6 figures

Cloud Computing will surpass the Internet in importance; it is a relatively new technology model of Internet-based computing, whereby information, software, storage, servers and networking are provided on demand. According to different end user requirements, such as data or computing intensive applications are applied in cloud environment. Cloud computing makes computing as a utility and has the potential to transform a large part of the IT industry, making software even more attractive as a service and shaping the way in which hardware is designed and purchased. We review this cloud computing technologies, and indicate the main challenges for their development in future, among which resource management problem is pointed out and attracts our attention. Combing the current resource management and broker theories, we present new strategy of how to manage resources to deal with different user requirements of cloud services. We described the related work of resource management and broker architecture in this thesis, accomplishing four major research issues. Firstly, we present cloud resource management framework and service-oriented broker to efficiently utilize potential physical resource such as network, storage and computing resources. This framework provides on-demand service to users and optimizes resource utilization by employing virtualization technology. It has the ability to enhance the system performance and satisfy the many of user request. The service-oriented broker is presented in this framework. It is aim to discover, select and reserve the network and end-system resources. It is able to provide guaranteed service by reservation mechanism to meet user’s demand. The several scheduling algorithms are employed for finding best match of combined resources. Secondly, we address the problem caused by failure of job submission in cloud environment. We present dynamic resource selection algorithm under user’s QoS requirement which would benefit for selecting the best combined resource for real-time multimedia applications. This algorithm is aim to reduce the job fail rate and efficiently utilize network resource to enhance system performance. Thirdly, we solve the virtual network resource allocation problem in cloud computing. We present virtual network-aware resource scheduling algorithm for real-time multimedia applications that is in order to efficiently utilize physical network resources. This algorithm will reduce the physical network traffic and guarantee the service request of the users. Furthermore, the streaming data will be transmitted from selected data source, and then application performance will be maintained. Fourth, we address meta-job scheduling problem for computation application in cloud environment. We present V-heuristic scheduling algorithms for allocation of virtualized network and computing resource. The objective of these scheduling algorithms is aim to achieve high system throughput, improve load balance and minimize meta-job processing time. From the practical aspect, we develop a simulator which is extended from CloudSim simulator. This simulator offers a simulated environment to model this resource management framework. The GloudSim only concentrate on end-system resource without getting concerned about virtualization technology and network resource, so that they can accelerate study progress of new cloud technologies.