查询词典 FP

Firstly, this thesis introduces the basic definition and characters of conic curve over finite field Fp and ring Z n.

本文首先分别介绍了基于有限域Fp上的圆锥曲线C p和基于环Z n上的圆锥曲线C n的定义和性质。

In the context of Spirit, the same FP style functor composition may be applied to semantic actions. full_calc.cpp is a good example.

在Spirit的语境里，同样FP风格的仿函数可以应用于语义动作， full_calc.cpp 是一个很好的例子。

By utilizing the cross-gain modulation effect and the period-one oscillation harmonic frequency-locked in an optically injected semiconductor laser, we can extract the wavelength conversional individual channel optical clock from the optical-time-division-multiplexing signal. In a FP-LD, we numerically simulate the extraction of 20 GHz optical clock at 1550 nm from the 2×20 Gb/s OTDM signal at 1555 nm, and experimentally obtain the -105 dBc/Hz phase noise frequency division clock of 12.36 GHz to 6.18 GHz with simultaneous wavelength conversion from 1550.24 nm to 1545.91 nm.

采用一个FP半导体激光器作为全光分路时钟提取及波长转换器，数值模拟实现了从波长为1555 nm、速率为2×20 Gb/s的光时分复用信号中提取出波长转换为1550 nm、重复频率为20 GHz的分路光时钟，实验完成了从波长为1550.24 nm、重复频率为12.36 GHz光脉冲信号中提取出相位噪声为-105 dBc/Hz的波长为1545.91 nm、重复频率6.18 GHz的分频光时钟。

The contributions are listed as follows:(1) a single-pass closed frequent itemsets mining process based on reverse lexicographic order FP-tree is introduced for mining classification association rules, which uses a kind of mixed item-ordering searching policy to satisfy the single-pass requirement of data streams and uses the bitmap technology to improve the efficiency;(2) the concept of self-support for filtering rules is proposed to improve the precision.

主要贡献在于：1提出了一种基于逆文法顺序FP-Tree的频繁闭项集单遍挖掘过程，用于挖掘类关联规则，该过程采用了一种混合项顺序搜索策略以满足数据流挖掘的单遍性需求，并采用位图技术提高效率：2提出了"自支持度"概念，用于筛选规则以提高算法分类精度。

A linear map f: M→M is said to preserve idempotence if fP(subscript nP.

若线性映射f： M→M满足fP(下标 nP，则称f是保幂等的线性映射。

And an algorithm of mining association rules with lower bound constraint is presented, which based on FP-Tree.

最后提出了基于FP-Tree的下界约束算法，采用了预先测试的方法，降低了需要测试项集的数量和计算成本。

So, this paper, based on mathematical expectation, brought up the concept of the positively correlated frequent itemsets, and improved the algorithm of mining frequent itemsets directly in FP-tree to mine positively correlated frequent itemsets. In this way, a solution to the above mentioned problems was got.

针对以上问题，基于数学期望，提出了正相关的频繁项集的概念，并改进了一种直接在FP-树中挖掘频繁项集的算法，挖掘出正相关的频繁项集，从而有效地解决以上问题。

The experimental results show that the proposed algorithm is comparable to FP-growth algorithm, but the former can solve the problem of multiple minimum supports.

实验表明，新算法的性能可以和FP-growth算法相比，而且可以处理多重最小支持度的问题。

The chosen FP-LMTO method takes Fourie transforms of the LMTOs in interstitial region, which allow us to avoid the empty sphere in open structures. The supercell geometry is used in our calculation.

本文采用的FP-LMTO方法中对LMTO轨道的尾函数进行傅立叶变换，有利于处理具有开放晶体结构的ZnO及其缺陷，计算中采用超原胞几何构型。

They redundantly pop the result of the FP stack and reload Result from the stack.

把结果从 FP 堆栈 pop 出，再从堆栈装载是冗余的。

What are your goals and strategies for growth?

你的成长目标和策略是什么？

And unto the angel of the church in Sardis write; These things saith he that hath the seven irits of God, and the seven star I know thy works, that thou hast a name that thou livest, and art dead.

3：1 你要写信给撒狄教会的使者，说，那有神的七灵和七星的，说，我知道你的行为，按名你是活的，其实是死的。