检索结果-南通市图书馆

Research on Improved Character Encoding Methods Based on QR Code

Chinese Journal of Electronics 2019年第6期28卷 1170-1176页

作者： KANG Bohan JIA Jingdun GAO Wanlin ZHANG Ning School of Information Central University of Finance and Economics National Rural Technology Development Center Ministry of Science and Technology College of Information and Electrical Engineering China Agricultural University

With the popularity of mobile terminals,Quick response(QR) code, which acts as a convenient and quick way to transfer graphic information, has been widely used in various fields. QR code is a 2D matrix code which contains information in both vertical and horizontal directions. In order to promote the characters encoding efficiency, we propose the improved character encoding methods based on QR code. Specifically, we divide the types of encoding data into Chinese characters and nonChinese characters, and thus optimizing their encoding methods separately: we apply the branch-bound algorithm to optimize the encoding pattern selection of QR code; as for Chinese characters, based on the Chinese characters use frequency generated by Url crawler system, we design a new encoding method for Chinese characters. Our approach has been shown to afford better experimental test results compared with traditional encoding methods of QR code.

关键词： QR code QR code encoding methods branch-bound algorithm Chinese characters use frequency

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

NONLINEAR INTEGER PROGRAMMING AND GLOBALOPTIMIZATION

引用

Journal of Computational Mathematics 1999年第2期17卷 179-190页

作者： Lian-sheng Zhang Feng Gao Wen-xing Zhu(Department of Mathematics, Shanghai University Jiading CampusShanghai 201800, China) 上海大学数学系上海

Various approaches have been developed for solving a variety of continuous global optimization problems. But up to now, less work has been devoted to solving nonlinear integer programming problems due to the inherent difficulty. This paper manages to transform the general nonlinear integer programming problem into an equivalent' special continuous global minimization problem. Thus any effective global optimization algorithm can be used to solve nonlinear integer programming problems. This result will also promote the research on global optimization. We present an interval branch-and-bound algorithm. Numerical experiments show that this approach is efficient. (Author abstract) 11 Refs.

关键词： integer programming global minimization problem branch-bound algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：