三峡大学科技学院毕业设计外文翻译

ORIGINAL PAPEREggshell crack detection based on acoustic response and support vector data description algorithmHao Lin ÆJie-wen Zhao ÆQuan-sheng Chen ÆJian-rong Cai ÆPing ZhouReceived:21May 2009/Revised:27August 2009/Accepted:28August 2009/Published online:22September 2009ÓSpringer-Verlag 2009Abstract A system based on acoustic resonance and combined with pattern recognition was attempted to dis-criminate cracks in eggshell.Support vector data descrip-tion (SVDD)was employed to solve the classification problem due to the imbalanced number of training samples.The frequency band was between 1,000and 8,000Hz.Recursive least squares adaptive filter was used to process the response signal.Signal-to-noise ratio of acoustic impulse response was remarkably enhanced.Five charac-teristics descriptors were extracted from response fre-quency signals,and some parameters were optimized in building model.Experiment results showed that in the same condition SVDD got better performance than con-ventional classification methods.The performance of SVDD model was achieved with crack detection level of 90%and a false rejection level of 10%in the prediction set.Based on the results,it can be concluded that the acoustic resonance system combined with SVDD has significant potential in the detection of cracked eggs.Keywords Eggshell ÁCrack ÁDetection ÁAcoustic resonance ÁSupport vector data descriptionIntroductionIn the egg industry,the presence of cracks in eggshells is one of the main defects of physical quality.Cracked eggsare very vulnerable to bacterial infections leading to health hazards [1].It mostly results in significant economic loss in the egg industry.Recent research shows that it is possible to detect cracks in eggshells using acoustic response analysis [2–5].Supervised pattern recognition models were also employed to discriminate intact and cracked eggs [6].In these previous researches,training of discrimination models needs a considerable amount of intact egg samples and also corresponding defective ones.However,it is more difficult to acquire sufficient naturally cracked eggs samples than intact ones.Artificial infliction of cracking in eggs is time-consuming and a waste.Moreover,the artificially cracked eggs may not provide completely authentic information on naturally cracked ones.So,the traditional discrimination model shows poor performance when the numbers of sam-ples from the two classes are seriously unbalanced,because the samples of minority group cannot provide sufficient information to support the ultimate decision function.Support vector data description (SVDD),which is inspired by the theory of two-class support vector machine (SVM),is custom-tailored for one-class classification [7].One-class classification is always used to deal with a two-class classification problem,where each of the two classes has a special meaning [8].The two classes in SVDD are target class and outlier class,respectively.Target class is assumed to be sampled well,and many (training)example objects are available.The outlier class can be sampled very sparsely,or can be totally absent.The basic idea of SVDD is to define a boundary around samples of target with a volume as small as possible [9].SVDD has been used to solve the problem of unbalanced samples in the field of machine faults diagnosis,intrusion detection in the network,recog-nition of handwritten digits,face recognition,etc.[10–13].In this work,the algorithm of SVDD was employed to solve the classification problem of eggs due to imbalancedH.Lin ÁJ.Zhao (&)ÁQ.Chen ÁJ.Cai ÁP.ZhouSchool of Food and Biological Engineering,Jiangsu University,212013Zhenjiang,People’s Republic of Chinae-mail:zjw-205@;zhao_jiewen@ H.Line-mail:linhaolt794@Eur Food Res Technol (2009)230:95–100DOI 10.1007/s00217-009-1145-6number of samples.In addition,recursive least squares (RLS)adaptive filter was used to enhance the signal-to-noise ratio.Some excitation resonant frequency charac-teristics of signals were used as input vectors of SVDD model to discriminate intact and cracked eggs.Materials and methods Samples preparationAll barn egg samples were collected naturally from a poultry farm and they were intensively reared.These eggs were on maximum 3days old when they were measured.As much as 130eggs with intact shells and 30eggs with cracks were measured.The sizes of eggs ranged from peewee to jumbo.Irregular eggs were not incorporated into the data analysis.The cracks,which were 10–40mm long and less than 15-l m wide,were measured by a micrometer.Both,intact and cracked samples,were divided into two subsets.One of them called calibration set was used to build a model,and the other one called prediction set was used to test the robustness of the model.The calibration set contained 120samples;the number of intact and cracked samples were 110and 10,respectively.The remaining 40samples constituted the prediction set,with 20intact eggs and 20cracked ones.Experimental systemA system based on acoustic resonance was developed for the detection of crack in eggshell.The system consists of a product support,a light exciting mechanism,a microphone,signal amplifiers,a personal computer (PC)and software to acquire and analyze the results.A schematic diagram of the system is presented in Fig.1.A pair of rolls made of hard rubber was used to support the eggs,and the shape of the support was focused to normal eggshell surfaces.The excitation set included an electromagnetic driver,an adjustable volt DC power and a light metallic stick.The total mass of the stick was 6g,and its length 6cm.The excitation force is an important factor that affects the magnitude and width of the pulse.The adjustable volt DC power was used to control the excitation force.Based on previous test,the voltage of excitation was set at 30V.In this case,optimal signals were achieved without instrumentation overload.The impacting position was close to the crack in the cracked eggshells,which was placed randomly among intact eggshells.Data acquisition and analysisResponse signals obtained from the microphone were amplified,filtered and captured by a 16-bit data acquisition card.The program of data acquisition was compiled based on LabVIEW8.2software(National Instruments,USA)that allows a fast acquisition and processing of the response signal.The sampling rate was 22.05kHz.The time signal was transformed to a frequency signal by using a 512-point fast Fourier (FFT)transformation.The linear frequency spectrum accepted was transformed to a power spectrum.A band-pass filter was used to preserve the information of the frequency band between 1,000and 8,000Hz,because the features of response signals were legible in this frequency band and the signal-to-noise here was also favorable.Brief introduction of support vector data description (SVDD)SVDD is inspired by the idea of SVM [14,15].It is a method of data domain description also calledone-classFig.1Eggshell crackmeasurement system based on acoustic resonance analysisclassification.The basic idea of SVDD is to envelop samples or objects within a high-dimensional space with the volume as small as possible byfitting a hypersphere around the samples.The sketch map in two dimensions of SVDD is shown in Fig.2.By introducing kernels,this inflexible model becomes much more powerful and can give reliable results when a suitable kernel is used[16]. The problem of SVDD is tofind center a and radius R, which have the minimum volume of hypersphere contain-ing all samples X i.For a data set containing i normal data objects,when one or a few very remote objects are in it,a very large sphere is obtained,which will not represent the data very well.Therefore,we allow for some data points outside the sphere and introduce slack variable n i.As a result,the minimization problem can be denoted in thefollowing form:min LðRÞ¼R2þCX Ni¼1n i;s:t x iÀak k2R2þn i;n i!0ði¼1;2;...;NÞ;9>>>>>=>>>>>;ð1Þwhere the variable C gives the trade-off between simplicity (volume of the sphere)and the number of errors(number of target objects rejected).The above problem is usually solved by introducing Lagrange multipliers and can be transformed into maximizing the following function L with respect to the Lagrange multipliers.For an object x,we definef2ðxÞ¼xÀak k2¼ðxÁxÞÀ2X Ni¼1a iðzÁx iÞþX Ni¼1X Nj¼1a i a jðx iÁx jÞ:ð2ÞThe test objects x is accepted when the distance is smaller than the radius.These objects are called the support objects of the description or the SVs.Objects lying outside the sphere are also called bounded support vectors(BSVs). When a sphere is not always a goodfit for the boundary of data distribution,the inner product(x,y)is generalized by a kernel function k x;yðÞ¼/xðÞ;/yðÞf g;where a mapping/ of the data to a new feature space is applied.With such mapping,Eq.(2)will then becomeL¼P Ni¼1a i kðx i;x iÞÀP Ni¼1P Nj¼1a i a j kðx i;x jÞ;s:t0a i C;P Ni¼1a i¼1and a¼Pia i/ðx iÞ:9>>>=>>>;ð3ÞIn brief,SVDDfirst maps the data which are not linearly separable into a high-dimensional feature space and then describe the data by the maximal margin hypersphere.SoftwareAll data-processing algorithms were implemented with the statistical software Matlab7.1(Mathworks,USA)under Windows XP.SVDD Matlab codes were downloaded from http://www-ict.ewi.tudelft.nl/*davidt/dd_tools.html free of charge.Result and discussionResponse signalsSince the acoustic response was an instantaneous impulse, it was difficult to discriminate between the different response signals of cracked and intact eggs in the time domain.The time domain signals were transformed by FFT to frequency domain signals for the next analysis.Typical power spectra of intact egg and cracked egg are shown in Fig.3,and the areas under the spectral envelope for the intact eggs were smaller than that of the cracked eggs.For the intact eggs,the peak frequencies were prominent, generally found in the middle place(3,500–5,000Hz).In contrast,the peak frequencies of cracked eggs were dis-perse and not prominent.Adaptive RLSfilteringSince the detection of cracked eggshells is based on acoustic response measurement,it is vulnerably interfered by the surrounding noise.This fact is reinforced by the much damped behaviors of agro-products[17].Therefore, response signal should be processed to remove noise in further analysis.Adaptive interference canceling is a standard approach to remove environmental noise[18,19].The RLS is a popular algorithm in thefield of adaptive signal processing. In adaptive RLSfiltering,the coefficients are adjusted from sample to sample to minimize the mean square error(MSE) between a measured noisy scalar signal and itsmodeledvalue from the filter [20,21].A scalar,real output signal,y k ,is measured at the discrete time k ,in response to a set of scalar input signals X k ði Þ;i ¼1;2;...;n ;where n is an arbitrary number of filter taps.For this research,n is set to the number of degrees of freedom to ensure conformity of the resulting filter matrices.The input and the output sig-nals are related by the simple regression model:y k ¼X n À1i ¼0w ði ÞÁx k ði Þþe k :ð4Þwhere e k represents measurement error and w (i )represents the proportion that is contained in the primary scalar signal y k .The implementation of the RLS algorithm is optimized by exploiting the inversion matrix lemma and provides fast convergence and small error rates [22].System identification of a 32-coefficient FIR filter combined with adaptive RLS filtering was used to process the signals.The forgetting factor was 1,and the vector of initial filter coefficients was 0.Figure 4shows the fre-quency signals before and after adaptive RLS filtering.Variable selectionBased on the differences of frequency domain response signals from intact and cracked eggs,five characteristic descriptors were extracted from the response frequency signals as the inputs of the discrimination model.These are shown in Table 1.Parameter optimization in SVDD modelThe basic concept of SVDD is to map nonlinearly the original data X into a higher-dimensional feature space.The transformation into a higher-dimensional space is implemented by a kernel function [23].So,selection of kernel function has a high influence on the performance of the SVDD model.Several kernel functions have been proposed for the SVDD classifier.Not all kernel functions are equally useful for the SVDD.It has been demonstrated that Gaussian kernel results in tighter description and gives a good performance under general smoothness assumptions [24].Thus,Gaussian kernel was adopted in this study.To obtain a good performance,the regularization parameter C and the kernel function r have to be opti-mized.Parameter C determines the trade-off between minimizing the training error and minimizing model complexity.By using Gaussian kernel,the data description transforms from a solid hyper-sphere to a Parzen density estimator.An appropriate selection with width parameter r of Gaussian kernel is important to the density estimation of target objects.There is no systematic methodology for the optimization of these parameters.In this study,the procedure of opti-mization was carried out in two search steps.First,a comparatively large step length was attempted to search optimal value of parameters.The favorable results of the model were found with values of C between 0.005and 0.1,and values of r between 10and 500.Therefore,a much smaller step length was employed for further searching these parameters.In the second search step,50parameter r values with the step of 10(r =10,20–500)and 20parameter C values with the step of 0.005(C =0.005,0.01–1)were tested simultaneously in the building model.Identification results of SVDD model influenced by values of r and C are shown in Fig.5.The optimal model was achieved when r was equal to 420and C was equal to 0.085or 0.09.Here,the identification rates of intactandFig.3Typical response frequency signal ofeggsFig.4Frequency signals before and after adaptive RLS filteringcracked eggs were both 90%in the prediction set.Fur-thermore,it was found that the performance of the SVDD model could not be improved by smaller search parison of discrimination modelsConventional two-class linear discrimination analysis (LDA)model and SVM model were used comparatively to classify intact and cracked eggs.Gaussian kernel was recommended as the kernel function of the SVM model.Parameters of SVM model were also optimized as in SVDD.Table 2shows the optimal results from three dis-crimination models in the prediction set.Identification rates of intact eggs were both 100%in the LDA and SVM models,but 50and 35%for cracked eggs,respectively.In other words,at least 50%of cracked eggs could not be identified in conventional discrimination model.However,detection of cracked eggs is the task we focus on.The identification rates of intact and cracked eggs were both 90%in the SVDD pared with conventional two-class discrimination models,SVDD model showed its superior performance in the discrimination of cracked eggs.LDA is a linear and parametric method with discrimi-nating character.In terms of a set of discriminant functions,the classifier is said to assign an unknown example X to thecorresponding class [25].In the case of conventional LDA classification,the ultimate decision function is based on sufficient information support from two-class training samples.In general,such classification does not pay enough attention to the samples in minority class in building model.It is possible to obtain an inaccurate estimation of the centroid between the two classes.Conventional LDA clas-sification always poorly describes the specific class with scarce training samples.Therefore,it is often unpractical to solve the classification problem using tradition LDA clas-sifier,in case of imbalanced number in training samples.The basic concept of SVM is to map the original data X into a higher-dimensional feature space and find the ‘optimal’hyperplane boundary to separate the two classes [26].In SVM classification,the ‘optimal’boundary is defined as the most distant hyperplane from both sets,which is also called the ‘middle point’between the clas-sification sets.This boundary is expected to be the optimal classification of the sets,since it is the best isolated from the two sets [27].The margin is the minimal distance from the separating hyperplane to the closest data points [28].In general,when the information support from both positive and negative training sets are sufficient and equal,an appropriate separating hyperplane can be obtained.How-ever,when the samples from one class are insufficient to support the separating hyperplane,it will result in the hyperplane being excessively close to this class.As a result,most of the unknown sets may be recognized as the other class.Therefore,compared with other discrimination models,SVM showed poorest performance in discrimi-nating cracked eggs.Differing from conventional classification-based app-roach,SVDD is an approach for one-class classification.ItTable 1Frequencycharacteristics selection and expressionSome Low frequency band:1,000–3,720Hz,Middlefrequency band:3,720–7,440HzVariables Resonance frequency characteristics Expression X1Value of the area of amplitudeX 1¼P512i ¼0PiX2Value of the standard deviation of amplitude X 2¼ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiðPi ÀP Þq=nX3Value of the frequency band of maximum amplitude X 3¼Index max ðPi ÞX4Mean of top three frequency amplitude values X 4¼Max 1:3ðPi Þ=3X5Ratio of amplitude values of middle frequency bands to low frequency bandX 5¼P 200i ¼1Pi P 400i ¼201Pi200Fig.5Identification rates of SVDD models with different values ofparameter r and CTable 2Comparison of results from three discrimination models ModelIdentification rates in the prediction set (%)Intact eggsCracked eggs LDA 10050SVM 10035SVDD9090focuses mainly on normal or target objects.SVDD can handle cases with only a few outlier objects.The advantage of SVDD is that the target class can be any one of two training classes.The selection of the target class depends on the reliability of the information provided from training samples.In general,the class containing more samples may provide sufficient information,and it can be selected as target class[29].Furthermore,SVDD can adapt to the real shape of samples andfindflexible boundary with a mini-mum volume by introducing kernel function.The boundary is described by a few training objects,the support vectors. It is possible to replace normal inner products with kernel functions and obtain moreflexible data descriptions[30]. Width parameter r can be set to give the desired number of support vectors.In addition,extra data on the form of outlier objects can be helpful to improve the performance of the SVDD model.ConclusionsDetection of crack in eggshell based on acoustic impulse resonance was attempted in this work.The SVDD method was employed for solving classification problem where the samples of cracked eggs were not sufficient.The results indicated that detection of crack in eggshell based on the acoustic impulse resonance was feasible,and the SVDD model showed its superior performance in contrast to conventional two-class discrimination models.It can be concluded that SVDD is an excellent method of classifi-cation problem with imbalanced numbers.It is a promising method that uses acoustic resonance technique combined with SVDD to detect cracked eggs.Some relative ideas would be attempted for further improvement of the per-formance of SVDD model in our future work,such as follows:(1)introduce new kernel functions,which can help to obtain a moreflexible boundary;(2)try more methods for selection of parameters to obtain the optimal ones,since parameters of kernel functions are closely related to the tightness of the constructed boundary and the target rejection rate,and appropriate parameters are important to improve the performance of SVDD models;(3)investigate the contribution of abnormal targets to the calibration model and develop a robust model,which has an excellent ability to deal with abnormal targets.Acknowledgments This work is a part of the National Key Tech-nology R&D Program of China(Grant No.2006BAD11A12).We are grateful to the Web site http://www-ict.ewi.tudelft.nl/*davidt/ dd_tools.html,where we downloaded SVDD Matlab codes free of charge.References1.Lin J,Puri VM,Anantheswaran RC(1995)Trans ASAE38(6):1769–17762.Cho HK,Choi WK,Paek JK(2000)Trans ASAE43(6):1921–19263.De Ketelaere B,Coucke P,De Baerdemaeker J(2000)J Agr EngRes76:157–1634.Coucke P,De Ketelaere B,De Baerdemaeker J(2003)J SoundVib266:711–7215.Wang J,Jiang RS(2005)Eur Food Res Technol221:214–2206.Jindal VK,Sritham E(2003)ASAE Annual International Meet-ing,USA7.Tax DMJ,Duin RPW(1999)Pattern Recognit Lett20:1191–11998.Pan Y,Chen J,Guo L(2009)Mech Syst Signal Process23:669–6819.Lee SW,Park JY,Lee SW(2006)Patten Recognit39:1809–181210.Podsiadlo P,Stachowiak GW(2006)Tribol Int39:1624–163311.Sanchez-Hernandeza C,Boyd DS,Foody GM(2007)Ecol Inf2:83–8812.Liu YH,Lin SH,Hsueh YL,Lee MJ(2009)Expert Syst Appl36:1978–199813.Cho HW(2009)Expert Syst Appl36:434–44114.Tax DMJ,Duin RPW(2001)J Mach Learn Res2:155–17315.Tax DMJ,Duin RPW(2004)Mach Learn54:45–6616.Guo SM,Chen LC,Tsai JHS(2009)Pattern Recognit42:77–8317.De Ketelaere B,Maertens K,De Baerdemaeker J(2004)MathComput Simul65:59–6718.Adall T,Ardalan SH(1999)Comput Elect Eng25:1–1619.Madsen AH(2000)Signal Process80:1489–150020.Chase JG,Begoc V,Barroso LR(2005)Comput Struct83:639–64721.Wang X,Feng GZ(2009)Signal Process89:181–18622.Djigan VI(2006)Signal Process86:776–79123.Bu HG,Wang J,Huang XB(2009)Eng Appl Artif Intell22:224–23524.Tao Q,Wu GW,Wang J(2005)Pattern Recognit38:1071–107725.Xie JS,Qiu ZD(2007)Pattern Recognit40:557–56226.Devos O,Ruckebusch C,Durand A,Duponchel L,Huvenne JP(2009)Chemom Intell Lab Syst96:27–3327.Liu X,Lu WC,Jin SL,Li YW,Chen NY(2006)Chemom IntellLab Syst82:8–1428.Chen QS,Zhao JW,Fang CH,Wang DM(2007)SpectrochimActa Pt A Mol Biomol Spectrosc66:568–57429.Huang WL,Jiao LC(2008)Prog Nat Sci18:455–46130.Foody GM,Mathur A,Sanchez-Hernandez C,Boyd DS(2006)Remote Sens Environ104:1–14。

A Design and Implementation of Active NetworkSocket ProgrammingK.L. Eddie Law, Roy LeungThe Edward S. Rogers Sr. Department of Electrical and Computer EngineeringUniversity of TorontoToronto, Canadaeddie@, roy.leung@utoronto.caAbstract—The concept of programmable nodes and active networks introduces programmability into communication networks. Code and data can be sent and modified on their ways to destinations. Recently, various research groups have designed and implemented their own design platforms. Each design has its own benefits and drawbacks. Moreover, there exists an interoperability problem among platforms. As a result, we introduce a concept that is similar to the network socket programming. We intentionally establish a set of simple interfaces for programming active applications. This set of interfaces, known as Active Network Socket Programming (ANSP), will be working on top of all other execution environments in future. Therefore, the ANSP offers a concept that is similar to “write once, run everywhere.” It is an open programming model that active applications can work on all execution environments. It solves the heterogeneity within active networks. This is especially useful when active applications need to access all regions within a heterogeneous network to deploy special service at critical points or to monitor the performance of the entire networks. Instead of introducing a new platform, our approach provides a thin, transparent layer on top of existing environments that can be easily installed for all active applications.Keywords-active networks; application programming interface; active network socket programming;I. I NTRODUCTIONIn 1990, Clark and Tennenhouse [1] proposed a design framework for introducing new network protocols for the Internet. Since the publication of that position paper, active network design framework [2, 3, 10] has slowly taken shape in the late 1990s. The active network paradigm allows program code and data to be delivered simultaneously on the Internet. Moreover, they may get executed and modified on their ways to their destinations. At the moment, there is a global active network backbone, the ABone, for experiments on active networks. Apart from the immaturity of the executing platform, the primary hindrance on the deployment of active networks on the Internet is more on the commercially related issues. For example, a vendor may hesitate to allow network routers to run some unknown programs that may affect their expected routing performance. As a result, alternatives were proposed to allow active network concept to operate on the Internet, such as the application layer active networking (ALAN) project [4] from the European research community. In the ALAN project, there are active server systems located at different places in the networks and active applications are allowed to run in these servers at the application layer. Another potential approach from the network service provider is to offer active network service as the premium service class in the networks. This service class should provide the best Quality of Service (QoS), and allow the access of computing facility in routers. With this approach, the network service providers can create a new source of income.The research in active networks has been progressing steadily. Since active networks introduce programmability on the Internet, appropriate executing platforms for the active applications to execute should be established. These operating platforms are known as execution environments (EEs) and a few of them have been created, e.g., the Active Signaling Protocol (ASP) [12] and the Active Network Transport System (ANTS) [11]. Hence, different active applications can be implemented to test the active networking concept.With these EEs, some experiments have been carried out to examine the active network concept, for example, the mobile networks [5], web proxies [6], and multicast routers [7]. Active networks introduce a lot of program flexibility and extensibility in networks. Several research groups have proposed various designs of execution environments to offer network computation within routers. Their performance and potential benefits to existing infrastructure are being evaluated [8, 9]. Unfortunately, they seldom concern the interoperability problems when the active networks consist of multiple execution environments. For example, there are three EEs in ABone. Active applications written for one particular EE cannot be operated on other platforms. This introduces another problem of resources partitioning for different EEs to operate. Moreover, there are always some critical network applications that need to run under all network routers, such as collecting information and deploying service at critical points to monitor the networks.In this paper, a framework known as Active Network Socket Programming (ANSP) model is proposed to work with all EEs. It offers the following primary objectives.• One single programming interface is introduced for writing active applications.• Since ANSP offers the programming interface, the design of EE can be made independent of the ANSP.This enables a transparency in developing andenhancing future execution environments.• ANSP addresses the interoperability issues among different execution environments.• Through the design of ANSP, the pros and cons of different EEs will be gained. This may help design abetter EE with improved performance in future.The primary objective of the ANSP is to enable all active applications that are written in ANSP can operate in the ABone testbed . While the proposed ANSP framework is essential in unifying the network environments, we believe that the availability of different environments is beneficial in the development of a better execution environment in future. ANSP is not intended to replace all existing environments, but to enable the studies of new network services which are orthogonal to the designs of execution environments. Therefore, ANSP is designed to be a thin and transparent layer on top of all execution environments. Currently, its deployment relies on automatic code loading with the underlying environments. As a result, the deployment of ANSP at a router is optional and does not require any change to the execution environments.II. D ESIGN I SSUES ON ANSPThe ANSP unifies existing programming interfaces among all EEs. Conceptually, the design of ANSP is similar to the middleware design that offers proper translation mechanisms to different EEs. The provisioning of a unified interface is only one part of the whole ANSP platform. There are many other issues that need to be considered. Apart from translating a set of programming interfaces to other executable calls in different EEs, there are other design issues that should be covered, e.g., • a unified thread library handles thread operations regardless of the thread libraries used in the EEs;• a global soft-store allows information sharing among capsules that may execute over different environmentsat a given router;• a unified addressing scheme used across different environments; more importantly, a routing informationexchange mechanism should be designed across EEs toobtain a global view of the unified networks;• a programming model that should be independent to any programming languages in active networks;• and finally, a translation mechanism to hide the heterogeneity of capsule header structures.A. Heterogeneity in programming modelEach execution environment provides various abstractions for its services and resources in the form of program calls. The model consists of a set of well-defined components, each of them has its own programming interfaces. For the abstractions, capsule-based programming model [10] is the most popular design in active networks. It is used in ANTS [11] and ASP [12], and they are being supported in ABone. Although they are developed based on the same capsule model, their respective components and interfaces are different. Therefore, programs written in one EE cannot run in anther EE. The conceptual views of the programming models in ANTS and ASP are shown in Figure 1.There are three distinct components in ANTS: application, capsule, and execution environment. There exist user interfaces for the active applications at only the source and destination routers. Then the users can specify their customized actions to the networks. According to the program function, the applications send one or more capsules to carry out the operations. Both applications and capsules operate on top of an execution environment that exports an interface to its internal programming resources. Capsule executes its program at each router it has visited. When it arrives at its destination, the application at destination may either reply it with another capsule or presents this arrival event to the user. One drawback with ANTS is that it only allows “bootstrap” application.Figure 1. Programming Models in ASP and ANTS.In contrast, ASP does not limit its users to run “bootstrap” applications. Its program interfaces are different from ANTS, but there are also has three components in ASP: application client, environment, and AAContext. The application client can run on active or non-active host. It can start an active application by simply sending a request message to the EE. The client presents information to users and allows its users to trigger actions at a nearby active router. AAContext is the core of the network service and its specification is divided into two parts. One part specifies its actions at its source and destination routers. Its role is similar to that of the application in ANTS, except that it does not provide a direct interface with the user. The other part defines its actions when it runs inside the active networks and it is similar to the functional behaviors of a capsule in ANTS.In order to deal with the heterogeneity of these two models, ANSP needs to introduce a new set of programming interfaces and map its interfaces and execution model to those within the routers’ EEs.B. Unified Thread LibraryEach execution environment must ensure the isolation of instance executions, so they do not affect each other or accessThe authors appreciate the Nortel Institute for Telecommunications (NIT) at the University of Toronto to allow them to access the computing facilitiesothers’ information. There are various ways to enforce the access control. One simple way is to have one virtual machine for one instance of active applications. This relies on the security design in the virtual machines to isolate services. ANTS is one example that is using this method. Nevertheless, the use of multiple virtual machines requires relatively large amount of resources and may be inefficient in some cases. Therefore, certain environments, such as ASP, allow network services to run within a virtual machine but restrict the use of their services to a limited set of libraries in their packages. For instance, ASP provides its thread library to enforce access control. Because of the differences in these types of thread mechanism, ANSP devises a new thread library to allow uniform accesses to different thread mechanisms.C. Soft-StoreSoft-store allows capsule to insert and retrieve information at a router, thus allowing more than one capsules to exchange information within a network. However, problem arises when a network service can execute under different environments within a router. The problem occurs especially when a network service inserts its soft-store information in one environment and retrieves its data at a later time in another environment at the same router. Due to the fact that execution environments are not allowed to exchange information, the network service cannot retrieve its previous data. Therefore, our ANSP framework needs to take into account of this problem and provides soft-store mechanism that allows universal access of its data at each router.D. Global View of a Unified NetworkWhen an active application is written with ANSP, it can execute on different environment seamlessly. The previously smaller and partitioned networks based on different EEs can now be merging into one large active network. It is then necessary to advise the network topology across the networks. However, different execution environments have different addressing schemes and proprietary routing protocols. In order to merge these partitions together, ANSP must provide a new unified addressing scheme. This new scheme should be interpretable by any environments through appropriate translations with the ANSP. Upon defining the new addressing scheme, a new routing protocol should be designed to operate among environments to exchange topology information. This allows each environment in a network to have a complete view of its network topology.E. Language-Independent ModelExecution environment can be programmed in any programming language. One of the most commonly used languages is Java [13] due to its dynamic code loading capability. In fact, both ANTS and ASP are developed in Java. Nevertheless, the active network architecture shown in Figure 2 does not restrict the use of additional environments that are developed in other languages. For instance, the active network daemon, anted, in Abone provides a workspace to execute multiple execution environments within a router. PLAN, for example, is implemented in Ocaml that will be deployable on ABone in future. Although the current active network is designed to deploy multiple environments that can be in any programming languages, there lacks the tool to allow active applications to run seamlessly upon these environments. Hence, one of the issues that ANSP needs to address is to design a programming model that can work with different programming languages. Although our current prototype only considers ANTS and ASP in its design, PLAN will be the next target to address the programming language issue and to improve the design of ANSP.Figure 2. ANSP Framework Model.F. Heterogeneity of Capsule Header StructureThe structures of the capsule headers are different in different EEs. They carries capsule-related information, for example, the capsule types, sources and destinations. This information is important when certain decision needs to be made within its target environment. A unified model should allow its program code to be executed on different environments. However, the capsule header prevents different environments to interpret its information successfully. Therefore, ANSP should carry out appropriate translation to the header information before the target environment receives this capsule.III. ANSP P ROGRAMMING M ODELWe have outlined the design issues encountered with the ANSP. In the following, the design of the programming model in ANSP will be discussed. This proposed framework provides a set of unified programming interfaces that allows active applications to work on all execution environments. The framework is shown in Figure 2. It is composed of two layers integrated within the active network architecture. These two layers can operate independently without the other layer. The upper layer provides a unified programming model to active applications. The lower layer provides appropriate translation procedure to the ANSP applications when it is processed by different environments. This service is necessary because each environment has its own header definition.The ANSP framework provides a set of programming calls which are abstractions of ANSP services and resources. A capsule-based model is used for ANSP, and it is currently extended to map to other capsule-based models used in ANTSand ASP. The mapping possibility to other models remains as our future works. Hence, the mapping technique in ANSP allows any ANSP applications to access the same programming resources in different environments through a single set of interfaces. The mapping has to be done in a consistent and transparent manner. Therefore, the ANSP appears as an execution environment that provides a complete set of functionalities to active applications. While in fact, it is an overlay structure that makes use of the services provided from the underlying environments. In the following, the high-level functional descriptions of the ANSP model are described. Then, the implementations will be discussed. The ANSP programming model is based upon the interactions between four components: application client , application stub , capsule , and active service base.Figure 3. Information Flow with the ANSP.•Application Client : In a typical scenario, an active application requires some means to present information to its users, e.g., the state of the networks. A graphical user interface (GUI) is designed to operate with the application client if the ANSP runs on a non-active host.•Application Stub : When an application starts, it activates the application client to create a new instance of application stub at its near-by active node. There are two responsibilities for the application stub. One of them is to receive users’ instructions from the application client. Another one is to receive incoming capsules from networks and to perform appropriate actions. Typically, there are two types of actions, thatare, to reply or relay in capsules through the networks, or to notify the users regarding the incoming capsule. •Capsule : An active application may contain several capsule types. Each of them carries program code (also referred to as forwarding routine). Since the application defines a protocol to specify the interactions among capsules as well as the application stubs. Every capsule executes its forwarding routine at each router it visits along the path between the source and destination.•Active Service Base : An active service base is designed to export routers’ environments’ services and execute program calls from application stubs and capsules from different EEs. The base is loaded automatically at each router whenever a capsule arrives.The interactions among components within ANSP are shown in Figure 3. The designs of some key components in the ANSP will be discussed in the following subsections. A. Capsule (ANSPCapsule)ANSPXdr decode () ANSPXdr encode () int length ()Boolean execute ()New types of capsule are created by extending the abstract class ANSPCapsule . New extensions are required to define their own forwarding routines as well as their serialization procedures. These methods are indicated below:The execution of a capsule in ANSP is listed below. It is similar to the process in ANTS.1. A capsule is in serial binary representation before it issent to the network. When an active router receives a byte sequence, it invokes decode() to convert the sequence into a capsule. 2. The router invokes the forwarding routine of thecapsule, execute(). 3. When the capsule has finished its job and forwardsitself to its next hop by calling send(), this call implicitly invokes encode() to convert the capsule into a new serial byte representation. length() isused inside the call of encode() to determine the length of the resulting byte sequence. ANSP provides a XDR library called ANSPXdr to ease the jobs of encoding and decoding.B. Active Service Base (ANSPBase)In an active node, the Active Service Base provides a unified interface to export the available resources in EEs for the rest of the ANSP components. The services may include thread management, node query, and soft-store operation, as shown in Table 1.TABLE I. ACTIVE SERVICE BASE FUNCTION CALLSFunction Definition Descriptionboolean send (Capsule, Address) Transmit a capsule towards its destination using the routing table of theunderlying environment.ANSPAddress getLocalHost () Return address of the local host as an ANSPAddress structure. This isuseful when a capsule wants to check its current location.boolean isLocal (ANSPAddress) Return true if its input argument matches the local host’s address andreturn false otherwise.createThread () Create a new thread that is a class ofANSPThreadInterface (discussed later in Section VIA “Unified Thread Abstraction”).putSStore (key, Object) Object getSStore (key) removeSStore (key)The soft-store operations are provided by putSStore(), getSSTore(), and removeSStore(), and they put, retrieve, and remove data respectively. forName (PathName) Supported in ANSP to retrieve a classobject corresponding to the given path name in its argument. This code retrieval may rely on the code loading mechanism in the environment whennecessary.C. Application Client (ANSPClient)boolean start (args[])boolean start (args[],runningEEs) boolean start (args[],startClient)boolean start (args[],startClient, runningEE)Application Client is an interface between users and the nearby active source router. It does the following responsibilities.1. Code registration: It may be necessary to specify thelocation and name of the application code in some execution environments, e.g., ANTS. 2. Application initialization: It includes selecting anexecution environment to execute the application among those are available at the source router. Each active application can create an application client instance by extending the abstract class, ANSPClient . The extension inherits a method, start(), to automatically handle both the registration and initialization processes. All overloaded versions of start() accept a list of arguments, args , that are passed to the application stub during its initialization. An optional argument called runningEEs allows an application client to select a particular set of environment variables, specified by a list of standardized numerical environment ID, the ANEP ID, to perform code registration. If this argument is not specified, the default setting can only include ANTS and ASP. D. Application Stub (ANSPApplication)receive (ANSPCapsule)Application stubs reside at the source and destination routers to initialize the ANSP application after the application clients complete the initialization and registration processes. It is responsible for receiving and serving capsules from the networks as well as actions requested from the clients. A new instance is created by extending the application client abstract class, ANSPApplication . This extension includes the definition of a handling routine called receive(), which is invoked when a stub receives a new capsule.IV. ANSP E XAMPLE : T RACE -R OUTEA testbed has been created to verify the design correctnessof ANSP in heterogeneous environments. There are three types of router setting on this testbed:1. Router that contains ANTS and a ANSP daemonrunning on behalf of ASP; 2. Router that contains ASP and a ANSP daemon thatruns on behalf of ANTS; 3. Router that contains both ASP and ANTS.The prototype is written in Java [11] with a traceroute testing program. The program records the execution environments of all intermediate routers that it has visited between the source and destination. It also measures the RTT between them. Figure 4 shows the GUI from the application client, and it finds three execution environments along the path: ASP, ANTS, and ASP. The execution sequence of the traceroute program is shown in Figure 5.Figure 4. The GUI for the TRACEROUTE Program.The TraceCapsule program code is created byextending the ANSPCapsule abstract class. When execute() starts, it checks the Boolean value of returning to determine if it is returning from the destination. It is set to true if TraceCapsule is traveling back to the source router; otherwise it is false . When traveling towards the destination, TraceCapsule keeps track of the environments and addresses of the routers it has visited in two arrays, path and trace , respectively. When it arrives at a new router, it calls addHop() to append the router address and its environment to these two arrays. When it finally arrives at the destination, it sets returning to false and forwards itself back to the source by calling send().When it returns to source, it invokes deliverToApp() to deliver itself to the application stub that has been running at the source. TraceCapsule carries information in its data field through the networks by executing encode() and decode(), which encapsulates and de-capsulates its data using External Data Representation (XDR) respectively. The syntax of ANSP XDR follows the syntax of XDR library from ANTS. length() in TraceCapsule returns the data length, or it can be calculated by using the primitive types in the XDRlibrary.Figure 5. Flow of the TRACEROUTE Capsules.V. C ONCLUSIONSIn this paper, we present a new unified layered architecture for active networks. The new model is known as Active Network Socket Programming (ANSP). It allows each active application to be written once and run on multiple environments in active networks. Our experiments successfully verify the design of ANSP architecture, and it has been successfully deployed to work harmoniously with ANTS and ASP without making any changes to their architectures. In fact, the unified programming interface layer is light-weighted and can be dynamically deployable upon request.R EFERENCES[1] D.D. Clark, D.L. Tennenhouse, “Architectural Considerations for a NewGeneration of Protocols,” in Proc. ACM Sigcomm’90, pp.200-208, 1990. [2] D. Tennenhouse, J. M. Smith, W. D. Sicoskie, D. J. Wetherall, and G. J.Minden, “A survey of active network research,” IEEE Communications Magazine , pp. 80-86, Jan 1997.[3] D. Wetherall, U. Legedza, and J. Guttag, “Introducing new internetservices: Why and how,” IEEE Network Magazine, July/August 1998. [4] M. Fry, A. Ghosh, “Application Layer Active Networking,” in ComputerNetworks , Vol.31, No.7, pp.655-667, 1999.[5] K. W. Chin, “An Investigation into The Application of Active Networksto Mobile Computing Environments”, Curtin University of Technology, March 2000.[6] S. Bhattacharjee, K. L. Calvert, and E. W. Zegura, “Self OrganizingWide-Area Network Caches”, Proc. IEEE INFOCOM ’98, San Francisco, CA, 29 March-2 April 1998.[7] L. H. Leman, S. J. Garland, and D. L. Tennenhouse, “Active ReliableMulticast”, Proc. IEEE INFOCOM ’98, San Francisco, CA, 29 March-2 April 1998.[8] D. Descasper, G. Parulkar, B. Plattner, “A Scalable, High PerformanceActive Network Node”, In IEEE Network, January/February 1999.[9] E. L. Nygren, S. J. Garland, and M. F. Kaashoek, “PAN: a high-performance active network node supporting multiple mobile code system”, In the Proceedings of the 2nd IEEE Conference on Open Architectures and Network Programming (OpenArch ’99), March 1999. [10] D. L. Tennenhouse, and D. J. Wetherall. “Towards an Active NetworkArchitecture”, In Proceeding of Multimedia Computing and Networking , January 1996.[11] D. J. Wetherall, J. V. Guttag, D. L. Tennenhouse, “ANTS: A toolkit forBuilding and Dynamically Deploying Network Protocols”, Open Architectures and Network Programming, 1998 IEEE , 1998 , Page(s): 117 –129.[12] B. Braden, A. Cerpa, T. Faber, B. Lindell, G. Phillips, and J. Kann.“Introduction to the ASP Execution Environment”: /active-signal/ARP/index.html .[13] “The java language: A white paper,” Tech. Rep., Sun Microsystems,1998.。

A Comparison of Soft Start Mechanisms for Mining BeltConveyors1800 Washington Road Pittsburgh, PA 15241 Belt Conveyors are an important method for transportation of bulk materials in the mining industry. The control of the application of the starting torque from the belt drive system to the belt fabric affects the performance, life cost, and reliability of the conveyor. This paper examines applications of each starting method within the coal mining industry.INTRODUCTIONThe force required to move a belt conveyor must be transmitted by the drive pulley via friction between the drive pulley and the belt fabric. In order to transmit power there must be a difference in the belt tension as it approaches and leaves the drive pulley. These conditions are true for steady state running, starting, and stopping. Traditionally, belt designs are based on static calculations of running forces. Since starting and stopping are not examined in detail, safety factors are applied to static loadings (Harrison, 1987). This paper will primarily address the starting or acceleration duty of the conveyor. The belt designer must control starting acceleration to prevent excessive tension in the belt fabric and forces in the belt drive system (Suttees, 1986). High acceleration forces can adversely affect the belt fabric, belt splices, drive pulleys, idler pulleys, shafts, bearings, speed reducers, and couplings. Uncontrolled acceleration forces can cause belt conveyor system performance problems with vertical curves, excessive belt take-up movement, loss of drive pulley friction, spillage of materials, and festooning of the belt fabric. The belt designer is confronted with two problems, The belt drive system must produce a minimum torque powerful enough to start the conveyor, and controlled such that the acceleration forces are within safe limits. Smooth starting of the conveyor can be accomplished by the use of drive torque control equipment, either mechanical or electrical, or a combination of the two (CEM, 1979).SOFT START MECHANISM EVALUATION CRITERIONWhat is the best belt conveyor drive system? The answer depends on many variables. The best system is one that provides acceptable control for starting, running, and stopping at a reasonable cost and with high reliability (Lewdly and Sugarcane, 1978). Belt Drive System For the purposes of this paper we will assume that belt conveyors are almost always driven byelectrical prime movers (Goodyear Tire and Rubber, 1982). The belt "drive system" shall consist of multiple components including the electrical prime mover, the electrical motor starter with control system, the motor coupling, the speed reducer, the low speed coupling, the belt drive pulley, and the pulley brake or hold back (Cur, 1986). It is important that the belt designer examine the applicability of each system component to the particular application. For the purpose of this paper, we will assume that all drive system components are located in the fresh air, non-permissible, areas of the mine, or in non-hazardous, National Electrical Code, Article 500 explosion-proof, areas of the surface of the mine.Belt Drive Component Attributes SizeCertain drive components are available and practical in different size ranges. For this discussion, we will assume that belt drive systems range from fractional horsepower to multiples of thousands of horsepower. Small drive systems are often below 50 horsepower. Medium systems range from 50 to 1000 horsepower. Large systems can be considered above 1000 horsepower. Division of sizes into these groups is entirely arbitrary. Care must be taken to resist the temptation to over motor or under motor a belt flight to enhance standardization. An over motored drive results in poor efficiency and the potential for high torques, while an under motored drive could result in destructive overspending on regeneration, or overheating with shortened motor life (Lords, et al., 1978).Torque ControlBelt designers try to limit the starting torque to no more than 150% of the running torque (CEMA, 1979; Goodyear, 1982). The limit on the applied starting torque is often the limit of rating of the belt carcass, belt splice, pulley lagging, or shaft deflections. On larger belts and belts with optimized sized components, torque limits of 110% through 125% are common (Elberton, 1986). In addition to a torque limit, the belt starter may be required to limit torque increments that would stretch belting and cause traveling waves. An ideal starting control system would apply a pretension torque to the belt at rest up to the point of breakaway, or movement of the entire belt, then a torque equal to the movement requirements of the belt with load plus a constant torque to accelerate the inertia of the system components from rest to final running speed. This would minimize system transient forces and belt stretch (Shultz, 1992). Different drive systems exhibit varying ability to control the application of torques to the belt at rest and at different speeds. Also, the conveyor itself exhibits two extremes of loading. An empty belt normally presents the smallest required torque for breakaway and acceleration, while a fully loaded belt presents the highest required torque. A mining drive system must be capable of scaling the applied torque from a 2/1 ratio for a horizontal simple belt arrangement, to a 10/1 ranges for an inclined or complex belt profile.Thermal RatingDuring starting and running, each drive system may dissipate waste heat. The waste heat may be liberated in the electrical motor, the electrical controls,, the couplings, the speed reducer, or the belt braking system. The thermal load of each start Is dependent on the amount of belt load and the duration of the start. The designer must fulfill the application requirements for repeated starts after running the conveyor at full load. Typical mining belt starting duties vary from 3 to 10 starts per hour equally spaced, or 2 to 4 starts in succession. Repeated starting may require the dreading or over sizing of system components. There is a direct relationship between thermal rating for repeated starts and costs. Variable Speed. Some belt drive systems are suitable for controlling the starting torque and speed, but only run at constant speed. Some belt applications would require a drive system capable of running for extended periods at less than full speed. This is useful when the drive load must be shared with other drives, the belt is used as a process feeder for rate control of the conveyed material, the belt speed is optimized for the haulage rate, the belt is used at slower speeds to transport men or materials, or the belt is run a slow inspection or inching speed for maintenance purposes (Hager, 1991). The variable speed belt drive will require a control system based on some algorithm to regulate operating speed. Regeneration or Overhauling Load. Some belt profiles present the potential for overhauling loads where the belt system supplies energy to the drive system. Not all drive systems have the ability to accept regenerated energy from the load. Some drives can accept energy from the load and return it to the power line for use by other loads. Other drives accept energy from the load and dissipate it into designated dynamic or mechanical braking elements. Some belt profiles switch from motoring to regeneration during operation. Can the drive system accept regenerated energy of a certain magnitude for the application? Does the drive system have to control or modulate the amount of retarding force during overhauling? Does the overhauling occur when running and starting? Maintenance and Supporting Systems. Each drive system will require periodic preventative maintenance. Replaceable items would include motor brushes, bearings, brake pads, dissipation resistors, oils, and cooling water. If the drive system is conservatively engineered and operated, the lower stress on consumables will result in lower maintenance costs. Some drives require supporting systems such as circulating oil for lubrication, cooling air or water, environmental dust filtering, or computer instrumentation. The maintenance of the supporting systems can affect the reliability of the drive system.CostThe drive designer will examine the cost of each drive system. The total cost is the sum of the first capital cost to acquire the drive, the cost to install and commission the drive, thecost to operate the drive, and the cost to maintain the drive. The cost for power to operate the drive may vary widely with different locations. The designer strives to meet all system performance requirements at lowest total cost. Often more than one drive system may satisfy all system performance criterions at competitive costs.ComplexityThe preferred drive arrangement is the simplest, such as a single motor driving through a single head pulley.However,mechanical, economic,and functional requirements often necessitate the use of complex drives.The belt designer must balance the need for sophistication against the problems that accompany complex systems. Complex systems require additional design engineering for successful deployment. An often-overlooked cost in a complex system is the cost of training onsite personnel, or the cost of downtime as a result of insufficient training.SOFT START DRIVE CONTROL LOGICEach drive system will require a control system to regulate the starting mechanism. The most common type of control used on smaller to medium sized drives with simple profiles is termed "Open Loop Acceleration Control". In open loop, the control system is previously configured to sequence the starting mechanism in a prescribed manner, usually based on time. In open loop control, drive-operating parameters such as current, torque, or speed do not influence sequence operation. This method presumes that the control designer has adequately modeled drive system performance on the conveyor. For larger or more complex belts, "Closed Loop" or "Feedback" control may he utilized. In closed loop control, during starting, the control system monitors via sensors drive operating parameters such as current level of the motor, speed of the belt, or force on the belt, and modifies the starting sequence to control, limit, or optimize one or wore parameters. Closed loop control systems modify the starting applied force between an empty and fully loaded conveyor. The constants in the mathematical model related to the measured variable versus the system drive response are termed the tuning constants. These constants must be properly adjusted for successful application to each conveyor. The most common schemes for closed loop control of conveyor starts are tachometer feedback for speed control and load cell force or drive force feedback for torque control. On some complex systems, It is desirable to have the closed loop control system adjust itself for various encountered conveyor conditions. This is termed "Adaptive Control". These extremes can involve vast variations in loadings, temperature of the belting, location of the loading on the profile, or multiple drive options on the conveyor. There are three commonadaptive methods. The first involves decisions made before the start, or 'Restart Conditioning'. If the control system could know that the belt is empty, it would reduce initial force and lengthen the application of acceleration force to full speed. If the belt is loaded, the control system would apply pretension forces under stall for less time and supply sufficient torque to adequately accelerate the belt in a timely manner. Since the belt only became loaded during previous running by loading the drive, the average drive current can be sampled when running and retained in a first-in-first-out buffer memory that reflects the belt conveyance time. Then at shutdown the FIFO average may be use4 to precondition some open loop and closed loop set points for the next start. The second method involves decisions that are based on drive observations that occur during initial starting or "Motion Proving'. This usually involves a comparison In time of the drive current or force versus the belt speed. if the drive current or force required early in the sequence is low and motion is initiated, the belt must be unloaded. If the drive current or force required is high and motion is slow in starting, the conveyor must be loaded. This decision can be divided in zones and used to modify the middle and finish of the start sequence control. The third method involves a comparison of the belt speed versus time for this start against historical limits of belt acceleration, or 'Acceleration Envelope Monitoring'. At start, the belt speed is measured versus time. This is compared with two limiting belt speed curves that are retained in control system memory. The first curve profiles the empty belt when accelerated, and the second one the fully loaded belt. Thus, if the current speed versus time is lower than the loaded profile, it may indicate that the belt is overloaded, impeded, or drive malfunction. If the current speed versus time is higher than the empty profile, it may indicate a broken belt, coupling, or drive malfunction. In either case, the current start is aborted and an alarm issued.CONCLUSIONThe best belt starting system is one that provides acceptable performance under all belt load Conditions at a reasonable cost with high reliability. No one starting system meets all needs. The belt designer must define the starting system attributes that are required for each belt. In general, the AC induction motor with full voltage starting is confined to small belts with simple profiles. The AC induction motor with reduced voltage SCR starting is the base case mining starter for underground belts from small to medium sizes. With recent improvements, the AC motor with fixed fill fluid couplings is the base case for medium to large conveyors with simple profiles. The Wound Rotor Induction Motor drive is the traditional choice for medium to large belts with repeated starting duty or complex profilesthat require precise torque control. The DC motor drive, Variable Fill Hydrokinetic drive, and the Variable Mechanical Transmission drive compete for application on belts with extreme profiles or variable speed at running requirements. The choice is dependent on location environment, competitive price, operating energy losses, speed response, and user familiarity. AC Variable Frequency drive and Brush less DC applications are limited to small to medium sized belts that require precise speed control due to higher present costs and complexity. However, with continuing competitive and technical improvements, the use of synthesized waveform electronic drives will expand.REFERENCES[1]Michael L. Nave, P.E.1989.CONSOL Inc.煤矿业带式输送机几种软起动方式的比较1800 年华盛顿路匹兹堡, PA 15241带式运送机是采矿工业运输大批原料的重要方法。

本科生毕业设计（论文）外文科技文献译文译文题目(外文题目)学院(系)Socket网络编程的设计与实现A Design andImplementation of Active Network Socket Programming机械与能源工程学院专学业号机械设计制造及其自动化071895学生姓名李杰林日期2012年5月27日指导教师签名日期摘要：编程节点和活跃网络的概念将可编程性引入到通信网络中，并且代码和数据可以在发送过程中进行修改。

最近，多个研究小组已经设计和实现了自己的设计平台。

每个设计都有其自己的优点和缺点，但是在不同平台之间都存在着互操作性问题。

因此，我们引入一个类似网络socket编程的概念。

我们建立一组针对应用程序进行编程的简单接口，这组被称为活跃网络Socket编程（ANSP）的接口，将在所有执行环境下工作。

因此，ANSP 提供一个类似于“一次性编写，无限制运行”的开放编程模型，它可以工作在所有的可执行环境下。

它解决了活跃网络中的异构性，当应用程序需要访问异构网络内的所有地区，在临界点部署特殊服务或监视整个网络的性能时显得相当重要。

我们的方案是在现有的环境中，所有应用程序可以很容易地安装上一个薄薄的透明层而不是引入一个新的平台。

关键词：活跃网络；应用程序编程接口；活跃网络socket编程1 导言1990年，为了在互联网上引入新的网络协议，克拉克和藤农豪斯[1]提出了一种新的设计框架。

自公布这一标志性文件，活跃网络设计框架[2，3，10]已经慢慢在20世纪90 年代末成形。

活跃网络允许程序代码和数据可以同时在互联网上提供积极的网络范式，此外，他们可以在传送到目的地的过程中得到执行和修改。

ABone作为一个全球性的骨干网络，开始进行活跃网络实验。

除执行平台的不成熟，商业上活跃网络在互联网上的部署也成为主要障碍。

例如，一个供应商可能不乐意让网络路由器运行一些可能影响其预期路由性能的未知程序，。

毕业设计外文文献翻译专业学生姓名班级学号指导教师优集学院外文资料名称：Knowledge-Based Engineeri--ng Design Methodology外文资料出处：Int.J.Engng Ed.Vol.16.No.1附件： 1.外文资料翻译译文2.外文原文基于知识工程(KBE)设计方法D. E. CALKINS1.背景复杂系统的发展需要很多工程和管理方面的知识、决策，它要满足很多竞争性的要求。

设计被认为是决定产品最终形态、成本、可靠性、市场接受程度的首要因素。

高级别的工程设计和分析过程(概念设计阶段)特别重要，因为大多数的生命周期成本和整体系统的质量都在这个阶段。

产品成本的压缩最可能发生在产品设计的最初阶段。

整个生命周期阶段大约百分之七十的成本花费在概念设计阶段结束时，缩短设计周期的关键是缩短概念设计阶段，这样同时也减少了工程的重新设计工作量。

工程权衡过程中采用良好的估计和非正式的启发进行概念设计。

传统CAD工具对概念设计阶段的支持非常有限。

有必要，进行涉及多个学科的交流合作来快速进行设计分析(包括性能，成本，可靠性等)。

最后，必须能够管理大量的特定领域的知识。

解决方案是在概念设计阶段包含进更过资源，通过消除重新设计来缩短整个产品的时间。

所有这些因素都主张采取综合设计工具和环境，以在早期的综合设计阶段提供帮助。

这种集成设计工具能够使由不同学科的工程师、设计者在面对复杂的需求和约束时能够对设计意图达成共识。

那个设计工具可以让设计团队研究在更高级别上的更多配置细节。

问题就是架构一个设计工具，以满足所有这些要求。

2.虚拟(数字)原型模型现在需要是一种代表产品设计为得到一将允许一产品的早发展和评价的真实事实上原型的过程的方式。

虚拟样机将取代传统的物理样机，并允许设计工程师，研究“假设”的情况，同时反复更新他们的设计。

真正的虚拟原型，不仅代表形状和形式，即几何形状，它也代表如重量，材料，性能和制造工艺的非几何属性。

三峡大学科技学院
毕业设计（论文）
译文
译文题目楷体2号
学生姓名：(宋体3号)学号：
专业：班级：
指导教师：
评阅教师：
完成日期二○○八年月日
（黑体3号）
说明
一、外文翻译是毕业论文的一个重要组成部分,各教学单位可根据学生的实际情况确定做外文翻译的时间，原则上要求在毕业前一学期末进行，完成时间最迟于毕业学期初。

二、通过文献查阅与翻译，进一步提高掌握使用外文的能力，熟悉本专业的几种主要外文书刊，了解毕业设计（论文）课题的国内外信息与动向。

内容要求如下： 1）阅读
每位学生在文献查阅环节中，必须阅读5～10万个印刷符号的与本专业本课题相关的外文文献资料，选择其主要的翻译1～2万个印刷符号。

（约3000汉字） 2）翻译
标题应真实的反映出翻译外文的主体内容或原外文标题内容，一般控制在20个字之内；外文翻译成中文的内容应能忠实的反映原文内容。

3）中外文正文格式按《三峡大学科技学院毕业论文印制规格的规定》执行。

格式要求：
外文翻译正文参照毕业设计（论文）正文格式要求。

毕业设计(论文)外文资料翻译学院：艺术学院专业：环境设计姓名：学号：外文出处: The Swedish Country House附件： 1.外文资料翻译译文；2.外文原文附件1：外文资料翻译译文室内装饰简述一室内装饰设计要素1 空间要素空间的合理化并给人们以美的感受是设计基本的任务。

要勇于探索时代、技术赋于空间的新形象，不要拘泥于过去形成的空间形象。

2 色彩要求室内色彩除对视觉环境产生影响外，还直接影响人们的情绪、心理。

科学的用色有利于工作，有助于健康。

色彩处理得当既能符合功能要求又能取得美的效果。

室内色彩除了必须遵守一般的色彩规律外，还随着时代审美观的变化而有所不同。

3 光影要求人类喜爱大自然的美景，常常把阳光直接引入室内，以消除室内的黑暗感和封闭感，特别是顶光和柔和的散射光，使室内空间更为亲切自然。

光影的变换，使室内更加丰富多彩，给人以多种感受。

4 装饰要素室内整体空间中不可缺少的建筑构件、如柱子、墙面等，结合功能需要加以装饰，可共同构成完美的室内环境。

充分利用不同装饰材料的质地特征，可以获得千变完化和不同风格的室内艺术效果，同时还能体现地区的历史文化特征。

5 陈设要素室内家具、地毯、窗帘等，均为生活必需品，其造型往往具有陈设特征，大多数起着装饰作用。

实用和装饰二者应互相协调，求的功能和形式统一而有变化，使室内空间舒适得体，富有个性。

6 绿化要素室内设计中绿化以成为改善室内环境的重要手段。

室内移花栽木，利用绿化和小品以沟通室内外环境、扩大室内空间感及美化空间均起着积极作用。

二室内装饰设计的基本原则1 室内装饰设计要满足使用功能要求室内设计是以创造良好的室内空间环境为宗旨，使室内环境合理化、舒适化、科学化；要考虑人们的活动规律处理好空间关系，空间尺寸，空间比例；合理配置陈设与家具，妥善解决室内通风，采光与照明，注意室内色调的总体效果。

2 室内装饰设计要满足精神功能要求室内设计的精神就是要影响人们的情感，乃至影响人们的意志和行动，所以要研究人们的认识特征和规律；研究人的情感与意志；研究人和环境的相互作用。

毕业设计外文资料翻译学院：信息科学与工程学院专业：软件工程姓名： XXXXX学号： XXXXXXXXX外文出处： Think In Java (用外文写)附件： 1.外文资料翻译译文；2.外文原文。

附件1：外文资料翻译译文网络编程历史上的网络编程都倾向于困难、复杂，而且极易出错。

程序员必须掌握与网络有关的大量细节，有时甚至要对硬件有深刻的认识。

一般地，我们需要理解连网协议中不同的“层”（Layer）。

而且对于每个连网库，一般都包含了数量众多的函数，分别涉及信息块的连接、打包和拆包；这些块的来回运输；以及握手等等。

这是一项令人痛苦的工作。

但是，连网本身的概念并不是很难。

我们想获得位于其他地方某台机器上的信息，并把它们移到这儿；或者相反。

这与读写文件非常相似，只是文件存在于远程机器上，而且远程机器有权决定如何处理我们请求或者发送的数据。

Java最出色的一个地方就是它的“无痛苦连网”概念。

有关连网的基层细节已被尽可能地提取出去，并隐藏在JVM以及Java的本机安装系统里进行控制。

我们使用的编程模型是一个文件的模型；事实上，网络连接（一个“套接字”）已被封装到系统对象里，所以可象对其他数据流那样采用同样的方法调用。

除此以外，在我们处理另一个连网问题——同时控制多个网络连接——的时候，Java内建的多线程机制也是十分方便的。

本章将用一系列易懂的例子解释Java的连网支持。

15.1 机器的标识当然，为了分辨来自别处的一台机器，以及为了保证自己连接的是希望的那台机器，必须有一种机制能独一无二地标识出网络内的每台机器。

早期网络只解决了如何在本地网络环境中为机器提供唯一的名字。

但Java面向的是整个因特网，这要求用一种机制对来自世界各地的机器进行标识。

为达到这个目的，我们采用了IP（互联网地址）的概念。

IP以两种形式存在着：(1) 大家最熟悉的DNS（域名服务）形式。

我自己的域名是。

所以假定我在自己的域内有一台名为Opus的计算机，它的域名就可以是。

Hacking tricks toward security on network environments Tzer-Shyong Chen1, Fuh-Gwo Jeng 2, and Yu-Chia Liu 11 Department of Information Management, Tunghai University, Taiwan2 Department of Applied Mathematics, National Chiayi University, TaiwanE-Mail:****************.edu.twAbstractMounting popularity of the Internet has led to the birth of Instant Messaging, an up-and-coming form of Internet communication. Instant Messaging is very popular with businesses and individuals since it has instant communication ability. As a result, Internet security has become a pressing and important topic for discussion. Therefore, in recent years, a lot of attention has been drawn towards Internet security and the various attacks carried out by hackers over the Internet. People today often handle affairs via the Internet. For instance, instead of the conventional letter, they communicate with others by e-mails; they chat with friends through an instant messenger; find information by browsing websites instead of going to the library; perform e-commerce transactions through the Internet, etc. Although the convenience of the Internet makes our life easier, it is also a threat to Internet security. For instance, a business email intercepted during its transmission may let slip business confidentiality; file transfers via instant messengers may also be intercepted, and then implanted with backdoor malwares; conversations via instant messengers could be eavesdropped. Furthermore, ID and password theft may lose us money when using Internet bank service. Attackers on the Internet use hacking tricks to damage systems while users are connected to the Internet. These threats along with possible careless disclosure of business information make Instant Messaging a very unsafe method of communication for businesses. The paper divides hacking tricks into three categories: (1) Trojan programs that share files via instant messenger. (2) Phishing or fraud via e-mails. (3) Fake Websites. Keywords:Hacking tricks, Trojan programs, Phishing, Firewall, Intrusion detection system.1. IntroductionIncreasingly more people are using instant messengers such as MSN Messenger, Yahoo! Messenger, ICQ, etc as the media of communication. These instant messengers transmit alphanumeric message as well as permit file sharing. During transfer, a file may be intercepted by a hacker and implanted with backdoor malware. Moreover, the e-mails users receive every day may include Spam, advertisements, and fraudulent mail intended to trick uninformed users. Fake websites too are prevalent. Websites which we often visit could be counterfeited by imitating the interface and the URL of the original, tricking users. The paper classifies hacking tricks into three categories which are explained in the following sections.2. Hacking TricksThe paper divides hacking tricks into three categories: (1) Trojan programs that share files via instant messenger. (2) Phishing (3) Fake Websites.2.1 Trojan programs that share files via instant messengerInstant messaging allows file-sharing on a computer [9]. All present popular instant messengers have file sharing abilities, or allow users to have the above functionality by installing patches or plug-ins; this is also a major threat to present information security. These communication softwares also makeit difficult for existing hack prevention methods to prevent and control information security. Therefore, we shall discuss how to control the flow of instant messages and how to identify dangerous user behavior.Hackers use instant communication capability to plant Trojan program into an unsuspected program; the planted program is a kind of remotely controlled hacking tool that can conceal itself and is unauthorized. The Trojan program is unknowingly executed, controlling the infected computer; it can read, delete, move and execute any file on the computer. The advantages of a hacker replacing remotely installed backdoor Trojan programs [1] with instant messengers to access files are:When the victim gets online, the hacker will be informed. Thus, a hacker can track and access the infected computer, and incessantly steal user information.A hacker need not open a new port to perform transmissions; he can perform his operations through the already opened instant messenger port.Even if a computer uses dynamic IP addresses, its screen name doesn’t change.Certain Trojan programs are designed especially for instant messengers. These Trojans can change group settings and share all files on the hard disk of the infected computer. They can also destroy or modify data, causing data disarray. This kind of program allows a hacker access to all files on an infected computer, and thus poses a great threat to users. The Trojan program takes up a large amount of the resources of the computer causing it to become very slow and often crashes without a reason.Trojan programs that access a user computer through an instant messenger are probably harder to detect than classic Trojan horse programs. Although classic Trojan intrudes a computer by opening a listening or outgoing port which is used to connect toa remote computer, a desktop firewall can effectively block such Trojans. Alternatively, since it is very difficult for the server’s firewall to spot intrusion by controlling an instant messenger’s flow, it is extremely susceptible to intrusion.Present Trojan programs have already successfully implemented instant messengers. Some Trojan programs are Backdoor Trojan, AIMVision, and Backdoor. Sparta.C. Backdoor Trojans use ICQ pager to send messages to its writer. AIMVision steals AIM related information stored in the Windows registry, enabling a hacker to setup an AIM user id. Backdoor. Sparta.C uses ICQ to communicate with its writer and opens a port on an infected host and send its IP Address to the hacker, and at the same time attempts to terminate the antivirus program or firewall of the host.2.1.1 Hijacking and ImpersonationThere are various ways through which a hacker can impersonate other users [7]. The most commonly used method is eavesdropping on unsuspecting users to retrieve user accounts, passwords and other user related information.The theft of user account number and related information is a very serious problem in any instant messenger. For instance, a hacker after stealing a user’s information impersonate the user; the user’s contacts not knowing that the user’s account has been hacked believe that the person they’re talking to is the user, and are persuaded to execute certain programs or reveal confidential information. Hence, theft of user identity not only endangers a user but also surrounding users. Guarding against Internet security problems is presently the focus of future research; because without good protection, a computer can be easily attacked, causing major losses.Hackers wishing to obtain user accounts may do so with the help of Trojans designed to steal passwords. If an instant messenger client stores his/her password on his/her computer, then a hacker can send a Trojan program to the unsuspecting user. When the user executes the program, the program shall search for the user’s password and send it to the hacker. There are several ways through which a Trojan program can send messages back to the hacker. The methods include instant messenger, IRC, e-mails, etc.Current four most popular instant messengers are AIM, Yahoo! Messenger, ICQ, and MSN Messenger, none of which encrypts its flow. Therefore, a hackercan use a man-in-the-middle attack to hijack a connection, then impersonate the hijacked user and participate in a chat-session. Although difficult, a hacker can use the man-in-the-middle attack to hijack the connection entirely. For example, a user may receive an offline message that resembles that sent by the server, but this message could have been sent by the hacker. All at once, the user could also get disconnected to the server. Furthermore, hackers may also use a Denial of Service (DoS) tool or other unrelated exploits to break the user’s connection. However, the server keeps the connection open, and does not know that the user has been disconnected; thus allowing the hacker to impersonate the user. Moreover, since the data flow is unencrypted and unauthenticated, a hacker can use man-in-the-middle attacks that are similar to that of ARP fraud to achieve its purpose.2.1.2 Denial of Service (DoS)There are many ways through which a hacker can launch a denial of service (DoS) attack [2] on an instant messenger user. A Partial DoS attack will cause a user end to hang, or use up a large portion of CPU resources causing the system to become unstable.Another commonly seen attack is the flooding of messages to a particular user. Most instant messengers allow the blocking of a particular user to prevent flood attacks. However, a hacker can use tools that allow him to log in using several different identities at the same time, or automatically create a large number of new user ids, thus enabling a flood attack. Once a flood attack begins, even if the user realizes that his/her computer has been infected, the computer will not be able to respond. Thus, the problem cannot be solved by putting a hacker’s user id on the ignore list of your instant messenger.A DoS attack on an instant messenger client is only a common hacking tool. The difficulty of taking precautions against it could turn this hacking tool into dangerous DoS type attacks. Moreover, some hacking tools do not just cause an instant messenger client to hang, but also cause the user end to consume large amount of CPU time, causing the computer to crash.2.1.3 Information DisclosureRetrieving system information through instant messenger users is currently the most commonly used hacking tool [4]. It can effortlessly collect user network information like, current IP, port, etc. IP address retriever is an example. IP address retrievers can be used to many purposes; for instance, a Trojan when integrated with an IP address retriever allows a hacker to receive all information related to the infected computer’s IP address as soon as the infected computer connects to the internet. Therefore, even if the user uses a dynamic IP address, hackers can still retrieve the IP address.IP address retrievers and other similar tools can also be used by hackers to send data and Trojans to unsuspecting users. Hackers may also persuade unsuspecting users to execute files through social engineering or other unrelated exploits. These files when executed search for information on the user’s computer and sends them back to the hacker through the instant messenger network.Different Trojan programs were designed for different instant messaging clients. For example, with a user accounts and password stealing Trojans a hacker can have full control of the account once the user logs out. The hacker can thus perform various tasks like changing the password and sending the Trojan program to all of the user’s contacts.Moreover, Trojans is not the only way through which a hacker can cause information disclosure. Since data sent through instant messengers are unencrypted, hackers can sniff and monitor entire instant messaging transmissions. Suppose an employee of an enterprise sends confidential information of the enterprise through the instant messenger; a hacker monitoring the instant messaging session can retrieve the data sent by the enterprise employee. Thus, we must face up to the severity of the problem.2.2 PhishingThe word “Phishing” first appeared in 1996. It is a variant of ‘fishing’, and formed by replacing the ‘f’ in ‘fishing’ with ‘ph’ from phone. It means tricking users of their money through e-mails.Based on the statistics of the Internet Crime Complaint Center, loss due to internet scam was as high as $1.256 million USD in 2004. The Internet Crime Complaint Center has listed the above Nigerian internet scam as one of the ten major internet scams.Based on the latest report of Anti-Phishing Working Group (APWG) [8], there has been a 28% growth of Phishing scams in the past 4 months, mostly in the US and in Asia. Through social engineering and Trojans, it is very difficult for a common user to detect the infection.To avoid exploitation of your compassion, the following should be noted:(1)When you need to enter confidentialinformation, first make sure that theinformation is entered via an entirely secureand official webpage. There are two ways todetermine the security of the webpage:a.The address displayed on the browserbegins with https://, and not http://. Payattention to if the letter ‘s’ exists.b.There is a security lock sign on the lowerright corner of the webpage, and whenyour mouse points to the sign, a securitycertification sign shall appear.(2)Consider installing a browser security softwarelike SpoofStick which can detect fake websites.(3)If you suspect the received e-mail is a Phishinge-mail, do not open attachments attached to theemail. Opening an unknown attachment couldinstall malicious programs onto your computer.(4)Do not click on links attached to your emails. Itis always safer to visit the website through theofficial link or to first confirm the authenticityof the link. Never follow or click on suspiciouslinks in an e-mail. It is advisable to enter theURL at the address bar of the web browser,and not follow the given link.Generally speaking, Phishing [3] [5] is a method that exploits people’s sympathy in the form of aid-seeking e-mails; the e-mail act as bait. These e-mails usually request their readers to visit a link that seemingly links to some charitable organization’s website; but in truth links the readers to a website that will install a Trojan program into the reader’s computer. Therefore, users should not forward unauthenticated charity mails, or click on unfamiliar links in an e-mail. Sometimes, the link could be a very familiar link or an often frequented website, but still, it would be safer if you’d type in the address yourself so as to avoid being linked to a fraudulent website. Phisher deludes people by using similar e-mails mailed by well-known enterprises or banks; these e-mails often asks users to provide personal information, or result in losing their personal rights; they usually contain a counterfeit URL which links to a website where the users can fillin the required information. People are often trapped by phishing due to inattentionBesides, you must also be careful when using a search engine to search for donations and charitable organizations.2.3 Fake WebsitesFake bank websites stealing account numbers and passwords have become increasingly common with the growth of online financial transactions. Hence, when using online banking, we should take precautions like using a secure encrypted customer’s certificate, surf the net following the correct procedure, etc.There are countless kinds of phishing baits, for instance, messages that say data expired, data invalid, please update data, or identity verification intended to steal account ID and matching password. This typeof online scam is difficult for users to identify. As scam methods become finer, e-mails and forged websites created by the impostor resemble their original, and tremendous losses arise from the illegal transactions.The following are methods commonly used by fake websites. First, the scammers create a similar website homepage; then they send out e-mails withenticing messages to attract visitors. They may also use fake links to link internet surfers to their website. Next, the fake website tricks the visitors into entering their personal information, credit card information or online banking account number and passwords. After obtaining a user’s information, the scammers can use the information to drain the bank accounts, shop online or create fake credit cards and other similar crimes. Usually, there will be a quick search option on these fake websites, luring users to enter their account number and password. When a user enters their account number and password, the website will respond with a message stating that the server is under maintenance. Hence, we must observe the following when using online banking:(1)Observe the correct procedure for entering abanking website. Do not use links resultingfrom searches or links on other websites.(2)Online banking certifications are currently themost effective security safeguard measure. (3)Do not easily trust e-mails, phone calls, andshort messages, etc. that asks for your accountnumber and passwords.Phishers often impost a well-known enterprise while sending their e-mails, by changing the sender’s e-mail address to that of the well known enterprise, in order to gain people’s trust. The ‘From’ column of an e-mail is set by the mail software and can be easily changed by the web administrator. Then, the Phisher creates a fake information input website, and send out e-mails containing a link to this fake website to lure e-mail recipients into visiting his fake website.Most Phishers create imitations of well known enterprises websites to lure users into using their fake websites. Even so, a user can easily notice that the URL of the website they’re entering has no relation to the intended enterprise. Hence, Phishers may use different methods to impersonate enterprises and other people. A commonly used method is hiding the URL. This can easily be done with the help of JavaScript.Another way is to exploit the loopholes in an internet browser, for instance, displaying a fake URL in the browser’s address bar. The security loophole causing the address bar of a browser to display a fake URL is a commonly used trick and has often been used in the past. For example, an e-mail in HTML format may hold the URL of a website of a well-known enterprise, but in reality, the link connects to a fake website.The key to successfully use a URL similar to that of the intended website is to trick the visual senses. For example, the sender’s address could be disguised as that of Nikkei BP, and the link set to http://www.nikeibp.co.jp/ which has one k less than the correct URL which is http://www.nikkeibp.co.jp/. The two URLs look very similar, and the difference barely noticeable. Hence people are easily tricked into clicking the link.Besides the above, there are many more scams that exploit the trickery of visual senses. Therefore, you should not easily trust the given sender’s name and a website’s appearance. Never click on unfamiliar and suspicious URLs on a webpage. Also, never enter personal information into a website without careful scrutiny.3. ConclusionsBusiness strategy is the most effective form of defense and also the easiest to carry out. Therefore, they should be the first line of defense, and not last. First, determine if instant messaging is essential in the business; then weigh its pros and cons. Rules and norms must be set on user ends if it is decided that the business cannot do without instant messaging functionality. The end server should be able to support functions like centralized logging and encryption. If not, then strict rules must be drawn, and carried out by the users. Especially, business discussions must not be done over an instant messenger.The paper categorized hacking tricks into three categories: (1) Trojan programs that share files via instant messenger. (2) Phishing (3) Fake Websites. Hacking tricks when successfully carried out could cause considerable loss and damage to users. The first category of hacking tricks can be divided into three types: (1) Hijacking and Impersonation; (2) Denial of Service; (3) Information Disclosure.Acknowledgement:This work was supported by the National Science Council, Taiwan, under contract No. NSC 95-2221-E-029-024.References[1] B. Schneier, “The trojan horse race,”Communications of ACM, Vol. 42, 1999, pp.128.[2] C. L. Schuba, “Analysis of a denial of serviceattack on TCP,” IEEE Security and PrivacyConference, 1997, pp. 208-223.[3] E. Schultz, “Phishing is becoming moresophisticated,” Computer and Security, Vol.24(3), 2005, pp. 184-185.[4]G. Miklau, D. Suciu, “A formal analysis ofinformation disclosure in data exchange,”International Conference on Management ofData, 2004, pp. 575-586.[5]J. Hoyle, “'Phishing' for trouble,” Journal ofthe American Detal Association, Vol. 134(9),2003, pp. 1182-1182.[6]J. Scambray, S. McClure, G. Kurtz, Hackingexposed: network security secrets and solutions,McGraw-Hill, 2001.[7]T. Tsuji and A. Shimizu, “An impersonationattack on one-time password authenticationprotocol OSPA,” to appear in IEICE Trans.Commun, Vol. E86-B, No.7, 2003.[8]Anti-Phishing Working Group,.[9]/region/tw/enterprise/article/icq_threat.html.有关网络环境安全的黑客技术摘要：现在人们往往通过互联网处理事务。

Anti-Aircraft Fire Control and the Development of IntegratedSystems at SperryT he dawn of the electrical age brought new types of control systems. Able to transmit data between distributed components and effect action at a distance, these systems employed feedback devices as well as human beings to close control loops at every level. By the time theories of feedback and stability began to become practical for engineers in the 1930s a tradition of remote and automatic control engineering had developed that built distributed control systems with centralized information processors. These two strands of technology, control theory and control systems, came together to produce the large-scale integrated systems typical of World War II and after.Elmer Ambrose Sperry (I860-1930) and the company he founded, the Sperry Gyroscope Company, led the engineering of control systems between 1910 and 1940. Sperry and his engineers built distributed data transmission systems that laid the foundations of today‟s command and control systems. Sperry‟s fire control systems included more than governors or stabilizers; they consisted of distributed sensors, data transmitters, central processors, and outputs that drove machinery. This article tells the story of Sperry‟s involvement in anti-aircraft fire control between the world wars and shows how an industrial firm conceived of control systems before the common use of control theory. In the 1930s the task of fire control became progressively more automated, as Sperry engineers gradually replaced human operators with automatic devices. Feedback, human interface, and system integration posed challenging problems for fire control engineers during this period. By the end of the decade these problems would become critical as the country struggled to build up its technology to meet the demands of an impending war.Anti-Aircraft Artillery Fire ControlBefore World War I, developments in ship design, guns, and armor drove the need for improved fire control on Navy ships. By 1920, similar forces were at work in the air: wartime experiences and postwar developments in aerial bombing created the need for sophisticated fire control for anti-aircraft artillery. Shooting an airplane out of the sky is essentially a problem of “leading” the target. As aircraft developed rapidly in the twenties, their increased speed and altitude rapidly pushed the task of computing the lead out of the range of human reaction and calculation. Fire control equipment for anti-aircraft guns was a means of technologically aiding human operators to accomplish a task beyond their natural capabilities.During the first world war, anti-aircraft fire control had undergone some preliminary development. Elmer Sperry, as chairman of the Aviation Committee of the Naval Consulting Board, developed two instruments for this problem: a goniometer,a range-finder, and a pretelemeter, a fire director or calculator. Neither, however, was widely used in the field.When the war ended in I918 the Army undertook virtually no new development in anti-aircraft fire control for five to seven years. In the mid-1920s however, the Army began to develop individual components for anti-aircraft equipment including stereoscopic height-finders, searchlights, and sound location equipment. The Sperry Company was involved in the latter two efforts. About this time Maj. Thomas Wilson, at the Frankford Arsenal in Philadelphia, began developing a central computer for firecontrol data, loosely based on the system of “director firing” that had developed in naval gunn ery. Wilson‟s device resembled earlier fire control calculators, accepting data as input from sensing components, performing calculations to predict the future location of the target, and producing direction information to the guns.Integration and Data TransmissionStill, the components of an anti-aircraft battery remained independent, tied together only by telephone. As Preston R. Bassett, chief engineer and later president of the Sperry Company, recalled, “no sooner, however, did the components get to the point of functioning satisfactorily within themselves, than the problem of properly transmitting the information from one to the other came to be of prime importance.”Tactical and terrain considerations often required that different fire control elements be separated by up to several hundred feet. Observers telephoned their data to an officer, who manually entered it into the central computer, read off the results, and telephoned them to the gun installations. This communication system introduced both a time delay and the opportunity for error. The components needed tighter integration, and such a system required automatic data communications.In the 1920s the Sperry Gyroscope Company led the field in data communications. Its experience came from Elmer Spe rry‟s most successful invention, a true-north seeking gyro for ships. A significant feature of the Sperry Gyrocompass was its ability to transmit heading data from a single central gyro to repeaters located at a number of locations around the ship. The repeaters, essentially follow-up servos, connected to another follow-up, which tracked the motion of the gyro without interference. These data transmitters had attracted the interest of the Navy, which needed a stable heading reference and a system of data communication for its own fire control problems. In 1916, Sperry built a fire control system for the Navy which, although it placed minimal emphasis on automatic computing, was a sophisticated distributed data system. By 1920 Sperry had installed these systems on a number of US. battleships.Because of the Sperry Company‟s experience with fire control in the Navy, as well as Elmer Sperry‟s earlier work with the goniometer and the pretelemeter, the Army approached the company for help with data transmission for anti-aircraft fire control. To Elmer Sperry, it looked like an easy problem: the calculations resembled those in a naval application, but the physical platform, unlike a ship at sea, anchored to the ground. Sperry engineers visited Wilson at the Frankford Arsenal in 1925, and Elmer Sperry followed up with a letter expressing his interest in working on the problem. He stressed his company‟s experience with naval problems, as well as its recent developments in bombsights, “work from the other end of the pro position.” Bombsights had to incorporate numerous parameters of wind, groundspeed, airspeed, and ballistics, so an anti-aircraft gun director was in some ways a reciprocal bombsight . In fact, part of the reason anti-aircraft fire control equipment worked at all was that it assumed attacking bombers had to fly straight and level to line up their bombsights. Elmer Sperry‟s interests were warmly received, and in I925 and 1926 the Sperry Company built two data transmission systems for the Army‟s gun directors.The original director built at Frankford was designated T-1, or the “Wilson Director.” The Army had purchased a Vickers director manufactured in England, but encouraged Wilson to design one thatcould be manufactured in this country Sperry‟s two data tran smission projects were to add automatic communications between the elements of both the Wilson and the Vickers systems (Vickers would eventually incorporate the Sperry system into its product). Wilson died in 1927, and the Sperry Company took over the entire director development from the Frankford Arsenal with a contract to build and deliver a director incorporating the best features of both the Wilson and Vickers systems. From 1927 to 193.5, Sperry undertook a small but intensive development program in anti-aircraft systems. The company financed its engineering internally, selling directors in small quantities to the Army, mostly for evaluation, for only the actual cost of production [S]. Of the nearly 10 models Sperry developed during this period, it never sold more than 12 of any model; the average order was five. The Sperry Company offset some development costs by sales to foreign govemments, especially Russia, with the Army‟s approval 191.The T-6 DirectorSperry‟s modified version of Wilson‟s director was designated T-4 in development. This model incorporated corrections for air density, super-elevation, and wind. Assembled and tested at Frankford in the fall of 1928, it had problems with backlash and reliability in its predicting mechanisms. Still, the Army found the T-4 promising and after testing returned it to Sperry for modification. The company changed the design for simpler manufacture, eliminated two operators, and improved reliability. In 1930 Sperry returned with the T-6, which tested successfully. By the end of 1931, the Army had ordered 12 of the units. The T-6 was standardized by the Army as the M-2 director.Since the T-6 was the first anti-aircraft director to be put into production, as well as the first one the Army formally procured, it is instructive to examine its operation in detail. A technical memorandum dated 1930 explained the theory behind the T-6 calculations and how the equations were solved by the system. Although this publication lists no author, it probably was written by Earl W. Chafee, Sperry‟s director of fire control engineering. The director was a complex mechanical analog computer that connected four three-inch anti-aircraft guns and an altitude finder into an integratedsystem (see Fig. 1). Just as with Sperry‟s naval fire control system, the primary means of connection were “data transmitters,” similar to those that connected gyrocompasses to repeaters aboard ship.The director takes three primary inputs. Target altitude comes from a stereoscopic range finder. This device has two telescopes separated by a baseline of 12 feet; a single operator adjusts the angle between them to bring the two images into coincidence. Slant range, or the raw target distance, is then corrected to derive its altitude component. Two additional operators, each with a separate telescope, track the target, one for azimuth and one for elevation. Each sighting device has a data transmitter that measures angle or range and sends it to the computer. The computer receives these data and incorporates manual adjustments for wind velocity, wind direction, muzzle velocity, air density, and other factors. The computer calculates three variables: azimuth, elevation, and a setting for the fuze. The latter, manually set before loading, determines the time after firing at which the shell will explode. Shells are not intended to hit the target plane directly but rather to explode near it, scattering fragments to destroy it.The director performs two major calculations. First, pvediction models the motion of the target and extrapolates its position to some time in the future. Prediction corresponds to “leading” the target. Second, the ballistic calculation figures how to make the shell arrive at the desired point in space at the future time and explode, solving for the azimuth and elevation of the gun and the setting on the fuze. This calculation corresponds to the traditional artillery man‟s task of looking up data in a precalculated “firing table” and setting gun parameters accordingly. Ballistic calculation is simpler than prediction, so we will examine it first.The T-6 director solves the ballistic problem by directly mechanizing the traditional method, employing a “mechanical firing table.” Traditional firing tables printed on paper show solutions for a given angular height of the target, for a given horizontal range, and a number of other variables. The T-6 replaces the firing table with a Sperry ballistic cam.” A three-dimensionally machined cone shaped device, the ballistic cam or “pin follower” solves a pre-determined function. Two independent variables are input by the angular rotation of the cam and the longitudinal position of a pin that rests on top of the cam. As the pin moves up and down the length of the cam, and as the cam rotates, the height of the pin traces a function of two variables: the solution to the ballistics problem (or part of it). The T-6 director incorporates eight ballistic cams, each solving for a different component of the computation including superelevation, time of flight, wind correction, muzzle velocity. air density correction. Ballistic cams represented, in essence, the stored data of the mechanical computer. Later directors could be adapted to different guns simply by replacing the ballistic cams with a new set, machined according to different firing tables. The ballistic cams comprised a central component of Sperry‟s mechanical computing technology. The difficulty of their manufacture would prove a major limitation on the usefulness of Sperry directors.The T-6 director performed its other computational function, prediction, in an innovative way as well. Though the target came into the system in polar coordinates (azimuth, elevation, and range), targets usually flew a constant trajectory (it was assumed) in rectangular coordinates-i.e. straight andlevel. Thus, it was simpler to extrapolate to the future in rectangular coordinates than in the polar system. So the Sperry director projected the movement of the target onto a horizontal plane, derived the velocity from changes in position, added a fixed time multiplied by the velocity to determine a future position, and then converted the solution back into polar coordinates. This method became known as the “plan prediction method”because of the representation of the data on a flat “plan” as viewed from above; it was commonly used through World War II. In the plan prediction method, “the actual movement of the target is mechanically reproduced on a small scale within the Computer and the desired angles or speeds can be measured directly from the movements of these elements.”Together, the ballistic and prediction calculations form a feedback loop. Operators enter an estimated “time of flight” for the shell when they first begin tracking. The predictor uses this estimate to perform its initial calculation, which feeds into the ballistic stage. The output of the ballistics calculation then feeds back an updated time-of-flight estimate, which the predictor uses to refine the initial estimate. Thus “a cumulative cycle of correction brings the predicted future position of the target up to the point indicated by the actual future time of flight.”A square box about four feet on each side (see Fig. 2) the T-6 director was mounted on a pedestal on which it could rotate. Three crew would sit on seats and one or two would stand on a step mounted to the machine. The remainder of the crew stood on a fixed platform; they would have had to shuffle around as the unit rotated. This was probably not a problem, as the rotation angles were small. The direc tor‟s pedestal mounted on a trailer, on which data transmission cables and the range finder could be packed for transportation.We have seen that the T-6 computer took only three inputs, elevation, azimuth, and altitude (range), and yet it required nine operators. These nine did not include the operation of the range finder, which was considered a separate instrument, but only those operating the director itself. What did these nine men do?Human ServomechanismsTo the designers of the director, the operato rs functioned as “manual servomechanisms.”One specification for the machine required “minimum dependence on …human element.‟ The Sperry Company explained, “All operations must be made as mechanical and foolproof as possible; training requirements must visualize the conditions existent under rapid mobilization.” The lessons of World War I ring in this statement; even at the height of isolationism, with the country sliding into depression, design engineers understood the difficulty of raising large numbers of trained personnel in a national emergency. The designers not only thought the system should account for minimal training and high personnel turnover, they also considered the ability of operators to perform their duties under the stress of battle. Thus, nearly all the work for the crew was in a “follow-the-pointer”mode: each man concentrated on an instrument with two indicating dials, one the actual and one the desired value for a particular parameter. With a hand crank, he adjusted the parameter to match the two dials.Still, it seems curious that the T-6 director required so many men to perform this follow-the-pointer input. When the external rangefinder transmitted its data to the computer, it appeared on a dial and an operator had to follow the pointer to actually input the data into the computing mechanism. The machine did not explicitly calculate velocities. Rather, two operators (one for X and one for Y) adjusted variable-speed drives until their rate dials matched that of a constant-speed motor. When the prediction computation was complete, an operator had to feed the result into the ballistic calculation mechanism. Finally, when the entire calculation cycle was completed, another operator had to follow the pointer to transmit azimuth to the gun crew, who in turn had to match the train and elevation of the gun to the pointer indications.Human operators were the means of connecting “individual elements” into an integrated system. In one sense the men were impedance amplifiers, and hence quite similar to servomechanisms in other mechanical calculators of the time, especially Vannevar Bush‟s differential analyzer .The term “manual servomechanism”itself is an oxymoron: by the conventional definition, all servomechanisms are automatic. The very use of the term acknowledges the existence of an automatic technology that will eventually replace the manual method. With the T-6, this process was already underway. Though the director required nine operators, it had already eliminated two from the previous generation T-4. Servos replaced the operator who fed back superelevation data and the one who transmitted the fuze setting. Furthermore, in this early machine one man corresponded to one variable, and the machine‟s requirement for operators corresponded directly to the data flow of its computation. Thus the crew that operated the T-6 director was an exact reflection of the algorithm inside it.Why, then, were only two of the variables automated? This partial, almost hesitating automation indicates there was more to the human servo-motors than Sperry wanted to acknowledge. As much as the company touted “their duties are purely mechanical and little skill or judgment is required on the part of the operators,” men were still required to exercise some judgment, even if unconsciously. The data were noisy, and even an unskilled human eye could eliminate complications due to erroneous or corrupted data. The mechanisms themselves were rather delicate and erroneous input data, especially if it indicated conditions that were not physically possible, could lock up or damage the mechanisms. Theoperators performed as integrators in both senses of the term: they integrated different elements into a system.Later Sperry DirectorsWhen Elmer Sperry died in 1930, his engineers were at work on a newer generation director, the T-8. This machine was intended to be lighter and more portable than earlier models, as well as less expensive and “procurable in quantities in case of emergency.” The company still emphasized the need for unskilled men to operate the system in wartime, and their role as system integrators. The operators were “mechanical links in the apparatus, thereby making it possible to avoid mechanical complication which would be involved by the use of electrical or mechanical servo motors.” Still, army field experience with the T-6 had shown that servo-motors were a viable way to reduce the number of operators and improve reliability, so the requirements for the T-8 specified that wherever possible “electrical shall be used to reduce the number of operators to a minimum.” Thus the T-8 continued the process of automating fire control, and reduced the number of operators to four. Two men followed the target with telescopes, and only two were required for follow-the-pointer functions. The other follow-the-pointers had been replaced by follow-up servos fitted with magnetic brakes to eliminate hunting. Several experimental versions of the T-8 were built, and it was standardized by the Army as the M3 in 1934.Throughout the remain der of the …30s Sperry and the army fine-tuned the director system in the M3. Succeeding M3 models automated further, replacing the follow-the-pointers for target velocity with a velocity follow-up which employed a ball-and-disc integrator. The M4 series, standardized in 1939, was similar to the M3 but abandoned the constant altitude assumption and added an altitude predictor for gliding targets. The M7, standardized in 1941, was essentially similar to the M4 but added full power control to the guns for automatic pointing in elevation and azimuth. These later systems had eliminated errors. Automatic setters and loaders did not improve the situation because of reliability problems. At the start of World War II, the M7 was the primary anti-aircraft director available to the army.The M7 was a highly developed and integrated system, optimized for reliability and ease of operation and maintenance. As a mechanical computer, it was an elegant, if intricate, device, weighing 850 pounds and including about 11,000 parts. The design of the M7 capitalized on the strength of the Sperry Company: manufacturing of precision mechanisms, especially ballistic cams. By the time the U.S. entered the second world war, however, these capabilities were a scarce resource, especially for high volumes. Production of the M7 by Sperry and Ford Motor Company as subcontractor was a “real choke” and could not keep up with production of the 90mm guns, well into 1942. The army had also adopted an English system, known as the “Kerrison Director” or M5, which was less accurate than the M7 but easier to manufacture. Sperry redesigned the M5 for high-volume production in 1940, but passed in 1941.Conclusion: Human Beings as System IntegratorsThe Sperry directors we have examined here were transitional, experimental systems. Exactly for that reason, however, they allow us to peer inside the process of automation, to examine the displacement of human operators by servomechanisms while the process was still underway. Skilled asthe Sperry Company was at data transmission, it only gradually became comfortable with the automatic communication of data between subsystems. Sperry could brag about the low skill levels required of the operators of the machine, but in 1930 it was unwilling to remove them completely from the process. Men were the glue that held integrated systems together.As products, the Sperry Company‟s anti-aircraft gun directors were only partially successful. Still, we should judge a technological development program not only by the machines it produces but also by the knowledge it creates, and by how that knowledge contributes to future advances. Sperry‟s anti-aircraft directors of the 1930s were early examples of distributed control systems, technology that would assume critical importance in the following decades with the development of radar and digital computers. When building the more complex systems of later years, engineers at Bell Labs, MIT, and elsewhere would incorporate and build on the Sperry Company‟s experience,grappling with the engineering difficulties of feedback, control, and the augmentation of human capabilities by technological systems.在斯佩里防空炮火控和集成系统的发展电气时代的到来带来了新类型的控制系统。

毕业设计（论文)外文资料翻译系别：专业：班级:姓名：学号:外文出处:附件： 1. 原文; 2。

译文2013年03月附件一：A Rapidly Deployable Manipulator SystemChristiaan J。

J。

Paredis, H. Benjamin Brown，Pradeep K. KhoslaAbstract:A rapidly deployable manipulator system combines the flexibility of reconfigurable modular hardware with modular programming tools，allowing the user to rapidly create a manipulator which is custom-tailored for a given task. This article describes two main aspects of such a system，namely，the Reconfigurable Modular Manipulator System （RMMS)hardware and the corresponding control software。

1 IntroductionRobot manipulators can be easily reprogrammed to perform different tasks, yet the range of tasks that can be performed by a manipulator is limited by mechanicalstructure。

Forexample，a manipulator well-suited for precise movement across the top of a table would probably no be capable of lifting heavy objects in the vertical direction. Therefore，to perform a given task,one needs to choose a manipulator with an appropriate mechanical structure.We propose the concept of a rapidly deployable manipulator system to address the above mentioned shortcomings of fixed configuration manipulators。

Bid Compensation Decision Model for Projectswith Costly Bid PreparationS.Ping Ho,A.M.ASCE 1Abstract:For projects with high bid preparation cost,it is often suggested that the owner should consider paying bid compensation to the most highly ranked unsuccessful bidders to stimulate extra effort or inputs in bid preparation.Whereas the underlying idea of using bid compensation is intuitively sound,there is no theoretical basis or empirical evidence for such suggestion.Because costly bid preparation often implies a larger project scale,the issue of bid compensation strategy is important to practitioners and an interest of study.This paper aims to study the impacts of bid compensation and to develop appropriate bid compensation strategies.Game theory is applied to analyze the behavioral dynamics between competing bidders and project owners.A bid compensation model based on game theoretic analysis is developed in this study.The model provides equilibrium solutions under bid compensation,quantitative formula,and quali-tative implications for the formation of bid compensation strategies.DOI:10.1061/(ASCE )0733-9364(2005)131:2(151)CE Database subject headings:Bids;Project management;Contracts;Decision making;Design/build;Build/Operate/Transfer;Construction industry .IntroductionAn often seen suggestion in practice for projects with high bid preparation cost is that the owner should consider paying bid compensation,also called a stipend or honorarium,to the unsuc-cessful bidders.For example,according to the Design–build Manual of Practice Document Number 201by Design–Build In-stitute of America (DBIA )(1996a ),it is suggested that that “the owner should consider paying a stipend or honorarium to the unsuccessful proposers”because “excessive submittal require-ments without some compensation is abusive to the design–build industry and discourages quality teams from participating.”In another publication by DBIA (1995),it is also stated that “it is strongly recommended that honorariums be offered to the unsuc-cessful proposers”and that “the provision of reasonable compen-sation will encourage the more sought-after design–build teams to apply and,if short listed,to make an extra effort in the prepara-tion of their proposal.”Whereas bid preparation costs depend on project scale,delivery method,and other factors,the cost of pre-paring a proposal is often relatively high in some particular project delivery schemes,such as design–build or build–operate–transfer (BOT )contracting.Plus,costly bid preparation often im-plying a large project scale,the issue of bid compensation strat-egy should be important to practitioners and of great interest of study.Existing research on the procurement process in constructionhas addressed the selection of projects that are appropriate for certain project delivery methods (Molenaar and Songer 1998;Molenaar and Gransberg 2001),the design–build project procure-ment processes (Songer et al.1994;Gransberg and Senadheera 1999;Palaneeswaran and Kumaraswamy 2000),and the BOT project procurement process (United Nations Industrial Develop-ment Organization 1996).However,the bid compensation strat-egy for projects with a relatively high bid preparation cost has not been studied.Among the issues over the bidder’s response to the owner’s procurement or bid compensation strategy,it is in own-er’s interest to understand how the owner can stimulate high-quality inputs or extra effort from the bidder during bid prepara-tion.Whereas the argument for using bid compensation is intuitively sound,there is no theoretical basis or empirical evi-dence for such an argument.Therefore,it is crucial to study under what conditions the bid compensation is effective,and how much compensation is adequate with respect to different bidding situa-tions.This paper focuses on theoretically studying the impacts of bid compensation and tries to develop appropriate compensation strategies for projects with a costly bid preparation.Game theory will be applied to analyze the behavioral dynamics between com-peting bidders.Based on the game theoretic analysis and numeric trials,a bid compensation model is developed.The model pro-vides a quantitative framework,as well as qualitative implica-tions,on bid compensation strategies.Research Methodology:Game TheoryGame theory can be defined as “the study of mathematical models of conflict and cooperation between intelligent rational decision-makers”(Myerson 1991).Among economic theories,game theory has been successfully applied to many important issues such as negotiations,finance,and imperfect markets.Game theory has also been applied to construction management in two areas.Ho (2001)applied game theory to analyze the information asymme-try problem during the procurement of a BOT project and its1Assistant Professor,Dept.of Civil Engineering,National Taiwan Univ.,Taipei 10617,Taiwan.E-mail:spingho@.twNote.Discussion open until July 1,2005.Separate discussions must be submitted for individual papers.To extend the closing date by one month,a written request must be filed with the ASCE Managing Editor.The manuscript for this paper was submitted for review and possible publication on March 5,2003;approved on March 1,2004.This paper is part of the Journal of Construction Engineering and Management ,V ol.131,No.2,February 1,2005.©ASCE,ISSN 0733-9364/2005/2-151–159/$25.00.D o w n l o a d e d f r o m a s c e l i b r a r y .o r g b y N A N J I N G U N I VE R S I T Y OF o n 01/06/14. C o p y r i g h t A S C E . F o r p e r s o n a l u s e o n l y ; a l l r i g h t s r e s e r v e d .implication in project financing and government policy.Ho and Liu (2004)develop a game theoretic model for analyzing the behavioral dynamics of builders and owners in construction claims.In competitive bidding,the strategic interactions among competing bidders and that between bidders and owners are com-mon,and thus game theory is a natural tool to analyze the prob-lem of concern.A well-known example of a game is the “prisoner’s dilemma”shown in Fig.1.Two suspects are arrested and held in separate cells.If both of them confess,then they will be sentenced to jail for 6years.If neither confesses,each will be sentenced for only 1year.However,if one of them confesses and the other does not,then the honest one will be rewarded by being released (in jail for 0year )and the other will be punished for 9years in jail.Note that in each cell,the first number represents player No.1’s payoff and the second one represents player No.2’s.The prisoner’s dilemma is called a “static game,”in which they act simultaneously;i.e.,each player does not know the other player’s decision before the player makes the decision.If the payoff matrix shown in Fig.1is known to all players,then the payoff matrix is a “common knowledge”to all players and this game is called a game of “complete information.”Note that the players of a game are assumed to be rational;i.e.,to maximize their payoffs.To answer what each prisoner will play/behave in this game,we will introduce the concept of “Nash equilibrium ,”one of the most important concepts in game theory.Nash equilibrium is a set of actions that will be chosen by each player.In a Nash equilib-rium,each player’s strategy should be the best response to the other player’s strategy,and no player wants to deviate from the equilibrium solution.Thus,the equilibrium or solution is “strate-gically stable”or “self-enforcing”(Gibbons 1992).Conversely,a nonequilibrium solution is not stable since at least one of the players can be better off by deviating from the nonequilibrium solution.In the prisoner’s dilemma,only the (confess,confess )solution where both players choose to confess,satisfies the stabil-ity test or requirement of Nash equilibrium.Note that although the (not confess,not confess )solution seems better off for both players compared to Nash equilibrium;however,this solution is unstable since either player can obtain extra benefit by deviating from this solution.Interested readers can refer to Gibbons (1992),Fudenberg and Tirole (1992),and Myerson (1991).Bid Compensation ModelIn this section,the bid compensation model is developed on the basis of game theoretic analysis.The model could help the ownerform bid compensation strategies under various competition situ-ations and project characteristics.Illustrative examples with nu-merical results are given when necessary to show how the model can be used in various scenarios.Assumptions and Model SetupTo perform a game theoretic study,it is critical to make necessary simplifications so that one can focus on the issues of concern and obtain insightful results.Then,the setup of a model will follow.The assumptions made in this model are summarized as follows.Note that these assumptions can be relaxed in future studies for more general purposes.1.Average bidders:The bidders are equally good,in terms oftheir technical and managerial capabilities.Since the design–build and BOT focus on quality issues,the prequalification process imposed during procurement reduces the variation of the quality of bidders.As a result,it is not unreasonable to make the “average bidders”assumption.plete information:If all players consider each other tobe an average bidder as suggested in the first assumption,it is natural to assume that the payoffs of each player in each potential solution are known to all players.3.Bid compensation for the second best bidder:Since DBIA’s(1996b )manual,document number 103,suggests that “the stipend is paid only to the most highly ranked unsuccessful offerors to prevent proposals being submitted simply to ob-tain a stipend,”we shall assume that the bid compensation will be offered to the second best bidder.4.Two levels of efforts:It is assumed that there are two levelsof efforts in preparing a proposal,high and average,denoted by H and A ,respectively.The effort A is defined as the level of effort that does not incur extra cost to improve quality.Contrarily,the effort H is defined as the level of effort that will incur extra cost,denoted as E ,to improve the quality of a proposal,where the improvement is detectable by an effec-tive proposal evaluation system.Typically,the standard of quality would be transformed to the evaluation criteria and their respective weights specified in the Request for Pro-posal.5.Fixed amount of bid compensation,S :The fixed amount canbe expressed by a certain percentage of the average profit,denoted as P ,assumed during the procurement by an average bidder.6.Absorption of extra cost,E :For convenience,it is assumedthat E will not be included in the bid price so that the high effort bidder will win the contract under the price–quality competition,such as best-value approach.This assumption simplifies the tradeoff between quality improvement and bid price increase.Two-Bidder GameIn this game,there are only two qualified bidders.The possible payoffs for each bidder in the game are shown in a normal form in Fig.2.If both bidders choose “H ,”denoted by ͑H ,H ͒,both bidders will have a 50%probability of wining the contract,and at the same time,have another 50%probability of losing the con-tract but being rewarded with the bid compensation,S .As a re-sult,the expected payoffs for the bidders in ͑H ,H ͒solution are ͑S /2+P /2−E ,S /2+P /2−E ͒.Note that the computation of the expected payoff is based on the assumption of the average bidder.Similarly,if the bidders choose ͑A ,A ͒,the expected payoffswillFig.1.Prisoner’s dilemmaD o w n l o a d e d f r o m a s c e l i b r a r y .o r g b y N A N J I N G U N I VE R S I T Y OF o n 01/06/14. C o p y r i g h t A S C E . F o r p e r s o n a l u s e o n l y ; a l l r i g h t s r e s e r v e d .be ͑S /2+P /2,S /2+P /2͒.If the bidders choose ͑H ,A ͒,bidder No.1will have a 100%probability of winning the contract,and thus the expected payoffs are ͑P −E ,S ͒.Similarly,if the bidders choose ͑A ,H ͒,the expected payoffs will be ͑S ,P −E ͒.Payoffs of an n -bidder game can be obtained by the same reasoning.Nash EquilibriumSince the payoffs in each equilibrium are expressed as functions of S ,P ,and E ,instead of a particular number,the model will focus on the conditions for each possible Nash equilibrium of the game.Here,the approach to solving for Nash equilibrium is to find conditions that ensure the stability or self-enforcing require-ment of Nash equilibrium.This technique will be applied throughout this paper.First,check the payoffs of ͑H ,H ͒solution.For bidder No.1or 2not to deviate from this solution,we must haveS /2+P /2−E ϾS →S ϽP −2E͑1͒Therefore,condition (1)guarantees ͑H ,H ͒to be a Nash equilib-rium.Second,check the payoffs of ͑A ,A ͒solution.For bidder No.1or 2not to deviate from ͑A ,A ͒,condition (2)must be satisfiedS /2+P /2ϾP −E →S ϾP −2E͑2͒Thus,condition (2)guarantees ͑A ,A ͒to be a Nash equilibrium.Note that the condition “S =P −2E ”will be ignored since the con-dition can become (1)or (2)by adding or subtracting an infinitely small positive number.Thus,since S must satisfy either condition (1)or condition (2),either ͑H ,H ͒or ͑A ,A ͒must be a unique Nash equilibrium.Third,check the payoffs of ͑H ,A ͒solution.For bid-der No.1not to deviate from H to A ,we must have P −E ϾS /2+P /2;i.e.,S ϽP −2E .For bidder No.2not to deviate from A to H ,we must have S ϾS /2+P /2−E ;i.e.,S ϾP −2E .Since S cannot be greater than and less than P −2E at the same time,͑H ,A ͒solution cannot exist.Similarly,͑A ,H ͒solution cannot exist either.This also confirms the previous conclusion that either ͑H ,H ͒or ͑A ,A ͒must be a unique Nash equilibrium.Impacts of Bid CompensationBid compensation is designed to serve as an incentive to induce bidders to make high effort.Therefore,the concerns of bid com-pensation strategy should focus on whether S can induce high effort and how effective it is.According to the equilibrium solu-tions,the bid compensation decision should depend on the mag-nitude of P −2E or the relative magnitude of E compared to P .If E is relatively small such that P Ͼ2E ,then P −2E will be positive and condition (1)will be satisfied even when S =0.This means that bid compensation is not an incentive for high effort when the extra cost of high effort is relatively low.Moreover,surprisingly,S can be damaging when S is high enough such that S ϾP −2E .On the other hand,if E is relatively large so that P −2E is negative,then condition (2)will always be satisfied since S can-not be negative.In this case,͑A ,A ͒will be a unique Nash equi-librium.In other words,when E is relatively large,it is not in the bidder’s interest to incur extra cost for improving the quality of proposal,and therefore,S cannot provide any incentives for high effort.To summarize,when E is relatively low,it is in the bidder’s interest to make high effort even if there is no bid compensation.When E is relatively high,the bidder will be better off by making average effort.In other words,bid compensation cannot promote extra effort in a two-bidder game,and ironically,bid compensa-tion may discourage high effort if the compensation is too much.Thus,in the two-bidder procurement,the owner should not use bid compensation as an incentive to induce high effort.Three-Bidder GameNash EquilibriumFig.3shows all the combinations of actions and their respective payoffs in a three-bidder game.Similar to the two-bidder game,here the Nash equilibrium can be solved by ensuring the stability of the solution.For equilibrium ͑H ,H ,H ͒,condition (3)must be satisfied for stability requirementS /3+P /3−E Ͼ0→S Ͼ3E −P͑3͒For equilibrium ͑A ,A ,A ͒,condition (4)must be satisfied so that no one has any incentives to choose HS /3+P /3ϾP −E →S Ͼ2P −3E͑4͒In a three-bidder game,it is possible that S will satisfy conditions (3)and (4)at the same time.This is different from the two-bidder game,where S can only satisfy either condition (1)or (2).Thus,there will be two pure strategy Nash equilibria when S satisfies conditions (3)and (4).However,since the payoff of ͑A ,A ,A ͒,S /3+P /3,is greater than the payoff of ͑H ,H ,H ͒,S /3+P /3−E ,for all bidders,the bidder will choose ͑A ,A ,A ͒eventually,pro-vided that a consensus between bidders of making effort A can be reached.The process of reaching such consensus is called “cheap talk,”where the agreement is beneficial to all players,and no player will want to deviate from such an agreement.In the design–build or BOT procurement,it is reasonable to believe that cheap talk can occur.Therefore,as long as condition (4)is satis-fied,͑A ,A ,A ͒will be a unique Nash equilibrium.An important implication is that the cheap talk condition must not be satisfied for any equilibrium solution other than ͑A ,A ,A ͒.In other words,condition (5)must be satisfied for all equilibrium solution except ͑A ,A ,A͒Fig.2.Two-biddergameFig.3.Three-bidder gameD o w n l o a d e d f r o m a s c e l i b r a r y .o r g b y N A N J I N G U N I VE R S I T Y OF o n 01/06/14. C o p y r i g h t A S C E . F o r p e r s o n a l u s e o n l y ; a l l r i g h t s r e s e r v e d .S Ͻ2P −3E ͑5͒Following this result,for ͑H ,H ,H ͒to be unique,conditions (3)and (5)must be satisfied;i.e.,we must have3E −P ϽS Ͻ2P −3E͑6͒Note that by definition S is a non-negative number;thus,if one cannot find a non-negative number to satisfy the equilibrium con-dition,then the respective equilibrium does not exist and the equi-librium condition will be marked as “N/A”in the illustrative fig-ures and tables.Next,check the solution where two bidders make high efforts and one bidder makes average effort,e.g.,͑H ,H ,A ͒.The ex-pected payoffs for ͑H ,H ,A ͒are ͑S /2+P /2−E ,S /2+P /2−E ,0͒.For ͑H ,H ,A ͒to be a Nash equilibrium,S /3+P /3−E Ͻ0must be satisfied so that the bidder with average effort will not deviate from A to H ,S /2+P /2−E ϾS /2must be satisfied so that the bidder with high effort will not deviate from H to A ,and condi-tion (5)must be satisfied as argued previously.The three condi-tions can be rewritten asS Ͻmin ͓3E −P ,2P −3E ͔andP −2E Ͼ0͑7͒Note that because of the average bidder assumption,if ͑H ,H ,A ͒is a Nash equilibrium,then ͑H ,A ,H ͒and ͑A ,H ,H ͒will also be the Nash equilibria.The three Nash equilibria will constitute a so-called mixed strategy Nash equilibrium,denoted by 2H +1A ,where each bidder randomizes actions between H and A with certain probabilities.The concept of mixed strategy Nash equilib-rium shall be explained in more detail in next section.Similarly,we can obtain the requirements for solution 1H +2A ,condition (5)and S /2+P /2−E ϽS /2must be satisfied.The requirements can be reorganized asS Ͻ2P −3EandP −2E Ͻ0͑8͒Note that the conflicting relationship between “P −2E Ͼ0”in condition (7)and “P −2E Ͻ0”in condition (8)seems to show that the two types of Nash equilibria are exclusive.Nevertheless,the only difference between 2H +1A and 1H +2A is that the bidder in 2H +1A equilibrium has a higher probability of playing H ,whereas the bidder in 1H +2A also mixes actions H and A but with lower probability of playing H .From this perspective,the difference between 2H +1A and 1H +2A is not very distinctive.In other words,one should not consider,for example,2H +1A ,to be two bidders playing H and one bidder playing A ;instead,one should consider each bidder to be playing H with higher probabil-ity.Similarly,1H +2A means that the bidder has a lower probabil-ity of playing H ,compared to 2H +1A .Illustrative Example:Effectiveness of Bid Compensation The equilibrium conditions for a three-bidder game is numerically illustrated and shown in Table 1,where P is arbitrarily assumed as 10%for numerical computation purposes and E varies to rep-resent different costs for higher efforts.The “*”in Table 1indi-cates that the zero compensation is the best strategy;i.e.,bid compensation is ineffective in terms of stimulating extra effort.According to the numerical results,Table 1shows that bid com-pensation can promote higher effort only when E is within the range of P /3ϽE ϽP /2,where zero compensation is not neces-sarily the best strategy.The question is that whether it is benefi-cial to the owner by incurring the cost of bid compensation when P /3ϽE ϽP /2.The answer to this question lies in the concept and definition of the mix strategy Nash equilibrium,2H +1A ,as explained previously.Since 2H +1A indicates that each bidderwill play H with significantly higher probability,2H +1A may already be good enough,knowing that we only need one bidder out of three to actually play H .We shall elaborate on this concept later in a more general setting.As a result,if the 2H +1A equilib-rium is good enough,the use of bid compensation in a three-bidder game will not be recommended.Four-Bidder Game and n-Bidder GameNash Equilibrium of Four-Bidder GameThe equilibrium of the four-bidder procurement can also be ob-tained.As the number of bidders increases,the number of poten-tial equilibria increases as well.Due to the length limitation,we shall only show the major equilibria and their conditions,which are derived following the same technique applied previously.The condition for pure strategy equilibrium 4H ,is4E −P ϽS Ͻ3P −4E͑9͒The condition for another pure strategy equilibrium,4A ,isS Ͼ3P −4E͑10͒Other potential equilibria are mainly mixed strategies,such as 3H +1A ,2H +2A ,and 1H +3A ,where the numeric number asso-ciated with H or A represents the number of bidders with effort H or A in a equilibrium.The condition for the 3H +1A equilibrium is3E −P ϽS Ͻmin ͓4E −P ,3P −4E ͔͑11͒For the 2H +2A equilibrium the condition is6E −3P ϽS Ͻmin ͓3E −P ,3P −4E ͔͑12͒The condition for the 1H +3A equilibrium isS Ͻmin ͓6E −3P ,3P −4E ͔͑13͒Illustrative Example of Four-Bidder GameTable 2numerically illustrates the impacts of bid compensation on the four-bidder procurement under different relative magni-tudes of E .When E is very small,bid compensation is not needed for promoting effort H .However,when E grows gradually,bid compensation becomes more effective.As E grows to a larger magnitude,greater than P /2,the 4H equilibrium would become impossible,no matter how large S is.In fact,if S is too large,bidders will be encouraged to take effort A .When E is extremely large,e.g.,E Ͼ0.6P ,the best strategy is to set S =0.The “*”in Table 2also indicates the cases that bid compensation is ineffec-Table pensation Impacts on a Three-Bidder GameEquilibriumE ;P =10%3H 2H +1A 1H +2A 3A E ϽP /3e.g.,E =2%S Ͻ14%*N/A N/N 14%ϽS P /3ϽE ϽP /2e.g.,E =4%2%ϽS Ͻ8%S Ͻ2%N/A 8%ϽS P /2ϽE Ͻ͑2/3͒P e.g.,E =5.5%N/AN/AS Ͻ3.5%*3.5%ϽS͑2/3͒P ϽEe.g.,E =7%N/A N/A N/A Always*Note:*denotes that zero compensation is the best strategy;and N/A =the respective equilibrium does not exist.D o w n l o a d e d f r o m a s c e l i b r a r y .o r g b y N A N J I N G U N I VE R S I T Y OF o n 01/06/14. C o p y r i g h t A S C E . F o r p e r s o n a l u s e o n l y ; a l l r i g h t s r e s e r v e d .tive.To conclude,in a four-bidder procurement,bid compensation is not effective when E is relatively small or large.Again,similar to the three-bidder game,when bid compensation becomes more effective,it does not mean that offering bid compensation is the best strategy,since more variables need to be considered.Further analysis shall be performed later.Nash Equilibrium of n -Bidder GameIt is desirable to generalize our model to the n -bidder game,al-though only very limited qualified bidders will be involved in most design–build or BOT procurements,since for other project delivery methods it is possible to have many bidders.Interested readers can follow the numerical illustrations for three-and four-bidder games to obtain the numerical solutions of n -bidder game.Here,only analytical equilibrium solutions will be solved.For “nA ”to be the Nash equilibrium,we must have P −E ϽS /n +P /n for bidder A not to deviate.In other words,condition (14)must be satisfiedS Ͼ͑n −1͒P −nE͑14͒Note that condition (14)can be rewritten as S Ͼn ͑P −E ͒−P ,which implies that it is not likely for nA to be the Nash equilib-rium when there are many bidders,unless E is very close to or larger than P .Similar to previous analysis,for “nH ”to be the equilibrium,we must have S /n +P /n −E Ͼ0for stability requirement,and condition (15)for excluding the possibility of cheap talk or nA equilibrium.The condition for the nH equilibrium can be reorga-nized as condition (16).S Ͻ͑n −1͒P −nE ͑15͒nE −P ϽS Ͻ͑n −1͒P −nE͑16͒Note that if E ϽP /n ,condition (16)will always be satisfied and nH will be a unique equilibrium even when S =0.In other words,nH will not be the Nash equilibrium when there are many bidders,unless E is extremely small,i.e.,E ϽP /n .For “aH +͑n −a ͒A ,where 2Ͻa Ͻn ”to be the equilibrium so-lution,we must have S /a +P /a −E Ͼ0for bidder H not to devi-ate,S /͑a +1͒+P /͑a +1͒−E Ͻ0for bidder A not to deviate,and condition (15).These requirements can be rewritten asaE −P ϽS Ͻmin ͓͑a +1͒E −P ,͑n −1͒P −nE ͔͑17͒Similarly,for “2H +͑n −2͒A ,”the stability requirements for bidder H and A are S /͑n −1͒ϽS /2+P /2−E and S /3+P /3−E Ͻ0,re-spectively,and thus the equilibrium condition can be written as ͓͑n −1͒/͑n −3͔͒͑2E −P ͒ϽS Ͻmin ͓3E −P ,͑n −1͒P −nE ͔͑18͒For the “1H +͑n −1͒A ”equilibrium,we must haveS Ͻmin ͕͓͑n −1͒/͑n −3͔͒͑2E −P ͒,͑n −1͒P −nE ͖͑19͒An interesting question is:“What conditions would warrant that the only possible equilibrium of the game is either “1H +͑n −1͒A ”or nA ,no matter how large S is?”A logical response to the question is:when equilibria “aH +͑n −a ͒A ,where a Ͼ2”and equilibrium 2H +͑n −2͒A are not possible solutions.Thus,a suf-ficient condition here is that for any S Ͼ͓͑n −1͒/͑n −3͔͒͑2E −P ͒,the “S Ͻ͑n −1͒P −nE ”is not satisfied.This can be guaranteed if we have͑n −1͒P −nE Ͻ͓͑n −1͒/͑n −3͔͒͑2E −P ͒→E Ͼ͓͑n −1͒/͑n +1͔͒P͑20͒Conditions (19)and (20)show that when E is greater than ͓͑n −1͒/͑n +1͔͒P ,the only possible equilibrium of the game is either 1H +͑n −1͒A or nA ,no matter how large S is.Two important practical implications can be drawn from this finding.First,when n is small in a design–build contract,it is not unusual that E will be greater than ͓͑n −1͒/͑n +1͔͒P ,and in that case,bid compensa-tion cannot help to promote higher effort.For example,for a three-bidder procurement,bid compensation will not be effective when E is greater than ͑2/4͒P .Second,when the number of bidders increases,bid compensation will become more effective since it will be more unlikely that E is greater than ͓͑n −1͒/͑n +1͔͒P .The two implications confirm the previous analyses of two-,three-,and four-bidder game.After the game equilibria and the effective range of bid compensation have been solved,the next important task is to develop the bid compensation strategy with respect to various procurement situations.Table pensation Impacts on a Four-Bidder GameEquilibriumE ;P =10%4H 3H +1A 2H +2A 1H +3A 4A E ϽP /4e.g.,E =2%S Ͻ22%*N/A N/A N/A S Ͼ22%P /4ϽE ϽP /3e.g.,E =3%2%ϽS Ͻ18%S Ͻ2%N/A N/A S Ͼ18%P /3ϽE ϽP /2e.g.,E =4%6%ϽS Ͻ14%2%ϽS Ͻ6%S Ͻ2%N/A S Ͼ14%P /2ϽE Ͻ͑3/5͒P e.g.,E =5.5%N/A 6.5%ϽS Ͻ8%3%ϽS Ͻ6.5%S Ͻ3%S Ͼ8%͑3/5͒P ϽE Ͻ͑3/4͒P e.g.,E =6.5%N/AN/AN/AS Ͻ4%*S Ͼ4%͑3/4͒P ϽEe.g.,E =8%N/A N/A N/A N/AAlways*Note:*denotes that zero compensation is the best strategy;and N/A=respective equilibrium does not exist.D o w n l o a d e d f r o m a s c e l i b r a r y .o r g b y N A N J I N G U N I VE R S I T Y OF o n 01/06/14. C o p y r i g h t A S C E . F o r p e r s o n a l u s e o n l y ; a l l r i g h t s r e s e r v e d .。

毕业设计外文文献翻译Graduation Design Foreign Literature Translation (700 words) Title: The Impact of Artificial Intelligence on the Job Market Introduction:Artificial Intelligence (AI) is a rapidly growing field that has the potential to revolutionize various industries and job markets. With advancements in technologies such as machine learning and natural language processing, AI has become capable of performing tasks traditionally done by humans. This has raised concerns about the future of jobs and the impact AI will have on the job market. This literature review aims to explore the implications of AI on employment and job opportunities.AI in the Workplace:AI technologies are increasingly being integrated into the workplace, with the aim of automating routine and repetitive tasks. For example, automated chatbots are being used to handle customer service queries, while machine learning algorithms are being employed to analyze large data sets. This has resulted in increased efficiency and productivity in many industries. However, it has also led to concerns about job displacement and unemployment.Job Displacement:The rise of AI has raised concerns about job displacement, as AI technologies are becoming increasingly capable of performing tasks previously done by humans. For example, automated machines can now perform complex surgeries with greaterprecision than human surgeons. This has led to fears that certain jobs will become obsolete, leading to unemployment for those who were previously employed in these industries.New Job Opportunities:While AI might potentially replace certain jobs, it also creates new job opportunities. As AI technologies continue to evolve, there will be a greater demand for individuals with technical skills in AI development and programming. Additionally, jobs that require human interaction and emotional intelligence, such as social work or counseling, may become even more in demand, as they cannot be easily automated.Job Transformation:Another potential impact of AI on the job market is job transformation. AI technologies can augment human abilities rather than replacing them entirely. For example, AI-powered tools can assist professionals in making decisions, augmenting their expertise and productivity. This may result in changes in job roles and the need for individuals to adapt their skills to work alongside AI technologies.Conclusion:The impact of AI on the job market is still being studied and debated. While AI has the potential to automate certain tasks and potentially lead to job displacement, it also presents opportunities for new jobs and job transformation. It is essential for individuals and organizations to adapt and acquire the necessary skills to navigate these changes in order to stay competitive in the evolvingjob market. Further research is needed to fully understand the implications of AI on employment and job opportunities.。

毕业设计外文翻译Graduation Design – English TranslationIntroductionThe graduation design is a crucial part of a student’s academic journey. It is a project that showcases the knowledge and skills that the student has acquired throughout their studies. The purpose of this translation is to provide an overview of the graduation design and explain its significance.Significance of the Graduation DesignThe graduation design serves as an opportunity for students to apply the theoretical knowledge they have gained in a practical manner. It allows them to put their skills into action and demonstrate their problem-solving abilities. Through the completion of the graduation design, students are equipped with the necessary tools to enter the workforce with confidence.Components of the Graduation DesignThe graduation design typically consists of several key components. Firstly, there is a written report that provides an in-depth analysis of the project. This report outlines the objectives, methodology, results, and conclusions of the graduation design. It also includes a literature review that discusses the existing research related to the topic.In addition to the written report, a presentation is also required aspart of the graduation design. This presentation allows students to communicate their findings to a larger audience. It is an opportunity for students to showcase their ability to effectively present complex information in a clear and concise manner.Furthermore, the graduation design often involves a practical component. This can range from designing and building a prototype to conducting experiments or surveys. The practical component allows students to apply their engineering skills and test their theories in a real-world setting.Evaluation of the Graduation DesignThe graduation design is evaluated based on several criteria. The written report is assessed for its clarity, organization, and depth of analysis. The presentation is evaluated for the student’s ability to effectively communicate their ideas and engage the audience. The practical component is assessed based on the quality and accuracy of the work completed.ConclusionIn conclusion, the graduation design is a significant project that allows students to apply their knowledge and skills in a practical manner. It consists of a written report, a presentation, and a practical component. The completion of the graduation design prepares students for their future careers by equipping them with the necessary tools and abilities.。

毕业设计（论文）外文文献原文及译文Chapter 11. Cipher Techniques11.1 ProblemsThe use of a cipher without consideration of the environment in which it is to be used may not provide the security that the user expects. Three examples will make this point clear.11.1.1 Precomputing the Possible MessagesSimmons discusses the use of a "forward search" to decipher messages enciphered for confidentiality using a public key cryptosystem [923]. His approach is to focus on the entropy (uncertainty) in the message. To use an example from Section 10.1(page 246), Cathy knows that Alice will send one of two messages—BUY or SELL—to Bob. The uncertainty is which one Alice will send. So Cathy enciphers both messages with Bob's public key. When Alice sends the message, Bob intercepts it and compares the ciphertext with the two he computed. From this, he knows which message Alice sent.Simmons' point is that if the plaintext corresponding to intercepted ciphertext is drawn from a (relatively) small set of possible plaintexts, the cryptanalyst can encipher the set of possible plaintexts and simply search that set for the intercepted ciphertext. Simmons demonstrates that the size of the set of possible plaintexts may not be obvious. As an example, he uses digitized sound. The initial calculations suggest that the number of possible plaintexts for each block is 232. Using forward search on such a set is clearly impractical, but after some analysis of the redundancy in human speech, Simmons reduces the number of potential plaintexts to about 100,000. This number is small enough so that forward searches become a threat.This attack is similar to attacks to derive the cryptographic key of symmetric ciphers based on chosen plaintext (see, for example, Hellman's time-memory tradeoff attack [465]). However, Simmons' attack is for public key cryptosystems and does not reveal the private key. It only reveals the plaintext message.11.1.2 Misordered BlocksDenning [269] points out that in certain cases, parts of a ciphertext message can be deleted, replayed, or reordered.11.1.3 Statistical RegularitiesThe independence of parts of ciphertext can give information relating to the structure of the enciphered message, even if the message itself is unintelligible. The regularity arises because each part is enciphered separately, so the same plaintext always produces the same ciphertext. This type of encipherment is called code book mode, because each part is effectively looked up in a list of plaintext-ciphertext pairs.11.1.4 SummaryDespite the use of sophisticated cryptosystems and random keys, cipher systems may provide inadequate security if not used carefully. The protocols directing how these cipher systems are used, and the ancillary information that the protocols add to messages and sessions, overcome these problems. This emphasizes that ciphers and codes are not enough. The methods, or protocols, for their use also affect the security of systems.11.2 Stream and Block CiphersSome ciphers divide a message into a sequence of parts, or blocks, and encipher each block with the same key.Definition 11–1. Let E be an encipherment algorithm, and let Ek(b) bethe encipherment of message b with key k. Let a message m = b1b2…, whereeach biis of a fixed length. Then a block cipher is a cipher for whichE k (m) = Ek(b1)Ek(b2) ….Other ciphers use a nonrepeating stream of key elements to encipher characters of a message.Definition 11–2. Let E be an encipherment algorithm, and let Ek(b) bethe encipherment of message b with key k. Let a message m = b1b2…, whereeach bi is of a fixed length, and let k = k1k2…. Then a stream cipheris a cipher for which Ek (m) = Ek1(b1)Ek2(b2) ….If the key stream k of a stream cipher repeats itself, it is a periodic cipher.11.2.1 Stream CiphersThe one-time pad is a cipher that can be proven secure (see Section 9.2.2.2, "One-Time Pad"). Bit-oriented ciphers implement the one-time pad by exclusive-oring each bit of the key with one bit of the message. For example, if the message is 00101 and the key is 10010, the ciphertext is01||00||10||01||10 or 10111. But how can one generate a random, infinitely long key?11.2.1.1 Synchronous Stream CiphersTo simulate a random, infinitely long key, synchronous stream ciphers generate bits from a source other than the message itself. The simplest such cipher extracts bits from a register to use as the key. The contents of the register change on the basis of the current contents of the register.Definition 11–3. An n-stage linear feedback shift register (LFSR)consists of an n-bit register r = r0…rn–1and an n-bit tap sequence t =t 0…tn–1. To obtain a key bit, ris used, the register is shifted one bitto the right, and the new bit r0t0⊕…⊕r n–1t n–1 is inserted.The LFSR method is an attempt to simulate a one-time pad by generating a long key sequence from a little information. As with any such attempt, if the key is shorter than the message, breaking part of the ciphertext gives the cryptanalyst information about other parts of the ciphertext. For an LFSR, a known plaintext attack can reveal parts of the key sequence. If the known plaintext is of length 2n, the tap sequence for an n-stage LFSR can be determined completely.Nonlinear feedback shift registers do not use tap sequences; instead, the new bit is any function of the current register bits.Definition 11–4. An n-stage nonlinear feedback shift register (NLFSR)consists of an n-bit register r = r0…rn–1. Whenever a key bit is required,ris used, the register is shifted one bit to the right, and the new bitis set to f(r0…rn–1), where f is any function of n inputs.NLFSRs are not common because there is no body of theory about how to build NLFSRs with long periods. By contrast, it is known how to design n-stage LFSRs with a period of 2n– 1, and that period is maximal.A second technique for eliminating linearity is called output feedback mode. Let E be an encipherment function. Define k as a cryptographic key,(r) and define r as a register. To obtain a bit for the key, compute Ekand put that value into the register. The rightmost bit of the result is exclusive-or'ed with one bit of the message. The process is repeated until the message is enciphered. The key k and the initial value in r are the keys for this method. This method differs from the NLFSR in that the register is never shifted. It is repeatedly enciphered.A variant of output feedback mode is called the counter method. Instead of using a register r, simply use a counter that is incremented for every encipherment. The initial value of the counter replaces r as part of the key. This method enables one to generate the ith bit of the key without generating the bits 0…i – 1. If the initial counter value is i, set. In output feedback mode, one must generate all the register to i + ithe preceding key bits.11.2.1.2 Self-Synchronous Stream CiphersSelf-synchronous ciphers obtain the key from the message itself. The simplest self-synchronous cipher is called an autokey cipher and uses the message itself for the key.The problem with this cipher is the selection of the key. Unlike a one-time pad, any statistical regularities in the plaintext show up in the key. For example, the last two letters of the ciphertext associated with the plaintext word THE are always AL, because H is enciphered with the key letter T and E is enciphered with the key letter H. Furthermore, if theanalyst can guess any letter of the plaintext, she can determine all successive plaintext letters.An alternative is to use the ciphertext as the key stream. A good cipher will produce pseudorandom ciphertext, which approximates a randomone-time pad better than a message with nonrandom characteristics (such as a meaningful English sentence).This type of autokey cipher is weak, because plaintext can be deduced from the ciphertext. For example, consider the first two characters of the ciphertext, QX. The X is the ciphertext resulting from enciphering some letter with the key Q. Deciphering, the unknown letter is H. Continuing in this fashion, the analyst can reconstruct all of the plaintext except for the first letter.A variant of the autokey method, cipher feedback mode, uses a shift register. Let E be an encipherment function. Define k as a cryptographic(r). The key and r as a register. To obtain a bit for the key, compute Ek rightmost bit of the result is exclusive-or'ed with one bit of the message, and the other bits of the result are discarded. The resulting ciphertext is fed back into the leftmost bit of the register, which is right shifted one bit. (See Figure 11-1.)Figure 11-1. Diagram of cipher feedback mode. The register r is enciphered with key k and algorithm E. The rightmost bit of the result is exclusive-or'ed with one bit of the plaintext m i to produce the ciphertext bit c i. The register r is right shifted one bit, and c i is fed back into the leftmost bit of r.Cipher feedback mode has a self-healing property. If a bit is corrupted in transmission of the ciphertext, the next n bits will be deciphered incorrectly. But after n uncorrupted bits have been received, the shift register will be reinitialized to the value used for encipherment and the ciphertext will decipher properly from that point on.As in the counter method, one can decipher parts of messages enciphered in cipher feedback mode without deciphering the entire message. Let the shift register contain n bits. The analyst obtains the previous n bits of ciphertext. This is the value in the shift register before the bit under consideration was enciphered. The decipherment can then continue from that bit on.11.2.2 Block CiphersBlock ciphers encipher and decipher multiple bits at once, rather than one bit at a time. For this reason, software implementations of block ciphers run faster than software implementations of stream ciphers. Errors in transmitting one block generally do not affect other blocks, but as each block is enciphered independently, using the same key, identical plaintext blocks produce identical ciphertext blocks. This allows the analyst to search for data by determining what the encipherment of a specific plaintext block is. For example, if the word INCOME is enciphered as one block, all occurrences of the word produce the same ciphertext.To prevent this type of attack, some information related to the block's position is inserted into the plaintext block before it is enciphered. The information can be bits from the preceding ciphertext block [343] or a sequence number [561]. The disadvantage is that the effective block size is reduced, because fewer message bits are present in a block.Cipher block chaining does not require the extra information to occupy bit spaces, so every bit in the block is part of the message. Before a plaintext block is enciphered, that block is exclusive-or'ed with the preceding ciphertext block. In addition to the key, this technique requires an initialization vector with which to exclusive-or the initial plaintext block. Taking Ekto be the encipherment algorithm with key k, and I to be the initialization vector, the cipher block chaining technique isc 0 = Ek(m⊕I)c i = Ek(mi⊕ci–1) for i > 011.2.2.1 Multiple EncryptionOther approaches involve multiple encryption. Using two keys k and k' toencipher a message as c = Ek' (Ek(m)) looks attractive because it has aneffective key length of 2n, whereas the keys to E are of length n. However, Merkle and Hellman [700] have shown that this encryption technique can be broken using 2n+1encryptions, rather than the expected 22n(see Exercise 3).Using three encipherments improves the strength of the cipher. There are several ways to do this. Tuchman [1006] suggested using two keys k and k':c = Ek (Dk'(Ek(m)))This mode, called Encrypt-Decrypt-Encrypt (EDE) mode, collapses to a single encipherment when k = k'. The DES in EDE mode is widely used in the financial community and is a standard (ANSI X9.17 and ISO 8732). It is not vulnerable to the attack outlined earlier. However, it is vulnerable to a chosen plaintext and a known plaintext attack. If b is the block size in bits, and n is the key length, the chosen plaintext attacktakes O(2n) time, O(2n) space, and requires 2n chosen plaintexts. The known plaintext attack requires p known plaintexts, and takes O(2n+b/p) time and O(p) memory.A second version of triple encipherment is the triple encryption mode [700]. In this mode, three keys are used in a chain of encipherments.c = Ek (Ek'(Ek''(m)))The best attack against this scheme is similar to the attack on double encipherment, but requires O(22n) time and O(2n) memory. If the key length is 56 bits, this attack is computationally infeasible.11.3 Networks and CryptographyBefore we discuss Internet protocols, a review of the relevant properties of networks is in order. The ISO/OSI model [990] provides an abstract representation of networks suitable for our purposes. Recall that the ISO/OSI model is composed of a series of layers (see Figure 11-2). Each host, conceptually, has a principal at each layer that communicates with a peer on other hosts. These principals communicate with principals at the same layer on other hosts. Layer 1, 2, and 3 principals interact only with similar principals at neighboring (directly connected) hosts. Principals at layers 4, 5, 6, and 7 interact only with similar principals at the other end of the communication. (For convenience, "host" refers to the appropriate principal in the following discussion.)Figure 11-2. The ISO/OSI model. The dashed arrows indicate peer-to-peer communication. For example, the transport layers are communicating with each other. The solid arrows indicate the actual flow of bits. For example, the transport layer invokes network layer routines on the local host, which invoke data link layer routines, which put the bits onto the network. The physical layer passes the bits to the next "hop," or host, on the path. When the message reaches the destination, it is passed up to the appropriatelevel.Each host in the network is connected to some set of other hosts. They exchange messages with those hosts. If host nob wants to send a message to host windsor, nob determines which of its immediate neighbors is closest to windsor (using an appropriate routing protocol) and forwards the message to it. That host, baton, determines which of its neighbors is closest to windsor and forwards the message to it. This process continues until a host, sunapee, receives the message and determines that windsor is an immediate neighbor. The message is forwarded to windsor, its endpoint.Definition 11–5. Let hosts C0, …, Cnbe such that Ciand Ci+1are directlyconnected, for 0 i < n. A communications protocol that has C0 and Cnasits endpoints is called an end-to-end protocol. A communications protocolthat has Cj and Cj+1as its endpoints is called a link protocol.The difference between an end-to-end protocol and a link protocol is that the intermediate hosts play no part in an end-to-end protocol other than forwarding messages. On the other hand, a link protocol describes how each pair of intermediate hosts processes each message.The protocols involved can be cryptographic protocols. If the cryptographic processing is done only at the source and at the destination, the protocol is an end-to-end protocol. If cryptographic processing occurs at each host along the path from source to destination, the protocolis a link protocol. When encryption is used with either protocol, we use the terms end-to-end encryption and link encryption, respectively.In link encryption, each host shares a cryptographic key with its neighbor. (If public key cryptography is used, each host has its neighbor's public key. Link encryption based on public keys is rare.) The keys may be set on a per-host basis or a per-host-pair basis. Consider a network with four hosts called windsor, stripe, facer, and seaview. Each host is directly connected to the other three. With keys distributed on a per-host basis, each host has its own key, making four keys in all. Each host has the keys for the other three neighbors, as well as its own. All hosts use the same key to communicate with windsor. With keys distributed on a per-host-pair basis, each host has one key per possible connection, making six keys in all. Unlike the per-host situation, in the per-host-pair case, each host uses a different key to communicate with windsor. The message is deciphered at each intermediate host, reenciphered for the next hop, and forwarded. Attackers monitoring the network medium will not be able to read the messages, but attackers at the intermediate hosts will be able to do so.In end-to-end encryption, each host shares a cryptographic key with each destination. (Again, if the encryption is based on public key cryptography, each host has—or can obtain—the public key of each destination.) As with link encryption, the keys may be selected on a per-host or per-host-pair basis. The sending host enciphers the message and forwards it to the first intermediate host. The intermediate host forwards it to the next host, and the process continues until the message reaches its destination. The destination host then deciphers it. The message is enciphered throughout its journey. Neither attackers monitoring the network nor attackers on the intermediate hosts can read the message. However, attackers can read the routing information used to forward the message.These differences affect a form of cryptanalysis known as traffic analysis.A cryptanalyst can sometimes deduce information not from the content ofthe message but from the sender and recipient. For example, during the Allied invasion of Normandy in World War II, the Germans deduced which vessels were the command ships by observing which ships were sending and receiving the most signals. The content of the signals was not relevant; their source and destination were. Similar deductions can reveal information in the electronic world.第十一章密码技术11．1问题在没有考虑加密所要运行的环境时，加密的使用可能不能提供用户所期待的安全。