大容量数据库如何避免ora-01555错误

本文分析了造成ora-01555错误的原因，并提出解决办法。ora-01555错误一直是DBA与developer争论的焦点，解决其问题应是双方协调的结果。     

Efficient and accurate approach for powder compaction problems

 In this paper, a new approach for powder cold compaction simulations is presented. A density-dependent plastic model within the framework of finite strain multiplicative hyperelastoplasticity is used to describe the highly nonlinear material behaviour; the Coulomb dry friction model is used to capture friction effects at die-powder contact; and an Arbitrary Lagrangian–Eulerian (ALE) formulation is used to avoid the (usual) excessive distortion of Lagrangian meshes caused by large mass fluxes. Several representative examples, involving structured and unstructured meshes are simulated. The results obtained agree with the experimental data and other numerical results reported in the literature. It is shown that, contrary to other Lagrangian and adaptive h-remeshing approaches recently reported for this type of problems, the present approach verifies the mass conservation principle with very low relative errors (less than 1% in all ALE examples and exactly in the pure Lagrangian examples). Moreover, thanks to the use of an ALE formulation and in contrast with other simulations, the presented density distributions do not present spurious oscillations. Received: 20 March 2002 / Accepted: 15 October 2002 The partial financial support of the Ministerio de Ciencia y Tecnología (grant number DPI 2001-2204) is gratefully acknowledged.     

Implicit integration and consistent tangent modulus of a time‐dependent non‐unified constitutive model

This paper describes the implicit integration and consistent tangent modulus of an inelastic constitutive model with transient and steady strain rates, both of which are time‐ and temperature‐dependent; the transient rate is influenced by the evolution of back stress decomposed into parts, while the steady rate depends only on applied stress and temperature. Such a non‐unified model is useful for high‐temperature structural analysis and is practical owing to the ease in determining material constants. The implicit integration is shown to result in two scalar‐valued coupled equations, and the consistent tangent modulus is derived in a quite versatile form by introducing a set of fourth‐rank constitutive parameters into the discretized evolution rule of back stress. The constitutive model is, then, implemented in a finite element program and applied to a lead‐free solder joint analysis. It is demonstrated that the implicit integration is very accurate if the multilinear kinematic hardening model of Ohno and Wang is employed, and that the consistent tangent modulus certainly affords quadratic convergence to the Newton–Raphson iteration in solving nodal force equilibrium equations. Copyright © 2003 John Wiley & Sons, Ltd.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

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.     

Efficient return algorithms for associated plasticity with multiple yield planes

A new return method for implicit integration of linear isotropic yield criteria is presented. The basic idea is to perform all the manipulations in the principal stress space and thereby achieve very simple formulae for calculating the plastic corrector stresses, based on the constant gradient of such criteria. The return formulae are in closed form and no iteration is required. The method accounts for three types of stress return: return to a single yield plane, to a discontinuity line at the intersection of two yield planes and to a discontinuity point at the intersection between three or more yield planes. The infinitesimal and the consistent elastoplastic constitutive matrix are calculated for each type of stress return, as are the conditions to ascertain which type of return is required. The method is exemplified with the Mohr–Coulomb yield criterion. Copyright © 2005 John Wiley & Sons, Ltd.     

Distributed Context Retrieval and Consistency Control in Pervasive Computing

The challenge of saturating all phases of pervasive service provision with context-aware functionality lies in coping with the complexity of maintaining, retrieving and distributing context information. To efficiently represent and query context information a sophisticated modelling scheme should exist. To distribute and synchronise context knowledge in various context repositories across a multitude of administrative domains, streamlined mechanisms are needed. This paper elaborates on an innovative context management framework that has been designed to cope with free-text and location based context retrieval and efficient context consistency control. The proposed framework has been incorporated in a multi-functional pervasive services platform, while most of the mechanisms it employs have been empirically evaluated.     

Locality-preserving hash functions for general purpose parallel computation

Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to algorithmic issues by studying the complexity of hashing in the Block PRAM model of Aggarwal, Chandra, and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families. These complexity bounds provide theoretical evidence that hashing and randomized routing need not destroy communication locality, addressing an open question of Valiant.This work was started when the author was a student at Oxford University, supported by a National Science Foundation Graduate Fellowship and a Rhodes Scholarship. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation or the Rhodes Trust.     

稀疏差分网络和多监督哈希用于高效图像检索

针对基于深度哈希的图像检索中卷积神经网络（CNN）特征提取效率较低和特征相关性利用不充分的问题,提出一种融合稀疏差分网络和多监督哈希的新方法SDNMSH（sparse difference networks and multi-supervised hashing）,并将其用于高效图像检索。SDNMSH以成对的图像作为训练输入,通过精心设计的稀疏差分卷积神经网络和一个监督哈希函数来指导哈希码学习。稀疏差分卷积神经网络由稀疏差分卷积层和普通卷积层组成。稀疏差分卷积层能够快速提取丰富的特征信息,从而实现整个网络的高效特征提取。同时,为了更加充分地利用语义信息和特征的成对相关性,以促进网络提取的特征信息能够更加有效地转换为具有区分性的哈希码、进而实现SDNMSH的高效图像检索,采用一种多监督哈希（MSH）函数,并为此设计了一个目标函数。在MNIST、CIFAR-10和NUS-WIDE三个广泛使用的数据集上进行了大量的对比实验,实验结果表明,与其他先进的深度哈希方法相比,SDNMSH取得了较好的检索性能。     

一种具有平衡标签预测能力的在线哈希算法

针对传统离线哈希算法训练模型耗时、占用内存大和不易更新模型的问题,以及现实图像集的标签存在大量损失的现象,提出了一种能够平衡标签预测的在线哈希算法（BLPOH）。BLPOH通过标签预测模块生成预测标签,并融合残缺的真实标签,能够有效缓解因标签损失导致的模型性能下降。观察到标签存在分布不平衡现象,提出标签类别相似性平衡算法并应用于标签预测模块,提升标签预测的准确性。将旧数据的信息加入哈希函数的在线更新过程,提升模型对旧数据的兼容性。通过在两个广泛使用的数据集上进行实验,并和一些当前先进的算法进行对比,结果证实了BLPOH的优越性。     

ESTIMATION FOR NONNEGATIVE AUTOREGRESSIVE PROCESSES WITH AN UNKNOWN LOCATION PARAMETER

Abstract. Consider an AR(1) process given by X ^t=γ+ø X _t+ Z _t≥ 1. where 0 ≤γ, 0 ≤ø 1 are unknown parameters and the innovations Z _t, ≥ 1, are independently and identically distributed positive random variables. We propose estimates of (γø) which are obtained as the solution to a linear programming problem and establish their strong consistency. When the Z _ts have the exponential distribution. our estimate becomes the conditional maximum likelihood estimate given X ₀. Under the assumption of regular variation of the innovation distribution at its left and right endpoints (assumed to be 0 and ∝ respectively), we establish asymptotic limit laws for the estimates. Consistent estimators for a class of moving-average processes with heavy-tailed innovation distribution are also presented.