查询词典 initialization phase

For the Hopfield network in solving the traveling salesman problem offen getting unvalid and not optimal solution, this paper introduced a suitable radom initialization of the output values Vxi of permutation matrix to guarantee an effective solution, used the error produced by taking a larger step size and required new solution to be better than or equal to old solution so that the final result can jump out local minima to find the global optimal solution.

摘 要：针对Hopfield网络解旅行商问题经常出现无效解和局部优化解，本文给出置换矩阵的满足一定条件的元素Vxi作为初始值，以便得到有效解。此外，还利用较大的步长所产生的误差和对当前解必须优于或等于已有解的要求，使计算结果能从局部优化解达到全局最优解。

System.out.println("a.length="+ a.length); System.out.println("b.length ="+ b.length);// The handles inside the array are // automatically initialized to null: for(int i = 0; i nbsp;b.length; i++) System.out.println; System.out.println("c.length ="+ c.length); System.out.println("d.length ="+ d.length); a = d; System.out.println("a.length ="+ a.length);// Java 1.1 initialization syntax: a = new Weeble { new Weeble, new Weeble }; System.out.println("a.length ="+ a.length);// Arrays of primitives: int e;// Null handle int f = new int[5]; int g = new int[4]; for(int i = 0; i nbsp;g.length; i++) g = i*i; int h ={ 11, 47, 93 };// Compile error: variable e not initialized://!

句柄。此时，编译器会禁止我们对这个句柄作任何实际操作，除非已正确地初始化了它。数组b被初始化成指向由Weeble句柄构成的一个数组，但那个数组里实际并未放置任何Weeble对象。然而，我们仍然可以查询那个数组的大小，因为b指向的是一个合法对象。这也为我们带来了一个难题：不可知道那个数组里实际包含了多少个元素，因为length只告诉我们可将多少元素置入那个数组。换言之，我们只知道数组对象的大小或容量，不知其实际容纳了多少个元素。尽管如此，由于数组对象在创建之初会自动初始化成null，所以可检查它是否为null，判断一个特定的数组&空位&是否容纳一个对象。类似地，由基本数据类型构成的数组会自动初始化成零、null或者false。

At this point, in the 3D environment initialization, we have a device, so we can initialise any device-dependant object.

在这一点上，在3D环境中的初始化，我们有一个设备，所以我们可以初始化任何设备依赖的对象。

The process by which a temporary Fibre Channel arbitrated loop master is determined during loop initialization.

在环路初始化期间，确定临时的Fibre Channel仲裁环路主控制器的过程。

In order to overcome the problems of traditional snake associated with poor convergence to boundary concavities and sensitive initialization,gradient vector flow based on deformable models is presented to segment tumor region.

为了克服传统的蛇形算法不能收敛于边缘凹陷处以及对蛇的初始化过于敏感的缺点，本文提出用基于可变形模型的梯度矢量流方法提取乳腺X光片中的肿瘤区域。

After repeated studies, we found that gradient vector flow deformable model is robust to model initialization and not stagnant by local energy minimum, but still is difficult to handle boundary concavities. Thus, we develop a modified technique to overcome this drawback. This technique makes active contour further progress into concavities.

经过反覆实作，我们发现GVF较不受模型初始值之影响，而且不会因局部极小能量而停滞，然而此法仍难以进入凹陷处，因此我们也研发了一种改良技术来克服这个缺点。

By introducing XOR operation and one-way function chains to group key management schemes based on the keys tree, a new group key management scheme based on the keys tree, XOR operation and one-way function chains is proposed. Initialization, member adding and member evicting operations are introduced. The new scheme is compared with three other group key management schemes which are based on the keys tree:SKDC, LKH, and OFT. As far as transmission, computation and storage costs are concerned, the performance of the new group key management scheme is the best.

摘 要：在基于密钥树的组密钥管理方案中引入了XOR操作以及单向函数链，提出了一种新的基于密钥树、XOR操作以及单向函数链的组密钥管理方案，介绍了新方案中初始化、成员加入以及成员退出的操作，将新方案与3种基于密钥树的组密钥管理方案SKDC，LKH，OFT进行了比较，数据表明：就传输、计算以及存储开销而言，新的组密钥管理方案性能最优。

Both forms of initialization syntax may be intermixed

两种形式的初始化文法可以相互混合。

Initialization data in pPaletteMap to avoid the need for recomputing the next time it runs.

初始化数据在pPaletteMap里以避免下次运行时重新计算。

As the data is never modified after initialization, you do not have to make any provisions for serializing access.

因为数据在初始化后再也没被修改过，你必须要解决连续访问的供应问题。

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。