First,a class of strong limit theorems are proved by constructing two nonnegative martingales.Then they are applied to the study of all kinds of even-odd Markov chain fields and Markov chain fields defined in the pape...First,a class of strong limit theorems are proved by constructing two nonnegative martingales.Then they are applied to the study of all kinds of even-odd Markov chain fields and Markov chain fields defined in the paper.Finally,some strong limit theorems for the even-odd Markov chain fields and Markov chain fields are obtained.展开更多
Fishburn permutations are in bijection with several important combinatorial structures including interval orders.In this paper,we use the method of generating trees to enumerate two classes of pattern-avoiding Fishbur...Fishburn permutations are in bijection with several important combinatorial structures including interval orders.In this paper,we use the method of generating trees to enumerate two classes of pattern-avoiding Fishburn permutations subject to 7 classical statistics simultaneously.The classes of our interest are(321,312)-avoiding and(321,4123)-avoiding Fishburn permutations.The statistics of our interest are ascents,descents,inversions,right-to-left maxima,right-to-left minima,left-to-right maxima and left-to-right minima.Our results generalize a result by Egge.展开更多
There has been lack of an efficient design and evaluation method for the multistage star switching(MSSS) architecture in which the ports' rates of each switching element(SE) are unequal.Thus,we identify and propos...There has been lack of an efficient design and evaluation method for the multistage star switching(MSSS) architecture in which the ports' rates of each switching element(SE) are unequal.Thus,we identify and propose a special MSSS(SMSSS) model for the first time,where all special SEs,known as basic switching modules(BSMs),are connected hierarchically into a tree profile.Unlike the existing investigations,each BSM in this model is characterized by one highrate port and several low-rate ports.This study focuses on the analysis,design and optimization of the SMSSS model.Moreover,we propose a novel BSM cost model which relates to its flux factor considered rarely in existing studies.Two examples are demonstrated to obtain the optimal structure parameters of the SMSSS system with a minimum overall cost.The comparison of the proposed SMSSS with similar fat tree structures indicates its relative advantages.展开更多
[Objective] Taking the knowledge of tea-science field as research object,an extraction method for the taxonomic relation of ontology conception was proposed in the paper.[Method] Through improving the rule based on la...[Objective] Taking the knowledge of tea-science field as research object,an extraction method for the taxonomic relation of ontology conception was proposed in the paper.[Method] Through improving the rule based on language mode,generalized suffix tree was constructed for the concept set of tea-science field,forming hierarchical structure and taxonomic relation among conceptions.[Result and Conclusion] Moreover,corresponding prototype system was developed based on above method,and test result indicating that the method was effective.展开更多
Generalized Farey tree network （GFTN） and generalized Farey organized pyramid network （CFOPN） model are proposed, and their topological characteristics are studied by both theoretical analysis and numerical simula...Generalized Farey tree network （GFTN） and generalized Farey organized pyramid network （CFOPN） model are proposed, and their topological characteristics are studied by both theoretical analysis and numerical simulations, which are in good accordance with each other. Then weighted GFTN is studied using cumulative distributions of its Farey number value, edge weight, and node strength. These results maybe helpful for future theoretical development of hybrid models.展开更多
In this paper we consider the enumeration of subsets of the set, say Dm, of those Dyck paths of arbitrary length with maximum peak height equal to m and having a strictly increasing sequence of peak height （as one go...In this paper we consider the enumeration of subsets of the set, say Dm, of those Dyck paths of arbitrary length with maximum peak height equal to m and having a strictly increasing sequence of peak height （as one goes along the path）. Bijections and the methods of generating trees together with those of Riordan arrays are used to enumerate these subsets, resulting in many combinatorial structures counted by such well-known sequences as the Catalan nos., Narayana nos., Motzkin nos., Fibonacci nos., Schroeder nos., and the unsigned Stirling numbers of the first kind. In particular, we give two configurations which do not appear in Stanley＇s well-known list of Catalan structures.展开更多
With the growing popularity of the World Wide Web, large volume of useraccess data has been gathered automatically by Web servers and stored in Web logs. Discovering andunderstanding user behavior patterns from log fi...With the growing popularity of the World Wide Web, large volume of useraccess data has been gathered automatically by Web servers and stored in Web logs. Discovering andunderstanding user behavior patterns from log files can provide Web personalized recommendationservices. In this paper, a novel clustering method is presented for log files called Clusteringlarge Weblog based on Key Path Model (CWKPM), which is based on user browsing key path model, to getuser behavior profiles. Compared with the previous Boolean model, key path model considers themajor features of users'' accessing to the Web: ordinal, contiguous and duplicate. Moreover, forclustering, it has fewer dimensions. The analysis and experiments show that CWKPM is an efficientand effective approach for clustering large and high-dimension Web logs.展开更多
基金Supported by the Special Fundation of Tianjin Education Committee(2006ZH91)Supported by the Key Discipline of Applied Mathematics at Tianjin University of Commerce(X0803)
文摘First,a class of strong limit theorems are proved by constructing two nonnegative martingales.Then they are applied to the study of all kinds of even-odd Markov chain fields and Markov chain fields defined in the paper.Finally,some strong limit theorems for the even-odd Markov chain fields and Markov chain fields are obtained.
基金National Natural Science Foundation of China(Grant No.12171362)。
文摘Fishburn permutations are in bijection with several important combinatorial structures including interval orders.In this paper,we use the method of generating trees to enumerate two classes of pattern-avoiding Fishburn permutations subject to 7 classical statistics simultaneously.The classes of our interest are(321,312)-avoiding and(321,4123)-avoiding Fishburn permutations.The statistics of our interest are ascents,descents,inversions,right-to-left maxima,right-to-left minima,left-to-right maxima and left-to-right minima.Our results generalize a result by Egge.
基金supported by the National High-Tech Development Project (2012AA01A505)Key Issues of Terabit PTN Equipment R&D from the Ministry of Industry and Information Technology
文摘There has been lack of an efficient design and evaluation method for the multistage star switching(MSSS) architecture in which the ports' rates of each switching element(SE) are unequal.Thus,we identify and propose a special MSSS(SMSSS) model for the first time,where all special SEs,known as basic switching modules(BSMs),are connected hierarchically into a tree profile.Unlike the existing investigations,each BSM in this model is characterized by one highrate port and several low-rate ports.This study focuses on the analysis,design and optimization of the SMSSS model.Moreover,we propose a novel BSM cost model which relates to its flux factor considered rarely in existing studies.Two examples are demonstrated to obtain the optimal structure parameters of the SMSSS system with a minimum overall cost.The comparison of the proposed SMSSS with similar fat tree structures indicates its relative advantages.
文摘[Objective] Taking the knowledge of tea-science field as research object,an extraction method for the taxonomic relation of ontology conception was proposed in the paper.[Method] Through improving the rule based on language mode,generalized suffix tree was constructed for the concept set of tea-science field,forming hierarchical structure and taxonomic relation among conceptions.[Result and Conclusion] Moreover,corresponding prototype system was developed based on above method,and test result indicating that the method was effective.
基金supported by the Nature Science Foundation of China under Grand Nos. 70431002, 60874087, 60773120, and 10647001the Nature Science Foundation of Beijing under Grand No. 4092040
文摘Generalized Farey tree network （GFTN） and generalized Farey organized pyramid network （CFOPN） model are proposed, and their topological characteristics are studied by both theoretical analysis and numerical simulations, which are in good accordance with each other. Then weighted GFTN is studied using cumulative distributions of its Farey number value, edge weight, and node strength. These results maybe helpful for future theoretical development of hybrid models.
文摘In this paper we consider the enumeration of subsets of the set, say Dm, of those Dyck paths of arbitrary length with maximum peak height equal to m and having a strictly increasing sequence of peak height （as one goes along the path）. Bijections and the methods of generating trees together with those of Riordan arrays are used to enumerate these subsets, resulting in many combinatorial structures counted by such well-known sequences as the Catalan nos., Narayana nos., Motzkin nos., Fibonacci nos., Schroeder nos., and the unsigned Stirling numbers of the first kind. In particular, we give two configurations which do not appear in Stanley＇s well-known list of Catalan structures.
文摘With the growing popularity of the World Wide Web, large volume of useraccess data has been gathered automatically by Web servers and stored in Web logs. Discovering andunderstanding user behavior patterns from log files can provide Web personalized recommendationservices. In this paper, a novel clustering method is presented for log files called Clusteringlarge Weblog based on Key Path Model (CWKPM), which is based on user browsing key path model, to getuser behavior profiles. Compared with the previous Boolean model, key path model considers themajor features of users'' accessing to the Web: ordinal, contiguous and duplicate. Moreover, forclustering, it has fewer dimensions. The analysis and experiments show that CWKPM is an efficientand effective approach for clustering large and high-dimension Web logs.
