The volcanics matrix parameters are variable in different areas and even in different intervals of a same well,due to its complicated mineral compositions and variable mineral contents. The determination of matrix par...The volcanics matrix parameters are variable in different areas and even in different intervals of a same well,due to its complicated mineral compositions and variable mineral contents. The determination of matrix parameters is significant because it has an effect on the porosity calculation accuracy. The authors proposed a simple but useful dual-component model to calculate porosity,and the results are compatible with the core porosity.展开更多
The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2...The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.展开更多
This paper presents a gradient based iterative algorithm for Sylvester-conjugate matrix equations with a unique solution. By introducing a relaxation parameter and applying the hierarchical identification principle, a...This paper presents a gradient based iterative algorithm for Sylvester-conjugate matrix equations with a unique solution. By introducing a relaxation parameter and applying the hierarchical identification principle, an iterative algorithm is constructed to solve Sylvester matrix equations. By applying a real representation of a complex matrix as a tool and using some properties of the real representation, convergence analysis indicates that the iterative solutions converge to the exact solutions for any initial values under certain assumptions.Numerical examples are given to illustrate the efficiency of the proposed approach.展开更多
In this paper, a carangiform robotic fish with 4-DoF （degree of freedom） tail has been developed. The robotic fish has capability of swimming under two modes that are radio control and autonomous swimming. Experimen...In this paper, a carangiform robotic fish with 4-DoF （degree of freedom） tail has been developed. The robotic fish has capability of swimming under two modes that are radio control and autonomous swimming. Experiments were conducted to investigate the influences of characteristic parameters including the frequency, the amplitude, the wave length, the phase difference and the coefficient on forward velocity. The experimental results shown that the swimming performance of the robotic fish is affected mostly by the characteristic parameters observed.展开更多
We scrutinize the problem of robust H∞control for a class of Markovian jump uncertain systems with interval timevarying and distributed delays. The Markovian jumping parameters are modeled as a continuous-time finite...We scrutinize the problem of robust H∞control for a class of Markovian jump uncertain systems with interval timevarying and distributed delays. The Markovian jumping parameters are modeled as a continuous-time finite-state Markov chain. The main aim is to design a delay-dependent robust H∞control synthesis which ensures the mean-square asymptotic stability of the equilibrium point. By constructing a suitable Lyapunov–Krasovskii functional（LKF）, sufficient conditions for delay-dependent robust H∞control criteria are obtained in terms of linear matrix inequalities（LMIs）. The advantage of the proposed method is illustrated by numerical examples. The results are also compared with the existing results to show the less conservativeness.展开更多
Taking the sectional area and the bending moment of inertia as variables for each beam element, the plane frame will possess a stiffness matrix containing parameters.In terms of the symbolic computation software, the ...Taking the sectional area and the bending moment of inertia as variables for each beam element, the plane frame will possess a stiffness matrix containing parameters.In terms of the symbolic computation software, the inverse matrix is solved to obtain the new analytical solution with respect ic characteristics of elements cross-section.The general program is coded in the microcomputer and corresponding exmpales are computed.展开更多
Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics...Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.展开更多
1 Introduction Compared with retraining,fine-tuning,and other traditional approaches,neural network repair approaches[1-7]can significantly improve the robustness of neural networks with lower time and computing cost....1 Introduction Compared with retraining,fine-tuning,and other traditional approaches,neural network repair approaches[1-7]can significantly improve the robustness of neural networks with lower time and computing cost.These repair techniques encode the anticipated performance of the repaired neural network into a Satisfiability Modulo Theories(SMT)problem and utilize an SMT solver to calculate a parameter matrix for the fully connected layer.This matrix can then be multiplied with the example feature vector to yield a vector that satisfies predetermined conditions.展开更多
Echo state network （ESN） has become one of the most popular recurrent neural networks （RNN） for its good prediction performance of non-linear time series and simple training process. But several problems still pre...Echo state network （ESN） has become one of the most popular recurrent neural networks （RNN） for its good prediction performance of non-linear time series and simple training process. But several problems still prevent ESN from becoming a widely used tool. The most prominent problem is its high complexity with lots of random parameters. Aiming at this problem, a minimum complexity ESN model （MCESN） was proposed. In this paper, we proposed a new wavelet minimum complexity ESN model （WMCESN） to improve the prediction accuracy and increase the practical applicability. Our new model inherits the characters of minimum complexity ESN model using the fixed parameters and simple circle topology. We injected wavelet neurons to replace the original neurons in internal reservoir and designed a wavelet parameter matrix to reduce the computing time. By using different datasets, our new model performed better than the minimum complexity ESN model with normal neurons, but only utilized tiny time cost. We also used our own packets of transmission control protocol （TCP） and user datagram protocol （UDP） dataset to prove that our model can deal with the data packet bit prediction problem well.展开更多
With the continuous advancement of semiconductor technology, the interconnects crosstalk has had a great influence on the performances of VLSI circuits. To date, most of the research about the interconnects of VLSI ci...With the continuous advancement of semiconductor technology, the interconnects crosstalk has had a great influence on the performances of VLSI circuits. To date, most of the research about the interconnects of VLSI circuits focus on the voltage-mode signaling （VMS） scheme while the current-mode signaling （CMS） scheme is rarely analyzed. First of all, an equivalent circuit model of two-line coupled interconnects is presented in this paper, which is applicable to both the CMS and VMS schemes. The coupling capacitive and mutual inductive are taken into account in the equivalent circuit model. Secondly, the output noise of CMS and VMS schemes are investigated in the paper according to the decoupling technique and A B CD parameter matrix approach at local level, intermediate level and global level, respectively. Moreover, the experimental results show that the CMS interconnects have lesser noise peak, noise width and noise amplitude than the VMS interconnects in the same cases, and the CMS scheme is especially suitable for the global interconnects communication of VLSI circuits. It is found that the results obtained by A B CD parameter matrix approach are in good accordance with the simulation results of the advanced design system.展开更多
基金Supported by projects of the National Natural Science Foundation of China (No. 41174096)the Ministry of Science and Technology of China (No.2011ZX05009 No. 2011ZX05044)
文摘The volcanics matrix parameters are variable in different areas and even in different intervals of a same well,due to its complicated mineral compositions and variable mineral contents. The determination of matrix parameters is significant because it has an effect on the porosity calculation accuracy. The authors proposed a simple but useful dual-component model to calculate porosity,and the results are compatible with the core porosity.
基金supported in part by the Social Science Foundation of Ministry of Education(07JJD790154)the National Science Foundation for Young Scholars (60803076)+2 种基金the Natural Science Foundation of Zhejiang Province (Y6090211)Foundation of Education Department of Zhejiang Province (20070590)the Young Talent Foundation of Zhejiang Gongshang University
文摘The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.
基金Supported by the National Natural Science Foundation of China(Grant No.11071033)
文摘This paper presents a gradient based iterative algorithm for Sylvester-conjugate matrix equations with a unique solution. By introducing a relaxation parameter and applying the hierarchical identification principle, an iterative algorithm is constructed to solve Sylvester matrix equations. By applying a real representation of a complex matrix as a tool and using some properties of the real representation, convergence analysis indicates that the iterative solutions converge to the exact solutions for any initial values under certain assumptions.Numerical examples are given to illustrate the efficiency of the proposed approach.
文摘In this paper, a carangiform robotic fish with 4-DoF （degree of freedom） tail has been developed. The robotic fish has capability of swimming under two modes that are radio control and autonomous swimming. Experiments were conducted to investigate the influences of characteristic parameters including the frequency, the amplitude, the wave length, the phase difference and the coefficient on forward velocity. The experimental results shown that the swimming performance of the robotic fish is affected mostly by the characteristic parameters observed.
基金Project supported by Department of Science and Technology(DST)under research project No.SR/FTP/MS-039/2011
文摘We scrutinize the problem of robust H∞control for a class of Markovian jump uncertain systems with interval timevarying and distributed delays. The Markovian jumping parameters are modeled as a continuous-time finite-state Markov chain. The main aim is to design a delay-dependent robust H∞control synthesis which ensures the mean-square asymptotic stability of the equilibrium point. By constructing a suitable Lyapunov–Krasovskii functional（LKF）, sufficient conditions for delay-dependent robust H∞control criteria are obtained in terms of linear matrix inequalities（LMIs）. The advantage of the proposed method is illustrated by numerical examples. The results are also compared with the existing results to show the less conservativeness.
文摘Taking the sectional area and the bending moment of inertia as variables for each beam element, the plane frame will possess a stiffness matrix containing parameters.In terms of the symbolic computation software, the inverse matrix is solved to obtain the new analytical solution with respect ic characteristics of elements cross-section.The general program is coded in the microcomputer and corresponding exmpales are computed.
基金supported by Open Fund of Engineering Laboratory of Spatial Information Technology of Highway Geological Disaster Early Warning in Hunan Province(Changsha University of Science&Technology,kfj150602)Hunan Province Science and Technology Program Funded Projects,China(2015NK3035)+1 种基金the Land and Resources Department Scientific Research Project of Hunan Province,China(2013-27)the Education Department Scientific Research Project of Hunan Province,China(13C1011)
文摘Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.
基金supported by the National Natural Science Foundation of China(Grant No.62132020)the Major Project of ISCAS(ISCAS-ZD-202302).
文摘1 Introduction Compared with retraining,fine-tuning,and other traditional approaches,neural network repair approaches[1-7]can significantly improve the robustness of neural networks with lower time and computing cost.These repair techniques encode the anticipated performance of the repaired neural network into a Satisfiability Modulo Theories(SMT)problem and utilize an SMT solver to calculate a parameter matrix for the fully connected layer.This matrix can then be multiplied with the example feature vector to yield a vector that satisfies predetermined conditions.
基金supported by the National Natural Science Foundation of China (61201153)the National Basic Research Program of China (2012CB315805)the National Key Science and Technology Projects (2010ZX03004-002-02)
文摘Echo state network （ESN） has become one of the most popular recurrent neural networks （RNN） for its good prediction performance of non-linear time series and simple training process. But several problems still prevent ESN from becoming a widely used tool. The most prominent problem is its high complexity with lots of random parameters. Aiming at this problem, a minimum complexity ESN model （MCESN） was proposed. In this paper, we proposed a new wavelet minimum complexity ESN model （WMCESN） to improve the prediction accuracy and increase the practical applicability. Our new model inherits the characters of minimum complexity ESN model using the fixed parameters and simple circle topology. We injected wavelet neurons to replace the original neurons in internal reservoir and designed a wavelet parameter matrix to reduce the computing time. By using different datasets, our new model performed better than the minimum complexity ESN model with normal neurons, but only utilized tiny time cost. We also used our own packets of transmission control protocol （TCP） and user datagram protocol （UDP） dataset to prove that our model can deal with the data packet bit prediction problem well.
基金supported by the Guangdong Provincial Natural Science Foundation of China(No.2014A030313441)the Guangzhou Science and Technology Project(No.201510010169)+1 种基金the Guangdong Province Science and Technology Project(No.2016B090918071)the National Natural Science Foundation of China(No.61072028)
文摘With the continuous advancement of semiconductor technology, the interconnects crosstalk has had a great influence on the performances of VLSI circuits. To date, most of the research about the interconnects of VLSI circuits focus on the voltage-mode signaling （VMS） scheme while the current-mode signaling （CMS） scheme is rarely analyzed. First of all, an equivalent circuit model of two-line coupled interconnects is presented in this paper, which is applicable to both the CMS and VMS schemes. The coupling capacitive and mutual inductive are taken into account in the equivalent circuit model. Secondly, the output noise of CMS and VMS schemes are investigated in the paper according to the decoupling technique and A B CD parameter matrix approach at local level, intermediate level and global level, respectively. Moreover, the experimental results show that the CMS interconnects have lesser noise peak, noise width and noise amplitude than the VMS interconnects in the same cases, and the CMS scheme is especially suitable for the global interconnects communication of VLSI circuits. It is found that the results obtained by A B CD parameter matrix approach are in good accordance with the simulation results of the advanced design system.
