针对不同地质目标的叠前时间偏移成像解释评价

随着计算机硬件和地震勘探成像技术的发展，叠前时间偏移正逐步替代常规的NMO加DMO加叠后时间偏移成为地震数据成像处理方法的主流。但对于不同的地质目标，叠前时间偏移的成像效果是否优于常规NMO加DMO加叠后时间偏移的成像效果呢？为此，从地震数据成像处理方法、处理流程和处理参数等方面进行了讨论，并基于某地区三维数据常规处理结果和叠前时间偏移处理结果，针对不同地质目标进行了剖析与评价。认为：叠前时间偏移成像的垂向分辨率较常规处理明显降低，但对于空间波阻抗变化明显的河流和断层，叠前时间偏移成像的空间分辨率要高于常规处理；对于小于1／4波长的叠置薄储层，叠前时间偏移成像的垂向和空间分辨率低于常规处理结果。     

Allocentric Versus Egocentric Spatial Memory After Unilateral Temporal Lobectomy in Humans.

Thirty patients who had undergone either a right or left unilateral temporal lobectomy (14 RTL; 16 LTL) and 16 control participants were tested on a computerized human analogue of the Morris Water Maze. The procedure was designed to compare allocentric and egocentric spatial memory. In the allocentric condition, participants searched for a target location on the screen, guided by object cues. Between trials, participants had to walk around the screen, which disrupted egocentric memory representation. In the egocentric condition, participants remained in the same position, but the object cues were shifted between searches to prevent them from using allocentric memory. Only the RTL group was impaired on the allocentric condition, and neither the LTL nor RTL group was impaired on additional tests of spatial working memory or spatial manipulation. The results support the notion that the right anterior temporal lobe stores long-term allocentric spatial memories. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

心电地图仪中工频干扰的一种滤除方法

在心电地图仪中记录到的体表心电信号往往由于电磁的影响而引进工频干扰．基于体表心电信号中工频干扰的特点，作者提出了一种滤除工频干扰的方法，即就单独—胸导联信号通过提高频谱的分辨率来估计工频干扰的频率；基于最小均方误差准则来估计各导联信号中工频干扰的幅度和相位。文中还给出了该算法的流程图和滤波性能分析。模拟结果表明了该算法的有效性。应用该算法对心电地图仪中的工频干扰进行对消，取得了满意的结果。     

Management of multidimensional discrete data

Spatial database management involves two main categories of data: vector and raster data. The former has received a lot of in-depth investigation; the latter still lacks a sound framework. Current DBMSs either regard raster data as pure byte sequences where the DBMS has no knowledge about the underlying semantics, or they do not complement array structures with storage mechanisms suitable for huge arrays, or they are designed as specialized systems with sophisticated imaging functionality, but no general database capabilities (e.g., a query language). Many types of array data will require database support in the future, notably 2-D images, audio data and general signal-time series (1-D), animations (3-D), static or time-variant voxel fields (3-D and 4-D), and the ISO/IEC PIKS (Programmer's Imaging Kernel System) BasicImage type (5-D). In this article, we propose a comprehensive support ofmultidimensional discrete data (MDD) in databases, including operations on arrays of arbitrary size over arbitrary data types. A set of requirements is developed, a small set of language constructs is proposed (based on a formal algebraic semantics), and a novel MDD architecture is outlined to provide the basis for efficient MDD query evaluation.     

A semantic modeling approach for image retrieval by content

We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach.     

变差函数在地下水位估值中的应用研究

用数值方法进行地下水水资源评价时 ,需要给出每个节点上的初始地下水位值。本文着重阐述了区域化变量和变差函数及其计算步骤 ,指出变差函数在分析地下水位的空间变异的重要性     

Modelling and analysis of 3-D arrangements of particles by point processes with examples of application to biological data obtained by confocal scanning light microscopy

Within the concept of point processes, a review is presented of quantities which can be used in studies of three-dimensional (3-D) aggregates of particles. Suitable characteristics and estimators are given for both unmarked and marked point processes. To demonstrate the feasibility of such quantitative approaches, an application in histology, dealing with 3-D arrangements of cell nuclei in rat liver, is described. Using a confocal scanning light microscope, 3-D images are recorded and image analysis used to obtain the coordinates of the centroid, together with the volume and DNA content, of each cell nucleus. Examples of results are given, using both unmarked and marked point processes. In the latter case, cell type, nuclear volume and ploidy group are suitable marks.     

HiSQL: A Front-end Query System for Historical Relational Databases

The paper describes a prototype system called HiSQL (Historical SQL) which extends the functionality of SQL in manipulating historical data, by providing functions for spatial and temporal processing. Conceptually the paper is divided into three parts: the first part deals with the design and architecture of the system; the second part introduces a case study (the defters); and the third part describes specific functions for spatial and temporal processing of serial documents. The paper concludes with a comparison between HiSQL and SQL and suggestions for further work. This revised version was published online in August 2006 with corrections to the Cover Date.     

映射半解析边界元法解瞬态弹性动力问题的有关问题

提出了映射半解析边界元法解百轴对称瞬态弹性动力问题时存在解析方向不能正确反映波的传播现象的问题，产生该问题的原因和如何解决该问题的建议。     

A feasibility study of a direct-mapping parallel processing method to solve linear equations in load-flow calculation

With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix.