摘要
利用假币辨识向量集,引入搜索矩阵,给出一种逐列相加合并的算法,解决了单假币辨识的完全非适应算法问题.
Utilizing certain sets of m-dimensional vectors and introducing search Matrix, this paper designs an arithmetic that adds and merges row by row at search Matrices. The problem on a pure non-adaptive weighing schemes with m weighings to detect a counterfeit coin is solved.
出处
《河南师范大学学报(自然科学版)》
CAS
CSCD
北大核心
2005年第3期19-21,共3页
Journal of Henan Normal University(Natural Science Edition)
基金
浙江省自然科学基金资助项目(Y104420)
浙江省教育厅基金资助项目(20040507)
关键词
假币问题
搜索矩阵
非适应算法
counterfeit coin problem
search Matrix
non-adaptive weighing schemes