陈聪 英文翻译文献初稿
- 格式:doc
- 大小:831.00 KB
- 文档页数:13
中英文对照外文翻译文献(文档含英文原文和中文翻译)Elastic image matchingAbstractOne fundamental problem in image recognition is to establish the resemblance of two images. This can be done by searching the best pixel to pixel mapping taking into account monotonicity and continuity constraints. We show that this problem is NP-complete by reduction from 3-SAT, thus giving evidence that the known exponential time algorithms are justified, but approximation algorithms or simplifications are necessary.Keywords: Elastic image matching; Two-dimensional warping; NP-completeness 1. IntroductionIn image recognition, a common problem is to match two given images, e.g. when comparing an observed image to given references. In that pro-cess, elastic image matching, two-dimensional (2D-)warping (Uchida and Sakoe, 1998) or similar types of invariant methods (Keysers et al., 2000) can be used. For this purpose, we can define cost functions depending on the distortion introduced in the matching andsearch for the best matching with respect to a given cost function. In this paper, we show that it is an algorithmically hard problem to decide whether a matching between two images exists with costs below a given threshold. We show that the problem image matching is NP-complete by means of a reduction from 3-SAT, which is a common method of demonstrating a problem to be intrinsically hard (Garey and Johnson, 1979). This result shows the inherent computational difficulties in this type of image comparison, while interestingly the same problem is solvable for 1D sequences in polynomial time, e.g. the dynamic time warping problem in speech recognition (see e.g. Ney et al., 1992). This has the following implications: researchers who are interested in an exact solution to this problem cannot hope to find a polynomial time algorithm, unless P=NP. Furthermore, one can conclude that exponential time algorithms as presented and extended by Uchida and Sakoe (1998, 1999a,b, 2000a,b) may be justified for some image matching applications. On the other hand this shows that those interested in faster algorithms––e.g. for pattern recognition purposes––are right in searching for sub-optimal solutions. One method to do this is the restriction to local optimizations or linear approximations of global transformations as presented in (Keysers et al., 2000). Another possibility is to use heuristic approaches like simulated annealing or genetic algorithms to find an approximate solution. Furthermore, methods like beam search are promising candidates, as these are used successfully in speech recognition, although linguistic decoding is also an NP-complete problem (Casacuberta and de la Higuera, 1999). 2. Image matchingAmong the varieties of matching algorithms,we choose the one presented by Uchida and Sakoe(1998) as a starting point to formalize the problem image matching. Let the images be given as(without loss of generality) square grids of size M×M with gray values (respectively node labels)from a finite alphabet &={1,…,G}. To define thed:&×&→N , problem, two distance functions are needed,one acting on gray valuesg measuring the match in gray values, and one acting on displacement differences :Z×Z→N , measuring the distortion introduced by t he matching. For these distance ddfunctions we assume that they are monotonous functions (computable in polynomial time) of the commonly used squared Euclid-ean distance, i.ed g (g 1,g 2)=f 1(||g 1-g 2||²)and d d (z)=f 2(||z||²) monotonously increasing. Now we call the following optimization problem the image matching problem (let µ={1,…M} ).Instance: The pair( A ; B ) of two images A and B of size M×M .Solution: A mapping function f :µ×µ→µ×µ.Measure:c (A,B,f )=),(),(j i f ij g B Ad ∑μμ⨯∈),(j i+∑⨯-⋅⋅⋅∈+-+μ}1,{1,),()))0,1(),(())0,1(),(((M j i d j i f j i f dμ⨯-⋅⋅⋅∈}1,{1,),(M j i +∑⋅⋅⋅⨯∈+-+1}-M ,{1,),()))1,0(),(())1,0(),(((μj i d j i f j i f d 1}-M ,{1,),(⋅⋅⋅⨯∈μj iGoal:min f c(A,B,f).In other words, the problem is to find the mapping from A onto B that minimizes the distance between the mapped gray values together with a measure for the distortion introduced by the mapping. Here, the distortion is measured by the deviation from the identity mapping in the two dimensions. The identity mapping fulfills f(i,j)=(i,j),and therefore ,f((i,j)+(x,y))=f(i,j)+(x,y)The corresponding decision problem is fixed by the followingQuestion:Given an instance of image matching and a cost c′, does there exist a ma pping f such that c(A,B,f)≤c′?In the definition of the problem some care must be taken concerning the distance functions. For example, if either one of the distance functions is a constant function, the problem is clearly in P (for d g constant, the minimum is given by the identity mapping and for d d constant, the minimum can be determined by sorting all possible matching for each pixel by gray value cost and mapping to one of the pixels with minimum cost). But these special cases are not those we are concerned with in image matching in general.We choose the matching problem of Uchida and Sakoe (1998) to complete the definition of the problem. Here, the mapping functions are restricted by continuity and monotonicity constraints: the deviations from the identity mapping may locally be at most one pixel (i.e. limited to the eight-neighborhood with squared Euclidean distance less than or equal to 2). This can be formalized in this approach bychoosing the functions f1,f2as e.g.f 1=id,f2(x)=step(x):=⎩⎨⎧.2,)10(,2,0>≤⋅xGxMM3. Reduction from 3-SAT3-SAT is a very well-known NP-complete problem (Garey and Johnson, 1979), where 3-SAT is defined as follows:Instance: Collection of clauses C={C1,···,CK} on a set of variables X={x1, (x)L}such that each ckconsists of 3 literals for k=1,···K .Each literal is a variable or the negation of a variable.Question:Is there a truth assignment for X which satisfies each clause ck, k=1,···K ?The dependency graph D(Ф)corresponding to an instance Ф of 3-SAT is defined to be the bipartite graph whose independent sets are formed by the set of clauses Cand the set of variables X .Two vert ices ck and x1are adjacent iff ckinvolvesx 1or-xL.Given any 3-SAT formula U, we show how to construct in polynomial time anequivalent image matching problem l(Ф)=(A(Ф),B(Ф)); . The two images of l (Ф)are similar according to the cost function (i.e.f:c(A(Ф),B(Ф),f)≤0) iff the formulaФ is satisfiable. We perform the reduction from 3-SAT using the following steps:• From the formula Ф we construct the dependency graph D(Ф).• The dependency graph D(Ф)is drawn in the plane.• The drawing of D(Ф)is refined to depict the logical behaviour of Ф , yielding two images(A(Ф),B(Ф)).For this, we use three types of components: one component to represent variables of Ф , one component to represent clauses of Ф, and components which act as interfaces between the former two types. Before we give the formal reduction, we introduce these components.3.1. Basic componentsFor the reduction from 3-SAT we need five components from which we will construct the in-stances for image matching , given a Boolean formula in 3-DNF,respectively its graph. The five components are the building blocks needed for the graph drawing and will be introduced in the following, namely the representations of connectors,crossings, variables, and clauses. The connectors represent the edges and have two varieties, straight connectors and corner connectors. Each of the components consists of two parts, one for image A and one for image B , where blank pixels are considered to be of the‘background ’color.We will depict possible mappings in the following using arrows indicating the direction of displacement (where displacements within the eight-neighborhood of a pixel are the only cases considered). Blank squares represent mapping to the respective counterpart in the second image.For example, the following displacements of neighboring pixels can be used with zero cost:On the other hand, the following displacements result in costs greater than zero:Fig. 1 shows the first component, the straight connector component, which consists of a line of two different interchanging colors,here denoted by the two symbols◇and□. Given that the outside pixels are mapped to their respe ctive counterparts and the connector is continued infinitely, there are two possible ways in which the colored pixels can be mapped, namely to the left (i.e. f(2,j)=(2,j-1)) or to the right (i.e. f(2,j)=(2,j+1)),where the background pixels have different possibilities for the mapping, not influencing the main property of the connector. This property, which justifies the name ‘connector ’, is the following: It is not possible to find a mapping, which yields zero cost where the relative displacements of the connector pixels are not equal, i.e. one always has f(2,j)-(2,j)=f(2,j')-(2,j'),which can easily be observed by induction over j'.That is, given an initial displacement of one pixel (which will be ±1 in this context), the remaining end of the connector has the same displacement if overall costs of the mapping are zero. Given this property and the direction of a connector, which we define to be directed from variable to clause, wecan define the state of the connector as carrying the‘true’truth value, if the displacement is 1 pixel in the direction of the connector and as carrying the‘false’ truth value, if the displacement is -1 pixel in the direction of the connector. This property then ensures that the truth value transmitted by the connector cannot change at mappings of zero cost.Image A image Bmapping 1 mapping 2Fig. 1. The straight connector component with two possible zero cost mappings.For drawing of arbitrary graphs, clearly one also needs corners,which are represented in Fig. 2.By considering all possible displacements which guarantee overall cost zero, one can observe that the corner component also ensures the basic connector property. For example, consider the first depicted mapping, which has zero cost. On the other hand, the second mapping shows, that it is not possible to construct a zero cost mapping with both connectors‘leaving’the component. In that case, the pixel at the position marked‘? ’either has a conflict (that i s, introduces a cost greater than zero in the criterion function because of mapping mismatch) with the pixel above or to the right of it,if the same color is to be met and otherwise, a cost in the gray value mismatch term is introduced.image A image Bmapping 1 mapping 2Fig. 2. The corner connector component and two example mappings.Fig. 3 shows the variable component, in this case with two positive (to the left) and one negated output (to the right) leaving the component as connectors. Here, a fourth color is used, denoted by ·.This component has two possible mappings for thecolored pixels with zero cost, which map the vertical component of the source image to the left or the right vertical component in the target image, respectively. (In both cases the second vertical element in the target image is not a target of the mapping.) This ensures±1 pixel relative displacements at the entry to the connectors. This property again can be deducted by regarding all possible mappings of the two images.The property that follows (which is necessary for the use as variable) is that all zero cost mappings ensure that all positive connectors carry the same truth value,which is the opposite of the truth value for all the negated connectors. It is easy to see from this example how variable components for arbitrary numbers of positive and negated outputs can be constructed.image A image BImage C image DFig. 3. The variable component with two positive and one negated output and two possible mappings (for true and false truth value).Fig. 4 shows the most complex of the components, the clause component. This component consists of two parts. The first part is the horizontal connector with a 'bend' in it to the right.This part has the property that cost zero mappings are possible for all truth values of x and y with the exception of two 'false' values. This two input disjunction,can be extended to a three input dis-junction using the part in the lower left. If the z connector carries a 'false' truth value, this part can only be mapped one pixel downwards at zero cost.In that case the junction pixel (the fourth pixel in the third row) cannot be mapped upwards at zero cost and the 'two input clause' behaves as de-scribed above. On the other hand, if the z connector carries a 'true' truth value, this part can only be mapped one pixel upwards at zero cost,and the junction pixel can be mapped upwards,thus allowing both x and y to carry a 'false' truth value in a zero cost mapping. Thus there exists a zero cost mapping of the clause component iff at least one of the input connectors carries a truth value.image Aimage B mapping 1(true,true,false)mapping 2 (false,false,true,)Fig. 4. The clause component with three incoming connectors x, y , z and zero cost mappings forthe two cases(true,true,false)and (false, false, true).The described components are already sufficient to prove NP-completeness by reduction from planar 3-SAT (which is an NP-complete sub-problem of 3-SAT where the additional constraints on the instances is that the dependency graph is planar),but in order to derive a reduction from 3-SAT, we also include the possibility of crossing connectors.Fig. 5 shows the connector crossing, whose basic property is to allow zero cost mappings if the truth–values are consistently propagated. This is assured by a color change of the vertical connector and a 'flexible' middle part, which can be mapped to four different positions depending on the truth value distribution.image Aimage Bzero cost mappingFig. 5. The connector crossing component and one zero cost mapping.3.2. ReductionUsing the previously introduced components, we can now perform the reduction from 3-SAT to image matching .Proof of the claim that the image matching problem is NP-complete:Clearly, the image matching problem is in NP since, given a mapping f and two images A and B ,the computation of c(A,B,f)can be done in polynomial time. To prove NP-hardness, we construct a reduction from the 3-SAT problem. Given an instance of 3-SAT we construct two images A and B , for which a mapping of cost zero exists iff all the clauses can be satisfied.Given the dependency graph D ,we construct an embedding of the graph into a 2D pixel grid, placing the vertices on a large enough distance from each other (say100(K+L)² ).This can be done using well-known methods from graph drawing (see e.g.di Battista et al.,1999).From this image of the graph D we construct the two images A and B , using the components described above.Each vertex belonging to a variable is replaced with the respective parts of the variable component, having a number of leaving connectors equal to the number of incident edges under consideration of the positive or negative use in the respective clause. Each vertex belonging to a clause is replaced by the respective clause component,and each crossing of edges is replaced by the respective crossing component. Finally, all the edges are replaced with connectors and corner connectors, and the remaining pixels inside the rectangular hull of the construction are set to the background gray value. Clearly, the placement of the components can be done in such a way that all the components are at a large enough distance from each other, where the background pixels act as an 'insulation' against mapping of pixels, which do not belong to the same component. It can be easily seen, that the size of the constructed images is polynomial with respect to the number of vertices and edges of D and thus polynomial in the size of the instance of 3-SAT, at most in the order (K+L)².Furthermore, it can obviously be constructed in polynomial time, as the corresponding graph drawing algorithms are polynomial.Let there exist a truth assignment to the variables x1,…,xL, which satisfies allthe clauses c1,…,cK. We construct a mapping f , that satisfies c(f,A,B)=0 asfollows.For all pixels (i, j ) belonging to variable component l with A(i,j)not of the background color,set f(i,j)=(i,j-1)if xlis assigned the truth value 'true' , set f(i,j)=(i,j+1), otherwise. For the remaining pixels of the variable component set A(i,j)=B(i,j),if f(i,j)=(i,j), otherwise choose f(i,j)from{(i,j+1),(i+1,j+1),(i-1,j+1)}for xl'false' respectively from {(i,j-1),(i+1,j-1),(i-1,j-1)}for xl'true ',such that A(i,j)=B(f(i,j)). This assignment is always possible and has zero cost, as can be easily verified.For the pixels(i,j)belonging to (corner) connector components,the mapping function can only be extended in one way without the introduction of nonzero cost,starting from the connection with the variable component. This is ensured by thebasic connector property. By choosing f (i ,j )=(i,j )for all pixels of background color, we obtain a valid extension for the connectors. For the connector crossing components the extension is straight forward, although here ––as in the variable mapping ––some care must be taken with the assign ment of the background value pixels, but a zero cost assignment is always possible using the same scheme as presented for the variable mapping.It remains to be shown that the clause components can be mapped at zero cost, if at least one of the input connectors x , y , z carries a ' true' truth value.For a proof we regard alls even possibilities and construct a mapping for each case. In thedescription of the clause component it was already argued that this is possible,and due to space limitations we omit the formalization of the argument here.Finally, for all the pixels (i ,j )not belonging to any of the components, we set f (i ,j )=(i ,j )thus arriving at a mapping function which has c (f ,A ,B )=0。
基金管理外文文献翻译(含:英文原文及中文译文)文献出处:英文原文Is Money Really “Smart”? New Evidence on the Relation Between Mutual Fund Flows, Manager Behavior, and Performance PersistenceRuss WermersMutual fund returns strongly persist over multi-year periods—that is the central finding of this paper. Further, consumer and fund manager behavior both play a large role in explaining these longterm continuation patterns—consumers invest heavily in last-year’s winning funds, and managers of these winners invest these inflows in momentum stocks to continue to outperform other funds for at least two years following the ranking year. By contrast, managers of losing funds appear reluctant to sell their losing stocks to finance the purchase of new momentum stocks, perhaps due to a disposition effect. Thus, momentum continues to separate winning from losing managers for a much longer period than indicated by prior studies.Even more surprising is that persistence in winning fund returns is not entirely explained by momentum—we find strong evidence that flow-related buying, especially among growth-oriented funds, pushes up stock prices. Specifically, stocks that winning funds purchase in responseto persistent flows have returns that beat their size, book-to-market, and momentum benchmarks by two to three percent per year over a four-year period. Cross-sectional regressions indicate that these abnormal returns are strongly related to fund inflows, but not to the past performance of the funds—thus, casting some doubt on prior findings of persistent manager talent in picking stocks. Finally, at the style-adjusted net returns level, we find no persistence, consistent with the results of prior studies. On balance, we confirm that money is smart in chasing winning managers, but that a “copycat” s trategy of mimicking winning fund stock trades to take advantage of flow-related returns appears to be the smartest strategy.Eighty-eight million individuals now hold investments in U.S. mutual funds, with over 90 percent of the value of these investments being held in actively managed funds. Further, actively managed equity funds gain the lion’s share of consumer inflows—flows of net new money to equity funds (inflows minus outflows) totalled $309 billion in 2000, pushing the aggregate value of investments held by these funds to almost $4 trillion at year-end 2000. While the majority of individual investors apparently believe in the virtues of active management in general, many appear to hold even stronger beliefs concerning the talents of subgroups of fund managers—they appear to believe that, among the field of active managers, superior managers exist that can “beat the market” for long periods of time. In particular, Morningstar and Lipper compete vigorouslyfor the attention of these true believers by providing regular fund performance rankings, while popular publications such as Money Magazine routinely profile “star” mutual fund managers. In addition, investor dollars, while not very quick to abandon past losing funds, aggressively chase past winners (see, for example, Sirri and Tufano (1998)).Are these “performance-chasers” wasting their money and time, or is money “smart”? Several past papers have attempted to tackle this issue, with somewhat differing results. For example, Grinblatt and Titman (1989a, 1993) find that some mutual fund managers are able to consistently earn positive abnormal returns before fees and expenses, while Brown and Goetzmann (1995; BG) attribute persistence to inferior funds consistently earning negative abnormal returns. Gruber (1996) and Zheng (1999) examine persistence from the viewpoint of consumer money flows to funds, and find that money is “smart”—that is, money flows disproportionately to funds exhibiting superior future returns. However, the exact source of the smart money effect remains a puzzle—does smart money capture manager talent or, perhaps, simply momentum in stock returns?1 More recently, Carhart (1997) examines the persistence in net returns of U.S. mutual funds, controlling for the continuation attributable to priced equity styles (see, for example, Fama and French (1992, 1993, 1996), Jegadeesh and Titman (1993), Daniel andTitman (1997), and Moskowitz and Grinblatt (1999)). Carhart finds little evidence of superior funds that consistently outperform their style benchmarks—specifically, Carhart finds that funds in the highest net return decile (of the CRSP mutual fund database) during one year beat funds in the lowest decile by about 3.5 percent during the following year, almost all due to the one-year momentum effect documented by Jegadeesh and Titman (1993) and to the unexplained poor performance of funds in the lowest prior-year return decile.2 Thus, Carhart (1997) suggests that money is not very smart. Recent studies find somewhat more promising results than Carhart (1997). Chen, Jegadeesh, and Wermers (1999) find that stocks most actively purchased by funds beat those most actively sold by over two percent per year, while Bollen and Busse (2002) find evidence of persistence in quarterly fund performance. Wermers (2000) finds that, although the average style-adjusted net return of the average mutual fund is negative (consistent with Carhart’s study), high-turnover funds exhibit a net return that is significantly higher than low-turnover funds. In addition, these highturnover funds pick stocks well enough to cover their costs, even adjusting for style-based returns. This finding suggests that fund managers who trade more frequently have persistent stockpicking talents. All of these papers provide a more favorable view of the average actively managed fund than prior research, although none focus on the persistence issue with portfolio holdings data.This study examines the mutual fund persistence issue using both portfolio holdings and net returns data, allowing a more complete analysis of the issue than past studies. With these data, we develop measures that allow us to examine the roles of consumer inflows and fund manager behavior in the persistence of fund performance. Specifically, we decompose the returns and costs of each mutual fund into that attributable to (1) manager skills in picking stocks having returns that beat their style-based benchmarks (selectivity), (2) returns that are attributable to the characteristics (or style) of stockholdings, (3) trading costs, (4) expenses, and (5) costs that are associated with the daily liquidity offered by funds to the investing public (as documented by Edelen (1999)). Further, we construct holdings-based measures of momentum-investing behavior by the fund managers. Together, these measures allow an examination of the relation between flows, manager behavior, and performance persistence.In related work, Sirri and Tufano (1998) find that consumer flows react about as strongly to one-year lagged net returns as to any other fund characteristic. In addition, the model of Lynch and Musto (2002) predicts that performance repeats among winners (but not losers), while the model of Berk and Green (2002) predicts no persistence (or weak persistence) as consumer flows compete away any managerial talent. Consistent with Sirri and Tufano (1998), and to test the competing viewpoints of Lynchand Musto (2002) and Berk and Green (2002), we sort funds on their one-year lagged net returns for most tests in this paper. While other ways of sorting funds are attempted.DataWe merge two major mutual fund databases for our analysis of mutual fund performance. Details on the process of merging these databases is available in Wermers (2000). The first database contains quarterly portfolio holdings for all U.S. equity mutual funds existing at any time between January 1, 1975 and December 31, 1994; these data were purchased from Thomson/CDA of Rockville, Maryland. The CDA dataset lists the equity portion of each fund’s holdings (i.e., the shareholdings of each stock held by that fund) along with a listing of the total net assets under management and the self-declared investment objective at the beginning of each calendar quarter. CDA began collecting investment-objective information on June 30, 1980; we supplement these data with hand-collected investment objective data from January 1, 1975.The second mutual fund database is available from the Center for Research in Security Prices (CRSP) and is used by Carhart (1997). The CRSP database contains monthly data on net returns, as well as annual data on portfolio turnover and expense ratios for all mutual funds existing at any time between January 1, 1962 and December 31, 2000. Further details on the CRSP mutual fund database are available from CRSP.These two databases were merged to provide a complete record of the stockholdings of a given fund, along with the fund’s turnover, expense ratio, net returns, investment objective, and total net assets under management during the entire time that the fund existed during our the period of 1975 to 1994 (inclusive).5 Finally, stock prices and returns were obtained from the CRSP stock files.Performance-Decomposition Methodology In this study, we use several measures that quantify the ability of a mutual fund manager to choose stocks, as well as to generate superior performance at the net return level. These measures, in general, decompose the return of the stocks held by a mutual fund into several components in order to both benchmark the stock portfolio and to provide a performance attribution for the fund. The measures used to decompose fund returns include:1. the portfolio-weighted return on stocks currently held by the fund, in excess of returns (during the same time period) on matched control portfolios having the same style characteristics (selectivity)2. the portfolio-weighted return on control portfolios having the same characteristics as stocks currently held by the fund, in excess of time-series average returns on those control portfolios (style timing)3. the time-series average returns on control portfolios having the same characteristics as stocks currently held (style-based returns)4. the execution costs incurred by the fund5. the expense ratio charged by the fund6. the net returns to investors in the fund, in excess of the returns to an appropriate benchmark portfolio.The first three components of performance, which decompose the return on the stocks held by a given mutual fund before any trading costs or expenses are considered, are briefly described next. We estimate the execution costs of each mutual fund during each quarter by applying recent research on institutional trading costs to our stockholdings data—we also describe this procedure below. Data on expense ratios and net returns are obtained directly from the merged mutual fund database. Finally, we describe the Carhart (1997) regression-based performance measure, which we use to benchmark-adjust net returns.The Ferson-Schadt Measure Ferson and Schadt (FS, 1996) develop a conditional performance measure at the net returns level. In essence, this measure identifies a fund manager as providing value if the manager provides excess net returns that are significantly higher than the fund’s matched factor benchmarks, both unconditional and conditional. The conditional benchmarks control for any predictability of the factor return premia that is due to evolving public information. Managers, therefore, are only labeled as superior if they possess superior private information on stock prices, and not if they change factor loadings over time in response to public information. FS also find that these conditionalbenchmarks help to control for the response of consumer cashflows to mutual funds. For example, when public information indicates that the market return will be unusually high, consumers invest unusually high amounts of cash into mutual funds, which reduces the performance measure, “alpha,” from an unconditional model (such as the Carhart model). This reduction in alpha occurs because the unconditional model does not control for the negative market timing induced by the flows. Edelen (1999) provides further evidence of a negative impact of flows on measured fund performance. Using the FS model mitigates this flow-timing effect. The version of the FS model used in this paper starts with the unconditional Carhart four-factor model and adds a market factor that is conditioned on the five FS economic variables.Decomposing the Persistence in Mutual Fund ReturnsSirri and Tufano (1998) find that consumer flows react about as strongly to one-year lagged net returns as to any other fund characteristic. In addition, the model of Lynch and Musto (2002) predicts that performance repeats among winners (but not losers), while the model of Berk and Green (2002) predicts no persistence (or weak persistence) as consumer flows compete away any managerial talent. Consistent with Sirri and Tufano (1998), and to test the competing viewpoints of Lynch and Musto (2002) and Berk and Green (2002), we sort funds on their one-year lagged net returns for the majority of tests in the remainder ofthis paper. When appropriate, we provide results for other sorting approaches as well.中文译文资金真的是“聪明”吗?关于共同基金流动,经理行为和绩效持续性关系的新证据作者:Russ Wermers此外,基金的复苏在多年期间强烈持续- 这是本文的核心发现。
智能交通系统中英文对照外文翻译文献(文档含英文原文和中文翻译)原文:Traffic Assignment Forecast Model Research in ITS IntroductionThe intelligent transportation system (ITS) develops rapidly along with the city sustainable development, the digital city construction and the development of transportation. One of the main functions of the ITS is to improve transportation environment and alleviate the transportation jam, the most effective method to gain the aim is to forecast the traffic volume of the local network and the important nodes exactly with GIS function of path analysis and correlation mathematic methods, and this will lead a better planning of the traffic network. Traffic assignment forecast is an important phase of traffic volume forecast. It will assign the forecasted traffic to every way in the traffic sector. If the traffic volume of certain road is too big, which would bring on traffic jam, planners must consider the adoption of new roads or improving existing roads to alleviate the traffic congestion situation. This study attempts to present an improved traffic assignment forecast model, MPCC, based on analyzing the advantages and disadvantages of classic traffic assignment forecast models, and test the validity of the improved model in practice.1 Analysis of classic models1.1 Shortcut traffic assignmentShortcut traffic assignment is a static traffic assignment method. In this method, the traffic load impact in the vehicles’ travel is not considered, and the traffic impedance (travel time) is a constant. The traffic volume of every origination-destination couple will be assigned to the shortcut between the origination and destination, while the traffic volume of other roads in this sector is null. This assignment method has the advantage of simple calculation; however, uneven distribution of the traffic volume is its obvious shortcoming. Using this assignment method, the assignment traffic volume will be concentrated on the shortcut, which isobviously not realistic. However, shortcut traffic assignment is the basis of all theother traffic assignment methods.1.2 Multi-ways probability assignmentIn reality, travelers always want to choose the shortcut to the destination, whichis called the shortcut factor; however, as the complexity of the traffic network, thepath chosen may not necessarily be the shortcut, which is called the random factor.Although every traveler hopes to follow the shortcut, there are some whose choice isnot the shortcut in fact. The shorter the path is, the greater the probability of beingchosen is; the longer the path is, the smaller the probability of being chosen is.Therefore, the multi-ways probability assignment model is guided by the LOGIT model:∑---=n j ii i F F p 1)exp()exp(θθ (1)Where i p is the probability of the path section i; i F is the travel time of thepath section i; θ is the transport decision parameter, which is calculated by the followprinciple: firstly, calculate the i p with different θ (from 0 to 1), then find the θwhich makes i p the most proximate to the actual i p .The shortcut factor and the random factor is considered in multi-ways probabilityassignment, therefore, the assignment result is more reasonable, but the relationshipbetween traffic impedance and traffic load and road capacity is not considered in thismethod, which leads to the assignment result is imprecise in more crowded trafficnetwork. We attempt to improve the accuracy through integrating the several elements above in one model-MPCC.2 Multi-ways probability and capacity constraint model2.1 Rational path aggregateIn order to make the improved model more reasonable in the application, theconcept of rational path aggregate has been proposed. The rational path aggregate,which is the foundation of MPCC model, constrains the calculation scope. Rationalpath aggregate refers to the aggregate of paths between starts and ends of the trafficsector, defined by inner nodes ascertained by the following rules: the distancebetween the next inner node and the start can not be shorter than the distance betweenthe current one and the start; at the same time, the distance between the next innernode and the end can not be longer than the distance between the current one and theend. The multi-ways probability assignment model will be only used in the rationalpath aggregate to assign the forecast traffic volume, and this will greatly enhance theapplicability of this model.2.2 Model assumption1) Traffic impedance is not a constant. It is decided by the vehicle characteristicand the current traffic situation.2) The traffic impedance which travelers estimate is random and imprecise.3) Every traveler chooses the path from respective rational path aggregate.Based on the assumptions above, we can use the MPCC model to assign thetraffic volume in the sector of origination-destination couples.2.3 Calculation of path traffic impedanceActually, travelers have different understanding to path traffic impedance, butgenerally, the travel cost, which is mainly made up of forecast travel time, travellength and forecast travel outlay, is considered the traffic impedance. Eq. (2) displaysthis relationship. a a a a F L T C γβα++= (2)Where a C is the traffic impedance of the path section a; a T is the forecast traveltime of the path section a; a L is the travel length of the path section a; a F is theforecast travel outlay of the path section a; α, β, γ are the weight value of that threeelements which impact the traffic impedance. For a certain path section, there aredifferent α, β and γ value for different vehicles. We can get the weighted average of α,β and γ of each path section from the statistic percent of each type of vehicle in thepath section.2.4 Chosen probability in MPCCActually, travelers always want to follow the best path (broad sense shortcut), butbecause of the impact of random factor, travelers just can choose the path which is ofthe smallest traffic impedance they estimate by themselves. It is the key point ofMPCC. According to the random utility theory of economics, if traffic impedance is considered as the negativeutility, the chosen probability rs p of origination-destinationpoints couple (r, s) should follow LOGIT model:∑---=n j jrs rs bC bC p 1)exp()exp( (3) where rs p is the chosen probability of the pathsection (r, s);rs C is the traffic impedance of the path sect-ion (r, s); j C is the trafficimpedance of each path section in the forecast traffic sector; b reflects the travelers’cognition to the traffic impedance of paths in the traffic sector, which has reverseratio to its deviation. If b → ∞ , the deviation of understanding extent of trafficimpedance approaches to 0. In this case, all the travelers will follow the path whichis of the smallest traffic impedance, which equals to the assignment results withShortcut Traffic Assignment. Contrarily, if b → 0, travelers ’ understanding error approaches infinity. In this case, the paths travelers choose are scattered. There is anobjection that b is of dimension in Eq.(3). Because the deviation of b should beknown before, it is difficult to determine the value of b. Therefore, Eq.(3) is improvedas follows:∑---=n j OD j OD rsrs C bC C bC p 1)exp()exp(,∑-=n j j OD C n C 11(4) Where OD C is the average of the traffic impedance of all the as-signed paths; bwhich is of no dimension, just has relationship to the rational path aggregate, ratherthan the traffic impedance. According to actual observation, the range of b which is anexperience value is generally between 3.00 to 4.00. For the more crowded cityinternal roads, b is normally between 3.00 and 3.50.2.5 Flow of MPCCMPCC model combines the idea of multi-ways probability assignment anditerative capacity constraint traffic assignment.Firstly, we can get the geometric information of the road network and OD trafficvolume from related data. Then we determine the rational path aggregate with themethod which is explained in Section 2.1.Secondly, we can calculate the traffic impedance of each path section with Eq.(2),Fig.1 Flowchart of MPCC which is expatiated in Section 2.3.Thirdly, on the foundation of the traffic impedance of each path section, we cancalculate the respective forecast traffic volume of every path section with improvedLOGIT model (Eq.(4)) in Section 2.4, which is the key point of MPCC.Fourthly, through the calculation processabove, we can get the chosen probability andforecast traffic volume of each path section, but itis not the end. We must recalculate the trafficimpedance again in the new traffic volumesituation. As is shown in Fig.1, because of theconsideration of the relationship between trafficimpedance and traffic load, the traffic impedanceand forecast assignment traffic volume of everypath will be continually amended. Using therelationship model between average speed andtraffic volume, we can calculate the travel timeand the traffic impedance of certain path sect-ionunder different traffic volume situation. For theroads with different technical levels, therelationship models between average speeds totraffic volume are as follows: 1) Highway: 1082.049.179AN V = (5) 2) Level 1 Roads: 11433.084.155AN V = (6) 3) Level 2 Roads: 66.091.057.112AN V = (7) 4) Level 3 Roads: 3.132.01.99AN V = (8) 5) Level 4 Roads: 0988.05.70A N V =(9) Where V is the average speed of the path section; A N is the traffic volume of thepath section.At the end, we can repeat assigning traffic volume of path sections with themethod in previous step, which is the idea of iterative capacity constraint assignment,until the traffic volume of every path section is stable.译文智能交通交通量分配预测模型介绍随着城市的可持续化发展、数字化城市的建设以及交通运输业的发展,智能交通系统(ITS)的发展越来越快。
目录1译文 (1)2原文 (7)1参考文献译文绿色创想建筑商计划提供了节能解决方案与行业认可的新住房平均相比,绿色畅想建筑商计划旨在降低家用能源和水的想好,减少排放。
该项目创新性地结合了建筑科学和高品质的产品,在帮助建筑商和开发商建造舒适型住房的同时,降低房屋对环境的影响。
随着生活费用的不断上涨,悦来愈多的人开始考虑将环保技术纳入新住房当中。
与行业认可的新住房陪你冠军水瓶相比,依照GE绿色创想建筑商计划所建造的房屋每年客减少20%的能耗与室内用水量,并且使生活用气排放量减少20%。
对于一套面积为2500平方英尺的住房而言,该计划每年可使购房者减少600至1500美元的电费和水费。
自该计划于2007年5月启动以来,整个美国与加拿大的建筑商与开发商纷纷申请建造绿色创想式房屋,其中包括德州西斯顿峡谷们的社区开发商。
按照绿色畅想计划正在开发的首个峡谷么社区被称为Discovery Companies,预计将于2008年夏季开盘。
加拿大的Fi的零售税环保想象住房计划推出在2007年9月,GE加拿大与波尔多发展组织签订计划,决定在位于加拿大阿尔伯他省卡尔加里西部的社区Rocky View实施加拿大首个绿色创想建筑商计划。
这块地区60多年来,一直有当地的一个牧民家庭所有,长期以来除了放养家畜之外始终难以用于其他用途。
迫于地区发展的强大压力,这个家庭决定对这块土地进行开发。
当这家人了解到如何最邮箱的进行地产开发之后,开始认真考虑如何处理这篇土地。
其中,家庭价值、对环境的保护意识以及社区精神都称为了需要考虑的关键问题。
实施证明,将GE的绿色创想建筑商计划与波尔多发展组织的环境可持续发展战略相结合是非常成功的。
规划中的面积为1750英亩的混用型绿色创想建筑商和谐开发项目见那个进行客持续开发,其中包括关于有效实用土地的创新性环保计划。
竣工使,此开放项目将建筑起3500所住房和衣架保健中心、一个27洞国际高尔夫球场、一所学校和一篇商业用地。
参考文献英文范文参考文献是在学术研究过程中,对某一著作或论文的整体的参考或借鉴。
下面是给大家整理的参考文献英文范文,供大家参阅!参考文献英文范文:英文参考文献标准格式一、参考文献的类型参考文献(即引文出处)的类型以单字母方式标识,具体如下:--专著,著作[C]--论文集(一般指会议发表的论文续集,及一些专题论文集,如《***大学研究生学术论文集》[N]-- 报纸文章[J]--期刊文章:发表在期刊上的论文,尽管有时我们看到的是从网上下载的(如知网),但它也是发表在期刊上的,你看到的电子期刊仅是其电子版[D]--学位论文:不区分硕士还是博士论文--报告:一般在标题中会有"关于****的报告"字样[S]-- 标准[P]--专利[A]--文章:很少用,主要是不属于以上类型的文章[Z]--对于不属于上述的文献类型,可用字母"Z"标识,但这种情况非常少见常用的电子文献及载体类型标识:[DB/OL] --联机网上数据(database online)[DB/MT] --磁带数据库(database on magnetic tape)[M/CD] --光盘图书(monograph on CDROM)[CP/DK] --磁盘软件(computer program on disk)[J/OL] --网上期刊(serial online)[EB/OL] --网上电子公告(electronic bulletin board online)很显然,标识的就是该资源的英文缩写,/前面表示类型,/后面表示资源的载体,如OL表示在线资源二、参考文献的格式及举例1.期刊类【格式】[序号]作者.篇名[J].刊名,出版年份,卷号(期号)起止页码.【举例】[1] 周融,任志国,杨尚雷,厉星星.对新形势下毕业设计管理工作的思考与实践[J].电气电子教学学报,2003(6):107-109.[2] 夏鲁惠.高等学校毕业设计(论文)教学情况调研报告[J].高等理科教育,2004(1):46-52.[3] Heider, E.R.& D.C.Oliver. The structure of color space in naming and memory of two languages [J]. Foreign Language Teaching and Research, 1999, (3): 62 67.2.专著类【格式】[序号]作者.书名.出版地:出版社,出版年份:起止页码.【举例】[4] 刘国钧,王连成.图书馆史研究.北京:高等教育出版社,1979:15-18,31.[5] Gill, R. Mastering English Literature . London: Macmillan, 1985: 42-45.3.报纸类【格式】[序号]作者.篇名[N].报纸名,出版日期(版次).【举例】[6] 李大伦.经济全球化的重要性[N]. 光明日报,1998-12-27(3).[7] French, W. Between Silences: A Voice from China[N]. Atlantic Weekly, 1987-8-15(33).4.论文集【格式】[序号]作者.篇名[C].出版地:出版者,出版年份:起始页码.【举例】[8] 伍蠡甫.西方文论选[C]. 上海:上海译文出版社,1979:12-17.[9] Spivak,G. "Can the Subaltern Speak?"[A]. In C.Nelson & L. Grossberg(eds.). Victory in Limbo: Imigism [C]. Urbana: University of Illinois Press, 1988, pp.271-313.[10] Almarza, G.G. Student foreign language teacher's knowledge growth [A]. In D.Freeman andJ.C.Richards (eds.). Teacher Learning in Language Teaching [C]. New York: Cambridge University Press. 1996. pp.50-78.5. 学位论文【格式】[序号]作者.篇名[D].出版地:保存者,出版年份:起始页码.【举例】[11] 张筑生.微分半动力系统的不变集[D].北京:北京大学数学系数学研究所, 1983:1-7.6.研究报告【格式】[序号]作者. 篇名.出版地:出版者,出版年份:起始页码.【举例】[12] 冯西桥.核反应堆压力管道与压力容器的LBB分析.北京:清华大学核能技术设计研究院, 1997:9-10.7.专利【格式】[序号]专利所有者.题名[P].国别:专利号,发布日期.【举例】[13] 姜锡洲.一种温热外敷药制备方案[P].中国专利:881056073, 1989 07 26.8.标准【格式】[序号]标准编号,标准名称[S].【举例】[14] GB/T 16159-1996, 汉语拼音正词法基本规则[S].9.条例【格式】[序号]颁布单位.条例名称.发布日期【举例】[15] 中华人民共和国科学技术委员会.科学技术期刊管理办法[Z].1991-06-0510.电子文献【格式】[序号]主要责任者.电子文献题名.电子文献出处[电子文献及载体类型标识].或可获得地址,发表或更新日期/引用日期.【举例】[16] 王明亮.关于中国学术期刊标准化数据库系统工程的进展[EB/OL].http: ///pub/wml.txt/980810 2.html, 1998 08 16/1998 10 04.[17] 万锦.中国大学学报论文文摘(1983 1993).英文版[DB/CD]. 北京: 中国大百科全书出版社, 1996.11.各种未定义类型的文献【格式】[序号] 主要责任者.文献题名[Z].出版地:出版者, 出版年.特别说明:凡出现在"参考文献"项中的标点符号都失去了其原有意义,且其中所有标点必须是半角,如果你的输入法中有半角/全解转换,则换到半角状态就可以了,如果你的输入法中没有这一转换功能,直接关闭中文输入法,在英文输入状态下输入即可.其实,很多输入法(如目前比较流行的搜狐输入法)都提供了四种组合:(1)中文标点+ 全角:这时输入的标点是这样的,:【1】-(而这时,我没有找到哪个键可以输入/ 符号)也就是说,这些符号是一定不能出现在"参考文献"中的;(2) 中文标点+半角:这时输入的标点是这样的,:【1】-(这时,我还是没有找到哪个键可以输入/ 符号)也就是说,这些符号也不能出现在"参考文献"中的;上面列出的符号,中间没有任何的空格,你能看出它们有什么区别吗?我看只是-的宽度有一点点不同,其它都一样(3)英文标点+全角:这时输入的标点是这样的,.:[1]-/(4)英文标点+半角:这时输入的标点是这样的,.:[1]-/从这两项可以明显的看出,半角和全角其实最大的差别是所占的宽度不一样,这一点对于数字来说最为明显,而英文标点明显要比中文标点细小很多(也许因为英文中,标点的功能没有中文那么复杂,就是说英文中标点符号的能力没有中文那么强大)所以,很多人在写"参考文献" 时,总是觉得用英文标点+半角很不清楚,间距也太小,其实这点完全不用担心如果你觉得真的太小不好看,就用英文标点+全角吧而在[1] 之后,一般也都有一个空格对于英文参考文献,还应注意以下两点:①作者姓名采用"姓在前名在后"原则,具体格式是:姓,名字的首字母. 如:Malcolm Richard Cowley 应为:Cowley, M.R.,如果有两位作者,第一位作者方式不变,&之后第二位作者名字的首字母放在前面,姓放在后面,如:Frank Norris 与Irving Gordon应为:Norris, F. & I.Gordon.②书名、报刊名使用斜体字,如:Mastering English Literature,English Weekly.三、注释注释是对论文正文中某一特定内容的进一步解释或补充说明注释应置于本页页脚,前面用圈码①、②、③等标识参考文献英文范文:英文论文参考文献格式写法Learning Advice Centreyour in the author/date system) and, for law students or in dissertations, the numeric system. Different subject areas use slight variations of these systems (and other systems do exist) so you must consult your course/module handbook for clarification of the specific conventions that you are expected to use within your subject area(s).References need to appear in two places:1. within the body of your writing include: author‟s surname, year of publication and, if quoting, the exact page number from which the quote is taken;2. in the bibliography include at least: author‟s surname, initial(s), year of publication, title of text/chapter, edition, publisher & place of publication; see page 3 for specific details that apply to referencing different sources.There are two ways in which you can reference, or cite, another person's work: a) by paraphrasing; this shows you have fully interpreted what you have read - see Learning Skills Help Sheet on How to Paraphrase;1.1 References within the body of the text - Harvard Systemb) by quoting directly; follow with a comment to show relevance/understanding If the direct quotation is more than two lines, you should indent it as a separate paragraph e.g.: As Cottrell (2003, p.148) points out“Our views of what is „intelligent‟ can prevent us from developing our minds to their full potential. People who feel they are „not very bright‟ or „not very creative‟ probably will fulfil that estimation of themselves. On the other hand, positive thinking and constructive mental activity develop the mind.”Citing secondary sources:If you are referencing a work cited by the author of the text you are reading, you should cite the original work as being within a secondary source i.e. what what the writer of the book you are reading has read, using the following method: According to De Bono (1994, cited in Cottrell, 2003,p.148), “clever people are often hampered by their apparent intelligence in two ways:”they are good at arguing and defending their point of view; they indulge in negative criticism which is a quick, easy and dramatic way of proving someone wrong.Cont'd You can make an appointment with the Learning Advisor if you wish to receive more individual advice on your independent learning skills. Email or phone 020 7911 5000 ext. 2364.Learning Advice Centrereference appears as a footnote at the bottom of the page e.g.: There were many changes in the British diet in the period after 1870. Fruitbecame more common, especially in the form of fruit jam. Even the fish-and-chip shop dates from the same period.1 (Note: See bottom of this page for associated footnote.) To insert footnotes using Word, click on the placein your document where you want to insert thefootnote.Then click on the Insert menu, select Reference,then click on Footnote.Another window will then open that will allow you to format thefootnotes manually, if you require.Once the footnote has been inserted in the text and it appearsat the bottom of the page, click next to the number at the bottom to add the reference details: author surname, initial(s),publication year, title of work/article, page number, etc.Once you have referenced an author for the first time using the numeric system you do not have to repeat that same reference in full again. If the same work is referenced consecutively on the same page use: ibid. = (from the Latin „ibidem‟, meaning „the same‟) orop.cit. = (from the Latin „opere citado‟ meaning „in the work already cited‟) If the same work is referenced on another page, list the author‟s surname, initials and date of publication again followed by op.cit. and the page number.Different page numbers for the citations you use must be listed with each footnote (see example below).2Hobsbawm, H., (1990), The Eating Habits of the British People, p. 162 2 ibid., p. 1631Learning Advice Centre according toBooks Heinz, E., (2000), A History of Baked Beans, Arnold, London If there are two authors you must list both authors‟ names e.g.: Heinz, E., and McDonald, R., (2001), A History of Baked Beans, Arnold, London If there are more than two authors, name the first author followed by ‘et al’ (Latin meaning „and others‟) e.g.:Heinz, E., et al., (2002), The Bean and Other Legumes, Routledge, New York If the book has more than one edition, you must state which edition you have used e.g.:Heinz, E., and McDonald, R., (2006), A History of Baked Beans, (2nd Ed.), Arnold, LondonAn article in a book Johnson, S., (1998a), The Cornflake in History, In: Jennings, N., (Ed.) Food for Thought, Edinburgh University Press, UKJournal articles Johnson, S., (1998b), „Deconstructing the pre-millennial diet: Special K and postmodernism‟, Cultural Studies 11, 1:pp.32–44This means that an article by Sarah Johnson called „Deconstructing the pre-millennial diet: Special K and postmodernism‟ was published in the journal Cultural Studies, volume 11, number 1, on pages 32 to 44. This issue of the journal was published in 1998.Where you have referenced two or more separate works by the same author that were published in the same year, add alphabetical notation after the publication year in both the text and bibliography to distinguish between the works. (See examples above.)E-journal articles Jimenez, R., (2003), „Sex Differences in L2 Vocabulary Learning Strategies‟, International Journal of Applied Linguistics 13, 1, pp.54-77, [online], available from: [Accessed 13/10/2006]For e-journals/books you must state that it is an online resource, cite the URL and include the date you accessed it at the end in addition to including the journal volume/number and the publication year, as above.Learning Advice Centre acceptable title and state the date you accessed the site e.g.: Holmes, A., (2000), Greenpeace wins media war, [online], available from: [Accessed 25/10/2006].If you cannot find & state the author‟s name, use the name of the organisation, e.g.: BBC, (2007), Northern Ireland: The Troubles, [online], available from:[Accessed 30/04/2007].Newspaper articlesList the writer‟s surname and initial(s), year of publication, title of article, title of newspaper followed by the full date of publication, section of the paper and page number, e.g.: Ratner, C., (2000), „Magazine sparks love feud‟, The Independent, 10 October 2000, Thursday Review: p.14Reference to a ThesisList the surname, initials, year, title, type of thesis, name of institution submitted to: Smith, J., (2005), Linguistic Significance of Teenage Slang in the UK, (PhD), University of WestminsterTV ProgrammesFollowing the series title list the number and title of the episode, year, transmitting channel followed by the full date and time, if known, of transmission. Venice, Episode 4; Death, (2004), BBC 2, 12/12/2004Contributions in ProgrammesIndividual speakers or contributors to programmes should be referenced by name followed by year, programme title, channel and date of transmission e.g.: Brown, G., (2007), Live Treasury Questions, BBC Parliament, 29/03/2007 DVD/Video List the title, year of production, format, Director‟s name, production place and organisation, e.g.: Dogma, (1999), VHS, Directed by Kevin Smith, View AskewLearning Advice Centreo create a bibliographic list that can be imported into your word documentTo log in to RefWorks use your Athens username and password.NOTE: before you start to use RefWorks it is highly advisable that you either look at the guidance on the library home page or work through the online tutorials. RefWorks is not a tool that can be learned in 5 minutes and used as a last minute quick fix if you are behind on an assignment.Remember, as with any assignment, you should ensure that once you have imported your bibliography you edit and format it to match your departmental protocol; bibliographical information created using RefWorks may be formatted in an alternative way.References:Cottrell, S., (2003), Skills for Success; The Personal Development Planning Handbook, Palgrave Macmillan, UK Holland, M., (2006), Citing References, Academic Services, Bournemouth University,参考文献英文范文:英文参考文献格式英文文献采用“APA格式”:单一作者著作的书籍:姓,名字首字母.(年). 书名(斜体). 出版社所在城市:出版社.Sheril, R. D. (1956). The terrifying future: Contemplating color television. San Diego: Halstead.两位作者以上合著的书籍:姓,名字首字母., & 姓,名字首字母.(年). 书名(斜体). 出版社所在城市:出版社. Smith, J., & Peter, Q. (1992). Hairball: An intensive peek behind the surface of an enigma. Hamilton, ON: McMaster University Press.文集中的文章:Mcdonalds, A. (1993). Practical methods for the apprehension and sustained containment of supernatural entities. In G. L. Yeager (Ed.), Paranormal and occult studies: Case studies in application (pp. 42–64). London: OtherWorld Books.期刊中的文章(非连续页码):Crackton, P. (1987). The Loonie: God's long-awaited gift to colourful pocket change? Canadian Change, 64(7), 34–37.期刊中的文章(连续页码):姓,名字首字母.(年). 题目. 期刊名(斜体). 第几期,页码.Rottweiler, F. T., & Beauchemin, J. L. (1987). Detroit and Narnia: Two foes on the brink of destruction. Canadian/American Studies Journal, 54, 66–146.月刊杂志中的文章:Henry, W. A., III. (1990, April 9). Making the grade in today's schools. Time, 135, 28-31.。
Environmental problems caused by Istanbul subway excavation and suggestionsfor remediation伊斯坦布尔地铁开挖引起的环境问题及补救建议Ibrahim Ocak Abstract:Many environmental problems caused by subway excavations have inevitably become an important point in city life. These problems can be categorized as transporting and stocking of excavated material, traffic jams, noise, vibrations, piles of dust mud and lack of supplies. Although these problems cause many difficulties,the most pressing for a big city like Istanbul is excava tion,since other listed difficulties result from it. Moreover, these problems are environmentally and regionally restricted to the period over which construction projects are underway and disappear when construction is finished. Currently, in Istanbul, there are nine subway construction projects in operation, covering approximately 73 km in length; over 200 km to be constructed in the near future. The amount of material excavated from ongoing construction projects covers approximately 12 million m3. In this study, problems—primarily, the problem with excavation waste(EW)—caused by subway excavation are analyzed and suggestions for remediation are offered.摘要:许多地铁开挖引起的环境问题不可避免地成为城市生活的重要部分。
毕业论文英文翻译文献随着全球化的发展,英语在全球的运用越来越广泛。
下文是店铺为大家整理的关于毕业论文英文翻译文献的内容,欢迎大家阅读参考! 毕业论文英文翻译文献(一)1. 谢天振主编. 《当代国外翻译理论导读》. 天津:南开大学出版社,2008.2. 包惠南、包昂. 《中国文化与汉英翻译》. 北京:外文出版社, 2004.3. 包惠南. 《文化语境与语言翻译》. 北京:中国对外翻译出版公司. 2001.4. 毕继万. 《世界文化史故事大系——英国卷》. 上海:上海外语教育出版社, 2003.5. 蔡基刚. 《英汉汉英段落翻译与实践》. 上海:复旦大学出版社, 2001.6. 蔡基刚. 《英汉写作对比研究》. 上海:复旦大学出版社, 2001.7. 蔡基刚. 《英语写作与抽象名词表达》. 上海:复旦大学出版社, 2003.8. 曹雪芹、高鄂. 《红楼梦》.9. 陈定安. 《英汉比较与翻译》. 北京:中国对外翻译出版公司, 1991.10. 陈福康. 《中国译学理论史稿》(修订本). 上海:上海外语教育出版社. 2000.11. 陈生保. 《英汉翻译津指》. 北京:中国对外翻译出版公司. 1998.12. 陈廷祐. 《英文汉译技巧》. 北京:外语教学与研究出版社. 2001.13. 陈望道. 《修辞学发凡》. 上海:上海教育出版社, 1979.14. 陈文伯. 《英汉翻译技法与练习》. 北京:世界知识出版社. 1998.15. 陈中绳、吴娟. 《英汉新词新义佳译》. 上海:上海翻译出版公司. 1990.16. 陈忠诚. 《词语翻译丛谈》. 北京:中国对外翻译出版公司, 1983.17. 程希岚. 《修辞学新编》. 吉林:吉林人民出版社, 1984.18. 程镇球. 《翻译论文集》. 北京:外语教学与研究出版社. 2002.19. 程镇球. 《翻译问题探索》. 北京:商务印书馆, 1980.20. 崔刚. 《广告英语》. 北京:北京理工大学出版社, 1993.21. 单其昌. 《汉英翻译技巧》. 北京:外语教学与研究出版社. 1990.22. 单其昌. 《汉英翻译讲评》. 北京:对外贸易教育出版社. 1989.23. 邓炎昌、刘润清. 《语言与文化——英汉语言文化对比》. 北京:外语教学与研究出版社, 1989.24. 丁树德. 《英汉汉英翻译教学综合指导》. 天津:天津大学出版社, 1996.25. 杜承南等,《中国当代翻译百论》. 重庆:重庆大学出版社, 1994.26. 《翻译通讯》编辑部. 《翻译研究论文集(1894-1948)》. 北京:外语教学与研究出版社. 1984.27. 《翻译通讯》编辑部. 《翻译研究论文集(1949-1983)》. 北京:外语教学与研究出版社. 1984. .28. 范勇主编. 《新编汉英翻译教程》. 天津:南开大学出版社. 2006.29. 方梦之、马秉义(编选). 《汉译英实践与技巧》. 北京:旅游教育出版社. 1996.30. 方梦之. 《英语汉译实践与技巧》. 天津:天津科技翻译出版公司. 1994.31. 方梦之主编. 《译学辞典》. 上海:上海外语教育出版社. 2004.32. 冯翠华. 《英语修辞大全》,北京:外语教学与研究出版社, 1995.33. 冯庆华. 《文体与翻译》. 上海:上海外语教育出版社, 2002.34. 冯庆华主编. 《文体翻译论》. 上海:上海外语教育出版社. 2002.35. 冯胜利. 《汉语的韵律、词法与句法》. 北京:北京大学出版社, 1997.36. 冯志杰. 《汉英科技翻译指要》. 北京:中国对外翻译出版公司. 1998.37. 耿占春. 《隐喻》. 北京:东方出版社, 1993.38. 郭建中. 《当代美国翻译理论》. 武汉:湖北教育出版社. 2000.39. 郭建中. 《文化与翻译》. 北京:中国对外翻译出版公司. 2000.40. 何炳威. 《容易误译的英语》. 北京:外语教学与研究出版社. 2002.41. 何刚强. 《现代英汉翻译操作》. 北京:北京大学出版社. 1998.42. 何刚强. 《现代英语表达与汉语对应》. 上海:复旦大学出版社. 1994.43. 何刚强. 《英汉口笔译技艺》. 上海:复旦大学出版社, 2003. 毕业论文英文翻译文献(二)1. 何自然、张达三、杨伟钧等译. 《现代英语语法教程》. 北京:商务印书馆, 1990.2. 何自然. 《语用学概论》. 长沙: 湖南教育出版社, 1988.3. 侯维瑞. 《英语语体》. 上海:上海外语教育出版社, 1988.4. 胡庚申. 《怎样起草与翻译合同协议》. 合肥:中国科技大学出版社, 1993.5. 胡曙中. 《英汉修辞比较研究》. 上海:上海外语教育出版社, 1993.6. 胡晓吉. 《实用英汉对比翻译》. 北京:中国人民大学出版社. 1990.7. 胡燕平,张容建. 《实用英汉翻译类典》. 重庆:重庆出版社, 1997.8. 胡裕树. 《现代汉语》. 上海:上海教育出版社, 1987.9. 胡兆云. 《美学理论视野中的文学翻译研究》(第2版). 北京:现代教育出版社. 2009.10. 胡兆云. 《语言接触与英汉借词研究》. 济南:山东大学出版社. 2001.11. 胡壮麟. 《语篇的衔接与连贯》. 上海:上海外语教育出版社, 1994.12. 胡壮麟. 《语言学教程》. 北京:北京大学出版社, 1988.13. 黄伯荣, 廖序东. 《现代汉语》. 兰州:甘肃人民出版社, 1981.14. 黄国文. 《语篇分析概要》. 长沙:湖南教育出版社, 1988.15. 黄龙. 《翻译技巧指导》. 沈阳:辽宁人民出版社, 1986.16. 黄任. 《英语修辞与写作》. 上海:上海外语教育出版社, 1996.17. 黄雨石. 《英汉文学翻译探索》. 西安:陕西人民出版社. 1988.18. 黄振定. 《翻译学:艺术论与科学论的统一》. 长沙:湖南教育出版社. 1998.19. 黄振定. 《翻译学的语言哲学基础》. 上海:上海交通大学出版社. 2007.20. 黄忠廉. 《变译理论》. 北京:中国对外翻译出版公司. 2002.21. 贾尔斯英译. 《孙子兵法》. 长沙:湖南出版社, 1993.22. 贾文波. 《汉英时文翻译: 政治经济汉译英300句析》. 北京:中国对外翻译出版公司, 1999.23. 贾玉新. 《跨文化交际学》. 上海:上海外语教育出版社, 1997.24. 金隄. 《等效翻译探索》. 北京:中国对外翻译出版公司. 1998.25. 金惠康. 《汉英跨文化交际翻译》. 贵阳:贵州教育出版社. 1998.26. 金惠康. 《跨文华交际翻译》. 北京:中国对外翻译出版公司, 2003.27. 金惠康. 《跨文华交际翻译续编》. 北京:中国对外翻译出版公司, 2004.28. 金立鑫. 《语法的多视角研究》. 上海:上海外语教育出版社, 2000.29. 居祖纯. 《新编汉英语篇翻译》. 北京:清华大学出版社, 2002.30. 柯平. 《对比语言学》. 南京:南京师范大学出版社, 1999.31. 孔慧怡. 《翻译·文学·文化》. 北京:北京大学出版社. 1999.32. 李定坤. 《汉英辞格对比与翻译》. 武汉:华中师范大学出版社, 1994.33. 李国南. 《辞格与词汇》. 上海:上海外语教育出版社, 2002.34. 李国南. 《英汉修辞格对比研究》. 福州:福建人民出版社, 1999.35. 李明编著. 《英汉互动翻译教程》. 武汉:武汉大学出版社. 2006.36. 李瑞华(主编). 《英汉语言文化对比研究》. 上海:上海外语教育出版社. 1996.。
英语论文参考文献精选3篇英语论文参考文献精选1篇英文及其它语种的文献在前,中文文献在后,参照以下标准执行。
期刊论文Bolinger, D. 1965. The atomization of word meaning [J]. Language 41 (4): 555-573.朱永生,2006,名词化、动词化与语法隐喻[J],《外语教学与研究》(2):83-90。
论文集论文Bybee, J. 1994. The grammaticization of zero: Asymmetries in tense and aspect systems [A]. In W. Pagliuca (ed.). Perspectives on Grammaticalization [C]. Amsterdam: John Benjamins. 235-254.文秋芳,2003a,英语学习者动机、观念、策略的变化规律与特点 [A]。
载文秋芳、王立非(编),《英语学习策略实证研究》[C]。
西安:陕西师范大学出版社。
255-259。
网上文献Jiang, Yan. 2000. The Tao of verbal communication: An Elementary textbook on pragmatics and discourse analysis [OL]. (accessed 30/04/2006).王岳川,2004,当代传媒中的网络文化与电视批评[OL], (2005年11月18日读取)。
专著Bloomfield, L. 1933. Language [M]. New York: Holt.吕叔湘、朱德熙,1952,《语法修辞讲话》[M]。
北京:中国青年出版社。
译著Nedjalkov, V. P. (ed.). 1983/1988. Typology of Resultative Constructions, trans. Bernard Comrie [C]. Amsterdam: John Benjamins.赵元任,1968/1980,《中国话的文法》(A Grammar of Spoken Chinese)[M],丁邦新译。
毕业设计(论文)外文文献翻译文献、资料中文题目:超越边界的BIM文献、资料英文题目:BIM Beyond Boundaries文献、资料来源:文献、资料发表(出版)日期:院(部):专业:工程管理班级:姓名:学号:指导教师:翻译日期: 2017.02.14本科毕业论文外文文献及译文文献、资料题目:BIM Beyond Boundaries文献、资料来源:Design Intelligence文献、资料发表(出版)日期:2012.12.10院(部):管理工程学院专业:工程管理班级:姓名:学号:指导教师:翻译日期:2015.2.10外文文献:BIM Beyond BoundariesSeptember 10, 2012 · by Randy DeutschAbstract: Opting for depth over breadth of expertise is a false choice that will lead individuals, organizations, the profession, and industry in the wrong direction.Keywords: BIM, expertise, anti-learning, master builderSeveral forces are converging to create an unprecedented and timely opportunity for organizations that have embraced building information modeling (BIM). These forces —including the rise of the expert, the growing complexity and speed of projects, and BIM’s increasing recognition as an enabler, catalyst, and facilitator of team collaboration — also present significant challenges that can be overcome with the right approach and mindset.At one time, being an expert meant knowing more than one’s competitors in a particular field. Firms that reinforced their expert culture hoarded information, which resulted in silos of expertise. Today, many firms are looking to hire people perceived as building and software technology experts, shortsightedly addressing today’s needs at the expense of tomorrow’s. While architects have always been trees with many branches, our current economic climate has discouraged them from being anything but palm trees: all trunk, no branches.And yet things change so quickly that those who went to bed experts are unlikely to wake up experts in the morning. Due to the speed and complexity of projects, we do not have time to acquire knowledge the old way — slowly, over time, through traditional means. Even when we supplement our book learning with conferences, webinars, and continuing education, it is impossible to keep up with the flow of new information in our industry.Expertise today is a much more social, fluid, and iterative process than it used to be. Being an expert is no longer about telling people what you know so much as understanding what questions to ask, who to ask, and applying knowledge flexibly and contextually to the specific situation at hand. Expertise has often been associated with teaching and mentoring. Today it’s more concerned with learning than knowing: less to do with continuing education and more with practicing and engaging in continuous education.Social media presents the would-be expert with both opportunities and challenges. Workingwith the understanding that somebody somewhere has already done what you are trying to do, design pr ofessionals, like agile technology experts, can find what they’re looking for by tapping into their networks and aggregating the responses. Conversely, due to the rise of social media, virtually all anyone has to do today to be considered a technology expert is to call themselves one. Because social networks allow people to proclaim themselves experts, it can be hard to know who to turn to, resulting in the rise of otherwise unnecessary certifications.An expert today is someone whose network, community, or team deems him or her so. Such acknowledgment from one’s community can be considered a form of social certification. To grow one’s professional reputation, expertise in BIM counter-intuitively requires unlearning, detachment, collaboration, and developing both deep skills and broad interests.BIM EXPERTISE REQUIRES UNLEARNINGAs we grow in our careers, we tend to focus more on people issues and less on technology. We also tend to cooperate conditionally, responding to the behavior of others. This has huge implications for design and construction professionals who might be naturally collaborative —through sharing knowledge, learning, mentoring, and teaching — but are otherwise conditioned and tempered by the culture of the firm where they work.Working in BIM provides an unprecedented opportunity to learn: how buildings go together, how projects are scheduled, cost implications of decisions, and impact on the environment. At the same time, there is a great deal we still need to unlearn with BIM. We can start by asking some questions: Which aspects of the traditional design process change with BIM and which stay the same? What knowledge, methods and strategies must be abandoned due to BIM and what is critical to keep? And perhaps most important: What, while learning to work in BIM, needs to be unlearned?While unlearning habits we picked up working in CAD would seem like a good place to start, there’s also a great deal we need to unlearn in order to return to our original sharing attitude and cooperative ways. These include bad habits we’ve acquired since we left the cocoon of school and embarked on the hard knocks of a career in architecture and construction, where we may have learned to be mistrustful, skeptical, competitive, secretive, and working independently in silos. In doing so, we’ve unlearned many of the critical natural habits, attitudes, and mindsets necessary to work effectively and collaboratively on integrated teams.BIM EXPERTISE REQUIRES DETACHMENTFrom Japanese martial arts there’s the concept o f shuhari: First learn, then detach, and finally transcend. As consultant Ian Rusk has explained, shu, ha, and ri are considered three phases of knowledge that one passes through in the study of an art. They can be described as the phases of traditional knowledge, breaking with tradition, and transcending it.Working in BIM, we need to address all three steps to meet our goals. Of the steps, the second (detachment, or breaking with tradition) is the most important. Detachment requires that we remain flexible and agile while learning, not holding on tightly to our ideas, agendas, or prejudices, so that we can move beyond them.BIM EXPERTISE REQUIRES COLLABORATIONWhile we as an industry have now lived with BIM for more than two decades, most firms have acquired and implemented the technology primarily as a visualization and coordination tool in the past several years. We appear to have reached a standstill in the software’s use, with many firm leaders wondering how to make the leap to more advanced uses. Further mastery of the application through traditional means won’t help us get there. If we are to achieve our personal, organizational, professional, and industry-wide goals of fully participating in public, community, creative, and economic life, something more needs to happen.Achieving higher levels of BIM use — including analysis, computation, and fabrication —requires skills and a mindset that allow us to work productively and effectively in a collaborative setting. Working with BIM enables but doesn’t n ecessarily lead to collaboration. We each have to decide whether or not to look beyond BIM as a tool and embrace it as a process. When recognized as a process, BIM can be a powerful catalyst and facilitator of team collaboration.BIM EXPERTISE REQUIRES DEPTH AND BREADTHIt would be a mistake to assume that expertise in BIM as a technology alone will lead to greater leadership opportunities on integrated teams. In this capacity, BIM requires attention to acquiring skills that, while easy to attain, can be overlooked if we focus primarily on the software tools.With BIM, technical expertise should not be considered more important than increasing one’s social intelligence, empathy, or the ability to relate well with others. Additionally, the conventional window for achieving technological expertise is too long. Better that one achieves ahigh level of BIM competency motivated by passion and curiosity. Having competency in one subject doesn’t preclude you from addressing others. In fact, it can be a determinant f or doing so.Being versatile flies in the face of current thinking that to succeed we should bolster our strengths over our weaknesses. The answer to Should I be a specialist or generalist? is yes. There must be people who can see the details as well as those who can see the big picture. One gift of the design professional is the rare (and underappreciated) ability to do both simultaneously. As with any hybrid —generalizing specialist or specializing generalist —one’s strength provides the confidence to contribute openly from many vantage points and perspectives.It is critical for “T-shaped” experts to reach out and make connections (the horizontal arm of the T) in all the areas they know little or nothing about from their base of technical competence (the vertical arm of the T). T-shaped experts have confidence because of their assurance that they know or do one thing well. Their confidence allows them to see as others see by means of — not through —what they know. Their expertise doesn’t color their p erception so much as provide a home base to venture from and return to with some assurance that they’ll maintain their bearings when venturing out across the table.Broad-minded design professionals often find themselves in the role of “anti-experts,” approaching challenges from the perspective of the outsider. To this Paula Scher of Pentagram said, “When I’m totally unqualified for a job, that’s when I do my best work.” Once we balance, own, and ultimately realize our expert and anti-expert selves, we (as a community, profession, and industry) will do our best work.WHAT DO WE DO NOW?Firms want to know how to optimize their work processes to become more efficient at what they do best, to remain competitive by leveraging the competitive advantage of BIM and integrated design. One of the ironies facing the industry is that in order to master BIM, don’t learn more BIM. Instead, do other things.What will bring about greater efficiencies and effectiveness, increase productivity and deliver value, is not additional technology knowledge but our ability to communicate, relate, work together, think like one another, have empathy, understand, and listen. If design professionals want to lead they will do so not by increasing their depth but by benefit of broader capabilities involving their reach.What do we do now? Go wide and deep. Go against common wisdom and fortify your soft skills, your reach and wingspan. To master BIM you have to transcend BIM.We need to develop both sides of ourselves in order to move beyon d our own and others’ biases and anticipate consequences for courses of action before they are acted upon. We need to develop the ability to put the project first, navigate iRooms and packed conference tables to get our ideas and points across, be able to read people for overt and subliminal responses, have the confidence to ask questions without feeling threatened and be asked questions without becoming defensive. It is as though we have placed so much emphasis on the bricks we’ve forgotten the mortar that allows us to communicate genuinely, to relate well with one another and integrate.Having to choose between depth and breadth is a false choice that heads our profession and industry in the wrong direction. Rather than focusing on one over the other, we need to develop simultaneously vertical deep skills and horizontal soft skills, to work on our strengths and weaknesses, to be expert and anti-expert, specialist and generalist, to design from evidence and from intuition, to be task- and people-oriented, to have mastery over one thing and be a jack-of-all-trades.As one blog commenter recently asserted, “In order to practice architecture well, you need to understand a lot of things that aren’t architecture.” BIM technology experts know one thing. To flourish and persevere, we need to know and do many things.Often overlooked in mutual mentoring of computer technology and building technology by senior and junior staff are basic people skills: listening, questioning, negotiating, collaborating, communicating. The concern is that the emerging design professional —adept at BIM tools while learning how buildings come together —won’t learn the necessary communication and people management skills to negotiate a table full of teammates on an integrated team. These skills need to be nurtured, mentored, and acquired as assuredly as computer and building technology skills. These skills require the same amount of deliberate practice and feedback as the mastery of technology skills. Developing complementary, collaborative skills is as critical as becoming competent with the technology. As Ernest Boyer anticipated, “The future belongs to the integrators.” And that future has arrived.Succeeding in practice today is a both/and, not an either/or, proposition. Design professionals must be both BIM technologist and building technologist. Those who accept thismodel will lead, persevere, and flourish in our new economy.Last year in Design Intelligence, Stephen Fiskum wrote, “One thing is certain: The solution to the current mal aise in our profession is not for us to go broader but to go deeper” (“Preparing for a New Practice Paradigm,” January/February 2010). This is a new world: By going wider and deeper we provide owners and our organizations with the most value and increased productivity. Working effectively and collaboratively in BIM will help us transcend our current state, bridge the gap, and cross over to more advanced uses.THE MULTIDISCIPLINARY MINDSETIt is not just that the integrated team is now multidisciplinary, but we each must become multidisciplinary. Doing so requires a multidisciplinary mindset. This entails empathy, a genuine appreciation for others’ ideas, seeing from many perspectives, and anticipating possible consequences to any course of action. An industry representative recently stated in a public forum, “I don’t want the architect to think like a structural engineer. I need for him to think like an architect!” To leverage our technology tools and work processes, being an architect today means that we thi nk like a structural engineer as well as a contractor and owner. Doing so doesn’t take away from architects’ role but increases their credibility by making them more effective and influential at what they do well.Working in BIM — inward focused, object-oriented, filling-in dialog boxes — discourages this mindset. It is a mistake to think that those who work in BIM are technicians and that a firm principal or senior designer who sees the big picture will mediate between the model and the world in which the model operates. Leaders must see to it that their teams look outward, keeping an eye on the model while seeing the horizon.THE TECHNOLOGY/SOCIAL CONTINUUMWorking in CAD, there are those who focus on drafting and those more adept at communication, negotiation, and persuasion. With BIM, technical understanding and people know-how must exist in each and every design professional.The majority of BIM-related literature has been focused on the technology, not on the people who use it. People issues and attitudes are the main impediment to the collaborative work processes enabled by the technology. Human issues, issues of communication and collaboration, firm culture, motivation, and workflow —all exacerbated by the advent of BIM into theworkplace — are an even greater challenge than the admittedly considerable software application and technical problems associated with BIM’s use.LEADING FROM THE MODELWorking in CAD, a senior team member would redline an emerging employee’s work. Leadership was decidedly top-down: Someone senior designed or detailed, and someone less senior drew it up. The problem was that the senior team member never knew whether the emerging employee understood what was being drawn.Working in BIM provides a completely different work flow — one we have yet to leverage fully. Because those on the front lines are not only the first to discover clashes and inconsistencies but also to visualize what something looks like and how it might function, BIM allows our emerging talent to lead the process —to learn on the job while recognizing their power from their privileged position of the first look in the model.The new leadership mandate in this process is for architects to lead from their involvement in the BIM environment. Leading from the model can be likened to leading from the middle in that BIM requires and even enables followership, and servant- and situational-leadership, as opposed to top-down or command-and-control. While leadership historically has been top-down, working in BIM and on integrated teams changes that. Leading in BIM and integrated design is more similar to followership, in which middle managers lead from within the organization. Thus with BIM, the top-down and bottom-up approaches converge, where leading from the middle becomes leading from the model.BIM AND THE MASTER BUILDER TEAMArchitects who find themselves on increasingly large teams must find a way to lead and regain their voice in the design and construction process. If architects learn how to design buildings that are optimized to give owners, contractors, and other team members what they need — of high quality, low cost, sooner, with less waste, while acquiring the mindsets, attitudes, and skills necessary to collaborate with others — then architects will be trusted, newly esteemed, and return to their desired leadership role. What is critical is not that we linearly help emerging professionals move from technical experts to leaders but to be technical experts and project, team, and process leaders at the same time. Expertise is cultivated by creating the right conditions for experts to flourish; people cannot be forced to learn and grow.。
人事管理系统开发和设计外文文献翻译(含:英文原文及中文译文)文献出处:Dustin Marx. Personnel management system development and design [C]IEEE, 2015,3(1):11-20.英文原文Personnel management system development and designDustin MarxSummaryWith the rapid development of computer technology, computer applications in the popularity of business management, personnel management of enterprises using computers is imperative. For medium-sized enterprises, enterprises and efficient use of computer support to complete the daily affairs of labor and personnel management is to adapt to the modern enterprise system, encourage enterprises to labor and personnel management to scientific, standardized, a necessary condition; incomparable advantage of the computer to retrieve management rapid, easy to find, high reliability, large memory capacity, security and good, long life and low cost. These advantages can greatly improve the efficiency of personnel management, but also corporate scientific and standardized management, an important condition for integration with the world. Different companies have different human resources management system, which determines the different companiesneed different personnel management system.Choice of development toolsNow, the market can buy a lot of application development products, popular, and dozens. Currently the most popular in our market, the most used, most advanced development tools can be used as enterprise-level products:Microsoft's Visual BasicMicrosoft's Visual CBorland's DelphiJava, etc.In the current market, many application development tools for these, some stressed that the implementation of process flexibility and efficiency of language; and some emphasis on the visual application development tools to bring convenience and efficiency high, each with its own advantages and characteristics, but also to meet the needs of different users. However, the language of the flexibility and convenience tools are inextricably linked, and only a convenient tool, but did not support the language of flexibility, many specialized processing actions will need to spend several times the effort to deal with, so the efficiency of the original advertisedloss of a role in improving the advantage; the contrary, if the language only emphasizes the flexibility of process continued, but no convenient tool for co-ordination will make some verysimple interface, even if the deal moves, programmers will be a serious waste of valuable time.As the database system development, Visual Basic is an ideal choice. MIS database is an important enabling technology in the MIS development process, how to choose the database management is an important issue, at present, the database more products, each product has its own characteristics and scope, therefore, the choice of database should consider the characteristics of database applications and application, the system's database language used Visual Basic language, the development tool has many advantages:Visual Basic is a visual, object-oriented and event-driven article by the way of structured high-level programming, can be used to develop the type of Windows environment applications. It is easy to learn, efficient, and powerful, with professional development tools, Windows SDK comparable to, and application developers do not have the C / C + + Programming. In the Visual Basic environment, the use of event-driven programming mechanism, novel-to-use visual design tools, the use of Windows internal application program interface (API) functions, and dynamic-link library (DLL), Dynamic Data Exchange (DDE), Object Linking and Embedding (OLE), Open Data Access (ODBC) technology, can efficiently and quickly developed a Windows environment, powerful, rich graphical user interface application software system.In general, Visual Basic has the following characteristics:Visual Programming:Traditional programming language design program, are designed by writing code to the user interface, the interface design process do not see the actual display, run the program to be compiled can be observed. If you are not satisfied with the effect of the interface, but also return to the program changes. Sometimes, this programming - Compiler - Change the operation may be repeated several times, greatly affected the efficiency of software development. Visual Basic provides a visual design tool, the complexity of the Windows interface design "package" together, developers do not have a lot of interface design and write press the screen layout design, using system tools to draw on the screen various "parts", that is, graphical objects, and set the properties of these graphical objects. Visual Basic code automatically generated interface design, programmers need only write the part to achieve functionality of the program code, which can greatly improve the efficiency of program design.Object-oriented programmingVisual Basic support for future object-oriented programming, but it is the general object-oriented programming language (C + +) are not identical. In general object-oriented programming language, object code and data from the composition of an abstract concept; and Visual Basic isthe application of object-oriented programming methodology (OOP), the programs and data encapsulated as an object and should be given for each object the attributes of the object as something real. In the design of objects, without writing to establish and describe each object code, but with the tool to draw the interface, Visual Basic automatically generates the object code and package it. Each object is displayed graphically in the interface are visible. Structured programming languageVisual Basic is based on the BASIC language developed, high-level programming language with sentence structure, similar to the logic of natural language and human thinking. Visual Basic statements easy to understand, its editor supports color code, can automatically check for syntax errors, but also has powerful and flexible to use debugger and compiler.Visual Basic is an interpreted language, enter the code at the same time, decomposition of high-level language interpretation system will be translated into machine instructions the computer can recognize and judge each statement syntax error. Visual Basic procedures in the design process, you can always run the program, and in the whole process a good design, you can compile an executable file (. EXE), from the Visual Basic environment, directly in the Windows environments.Event-driven programming mechanismVisual Basic object through the event to perform the operation. Anobject may have multiple events, each event are available through a program to respond. For example, the command button is an object, when the user clicks the button, will generate a "click" (CLICK) event, but in the production of the event will execute a program used to implement the specified operation.In the design of large-scale applications using Visual Basic software, without creatinga clear beginning and end of the procedure, but the preparation of a number of small subroutines that process. These processes are aimed at different objects, an event triggered by the user to drive the completion of a particular function or procedure called by the generic event-driven process to perform the specified operation, so that programmers can easily and improve efficiency.Access to the databaseVisual Basic has a powerful database management features, the use of data control and database management window, you can directly create or deal with Microsoft Access database format, and provides powerful data storage and retrieval capabilities. At the same time, Visual Basic can also directly edit, and access to other external databases, such as DBASE, FoxPro, Paradox, etc. These database format can be edited and processed using Visual Basic.Visual Basic provides an open data connection, the ODBC functions,can be established through direct access or use the connection and operation of large-scale network database backend such as SQL Server, Oracle and so on. In the application, you can use structured query language SQL data standards, direct access to the server database and provides a simple object-oriented database instructions and multi-user database access locking mechanism and network programming SQL databasestechnology for stand-alone databases running on the SQL network interface to a distributed environment, fast and effective implementation of client / server (client / server) programs.Dynamic Data Exchange (DDE)Using Dynamic Data Exchange (Dynamic Data Exchange) technology, an application can dynamically link the data to another application, so that two completely different applications, establish a dynamic data link. When the original data changes, you can automatically update the linked data. Visual Basic provides the programming dynamic data exchange technology, the application program with other Windows applications to create dynamic data exchange between different applications to communicate. Object Linking and Embedding (OLE) Object Linking and Embedding (OLE) to each application as an object (object), to link different objects (link) up, and then embedded (embed) an application, which can be a sound, image, image, animation, text and other information collection style technology is Microsoft'sstrategic corporate object technology, which the multiple applications into one, as each application for an object linking and embedding, is an application integration technology. Using OLE technology, you can easily build composite documents (compound document), this document from a number of different application objects, each object in the document and linked to the original application, and perform with the original application the same operation. Dynamic link library (DLL)Visual Basic is an advanced programming language, do not have low-level language functions, the operation of the access to the machine hardware is not easy to implement. But it could be dynamic link library technology will C / C + + or assembly language programs to Visual Basic applications, you can call the same function as the internal call functions written in other languages. In addition, the dynamic link library, you can call the Windows application program interface (API) function has the function to achieve SDK.Systems research and feasibility analysisResearchBefore the formal development of management information system is necessary for research, the need for mainly the following aspects.(1) To the user's request to conduct a feasibility analysis of the survey results confirm the feasibility of system development.(2) The staff of the new system not all systems researchers, somepeople process data for its function and no clear understanding of the method. They only work according to their business needs requests, system developers to conduct a detailed survey and analysis to confirm the user's requirements can be achieved through the existing computer technology to ensure the development of management information system functions and user submitted required match.(3) the existing business system may be a manual system, it could be used and the computer system, no matter the circumstances, the current system should be investigated in detail the specific circumstances of information processing, functional structure within the system in order to design a reasonable, good new system logic model for the design of the new system to lay the foundation to ensure the quality of the entire system development.In short, the current system is necessary to conduct a detailed investigation, a clear user needs, to ensure the development of new system functions consistent with the user's requirements and avoid a lot of manpower, material and financial resources, the development of the new system is the failure of the tragedy.Overview of Feasibility StudyFeasibility analysis is the user's requirements and system on the basis of research conducted on the development of new systems of social, technical, economic, management, analysis and development of newsystems come feasible, not feasible, need to modify , additional investment, the suspension of development, step by step and other programs and conclusions, and finally complete the feasibility analysis. Feasibility analysis of the general can be defined as: a feasibility analysis early in the construction of a project study and appraisal of the proposed project to conduct a comprehensive and integrated technical and economic capacity of the investigation to determine whether it is feasible.(1) the feasibility study stage of the work include the following:Objective analysis of whether the new system status and business development needs. ②social feasibility analysis:Social feasibility analysis mainly refers to the management information system development is consistent with national law, bad policy, whether we can achieve a good social system and docking.③technical feasibility analysis:Technical feasibility analysis is based on the new system aims to measure whether they have the required technology, including the number and level of system developers, hardware, software and other application technologies.④economic feasibility analysisEconomic feasibility analysis is mainly on the development of capital invested in new systems and systems put into use to compare the economic benefits to confirm whether the new system will bring someeconomic benefits companies.⑤management feasibility analysis:Management feasibility analysis is to analyze existing enterprise management system and whether the business leaders of modern management awareness and management.Technical feasibility analysisTechnical feasibility analysis includes four aspects: the current technology can support the new systems developed; the new system the number and level of developers, namely, human resources; hardware and software resources.(1) Technical Support:First, the target under the new system, considering the current technology can support the new systems developed. Technology must be discussed here has been widely used, not to be studied or are studying.(2) hardware resources:Development of management information system hardware resources needed to contain the following two aspects:System developers in the management of information systems development process needed computer equipment and related peripheral equipment; management information system used successfully, use the unit should have the computer equipment and related peripherals. Feasibility analysis of the hardware resources, the main consideration forthe host computer memory, the type, function, network capacity, security measures and the input / output devices, external storage and data communication networking equipment configuration, function, efficiency, compliance with system solutions and other indicators design requirements, but also consider the computer's performance / price ratio.(3) software resourcesFeasibility of software resources are the main consider the following to meet user requirements:①Select the operating system;②build system choice;③choice of database management system;④high-level programming language of choice;⑤character processing system selection;⑥application package choice.In the development of this system before, with the center's leadership and the close communication operators, seriously listen to their views and absorb their positive view of the development of the system to a large extent, has some advanced and reasonable .中文译文人事管理系统的开发和设计作者:Dustin Marx概要:随着计算机技术的飞速发展, 计算机在企业管理中应用的普及, 利用计算机实现企业人事管理势在必行。
对一类超混沌图像加密算法的密码分析与改进 摘要 This Letter proposes two different attacks on a recently proposed image based on hyper-chaos. The cryptosystem under study proceed first by shuffling the image rows and columns to disturb the high correlation among pixels by iterating the logistic map. Second, a keystream is generated to mix it with the pixels of the shuffled image using hyper-chaos. These two processes in the encryption stage present weakness, and a chosen plaintext attack and a chosen ciphertext attack can be done to recover the ciphered-image without any knowledge of the key value. It just demands three couples of plaintext/ciphertext to break totally the cryptosystem.
关键字:Cryptanalysis, Chaotic encryption ,Keystream ,Hyper-chaos ,Shuffle 1 介绍 Some researchers have pointed out that there exists tight relationship between chaos and cryptography [1–7]. Many fundamental characteristics of chaos, such as the ergodicity, mixing and exactness property and the sensitivity to initial conditions, can be connected with the “confusion” and “diffusion” property in cryptography. So it is a natural idea to use chaos to enrich the design of new ciphers. As a consequence, there have been proposed many chaotic ciphers in a very huge variety of design. We are interested on those dedicated to the image encryption. Image encryption is somehow different from text encryption due to some inherent features of image, such as bulk data capacity and high correlation among pixels. So far, many chaos-based image cryptosystems have been proposed [8–18]. Although a number of them have been cryptanalyzed, many others have not been effectively attacked like the one in [8]. In this Letter, we propose to break the image encryption algorithm proposed by T. Gao and Z. Chen in [8]. First, this paper gives a detailed introduction of the cryptosystem, as a basis of the whole Letter. The image encryption scheme under study consists of two parts: The image encryption based on total shuffling matrix, and the mixing operation of the shuffled image with a keystream generated
from a hyper-chaotic system. First, an image of size N × M is considered, every
pixel of this plain image is noted Pi, j, with i = 0, . . . ,M − 1 and j = 0, . . . , N − 1. By using the logistic map given by Eq. (1) departing from an initial condition
x0:
After some iterations n, a new x0 is derived from the final iteration xn and a number hi is calculated: The iteration of the logistic map will continue until getting M different data between 0 and M − 1 noted hi , i = 0, . . . ,M −1. Then rearrange the rows of the
plain image P according to {hi , i = 0, . . . ,M − 1}. hi will be the ith row in the shuffled rows image noted Ph. Then, this process is repeated to shuffle the column position of every row in Ph to obtain a totally shuffled image in rows and columns Phl . The equation used to calculate the position of the shuffled column of every
row is:
for every column i = 1, . . . ,M and row j = 1, . . . , N. Second, an hyper-chaotic system given by (4) is used:
The encryption scheme is based on the combination of state variables of the above hyper-chaotic system according to these steps: (1) First, the system on (4) is iterated for N0 times. (2) Four variables are generated from the hyper-chaotic system and then transformed to integers applying the following:
(3) Generate .x1 using the following: According to the value of .x1, three variables (B1, B2, B3) from the four variables (x1, x2, x3, x4) generated from (5) are chosen to perform encryption operation using
an association table (for more details to perform this step, the reader is advised to see Table 2 in Ref. [8]). And then, three pixels from the plain shuffled image
Phl are mixed with the keystream Bk, k = 1, . . . , 3, like the following: Pi and Ci , i = 1, 2, . . . , N×M, represent the pixel of the plain shuffled image
Phl and the ciphered image C, respectively.
(4) Continue on iterating the hyper-chaotic system, and go to step (2) until the whole image is totally ciphered.
The decryption algorithm is similar to the encryption algorithm. hat is, for the encrypted image, firstly, decrypt the image using hyper-chaotic system with the same parameters and initial values as that used in encryption, and then anti-shuffle the resulting image, we will get the original image. As claimed in [8], the initial values of Logistic map and hyper-chaotic system are used as secret keys. For more details, the reader is referred to [8].