Numerical investigation of particle lateral migration in straight channel flows using a direct-forcing immersed boundary method

Inertia-induced cross-stream migration has been recently exploited for precise position of particles in confined channel flows. In this work, a three-dimensional finite volume based immersed boundary method has been developed to study the lateral migration and hydrodynamic self-assembly of neutrally-buoyant particles in pressure-driven flows. Simulation results show that, in 2D channel flows, the equilibrium position for a circular particle is closer to the centreline for larger particle Reynolds number due to the increasing flow rate, while in 3D square duct flow, the equilibrium position for a spherical particle is near a face centre and is closer to the wall for larger particle Reynolds number. Self-assembly of a pair of particles is observed in 3D square duct flows but not in 2D channel flows. Mechanisms for the self-assembly are discussed.     

Rigidity and flexibility of virtual polytopes

All 3-dimensional convex polytopes are known to be rigid. Still their Minkowski differences (virtual polytopes) can be flexible with any finite freedom degree. We derive some sufficient rigidity conditions for virtual polytopes and present some examples of flexible ones. For example, Bricard's first and second flexible octahedra can be supplied by the structure of a virtual polytope.     

Optic Fiber Interferometer for Absolute Distance Measurement

1.IntroductionAbsolutedistancemeasurementisfarfromanewtopic.However,itisstillafieldstimulatinggreatinterestsnowadaysduetoitSimportantroleinmanufacturingandassembly['J.SincethegreatsuccessachievedbyMichelsonandBenoitwhentheyfirstdevelopedaninterferometertodeterminethestandardmeterintermsofthemonochromaticredcadmiumline,theopticinterferometerhasbeenprovedtobeoneofthemostpreciseandefficientwayindisplacementmeasurementbecauseofitshighdiscriminationandsimplestructure.However,thetraditionalinterfe…     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

A MODEL OF TROPICAL MARINE RESERVE‐FISHERY LINKAGES

ABSTRACT. The excessive and unsustainable exploitation of our marine resources has led to the promotion of marine reserves as a fisheries management tool. Marine reserves, areas in which fishing is restricted or prohibited, can offer opportunities for the recovery of exploited stock and fishery enhancement. In this paper we examine the contribution of fully protected tropical marine reserves to fishery enhancement by modeling marine reserve‐fishery linkages. The consequences of reserve establishment on the long‐run equilibrium fish biomass and fishery catch levels are evaluated. In contrast to earlier models this study highlights the roles of both adult (and juvenile) fish migration and larval dispersal between the reserve and fishing grounds by employing a spawner‐recruit model. Uniform larval dispersal, uniform larval retention and complete larval retention combined with zero, moderate and high fish migration scenarios are analyzed in turn. The numerical simulations are based on Mombasa Marine National Park, Kenya, a fully protected coral reef marine reserve comprising approximately 30% of former fishing grounds. Simulation results suggest that the establishment of a fully protected marine reserve will always lead to an increase in total fish biomass. If the fishery is moderately to heavily exploited, total fishery catch will be greater with the reserve in all scenarios of fish and larval movement. If the fishery faces low levels of exploitation, catches can be optimized without a reserve but with controlled fishing effort. With high fish migration from the reserve, catches are optimized with the reserve. The optimal area of the marine reserve depends on the exploitation rate in the neighboring fishing grounds. For example, if exploitation is maintained at 40%, the ‘optimal’ reserve size would be 10%. If the rate increases to 50%, then the reserve needs to be 30% of the management area in order to maximize catches. However, even in lower exploitation fisheries (below 40%), a small reserve (up to 20%) provides significantly higher gains in fish biomass than losses in catch. Marine reserves are a valuable fisheries management tool. To achieve maximum fishery benefits they should be complemented by fishing effort controls.     

基于LabVIEW空间瞬态光信号处理技术

分析了待探测的瞬态光信号、背景光信号和高频干扰信号频率的特性,利用LabVIEW软件平台设计虚拟仪器，进行信号处理和分析.设计了数字滤波器，对采集到的信号进行数字滤波，对滤波后的目标信号进行谱估计，得到功率谱密度.试验结果表明，该方法设计简单，运行可靠，滤波效果显著.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Estimation in the continuous time mover‐stayer model with an application to bond ratings migration

The usual tool for modelling bond ratings migration is a discrete, time‐homogeneous Markov chain. Such model assumes that all bonds are homogeneous with respect to their movement behaviour among rating categories and that the movement behaviour does not change over time. However, among recognized sources of heterogeneity in ratings migration is age of a bond (time elapsed since issuance). It has been observed that young bonds have a lower propensity to change ratings, and thus to default, than more seasoned bonds. The aim of this paper is to introduce a continuous, time‐non‐homogeneous model for bond ratings migration, which also incorporates a simple form of population heterogeneity. The specific form of heterogeneity postulated by the proposed model appears to be suitable for modelling the effect of age of a bond on its propensity to change ratings. This model, called a mover–stayer model, is an extension of a Markov chain. This paper derives the maximum likelihood estimators for the parameters of a continuous time mover–stayer model based on a sample of independent continuously monitored histories of the process, and develops the likelihood ratio statistic for discriminating between the Markov chain and the mover–stayer model. The methods are illustrated using a sample of rating histories of young corporate issuers. For these issuers the default probabilities predicted by the Markov chain and mover–stayer models are different. In particular for 1–4 years old bonds the mover–stayer model estimates substantially lower default probabilities from rating C than a Markov chain. Copyright © 2004 John Wiley & Sons, Ltd.     

Bit-parallel approximate string matching algorithms with transposition

Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.