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 > Basic-Subject-of-Information-Science-and-System-Science

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

Results per page:

70 Total, 7 Pages | << First < Previous 3 4 5 6 7 Next > Last >>

Select Subject

All (8830)

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)

Third-level Subject

Cybernetics(9)
Other Subjects of Basic S...(12)
System Theory(2)

Rank

Results per page:

70 Total, 7 Pages | << First < Previous 3 4 5 6 7 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 stability of Markovian jumping genetic regulatory netwroks with mode-dependent delays
	Zhang Wenbing,Fang Jianan ,Tang Yang
	Information Science and System Science 01 October 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, the robust stability analysis problem is investigated for a class of Markovian jumping genetic regulatory networks with parameter uncertainties and mode-dependent delays, which varies randomly according to the Markov state and exist in both translation and feedback regulation processes. The purpose of the addressed stability analysis problem is to establish some easily verifiable conditions under which the Markovian jumping genetic regulatory networks with parameter uncertainties and mode-dependent delays is asymptotically stable. By utilizing a new Lyapunov functional and a lemma, we derive delay-dependent sufficient conditions ensuring the robust stability of the gene regulatory networks in the form of linear inequalities. Illustrative examples are exploited to show the effectiveness of the derived LMIs(linear matrix inequalities)-based stability conditions.
	TO cite this article:Zhang Wenbing,Fang Jianan ,Tang Yang . Robust stability of Markovian jumping genetic regulatory netwroks with mode-dependent delays[OL].[ 1 October 2010] http://en.paper.edu.cn/en_releasepaper/content/4387185


	2. Discrete Particle Swarm Optimization for Terminal Assignment Problems
	WANG Jiahai,CAI Yiqiao
	Information Science and System Science 19 August 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA), named DPSO-EDA, for terminal assignment problem (TEAP). EDAs sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from personal best solutions of all particles into the PSO, and therefore each particle has comprehensive learning and search ability. Simulation results on several problem instances show that the DPSO-EDA is better than previous methods.
	TO cite this article:WANG Jiahai,CAI Yiqiao. Discrete Particle Swarm Optimization for Terminal Assignment Problems[OL].[19 August 2010] http://en.paper.edu.cn/en_releasepaper/content/4382268

Saved Papers

Saved Papers


	3. Natural Connectivity of Complex Networks
	Wu Jun,M Barahona,Deng Hongzhong,Tan Yuejin
	Information Science and System Science 11 May 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The concept of natural connectivity is reported as a robustness measure of complex networks. The natural connectivity has a clear physical meaning and a simple mathematical formulation. It is shown that the natural connectivity can be derived mathematically from the graph spectrum as an average eigenvalue and that it changes strictly monotonically with the addition or deletion of edges. By comparing the natural connectivity with other typical robustness measures within a scenario of edge elimination, it is demonstrated that the natural connectivity has an acute discrimination which agrees with our intuition.
	TO cite this article:Wu Jun,M Barahona,Deng Hongzhong, et al. Natural Connectivity of Complex Networks[OL].[11 May 2010] http://en.paper.edu.cn/en_releasepaper/content/4371847


	4. A fictitious play approach for minimizing the total weighted tardiness in a job shop
	Gu Hanyu ,Tao Jiping ,Xi Yugeng
	Information Science and System Science 30 April 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A noncooperative game model is established for the job shop scheduling problem of minimizing total weighted tardiness. Fictitious play is used to compute the Nash-equilibrium (NE). Then by exploiting the equivalence of the NE of the proposed game model and the optimal solutions of the Lagrangian dual problem and its linear programming dual problem, $\\alpha$-point idea is applied to construct feasible schedules. Furthermore a simple local search method is designed to further improve the schedule performance. Numerical results on classical benchmark instances demonstrate the effectiveness of the proposed algorithm.
	TO cite this article:Gu Hanyu ,Tao Jiping ,Xi Yugeng . A fictitious play approach for minimizing the total weighted tardiness in a job shop[OL].[30 April 2010] http://en.paper.edu.cn/en_releasepaper/content/42513


	5. TWO DIMENSIONAL DIRECTION-OF-ARRIVAL ESTIMATION
	Guangmin Wang,Jingmin Xin,Nanning Zheng
	Information Science and System Science 28 April 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper proposes a new computationally efficient method for two-dimensional (2-D) direction-of-arrivals (DOAs) estimation of multiple correlated narrowband signals impinging on an L-shaped sensor array structured by two uniform linear arrays (ULAs). In the proposed method, the azimuth and evaluation angles are estimated independently from the cross-correlation matrices between the received data of two ULA subarrays by linear operation, and then the pair-matching of estimated azimuth and evaluation angles can be accomplished by using the correlation matrix of the combined received data of these subarrays. Since the eigen-decomposition is avoided, the proposed DOA estimation method has less computational complexity and better estimation performance than the existing methods. Furthermore the effectiveness of the proposed method is verified through numerical examples.
	TO cite this article:Guangmin Wang,Jingmin Xin,Nanning Zheng. TWO DIMENSIONAL DIRECTION-OF-ARRIVAL ESTIMATION[OL].[28 April 2010] http://en.paper.edu.cn/en_releasepaper/content/42464


	6. On Convergence of the Entropy Rate of Binary Hidden Markov Processes
	Shuangping Chen
	Information Science and System Science 05 January 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:How fast does the entropy rate of a hidden Markov process converge to its theoretical value? Empirically, several examples have shown that the convergence is exponential, but there does not have a theoretical proof. In this paper, a special kind of binary hidden Markov processes (BHMPs) is shown to be related to cookie-cutter sets. As a result, the entropy rate of these BHMPs could be studied based on the theoretical results of cookie-cutter sets. It is proved that the estimated bias of entropy rate of such BHMPs decreases at least exponentially to zero. These conclusions are important in both theoretical and practical terms.
	TO cite this article:Shuangping Chen. On Convergence of the Entropy Rate of Binary Hidden Markov Processes[OL].[ 5 January 2010] http://en.paper.edu.cn/en_releasepaper/content/38466


	7. Estimators for the Entropy Rate of Binary Hidden Markov Processes
	Chen Shuangping,Li Jun,Zheng Haoran
	Information Science and System Science 04 January 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The entropy rate of a hidden Markov process (HMP) is important in theory and practical applications, but it is hard to get an analytical expression or obtain a numerical estimator. In this paper, a new series of formulas for the bounds on the entropy rate of a special kinds of binary hidden Markov processes (BHMPs) are described. The convergence of the bounds is proved. Based on the convergence, several estimators have been advanced, of which the maximal error can be estimated. An algorithm for calculating the entropy rate has been provided and the numerical precision of entropy rate could be adjusted through a parameter of the algorithm. The bounds and estimators provide a numerical approach to approximate the entropy rate at any precision, which casts light on computing the entropy rate of more generalized HMPs.
	TO cite this article:Chen Shuangping,Li Jun,Zheng Haoran. Estimators for the Entropy Rate of Binary Hidden Markov Processes[OL].[ 4 January 2010] http://en.paper.edu.cn/en_releasepaper/content/38427


	8. Congruence Relations on Lattice Implication Algebras
	Liu Yi,Xu Yang
	Information Science and System Science 31 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Lattice implication algebra is an important logic algebra, congruence relations is one of important contents in it. The basic properties and the structures of general congruence relations on lattice implication algebras are discussed; The results that a lattice implication algebra is congruence-permutable is obtained; At last, properties of congruence relations on finite lattice implication algebras are discussed.
	TO cite this article:Liu Yi,Xu Yang. Congruence Relations on Lattice Implication Algebras[OL].[31 December 2009] http://en.paper.edu.cn/en_releasepaper/content/38355


	9. Semantic Dictionary based on Hudong Online Encyclopedia
	Yang Zhaojun ,Yu Nenghai
	Information Science and System Science 11 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, Semantic Dictionary has been proposed to handle with the problem – which keywords should I put in that search box to find out the information I really need? Semantic Dictionary is a dynamic dictionary that takes advantage of, and is in fact built from, the huge database of tags available on the web, like Wikipedia[1] , Hudong[2] encyclopedia etc. When a user types in a search term, Semantic Dictionary automatically retrieves a set of semantically related terms which are not just limited to a specific search term [3]. This method [4] significantly saves users’ time by avoiding multiple search keywords that are usually required in traditional ones. We present experiment on using Hudong online encyclopedia in Chinese to compute semantic relatedness and build Semantic Dictionary.
	TO cite this article:Yang Zhaojun ,Yu Nenghai . Semantic Dictionary based on Hudong Online Encyclopedia[OL].[11 December 2009] http://en.paper.edu.cn/en_releasepaper/content/37455


	10. Enhancing array stochastic resonance in excitable neuronal systems through both internal noise and external noise
	Duan Fabing ,Xu Xiaolong
	Information Science and System Science 20 January 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A summing network of FitzHugh-Nagumo model neurons is studied in the context of array stochastic resonance. A noisy aperiodic input, assisted by collective internal array noise, stimulates the summing network for a more efficient response. This form of array stochastic resonance is characterized by a correlation coefficient, and demonstrates the beneficial strategies of both external noise and internal noise.
	TO cite this article:Duan Fabing ,Xu Xiaolong . Enhancing array stochastic resonance in excitable neuronal systems through both internal noise and external noise[OL].[20 January 2009] http://en.paper.edu.cn/en_releasepaper/content/28084

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