3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λ_s(n)log³n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λ_s(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λ_s(n)log²n). The query time in the first problem is O(log⁴n), the query time in the second and third problems is O(log³n + klog²n), and the query time in the fourth problem is O(log³n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K₁, K₂ and K₁ lies vertically above K₂, then K₁ precedes K₂.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.     

Kinetics of phenol hydrogenation over supported palladium catalyst

Kinetics of vapor phase hydrogenation of phenol to cyclohexanone over Pd/MgO system has been studied in a flow microreactor under normal atmospheric pressure. The reaction rate is found to be negative order with respect to the partial pressure of phenol and has increased from −0.5 to 0.5 with increasing temperature (473 to 563 K). The apparent activation energy (E_a) of the process is found to be close to 65 kJ per mol. On the basis of kinetic results a surface mechanism is proposed.     

混合位级正交试验设计的极差分析方法

本文指出，在混合位级的正交试验设计中，以往的极差分析方法存在着不足。本文给出了极差的修正方法，并用大量实例做了数值验证，说明这个修正确实很有效     

Outflow refreshment angiography: A bright blood, bright static tissue technique

A new “bright blood” strategy, outflow refreshment imaging, is introduced in which a number of overlapping slices are excited in rapid succession. Flowing spins that refresh each overlapped slice portion contribute a bright signal. Additionally, static tissue in each non-overlapped slice portion also yields a bright signal. However, the flow/static contrast is comparable to that produced in inflow refreshment images, and angiograms can be generated by conventional maximum intensity projection processing. The dual ability to visualize angiograms and static tissue images is a major benefit of the strategy. Computer simulations of flow sensitivities and in vivo results are presented which compare the outflow and inflow refreshment imaging strategies.     

Scheduling orders for multiple product types to minimize total weighted completion time

We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space.     

Convergence rates for Markov chain order estimates using EDC criterion

The Efficient Determination Criterion (EDC) generalizes the AIC and BIC criteria and provides a class of consistent estimators for the order of a Markov chain with finite state space. In this note, we derive rates of convergence for the EDC estimates. *Partially supported by CNPq, CAPES/PROCAD, FAPDF/PRONEX, FINATEC and FUNPE/UnB. **Partially supported by CAPES.     

微分算子扰动问题的值域研究

本文研究作用在C2周期函数空间上的微分算子u→u″ g(u) ,其中g(u)为连续有界函数.我们将证明上述微分算子的值域限制在周期函数空间的“超曲面”中.     

Analysis of atomic arrangement in magnetic Fe–Pt nanoparticles

The order parameter S of Fe–Pt nanoparticles is estimated from X-ray diffraction (XRD) patterns. The total intensity of a diffraction peak is obtained by Rietveld analysis as well as simply integrating the intensity. The Rietveld analysis is found to provide a plausible value of S even for a sample showing an XRD pattern with broad and overlapped peaks. Another order parameter Q, which is obtained from Mössbauer spectra, is introduced, and it is confirmed that Q is equivalent to the probability of Fe atoms being in the L1₀-type atomic arrangement. The coercivity of Fe–Pt nanoparticles is directly proportional to Q, while it vanishes at S=0.4, indicating that the magnetic property of Fe–Pt nanoparticles has a closer relationship to Q than S.     

On the Numerical Range of Operator Polynomials

An upper bound for the number of components of the numerical range of matrix polynomials is established. We also establish a necessary condition and a sufficient condition for the connectedness of the numerical range of a quadratic selfadjoint matrix polynomial. The boundary of the numerical range of linear matrix polynomials is also considered.     

Moderate and Small Deviations for the Ranges of One-Dimensional Random Walks

We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup and the liminf laws of the iterated logarithm. We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup and the liminf laws of the iterated logarithm.