完全可分的三元系TS(v,4)的支撑集

§ 1　 IntroductionA triple system of order v and indexλ,denoted by TS(v,λ) ,is a collection of3- ele-mentsubsets Aof a v- set X,so thatevery 2 - subsetof X appears in preciselyλ subsets of A.L etλ≥ 2 and (X,A) be a TS(v,λ) .If Acan be partitioned into t(≥ 2 ) parts A1,A2 ,...,Atsuch that each (X,Ai) is a TS(v,λi) for 1≤ i≤ t,then (X,A) is called de-composable.Otherwise it is indecomposable.If t=λ,λi=1for 1≤ i≤ t,the TS(v,λ) (X,A) is called completely decomposable.It …     

Wilcoxon signed rank test using ranked-set sample

Ranked-set sampling is useful when measurements are destructive or costly to obtain but ranking of the observations is relatively easy. The Wilcoxon signed rank test statistic based on the ranked-set sample is considered. We compared the asymptotic relative efficiencies of the RSS Wilcoxon signed rank test statistic with respect to the SRS Wilcoxon signed rank test statistic and the RSS sign test statistic. Throughout the ARE’s, the proposed test statistic is superior to the SRS Wilcoxon signed rank test statistic and the RSS sign test statistic.     

A simulated annealing algorithm for resource constrained project scheduling problems

This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.     

pH-inducible beta-glucosidase and beta-glucuronidase of intestinal bacteria.

beta-Glucosidase and beta-glucuronidase of human and rat fecal bacteria were induced by cultivation in alkaline media although their growths were not affected. When a bacterium isolated from human feces producing each enzyme was cultured in a medium at pH 5 for 12-15 h and then adjusted to pH 8, beta-glucosidase and beta-glucuronidase were induced 9.2-fold and 11.5-fold, respectively.     

控温相变免疫分析测定雌酮

通过热引发聚合与氧化还原引发聚合，合成水凝胶，作为雌酮全抗原(E1— BSA)载体；以异硫氰基灾光素标记雌酮的单克隆抗体(McAb)作为示踪剂，建立了控温相变竞争免疫分析测定雌酮(EI)的方法并应用于分析血清样品。实验表明：以热引发聚合合成的水凝胶为载体的荧光免疫分析方法具有更高的灵敏度，它的线性范围为10-700μg/L，检出限为1μg／L(n=10，3倍空白)。经水凝胶性质的比较(包括LCST、非特异性吸附、抗原与抗体反应时间及固定化抗原活性)，证明了热引发聚合的水凝胶较氧化还原引发聚合的水凝胶更适合于作为免疫分析的载体。     

Numerical simulation on an interaction of a vortex street with an elliptical leading edge using an unstructured grid

An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd.     

Triterpenoid Constituents of Huperzia miyoshiana

Thirteen triterpenoids, including three new ones, miyoshianois A (1), B (2) and C (3), were isolated from Huperzia miyoshiana. The structures of these new compounds were established as 3-O-dihydroferuloyltohogenol (1), 16-oxo-3β,21β-dihydrox-y-serrat-14-en-24-ferulate (2) and 16-oxo-3a, 21β-dihydroxy-serrat-14-en-24-ferulate (3), respectively, on the basis of their spectroscopic analysis.