Using AHP and fuzzy theory,four dormitory designs are scientifically analyzed and evaluated from the aspects of the safety,economy and comfort.To get more objective and accurate result,the evaluation used five levels and 36 indicators.The comprehensive weight of the four designs was computed by Maple programs,and the quantitative result is that the first one is the best,then the third and the fourth,the second one is the worst on the premise of economic factors mainly.

The models we considered in this paper are uniformed nondeterminism interactive Markov chains (IMCs). To give the performance specification of IMCs, we first give an algorithm to compute the optimize path probability to reach a set of goal states within a given time bound on an IMC MD, which describing until operator. Using an action-based logic called aCSL the properties of interesting over the IMCs models are described. The correctness of our describing method is proved. It is an extension of performance evaluation pure continue-time Markov chains.

To relieve state space explosion, various proposals for compositional reduction have been made. Simulation equivalence is a equivalence relation that coarse than bisimulation on process algebras. So it is a more meaningful working to deciding whether two processes simulation equivalence. In this paper, we have given the notions of (strong and weak) simulation equivalence, offered the deciding algorithms for simulations equivalence on process algebras MTIPP and addressed the computational complexity of our algorithms.

In this paper,we discuss the quantitative extensions of event structures for LOTOS with stochastic nature. We give the non-interleaving semantics model for interactive Markov chains algebra(IMCA).It is shown that our stochastic models can be used to provide a compositional causality-based semantics to IMCA, and a event-based operational semantics is provided that is proven to coincide with various exiting interleaving proposals.

In this paper, we have offered the deciding algorithms for simulations on Markov stochastic process algebras and addressed the computational complexity of simulation algorithms. We concluded that the strong simulation has a time complexity O(mn(6) + n(5) /log n) and weak simulation preorder has a polynomial-time algorithm on finite stochastic process algebras.

This paper describes a timed variant of extended bundle event structures.We equip events and every event in bundles with a time value.An event e with time t denotes that e is enabled from t time units on since the system is started.For a bundle X|→ec and event ea∈X,ta denotes that the time between the occurrence of event ea and the appearance of e should be at least ta time units.The result is a causality based model allowing the specification of minimal time constraints.Notions like timed event trace,timed lposets and timed remainder are discussed.We have the conclusion that our model is a conservative extension of the untimed causality-based model.

Interactive Markov chains (IMCs) are compositional performance evaluation models which can be used to powerfully model concurrent systems. Simulations that are abstracted from internal computation have been proven to be useful for verification of compositely defined transition system. In the literature of stochastic extension of this transition system, computing simulation preorders are rare. In this paper strong(weak) simulation is introduced for IMCs. The main result of the paper is that we give algorithms to decide strong(weak) simulation preorder for IMCs with a polynomial-time complexity in the number of states of the transition system.

An elevated serum cholesterol level is an important risk factor in cardiovascular disease,and a drug which could lower this level would be an important prophylactic against cardiovascular diseases.Most of the cholesterol is biosynthesized in the liver,and the control of the biosynthetic pathway is a strategy to lower the serum cholesterol level.Since the first HMG-CoA reductase inhibitor,mevastatin,was isolated from Penicillinum citrinum in 1973 and its analogue,pravastatin,became a new type of hyperlipidemic drug,many HMG-CoA reductase inhibitors were successively developed.Natural products have made vital contributions to drug discovery in the past.Some perspective on the potential of the natural products for future drug discovery was discussed.

LAM. (Bignoniaceae) is a wild plant distributed in the northern area of China, and dried whole plants have traditionally been used in treating rheumatism and relieving pain as an ancient Chinese crude drug designated “Tougucao”. In the course of our investigations of its antinociceptive substances, a number of novel monoterpene alkaloids and macrocyclic spermine alkaloids have been characterized. One of the monoterpene alkaloids, incarvillateine (INCA, Fig. 1), demonstrated a significant antinociceptive effect against the mouse pain model induced by formalin. We also reported the antinociceptive effect of INCA and comparison of its action with morphine (MOR). In comparison with antinociceptive effects of different doses of INCA and MOR, the ED50 values of INCA were about 1.06 (early phase) and 1.33 (late phase) times lower than those of MOR. In addition, the antinociceptive effect of INCA in early phase was partially antagonized by pretreatment with naloxone (a narcotic antagonist, 5 mg/kg, s.c), while the effect of morphine was completely reversed. These results suggested the possibility that the action of INCA was partially related to its influence on the central opioid pathways. However, details on the pharmacological aspect of the mechanism have not, to our knowledge, been undertaken. In order to examine the antinociceptive mechanism, some opiate antagonists and adenosine receptor antagonist were administered to mice prior to incarvillateine injection in a formalin test, and the licking time of their pain reaction (paw licking) was measured. MATERIALS AND METHODS

Inter-laboratory validation studies were conducted in 6 laboratories to validate the analytical method for determination of chloramphenicol in royal jelly. Chloramphenicol spiked at the levels of 0.1 and 0.5 ppm was analyzed. Mean recoveries were 89 and 89%, reproducibility relative standard deviations (RSD(R)) were 10.5 and 6.8%, HORRAT(R) values were 0.5 and 0.4. Samples containing residues at the levels of 0.25 and 0.80 ppm were analyzed. Mean recoveries were 89 and 84%, RSD(R) were 9.8 and 12.3%, and HORRAT(R) values were 0.5 and 0.7. The determination limit was 0.05 ppm. These results show that this method has good performance.

介绍在Delphi中访问和控制AutoCAD的基本原理和一般方法,实现了用Delphi创建、选择、编辑和管理AutoCAD实体等具体功能,解决了利用 Delphi完成AutoCAD软件二次开发中与AutoCAD软件的接口问题.

By using the differential equation, the model is set up to reflect the variation of SARS disease dynamically, the solution to which gives its expression to the trend of change on SARS disease such as peak period,lasting time and key factors. The parameters are not sole in character that the index can be forecasted only. It's necessary to determine K (infection rate) and μ (cure rate), but it's difficult to get the accurate result .The scale and lasting time depend on K and μ, which draws high attention of government.Referring to data about Beijing, we know that isolation measure taken ahead or delaying for 5 days makes the propagation of disease ahead or delaying for 20 to 30 days.

This paper discusses the method of arranging n ball teams for single round robin in rational order. By analyzing with fixed-rotation and computer simulating, the arrangement is programmed as follows:① to provide the tournament arrangement that satisfies the prob.1 with the help of computer;② to n ball teams, under the principle of fairness in competition, the upper limit numbers for every ball team in competition in every two rounds are:0 interval for less than 4 teams,1 interval for 5～6 teams,2 intervals for 7～8 teams,3 intervals for 9～11 teams and 4 intervals for 11～12 teams;③to consider all the factors influencing the fairness of competition and put forward some improving methods.

The paper discusses the solution of 2-person non-cooperative game in consideration that hasn't the pure strategy equilibrium point of Nash. We can obtain the mixed strategy's optimal solution by solving two groups of unequal equation. Without a definite solvable method at the present ,the solution property has been discussed .The solution to 2×3 and 2×2 bi-matrix game is studied further.

Generally the arithmetic of the matrix multiplication does not meet the commutative law,but the interchangeable matrix can be discovered under a special circumstance From its definition the interchangable matrix is profoundly discussed in the article ,and some new properties as well as the particular solving process are obtained

According to the statistical figures about passengers in the bus No.i, we make the dispatching plan as follows: 1) Calculate the running parameters of buses including period of bus motion, the number of buses, the frequency and interval. 2) Based on the motion interval's allotment and arrangement scheme and the parameters, deduce the needing numbers of bus an hour, and finally come to the conclusion that optimized number of bus is 44 a day and the interval of bus in rush hours is between 2 to 3 minutes, 30 buses per hour are needed and in low hours is between 2 to 8 minutes. Proportion in satisfaction of passengers is 97%, proportion in loading with passengers is 67%. This meets the need of the passengers on the whole.

在2×2矩阵对策的基础上,讨论了3×3矩阵对策Γ={SⅠ,S∏;A}的代数法求解.给出了矩阵对策A有非零混合最优策略的条件,最优策略的求解公式及3×3矩阵对策的一般求解步骤.对3×m矩阵对策的代数法求解过程进行了进一步的讨论.

A string-rewriting system(Σ∶R) is a set of all words or strings over some finite alphabet Σ.We know a little about the structure of the set in general.For a finite commutative Thue system(Σ∶R)，let 　　 ΔR=｛((t1，t2，…,tn),(s1,s2，…,sn))｜(at11at22…atnn→as1as22…asnn)∈R｝. ΔR is a binary on Nn， Δ*R denotes the congruence on Nn generated by Δ, then 　　 (Σ∶R)≌Nn／Δ*R. 　　Conversely,for any congruence θ on Nn，let Σ=｛a1,a2,…,an｝ and 　　 R1=｛at11at22…atnn→as11as22…asnn｜((t1，t2，…，tn)，(s1，s2,…,sn))∈θ｝. set R=R1∪｛aiaj→ajai｜i≠j,i,j=1,…,n｝.Then(Σ∶R)is a finite commutative Thue system and (Σ∶R)≌Nn／θ.