Necessity of XPS spectrum,deconvolution,disadvantages of the traditional Fast Fourier Tranderm decon-volution method(FFT),princtple,method and advantage ofMaximum Entropy Deconvolution Method (MEM) are de-scribed.Criteria for determing the number of data points sam-pled in MEM are the main point disccussed in the paper,someXPS deconvolution applications of our MEM software showthat the MEM makes XPS deconvolution much easier than thetraditional FFT method. 相似文献
A survey was carried out of past and current Canadian experiences with machine-aided translation (MAT) systems of non-literary texts in one government institution and three industrial settings. Each organization requires a great deal of translation and had conducted several experiments in the use of MAT. The survey supports positive conclusions about the prospects for expanded use of computers in translation.The authors express their thanks to all those who helped in the preparation of this paper. We are particularly grateful to the staff of the translation departments of the organizations mentioned in the paper for their kind cooperation and their willingness to answer our questions: Chantal Delorme ofIBM Canada, Lorraine Desmarais and Mr. Plamondon of Bell Canada, Pierre Tellier of the Department of the Secretary of State, Maria Russo and Raymond Lapointe of the Xerox Corporation. Furthermore we thank Prof. Graeme Hirst for helpful discussion. 相似文献
By integrating lithography and self‐assembly via electrohydrodynamic instabilities, Russel and co‐workers are able to guide initially flat polymer films to evolve into periodic arrays of pillars over regions much greater in extent than their natural domain sizes, as detailed on p. 1992. Novel structures that involve a combination of linear ridges and pillars are also produced, mainly as as result of the dynamic merging among preformed pillars. To pattern thin polymer films via electrohydrodynamic instabilities, we design and utilize two different kinds of mask patterns to guide pillars into alignment over regions much greater in extent than their natural domain sizes. First, narrow protruding ridges that intersect to form regular patterns on the mask trigger the growth of pillars beneath. Later, square and triangular packings of pillars develop in the regions enclosed by those ridges, preserving the registry from one domain to the next over a much larger area than within individual domains in unpatterned portions of the mask. Second, small square protrusions that are prealigned into a large regular array on the mask guide the formation of square packings of pillars in domains that conform to the mask, forming a large array of pillars. Novel structures involving a combination of linear ridges and pillars are also produced mainly due to the dynamic merging among preformed pillars. Finally, we find vertex symmetry of the mask pattern is necessary for generating and preserving ordered patterns on the polymer film. 相似文献
Gradient-corrected density functional theory was used to investigate the adsorption of H2S on Pd(1 1 1) surface. Molecular adsorption was found to be stable with H2S binding preferentially at top sites. In addition, the adsorption of other S moieties (SH and S) was investigated. SH and S were found to be preferentially bind at the bridge and fcc sites, respectively. The reaction pathways and energy profiles for H2S decomposition giving rise to adsorbed S and H were determined. Both H2S(ad) → SH(ad) + H(ad) and SH(ad) → S(ad) + H(ad) reactions were found to have low barriers and high exothermicities. This reveals that the decomposition of H2S on Pd(1 1 1) surface is a facile process. 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献