We consider the problem of ascertaining the minimum unmber of weighings which suffice to determine three counterfeit coins in a set of n coins given a bal-ance scale, where three counterfeit coins are heavier than goo...We consider the problem of ascertaining the minimum unmber of weighings which suffice to determine three counterfeit coins in a set of n coins given a bal-ance scale, where three counterfeit coins are heavier than good ones and are of different weight. Denote by g3(n) the least unmber of weighings to find three ir-regulars among n coins. In this paper we construct an algorithm and proved that |log3(n3)|≤g3(n)≤|log3(n3)|+2.展开更多
No C结构规模巨大,内部电路互连非常复杂,No C内部串扰严重影响了片上系统的信号完整性。基于改进HT模型提出一种串扰测试的方法,实验结果表明,在改进的HT模型来中,N根传输线传统串扰测试方法需要测试6N次,而此方法只需要18次,从而有效...No C结构规模巨大,内部电路互连非常复杂,No C内部串扰严重影响了片上系统的信号完整性。基于改进HT模型提出一种串扰测试的方法,实验结果表明,在改进的HT模型来中,N根传输线传统串扰测试方法需要测试6N次,而此方法只需要18次,从而有效地减小了开销。基于改进的HT故障种类模型设计了一套基于改进HT模型的测试代码,根据测试代码利用Pspice仿真软件设计了一种测试代码电路,该测试电路是利用16位数据选择器和16进制计数器构成,并对测试电路进行仿真测试,测试结果表明该电路能够满足测试要求并且具有可移植的优点。展开更多
文摘We consider the problem of ascertaining the minimum unmber of weighings which suffice to determine three counterfeit coins in a set of n coins given a bal-ance scale, where three counterfeit coins are heavier than good ones and are of different weight. Denote by g3(n) the least unmber of weighings to find three ir-regulars among n coins. In this paper we construct an algorithm and proved that |log3(n3)|≤g3(n)≤|log3(n3)|+2.