检索结果-南通市图书馆

Near generalized balanced tournament designs with block sizes 4 and 5

在线全文

学校读者我要写书评

暂无评论

Science china mathematics 2009年第9期52卷 1927-1938页

作者： SHAN XiuLing1, 2 1 department of mathematics, beijing jiaotong university, beijing 100044, china 2 College of mathematics and Information Science, Hebei Normal university, Shijiazhuang 050016, china department of mathematics Beijing Jiaotong University Beijing China College of mathematics and Information Science Hebei Normal University Shijiazhuang China

A near generalized balanced tournament design, or an NGBTD(k,m) in short, is a (km+1,k,k-1)-BIBD defined on a (km+1)-set V . Its blocks can be arranged into an m×(km+1) array in such a way that (1) the blocks in every column of the array form a partial parallel class partitioning V\{x} for some point x, and (2) every element of V is contained in precise k cells of each row. In this paper, we completely solve the existence of NGBTD(4,m) and almost completely solve the existence of NGBTD(5,m) with four exceptions.

关键词： near generalized balanced tournament designs frame generalized doubly resolvable packing constructions existence

Estimates for eigenvalues of Laplacian operator with any order

在线全文

学校读者我要写书评

暂无评论

Science china mathematics 2007年第8期50卷 1078-1086页

作者： Fa-en WU~(1+) Lin-fen CAO~2 1 department of mathematics,beijing jiaotong university,beijing 100044,china 2 department of mathematics,Henan Normal university,Xinxiang 453007,china department of mathematics Beijing Jiaotong University Beijing China department of mathematics Henan Normal University Xinxiang China

Let D be a bounded domain in an n-dimensional Euclidean space Rn.Assume that 01≤λ2≤…≤λk≤…are the eigenvalues of the Dirichlet Laplacian operator with any order l: （-△）lu=λu,in D u=■=…=■=0,on■■D. Then we obtain an upper bound of the（k+1）-th eigenvalueλk+1in terms of the first k eigenvalues. sum from i=1 to k(λk+1-λi)≤（1/n）[4l（n+2l-2）]1/2{sum from i=1 to k(λk+1-λi)1/2λil-1/lsum from i=1 to k(λk+1-λi)1/2λi1/l}1/2. This ineguaiity is independent of the domain ***,for any l≥3 the above inequality is better than all the known *** rusults are the natural generalization of inequalities corre- sponding to the case l=2 considered by Qing-Ming Cheng and Hong-Cang *** l=1,our inequalities imply a weaker form of Yang *** aslo reprove an implication claimed by Cheng and Yang.

关键词： Dirichlet problem eigenvalue estimate Laplacian operator

The genus distributions for a certain type of permutation graphs in orientable surfaces

在线全文

学校读者我要写书评

暂无评论

Science china mathematics 2007年第12期50卷 1748-1754页

作者： Rong-xia HAO~(1+) Wei-li HE~1 Yan-pei LIU~1 Er-ling WEI~2 ~1 department of mathematics,beijing jiaotong university,beijing 100044,china ~2 School of Information,Renmin university of china,beijing 100872,china department of mathematics Beijing Jiaotong University Beijing China School of Information Renmin University of China Beijing China

A circuit is a connected nontrivial 2-regular graph. A graph G is a permutation graph over a circuit C, if G can be obtained from two copies of C by joining these two copies with a perfect matching. In this paper, based on the joint tree method introduced by Liu, the genus polynomials for a certain type of permutation graphs in orientable surfaces are given.

关键词： graph, genus distribution, genus, surfaces

Number of embeddings of circular and Mbius ladders on surfaces

在线全文

学校读者我要写书评

暂无评论

Science china mathematics 2010年第5期53卷 356-368页

作者： YANG Yan1 & LIU YanPei2 1department of mathematics,Tianjin university,Tianjin 300072,china 2department of mathematics,beijing jiaotong university,beijing 100044,china

There are many results on the flexibility of(general) embeddings of graphs,but few are known about that of strong *** this paper,we study the flexibility of strong embeddings of circular and Mbius ladders on the projective plane and the Klein bottle by using the joint tree model of *** numbers of(nonequivalent) general embeddings and strong embeddings of circular and Mbius ladders on these two nonorientable surfaces are obtained,*** the structures of those strong embeddings are described.

关键词： embedding strong embedding flexibility circular ladders Mbius ladders

Recommendation Method for Contrastive Enhancement of Neighborhood Information

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第1期78卷 453-472页

作者： Hairong Wang beijing Zhou Lisi Zhang He Ma School of Computer Science and Engineering North Minzu UniversityNingxia750021China

Knowledge graph can assist in improving recommendation performance and is widely applied in various person-alized recommendation ***,existing knowledge-aware recommendation methods face challenges such as weak user-item interaction supervisory signals and noise in the knowledge *** tackle these issues,this paper proposes a neighbor information contrast-enhanced recommendation method by adding subtle noise to construct contrast views and employing contrastive learning to strengthen supervisory signals and reduce knowledge ***,first,this paper adopts heterogeneous propagation and knowledge-aware attention networks to obtain multi-order neighbor embedding of users and items,mining the high-order neighbor informa-tion of users and ***,in the neighbor information,this paper introduces weak noise following a uniform distribution to construct neighbor contrast views,effectively reducing the time overhead of view *** paper then performs contrastive learning between neighbor views to promote the uniformity of view information,adjusting the neighbor structure,and achieving the goal of reducing the knowledge noise in the knowledge ***,this paper introduces multi-task learning to mitigate the problem of weak supervisory *** validate the effectiveness of our method,experiments are conducted on theMovieLens-1M,MovieLens-20M,Book-Crossing,and Last-FM *** results showthat compared to the best baselines,our method shows significant improvements in AUC and F1.

关键词： Contrastive learning knowledge graph recommendation method

Reliability analysis of M/G/1 queues with general retrial times and server breakdowns

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2006年第5期16卷 464-473页

作者： WANG Jinting (department of mathematics, beijing jiaotong university, beijing 100044, china) department of mathematics Beijing Jiaotong University Beijing 100044 China

This paper concerns the reliability issues as well as queueing analysis of M/G/1 retrial queues with general retrial times and server subject to breakdowns and repairs. We assume that the server is unreliable and customers who find the server busy or down are queued in the retrial orbit in accordance with a first-come-first-served discipline. Only the customer at the head of the orbit queue is allowed for access to the server. The necessary and sufficient condition for the system to be stable is given. Using a supplementary variable method, we obtain the Laplace-Stieltjes transform of the reliability function of the server and a steady state solution for both queueing and reliability measures of interest. Some main reliability indexes, such as the availability, failure frequency, and the reliability function of the server, are obtained.

关键词： retrial queues general retrial times reliability server breakdowns and repairs.

Techniques for searching first integrals by Lie group and application to gyroscope system

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china mathematics 2005年第8期48卷 1135-1143页

作者： HU Yanxia & GUAn Keying department of mathematics, School of Science, beijing jiaotong university, beijing 100044, china department of mathematics School of Science Beijing Jiaotong University Beijing China

In the paper, the methods of finding first integrals of an autonomous system using one-parameter Lie groups are discussed. A class of nontrivial one-parameter Lie groups admitted by the classical gyroscope system is found, and based on the properties of first integral determined by the one-parameter Lie group, the fourth first integral of the gyroscope system in Euler case, Lagrange case and Kovalevskaya case can be obtained in a uniform idea. An error on the fourth first integral in general Kovalevskaya case (A=B=2C,zG=0), which appeared in literature is found and corrected.

关键词： one-parameter Lie group first integral gyroscope system

ON THE LINEAR CONVERGENCE OF PC-METHOD FOR ACLASS OF LINEAR VARIATIONAL INEQUALITIES

在线全文

学校读者我要写书评

暂无评论

Journal of Computational mathematics 1999年第2期17卷 199-208页

作者： Nai-hua Xiu(department of mathematics, Nothern jiaotong university, beijing 100044, china Instituteof Applied mathematics, Chinese Academy Of Sciences, beijing 100080, china) 北方交通大学数学系北京

This paper studies the linear convergence properties of a class of the projection and contraction methods for the affine variational inequalities, and proposes a necessary and sufficient condition under which PC-Metho... 详细信息

关键词： affine variational inequality projection and contraction method linear convergence

ON THE SINGLE SERVER RETRIAL QUEUE WITH PRIORITY SUBSCRIBERS AND SERVER BREAKDOWNS

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2008年第2期21卷 304-315页

作者： Jinting WANG department of mathematics Beijing Jiaotong University Beijing 100044 China

作者与根据独立泊松流动到达的主要顾客的二种不同类型使可靠性评估以及再审队列的排队分析担心了。在堵住的情况中，而顾客的第二种类型必须离开服务区，但是在时间的某随机的时期以后回来再碰碰他们的运气，顾客的第一种类型能被排队... 详细信息

作者与根据独立泊松流动到达的主要顾客的二种不同类型使可靠性评估以及再审队列的排队分析担心了。在堵住的情况中，而顾客的第二种类型必须离开服务区，但是在时间的某随机的时期以后回来再碰碰他们的运气，顾客的第一种类型能被排队。作者假设服务者是不可靠的，它有一个服务类型依赖者，指数地分布式的生活时间以及一个服务类型依赖者，通常分布式的修理时间。为稳定的系统的必要、足够的条件被调查。用一个增补可变方法，作者为排队措施获得一个不变的解决方案，并且象兴趣的可靠性措施的不变的解决方案一样短暂。

关键词：优先权优先服务可靠性评价消费者经济学