约束群论文_邓承志,田伟,陈盼,汪胜前,朱华生

导读:本文包含了约束群论文开题报告文献综述、选题提纲参考文献及外文文献翻译,主要关键词:子群,稀疏,定理,房屋租赁,字典,图像,分辨率。

约束群论文文献综述

邓承志,田伟,陈盼,汪胜前,朱华生[1](2014)在《基于局部约束群稀疏的红外图像超分辨率重建》一文中研究指出针对红外图像分辨率低、视觉质量差等问题,提出基于局部约束群稀疏模型的红外图像超分辨率重建方法.考虑到红外图像的纹理自相似性和原子系数的群结构稀疏性,首先建立了基于局部约束的群稀疏表示模型.然后,在假定低分辨率图像空间和高分辨率图像空间具有相似流形的前提下,联合局部约束群稀疏表示模型和K-SVD(K奇异值分解)方法,训练得到高低分辨率图像对应的群结构字典对.最后,通过高分辨字典和对应的红外图像群稀疏表示系数重建得到高分辨率的红外图像.实验结果表明,本文方法具有更好的超分辨率效果,无论是在客观评价指标还是主观视觉效果方面都有明显的提高.(本文来源于《物理学报》期刊2014年04期)

戴维斯[2](2009)在《移动约束群组AdHoc网络研究》一文中研究指出Dynamic routing is a crucial, yet very challenging issue in MANETs. A flat structure, imposed on networks by default, fails to yield in large scale dynamic MANETs due to communication overhead O ( n 2)and scalability. This implies a hierarchical architecture– clustering, which is vital for efficient resource utilization and load balancing in large scale dynamic networks such as Ad Hoc and sensor networks. The clustering process entails diffusion of node identities along wireless links to yield virtual homogenous sets, whose members subscribe to some rules, with the net effect of entire network decomposition into overlapping or disjoint clusters. Nodes are assigned to clusters based on geographical adjacency. Frequency re-use, reduced overhead and compact clusters are some of the benefits of clustering. Yet, clustering has some cost implications that result from cluster construction and maintenance. The cost functions include explicit message exchange, ripple effect, frozen period and computation round.Over twenty clustering schemes have been proposed. Empirical evidence indicates that linear clusters often generate multiple gateways and confirms circular/roundish clusters as most stable. Besides, research shows that only three geometric shapes: hexagon, triangle and square, can tessellate an infinite, two dimensional spaces (networks). Mobility-aware circular clusters have not only been contemplated, but also formed. Yet, little attention is afforded to the mobility behavior of the nodes during cluster maintenance phase, a fact that could compromise the circular cluster shape. I propose CAN-MR, a mobility-conscious and situation-specific scheme for maintaining circular clusters. My research extends the work of Basu, P. et al, who proposed formation of a circular cluster, but failed to consistently consider the mobility behavior of nodes in cluster maintenance. I dwell on uniform periodic time for all cluster nodes, which confers to them relative stationary state and consigns them to circular motion. For an arbitrary node n, the propagation path defines a locus of points R (radius) distance from the CH, designated as the least mobile of the cluster nodes. The location coordinates are determined using the sine and cosine trigonometric ratios. Yet a node-executable program could also be used in guiding node positioning and movement. Instantaneous node locations are defined by equation of a circle. For sufficiently close consecutive locations, a circle is defined, yet with adequate spacing, the shape can be manipulated to a hexagon or other convenient polygons. This allows clustering to subscribe to frequency re-use equation in cellular networks.(本文来源于《华中科技大学》期刊2009-05-01)

刘建[3](2007)在《上海出台地方规定专门约束群租行为》一文中研究指出“通过这次严厉整顿,将使上海普陀区中远两湾城633家群租户在数月内消失,尽快恢复居民昔日的正常生活。”9月7日上午7时,一次大规模的整治群租房行动在被称为“上海滩第一群租小区”的中远两湾城正式展开,据有关部门介绍,叁天的整治使55套近六千平方米的“群租房(本文来源于《法制日报》期刊2007-09-13)

石生明[4](1990)在《约束的p-子群和p-约束群的亏数群的一些结果》一文中研究指出本文中,G是有限群,S_p(G)是G的Sylow p-子群的集合。我们固定一个分裂的模系统(K,R,F),这里,CharK=0及CharF=P。一个p-块是指群代数FG的(本文来源于《科学通报》期刊1990年15期)

约束群论文开题报告

(1)论文研究背景及目的

此处内容要求:

首先简单简介论文所研究问题的基本概念和背景,再而简单明了地指出论文所要研究解决的具体问题,并提出你的论文准备的观点或解决方法。

写法范例:

Dynamic routing is a crucial, yet very challenging issue in MANETs. A flat structure, imposed on networks by default, fails to yield in large scale dynamic MANETs due to communication overhead O ( n 2)and scalability. This implies a hierarchical architecture– clustering, which is vital for efficient resource utilization and load balancing in large scale dynamic networks such as Ad Hoc and sensor networks. The clustering process entails diffusion of node identities along wireless links to yield virtual homogenous sets, whose members subscribe to some rules, with the net effect of entire network decomposition into overlapping or disjoint clusters. Nodes are assigned to clusters based on geographical adjacency. Frequency re-use, reduced overhead and compact clusters are some of the benefits of clustering. Yet, clustering has some cost implications that result from cluster construction and maintenance. The cost functions include explicit message exchange, ripple effect, frozen period and computation round.Over twenty clustering schemes have been proposed. Empirical evidence indicates that linear clusters often generate multiple gateways and confirms circular/roundish clusters as most stable. Besides, research shows that only three geometric shapes: hexagon, triangle and square, can tessellate an infinite, two dimensional spaces (networks). Mobility-aware circular clusters have not only been contemplated, but also formed. Yet, little attention is afforded to the mobility behavior of the nodes during cluster maintenance phase, a fact that could compromise the circular cluster shape. I propose CAN-MR, a mobility-conscious and situation-specific scheme for maintaining circular clusters. My research extends the work of Basu, P. et al, who proposed formation of a circular cluster, but failed to consistently consider the mobility behavior of nodes in cluster maintenance. I dwell on uniform periodic time for all cluster nodes, which confers to them relative stationary state and consigns them to circular motion. For an arbitrary node n, the propagation path defines a locus of points R (radius) distance from the CH, designated as the least mobile of the cluster nodes. The location coordinates are determined using the sine and cosine trigonometric ratios. Yet a node-executable program could also be used in guiding node positioning and movement. Instantaneous node locations are defined by equation of a circle. For sufficiently close consecutive locations, a circle is defined, yet with adequate spacing, the shape can be manipulated to a hexagon or other convenient polygons. This allows clustering to subscribe to frequency re-use equation in cellular networks.

(2)本文研究方法

调查法:该方法是有目的、有系统的搜集有关研究对象的具体信息。

观察法:用自己的感官和辅助工具直接观察研究对象从而得到有关信息。

实验法:通过主支变革、控制研究对象来发现与确认事物间的因果关系。

文献研究法:通过调查文献来获得资料,从而全面的、正确的了解掌握研究方法。

实证研究法:依据现有的科学理论和实践的需要提出设计。

定性分析法:对研究对象进行“质”的方面的研究,这个方法需要计算的数据较少。

定量分析法:通过具体的数字,使人们对研究对象的认识进一步精确化。

跨学科研究法:运用多学科的理论、方法和成果从整体上对某一课题进行研究。

功能分析法:这是社会科学用来分析社会现象的一种方法,从某一功能出发研究多个方面的影响。

模拟法:通过创设一个与原型相似的模型来间接研究原型某种特性的一种形容方法。

约束群论文参考文献

[1].邓承志,田伟,陈盼,汪胜前,朱华生.基于局部约束群稀疏的红外图像超分辨率重建[J].物理学报.2014

[2].戴维斯.移动约束群组AdHoc网络研究[D].华中科技大学.2009

[3].刘建.上海出台地方规定专门约束群租行为[N].法制日报.2007

[4].石生明.约束的p-子群和p-约束群的亏数群的一些结果[J].科学通报.1990

论文知识图

改进遗传模拟退火算法流程图蒙特卡罗模拟嵌入遗传算法的方法流程...叁元组编码方式Data5etl聚类结果在线、离线性能曲线最大函数值变化曲线

标签:;  ;  ;  ;  ;  ;  ;  

约束群论文_邓承志,田伟,陈盼,汪胜前,朱华生
下载Doc文档

猜你喜欢