Improved Yen-Joye's authenticated multiple-key agreement protocol

An authenticated multiple-key agreement protocol is proposed. The protocol is not only secure against the unknown-key attack but also more efficient than other protocols.     

Fabrication of 1.55 μm VCSELs on Si using metallic bonding

Using AuGeNiCr multilayered metals as the wafer bonding medium, long-wavelength GaInAsP/InP vertical cavity surface emitting lasers employing Al-oxide/Si as the upper and lower distributed Bragg reflectors were fabricated on Si substrate with the bonding interface formed outside the vertical cavity surface emitting laser cavity. Laser emission at 1.545 μm was measured under pulsed operations near room temperature. The low-temperature metallic bonding process demonstrates a great potential in device fabrication     

荧光显示管直丝氧化物阴极有效逸出功的计算

阴极的逸出功是表征阴极发射能力的物理量，求定荧光显示管直丝氧化物阴极有效逸出功时，因其零场发射电流密度难于准确取值，温度无法直接测量，显得困难，须予解决，为此提出了一种计算阴极有产逸出功的办法，对某显示管的发射欠佳和“低温高效”的两种氧化物阴极的有效逸出功进行计算，有效逸出功率是靠测量相关物理量再同计算得出，精度不很高，文中所用办法也不例外，但所得结果能反映阴极发射能力，所需仪器少，是实用方法。     

Coplanar waveguide-fed uniplanar bow-tie antenna

The design of coplanar waveguide (CPW)-fed bow-tie antenna for the 2.4-GHz ISM band is described. A coplanar waveguide-to-coplanar strips (CPW-to-CPS) balun is used to obtain the balanced feed line for the printed bow-tie. An analysis method based on the mixed potential integral equation method is used to characterize the input characteristics of the bow-tie antenna. The numerical results obtained are in good agreement with the experimental data. Through experiments with bow-tie antennas of various extended angles, the bow-tie antenna with a 90° extended angle exhibits the widest bandwidth in the desired frequency band which has a bandwidth of 17% for a VSWR <1.5:1     

Color image retrieval based on hidden Markov models

In this correspondence, a new approach to retrieving images from a color image database is proposed. Each image in the database is represented by a two-dimensional pseudo-hidden Markov model (2-D PHMM), which characterizes the chromatic and spatial information about the image. In addition, a flexible pictorial querying method is used, by which users can paint the rough content of the desired images in a query picture. Image matching is achieved by comparing the query picture with each 2-D PHMM in the database. Experimental results show that the proposed approach is indeed effective.     

地面油管漏失定量测试方法探讨

对油管漏失进行定量测试的方法确定具体漏失位置。方法运用双频道回声探仪探测动液面的原理和工作方法，根据油管漏失形成的死油坏在测试曲线上出现特殊波位置判断油管漏失位置。结果：经过７０多井次的现场试验，该方法具有较高的准确性和可靠性。结论：利用特殊波可以有效监测油管漏失，并具有推广使用价值。     

Handling multimedia information with VLSI

Identifies the basic technological components of multimedia communications. Among these technologies, multimedia processing and transmission already benefit heavily from VLSI advances. in fact, these two technologies could not have matured without special-purpose VLSI chips. We have examined basic processing required in these technologies and some VLSI architectures. The focus has been on standard-compliant VLSI chips, because the eventual goal of communications is to allow everyone to reach others without constraints. There are still a number of evolving standards, which means that we might witness yet another wave of VLSI chips for multimedia communications     

L－B膜修饰电极循环伏安行为模拟──（Ⅰ）电荷转移速度常数对循环伏安性能的影响

本文用计算机数字模拟方法研究了电活性分子多层Ｚ型Ｌ－Ｂ膜修饰电极的循环伏安行为。计算了电极与修饰Ｌ－Ｂ膜分子第一层之间的电荷转移速度常数Ｋ_ｏ，Ｌ－Ｂ膜分子层间的电荷转移速度常数ｋ_ｉ；对峰电位差△Ｅ_ｐ及阳极峰面积Ｑ的影响，以及在不同条件下各层分子的氧化态分数随扫描时间的变化。为研究和设计电活性分子修饰电极的实际体系提供了大量数据和信息。     

带类型λ—演算

一、引言补演算是一个用函数描述计算的形式理论体系[1J,它由许多计算模型所组成。文〔1〕指出,应用认-演算比纯粹补演算更接近程序语言.但是由于内建函子和常数的引入常会发生一些问题,例如.常数O和函子+在机器中同样看待     

Evaluation of a parallel branch-and-bound algorithm on a class ofmultiprocessors

We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes