期刊文献+
共找到18篇文章
< 1 >
每页显示 20 50 100
加权3-Set Packing问题的核心化 被引量:1
1
作者 李绍华 冯启龙 +1 位作者 王建新 陈建二 《计算机研究与发展》 EI CSCD 北大核心 2012年第8期1781-1786,共6页
Packing和Matching问题是一类重要的NP难解问题,该类问题的参数算法和核心化研究受到了人们广泛的关注.主要研究了加权3-SetPacking的核心化算法.对于加权3-SetPacking问题,基于对问题结构的深入分析,提出并证明了2个简化规则.首先限定... Packing和Matching问题是一类重要的NP难解问题,该类问题的参数算法和核心化研究受到了人们广泛的关注.主要研究了加权3-SetPacking的核心化算法.对于加权3-SetPacking问题,基于对问题结构的深入分析,提出并证明了2个简化规则.首先限定加权3-SetPacking问题实例中包含给定2个元素的集合的个数,然后在限定问题实例中包含1个给定元素的集合的个数.基于对集合个数的限定,得到问题实例中总的集合个数的上界.并基于上述性质得到2个简化规则,可得到加权3-SetPacking问题大小为27k3-36k2+12k的核,该核心化结果是加权3-SetPacking问题的首个核心化结果.得到的加权3-SetPacking的核心化过程同样适用于加权3D-Matching问题的核化,可得到与加权3-SetPacking问题同样大小的问题核. 展开更多
关键词 加权3-set PACKING 加权3D-Matching 核心化 局部简化 参数算法
在线阅读 下载PDF
3-Set Packing参数化计数问题的复杂性及近似算法
2
作者 刘运龙 《计算机科学》 CSCD 北大核心 2016年第9期23-26,共4页
3-Set Packing参数化计数问题即在一个3-Set Packing实例中统计所有大小为k的不同packing的个数。首先证明了该问题的计算复杂性是#W[1]-难的,表明该问题不大可能存在固定参数可解的精确算法(除非#W[1]=FPT)。然后,通过拓展3-D Matchin... 3-Set Packing参数化计数问题即在一个3-Set Packing实例中统计所有大小为k的不同packing的个数。首先证明了该问题的计算复杂性是#W[1]-难的,表明该问题不大可能存在固定参数可解的精确算法(除非#W[1]=FPT)。然后,通过拓展3-D Matching参数化计数问题的算法对3-Set Packing参数化计数问题提出了一个基于Monte-Carlo自适应覆盖算法和着色技术的随机近似算法。 展开更多
关键词 3-set PACKING 计数 复杂性 近似算法
在线阅读 下载PDF
Outer P(ρ,σ)-set’s Random Characteristic and Application
3
作者 ZHA NG Huan-li WANG Dong-mei 《Chinese Quarterly Journal of Mathematics》 CSCD 2014年第2期298-306,共9页
Based on the conception of P(ρ,σ)-set(XP ˉFρ, XPFσ), this paper studied the relation between outer P(ρ,σ)-set and outer P-set: give outer P(ρ,σ)-set and outer P-set relation theorem, outer P(ρ,σ)-set and nu... Based on the conception of P(ρ,σ)-set(XP ˉFρ, XPFσ), this paper studied the relation between outer P(ρ,σ)-set and outer P-set: give outer P(ρ,σ)-set and outer P-set relation theorem, outer P(ρ,σ)-set and numerical value σ relation theorem, outer P(ρ,σ)-set's range;studied other characteristics of outer P(ρ,σ)-set: give the finiteness theorem of outer P(ρ,σ)-set, the set chain theorem of outer P(ρ,σ)-set, the outer P(ρ,σ)-set probability interval finite partition theorem, and its corollary; also give generation, reduction, identification theorem of outer P(ρ,σ)-set, filter generation theorem of outer P(ρ,σ)-set; finally give its application. 展开更多
关键词 P-set outer P(ρ σ)-set FINITENESS finite partition PROBABILITY
在线阅读 下载PDF
On σ-c-propermutable Subgroups of Finite Groups
4
作者 MA Xiaojian MAO Yuemei 《数学进展》 北大核心 2025年第3期509-517,共9页
Let G be a finite group.A subgroup H of G is said to be σ-c-propermutable in G if G has a subgroup B such that G=N_(G)(H)B and for every Hall σ_(i)-subgroup B_(i) of B,there exists an element x∈B such that HB_(i)^(... Let G be a finite group.A subgroup H of G is said to be σ-c-propermutable in G if G has a subgroup B such that G=N_(G)(H)B and for every Hall σ_(i)-subgroup B_(i) of B,there exists an element x∈B such that HB_(i)^(x)=B_(i)^(x) H.In this paper,the influence of σ-c-propermutable subgroups on the structure of finite groups is investigated,and some criteria for a normal subgroup of G to be hypercyclically embedded in G are derived. 展开更多
关键词 complete Hallσ-set σ-c-propermutable subgroup supersoluble group hypercyclically embedded
原文传递
Space of Operators and Property (MB)
5
作者 Manijeh Esfahani Bahreini 《Advances in Pure Mathematics》 2016年第13期948-953,共6页
In this paper, a new class of Banach spaces, termed as Banach spaces with property (MB), will be introduced. It is stated that a space X has property (MB) if every V -subset of X* is an L-subset of X* . We describe th... In this paper, a new class of Banach spaces, termed as Banach spaces with property (MB), will be introduced. It is stated that a space X has property (MB) if every V -subset of X* is an L-subset of X* . We describe those spaces which have property (MB) . Also, we show that if a Banach space X has property (MB) and Banach space Y does not contain , then every operator is completely continuous. 展开更多
关键词 L-sets V -sets Completely Continuous Operators Unconditionally Converging Operators
在线阅读 下载PDF
AES算法攻击方法的改进 被引量:3
6
作者 曾游 戚文峰 《信息工程大学学报》 2003年第2期14-17,共4页
本文提出了一种改进AES攻击算法,通过调整轮变换的顺序,用密钥的变形形式,合理安排求取密钥的顺序,利用密钥相关性,最终减少了密钥穷尽量。以5轮AES为例,用改进算法求出全部第5轮密钥时,密钥穷尽量由原来4·240减少到240+232+216+9&... 本文提出了一种改进AES攻击算法,通过调整轮变换的顺序,用密钥的变形形式,合理安排求取密钥的顺序,利用密钥相关性,最终减少了密钥穷尽量。以5轮AES为例,用改进算法求出全部第5轮密钥时,密钥穷尽量由原来4·240减少到240+232+216+9·28。 展开更多
关键词 分组密码 AES算法 SQUARE攻击 -set 密钥相关性
在线阅读 下载PDF
冷芯盒法的现状与展望 被引量:4
7
作者 戴斌煜 《铸造》 CAS CSCD 北大核心 2002年第5期273-276,共4页
根据所用硬化气体的种类对冷芯盒法进行归类 ,叙述了冷芯盒法的工艺特点 ,适用范围及其应用现状 ,并对其发展前景进行了探讨。
关键词 冷芯盒法 三乙胺法 β-set 铸造 二氧化硫法 二氧化硫树脂法
在线阅读 下载PDF
Nonconstant Harmonic Functions on the Level 3 Sierpinski Gasket
8
作者 Donglei Tang Rui Hu 《Analysis in Theory and Applications》 2014年第4期417-424,共8页
We give a detailed description of nonconstant harmonic functions on the level 3 Sierpinski gasket. Then we extend the method onβ-set with 1/3〈β〈1/2.
关键词 Nonconstant harmonic function level 3 Sierpinski gasket β-set.
在线阅读 下载PDF
Induced Matching Number of the Plane Grid Graph
9
作者 LUXiao-xu PEIMing +1 位作者 YAOWei-li ZHOUJu 《Chinese Quarterly Journal of Mathematics》 CSCD 2004年第1期95-100,共6页
An induced matching M in a graph G is a matching such that V(M) induces a 1-regular subgraph of G. The induced matching number of a graph G, denoted by I M(G), is the maximum number r such that G has an induced matchi... An induced matching M in a graph G is a matching such that V(M) induces a 1-regular subgraph of G. The induced matching number of a graph G, denoted by I M(G), is the maximum number r such that G has an induced matching of r edges. Induced matching number of Pm×Pn is investigated in this paper. The main results are as follows:(1) If at least one of m and n is even, then IM(Pm×Pn=[(mn)/4].(2) If m is odd, then 展开更多
关键词 induced matching induced matching number α-set
在线阅读 下载PDF
Difference Sets of Null Density Subsets of N
10
作者 Dawoud Ahmadi Dastjerdi Maryam Hosseini 《Advances in Pure Mathematics》 2012年第3期195-199,共5页
Let , and for any , . If is positive, then B is considered as a large set with . Its difference set has both high density and rich structure. The set with is also relatively large and it is a long standing conjecture ... Let , and for any , . If is positive, then B is considered as a large set with . Its difference set has both high density and rich structure. The set with is also relatively large and it is a long standing conjecture that like sets with positive upper density they have arithmetic progression of arbitrary length. Here we show their difference set may not be substantial;for any there exists such that and . 展开更多
关键词 DIFFERENCE SET DENSITY -set
在线阅读 下载PDF
The Weighted Embedded Homology of Super-Hypergraphs
11
作者 WANG Chong 《Wuhan University Journal of Natural Sciences》 CSCD 2024年第6期523-528,共6页
In this paper,we define the weighted embedded homology of super-hypergraphs,give a quasi-partial order and a pseudo-metric on the set made up of all non-vanishing weights on a finite set,and clarify the relationship b... In this paper,we define the weighted embedded homology of super-hypergraphs,give a quasi-partial order and a pseudo-metric on the set made up of all non-vanishing weights on a finite set,and clarify the relationship between the torsion parts of weighted embedded homology with integer coefficients of super-hypergraphs under certain weights. 展开更多
关键词 -set super-hypergraph weighted embedded homology PSEUDO-METRIC
原文传递
A Note on Kuratowski’s Theorem and Its Related Topics
12
作者 K. P. Shum 《Advances in Pure Mathematics》 2017年第8期383-406,共24页
In point set topology, it is well known that the Kuratowski 14-set problem is one of the most interesting results. In this note, we first give a brief survey of the Kuratowski’s theorem. In particular, we will study ... In point set topology, it is well known that the Kuratowski 14-set problem is one of the most interesting results. In this note, we first give a brief survey of the Kuratowski’s theorem. In particular, we will study and investigate the structure of the boundary of a given subset in a topological space. Some new results and topics which are related to the theorem of Kuratowski are presented and discussed. Finally, we pose some open problems of Kuratowskitype. 展开更多
关键词 Kuratowski 14-set Kuratowski’s THEOREM
在线阅读 下载PDF
太重易地迁建炼铸钢车间设计
13
作者 朱吉禄 《中国铸造装备与技术》 CAS 2021年第4期73-82,共10页
太原重工易地迁建设计中,对2010年《大型铸锻件国产化研制项目》实施中所遇到的主客观的困难,以至大炼铸钢在车间组成、工艺局部布置、结构局部构造、与原小炼铸钢车间及物料供应系统的结合上,所造成的不够和谐的问题加以了弥补,使整个... 太原重工易地迁建设计中,对2010年《大型铸锻件国产化研制项目》实施中所遇到的主客观的困难,以至大炼铸钢在车间组成、工艺局部布置、结构局部构造、与原小炼铸钢车间及物料供应系统的结合上,所造成的不够和谐的问题加以了弥补,使整个炼铸钢系统设计更趋完满,成为一种稀缺土地资源充分得以利用的设计典范。 展开更多
关键词 易地迁建 EAF粗炼 LF/VD精炼 AOD精炼 VD/VC双真空铸锭 α-set法铸钢 PEP-set法耐磨铸钢
在线阅读 下载PDF
The hyperspace of the regions below of all lattice-value continuous maps and its Hilbert cube compactification 被引量:8
14
作者 YANG Zhongqiang 《Science China Mathematics》 SCIE 2005年第4期469-484,共16页
Let L be a continuous semilattice. We use USC(X, L) to denote the family of all lower closed sets including X × {0} in the product space X × AL and ↓1 C(X,L) the one of the regions below of all continuous m... Let L be a continuous semilattice. We use USC(X, L) to denote the family of all lower closed sets including X × {0} in the product space X × AL and ↓1 C(X,L) the one of the regions below of all continuous maps from X to AL. USC(X, L) with the Vietoris topology is a topological space and ↓C(X, L) is its subspace. It will be proved that, if X is an infinite locally connected compactum and AL is an AR, then USC(X, L) is homeomorphic to [-1,1]ω. Furthermore, if L is the product of countably many intervals, then ↓ C(X, L) is homotopy dense in USC(X,L), that is, there exists a homotopy h : USC(X,L) × [0,1] →USC(X,L) such that h0 = idUSC(X,L) and ht(USC(X,L)) C↓C(X,L) for any t > 0. But ↓C(X, L) is not completely metrizable. 展开更多
关键词 hyperspaces HILBERT cube HOMOTOPY dense continuous semilattice Vietoris topology G£-set.
原文传递
Finite Groups with H-Permutable Subgroups 被引量:2
15
作者 Wenbin Guo Chenchen Cao +1 位作者 Alexander N.Skiba Darya A.Sinitsa 《Communications in Mathematics and Statistics》 SCIE 2017年第1期83-92,共10页
Letσ={σi|i∈I}be some partition of the set P of all primes and G afinite group.A set H of subgroups of G is said to be a complete Hallσ-set of G ifevery member≠1 of H is a Hallσi-subgroup of G for some i c l and ... Letσ={σi|i∈I}be some partition of the set P of all primes and G afinite group.A set H of subgroups of G is said to be a complete Hallσ-set of G ifevery member≠1 of H is a Hallσi-subgroup of G for some i c l and H containsexactly one Hallσi-subgroup of G for every i such thatσi∩π(G)≠Ø.A subgroupA of G is said to be H-permutable if A permutes with all members of the completeHallσ-set H of G.In this paper,we study the structure of G under the assuming thatsome subgroups of G areσ-permutable. 展开更多
关键词 Finite group Hall subgroup Complete Hallσ-set H-permutablesubgroup PST-group
原文传递
Total [1,2]-domination in Graphs
16
作者 Xue-zheng LV Baoyindureng WU 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2018年第4期801-812,共12页
A subset S V in a graph G =(V, E) is a total [1, 2]-set if, for every vertex v ∈ V, 1 ≤ |N(v)∩S| ≤2. The minimum cardinality of a total [1, 2]-set of G is called the total [1, 2]-domination number, denoted... A subset S V in a graph G =(V, E) is a total [1, 2]-set if, for every vertex v ∈ V, 1 ≤ |N(v)∩S| ≤2. The minimum cardinality of a total [1, 2]-set of G is called the total [1, 2]-domination number, denoted byγt[1,2](G).We establish two sharp upper bounds on the total [1,2]-domination number of a graph G in terms of its order and minimum degree, and characterize the corresponding extremal graphs achieving these bounds. Moreover,we give some sufficient conditions for a graph without total [1, 2]-set and for a graph with the same total[1, 2]-domination number, [1, 2]-domination number and domination number. 展开更多
关键词 total [1 2]-set total [1 2]-domination number [1 2]-set
原文传递
A Unified Fixed Point Theory in Generalized Convex Spaces
17
作者 Sehie PARK 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2007年第8期1509-1526,共18页
Let B be the class of 'better' admissible multimaps due to the author. We introduce new concepts of admissibility (in the sense of Klee) and of Klee approximability for subsets of G-convex uniform spaces and show ... Let B be the class of 'better' admissible multimaps due to the author. We introduce new concepts of admissibility (in the sense of Klee) and of Klee approximability for subsets of G-convex uniform spaces and show that any compact closed multimap in B from a G-convex space into itself with the Klee approximable range has a fixed point. This new theorem contains a large number of known results on topological vector spaces or on various subclasses of the class of admissible G-convex spaces. Such subclasses are those of O-spaces, sets of the Zima-Hadzic type, locally G-convex spaces, and LG-spaces. Mutual relations among those subclasses and some related results are added. 展开更多
关键词 multimap classes B and U^kc Ф-map Ф-set Ф-space admissible G-convex space the Zimatype locally G-convex space LG-space
原文传递
Semantics of Constructions (I)──The Traditional Approach
18
作者 傅育熙 《Journal of Computer Science & Technology》 SCIE EI CSCD 2001年第1期13-24,共12页
It is well known that impredicative type systems do not have set theoretical semantics. This paper takes a look at semantics of inductive types in impredicative type systems. A generalized inductive type is interprete... It is well known that impredicative type systems do not have set theoretical semantics. This paper takes a look at semantics of inductive types in impredicative type systems. A generalized inductive type is interpreted as an omega set generated by effectivizing a certain rule set. The result provides a semantic justification of inductive types in the calculus of constructions. 展开更多
关键词 type theory inductive type ω-set
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部