A fast MUltiple SIgnal Classification (MUSIC) spectrum peak search algorithm is devised, which regards the power of the MUSIC spectrum function as target distribution up to a constant of proportionality, and uses Metr...A fast MUltiple SIgnal Classification (MUSIC) spectrum peak search algorithm is devised, which regards the power of the MUSIC spectrum function as target distribution up to a constant of proportionality, and uses Metropolis-Hastings (MH) sampler, one of the most popular Markov Chain Monte Carlo (MCMC) techniques, to sample from it. The proposed method reduces greatly the tremendous computation and storage costs in conventional MUSIC techniques i.e., about two and four orders of magnitude in computation and storage costs under the conditions of the experiment in the paper respectively.展开更多
The Internet presents numerous sources of useful information nowadays. However, these resources are drowning under the dynamic Web, so accurate finding user-specific information is very difficult. In this paper we dis...The Internet presents numerous sources of useful information nowadays. However, these resources are drowning under the dynamic Web, so accurate finding user-specific information is very difficult. In this paper we discuss a Semantic Graph Web Search (SGWS) algorithm in topic-specific resource discovery on the Web. This method combines the use of hyperlinks, characteristics of Web graph and semantic term weights. We implement the algorithm to find Chinese medical information from the Internet. Our study showed that it has better precision than traditional IR (Information Retrieval) methods and traditional search engines. Key words HITS - evolution web graph - power law distribution - context analysis CLC number TP 391 - TP 393 Foundation item: Supported by the National High-Performance Computation Fund (00303)Biography: Ye Wei-guo (1970-), male, Ph. D candidate, research direction: Web information mining, network security, artificial intelligence.展开更多
Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper...Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper bound of the 2-competition2 index of a primitive digraph with exact d loops in this article.Moreover,the maximum index problem and the index set problem for the 2-competition index of primitive digraphs with minimally strong digraphs were settled.展开更多
Conventional analysis methods of cable structures do not consider sliding of cables inside the joint,which may lead to inaccuracy of the theoretical behavior of the structure.In order to develop an effective method fo...Conventional analysis methods of cable structures do not consider sliding of cables inside the joint,which may lead to inaccuracy of the theoretical behavior of the structure.In order to develop an effective method for cable sliding,a two-node cable element based on the analytical solution for an elastic catenary was studied.The cable sliding stiffness and the effect of friction were investigated.To validate the proposed numerical method,analyses of two examples given in the literature were conducted.The results demonstrated that the method given in this paper is accurate and effective,and can take into account cable sliding in cable structures.In addition,it was shown that the effect of cable sliding on the behavior of cable structures is significant.It was also shown that the friction at the support hampers the flow of the cable force,leading to unequal cable tensions on both sides of the support.展开更多
This paper considers a discrete-time Geo/G/1 retrial queue where the retrial time has a general distribution and the server is subject to Bernoulli vacation policy. It is assumed that the server, after each service co...This paper considers a discrete-time Geo/G/1 retrial queue where the retrial time has a general distribution and the server is subject to Bernoulli vacation policy. It is assumed that the server, after each service completion, begins a process of search in order to find the following customer to be served with a certain probability, or begins a single vacation process with complementary probability. This paper analyzes the Markov chain underlying the queueing system and obtain its ergodicity condition. The generating functions of the number of customers in the orbit and in the system are also obtained along with the marginal distributions of the orbit size when the server is idle, busy or on vacation. Finally, the author gives two stochastic decomposition laws, and as an application the author gives bounds for the proximity between the system size distributions of the model and the corresponding model without retrials.展开更多
基金Supported by the National Natural Science Foundation of China (No.60172028).
文摘A fast MUltiple SIgnal Classification (MUSIC) spectrum peak search algorithm is devised, which regards the power of the MUSIC spectrum function as target distribution up to a constant of proportionality, and uses Metropolis-Hastings (MH) sampler, one of the most popular Markov Chain Monte Carlo (MCMC) techniques, to sample from it. The proposed method reduces greatly the tremendous computation and storage costs in conventional MUSIC techniques i.e., about two and four orders of magnitude in computation and storage costs under the conditions of the experiment in the paper respectively.
文摘The Internet presents numerous sources of useful information nowadays. However, these resources are drowning under the dynamic Web, so accurate finding user-specific information is very difficult. In this paper we discuss a Semantic Graph Web Search (SGWS) algorithm in topic-specific resource discovery on the Web. This method combines the use of hyperlinks, characteristics of Web graph and semantic term weights. We implement the algorithm to find Chinese medical information from the Internet. Our study showed that it has better precision than traditional IR (Information Retrieval) methods and traditional search engines. Key words HITS - evolution web graph - power law distribution - context analysis CLC number TP 391 - TP 393 Foundation item: Supported by the National High-Performance Computation Fund (00303)Biography: Ye Wei-guo (1970-), male, Ph. D candidate, research direction: Web information mining, network security, artificial intelligence.
基金National Natural Science Foundations of China(No.11272100,No.50865001)
文摘Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper bound of the 2-competition2 index of a primitive digraph with exact d loops in this article.Moreover,the maximum index problem and the index set problem for the 2-competition index of primitive digraphs with minimally strong digraphs were settled.
基金supported by the National Natural Science Foundation of China (Grant No. 50478075)Jiangsu "Six Top Talents" Program (Grant No. 07-F-008)+1 种基金Scientific Research Foundation of Graduate School of Southeast University (Grant No. YBJJ0817)a Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions
文摘Conventional analysis methods of cable structures do not consider sliding of cables inside the joint,which may lead to inaccuracy of the theoretical behavior of the structure.In order to develop an effective method for cable sliding,a two-node cable element based on the analytical solution for an elastic catenary was studied.The cable sliding stiffness and the effect of friction were investigated.To validate the proposed numerical method,analyses of two examples given in the literature were conducted.The results demonstrated that the method given in this paper is accurate and effective,and can take into account cable sliding in cable structures.In addition,it was shown that the effect of cable sliding on the behavior of cable structures is significant.It was also shown that the friction at the support hampers the flow of the cable force,leading to unequal cable tensions on both sides of the support.
基金supported by the National Natural Science Foundation of China under Grant No.11171019the Fundamental Research Funds for the Central Universities under Grant No.2011JBZ012the Program for New Century Excellent Talents in University under Grant No.NCET-11-0568
文摘This paper considers a discrete-time Geo/G/1 retrial queue where the retrial time has a general distribution and the server is subject to Bernoulli vacation policy. It is assumed that the server, after each service completion, begins a process of search in order to find the following customer to be served with a certain probability, or begins a single vacation process with complementary probability. This paper analyzes the Markov chain underlying the queueing system and obtain its ergodicity condition. The generating functions of the number of customers in the orbit and in the system are also obtained along with the marginal distributions of the orbit size when the server is idle, busy or on vacation. Finally, the author gives two stochastic decomposition laws, and as an application the author gives bounds for the proximity between the system size distributions of the model and the corresponding model without retrials.
