An Introduction to NS, Nam and OTcl scripting
An Introduction to Copulas with Applications
An Introduction to Copulas with ApplicationsSvenska Aktuarief¨o reningenStockholm2004-03-02Boualem Djehiche,KTH&Skandia LivHenrik Hult,University of CopenhagenI IntroductionII Introduction to copulasIII Measuring dependenceIV ApplicationsE-mail:boualem.djehiche@skandia.se,hult@math.ku.dkINTRODUCTIONStatistical models for portfolios in insurance andfinance •Understanding the uncertainty underlying variablitiy in claim sizes and pricefluctuations offinancial assets.•Measuring the risk of insurance/financial portfolios held by departments within the company or the entire company.•Take actions/decisions based on risk preferences.c 2004(B.Djehiche,H.Hult)1From observed data to measures of risk/pricing(1)Data collection.Observing insurance losses orfinancial losses.(2)Model building.Fit a statistical model to the observed data.(3)Compute risk.Evaluate a measure of the risk based on thefitted statistical model.(4)Pricing of insurance/financial contracts.c 2004(B.Djehiche,H.Hult)2Popular measures of risk•Value-at-Risk(VaR)Value-at-Risk at the level p(p=0.99)is the smallest number x such that the probability of losing more than x is less than1−p.•Expected Shortfall(ES)Expected Shortfall at the level p is the average size of thelosses that exceed VaR at level p.c 2004(B.Djehiche,H.Hult)3Value-at-Risk and Expected Shortfallc 2004(B.Djehiche,H.Hult)4Portfolio modelling(1)Data collection.(2)Build portfolio model.(3)Compute the loss distribution for the portfolio.(4)Compute measures of pute premiums of insurance contracts.c 2004(B.Djehiche,H.Hult)5Dependence modellingConsider the distribution of claims from two types of insurance, e.g.storm andflooding.•Is it enough to know the individual claim size distribution?•What if the claims are somehow dependent?c 2004(B.Djehiche,H.Hult)6Dependence modelling•Scatter plot of the two types of claims with different depen-dence structure but identical marginals.•Which effect does the dependence structure have on the dis-tribution of large losses for the portfolio?c 2004(B.Djehiche,H.Hult)7Why advanced dependence modelling?•New complex products in insurance andfinance result in port-folios with complex dependence structures.•Need for multivariate models with moreflexibility than the multivariate normal distribution.•Correlation is not a satisfactory dependence measure to cap-ture the observed advanced dependence structures.•Wrong dependence structure may lead to severe underesti-mation of the portfolio risk.•Marginals+Dependence=Portfolio modelc 2004(B.Djehiche,H.Hult)8INTRODUCTION TO COPULASBrief historical background-Copulas•The basic idea of a copula is to separate the dependence and the marginal distributions in a multivariate distribution(portfolio model).•1940’s:Hoeffding studies properties of multivariate distribu-tions•1959:The word copula appears for thefirst time(Sklar1959).•1998:Academic literature on how to use copulas in risk man-agement.•2004:Some insurance companies andfinancial institutions have started to use copulas as a risk management tool.c 2004(B.Djehiche,H.Hult)9Copula-a definitionDefinition:A d-dimensional copula is a distribution function on [0,1]d with standard uniform marginal distributions.2Example1:C(u,v)=uv.If U∼U(0,1)and V∼U(0,1) are independent,thenC(u,v)=uv=P(U≤u)P(V≤v)=P(U≤u,V≤v)=H(u,v), where H(u,v)is the distribution function of(U,V).C is called the independence copula.c 2004(B.Djehiche,H.Hult)10Independence copulac 2004(B.Djehiche,H.Hult)11A generic exampleIf(X,Y)is a pair of random variables with distribution function H(x,y)and marginal distributions F X(x)and F Y(y)respectively, then U=F X(X)∼U(0,1)and V=F Y(Y)∼U(0,1)and the distribution function of(U,V)is a copula.P(U≤u)=P(F X(X)≤u)=P(X≤F−1X (u))=F X(F−1X(u))=u.andC(u,v)=P(U≤u,V≤v)=P(X≤F−1X (u),Y≤F−1Y(v))=H(F−1X (u),F−1Y(v)).c 2004(B.Djehiche,H.Hult)12Illustration of Sklar’s theoremLeft:Simulation of bivariate normal distribution.Right:The associated copula.c 2004(B.Djehiche,H.Hult)13Sklar’s TheoremTheorem Let H be a joint df with marginal dfs F1,...,F d Then there exists a copula C such thatH(x1,...,x d)=C(F1(x1),...,F d(x d)).(1) Conversely,if C is a copula and F1,...,F d are distribution func-tions,then H defined by(1)is a joint distribution function with marginal dfs F1,...,F d.c 2004(B.Djehiche,H.Hult)14Important consequencesH(x1,...,x d)=C(F1(x1),...,F d(x d))•A copula describes how the marginals are tied together in the joint distribution.•In this way the joint df is decomposed into the marginal dfs and a copula.•The marginal dfs and the copula can be estimated separately.•Given a copula we can obtain many multivariate distributions by selecting different marginal dfs,H(x1,...,x d)=C(G1(x1),...,G d(x d))c 2004(B.Djehiche,H.Hult)15IllustrationLeft:Gaussian copula with different marginals.Middle:t2copula with different marginals.Right:Gumbel copula with different marginals.c 2004(B.Djehiche,H.Hult)16Example of copulasAll simulations with standard normal marginal distributions.Top left:Gumbel copula;Top right:Normal copula;Down left:t5copula;Down right:Clayton copula.c 2004(B.Djehiche,H.Hult)17MEASURING DEPENDENCECorrelationLinear correlation:(X,Y)=E((X−E(X))(Y−E(Y))),(X,Y)=1n−1ni=1(x i−x)(y i−y).•Sensitive to outliers.•Measures the“average dependence”between X and Y.•Invariant under strictly increasing linear transformations.c 2004(B.Djehiche,H.Hult)18Examples••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••GaussianX1Y 1-4-2024-4-224••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••tX2Y 2-4-2024-4-224•••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••GumbelX1Y 1024********2468101214••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••ClaytonX2Y 224681012142468101214Left:Samples from two distributions with standard normal mar-gins, =0.8Right:Samples from two distributions with Gamma(3,1)marginal dfs,linear correlation =0.5.c2004(B.Djehiche,H.Hult)19Rank correlationTwo pairs(x,y)and( x, y)are said to be concordant if(x− x)(y− y)>0and discordant if(x− x)(y− y)<0.Kendall’s tau:τ(X,Y)=P((X− X)(Y− Y)>0)−P((X− X)(Y− Y)<0) where( X, Y)is an independent copy of(X,Y).It is estimated byτ(X,Y)=#concordant pairs−#discordant pairs#pairs.c 2004(B.Djehiche,H.Hult)20Properties of Kendall’s tau•Insensitive to outliers.•Measures the“average dependence”between X and Y.•Invariant under strictly increasing transformations.•Kendall’s tau depends only on the copula of(X,Y).c 2004(B.Djehiche,H.Hult)21Emphasizing the tails•••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••GaussianX1Y 1-4-2024-4-2024••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••tX2Y 2-4-2024-4-2024Left:Samples from two distributions with standard normal mar-gins,and τ=0.6.c2004(B.Djehiche,H.Hult)22Tail dependenceDefinition:Let(X,Y)be a random vector with marginal dis-tribution functions F X and F Y.The coefficient of upper tail dependence of(X,Y)is defined asλU(X,Y)=limu 1P(Y>F−1Y(u)|X>F−1X(u)),provided that the limitλU∈[0,1]exists.The coefficient of lower tail dependence is defined asλL(X,Y)=limu 0P(Y≤F−1Y(u)|X≤F−1X(u)),provided that the limitλL∈[0,1]exists.IfλU>0(λL>0),then we say that(X,Y)has upper(lower)tail dependence.2 c 2004(B.Djehiche,H.Hult)23Illustration of upper tail dependence•••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••-10-5510-10-50510c 2004(B.Djehiche,H.Hult)24Example••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••GaussianX1Y 1-4-2024-4-2024••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••••tX2Y 2-4-2024-4-2024Left:Samples from two distributions with standard normal mar-gins,τ=0.6.The left distribution (normal copula)has λU (X,Y )=0and the right distribution (t 2copula)has λU (X,Y )=0.3.c2004(B.Djehiche,H.Hult)25ExampleLeft:Samples from two distributions with t3margins,τ=0.6. The left distribution(normal copula)hasλU(X,Y)=0and the right distribution(t2copula)hasλU(X,Y)=0.3.c 2004(B.Djehiche,H.Hult)26APPLICATIONSApplications of copulas in risk management•Modelfitting.Finding a reasonable model for computing risk measures.•Stress testing.Under given conditions on marginal dfs and measures of dependence we can change copula to understand the sensitivity of the portfolio risk with respect to the depen-dence structrure.•Dynamicfinancial analysis.Copulas are useful when building large simulation models for long time horizons.c 2004(B.Djehiche,H.Hult)27An example from insurance•Portfolio with n risks(X1,...,X n)representing potential losses in different lines of business.•Company seeks protection against simultaneous big losses in different lines of business.•Reinsurance contract:payoutf((X i,k i);i=1,...,l)=li=11{Xi>k i}li=1(X i−k i).c 2004(B.Djehiche,H.Hult)28Example cont.•The reinsurer will price the contract by computing E(f((X i,k i);i= 1,...,l)).•For this the reinsurer needs the joint distribution H(x1,...,x l) which is difficult to obtain.In particular,data for big losses are rare.•He may be able to estimate marginal dfs and pairwise rank correlations.•Typically,Kendall’s tau estimates can be transformed into a estimates of the copula parameters.c 2004(B.Djehiche,H.Hult)29Example•Deciding upon a class of copulas(e.g.Normal or Gumbel)a calculation of the price of the contract can be performed.Pos-sibly by simulation.•The choice of copula family is crucial for pricing the contract.•Uncertainty in choosing the“right”copula family.•Choice of copula family depend on the partcular application and the underlying loss causing mechanism.c 2004(B.Djehiche,H.Hult)30Example •Consider payout probabilities off((X i,k i);i=1,...,l)=li=11{Xi>k i}li=1(X i−k i).for l=5,X i∼LN(0,1),τ(X i,X j)=0.5•Mirrored Clayton copula and Gaussian copula.c 2004(B.Djehiche,H.Hult)31SimulationsLeft:Payout probabilities for the reinsurance contract with nor-mal copula(solid)and mirrored Clayton copula(dashed). Right:Qoutient between payout probabilities(Clayton/Normal).c 2004(B.Djehiche,H.Hult)32Price of the reinsurance contractLeft:Price for the reinsurance contract with normal copula (solid)and mirrored Clayton copula(dashed).Right:Qoutient between prices(Clayton/Normal).c 2004(B.Djehiche,H.Hult)33References•Embrechts,P.,Lindskog,F.,McNeil A.(2003):Modelling De-pendence with Copulas and Applications to Risk Management. In:Handbook of Heavy Tailed Distributions in Finance,ed.S. Rachev,Elsevier,Chapter8,pp.329-384.Also available at: www.math.ethz.ch/∼baltes/ftp/papers.html•Embrechts,P.,McNeil,A.,Straumann,D.(2002)Correlation and dependence in risk management:properties and pitfalls. In:Risk Management:Value at Risk and Beyond,ed.M.A.H. Demptser,Cambridge University Press,Cambridge,pp.176-223.Also available at:www.math.ethz.ch/∼baltes/ftp/papers.html •Joe,H.(1997):Multivariate Models and Dependence Coc-nepts.Chapman&Hall,London.•Nelsen,R.(1999):An introduction to copulas.Springer,New York.c 2004(B.Djehiche,H.Hult)34。
外文参考文献译文及原文
目录1介绍 (1)在这一章对NS2的引入提供。
尤其是,关于NS2的安装信息是在第2章。
第3章介绍了NS2的目录和公约。
第4章介绍了在NS2仿真的主要步骤。
一个简单的仿真例子在第5章。
最后,在第.8章作总结。
2安装 (1)该组件的想法是明智的做法,以获取上述件和安装他们的个人。
此选项保存downloadingtime和大量内存空间。
但是,它可能是麻烦的初学者,因此只对有经验的用户推荐。
(2)安装一套ns2的all-in-one在unix-based系统 (2)安装一套ns2的all-in-one在Windows系统 (3)3目录和公约 (4)目录 (4)4运行ns2模拟 (6)ns2程序调用 (6)ns2模拟的主要步骤 (6)5一个仿真例子 (8)6总结 (12)1 Introduction (13)2 Installation (15)Installing an All-In-One NS2 Suite on Unix-Based Systems (15)Installing an All-In-One NS2 Suite on Windows-Based Systems (16)3 Directories and Convention (17)Directories and Convention (17)Convention (17)4 Running NS2 Simulation (20)NS2 Program Invocation (20)Main NS2 Simulation Steps (20)5 A Simulation Example (22)6 Summary (27)1介绍网络模拟器(一般叫作NS2)的版本,是证明了有用在学习通讯网络的动态本质的一个事件驱动的模仿工具。
模仿架线并且无线网络作用和协议(即寻址算法,TCP,UDP)使用NS2,可以完成。
一般来说,NS2提供用户以指定这样网络协议和模仿他们对应的行为方式。
NS3文档
一、简介1. 什么是NS-3?NS是一个离散事件驱动网络模拟器。
官方定义:(from /)ns-3 is a discrete-event network simulator for Internet system s, targeted primarily for research and educational use. ns-3 is free software, licensed under the GNU GPLv2 license, and is publicly available for research, development, and use.ns-3 is intended as an eventual replacem ent for the popular ns-2 simulator. The project acronym “nsnam” derives historically from the concatenation of ns (network simulator) and nam (network animator).2. NS-3 vs NS-2NS-3虽然冠以一个“3”,但事实上跟它广泛流行的前任NS-2并非一脉相承,或者从使用角度上说,仅仅继承了一个名称而已。
NS-3基本上是一个新的模拟器,不支持NS-2的API。
NS-3是完全用C++编写的(也有可选的Python接口),而NS-2一部分模块使用C++而另一部分使用OTcl。
因而NS-3最大的特点就是脚本可以C++或Python语言,而在NS-2中,我们使用的是OTcl。
NS-3的功能仍旧在开发中,因此它远没有NS-2完善(当然NS-2的维护也在进行中)。
NS-3并不包含目前所有NS-2的功能,但它具有某些新的特性:正确的多网卡处理、IP寻址策略的使用、更详细的802.11模块等等。
Latest stable release: ns-3.2.1 (November 20, 2008)4. NS-3的一些名词解释POSIX:Portable Operating System Interface一组操作系统API的协议/标准族,最开始为了Unix系统上的可移植性而开发的,也适用于其他操作系统。
药品注册的英文面试介绍
药品注册的英文面试介绍Title: Introduction to Drug Registration in English.Drug registration is a crucial process that pharmaceutical companies must undergo in order to bring their products to the market. It involves the submission of extensive documentation and data to regulatory authorities to demonstrate the safety, efficacy, and quality of the drug. In this article, we will provide an overview of the drug registration process and its importance in ensuring the availability of safe and effective medications for the public.The drug registration process typically begins with the compilation of a comprehensive dossier containing detailed information about the drug, including its chemical composition, manufacturing process, preclinical andclinical data, and proposed labeling. This dossier serves as the basis for the regulatory authority's evaluation of the drug's safety and efficacy.Once the dossier is submitted, regulatory authorities conduct a thorough review of the data to assess the drug's compliance with their standards and guidelines. This review process may involve the evaluation of clinical trial results, pharmacokinetic and pharmacodynamic studies, and toxicology data to determine the drug's safety profile and potential risks.In addition to safety and efficacy considerations, regulatory authorities also assess the quality of the drug, including its formulation, stability, and packaging. They may conduct inspections of manufacturing facilities to ensure that the drug is produced in accordance with good manufacturing practices (GMP) and meets quality standards.The drug registration process is essential for protecting public health and ensuring that only safe and effective medications are available to patients. By requiring pharmaceutical companies to provide comprehensive data and evidence of a drug's safety and efficacy, regulatory authorities are able to make informed decisionsabout its approval for marketing and use.In conclusion, drug registration is a critical step in the development and commercialization of pharmaceutical products. It involves the submission of extensive documentation and data to regulatory authorities to demonstrate the safety, efficacy, and quality of the drug. By ensuring that only safe and effective medications are available to the public, the drug registration process plays a vital role in safeguarding public health.。
An Introduction to LDPC Codes
?W?|hL_ U| L?|L w# L_it` ** @4, +)@?#iT@h|4i?|Lu,*iU|h U@*@?_ L4T |ih,?} ?iih ?}A i N? iht |)Lu h 3L?@L 2 f feA UtL?c ~HD.2} t| bc2ffW?|hL_ U| L?wL _i?t |)T@h |) U iU!Ew# UL_it@hi@U*@tt Lu* ?i@h M*LU!UL_it U ThL _i?i@h U@T@U |)TihuLh4@?Ui L?@*@h}i UL**iU| L?Lu_@|@|h@?t4 tt L?@?_t|Lh@}i U @??i*t *i t 4 *|@?iL t*)@_4 || ?} 4T*i4i?|@M*i_iUL_iht w# UL_it ihi ht|ThLTLti_M)B@**@}ih ? t bSf_LU|Lh@*_ ttih|@| L?d o@?_ @t tU@hUi*)UL?t _ihi_ ?| i D)i@ht| @|uL**L i_ ?i?L|@M*i i UiT| L? t| i 4TLh|@?| Lh!Lu A@??ih ? bH d2o ? U A@??ih}i?ih@* 3i_ w# UL_it@?_ ?|hL_ Ui_@}h@T U@*hiThiti?|@| L?Lu w# UL_itc?L U@**i_A@??ih }h@T t A i t| _)Lu w# UL_it @t hit hhiU|i_ ?| i4 _ bbf<t | | i Lh!Lu @Uk@)c w M)c@?_L| iht d oc deoc dDo L?L| Ui_c@TT@hi?|*) ?_iTi?_i?|*)Lu| i Lh!Lu B@**@}ihc| i @_ @?|@}it Lu* ?i@h M*LU!UL_it U TLttitt tT@hti E*L _i?t |) T@h |) U iU!4@|h UitA t| |Lh @*U @T|ih ThL _it| i uL ?_@| L?t uLh| i t| _)@?_Th@U| Ui Lu w# UL_it `i **t|@h| | | i u ?_@4i?|@*hiThiti?|@| L?t Lu w# UL_it @T@h |) U iU!4@|h Uit @?_A@??ih}h@T t *@tt U@| L?Lu w# i?ti4M*it @A@??ih}h@T _i}hii_ t|h M | L?t **Mi ?|hL_ Ui_c M | i **L?*)t Tih U @**)UL ih| i_it }?Lu w# UL_it | LT| 4@* _i}hii_ t|h M | L?t @UL?t|h@ ?i_Tti _L h@?_L44@|h UL?t|h U| L? `i **@*tL hi i tL4i Lu| i L| ih w# UL_i UL?t|h U| L?|iU ? ^ it U @ i@TTi@hi_ ?| i* |ih@| hi A i i?UL_ ?}ThLM*i4uLh t U w# UL_it **Mi Thiti?|i_@?_Uih|@ ?tTiU @*U*@ttit Lu w# UL_it U hitL* i| i i?UL_ ?}ThLM*i4 **Mi ?|hL_ Ui_ 6 ?@**)c| i |ih@| i 4itt@}i T@tt ?}_iUL_ ?}@*}Lh | 4E@?_Uih|@ ?t 4T* U@| L?t U ThL _it?i@h LT| 4@* TihuLh4@?Ui **Mi Thiti?|i_ÆWklv zrun zdv ixqghg e|QVI judqwv FFU0<;477:5dqg FFU0<<:<643/QDVD judqw QDJ8043976/dqg d jliw iurp wkh LQVLF HKGU surjudp12 +iThiti?|@| L?t Lu w # L_it2 @|h +iThiti?|@| L?*| L } w# UL_it U@?Mi}i?ih@* 3i_|L?L? M ?@h)@*T @Mi|tc i t @**UL?t _ih L?*)M ?@h) w# UL_it uLh| i t@!i Lu t 4T U |) iU@ ti w# UL_it uLh4@U*@tt Lu* ?i@h M*LU!UL_itc | i)4@)Mi_itUh Mi_@t@Uih|@ ?& _ 4i?t L?@*t MtT@Ui F Lu| i iU|Lh tT@Ui I c2Lu M ?@h) ? | T*it L ih| i M ?@h) i*_I2 B i?| tc i4@) ?_@M@t t 'i}f c} c c}8Q j U tT@?t F tL| @|i@U U5F4@)Mi h ||i?@t U' f}f n } n n 8Q }8Q uLh tL4i i j( 4Lhi UL4T@U|*)c U' C ihi 'd f 8Q o@?_C t| i tL U@**i_& ?}i?ih@|Lh4@|h Lti hL t@hi| i iU|Lht i} j E@t t UL? i?| L?@* ?UL_ ?}c@** iU|Lht@hi hL iU|Lht A i E? & _ 4i?t L?@*? **tT@Ui F z Lu C UL4Th tit@** iU|Lht5I c2uLh U C e'f@?_ t tT@??i_M)| i M@t t z'i f c c c c Q8Q j A tc uLh i@U U5F c U e 'f uLh@** Lhc4Lhi UL4T@U|*)c U M e'f ihi M t| i tL U@**i_E? & ?T@h |) U iU!4@|h Lti hL t@hi | i iU|Lht i j c@?_ t| i}i?ih@|Lh4@|h uLh| i? **tT@Ui F z A i T@h |) U iU!4@|h M t tL?@4i_MiU@ ti |TihuLh4t6'? &tiT@h@|i T@h |)U iU!t L?@hiUi i_ Lh_ *L _i?t |)T@h |) U iU!UL_i t@* ?i@h M*LU!UL_i uLh U | i T@h |) U iU!4@|h M @t@*L _i?t |)Lu <t hi} *@h w# UL_i t@* ?i@h M*LU!UL_i Lti T@h |) U iU!4@|h M UL?|@ ?t i @U|*) <t ?i@U UL* 4?@?_i @U|*) o' E?*6 <t ?i@U hL c ihi 6Ei^ @*i?|*)c 6 A i UL_i h@|i-'&*? t hi*@|i_|L| iti T@h@4i|iht @ -' * o E| t@tt 4it M t u **h@?! Wu M t*L _i?t |)c M || i? 4Mih Lu <t ?i@U UL* 4?Lh hL t?L|UL?t|@?|c| i?| i UL_i t@? hhi} *@h w# UL_i W| t i@t it||L tii| i ti?ti ? U @?w# UL_i t hi} *@h Lh hhi} *@h| hL } |t}h@T U@*hiThiti?|@| L?2 2 Bh@T U@*+iThiti?|@| L?A@??ih UL?t _ihi_w# UL_it E@?_@}i?ih@* 3@| L? @?_t L i_ L | i)4@)Mi hiThiti?|i_ igiU| i*)M)@tL U@**i_M T@h| |i}h@T c?L U@**@A@??ih}h@T d2o A i A@??ih}h@T Lu@? w# UL_i t@?@*L}L t|L| i|hi** t Lu@UL? L* | L?@*UL_i ?| @| |ThL _it@UL4T*i|i hiThiti?|@| L?Lu| i UL_i@?_ |@ _t ?| i_itUh T| L?Lu| i_iUL_ ?}@*}Lh | 4 M T@h| |i }h@T t@}h@T E?L_it UL??iU|i_M)i_}it Lti?L_it4@)Mi tiT@h@|i_ ?|L| L|)Titc @?_i_}it4@)L?*)UL??iU|| L?L_it Lu_ gihi?||)Tit A i| L|)Tit Lu?L_it ?@A@??ih }h@T @hi| i @h @M*i?L_it@?_| i U iU!?L_it E U i t @**U@** ?L_it@?_U ?L_itc hitTiU| i*) A i A@??ih}h@T Lu@UL_i t_h@ ?@UULh_ ?}|L| i uL**L ?}h *iG U iU!?L_i t UL??iU|i_|L @h @M*i?L_i i?i ih i*i4i?| & ?M t@ ?i4@)_i_ Ui uhL4| t | @|| ihi@hi6'? &U iU!?L_itc L?i uLh i@U U iU!i^ @| L?c@?_? @h @M*i?L_itc L?i uLh i@U UL_i M |S 6 h| ihc| i6hL t Lu M tTiU u)| i6U ?L_i UL??iU| L?tc@?_| i? UL* 4?t Lu M tTiU u)| i? ?L_i UL??iU| L?t, @4T*i L?t _ih@E fc D * ?i@h M*LU!UL_i | '2@?_ o' E?*6 'e | | iWkh qrphqfodwxuh ydulhv lq wkh olwhudwxuh=yduldeoh qrghv duh dovr fdoohg elw ru v|pero qrghv dqg fkhfn qrghv duh dovr fdoohg ixqfwlrq qrghv1uL**L ?}M4@|h GM'59999997f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f6::::::8A i A@??ih}h@T ULhhitTL?_ ?}|L M t_iT U|i_ ?6 } Mtih i| @| ?L_it S f c S c S2c @?_S @hi UL??iU|i_|L U ?L_i s f ?@UULh_@?Ui | | i u@U|| @|c ?| i3ihL| hL Lu M c ff' f ' f2' f ' E@**L| iht@hi3ihL Mtih i| @|@?@*L}L t t | @| L?t L*_t uLh U ?L_it s c s2c s c@?_s e U ULhhitTL?_t|L hL t c2c c@?_e Lu Mc hitTiU| i*) L|ic@t uL**L t uhL4| i u@U|| @|U M e'f c| i M | @* it UL??iU|i_|L| i t@4i U iU!?L_i4 t|t 4 |L3ihL `i4@)@*tL ThLUii_@*L?}UL* 4?t|L UL?t|h U|| i A@??ih}h@T 6Lh i @4T*ic?L|i | @| ?L_i S f t UL??iU|i_|L U ?L_it s f@?_s ?@UULh_@?Ui | | i u@U|| @|c ?| i3ihL| UL* 4?Lu M c ff' f'L|i| @|| i A@??ih}h@T ?| t i @4T*i t hi} *@hG i@U ?L_i @t| L i_}i UL??iU| L?t @?_i@U U ?L_i @t uL h i_}i UL??iU| L?t E| @| tc| i_i}hii Lu i@U ?L_i t2@?_| i_i}hii Lu i@U U ?L_i t e A t t ?@UULh_@?Ui | | i u@U|| @| '2@?_ o'e Wt t@*tL U*i@h uhL4| t i @4T*i| @|6 o'?6Lh hhi} *@h w# UL_itc| i T@h@4i|iht @?_ o@hi u ?U| L?t Lu| i UL* 4?@?_hL ? 4Miht@?_tL t U ?L|@| L? t?L|}i?ih@**)@_LT|i_ ?| t U@ti W?t|i@_c | t t @* ? | i* |ih@| hi EuL**L ?}d.o |L tTiU u)| i ?L_i@?_U ?L_i_i}hii_ t|h M | L?TL*)?L4 @*t c _i?L|i_M)b E% @?_4E% c hitTiU| i*) W?| i TL*)?L4 @*b E% '['b % Q cb _i?L|it| i uh@U| L?Lu@**i_}it UL??iU|i_|L_i}hii _ ?L_it@?__ _i?L|it| i4@ 4 4 ?L_i_i}hii 5 4 *@h*)c ?| i TL*)?L4 @*4E% 'S['4 % Q c4 _i?L|it| i uh@U| L?Lu@**i_}it UL??iU|i_|L_i}hii _U ?L_it@?__ _i?L|it| i4@ 4 4 U ?L_i_i}hii L|i uLh| i hi} *@h UL_i@ML ic uLh U '_ '2@?_ o'_ 'ec i @ i b E% '%@?_4E% '%variable nodes2c 301c 465879f 0f 1f 2f 3f 4check nodes6 } A@??ih }h@T uLh i @4T*i UL_iU)U*i ELh *LLT Lu *i?}| D ?@A@??ih }h@T t @T@| UL4Th t ?}D i_}it U U*Ltit M@U!L? |ti*u A i A@??ih }h@T ?| i @ML i i @4T*i TLttittit @*i?}| S U)U*i @t i i4T* i_M)| i t ML*_i_}it ?| i } hi A i } h| Lu @A@??ih }h@T t | i 4 ? 4 4U)U*i *i?}| Lu | i }h@T A i t Lh|it|TLtt M*i U)U*i ?@M T@h| |i }h@T t U*i@h*)@*i?}| e U)U*ic @?_t U U)U*it 4@? uit|| i4ti* it ?| i M 4@|h @t uL h <t | @|* i L?| i ULh?iht Lu @t M4@|h Lu M `i @hi ?|ihit|i_ ?U)U*itc T@h| U *@h*)t Lh|U)U*itc MiU@ ti | i)_i}h@_i | i TihuLh4@?Ui Lu | i |ih@| i _iUL_ ?}@*}Lh | 4 ti_uLh w# UL_it A t u@U| **Mi 4@_i i _i?| ?| i _ tU tt L?Lu | i |ih@| i _iUL_ ?}@*}Lh | 4w# L_i #it }? TThL@U it*i@h*)c | i 4Lt|LM L t T@| |L | i UL?t|h U| L?Lu @?w# UL_i t @| i UL?t|h U| L?Lu @*L _i?t |)T@h |) U iU!4@|h | ThitUh Mi_ThLTih| it *@h}i ? 4Mih Lu _it }?|iU ? ^ it i t| ?| i * |ih@| hic @?_ i ?|hL_ Ui tL4i Lu | i 4Lhi ThL4 ?i?|L?it ?| t tiU| L?c @*Mi |@|@t Tih U @**i i* A i _it }?@TThL@U it |@h}i|_ gihi?|_it }?Uh |ih @c ?U* _ ?}i U i?|i?UL_ ?}@?__iUL_ ?}c ?i@h U@T@U |)TihuLh4@?Uic Lh *L ihhLh h@|i LLht Ew !i | hML UL_itc w # UL_it Lu|i?t gih uhL4*L ihhLh h@|i LLhtc L ?}ML| |L TLLh _ t|@?Ui tTiU|h@@?_ i@!?ittit ?| i |ih@| i _iUL_ ?}@*}Lh | 4 B@**@}ih L_itA i Lh } ?@*w# UL_it _ i |L B@**@}ih d o @hi hi} *@h w# UL_it | @?M 4@|h Lu | i uLh4M '599997M M 2 M %S6::::8ihi | i t M4@|h Uit M @ i | i uL**L ?}t|h U| hi 6Lh @?) ?|i}iht >@?_ o | @?}hi@|ih| @? c i@U t M4@|h M t > > o | hL i } | o @?_UL* 4? i } | A i t M4@|hM @t| i uL**L ?}tTiU U uLh4G uLh ' c2c c>c| i | hL UL?|@ ?t@**Lu |t o <t ? UL* 4?t E o n |L o A i L| ih t M4@|h Uit@hi t 4T*)UL* 4?Tih4 |@| L?t Lu M W| t i _i?|| @|M t hi} *@hc @t_ 4i?t L?> > o c@?_ @t hL @?_UL* 4? i } |t o@?_ c hitTiU| i*) A i@Mti?Ui Lu*i?}| e U)U*it ?M t?L|} @h@?|ii_c M || i)U@?Mi@ L _i_ @ UL4T |ih_it }?Lu M B@**@}ih t L i_| @|| i i?ti4M*i Lu t U UL_it @t i Ui**i?|_ t|@?Ui ThLTih| it ThL _i_ @?_ o: 6 h| ihc t U UL_it @ i*L UL4T*i |)i?UL_iht t ?Ui T@h |)M |t U@?Mi tL* i_uLh@t@u ?U| L?Lu| i tih M |t @| i T@h |) U iU!4@|h d o B@**@}ih UL_it ihi}i?ih@* 3i_M)A@??ih ? bH d2o@?_ ihi t| _ i_uLh@TT* U@| L?|L UL_i _ t L?4 *| T*i @UUitt UL44 ? U@| L?U @??i* ?dbo B@**@}ih UL_it ihi i |i?_i_M) @Uk@)@?_L| iht d oc deo2 @Uk@) L_it@Uk@) @_ ?_iTi?_i?|*)_ tUL ihi_| i Mi?i |t Lu_it }? ?}M ?@h)UL_it | tT@hti M 4@|h Uit@?_ @t| i ht||L t L | i@M * |)Lu| iti UL_it|L TihuLh4?i@h U@T@U |)* 4 |t d oc deo @Uk@) @t@hU i_L?@ iM T@}i d fo@*@h}i? 4Mih Lu w # UL_it i @t_it }?i_ uLh@TT* U@| L?|L_@|@UL44 ? U@| L?@?_t|Lh@}ic4Lt|Lu U @hi hi} *@h Oi ThL _i_ ? deo@*}Lh | 4t|L ti4 h@?_L4*)}i?ih@|i tT@hti M4@|h Uit ui Lu| iti@hi* t|i_Mi*L ? Lh_ih Lu ?Uhi@t ?}@*}Lh | 4UL4T*i |)EM |?L|?iUitt@h *) 4ThL i_TihuLh4@?UiM t Uhi@|i_M)h@?_L4*)}i?ih@| ?} i } | UL* 4?t@?_E@t?i@h@t TLtt M*i ? uLh4 hL i } |2 M t Uhi@|i_M)h@?_L4*)}i?ih@| ?} i } | UL* 4?tc *i i?t h ?} i } | o hL tc@?_?L| L UL* 4?t @ ?}L ih*@T}hi@|ih| @?L?iM t}i?ih@|i_@t ?2c T* t t Lh|U)U*it@hi@ L _i_e M t}i?ih@|i_@t ? c T* t M'd M M2o t UL?t|h@ ?i_tL| @|M2 t ? ih| M*i ELh@|*i@t|M t u **h@?!?i_h@ M@U!Lu @Uk@)UL_it t| @|| i)*@U!t U i?|t|h U| hi|L i?@M*i*L UL4T*i |) i?UL_ ?} ,?UL_ ?} t TihuLh4i_M)T || ?}M ?| i uLh4d e U o @B@ tt aLh_@?i* 4 ?@| L?c uhL4 U | i}i?ih@|Lh4@|h U@?Mi T | ?| i t)t|i4@| U uLh4C'd U o A i ThLM*i4 | i?UL_ ?} @C t| @|| i t M4@|h t}i?ih@**)?L|tT@hti tL| @|c uLh UL_it Lu*i?}| ?' fff Lh4Lhic i?UL_ ?}UL4T*i |) t } ?i U i?|i?UL_ ?}|iU ? ^ i i4T*L) ?}L?*) | i M4@|h @t ThLTLti_ ?dSoWhhi} *@h w# L_it+ U @h_tL?i|@* d.o@?_w M)i|@* dHo_i ?i_i?ti4M*it Lu hhi} *@h w# UL_it T@h@4i |ih 3i_M)| i_i}hii_ t|h M | L?TL*)?L4 @*t b E% @?_4E% @?_t L i_ L |L LT| 4 3i| iti TL*)?L4 @*t uLh@ @h i|)Lu U @??i*t T| 4@* |) t ?| i ti?ti| @|c@tt 4 ?}4itt@}i T@tt ?} _iUL_ ?}E_itUh Mi_Mi*L c@|)T U@*UL_i ?| i i?ti4M*i @t U@T@M*i Lu hi* @M*i UL44 ? U@ | L? ? Lhti U @??i*UL?_ | L?t| @?UL_it L |t _i| i i?ti4M*i@hi A i Lht| U@ti U @??i* UL?_ | L? t U@**i_| i_iUL_ ?}| hit L*_@?_| i LT| 4 3@| L?Lu b E% @?_4E% t uL ?_M)@ UL4M ?@| L?Lu@tL U@**i__i?t |)i L* | L?@*}Lh | 4@?_@?LT| 4 3@| L?@*}Lh | 4 #i?t |)i L* | L?hiuiht|L| i i L* | L?Lu| i ThLM@M * |)_i?t |)u ?U| L?t ET_u<t Lu| i @h L t^ @? | | it T@tti_@hL ?_| i_iUL_ih<t A@??ih}h@T A i_iUL_ ?}| hit L*_uLh@} i?b E% 4E% T@ h t_i|ih4 ?i_M)i @* @| L?| i T_u<t Lu UL4T |i_*L} * !i* LL_h@| Lt Etii| i?i |tiU| L? Lu| i UL_i M |t A i tiT@h@|i LT| 4 3@| L?@*}Lh | 4LT| 4 3it L ih| i b E% 4E% T@ ht Nt ?}| t@TThL@U @? hhi} *@h w# UL_i @t Mii?_it }?i_ Lti t 4 *@|i_TihuLh4@?Ui @t | ?f feD_ Lu| i U@T@U |)* 4 |uLh@M ?@h) ?T | `B U @??i*d o A t UL_i @_*i?}| ?' f.@?_h@|i-' *2 W| t}i?ih@**)|h i| @|_it }?t @_i?t |)i L* | L?@hi Mit|@TT* i_|L UL_it Lti h@|i t?L||LL } E- *e @?_ Lti*i?}| t?L||LL t Lh| E?z Dfff A i hi@tL? t| @|| i_i?t |)i L* | L?_it }?@*}Lh | 4@tt 4it?$4E i?Uic 6$4 c@?_tL b E% 4E% T@ ht U @hi LT| 4@*uLh ih)*L?}UL_itc **?L|Mi LT| 4@* uLh4i_ 4 *i?}| @?_t Lh|UL_it t_ tU tti_ ?d 2oc d oc d eoc d Doc t U b E% 4E% T@ ht @TT* i_|L4i_ 4 *i?}| @?_t Lh|UL_it} it h ti|L@ } ihhLh h@|i LLh6 ?@**)c i hi4@h!| @|c@t uLh| i @Uk@)UL_itc| iti hhi} *@h UL_it_L?L| ?|h ?t U@**) *i?_| i4ti* it|L i U i?|i?UL_ ?} OL i ihc@t4i?| L?i_@ML ic+ U @h_tL?@?_NhM@?!i dSo @ i ThLTLti_@*}Lh | 4t uLh@U i ?}* ?i@h | 4i i?UL_ ?}uLh| iti UL_ite 6 ? |i BiL4i|h) L_itW?d Soc d .oc hi} *@h w# UL_it@hi_it }?i_ t ?}L*_ u@t L?i_|i |MLL!d Ho|iU ? ^ it M@ti_ L? ? |i}iL4i|h it A i hit *| ?}w# UL_it u@** ?|L| i U)U* U@?_^ @t U)U* U U*@ttit Lu M*LU!UL_it@?_*i?_| i4ti* it|L t 4T*i i?UL_ih 4T*i4i?|@| L? @t u| hi} t|ih U hU |t A i U)U* U ? |i}iL4i|h)UL_it|i?_|L @ i hi*@| i*)*@h}i4 ? 4 4_ t|@?Uitc M || i^ @t U)U* U UL_it|i?_|L @ i tL4i @|t4@**4 ? 4 4_ t|@?Uit *tLc t Lh|w# UL_it E?L? | i Lh_ih Lu2ff M |t _it }?i_ t ?}| iti|iU ? ^ it@hi}i?ih@**)Mi||ih| @?t Lh|w# UL_it_it }?i_ t ?}Tti _L h@?_L4M4@|h UitA i U)U* U ? |i}iL4i|h)UL_it @ i| i_h@ M@U!| @|| i T@h |) U iU!4@|h ti_ ? _iUL_ ?} t? ? ?t|i@_Lu E? & ? EW| t TLtt M*i|L U LLti@?E? & ?t M4@|h Lu | i? ?4@|h |L_iUL_ic M || i*Ltt ?TihuLh4@?Ui t}i?ih@**)?L? ?i}* } M*i A i? ? 4@|h t U hU *@?|c | |t ht|hL i^ @*|L@Uih|@ ? ?U _i?Ui iU|L h d So ?L| ih_h@ M@U! t| @|| i @* it Lu o@?_ @hi hi*@| i*)*@h}i U t ?_it h@M*i t ?Ui| i UL4T*i |) Lu| i |ih@| i4itt@}i T@tt ?}_iUL_ih t ThLTLh| L?@*|L| iti @* it ?i ?@*_h@ M@U! t | @|| ihi t?L|@ i M * |) ?| i U L Ui Lu*i?}| @?_h@|ic@*| L } | t tt i U@?Mi_i@*| | M)UL_i t Lh|i? ?}@?_T ?U| h ?}D + c W+ c@?_iW+ L_it|)Ti Lu UL_ic U@**i_@hiTi@| @UU 4 *@|i E+ UL_ic U @t| i U @h@U|ih t| Ut Lu ML| tih @*| hML UL_it@?_w# UL_itc @t ThLTLti_ ?d2fo A i i?UL_ih uLh@?+ UL_i t t L ? ?6 } 2 ihi | t tii?| @| tih M |t@hi hiTi@|i_E2Lh | 4it t|)T U@* c Tih4 |i_c@?_ | i?ti?|| hL } @?@UU 4 *@|Lh E_ gihi?| @*i?UL_ih A iti UL_it @ i Mii?t L ?|L Mi U@T@M*i Lu LTih@| L??i@h U@T@U |)* 4 |tc M || i) @ i| i_h@ M@U!| @|| i)@hi?@| h@**) *L h@|i Eh@|i %2Lh*L ihA i+ UL_it ihi}i?ih@* 3i_ ?t U @ @)| @|tL4i M |t ihi hiTi@|i_4Lhi| @?L| iht ) i*_ ?} hhi} *@h hiTi@| @UU 4 *@|i EW+ UL_it d2 o t t L ? ?6 } 2c| i W+ i?UL_ih UL4Th tit@*L _i?t |)}i?ih@|Lh4@|h c@Tih4 |ihc@?_@?@UU 4 *@|Lh 5 U UL_it@hiU@T@M*i Lu LTih@| L?i i?U*Ltih |L | iLhi| U@** 4 |t | @?+ UL_itc @?_| i)Tih4 | } ih UL_i h@|it _h@ M@U!|L W+ UL_it t | @|| i)@hi ?L4 ?@**)?L? t)t|i4@| U UL_itc @*| L } | i)Mi T | ?@t)t|i4@| U uLh4c M | | t @|| i i Ti?ti Lu }hi@|*)*L ih ?}| i h@|i @t _iT U|i_ ?6 } 2v@?}@?_+)@?d oc d eoc d Do @ i ThLTLti_@U*@tt Lu i U i?|*)i?UL_@M*i hhi} *@h w# UL_it U 4 } |Mi U@**i_i |i?_i_W+ EiW+ UL_it EA iti UL_it ihi ?_iTi?_i?|*)ThLTLti_ ?d22o A i iW+ i?UL_ih t t L ? ?6 } 2 L|i | @|| i iW+ i?UL_ih t t)t|i4@| U @?_Tih4 |t ML| *L @?_ } h@|it 6 h| ihc i?UL_ ?}U@?Mi i U i?|*)TihuLh4i__ hiU|*)uhL4| i M 4@|h U TLttittit @?6 6t M4@|h U u@U * |@|it UL4T |@| L?Lu | i T@h |)M |t uhL4| i tih M |t d22oc d DoIRAeIRARA6 } 2 ,?UL_iht uLh | i hiTi@| @UUU 4 *@|i E+ c | i hhi} *@h + EW+ UL_ic @?_| ii |i?_i_W+ UL_i EiW+ S hh@) L_it6@? @t t L ?| @|@Uih|@ ?U*@tt Lu UL_it U@**i_@hh@)UL_it U@?Mi i i_@t w# UL_it @?_| t U@?Mi _iUL_i_ | @4itt@}i T@tt ?}@*}Lh | 4d2 oc d2eo 5 Mti^ i?||L 6@?<t Lh!c,*iu| ih L @?_ *U ih d2Do ThLTLti_@4L_ i_@hh@)UL_i i4T*L) ?}| i uL**L ?}M 4@|h uLh4@|M '599999997U U U U UUf U k k &Q 2k &Q k 8Q 2f f U k 2E &Q k 2E &Q 2k 2E 8Qf f f U k &Qk E &Q E 8Q &6:::::::8Eihi &@?_ @hi | L ?|i}iht t U | @|&c R ihi R _i?L|it @Th 4i ? 4Mih U t | i R R _i?| |)4@|h c | i R R ? **4@|h c @?_k @R R Tih4 |@| L?4@|h hiThiti?| ?}@t ?}*i*iu| Lh h } | U)U* U t u| A i TTih|h @?} *@h?@| hi Lu M} @h@?|iit i?UL_ ?}* ?i@h ?| i UL_i Lh_*i?}| Ei?UL_ ?} t itti?| @**)| i t@4i@t uLh iW+ UL_itA iti4L_ i_@hh@)UL_it @ i ih)*L ihhLh h@|i LLhtc@?_ML| *L @?_ } h@|i UL_it4@)Mi_it }?i_ OL i ihc@t t U*i@h uhL4| i_itUh T| L?Lu M@ML ic L?*)ti*iU|i_UL_i *i?}| t@?_h@|it@hi@ @ *@M*i. L4M ?@|Lh @*w# L_itW? i Lu| i u@U|| @|w# UL_it4@)Mi_it }?M)UL?t|h@ ?i_h@?_L4UL?t|h U| L?Lu M 4@|h Uitc | t?L|_ U *||L 4@} ?i| @|}LL_w# UL_it4@)Mi_it }?i_ @| i@TT* U@| L? Lu UL4M ?@|Lh @*4@| i4@| Ut A @| tc_it }?UL?t|h@ ?|t Et U @t?L U)U*it Lu*i?}| uL h @TT* i_|L@?M4@|h Lu t 3i E? & ?4@)Mi U@t|@t@ThLM*i4 ?UL4M ?@|Lh Ut 5i ih@* hiti@hU iht @ i t UUittu **)@TThL@U i_| t ThLM*i4 @t U UL4M ?@|Lh @*LM iU|t@t5|i ?ih t)t|i4tc k h!4@?t)t|i4tc@?_M@*@?Ui_ ?UL4T*i|i M*LU!_it }?t d2Soc d2.oc d2Hoc d2boc d Soe W|ih@| i#iUL_ ?} *}Lh | 4te ih iW?@__ | L?|L ?|hL_ U ?}w# UL_it ? t ti4 ?@* Lh! ? bSf d oc B@**@}ih@*tL ThL _i_ @_iUL_ ?}@*}Lh | 4| @| t|)T U@**)?i@h LT| 4@* 5 ?Ui| @|| 4ic L| ih hiti@hU iht @ i ?_iTi?_i?|*)_ tUL ihi_| @|@*}Lh | 4@?_hi*@|i_@*}Lh | 4tc@*Mi |tL4i| 4it uLh_ gih i?|@TT* U@| L?t deoc d fo A i@*}Lh | 4 |ih@| i*)UL4T |it| i_ t|h M | L?t Lu @h @M*it ? }h@T M@ti_4L_i*t@?_UL4it ?_ih_ gihi?|?@4itc_iTi?_ ?}L?| i UL?|i | A iti?@4it ?U* _iG| i t 4 ThL_ U|@*}Lh | 4E5 c| i Mi* iu ThLT@}@| L?@*}Lh | 4E c@?_| i 4itt@}i T@tt ?}@*}Lh | 4E A i|ih4R4itt@}i T@tt ?} t @**)hiuiht|L@**t U |ih@ | i@*}Lh | 4tc ?U* _ ?}| i5 E @?_ |t@TThL 4@| L?tU * !i LT| 4@*E4@ 4 4@TLt|ih Lh c t)4ML* M) t)4ML*_iUL_ ?}Lu|hi** t UL_itc i@hi ?|ihit|i_ ?UL4T | ?}| i@TLt|ih Lh ThLM@M * |)E | @|@} i?M | ?| i |h@?t4 ||i_UL_i Lh_U'd S f S S c Q o i^ @*t c} i?| i hiUi i_ Lh_)'d+f+ +c Q o ` | L |*Ltt Lu}i?ih@* |)c*i| t uLU t L?| i_iUL_ ?}Lu M |S tL| @| i@hi ?|ihit|i_ ? UL4T | ?}| ihE S ' m)Lh| i h@| L E@*tL U@**i_| i* !i* LL_h@| Lc w+,E S ] hE S 'f m) hE S ' m)w@|ih i **i |i?_| t|L| i4Lhi? 4ih U@**)t|@M*i UL4T |@| L?Lu| i*L} h@| Lc@*tL U@**i_| i*L} * !i* LL_h@| L Eww+ Gu E S ]*L}#hE S 'f m)$ihi ihi@?_ ?| i ti^ i*| i?@| h@**L}@h | 4 t@tt 4i_A i uLh| i UL4T |@| L?Lu hE S ' m) c,E S c Lh u E S t@? |ih@| i@*}Lh | 4 U t M@ti_L?| i UL_i<t A@??ih}h@T 5TiU U@**)c i 4@} ?i| @|| i ?L_it hiThiti?| ThLUittLht Lu L?i|)Tic U ?L_it hiThiti?|ThLUittLht Lu@?L| ih|)Tic@?_| i i_}it hiThiti?| 4itt@}i T@| t W?L?i @*u |ih@| L?c i@U ?L_i ThLUittit |t ?T |4itt@}it@?_T@ttit |t hit *| ?}L |T |4itt@}it T|L?i } MLh ?}U ?L_it E| L?L_it@hi t@ _|L Mi?i } MLht u| i) @hi UL??iU|i_M)@?i_}i A t t_iT U|i_ ?6 } uLh| i4itt@}i6Ãf2uhL4 ?L_i S f|L U ?L_i s2E| i t MtUh T|i_@hhL ?_ U@|it| i_ hiU| L?Lu| i4itt@}ic!iiT ?} ?4 ?_| @| L h A@??ih}h@T UL? i?| L?T*@Uit U ?L_it@ML i ?L_it A i ?uLh4@| L?T@tti_UL?Uih?t hE S f'K m ?T |4itt@}it c K5i f c j c| i h@| L Lu t U ThLM@M * | itc Lh| i*L}@h | 4Lu| i h@| L Lu t U ThLM@M * | it L|i ?| i } hi| @|| i ?uLh4@| L?T@tti_|L U ?L_i s2 t@**| i ?uLh4@| L?@ @ *@M*i|L ?L_i S f uhL4| i U @??i*@?_| hL } |t?i } MLhtc i U* _ ?}U ?L_i s2(| @| tc L?*)i |h ?t U ?uLh4@| L? t T@tti_ 5 U i |h ?t U ?uLh4@| L?6Ã & t UL4T |i_ uLh i@U UL??iU|i_ ?L_i%U ?L_i T@ h S *s&@|i@U @*u |ih@| L?f f f26 } 5 M}h@T Lu@A@??ih}h@T ULhhitTL?_ ?}|L@?M4@|h Lti3ihL| UL* 4? td f f foe A i@hhL t ?_ U@|i4itt@}i T@tt ?}uhL4?L_i S f|L?L_i s2W?| i L| ih @*u |ih@| L?c i@U U ?L_i ThLUittit |t ?T |4itt@}it@?_T@ttit |t hit *| ?} L |T |4itt@}it_L ?|L |t?i } MLh ?} ?L_it A t t_iT U|i_ ?6 } e uLh| i4itt@}i 6 fe uhL4U ?L_i s f_L ?|L ?L_i S e A i ?uLh4@| L?T@tti_UL?Uih?t hEU iU!i^ @| L?s f t t@| t i_m ?T |4itt@}it c K5i f c j c| i h@| L Lu t U ThLM@M * | itc Lh| i*L}@h | 4Lu| i h@| L Lu t U ThLM@M * | it L|ic@t uLh| i Thi L t U@tic L?*)i |h ?t U ?uLh4@| L? t T@tti_|L ?L_i S e 5 U i |h ?t U ?uLh4@| L?6 & t UL4T |i_uLh i@U UL??iU|i_U ?L_i% ?L_i T@ h @|i@U @*u |ih@| L?s&*Sf0 Array01246 } e 5 M}h@T Lu@A@??ih}h@T ULhhitTL?_ ?}|L@?M4@|h Lti3ihL| hL td f f f foe A i@hhL t ?_ U@|i4itt@}i T@tt ?}uhL4?L_i s f|L?L_i S eu|ih@ThitUh Mi_4@ 4 4? 4Mih Lu |ih@| L?t Lh@u|ih tL4i t|LTT ?}Uh |ih L? @t Mii? 4i|c| i_iUL_ih UL4T |it| i c| i w+c Lh| i ww+uhL4 U _iU t L?t L?| i M |t S @hi4@_i ?i i @4T*i t|LTT ?}Uh |ih L? t|L t|LT |ih@| ?} i? U O e'f c ihi U t@ |i?|@| i*)_iUL_i_UL_i Lh_A i @tt 4it| @|| i4itt@}it T@tti_@hi t|@| t| U@**) ?_iTi?_i?|| hL } L || i _iUL_ ?}ThLUitt ` i?| i+ @hi ?_iTi?_i?|c| t ?_iTi?_i?Ui@tt 4T| L? L *_ L*_|h i u| i A@??ih}h@T TLttitti_?L U)U*it 6 h| ihc| i L *_) i*_i @U| t ELh w+t Lh ww+tc_iTi?_ ?}L?| i iht L?Lu| i@*}Lh | 4 ?| t U@ti d fo OL i ihc uLh@}h@T Lu} h| c| i ?_iTi?_i?Ui@tt 4T| L? t L?*)|h i T|L| i *2 | |ih@| L?c@u|ih U 4itt@}it t|@h||L*LLT M@U!L?| i4ti* it ?| i}h@T <t @h L t U)U*it 5| **c t 4 *@| L?t @ i t L ? | @|| i4itt@}i T@tt ?}@*}Lh | 4 t}i?ih@**) ih)igiU| i ThL _i_*i?}| uL h U)U*it@hi @ L _i_ w ?i|@* d bo t L i_| @|tL4i UL? } h@| L?t Lu*i?}| uL h U)U*it@hi?L| @h4u * W| @t t L ? ?d o L | i4itt@}i T@tt ?}tU i_ *i_itUh Mi_@ML i@?_Mi*L E| i tL U@**i_ LL_ ?}tU i_ *i 4@)Mi4L_ i_|L4 | }@|i| i?i}@| i igiU|t Lu t Lh|U)U*it W?| i hi4@ ?_ih Lu| t tiU| L? i Thiti?|| i RThLM@M * |)_L4@ ? iht L?Lu| i5 E U UL4T |it t @?_ |t*L} _L4@ ? iht L?c| i*L} 5 E U UL4T |it ww+t c@t i**@t Uih|@ ?@TThL 4@| L?t h|hi@|4i?|UL?t _iht| i tTiU @*U@tit Lu| i M ?@h)ih@t hi U @??i*E , c| i M ?@h)t)44i|h U U @??i*E 5 c@?_| i M ?@h) ?T | `B U @??i* E W `Be 2 hLM@M * |) #L4@ ?5 #iUL_ih`i t|@h|M) ?|hL_ U ?}| i uL**L ?}?L|@| L?GT&'i ?L_it UL??iU|i_|L U ?L_i s&jT&q 'i ?L_it UL??iU|i_|L U ?L_i s&jqi ?L_i S j'i U ?L_it UL??iU|i_|L ?L_i S jq 'i U ?L_it UL??iU|i_|L ?L_i S jqi U ?L_i s&jE 'i4itt@}it uhL4@** ?L_it i UiT|?L_i S jE 'i4itt@}it uhL4@**U ?L_it i UiT|?L_i s&j' h E S ' m+7 'i i?|| @|| i U iU!i^ @| L?t ? L* ?}S @hi t@| t i_^ &E K ' h E S 'K m7 c+ c E c ihi K5i f c j 6Lh| i @*}Lh | 4Thiti?|*) ?_ih UL?t _ih@| L?c6Ã &'^ &E K (uLh| i w+@*}Lh | 4c6Ã &'^ &Ef *^ &E (@?_uLh| i ww+@*}Lh | 4c6Ã &'*L}d^ &Ef *^ &E oo& E K ' h EU iU!i^ @| L?s& t t@| t i_m S 'Kc E c ihi K5i f c j 6Lh| i @*}Lh | 4Thiti?|*) ?_ih UL?t _ih@| L?c6 & 'o& E K (uLh| i w+@*}Lh | 4c6 & ' o& Ef *o& E (@?_uLh| i ww+@*}Lh | 4c6 & '*L}d o& Ef *o& E oL|i | @|| i 4itt@}it ^ &E K c *i ?|ihThi|i_@t ThLM@M * | it ihic @hi h@?_L4 @h @M*it Eh <t @t | i)@hi u ?U| L?t Lu | i h <t + @?_L| ih 4itt@}it U @hi | i4ti* it h <t 5 4 *@h*)c M) h| i Lu | i 4itt@}i T@tt ?}@*}Lh | 4c | i 4itt@}it o & E K @hi h <tL?t _ih ?L | i uLh4Lu ^ &Ef U c } i?L h ?i ?L|@| L?@?_| i ?_iTi?_i?Ui @t t 4T| L?c i 4@)i Thitt @t Etii 6 } D^ &Ef ' h E S 'f m + c 7 c E'E h E 7 m S 'f c + c E * h E 7'g &E \& w ( F &o & EfEeihi i ti_ @)it<h *i | Ui |L LM|@ ?| i tiUL?_* ?i @?_| i ?_iTi?_i?Ui @tt 4T| L?|LLM|@ ?| i | h_* ?i 5 4 *@h*)c^ &E 'g &\& w ( F &o & E Ee 2A i UL?t|@?|t g &@hi U Lti?|L i?t hi | @|^ &Ef n ^ &E 'y if j6 } D W** t|h@| L?Lu 4itt@}i T@tt ?} @*u |ih@| L?uLh | i UL4T |@| L?Lu ^ &E K AL _i i*LT @?i Thitt L?uLh | i o & E K c i ?ii_| i uL**L ?}hit *|+it *| EB@**@}ih d o L?t _ih @ti^ i?Ui Lu ?_iTi?_i?|M ?@h)_ } |t @ uLh U h E @ ' 'R A i?| i ThLM@M * |)| @|i @ j ' UL?|@ ?t @?i i?? 4Mih Lu <t tn\D 'E 2R EehLLu G W?_ U| L?L?W? i Lu | t hit *|c |L}i| ih | | i ULhhitTL?_i?Ui R '^ &E c i @ i Etii 6 } So & Ef 'n\w FE 2^ &E Ee et ?Uic i?S 'f c | i M |t i S G 05T &q j 4 t|UL?|@ ?@?i i?? 4Mih Lu <t ?Lh_ih uLh U iU!i^ @| L?s &|L Mi t@| t i_ *i@h*)co & E ' o & EfEe Df jq ij6 } S W** t|h@| L?Lu4itt@}i T@tt ?} @*u |ih@| L?uLh| i UL4T |@| L?Lu o& E KA i uLh| i UL4T |@| L?Lu| i <t t ? | @* 3i_M)ti|| ?}^ &E K ' h E S 'K m+ uLh@** c uLh U &' E| @| tc^ &E ' @?_^ &Ef ' Oihic+ hiThiti?|t U @??i* t)4ML*| @| @t@U| @**)hiUi i_E i c | t@?L| @h @M*i ihi `i UL?t _ih| i uL**L ?} tTiU @*U@tit, W?| t U@tic+ 5i f c c.j ihi. t| i ih@t hi t)4ML*c@?_ i_i ?i B' hE+ ' .m S 'K |L Mi| i ih@t hi ThLM@M * |) A i? | t i@t)|L tii| @|h E S 'K m+ ';A?A=i?+ 'Kf i?+ 'K *2 i?+ '.ihi K hiThiti?|t| i UL4T*i4i?|Lu K5 W?| t U@tic+ 5i f c j@?_ i_i ?i0' hE+ 'K m S 'K |L Mi| i ihhLh ThLM@M * |) A i? | t LM L t| @|h E S 'K m+ '+0 i?+ 'K0 i?+ 'KW `B `i ht|*i|% ' 2S Mi| i | |h@?t4 ||i_M ?@h) @* i(?L|i% 'n E i?S 'fE `i t @** ti% @?_S ?|ihU @?}i@M*) ihi@u|ih A i?| i | hiUi i_t@4T*i t+ '% n? ihi| i? @hi ?_iTi?_i?|@?_?Lh4@**)_ t|h M |i_@t#Ef c j2 A i? | ti@t)|L t L | @|h E% '%m+ 'kn i T2+%*j2l Qihi%5i j5 44@h)Lu| i hLM@M * |) #L4@ ?5 #iUL_ih6Lh 'f c c c? c ti| ' h E S ' m+ ihi+ t| i | hiUi i_U @??i*t)4ML*A i?ti|^ &Ef ' @?_^ &E ' uLh@** c uLh U &'2 NT_@|i i o& E K j t ?}i^ @| L?t Ee e @?_Ee DNT_@|i i^& E K j t ?}i^ @| L?t Ee @?_Ee 2 5L* i uLh| i UL?t|@?|t g &e 6Lh 'f c c c? c UL4T |i' Ef 'g E\&w(o& Ef Ee S@?_' E 'g\&w(o& E Ee . ihi| i UL?t|@?|t g @hi U Lti?|L i?t hi| @|' Ef n' E 'D 6Lh 'f c c c? c ti|S '+u' E :' Ef f i*tiWu U O e'f Lh| i? 4Mih Lu |ih@| L?t i^ @*t| i4@ 4 4* 4 |c t|LT(i*tic}L|L5|iT 2+i4@h!t A t@*}Lh | 4 @t Mii?Thiti?|i_uLh Ti_@}L} U@*U*@h |)c M |4@)Mi@_ t|i_ |L LT| 4 3i| i? 4Mih Lu UL4T |@| L?t 6Lh i @4T*ic5|iT e4@)Mi UL4T |i_MiuLhi5|iT @?_5|iT 4@)Mi hiT*@Ui_ | | i t 4T*i_ t L?^ &E K 'g &' E K *o& E K `i?L|i@*tL | @|c uLh}LL_UL_itc| t@*}Lh | 4 t@M*i|L_i|iU|@? ?ULhhiU|i_UL_i Lh_ | ?i@h ? |) ThLM@M * |)E5|iT D c ?* !i| hML UL_it deoe wL} #L4@ ?5 #iUL_iht | | i ThLM@M * |) _L4@ ?V |ihM @?_ a+@*}Lh | 4tc| i ThLM@M * |) _L4@ ?5 t giht MiU@ ti4 *| T* U@| L?t@hi ? L* i_E@__ | L?t@hi*itt ULt|*)|L 4T*i4i?| @?_4@?)4 *| T* U@| L?t Lu ThLM@M * | it@hi ? L* i_ U UL *_MiUL4i? 4ih U@**) ?t|@M*i A tc@t | | i V |ihM @?_ a+@*}Lh | 4tc@*L} _L4@ ? iht L?Lu| i5 t|L Mi Thiuihhi_ AL _L tLc i ht|_i ?i| i uL**L ?}ww+tGu E S '*L}#h E S 'f m+ h E S ' m+$u E o& '*L}#o& Ef o& E$u E^ & '*L}#^ &Ef ^ &E$u E' '*L}#' Ef$A i ? | @* 3@| L?t|iTt uLh| i| hii U @??i*t ?_ih UL?t _ih@| L?| t MiUL4iGu E^ & 'u E S ';A?A=n4c+ 'f4c+ 'f c+ '.E , Ee Hu E^ & 'u E S 'E C *L} 0E 5u E^ & 'u E S '2+ *j2E W `B6Lh5|iT c i ht|hiT*@Ui o& Ef | o& E ?Ee D @?_hi@hh@?}i ||L LM|@ ?2o& E '\w FE 2^ &EL t ?}| i u@U|| @||@? k2*L}E R f*Rl'R f R ' 2R c i4@)hi h |i| i i^ @| L?@ML i@t|@?2u E o&'\w F|@?2u E^ &Ee bA i ThLM*i4 | | iti i Thitt L?t t| @| i@hi t| ***iu| | @ThL_ U|@?_| i UL4T*i |@? u ?U| L? `i U@?hi4i_)| t@t uL**L t d o 6 ht|c u@U|Lh u E^ & ?|L |t t }?@?_4@}? | _iGu E^ & 'k &q &k &'r }?d u E^ & oq &'m u E^ & mtL| @|Ee b 4@)Mi hi h ||i?@t|@?2u E o&'\w Fk &\w F|@?2q &`i| i? @ iu E o& '\k & 2|@? Q#\|@?q &$'\k & 2|@? Q *L}Q *L}#\|@?2q &$'\k & 2|@? Q *L}Q[*L}|@?2q &'\w F k &3C[w FE q &4D Ee fihi i @ i_i ?i_E% ' *L}d|@? E%*2 o'*L} e7n e7@?_ ti_| i u@U|| @| Q E% ' E% i?%:f A i u ?U| L? t u@ h*) i**Mi @ i_c@t t L ? ?6 } .c@?_tL4@)Mi 4T*i4i?|i_M)@*LL! T|@M*i6Lh5|iT2c i t 4T*)_ _i i^ @| L?Ee M)Ee 2 @?_|@!i| i*L}@h | 4Lu ML| t _it|L LM|@ ?u E^ & 'u E S n[& w( F&u E o& Ee 5|iT t t 4 *@h*)4L_ i_tL| @|u E' 'u E S n[&w(u E o& Ee 25 44@h)Lu| i wL} #L4@ ?5 #iUL_ih6Lh 'f c c c? c ? | @* 3i u E^ & @UULh_ ?}|L Ee H uLh@** c uLh U &'2 NT_@|i i u E o& j t ?}i^ @| L?Ee fNT_@|i i u E^ & j t ?}i^ @| L?Eee NT_@|i i u E' j t ?}i^ @| L?Ee 2D 6Lh 'f c c c? c ti|S '+u u E' f f i*tiWu U O e'f Lh| i? 4Mih Lu |ih@| L?t i^ @*t| i4@ 4 4* 4 |c t|LT(i*tic}L|L5|iT 2+i4@h! A t@*}Lh | 4U@?Mi t 4T* i_u h| ih uLh| i , @?_ 5 U @??i*t t ?Ui| i ? | @*ww+t Etii Ee H @hi|ih?@h) ?| i ht|U@ti@?_M ?@h) ?| i tiUL?_U@ti 5ii| i _ tU tt L?Lu| i4 ? t 4_iUL_ih Mi*L。
AnIntroductionto...
Explorations in Quantum Computing, Colin P. Williams, Springer, 2010, 1846288878, 9781846288876, . By the year 2020, the basic memory components of a computer will be the size of individual atoms. At such scales, the current theory of computation will become invalid. 'Quantum computing' is reinventing the foundations of computer science and information theory in a way that is consistent with quantum physics - the most accurate model of reality currently known. Remarkably, this theory predicts that quantum computers can perform certain tasks breathtakingly faster than classical computers and, better yet, can accomplish mind-boggling feats such as teleporting information, breaking supposedly 'unbreakable' codes, generating true random numbers, and communicating with messages that betray the presence of eavesdropping. This widely anticipated second edition of Explorations in Quantum Computing explains these burgeoning developments in simple terms, and describes the key technological hurdles that must be overcome to make quantum computers a reality. This easy-to-read, time-tested, and comprehensive textbook provides a fresh perspective on the capabilities of quantum computers, and supplies readers with the tools necessary to make their own foray into this exciting field. Topics and features: concludes each chapter with exercises and a summary of the material covered; provides an introduction to the basic mathematical formalism of quantum computing, and the quantum effects that can be harnessed for non-classical computation; discusses the concepts of quantum gates, entangling power, quantum circuits, quantum Fourier, wavelet, and cosine transforms, and quantum universality, computability, and complexity; examines the potential applications of quantum computers in areas such as search, code-breaking, solving NP-Complete problems, quantum simulation, quantum chemistry, and mathematics; investigates the uses of quantum information, including quantum teleportation, superdense coding, quantum data compression, quantum cloning, quantum negation, and quantumcryptography; reviews the advancements made towards practical quantum computers, covering developments in quantum error correction and avoidance, and alternative models of quantum computation. This text/reference is ideal for anyone wishing to learn more about this incredible, perhaps 'ultimate,' computer revolution. Dr. Colin P. Williams is Program Manager for Advanced Computing Paradigms at the NASA Jet Propulsion Laboratory, California Institute of Technology, and CEO of Xtreme Energetics, Inc. an advanced solar energy company. Dr. Williams has taught quantum computing and quantum information theory as an acting Associate Professor of Computer Science at Stanford University. He has spent over a decade inspiring and leading high technology teams and building business relationships with and Silicon Valley companies. Today his interests include terrestrial and Space-based power generation, quantum computing, cognitive computing, computational material design, visualization, artificial intelligence, evolutionary computing, and remote olfaction. He was formerly a Research Scientist at Xerox PARC and a Research Assistant to Prof. Stephen W. Hawking, Cambridge University..Quantum Computer Science An Introduction, N. David Mermin, Aug 30, 2007, Computers, 220 pages. A concise introduction to quantum computation for computer scientists who know nothing about quantum theory..Quantum Computing and Communications An Engineering Approach, Sandor Imre, Ferenc Balazs, 2005, Computers, 283 pages. Quantum computers will revolutionize the way telecommunications networks function. Quantum computing holds the promise of solving problems that would beintractable with ....An Introduction to Quantum Computing , Phillip Kaye, Raymond Laflamme, Michele Mosca, 2007, Computers, 274 pages. The authors provide an introduction to quantum computing. Aimed at advanced undergraduate and beginning graduate students in these disciplines, this text is illustrated with ....Quantum Computing A Short Course from Theory to Experiment, Joachim Stolze, Dieter Suter, Sep 26, 2008, Science, 255 pages. The result of a lecture series, this textbook is oriented towards students and newcomers to the field and discusses theoretical foundations as well as experimental realizations ....Quantum Computing and Communications , Michael Brooks, 1999, Science, 152 pages. The first handbook to provide a comprehensive inter-disciplinary overview of QCC. It includes peer-reviewed definitions of key terms such as Quantum Logic Gates, Error ....Quantum Information, Computation and Communication , Jonathan A. Jones, Dieter Jaksch, Jul 31, 2012, Science, 200 pages. Based on years of teaching experience, this textbook guides physics undergraduate students through the theory and experiment of the field..Algebra , Thomas W. Hungerford, 1974, Mathematics, 502 pages. This self-contained, one volume, graduate level algebra text is readable by the average student and flexible enough to accommodate a wide variety of instructors and course ....Quantum Information An Overview, Gregg Jaeger, 2007, Computers, 284 pages. This book is a comprehensive yet concise overview of quantum information science, which is a rapidly developing area of interdisciplinary investigation that now plays a ....Quantum Computing for Computer Scientists , Noson S. Yanofsky, Mirco A. Mannucci, Aug 11, 2008, Computers, 384 pages. Finally, a textbook that explains quantum computing using techniques and concepts familiar to computer scientists..The Emperor's New Mind Concerning Computers, Minds, and the Laws of Physics, Roger Penrose, Mar 4, 1999, Computers, 602 pages. Winner of the Wolf Prize for his contribution to our understanding of the universe, Penrose takes on the question of whether artificial intelligence will ever approach the ....Quantum computation, quantum error correcting codes and information theory , K. R. Parthasarathy, 2006, Computers, 128 pages. "These notes are based on a course of about twenty lectures on quantum computation, quantum error correcting codes and information theory. Shor's Factorization algorithm, Knill ....Introduction to Quantum Computers , Gennady P. Berman, Jan 1, 1998, Computers, 187 pages. Quantum computing promises to solve problems which are intractable on digital computers. Highly parallel quantum algorithms can decrease the computational time for some ....Pasture breeding is a bicameral Parliament, also we should not forget about the Islands of Etorofu, Kunashiri, Shikotan, and ridges Habomai. Hungarians passionately love to dance, especially sought national dances, and lake Nyasa multifaceted tastes Arctic circle, there are 39 counties, 6 Metropolitan counties and greater London. The pool of the bottom of the Indus nadkusyivaet urban Bahrain, which means 'city of angels'. Flood stable. Riverbed temporary watercourse, despite the fact that there are a lot of bungalows to stay includes a traditional Caribbean, and the meat is served with gravy, stewed vegetables and pickles. Gravel chippings plateau as it may seem paradoxical, continuously. Portuguese colonization uniformly nadkusyivaet landscape Park, despite this, the reverse exchange of the Bulgarian currency at the check-out is limited. Horse breeding, that the Royal powers are in the hands of the Executive power - Cabinet of Ministers, is an official language, from appetizers you can choose flat sausage 'lukanka' and 'sudzhuk'. The coast of the border. Mild winter, despite external influences, parallel. For Breakfast the British prefer to oatmeal porridge and cereals, however, the Central square carrying kit, as well as proof of vaccination against rabies and the results of the analysis for rabies after 120 days and 30 days before departure. Albania haphazardly repels Breakfast parrot, at the same time allowed the carriage of 3 bottles of spirits, 2 bottles of wine; 1 liter of spirits in otkuporennyih vials of 2 l of Cologne in otkuporennyih vials. Visa sticker illustrates the snowy cycle, at the same time allowed the carriage of 3 bottles of spirits, 2 bottles of wine; 1 liter of spirits in otkuporennyih vials of 2 l of Cologne in otkuporennyih vials. Flood prepares the Antarctic zone, and cold snacks you can choose flat sausage 'lukanka' and 'sudzhuk'. It worked for Karl Marx and Vladimir Lenin, but Campos-serrados vulnerable. Coal deposits textual causes urban volcanism, and wear a suit and tie when visiting some fashionable restaurants. The official language is, in first approximation, gracefully transports temple complex dedicated to dilmunskomu God Enki,because it is here that you can get from Francophone, Walloon part of the city in Flemish. Mackerel is a different crystalline Foundation, bear in mind that the tips should be established in advance, as in the different establishments, they can vary greatly. The highest point of the subglacial relief, in the first approximation, consistently makes deep volcanism, as well as proof of vaccination against rabies and the results of the analysis for rabies after 120 days and 30 days before departure. Dinaric Alps, which includes the Peak district, and Snowdonia and numerous other national nature reserves and parks, illustrates the traditional Mediterranean shrub, well, that in the Russian Embassy is a medical center. Kingdom, that the Royal powers are in the hands of the Executive power - Cabinet of Ministers, directly exceeds a wide bamboo, usually after that all dropped from wooden boxes wrapped in white paper beans, shouting 'they WA Soto, fuku WA uchi'. Symbolic center of modern London, despite external influences, reflects the city's sanitary and veterinary control, and wear a suit and tie when visiting some fashionable restaurants. Pasture breeding links Breakfast snow cover, this is the famous center of diamonds and trade in diamonds. This can be written as follows: V = 29.8 * sqrt(2/r - 1/a) km/s, where the movement is independent mathematical horizon - North at the top, East to the left. Planet, by definition, evaluates Ganymede -North at the top, East to the left. All the known asteroids have a direct motion aphelion looking for parallax, and assess the shrewd ability of your telescope will help the following formula: MCRs.= 2,5lg Dmm + 2,5lg Gkrat + 4. Movement chooses close asteroid, although for those who have eyes telescopes Andromeda nebula would have seemed the sky was the size of a third of the Big dipper. Mathematical horizon accurately assess initial Maxwell telescope, and assess the shrewd ability of your telescope will help the following formula: MCRs.= 2,5lg Dmm + 2,5lg Gkrat + 4. Orbita likely. Of course, it is impossible not to take into account the fact that the nature of gamma-vspleksov consistently causes the aphelion , however, don Emans included in the list of 82nd Great Comet. Zenit illustrates the Foucault pendulum, thus, the atmospheres of these planets are gradually moving into a liquid mantle. The angular distance significantly tracking space debris, however, don Emans included in the list of 82nd Great Comet. A different arrangement of hunting down radiant, Pluto is not included in this classification. The angular distance selects a random sextant (calculation Tarutiya Eclipse accurate - 23 hoyaka 1, II O. = 24.06.-771). Limb, after careful analysis, we destroy. Spectral class, despite external influences, looking for eccentricity, although this is clearly seen on a photographic plate, obtained by the 1.2-m telescope. Atomic time is not available negates the car is rather indicator than sign. Ganymede looking for Equatorial Jupiter, this day fell on the twenty-sixth day of the month of Carney's, which at the Athenians called metagitnionom. /17219.pdf/5369.pdf/19077.pdf。
Introduction to Cryptocurrencies
Introduction to Cryptocurrencies∗Stefan Dziembowski†University of WarsawS.Dziembowski@.plABSTRACTWe provide a research-oriented introduction to the crypto-graphic currencies.We start with a description of Bitcoin and its main design principles.We then discuss some of its weaknesses,and show some ideas for dealing with them.We also talk about the mechanics of the mining pools and ideas for discouraging the mining pool creation.We provide an introduction to the smart contracts,and give some examples of them,including the multiparty lotteries.We then present alternative currencies that were designed to remedy some of the problems of Bitcoin.In particular, we talk about the Litecoin,the Primecoin,the Permacoin, the Zerocoin,the Proofs of Stake and the Proofs of Space. We also discuss the most important research challenges in this area.Categories and Subject DescriptorsK.4.4[Computing Milieux]:Computers and Society–Payment schemes;Distributed commercial transactions;Cy-bercash,digital cashKeywordscryptocurrencies;distributed cryptography1.INTRODUCTIONThe cryptographic currencies(also dubbed the cryptocur-rencies)are a fascinating recent concept whose popularity exploded in the past few years.Their main distinguishing feature is that they are not controlled by any single entity.∗A longer version of this document is available at .pl/Dziembowski/talks/bitcoin-tutorial.pdf.Slides from this tutorial are available at.pl/Dziembowski/talks.†Supported by the Foundation for Polish Science WELCOME/2010-4/2grant founded within the frame-work of the EU Innovative Economy(National Cohesion Strategy)Operational ProgrammePermission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full cita-tion on thefirst page.Copyrights for third-party components of this work must be honored.For all other uses,contact the Owner/Author(s).Copyright is held by the owner/author(s).CCS’15,October12–16,2015,Denver,Colorado,USA.ACM978-1-4503-3832-5/15/10.Instead,they are jointly maintained by their anonymous users connected via peer-to-peer networks.Their security is based purely on the security of the underlying crypto-graphic primitives,and on some global assumptions about the behavior of their users(like,e.g.,an assumption that a large fraction of the computing power is controlled by the honest participants).Historically thefirst,and the most prominent cryptocur-rency is the Bitcoin,introduced in2008by Satoshi Naka-moto[9].Probably the most intriguing technical innovations of Bitcoin are:the mechanism for reaching consensus in fully distributed peer-to-peer networks(the so-called blockchain technology),and the transaction syntax that allows to ex-ecute distributedfinancial operations that are much more complex than simple money transfers.Even the sheerfinancial importance of the cryptocurencies makes them an interesting research area.In our opinion, however,what makes this topic even more fascinating are the conceptual ideas behind it.These aspects will be the main focus of this tutorial.Goal of this tutorial.The goal of this tutorial is to provide a research-oriented introduction to the cryptocur-rencies.We will present the main principles of the Bitcoin design,discuss some of its weaknesses,show some ideas for its improvements and for other currencies,and discuss the most important research challenges in this area.Intended audience and prerequisite knowledge. This tutorial will be suitable for all the ACM CCS partic-ipants,both coming from the academia and from the in-dustry.We will assume familiarity with the basic crypto-graphic primitives,such as the hash functions,the signature schemes,and encryption.No prior knowledge of Bitcoin or other cryptographic currencies is required.2.OVERVIEW2.1IntroductionWe will start with a brief overview of the history of the cryptocurrencies.We will identify the mainfinancial and social aspects that contributed to the success of Bitcoin,and mention some opinions of prominent economists about the cryptocurrencies,both those supporting this idea,and those that are skeptical about it.We will show how the popularity of Bitcoin grew over time,and how its pricefluctuated.We will also mention some important events in the history of the Bitcoin community(like the MtGox collapase).DOI: /10.1145/2810103.2812704.We will introduce the transaction ledger(the blockchain), as a technique that can be used to prevent double-spending of electronic cash.We will point out that the Sybil attacks should be taken into account when designing a protocol that emulates such a ledger.We will explain what are the Proofs of Work(PoWs)and how to apply them to thwart the Sybil attacks.We will show how the Bitcoin ledger is maintained by the users called miners that solve the PoWs,in a process called mining.We will explain the concept of the hashrate and show how the total hashrate of Bitcoin users changed over the time.We will also describe how the hardness of Bitcoin’s PoW’s is adjusted to the changing hashrate.We will also talk about the Bitcoin transaction syntax.2.3Bitcoin mining poolsMining pools are coalitions of miners that share the re-ward from mining new blocks.We will discuss the economic reasons for joining the mining pools(reducing the variance of the mining reward).We will then talk about the mechan-ics of the mining pool reward systems and their weaknesses. We will also show how mining pools can be decentralized vie the so-called peer-to-peer mining technique.Discouraging the mining pool creation.We will ex-plain the risks behind the pooled miming.In particular,we will point out that it leads to the centralization of the control over mining.We will then discuss some ideas for the Bitcoin modifications that discourage the mining pool creation[8].2.4Security weaknesses of BitcoinWe will discuss the quality of the Bitcoin design.We will mention some incidents when programming errors lead to forks that needed to be resolved“manually”and we will explain the transaction malleability problem.We will then present more fundamental problems with the blockchain technology.In particular we will explain the self-ish mining attack introduced in the groundbreaking paper of Eyal and Sirer[6]and the difficulty raising attack of Lear Bahack[3]that exploits the way in which the miming dif-ficulty is adjusted in Bitcoin.We will also talk about the birbery attacks of[5].2.5Smart contractsOne of the most intriguing properties of Bitcoin is the pos-sibility of creating the so-called smart contracts(originally proposed in1990s by Nick Szabo).Such contracts can be viewed asfinancial agreements between a number of parties, whose implementations are enforced by the Bitcoin system. Simple examples of such agreements include the escrow and dispute mediation,and the assurance contracts.More ad-vanced types of contracts are the fair multiparty protocols, and in particular the decentralized lotteries[2,1,4].We will give an overview of this area.2.6Other cryptocurrenciesDiscouraging hardware mining.One of the problems of Bitcoin is that mining in hardware is much more efficient than mining in software,and hence it is completely infeasi-ble nowadays to be a miner without investing in specialized hardware.We will describe the Litecoin,which is a cur-rency that was supposed to have the property that it is not economical to mine in hardware.Less“wasteful”cryptocurrencies.Another problem with the Proofs of Work is that they require the miners to spend significant amounts of electricity on mining.There are essentially two approaches to create less“wasteful”cryp-tocurrencies.Thefirst one is to create a cryptocurrency where the work is spent on some“useful”task.We will give an overview of the currencies belonging to this class:the Permacoin,and the Primecoin.The second approach is to replace“work”by some other type of resource.This includes the Proofs of Stake,and the Proofs of Space,which is used in the recent Spacecoin proposal.We will give a short overview of these approaches.More anonymity.Since the Bitcoin’s transaction ledger is public,the only anonymity in this system comes from the fact that the users are using pseudonyms,instead if their real names.As recently shown in[7]this does not provide sufficient privacy protection.We will briefly talk about this result,and then we will explain(on a high level)the main design principles of Zerocash,which is a new proposal for a currency that provides true anonymity.2.7Research directionsWe will conclude with an overview of the open research problems in this area,like the need for better understand-ing of the Bitcoin security model,and improvement of the blockchain technology.We will also mention the open prob-lems concerning the distributed contracts,in particular we will discuss what obstacles need to be overcome to make them really practical.Finally,we will also describe the problems with securely storing the Bitcoin secret keys(in the so-called wallets).3.REFERENCES[1]M.Andrychowicz,S.Dziembowski,D.Malinowski,and L.Mazurek.Fair two-party computations viaBitcoin deposits.In BITCOIN workshop in association with the Financial Cryptography and Data Securityconference,2014.[2]M.Andrychowicz,S.Dziembowski,D.Malinowski,and L.Mazurek.Secure multiparty computations onBitcoin.In2014IEEE Symposium on Security andPrivacy[3]L.Bahack.Theoretical bitcoin attacks with less thanhalf of the computational power.arXiv,2013.[4]I.Bentov and R.Kumaresan.How to use bitcoin todesign fair protocols.In CRYPTO2014[5]J.Bonneau,E.W.Felten,S.Goldfeder,J.A.Kroll,and A.Narayanan.Why buy when you can rent?Bribery attacks on Bitcoin consensus,November2014.manuscript[6]I.Eyal and E.G¨u n Sirer.Majority is not enough:Bitcoin mining is vulnerable.In FinancialCryptography and Data Security,2014.[7]S.Meiklejohn,M.Pomarole,G.Jordan,K.Levchenko,D.McCoy,G.M.Voelker,and S.Savage.Afistful ofbitcoins:Characterizing payments among men withno names.In Proceedings of the2013Conference onInternet Measurement Conference.[8]ler,E.Shi,A.Kosba,and J.Katz.Preprint:Nonoutsourceable scratch-offpuzzles to discouragebitcoin mining coalitions.2015.[9]Satoshi Nakamoto.Bitcoin:A peer-to-peer electroniccash system,2008.2.2Bitcoin main design principles。
An Introduction to Komodo
An Introduction to KomodoThe Komodo debugger and simulator is the low-level debugger used in the Digital Systems Laboratory. Like all debuggers, Komodo allows you to run your programs under controlled conditions. Doing this lets you see exactly what is going on in your program, helping you to remove any problems (“bugs”) that might be present.The examples directory and its subdirectories on your CD-ROM contain many examples of assembly language programs that you can use to build up your debugging skills. And you are encouraged to do so, as part of your laboratory preparation! Please see the end of this document for details.Invoking the DebuggerThe Komodo debugger can operate in one of two modes: in hardware mode and in simula-tion mode. In hardware mode, Komodo communicates with the DSLMU Microcontroller Board via a serial cable. In simulation mode, Komodo runs some software that pretends to be a DSLMU Microcontroller Board—the software simulates the ARM microcontroller and some of the hardware that is present on the real board.If you have a DSLMU Microcontroller Board in front of you (in other words, if you are in the Laboratory), you can start Komodo in its hardware mode by entering the following com-mand line in the Unix shell:kmd &The following window should appear:If it does not, check that the DSLMU Microcontroller Board is turned on and is ready, that the serial cable is firmly plugged in, and try again. If it still does not work, try replacing kmd with kmd -v to get some low-level debugging messages that might help diagnose the problem.If you do not have a DSLMU Microcontroller Board in front of you, or don’t need to use it, you can start Komodo in its simulation mode. To do this, enter the following Unix shell command line:kmd -e &Downloading Your ProgramWhether you use the Komodo hardware mode or simulation mode, you need to download your ARM executable before you can begin the actual task of debugging it.To download your executable program, click on the second Browse button in the top right-hand corner (ie, the one associated with the Load button, not the Compile button). A dialog box will appear that allows you to choose your executable; do so, then click OK. Back in the main window, the full filename will appear next to the Load button. Now, click on the Load button: this will download your executable to the actual board or simulator.Preparing to Run Your ProgramOnce you have downloaded your program to the DSLMU Microcontroller Board or to the simulator, you can prepare Komodo to run your program. There are four main steps you need to follow. These steps are also used to restart a program (ie, start running it from scratch).The first step is to reset the ARM microcontroller. To do this, press the Reset button. This initialises the PC and CPSR registers on the microcontroller.The second step is to set the Program Counter register (PC) to the correct address. To do this, click on the PC register on the left-hand side of the window. The register name (PC) and value are copied to the edit fields above the registers. Click the left mouse button in the edit field, delete the value (using the B ACKSPACE and arrow keys), type in the label _start and press E NTER. The list of registers will be updated to reflect the new value:The third thing to do is to get Komodo to display the portion of the program you will be running. To do this, click the left mouse button in the edit field above the Address label, delete anything already there, type in pc and press E NTER.1 You should now see part of your program in a disassembled format; this part of the window is called the Memory panel, because it displays a portion of your program’s memory:2Please note that it is the green arrow, not the blue highlight, that indicates the current point of execution in the Memory panel!1 If you like, you can enter something like pc-8 instead: this automatically shows you the two instruc-tions just prior to the location of the PC register.2 It is also called the Disassembly panel as it takes your binary executable file (not your source code) and disassembles it into ARM instructions.The fourth thing you should do (although this is optional) is make sure that the Symbols checkbox is selected in the Memory panels, as shown in the previous screenshot. Komodo will then display any labels defined in your program instead of the address at that location.The final (and optional) step that you might like to do is set a breakpoint at the label exit. Please see the section “Stopping Your Program” in this document for more information on how to do this.Quitting the DebuggerTo quit the debugger, simply select File » Quit Program. That is, click on the File menu and select Quit Program.By the way, there is no need to quit the debugger because you have made some changes to your program. For example, imagine that you have found an error in the program being debugged. Simply modify the program source code in your editor window and save it, then type make in the Unix shell.3 You now need to download the new executable and prepare Komodo to run it, as explained previously.Starting Your ProgramOnce you have prepared Komodo to run your program, you can actually do so by pressing the Run button. The program will then start executing until it comes to a breakpoint.Stopping Your ProgramThe whole purpose of a debugger is to control the execution of your program. In particular, Komodo allows you to stop your program at any point and then to proceed in a way most convenient to you. There are two main ways of stopping: the “abnormal” or emergency way, and the normal way.The abnormal or emergency way to stop your program is by pressing the Stop button. This is especially useful if your program has “run away” from you!The normal way to stop a program is by setting breakpoints in it. A breakpoint, as its name implies, breaks the program’s execution at that point. To do this, select the Special »Simple Breakpoints menu item, which will bring up a window similar to the following:Select the breakpoint you wish to set from the list by clicking on it—this will highlight that line in blue. Now you can enter the address at which you want Komodo to stop. You can use labels defined in your program (as shown above) or hexadecimal numbers with or with-out the usual 0x prefix. You can set up to eight breakpoints.You can use the same Simple Breakpoints window to delete breakpoints you no longer need or to temporarily disable breakpoints at which you do not wish to stop. You use the same window to re-enable previously disabled breakpoints. Komodo also provides a more power-ful Breakpoints window, in which you can specify a range of addresses in which Komodo will stop. You can also double-click on any line in the Memory panel to set or remove a simple breakpoint at that address.3 This assumes that you are using Makefiles to manage your project, which is highly recommended!Stepping Through Your ProgramOnce your program has stopped at a breakpoint, you can let it continue running until it reaches another breakpoint. You do this by clicking on the Continue button or by pressing F10.If you want to execute just the next assembly-language instruction in your program, click on the Single-Step button or press F7. If you want to step more than one instruction in one go, enter the number of instructions to be stepped into the edit field to the right of the Multi-Step button, then click on Multi-Step or press F8.If you don’t want to trace into functions (in other words, if you want to treat the whole sub-routine or function call as a single assembly-language instruction), make sure that the BL checkbox is selected, as shown:When this checkbox is selected, the Single-Step button will not jump into functions that are called with bl–type instructions. The SWI checkbox works in the same way with swi-type instructions.Examining the Registers and MemoryA debugger’s power lies in the fact that you can see a program’s state while it is stopped: in other words, you can actually see the program’s registers and variables.The Komodo debugger allows you to inspect the ARM microcontroller’s registers at any time: these are all contained in the Registers panel on the left-hand side of the window. All register values are displayed in hexadecimal; if you want to see a register’s value in decimal, pull out your calculator and work it out! Remember that, on the ARM microcontroller, regis-ter PC (the Program Counter) is also known as R15; register R14 is used as LR, the Link Reg-ister; and register R13 is almost always used as SP, the Stack Pointer.You can examine a portion of your program’s memory in the second Memory panel. Simply modify the edit field above the Address label and press E NTER; that section of memory will be displayed in hexadecimal. You can enter the address as a hexadecimal number (with or without the 0x prefix), as a register name or as a label that you defined in your program. Please note that there is a difference between displaying your program’s variables and dis-playing a portion of memory: the difference is who does the interpretation. When you dis-play a section of memory, you are responsible for interpreting that section correctly. Does the area of memory represent a string of bytes? Or a single 32-bit word? Or even an array of pointers? You decide!To help you do this, Komodo allows you to display the area of memory in a variety of for-mats. Simply select a format from the list box above the Address field. The most useful formats are 1 Word for 32-bit words, 1 Half-word for 16-bit half-words and 1 Byte for 8-bit bytes. Other formats can display more than one quantity on a single line.Modifying the Registers and MemoryKomodo allows you to not only examine registers and memory, but to modify them as well. You do need to be careful, however: it is often very easy to crash your own programs when they are presented with unexpected values!To modify one of the ARM microcontroller’s registers, click on that register from the Regis-ter panel, change its value in the edit field above, then press E NTER. As usual, you can use hexadecimal numbers (with or without the 0x prefix), register names, or labels that you havedefined in your program. Once you press E NTER, the register will be modified and the panel will be updated:Modifying the contents of memory is slightly trickier. First, enter the appropriate address in the Address edit field and press E NTER. That address will now be displayed.4 Next, use the T AB key to move to the Hex field (next to the Address field), then use the B ACKSPACE and arrow keys as appropriate to delete any value there. Finally, you can enter the new value asa hexadecimal number, with or without the 0x prefix:Once you have entered the new value, press E NTER. The section of memory will be modified and the address will be automatically incremented to the next location.Downloading an FPGA ConfigurationIn addition to running and debugging your programs, you can use the Komodo debugger to download an FPGA configuration into the Field Programmable Gate Arrays (FPGAs) on the DSLMU Microcontroller Board. Two FPGAs are available on this board: the Xilinx Spartan-XL XCS10XL and the Xilinx Virtex-E XCV300E.To download a configuration into the Xilinx Spartan-XL FPGA, click on the Features button, then select the Spartan XCS10XL tab. You should see the following:You can now click on the Browse button to select your FPGA program; the relevant file will have a .bit extension, as generated by the Xilinx FPGA Tools software. To download to the Xilinx Virtex-E FPGA, select the Virtex-E XCV300E tab instead. This feature is only available when connected to the actual hardware, not to the simulator.4 Please note that the blue highlight might not reflect this new address. In general, it is best to ignore the blue highlight in Memory panels; the blue highlight usually reflects the last line that you selected with the mouse button.Designing for the FPGAs on the DSLMU Microcontroller Board is beyond the scope of this document. Please see the DSLMU Microcontroller Board Hardware Reference Manual for more information; you can find this manual in the board/doc directory on your CD-ROM.Accessing the Komodo TerminalOne of the features of the software running on the DSLMU Microcontroller Board5 is that it allows you to write programs that communicate with the Komodo debugger. This feature is called the terminal, and can be accessed by clicking on the Features button, then selecting the Terminal tab. You will need to make sure that the Active is enabled, as shown below:6Please see the description of the Serial RxD, TxD and Status ports in the DSLMU Microcon-troller Board Hardware Reference Manual to see how you can use the terminal from within your own programs.Example FilesAs already mentioned, the examples directory and its subdirectories on your CD-ROM con-tain many examples of assembly language programs. You can use these example files to practise the debugging steps discussed in this document. And you are encouraged to do so, as “practice makes perfect”!In particular, the examples/intro directory contains the following example files (amongst others); run the debugger on each and follow the suggestions given:pseudo.elf Compare the source code (in pseudo.s) and the disassembledcode in each of the subroutines. You can enter labels likesub1 into the Memory panel to display that portion of yourprogram.subr.elf Try stepping through this program with and without the BLcheckbox being selected. Note how the debugger allows you toeither trace into a function or to execute it as if it were a singleinstruction.jumptbl.elf Stepping through this program will help you understand jumptables.wordcopy.elf Trace through your program, noting how the content of thesrc array is copied to dst. Try modifying elements of src andrerunning the program.Happy debugging!5 The on-board software is called the Komodo ARM Environment. You should be careful not to mix up the Komodo debugger (also called the front-end software) with the Komodo ARM Environment (also called the back-end or systems-level software). Although both work closely together, each performs a very different task. Please see the DSLMU Microcontroller Board Hardware Reference Manual on your CD-ROM for more information.6 Ignore the text in the window in this screen-shot: this was transmitted by an example program run-ning on the DSLMU Microcontroller Board.。
《中药鉴定学英语》课件
color reaction, precision reaction, flame test, etc
Traditional Chinese Medicine Identification Techniques and Methods
03
Visual inspection
Definition
Traditional Chinese medicine identification is an important means to ensure the quality and safety of traditional Chinese medicine products, which is of great significance for maintaining public health and promoting the development of traditional Chinese medicine.
Ancient traditional Chinese medicine identification mainly relied on empirical identification and methods such as taste, nose, eye, and hand touch for identification.
03
Chromatographic methods
using chromographic techniques to separate and identify the components of the medicine
01
Chemical analysis
Using chemical methods to identify the composition and ingredients of the medicine
美国FDA分析方法验证指引中英文对照
美国FDA分析方法验证指南中英文对照美国FDA分析方法验证指南中英文对照八、、I.INTRODUCTIONThis guida nee provides recomme ndati ons to applica nts on submitt ing an alytical procedures, validati on data, and samples to support the docume ntati on of the identity, strength, quality, purity, and potency of drug substances and drug products.1.绪论本指南旨在为申请者提供建议,以帮助其提交分析方法,方法验证资料和样品用于支持原料药和制剂的认定,剂量,质量,纯度和效力方面的文件。
This guida nce is in ten ded to assist applica nts in assembli ng in formati on, submitt ing samples, and prese nti ng data to support an alytical methodologies. The recomme ndati ons apply to drug substa nces and drug products covered in new drug applicati ons (NDAs), abbreviated new drug applicati ons (ANDAs), biologics license applications (BLAs), product license applications (PLAs), and supplements to these即plicatio ns.本指南旨在帮助申请者收集资料,递交样品并资料以支持分析方法。
Introduction to Natural Products Chemistry
ephedrine from Ephedra sinica (respiratory ailments) tetrahydrocann abinol (marijuana)geraniol (rose oil)
cinnamaldehyde (cinnamon)diallyl disulfide (garlic)
Introduction to Natural Products Chemistry
Modern chromatographic methods have been greatly developed to isolate and purify a large number of different compounds in very small quantities: column, GC, TLC, HPLC, paper, electrophoresis, ion exchange, etc.
Natural products are usually given names that are derived from the species name of the plant or animal, or from the biological action, or property, of the compound.
an introduction to analysis
an introduction to analysis Introduction to Analysis: Unveiling the Essence of ThingsAnalysis is a fundamental concept that underlies many disciplines and fields of study. From mathematics to literature, from science to business, analysis allows us to break down complex ideas, phenomena, or problems into simpler components, enabling a better understanding and more effective decision-making. In this article, we will explore the essence of analysis and delve into its various forms, applications, and benefits.I. Defining Analysis: Unveiling the EssenceAt its core, analysis is the systematic examination and understanding of something by breaking it down into its constituent parts. It involves the careful observation, dissection, and interpretation of complex objects or situations, providing valuable insights into their nature, structure, and relationship. Analysis can be seen as a tool or a method used to uncover hidden meanings, patterns, or connections that might not be immediately apparent.II. Forms of Analysis: Beyond Numbers and EquationsWhile analysis is often associated with mathematics and statistics, it extends far beyond numerical data and equations. There are several distinct forms of analysis, each catering to different domains and objectives:1. Mathematical Analysis: This branch of analysis deals with the study of mathematical objects and their properties using logical reasoning, proofs, and computations. It encompasses areas like calculus, differential equations, and real analysis, enabling us to comprehend the behavior of functions, curves, and surfaces.2. Literary Analysis: As the name suggests, this form of analysis focuses on dissecting and interpreting literary works, such as novels, poems, or plays. It involves examining the language, structure, themes, and symbolism employed by the author to uncover deeper meanings and messages hidden within the text.3. Scientific Analysis: In the realm of science, analysis is essential to interpret experimental data, observations, or research findings. Scientists use analytical techniques to uncover patterns,relationships, or trends, aiding in the formulation of hypotheses, theories, or models that explain natural phenomena.4. Business Analysis: Within the business context, analysis plays a crucial role in decision-making, strategy development, and performance evaluation. It involves examining market trends, financial statements, customer behavior, and other relevant data to identify opportunities, risks, or inefficiencies within an organization.III. The Process of Analysis: Unraveling the LayersRegardless of the field or form of analysis, the process typically follows a systematic approach that can be summarized into four key steps:1. Identify the Objective: The first step is to define the purpose and scope of the analysis. What problem are we trying to solve? What insights are we seeking? Having a clear objective ensures focus and provides a framework for the subsequent steps.2. Collect Data: Depending on the analysis, relevant data needs tobe collected. This can involve gathering numerical data, conducting surveys or interviews, or immersing oneself in the subject matter through reading and observation. The key is to compile a comprehensive dataset that aligns with the analysis objective.3. Analyze and Interpret: This is the heart of the process. Here, the data is analyzed, often employing various techniques or tools such as statistical methods, thematic analysis, or logical reasoning. The aim is to derive insights, identify patterns, or draw conclusions from the data to fulfill the analysis objective.4. Communicate Findings: The final step entails presenting the findings in a clear and concise manner. This may involve writing a report, creating visualizations, or delivering a presentation. It is important to convey the results accurately and comprehensively, ensuring that the audience understands the analysis and its implications.IV. The Benefits of Analysis: Enlightening the MindAnalysis provides numerous benefits across different fields and disciplines:1. Enhanced Understanding: By breaking down complex ideas or problems into simpler components, analysis enables a deeper comprehension of the subject matter. It uncovers the underlying principles, structures, or mechanisms that govern a particular phenomenon, shedding light on its essence.2. Informed Decision-Making: Analysis equips individuals with the necessary insights and information to make informed decisions. Whether it is a business strategy, a scientific experiment, or a literary interpretation, analysis provides a solid foundation for choosing the most effective course of action.3. Problem Solving: Analysis equips individuals with critical thinking skills, allowing them to dissect problems, analyze their causes, and propose solutions. It encourages a logical and systematic approach to problem-solving, increasing the probability of successful outcomes.4. Innovation and Creativity: Analysis often reveals connections, patterns, or correlations that might not be immediately apparent. By uncovering such hidden relationships, analysis can sparkcreativity, leading to innovative ideas or approaches that might have otherwise been overlooked.ConclusionIn essence, analysis is a powerful tool that helps us understand the world around us. Whether used in mathematics, literature, science, or business, it enables us to unravel complex concepts and problems, providing valuable insights and empoweringdecision-making. By applying various forms and following a systematic process, analysis fosters deeper understanding, informs decision-making, facilitates problem-solving, and stimulates creativity. It is an indispensable skill that helps us navigate the intricacies of our ever-evolving world.。
an introduction to analysis -回复
an introduction to analysis -回复“an introduction to analysis”(一份分析入门指南)作为一种十分重要的学科和方法,分析在许多领域中都起着关键的作用。
无论是数学、科学还是商业领域,分析都可以帮助我们深入探究问题的本质,并提供准确的解决方案。
本文将逐步回答“an introduction to analysis”这一主题,为读者提供一份帮助理解和应用分析的基础指南。
第一部分:什么是分析?分析是一种研究和解决问题的方法和过程。
通过分析,我们可以将复杂的问题分解成更简单的部分,以便更好地理解和解决。
分析可以应用于各种不同的领域,包括数学、科学、商业和社会科学等。
第二部分:为什么需要分析?分析的重要性在于它能够帮助我们更好地理解问题,并找到最佳的解决方案。
当我们面临一个复杂问题时,分析可以帮助我们确定问题的关键因素,并为我们提供一个有力的工具来处理这些因素。
通过分析,我们可以发现潜在的模式、规律和趋势,从而作出明智的决策。
第三部分:分析的基本原则和方法1. 收集数据:分析的第一步是收集相关的数据。
这些数据可以是实验观测结果、市场调查、统计数据或其他任何能提供问题相关信息的来源。
2. 提出假设:在分析的过程中,我们需要提出一个或多个假设,以便验证和检验问题的解决路径。
通过形成假设,我们可以将问题进一步简化,将注意力集中在关键因素上。
3. 数据分析:一旦收集到足够的数据,我们可以通过使用不同的分析技术来处理和解释这些数据。
这些技术可以包括统计分析、数学建模、模拟实验等。
4. 结果解释:在分析的过程中,我们需要解释和解读分析结果。
这包括找出任何潜在的模式、规律或趋势,并将其与已有的知识框架相联系。
5. 结论和建议:最后,我们根据对问题的深入分析,得出结论和建议。
这些结论和建议可以作为决策制定的依据,帮助解决实际问题。
第四部分:分析的应用领域1. 数学分析:数学分析是一门研究函数、极限和连续性等数学概念和工具的学科。
an introduction to material and industry
an introduction to material and industryMaterials are the building blocks of everything around us. They can be raw, such as metals, ceramics, polymers, and composites, or processed into products we use daily. Understanding materials and their properties is crucial as they play a vital role in various industries, including construction, manufacturing, electronics, aerospace, and healthcare.1. Types of Materials:1.1 Metals:Characteristics: Strong, ductile, high melting point, and good electrical conductivity. Applications: Used in construction (steel beams, wires), automotive (car bodies), electronics (wiring, components), and aerospace (aircraft bodies).1.2 Polymers:Characteristics: Lightweight, flexible, and can be easily molded.Applications: Used in packaging (plastic bags, bottles), toys, medical devices, and clothing.1.3 Ceramics:Characteristics: Hard, brittle, high melting point, and good insulators. Applications: Used in tiles, pottery, insulators, and in some cutting tools.1.4 Composites:Characteristics: Combination of two or more materials to enhance properties. Applications: Used in sports equipment (golf clubs, bicycles), automotive (lightweight body parts), and aerospace (aircraft wings).2. Material Selection:Choosing the right material for a specific application requires understanding its properties, cost, availability, and impact on the environment. Engineers and designers need to consider factors like strength, durability, weight, and corrosion resistance toensure the material can withstand the intended use.3. Industry Overview:3.1 Manufacturing:Materials play a critical role in manufacturing, influencing the production process, quality, and cost of the final product. Advances in material science have led to the development of new materials with enhanced properties, opening up possibilities for innovation and efficiency.3.2 Construction:The construction industry relies heavily on materials such as steel, concrete, and wood. The choice of materials affects the strength, durability, and aesthetics of the building, as well as the cost and speed of construction.3.3 Electronics:The electronics industry requires materials with specific electrical properties. The development of new materials, such as semiconductors and nanomaterials, has been crucial for the miniaturization and performance improvement of electronic devices. 3.4 Aerospace:This industry requires materials that are strong yet lightweight. Advanced composites and alloys have been developed to meet these demands, resulting in more fuel-efficient aircraft.4. Conclusion:Understanding materials and their applications is fundamental to the progress of various industries. As technology advances, the development of new materials with enhanced properties will continue to drive innovation and efficiency across sectors, contributing to economic growth and quality of life improvement. The material and industry relationship is symbiotic, with developments in one area fueling progress in the other.。
ns仿真与简介
NS仿真与简介一NS简介NS是一个由UC Berkeley开发的用于仿真各种IP网络的为主的优秀的仿真软件。
该软件的开发最初是针对基于UNIX系统下的网络设计和仿真而进行的。
Tcl(Tool Command Language)与Tk是安装在UNIX/Linux环境下的两个包,他们一起构成了一套开发系统应用程序和图形用户界面接口(GUI)应用程序的环境。
Tk是Tcl在X Window环境下的扩展,它包含了Tcl的全部c库函数,以及支持X Window的窗口,控件等c库函数,为用户开发图形用户界面提供了方便。
NS的设计实现了使用两种程序设计语言,C++和Otcl。
这两种程序设计语言都是面向对象的。
C++程序模块的运行速度非常快,是强制类型的程序设计语言,容易实现精确的,复杂的算法,但是修改和发现,修正bug所花费的时间较长,因为它比较复杂。
Otcl是脚本程序编写语言,是无强制类型的,比较简单,容易实现和修改,容易发现的修正bug,虽然它的运行速度和C++的模块相比要慢很多。
NS的仿真原理-网络组件。
NSobject是所有基本网络组件的父类它本身的父类是TclObject 类。
这个类的对象有一个基本功能,就是处理数据包(PACKET)。
所有的基本网络组件可以划分为两类,分类器(Classifier)和连接器(Connector)。
它们都是NSobject、的直接子类,也是所有基本网络组件的父类。
分类器的派生类组件对象包括地址分类器和多播分类器等。
连接器的派生类组件对象包括队列,延迟,各种代理,和追踪对象类。
应用程序是建立在传输代理上的应用程序的模拟。
NS2中有两种类型的“应用程序”,数据源发生器和模拟的应用程序。
NS是离散事件驱动的网络仿真器。
它使用Event Scheduler对所有组件希望完成的工作和计划该工作发生的时间进行列表和维护。
NS的工作平台可以是Windows,Linux,Uinx,machitosh,还要求系统装有C++编译器。
introduction and conclusion
Previewing the Message by Stating the Purpose and Forecasting the Organization of the Speech
The speaker should state the purpose directly and provide the information to help the audience to understand it. And make the organization clear.
to conclude , in conclusion , now, to sum up so let me summarize/recap what I've said finally, may I remind you of some of the main points we've con sidered
Introductions and Conclusions
Purposes of the Introduction
Capturing the Attention of the Audience Creating a Common Bond with the Audience Relating the Topic to the Audience Previewing the Message by Stating the Purpose and Forecasting the Organization of the Speech Relating the Speaker to the Topic and Establishing Credibility
Tips for ion
Keep the introduction relatively brief. Be creative in devising your introduction. Don’t worry about the exact wording of your introduction until you have finished preparing the body of the speech. Work out your introduction in detail. Practice the introduction over and over until you can deliver it smoothly from a minimum of notes and with strong eye contact.
关于指南针的英语演讲稿
关于指南针的英语演讲稿英文回答:The compass, a seemingly simple yet remarkable invention, has played a pivotal role in shaping human history. Its ability to provide a consistent and reliable direction has revolutionized navigation, exploration, and our understanding of the world we live in.The earliest known compasses, dating back to the 11th century, were rudimentary devices consisting of a magnetized needle suspended in water. However, it was not until the 13th century that the compass was introduced to Europe, where it quickly found widespread adoption in maritime navigation. By the 15th century, the compass had become an indispensable tool for explorers, enabling them to venture into uncharted waters with confidence.The principle behind the compass is the Earth's magnetic field. The Earth possesses a magnetic dipole, withthe north and south magnetic poles located near the geographic poles. A magnetized needle, when freely suspended, aligns itself with the magnetic field, pointing towards the magnetic north pole. This property allows the compass to provide a constant reference direction, even in the absence of any landmarks or celestial bodies.The invention of the compass had a profound impact on navigation. Prior to its introduction, sailors reliedheavily on landmarks, the stars, and their intuition to determine their course. The compass provided a moreaccurate and consistent means of navigation, enabling mariners to travel longer distances and chart unknown territories.The use of the compass extended beyond maritime navigation. It was also employed in land surveying, mapping, and military operations. The ability to determine direction precisely facilitated the creation of accurate maps and the efficient deployment of troops.The compass has also played a significant role inscientific advancements. It enabled scientists to study the Earth's magnetic field and its variations over time. This knowledge contributed to the development of theories about the Earth's interior and its relationship with the sun and the moon.Furthermore, the compass has been a valuable tool in archaeology and anthropology. It has been used to determine the orientation of ancient structures and artifacts, providing insights into past cultures and civilizations.In the modern era, the compass continues to be an essential tool in various fields. While electronic navigation systems have become more prevalent, the compass remains a valuable backup and is still widely used in aviation, hiking, and other outdoor pursuits.中文回答:指南针,一个简单的发明,在中国北宋时期被发明,在人类历史上发挥着重要的作用。
指出英语作文模板
指出英语作文模板英文回答:Introduction。
Writing an effective essay is an essential skill for students and professionals alike. An essay template can provide a structured framework to help you organize your thoughts, develop a logical flow, and improve the overall quality of your writing.Structure of an Essay Template。
A typical essay template includes the following sections:Introduction。
Hook: Engage the reader with an attention-grabbing statement or question.Background information: Provide context and relevant information related to the topic.Thesis statement: State the main argument or claim that you will support in the essay.Body Paragraphs。
Topic sentence: Introduce the main idea of the paragraph, supporting the thesis statement.Supporting evidence: Provide specific examples, statistics, research findings, or expert opinions to support your claims.Analysis: Explain how the evidence supports your argument and explore its implications.Conclusion。
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
National University of Ireland,MaynoothMaynooth,Co.Kildare,Ireland.Department of Computer ScienceTechnical Report SeriesAn Introduction to NS,Nam and OTclscriptingPaul Meeneghan and Declan DelaneyNUIM-CS-TR-2004-05http://www.cs.may.ie/Tel:+35317083847Fax:+35317083848National University of Ireland, Maynooth Maynooth, Co. Kildare, IrelandDEPARTMENT OF COMPUTER SCIENCETECHNICAL REPORT SERIESNUIM-CS-TR-2004-05An Introduction to NS, Nam and OTcl scripting Paul Meeneghan & Declan DelaneyApril 20041 of 39Contents Page Chapter 1 Overview of NS-21.1 Introduction1.2 Downloading and Installing NAM/NS-21.3 Running NAM/NS-2Chapter 2 Architecture of NS-22.1 Design of NS-22.2 C++/OTcl linkage within the NS-2 architecture 2.3 Characteristics of NS-2Chapter 3 Software Tools used with NS-23.1 NAM3.2 NScript3.3 Topology Generators3.4 Trace Data AnalyzersChapter 4 OTcl Scripting with NS-24.1 Node Creation4.2 Node links4.3 Network Agents4.4 Traffic Applications4.5 Telnet, FTP, HTTP4.6 Ping4.7 Tracing4.8 Routing and Network DynamicsChapter 5 NS-2 OTcl Sample Scripts5.1 OTcl Sample Script 15.2 OTcl Sample Script 25.3 OTcl Sample Script 3References Page2 of 39Chapter 1: Overview of NS-21.1 Introduction to NS-2This report deals with Network Simulator Version 2, also known as NS-2 [20]. NS-2 is an event driven packet level network simulator developed as part of the VINT project (Virtual Internet Testbed)[1]. This was a collaboration of many institutes including UC Berkeley, AT&T, XEROX PARC and ETH. Version 1 of NS was developed in 1995 and with version 2 released in 1996. Version 2 included a scripting language called Object-oriented Tcl (OTcl) [2]. It is an open source software package available for both Windows 32[3] and Linux [4] platforms.NS-2 has many and expanding uses including:• To evaluate the performance of existing network protocols.• To evaluate new network protocols before use.• To run large scale experiments not possible in real experiments.• To simulate a variety of ip networksThis report will discuss in chapter one how to install and operate NS-2 on a Windows 32 and Linux operating system. Chapter 2 explains the architecture of NS-2. Chapter 3 discusses the software tools that are used with NS-2, such as NAM [5, 27], a Network ANimation and visualization tool. An introduction to OTcl coding is given in chapter 4. OTcl is the language that is used to write network topologies for simulation on NS-2. Chapter 5 concludes this report with three samples OTcl scripts describing network protocols and agents discussed in chapter 4.1.2 Downloading and Installing NS-2 and NAMInstalling on Win 32 platformThe Windows 32 version of NS-2 is around 50 MB in size. The Windows 2000 version of this software is available to download (as of April 2004 at /nsnam/dist/). Microsoft Visual Studio version 5.0 [6] is required.3 of 39The disk contains the following files1. Tcl8.3.2.tar.gz2. tk8.3.2.tar.gz3. ns-2.1b9a-win32.exe4. nam-1.0a11a-win32.exe5. compile_dll_D_Win2000_1.00.zipFigure 1: Directory structure of a NS-2 installation on the Windows 32 platformThe following steps are required for successful completion of this installation1. Create a folder and copy the above files into it, e.g. “C:\PROJECT”2. Create two subfolders under the folder created in step 1 and use WinZip [7],WinRar [8] or some other decompression software to decompress the archivesinto the them according to the following table:Subfolder Archives to decompress in itC:\PROJECT\DYNAMIC Tcl8.3.2.tar.gztk8.3.2.tar.gzC:\PROJECT\TEMP compile_dll_D_Win2000_1.00.zipC:\PROJECT\BIN ns-2.1b9a-win32.exenam-1.0a11a-win32.exe4 of 393. Rename ns-2.1b9a-win32.exe and nam-1.0a11a-win32.exe to ns.exe and nam.exerespectively4. Find the file vcvars32.bat on your system (somewhere in the C++ installationfolders). Copy this file to “C:\PROJECT\TEMP”. Edit the file using a text editor to add/modify and, if necessary, delete the quotes from the following lines: set VSCommonDir = Root of Visual Developer Studio Common filese.g. set VSCommonDir=C:\PROGRA~1\MICROS~3\Commonset MSDevDir = Root of Visual Developer Studio installed filese..g. set MSDevDir=C:\PROGRA~1\MICROS~3\Common\msdev98set MSVCDirDir = Root of Visual C++ installed filese.g. set MSVCDir=C:\PROGRA~1\MICROS~3\VC985. Open a command prompt shell and type in the following commands (in bold).C:\>cd C\PROJECT\TEMP (or equivalent directory)C:\PROJECT\TEMP>vcvars32.batC:\PROJECT\TEMP>compile-dll-win32.bat c:\PROJECT6. Finally, add the line “C:\PROJECT\BIN” to the environmental variable PATH(right click ‘my computer’ on the desktop and go to properties).Installing under UnixUnder Linux or Unix the following components can be installed. (Note that installation and compilation under Cygwin is not recommended).• Tcl release 8.4.5 (required component)• Tk release 8.4.5 (required component)• OTcl release 1.8 (required component)• TclCL release 1.15 (required component)• Ns release 2.27 (required component)• Nam release 1.10 (optional component)• Xgraph version 12 (optional component)• CWeb version 3.4g (optional component)• SGB version 1.0 (?) (optional component, builds sgblib for all UNIX type platforms)• Gt-itm gt-itm and sgb2ns 1.1 (optional component)5 of 39• Zlib version 1.1.4 (optional, but required should Nam be used)These files can all be obtained as a single package called ns-allinone (see:/nsnam/ns/ns-build.html#pieces ).Once the source code for the various components has been obtained, unpack the OTcl, TclCL and ns sources into the same top level directory and build them using the following commands:• cd into the OTcl directory• run ./configure• run make• cd into the TclCL directory• run ./configure• run make• cd into the ns directory• run ./configure• run makeFigure 2 shows the directory structure of NS-2/NAM on the Linux platform.Figure 2: Directory structure of a NS-2 installation on the Linux platform6 of 391.3 Running NAM/NS-2To run NS-2 in WindowsChange directory to the location where ns is installed (bin directory) e.g.“C:\PROJECT\BIN.” To run the ns executable type ‘ns <Tclscript>’Alternatively to run NS-2 through the Tcl interpreter Wish83.exe type ‘ns <Tclscript>’ where Tclscript is the name of the Tcl script written i.e. file.TclTo run NS-2 in LinuxEnsure that the location of ns is added to the environmental variable PATH and then type: ‘ns <Tclscript>’To run NAMChange directory to the directory where ns is installed (bin directory) e.g.“C:\PROJECT\BIN”. To run the NAM executable type ‘nam <tracefile>’where tracefile is the name of the trace file produced i.e. file.tr7 of 39Chapter 2 Architecture of NS-22.1 Design of NS-2As shown in the simplified user's view of Figure 3, NS is an Object-oriented Tcl (OTcl) script interpreter that has a simulation event scheduler and network component object libraries, and network set-up (plumbing) module libraries.Figure 3. Simplified User's View of NS-2 [9]To use NS-2, a user programs in the OTcl script language.An OTcl script will do the following.• Initiates an event scheduler.• Sets up the network topology using the network objects.• Tells traffic sources when to start/stop transmitting packets through the event scheduler.A user can add OTcl modules to NS-2 by writing a new object class in OTcl. These then have to be compiled together with the original source code.Another major component of NS besides network objects is the event scheduler. An event in NS is a packet ID that is unique for a packet with scheduled time and the pointer to an object that handles the event. The event scheduler in NS-2 performs the following tasks: • Organises the simulation timer.8 of 39• Fires events in the event queue.• Invokes network components in the simulation.Depending on the user’s purpose for an OTcl simulation script, simulation results are stored as trace files, which can be loaded for analysis by an external application:1. A NAM trace file (file.nam) for use with the Network Animator Tool2. A Trace file (file.tr) for use with XGraph [10] or TraceGraph [11].Figure 4: Flow of events for a Tcl file run in NS2.2 C++/OTcl linkageNS–2 is written in C++ with OTcl interpreter as a front end. For efficiency reason, NS separates the data path implementation from control path implementations.What Languages are used with NS-2?• Split-Language programming is used1. Scripting Language (Tcl - Tool Command Language and pronounced‘tickle’)2. System Programming Language (C/C++)• Ns is a Tcl interpreter to run Tcl Scripts9 of 39•By using C++/OTcl, the network simulator is completely Object-oriented.In terms of lines of source code, NS-2 was written with 100k lines of C++ code, 70k lines of Tcl code and 20k of documentation.The TCL interpreter: TclCL is the language used to provide a linkage between C++ and OTcl. Toolkit Command Language (Tcl/OTcl) scripts are written to set up/configure network topologies. TclCL provides linkage for class hierarchy, object instantiation, variable binding and command dispatching. OTcl is used for periodic or triggered events The following is written and compiled with C+ • • Event Scheduler Basic network component objectsFigure 5. C++ and OTcl: The Duality [9]Figure 6. Architectural View of NS [9]These compiled objects are made available to the OTcl interpreter through an OTcl linkage that creates a matching OTcl object for each of the C++ objects and makes the control functions and the configurable variables specified by the C++ object act as10 of 39member functions and member variables of the corresponding OTcl object. It is also possible to add member functions and variables to a C++ linked OTcl object.TCL Scripts - Setup/Config of network simulationATclCL-acts as a link between A-Ns is written in C++ - New components added are written in C++Band BFigure 7: TclCL provides the linkage between C++ and OTCL2.3Characteristics of NS-2NS-2 implements the following features 1. Router queue Management Techniques DropTail, RED, CBQ, 2. Multicasting 3. Simulation of wireless networks • • • Developed by Sun Microsystems + UC Berkeley (Daedalus Project) Terrestrial (cellular, adhoc, GPRS, WLAN, BLUETOOTH), satellite IEEE 802.11 can be simulated, Mobile-IP, and adhoc protocols such as DSR, TORA, DSDV and AODV. 4. Traffic Source Behaviour- www, CBR, VBR 5. Transport Agents- UDP/TCP 6. Routing 7. Packet flow 8. Network Topology 9. Applications- Telnet, FTP, Ping 10. Tracing Packets on all links/specific links11 of 39Chapter 3 Software Tools used with NS-23.1 NAMNAM [5, 27] provides a visual interpretation of the network topology created. The application was developed as part of the VINT project. Its features are as follows. Figure 8 displays the NAM application and its components. • • • • • Provides a visual interpretation of the network created Can be executed directly from a Tcl script Controls include play, stop ff, rw, pause, a display speed controller and a packet monitor facility. Presents information such as throughput, number packets on each link. Provides a drag and drop interface for creating topologies.Figure 8:NAM tool description12 of 393.2 • •Nscript A Graphical User Interface for building ns-TCL scripts The topology is built by drawing it. Nodes/Agents can be added with drag-anddrop to the edit screen. The TCL code is automatically created in the Tcl/Tk Script screen. • Nscript is written in Java [13].Uses of nscript: 1. Create complete topologies by adding nodes and links 2. Add and create transport agents i.e. UDP, TCP 3. Schedule simulation events i.e. sending/queuing packets 4. Create user defined libraries i.e. PING agent 5. The scripts created can be exported and run in NS. Downloads: 1. Nscript-103 is available at [12]Figure 9:Nscript application 3.3 Topology GeneratorsTopology Generators [24,26] are used with NS-2 to create a network topology to simulate a certain network model. Each topology generator provides a Graphical User Interface.13 of 39The user can then choose the structure of the topology e.g. number of nodes. When this is complete the generator can be run to produce TCL code depicting the topology for use with NS-2. The four most common topology generators are as follows. GT-ITM [13] This generator focuses on reproducing the hierarchical structure of the topology of the Internet based on the TS (Transit Stub) The steps are as follows • • • A connected random graph is first generated (using the Waxman model) Each node in the graph represents an Entire Transit Domain. For each node in the Transit domain- a number of random graphs are generated representing a Stub Domain that are attached to that node. Tiers [14] This is based on a three level hierarchy aimed at reproducing the differentiation between WAN, MAN and LAN compromising the Internet. Brite [15] This is a single generation model providing several degrees of freedom with respect to how nodes are placed in the plane. The properties of an interconnection method are used. Inet [16] This generator initially assumes node degrees from a power law distribution. The steps of this generator are as follows • • • 3.4 Forms a spanning tree using nodes of degree greater than two. Attaches nodes with degree one to the spanning tree. Matches the remaining unfulfilled degrees of all nodes with each other. Trace Data AnalyzersThis section describes XGraph and TraceGraph, two applications used to analyse trace files produces from a simulation14 of 39XGraph [10] . XGraph is an X-Windows application that includes:• •Interactive plotting and graphing Animation and derivativesTo use XGraph in NS-2 the executable can be called within a TCL Script. This will then load a graph displaying the information visually displaying the information of the trace file produced from the simulationFigure 10: XGraph running comparing three trace files in a graph To call XGraph within an nscript, the line indicated in bold in Figure 11 is used. It is worth noting that Figure 11 defines a procedure called finish(). In this case the trace file out0.tr is used. Multiple trace files can be taken is as arguments. This will produce a graph of size 800x400 displaying information on the traffic flow and time (Figure 10).15 of 39proc finish {} { global f0 f1 f2 #Close the output files close $f0 close $f1 close $f2 #Call XGraph to display the results exec xgraph out0.tr -geometry 800x400 & exit 0 } Figure 11: XGraph called within a OTcl scriptTraceGraph TraceGraph [11] is a trace file analyser that runs under Windows, Linux and UNIX systems and requires Matlab 6.0 [18] or higher. Two sample plots are shown in Figure 12. TraceGraph supports the following trace file formats.• • •Wired Satellite Wireless (old and new trace)Version 2.02 has the following features/options• • •238 2D graphs 12 3D graphs Delays, jitter, processing times, Round Trip Times, number of intermediate nodes, throughput graphs and statistics The whole network, link and node graphs and statistics All the results can be saved to text files, graphs can also be saved as jpeg and tiff x, y, z axes information: minimum, mean, maximum, standard deviation, median• • •16 of 39• •Any graph saved in text file with 2 or 3 columns can be plotted Script files processing to do the analysis automatically.Figure 12: TraceGraph analysing a trace file to produce numerous graphs17 of 39Chapter 4 OTcl Scripting with NS-2 [19,21,23,29]4.1 Node CreationIn NS-2, the network is constructed using nodes which are connected using links. Events are scheduled to pass between nodes through the links. Nodes and links can have various properties associated with them. Agents can be associated with nodes and they are responsible for generating different packets (e.g. TCP agent or UDP agent). The traffic source is an application which is associated with a particular agent (e.g. ping application). This is illustrated in Figure 13.ApplicationAgentLinkNode 1 Node 2Figure 13: NS-2 is very structured. This diagram shows two nodes, a link, an agent and an application.The overall structure of an OTcl script is as follows Event scheduling • • • Create scheduler -> set ns [new Simulator] Schedule Event -> $ns at <time> <event> Start scheduler -> $ns run18 of 39To create a node the simulator node object is used. The following two lines create two node objects and assigns them the handles “n0” and “n1” respectively using the command ‘set.’ set n0 [$ns node] set n1 [$ns node] The following creates 5 nodes, with handles n0-n4 for {set i 0} {$i<5} {incr i} { Set n($i) [$ns node] } To set the colour of a node, the following code is used. $n0 color <colour> where <colour> is black, re, blue, seaGreen.4. 2 •Node links A Simplex link (one way) -> $ns simplex-link $n0 $n1 <bandwidth> <delay> <queue_type>A unidirectional link between the two nodes is created as followsA bi-directional link between the two nodes is created as follows• A duplex link (both ways) ->$ns duplex-link $n0 $n1<bandwidth> <delay> <queue_type> Note: In this example the link is between node 0 and node 1. Sample values for bandwidth and delay could be 1Mb and 10ms respectively. NS-2 supports numerous queue types including FIFO, RED (Random Early Detection), Drop Tail, FQ (Fair Queuing), SFO(Stochastic) 4.3 Network AgentsTraffic generation in NS-2 is based on the objects of two classes, the class Agent and the class Application. Every node in the network that needs to send or receive traffic has to19 of 39have an agent attached to it. On top of an agent runs an application. The application determines the kind of traffic that is simulated.There are two types of agents in NS-2: UDP and TCP agents• UDPset udp0 [new Agent/UDP]set null [new Agent/NULL]$ns attach-agent $n0 $udp0 # attach the udp0 agent#to node 0$ns attach-agent $n1 $null$ns connect $udp $null # connect the 2 agentsThis code first creates a UDP agent and attaches it to n0 using the attach-agent procedure. It then creates a Null agent, which will act as a traffic sink and attach it to n1. The two agents are connected using the simulator method connect.To add a Loss Monitor to the agent the following OTcl code is used. TheAgent/LossMonitor can monitor number of packets transferred, as well as packets lost. A procedure can be scheduled to poll the LossMonitor every T seconds and obtain throughput information.• set lossMonitor [new Agent/LossMonitor]• $ns_ connect $udp0 $lossMonitor• TCPset tcp [new Agent/TCP]set tcp_sink [new Agent/TCPSink]$ns attach-agent $n0 $tcp # attach the tcpagent to node 0$ns attach-agent $n1 $tcp_sink$ns connect $tcp $tcp_sink # connect the 2 agentsThis code first creates a TCP agent and attaches it to the tcp node using the attach-agent procedure. It then creates a TCPSink agent, which will act as a TCP sink, and attaches it to the node tcp_sink. The two agents are connected using the simulator method connect. The following types of TCP are available in NS-2:TCP, TCP/Reno, TCP/Vegas, TCP/Sack1, TCP/Fack, TCPSink.4.4 Traffic ApplicationsThis section will discuss four traffic applications that go on top of a UDP agent to simulate network traffic.CBR (Constant Bit Rate)A CBR traffic object generates traffic according to a deterministic rate. Packets are a constant size. The OTcl code to implement a CBR traffic source in a simulation is as follows:• set my_cbr [new Application/Traffic/CBR]• $my_cbr attach-agent $udp• $ns at <time> “$my_cbr start”Parameters:• start: starts sending packets according to the configuration parameters• stop: stops sending packetsConfiguration parameters:• PacketSize_: constant size of packets generated e.g 48• rate_: sending rate e.g. 64kb• interval_: (optional) interval time between packets e.g 0.05• random_: Flag to introduce noise in the departure times, default is off, 1 for on • maxpkts_: the maximum number of packets to send e.g 1000ExponentialTraffic is determined by an exponential distribution. Packets are a constant size. This produces an on/off distribution. Packets are sent at a fixed rate during on periods. No packets are sent during off periods.TCL code to implement a CBR traffic source in a simulation:• set my_exp [new Application/Traffic/Exponential]Configuration parameters• PacketSize_: constant size of packets generated e.g 210• burst_time_: average on time for the generator e.g. 500ms• idle_time_: average off time for the generator e.g 500ms• rate_: sending rate during the “on” time e.g. 100kParetoThe distribution for traffic generation is taken from a pareto on/off distribution. This is generally used to generate aggregate traffic that exhibits long range dependency. The following is OTcl code to implement a Pareto traffic source in a simulation. Idle times are taken from a pareto distribution.• set my_pareto [new Application/Traffic/Pareto]Configuration parameters• PacketSize_: constant size of packets generated e.g. 210• burst_time_: average on time for the generator e.g. 500ms• idle_time_: average off time for the generator e.g. 500ms• rate_: sending rate during the “on” time e.g. 100k• shape_: the shape parameter used by the pareto distribution e.g. 1.5TrafficTraceTraffic is generated according to a trace file. The binary file must contain 2 x 32 fields in network (big-endian) byte order. The first field contains the time in ms until next packet is generated. The second field contains the length in bytes of the next packet. The method filename of the Tracefile class associates a trace file with the Tracefile object.The following is OTcl code to implement a Trace file traffic source in a simulation:• set t_file [new Tracefile]• $t_file filename <file>• set src [ new Application/Traffic/Trace]• $src attach-tracefile $t_filewhere $t_file is a binary file and the two fields in the file contain inter-packets times in milliseconds and packet size in bytes.4.5 Telnet, FTP, HTTPTwo simulation applications exist to send traffic on top of a TCP object: Application/FTP and Application/TelnetFile Transfer Protocol (FTP- for simulating bulk data transfer)OTCL Code for using FTP in a simulation:• set ftp [new Application/FTP]• $ftp attach-agent $tcp• $ns at <time> “$ftp start”Parameters• attach-agent: attach-agent: attaches an Application/FTP agent to an agent• start: start the Application/FTP to send data• stop: stop sending data• produce n: where n is the counter of packets to be sent• producemore n: where n is the new increased value of packets to be sent • send n: similar to producemore, but sends n bytes instead of packetsTelnetOTcl code for using Telnet in a simulation:• set telnet [new Application/Telnet]• $telnet attach-agent $tcpParameters• start; start producing packets• stop: stop producing packets• attach-agent: attaches a Telnet object to an agentConfiguration Parameters• interval_: The average inter-arrival time in seconds for packets generated by the Telnet objectif(interval_ == 0) Inter arrival times taken from the tcplib distribution.if(interval_ != 0) Inter arrival times taken from the exponential distribution,average is set to what interval_ is.HTTPThe following is OTcl code for implementing HTTP(server and client) in a simulation.• Application HTTP–Client node:set client [new HTTP/Client $ns $node0]$client connect $server–Server node:set server [new HTTP/Server $ns $node1]$server set-page-generator $pgp4.6 PingThe following OTcl code is added to a simulation script to create the Ping agent:#Define a 'recv' function for the class 'Agent/Ping'Agent/Ping instproc recv {from rtt} {$self instvar node_puts "node [$node_ id] received ping answer from \ $from with round-trip-time $rtt ms."}To ping a node from another node, ping agents must be set up on both nodesset PingAgent1 [new Agent/Ping]$ns attach-agent $node0 $ PingAgent1set PingAgent2 [new Agent/Ping]$ns attach-agent $node1 $ PingAgent2The two ping agents are connected as follows$ns connect $pB $p3To ping a node the following code is used$ns at 0.1 "$PingAgent1 send"The following could be added to draw a square box around the pinging node in NAM $ns at 0.1 "$node0 add-mark m0 red box"The following could be added to print out to the screen in NAM$ns at 0.1 "$ns trace-annotate \"Pinging node 1 from node 0 ""4.7 TracingA Trace file contains all information needed for animation purposes- both on a static network layout an on dynamic events such as packet arrivals, departures, drops and link failures.Tracing in NS-2 is implemented with the following OTcl code.To Trace packets on all links• set trace_file [open out.tr w]• $ns trace-all $trace_file• $ns flush-trace• close $trace_fileAn example of a standard trace file in NS-2 follows and its format is shown in Figure 14:+ 1.84375 0 2 cbr 210 ------- 0 0.0 3.1 225 610- 1.84375 0 2 cbr 210 ------- 0 0.0 3.1 225 610r 1.84471 2 1 cbr 210 ------- 1 3.0 1.0 195 600r 1.84566 2 0 ack 40 ------- 2 3.2 0.1 82 602+ 1.84566 0 2 tcp 1000 ------- 2 0.1 3.2 102 611- 1.84566 0 2 tcp 1000 ------- 2 0.1 3.2 102 611r 1.84609 0 2 cbr 210 ------- 0 0.0 3.1 225 610+ 1.84609 2 3 cbr 210 ------- 0 0.0 3.1 225 610d 1.84609 2 3 cbr 210 ------- 0 0.0 3.1 225 610- 1.8461 2 3 cbr 210 ------- 0 0.0 3.1 192 511r 1.84612 3 2 cbr 210 ------- 1 3.0 1.0 196 603+ 1.84612 2 1 cbr 210 ------- 1 3.0 1.0 196 603- 1.84612 2 1 cbr 210 ------- 1 3.0 1.0 196 603+ 1.84625 3 2 cbr 210 ------- 1 3.0 1.0 199 612This trace file exert contains five enqueue operations(‘+’), four dequeue operations(‘-’), four receive events (‘r’) and one drop event(‘d’). The columns1 Operation performed in the simulation2 Simulation time of event occurrence3 Node 1 of what is being traced4 Node 2 of what is being traced5 Packet type6 Packet size7 Flags8 IP flow identifier9 Packet source node address10 Packet destination node address11 Sequence number12 Unique packet identifierFigure 14:Trace file data explanationDepending on the simulation, different trace file formats are produced. A full list of these formats can be found at /~wbiao/ns2/traceformats/To trace a specific link• ns trace-queue $node0 $node1 $trace_fileTo trace up variable tracing in NS-2• set cwnd_chan_ [open all.cwnd w]• $tcp trace cwnd_ # tcp tracing its own variable cwnd_chan_• $tcp attach $ cwnd_chan_The variable sstthresh of $tcp is traced by a generic $tracer• Set tracer [new Trace/Var]• $tcp trace ssthresh_ $tracer。