Chinese︱Feedback︱Save this page

Login︱Register

• Elaborating Academic Views 　　　　 • Exchanging Innovative Ideas
• Protecting Intellectual Properties 　　• Fast Sharing Science Papers

Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China

Home > Papers > Information-Science-and-System-Science

There are 236 papers published in subject: since this site started.

Results per page:

236 Total, 24 Pages | << First < Previous 11 12 13 14 15 16 17 Next > Last >>

Select Subject

All (8831)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

Second-level Subject

Analysis on System Assess...(3)
Basic Subject of Informat...(72)
Control Theory(103)
Other Subjects of Informa...(20)
System Engineering(8)
Systematology, Differenti...(14)
Systems Engineering Metho...(20)

Rank

Results per page:

236 Total, 24 Pages | << First < Previous 11 12 13 14 15 16 17 Next > Last >>

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.


	1. Robust observer for a class of linear system with matched uncertainty based on LMI
	CHEN Fengxiang,LIU Lin,SU Zhou,ZHANG Tong
	Information Science and System Science 16 July 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, a novel framework of robust observer for linear system with parametric uncertain state matrix matched with output matrix is introduced. The scheme is derived by including an extra term to the feedback gain, and the term is obtained by the analysis of the Lyapunov stability theory and LMI (Linear Matrix Inequality). The proposed observer is less conservative and thus lead to a low gain matrix based on the novel framework. Finally, the effectiveness of the proposed method is validated by the numerical simulations on Matlab environment.
	TO cite this article:CHEN Fengxiang,LIU Lin,SU Zhou, et al. Robust observer for a class of linear system with matched uncertainty based on LMI[OL].[16 July 2012] http://en.paper.edu.cn/en_releasepaper/content/4484858


	2. The Balanceability of FRR Switching Control Policy for GSS Systems
	Wang Xingxuan
	Information Science and System Science 24 April 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The generalized switched server (GSS) system model have been proposed to address the load balancing problems for multi-units systems with input constraint, which widely exist in engineering practices. In GSS system, a switching control scheme is adopted for system balancing control. The balanceability of a switching control policy investigates the problem whether or not the GSS system could be driven to balancing status by the policy. This paper mainly concerns with the balanceabililty of the FRR policy, with a focus on the cases where the number of the parallel units is three. Different from the previous proof, a new and more simple proof for the balanceability of the FRR switching control policy is established.
	TO cite this article:Wang Xingxuan . The Balanceability of FRR Switching Control Policy for GSS Systems[OL].[24 April 2012] http://en.paper.edu.cn/en_releasepaper/content/4473482

Saved Papers

Saved Papers


	3. Optimization-based Structure Identification of Complex Dynamical Networks
	He Tao ,Lv Xiliang ,Wu Xiaoqun,Lu Junan ,Zheng Weixing
	Information Science and System Science 08 April 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The topological structure of a complex network plays a pivotal part in itsproperties, dynamics and control. Thus, understanding and modeling thestructure of a complex network will lead to a better knowledge of itsevolutionary mechanisms and to a better cottoning on its dynamical andfunctional behaviors. However, in many practical situations, thetopological structure of a complex network is usually unknown or uncertain.Thus, exploring the underlying topological structure of a complex networkis of great value. In recent years, there has been a growing interest instructure identification of complex dynamical networks. As a result, variousmethods for identifying the network structure have been proposed. However,in most of the previous work, few of them were discussed in the perspectiveof optimization. In this paper, an optimization algorithm based on theprojected conjugate gradient method is proposed to identify a networkstructure. It is straightforward and applicable to networks with or withoutobservation noise. Furthermore, the proposed algorithm is also applicable tocomplex networks with partially observed component variables for eachmultidimensional node. Numerical experiments are conducted to illustrate thegood performance and universality of the new algorithm.
	TO cite this article:He Tao ,Lv Xiliang ,Wu Xiaoqun, et al. Optimization-based Structure Identification of Complex Dynamical Networks[OL].[ 8 April 2012] http://en.paper.edu.cn/en_releasepaper/content/4474570


	4. Adaptive Control for A Class of Nonlinear Uncertain Dynamical Systems via Basis Functions Involving A Linear Growth Bound
	Zhang Jie,Wang Xingxuan
	Information Science and System Science 30 March 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper presents a nonlinear adaptive control framework for a class of nonlinear uncertain dynamical systems with time-varying that guarantees ultimately bounded of the closed-loop systems. In particular, it develops both full-state feedback control law and output feedback law via basis functions involving a linear growth bound. By analyzing a Lyapunov-like function, it shows that the framework guarantees ultimately bounded of the closed-loop systems.
	TO cite this article:Zhang Jie,Wang Xingxuan. Adaptive Control for A Class of Nonlinear Uncertain Dynamical Systems via Basis Functions Involving A Linear Growth Bound[OL].[30 March 2012] http://en.paper.edu.cn/en_releasepaper/content/4473597


	5. A Kalman-Filter-Based Approach to Identification of SARX Systems
	Xiong Jie,Zhou Tong
	Information Science and System Science 27 March 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Identification of switching autoregressive exogenous (SARX) systemsis discussed in this paper. On the basis of a relation between theKalman filter and recursive least squares (RLS) estimation, it isshown that when external noises are white and Gaussian, then,some stochastic processes can be constructed whichare white if and only if experimental data are generated by the samesub-ARX model. Based on this observation, a method is developed toidentify switching times of a SARX system, and a procedure formerging experimental data generated by the same sub-model isobtained. Using these merged data, estimation of sub-models can becarried out by resorting to standard linear identificationtechniques. As a main feature, the obtained SARX systemidentification algorithm depends neither on the number of sub-models nor onthe order of each sub-model. Some numericalexperimental results are also included to illustrate theeffectiveness of the proposed algorithm.
	TO cite this article:Xiong Jie,Zhou Tong. A Kalman-Filter-Based Approach to Identification of SARX Systems[J].


	6. Robust Regional Bounding Sphere Representation for 3D Face Recognition
	MING Yue,RUAN Qiuqi
	Information Science and System Science 12 March 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A robust regional bounding sphere representation (RRBSR) is introduced to facilitate 3D face recognition. In our framework, we first segment a group of regions on each 3D facial point cloud by curvature information and facial shape characteristics. Then, the extracted regions are projected on the bounding spherical bands in order to reflect the distinctive shape information of facial different regions. Next, an orthogonal regional and global regression (ORGR) is utilized to extract the discriminant feature vectors. Experimental results based on the different 3D face databases demonstrate that balancing regional and global facial characteristics allow for the high-qualified performance. Compared with the previous popular approaches, our framework has a consistently better performance in terms of effectiveness, robustness, and universality.
	TO cite this article:MING Yue,RUAN Qiuqi. Robust Regional Bounding Sphere Representation for 3D Face Recognition[OL].[12 March 2012] http://en.paper.edu.cn/en_releasepaper/content/4469491


	7. Switching rules design for DC-DC Boost Converters
	YANG Yang,XIANG Zhengrong
	Information Science and System Science 11 March 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A Boost converter modeled as switched affine linear system is mainly discussed in this paper. After building the model, a novel switching rule is proposed, which stabilizes the systems by choosing an active subsystem such that the state trajectory converges to the desired equilibrium point. In addition, a clock delay scheme is designed to solve the phenomenon of sliding modes in the switching strategy and make sure that the working frequency of the system is constant when the system is steady-state. Simulation results for a Boost converter have verified the validity of this method.
	TO cite this article:YANG Yang,XIANG Zhengrong. Switching rules design for DC-DC Boost Converters[OL].[11 March 2012] http://en.paper.edu.cn/en_releasepaper/content/4471190


	8. A centrality measure of complex networks based on information flow
	CHEN Guoqiang,WANG Yuping
	Information Science and System Science 03 March 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A new centrality measure for complex networks, called information flow centrality, is proposed in this paper. This centrality measure is based on the concept of the information flow in networks. It can be applicable to not only the connect networks, but also the disconnect networks. Moreover, it overcomes some disadvantages of several often used centrality measures. The performance of the proposed measure is compared with the standard centrality measures using a classic dataset and the results indicate the proposed measure performs more reasonable.
	TO cite this article:CHEN Guoqiang,WANG Yuping. A centrality measure of complex networks based on information flow[OL].[ 3 March 2012] http://en.paper.edu.cn/en_releasepaper/content/4468479


	9. An Efficient Systematic Encoder for Low-rate Blaum-Roth Codes
	Guo Qian,Kan Haibin
	Information Science and System Science 19 February 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Blaum-Roth codes, i.e., Reed-Solomon(RS) codes over the polynomial rings modulo sum_{i=0}^{p-1}x^{i} over GF(q), where p is a prime, is a family of maximum distance separable(MDS) array codes, which has important applications in storage systems, such as magnetic tapes, RAID architectures and distributed file systems. Compared to EVENODD codes or other existing coding schemes used in storage systems, low-rate Blaum-Roth codes seems more applicable when the size of the storage nodes becomes large and the erasures appear frequently.In this paper, we propose a new systematic encoding procedure for Blaum-Roth codes. Our method generalizes the interpolation-based erasure-only decoder for RS codes proposed by D.J.J. Versfeld et al., which is efficient for low-rate RS codes. Later, we derive a systematic encoder from this decoder, since encoding can be implemented as a special case of decoding. Compared to the systematic encoding procedure introduced by M. Blaum and R. Roth, our encoding procedure is much more efficient for low-rate Blaum-Roth codes.
	TO cite this article:Guo Qian,Kan Haibin. An Efficient Systematic Encoder for Low-rate Blaum-Roth Codes[OL].[19 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4467399


	10. On Comparisons of Expected Performance Between Two Worst-case Optimal Floating Codes in Flash Memories
	Guo Qian,Kan Haibin
	Information Science and System Science 19 February 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Floating codes are codes for multi-level flash memories that can be modeled well as Write Asymmetric Memory (WAM). There are two criteria to evaluate the optimality of floating codes, i.e., worst-case and average-case performance, and researchers have proposed various optimal floating codes in the sense of worst-case and average-case, respectively. However, little research has been focused on constructing optimal rewriting codes in the sense of both criteria. In this paper, we compare the expected performance between two worst-case optimal floating codes for two bits, i.e., the YVSW and JBB codes and show that the YVSW codes has better expected performance than the JBB one, although they are both worst-case optimal. So the YVSW codes is a better choice when we look for floating codes in the sense of both worst-case and average-case criteria.
	TO cite this article:Guo Qian,Kan Haibin. On Comparisons of Expected Performance Between Two Worst-case Optimal Floating Codes in Flash Memories[OL].[19 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4467372

	Check out RSS, or use RSS reader to subscribe this item