http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Jarvas, Gabor,Guttman, Andras,Mię,kus, Natalia,Bą,czek, Tomasz,Jeong, Sunkyung,Chung, Doo Soo,Pä,toprstý,, Vladimir,Masá,r, Mariá,n,Hutta, Milan,Datinská,, Vladim Elsevier 2020 Trends in analytical chemistry Vol.122 No.-
<P><B>Abstract</B></P> <P>By coupling a sample pretreatment technique of sample clean up and enrichment power with capillary electrophoresis (CE) of high-performance separation, the task of analyzing trace analytes in a complex matrix such as a biological sample can be carried out successfully with ease. This review aims for providing an overview of strategies to couple sample pretreatment techniques with capillary and related microscale (e.g., microchip) electrophoresis, practically adoptable in an automatic manner, without requiring serious modification of existing instruments to install sophisticated interfaces. In-line sample pretreatment techniques based on liquid phase microextraction performed before sample injection and on-line sample preconcentration techniques performed during or after sample injection are discussed with emphasis on the applicability to samples of high conductivity, commonly encountered for biological samples. An overview of the recent developments in microfluidic immobilized enzymatic microreactors which fit excellently to microchip CE is also given.</P> <P><B>Highlights</B></P> <P> <UL> <LI> Recent advances and major trends in sample pretreatment for capillary electrophoresis are summarized. </LI> <LI> In-line and on-line sample pretreatment techniques are discussed with emphasis on biological samples. </LI> <LI> We provide an overview of strategies to couple sample pretreatment techniques with capillary and microchip electrophoresis. </LI> </UL> </P>
Sreten B. Stojanovic,Dragutin Lj. Debeljkovic,Milan A. Misic 제어·로봇·시스템학회 2016 International Journal of Control, Automation, and Vol.14 No.4
The problem of finite-time stability for a class of linear discrete-time systems with state delay is studied. The Lyapunov-Krasovskii-like functional which is based on discrete convolutions of delayed state vector andtime-dependent discrete vector functions is used. In order to obtain much less conservative results, new sufficientcondition is derived in form of linear matrix inequalities. Numerical example is given to demonstrate the effectivenessof the proposed stability criterion. It was shown that the obtained results are less conservative than someexisting ones in the literature. A computer simulation was performed for the analysis of the dynamical behaviourof this system.
COMPUTING DETERMINANTAL REPRESENTATION OF GENERALIZED INVERSES
Stanimirovic, Predrag-S.,Tasic, Milan-B. 한국전산응용수학회 2002 The Korean journal of computational & applied math Vol.9 No.2
We investigate implementation of the determinantal representation of generalized inverses for complex and rational matrices in the symbolic package MATHEMATICA. We also introduce an implementation which is applicable to sparse matrices.
A modification of gradient method of convex programming and its implementation
P. S. Stanimirovic,Milan B. Tasic 한국전산응용수학회 2004 Journal of applied mathematics & informatics Vol.16 No.-
A modification of the gradient method of convex programming is introduced. Also, we describe symbolic implementation of the gradient method and its modification by means of the programming language MATHEMATICA. A few numerical examples are reported.
COMPUTING DETERMINANTAL REPRESENTATION OF GENERALIZED INVERSES
Predrag S. Stanimirovic,Milan B. Tasic 한국전산응용수학회 2002 Journal of applied mathematics & informatics Vol.9 No.2
We investigate implementation of the determinantal representationof generalized inverses for complex and rational matricesin the symbolic package {ssr MATHEMATICA}.We also introduce an implementation which is applicable to sparse matrices.
A MODIFICATION OF GRADIENT METHOD OF CONVEX PROGRAMMING AND ITS IMPLEMENTATION
Stanimirovic, Predrag S.,Tasic, Milan B. 한국전산응용수학회 2004 Journal of applied mathematics & informatics Vol.16 No.1
A modification of the gradient method of convex programming is introduced. Also, we describe symbolic implementation of the gradient method and its modification by means of the programming language MATHEMATICA. A few numerical examples are reported.
COMPUTING GENERALIZED INVERSES OF A RATIONAL MATRIX AND APPLICATIONS
Stanimirovic, Predrag S.,Karampetakis, N. P.,Tasic, Milan B. 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.24 No.1
In this paper we investigate symbolic implementation of two modifications of the Leverrier-Faddeev algorithm, which are applicable in computation of the Moore-Penrose and the Drazin inverse of rational matrices. We introduce an algorithm for computation of the Drazin inverse of rational matrices. This algorithm represents an extension of the papers [11] and [14]. and a continuation of the papers [15, 16]. The symbolic implementation of these algorithms in the package MATHEMATICA is developed. A few matrix equations are solved by means of the Drazin inverse and the Moore-Penrose inverse of rational matrices.