物流管理英文文献以及翻译
An internet-based logistics management system for enterprise chains
N. Prindezis, C.T. Kiranoudis
School of Chemical Engineering, National Technical University, 15780 Athens,
Greece
Received 13 September 2003; received in revised form 20 December 2003; accepted
27 January 2004
Available online 10 December 2004
Abstract
This paper presents an Internet-Based Logistics Management System to coordinate and disseminate tasks and related information for solving the heterogeneous vehicle routing problem using appropriate metaheuristic techniques, for use in enterprise chain net works. Its architecture involves a JA VA Web applet equipped with interactive communication capabilities between peripheral software tools. The system was developed in distributed software fashion technology for all computer platforms utilizing a Webbrowser, focusing on the detailed road network of Athens and the needs of the Athens Central Food Market enterprises. 2004 Elsevier Ltd. All rights reserved.
Keywords: Decision support system; e-Logistics; Transportation; V ehicle routing problem
1.Introduction
Enterprise chains are the business model of the present and future regarding markets that involve small and medium company sizes. Clearly, grouping activities towards a focused target facilitates an understandably improved market penetration guaranteed by a successful trade mark of a leading company in the field. Several collaboration models that basically include franchising are introduced as a part of this integrated process. When such a network is introduced in order to exploit a commercial idea or business initiative and subsequently expanded as market penetration grows, several management issues arise regarding the operations of the entire network. Such a network is the ideal place for organizing and evaluating in a more centralized way several ordinary operations regarding supply chain and logistics Infact, tools developed for organizing management processes and operational needs of each individual company, can be developed in a more centralized fashion and the services provided by the tool can be offered to each network member to facilitate transactions and tackle operations similarly. Web-based applications are an ideal starting place for developing such applications. Typically such systems serve as a central depot for
distributing common services in the field of logistics. The commercial application is stored in a central server and services are provided for each member of the group. A prototype of such a server is described in a previous work (Prindezis, Kiranoudis, & Marinos-Kouris,2003). This paper presents the completed inter net system that is installed in the central web server of the Athens Central Food Market that deals with the integrated problem of distribution for 690 companies that comprise a unique logistics and retail chain of enterprises. The needs of each company are underlined and the algorithms developed are described within the unified internet environment. The problem solved and services provided for each company is the one involving distribution of goods through a heterogeneous fleet of trucks. New insights of the metaheuristics employed are provided. A characteristic case study is presented to illustrate the effectiveness of the proposed approach for a real-world problem of distribution through the detailed road network of Athens.
2. Distribution through heterogeneous vehicle fleets
The fleet management problem presented in this paper requires the use of a heterogeneous fleet of vehicles that distribute goods through a network of clients (Tarantilis, Kiranoudis, & V assiliadis, 2003, 2004).Therefore, the system was designed in order to automatically generate vehicle routes (which vehicles should de- liver to which customers and in which order), using rational, quantitative, spatial and non-spatial information and minimizing simultaneously the vehicle cost and the total distance travelled by the vehicles, subject to the following constraints:
●each vehicle has a predetermined load capacity, typically different from all other
vehicles comprising the fleet (heterogeneous nature),
●the capacity of a vehicle cannot be exceeded,
● a single vehicle supplies each customers demand,
●the number of vehicles used is predetermined.
The problem has an obvious commercial value and has drawn the attention of OR community. Its great success can be attributed to the fact that it is a very interesting problem both from the practical and theoretical points of view. Regarding the practical point of view, the distribution problem involved definitely plays a central role in the efficiency of the operational planning level of distribution management, producing economical routes that contribute to the reduction of distribution costs, offering simultaneously significant savings in all related expenses (capital, fuel costs, driver salaries). Its Importance in the practical level, motivated in tense theoretical work and the development of efficient algorithms.
For the problem by academic researchers and professional societies in OR/MS, resulting in a number of papers concerning the development of a number of V ehicle Routing Information Systems (VRIS) for solving the problem. The problem discussed is an NP-hard optimization problem, that is to say the global optimum of the problem can only be revealed through an algorithm of exponential time or space complexity
with respect to problem size. Problems of this type are dealt with heuristic or metaheuristic techniques. Research on the development of heuristic algorithms (Tarantilis & Kiranoudis, 2001,2002a, 2002b) for the fleet management problem has made considerable progress since the first algorithms that were proposed in the early 60s. Among them, tabu search is the champion (Laporte, Gendreau, Potvin, & Semet,2000). The most powerful tabu search algorithmsare now capable of solving medium size and even largesize instances within extremely small computational environments regarding load and time. On the algorithmic side, time has probably come to concentrate on the development of faster, simpler (with few parameters) and more robust algorithms, even if this causes a small loss in quality solution. These attributes are essential if an algorithm is to be implemented in a commercial package. The algorithm beyond the system developed is of tabu search nature. As mentioned before, since the algorithms cannot reveal the guaranteed global optimum, the time that an algorithm is left to propose a solution to the problem is of utmost importance to the problem. Certainly, there is a trade-off between time expected for the induction of the solution and its quality. This part was implemented in a straightforward way. If the system is asked by the user to produce a solution of very high quality instantly, then an aggressive strategy is to be implemented. If the user relaxes the time of solution to be obtained, that is to say if the algorithm is left to search the solution space more effciently, then there is room for more elaborate algorithms.
The algorithm employed has two distinct parts. The first one is a generalized route construction algorithm that creates routes of very good quality to be improved by the subsequent tabu phase. The construction algorithm takes into account the peculiarities of the heterogeneous nature of fleet and the desire of the user to use vehicles of his own desire, owned or hired, according to his daily needs.
The Generalized Route Construction Algorithm employed, is a two-phase algorithm where unrouted customers are inserted into already constructed partial solutions. The set of partial solutions is initially empty, and in this case a seed route is inserted that contains only the depot. Rival nodes to be inserted are then examined.
All routes employed involve single unrouted customers. The insertion procedure utilizes two criteria c1(i,u,j) and c2(i,u,j) to insert a new customer u between two adjacent customers i and j of a current partial route. The first criterion finds the best feasible insertion point (i *,j *) that minimizes the Clark and Wright saving calculation for inserting a node within this specific insertion point,
C1(i,u,j)=d(I,u)+d(u,j)-d(I,j) (1)
In this formula, the expression d(k,l) stands for the actual cost involved in covering the distance between nodes k and l. The Clark and Wright saving calculation introduced in this phase serves as an appropriate strong intensification technique for producing initial constructions of extremely good quality, a component of utmost necessity in tabu improvement procedure.
The second phase involves the identification of the actual best node to be inserted between the adjacent nodepair (i* ,j *) found in the first phase (Solomon, 1987).From all rival nodes, the one selected is the one that maximizes the expression
C2 (i*, u, j *)=[d(0,u)+d(u,0)]- C1(i*, u, j *) (2)
where 0 denotes the depot node. The expression selected is the travelling distance directly from/to the depot to/ from the customer and the additional distance expressed by the first criterion. In all, the first phase of the construction algorithm seeks for the best insertion point in all possible route seeds and when this is detected, the appropriate node is inserted. If no feasible node is found, a new seed route, containing a single depot, is inserted.
The algorithm iterates until there are no unrouted nodes. It must be stretched that the way routes are filled up with customers is guided by the desire of the user regarding the utilization of his fleet vehicles. That is to say, vehicles are sorted according to the distribution and utilization needs of the dispatcher. V ehicles to be used first (regarding to user cost aspects and vehicle availability) will be loaded before others that are of lower importance to the user. Typically, all users interviewed expressed the desire for the utilization of greater tonnage vehicles instead of lower tonnage, so vehicles for loading were sorted in descending order of capacity.
For the subsequent aggressive part of the algorithm a tabu search metaheuristic was implemented. The basic components of this algorithm employed in this application are the neighbourhood definition, the short-term memory and the aspiration criterion.
2.1. Neighbourhood
The neighbourhood is defined as a blend of the most favorable local search moves that transforms one solution to another. In particular, in its tabu search iteration the type of move adopted is decided stochastically. A predefined probability level is assigned to each move type. After that, it is decided whether the move operation is performed within a single route or between different routes, once more stochastically. This time, for both operations, the probability level is assigned a value of 50%. Subsequently, the best neighbour that the selected move implies is computed. The move types employed are the 2-Opt move (Bell et al., 1983), the 1–1 Exchange move (Evans& Norback , 1985), the1–0 Exchangemove (Evans & Norback, 1985), on both single route and different routes.
2.2. Short-term memory
Short-term memory, known as tabu list, is the most often used component of tabu search. Tabu list is imposed to restrict the search from revisiting solutions that were considered previously and to discourage the search process from cycling between subsets of solutions. For achieving this goal, attributes of moves, more precisely the reversals of the original ones, are stored in a tabu list. The reversal moves that contain attributes stored in tabu list are designated tabu and they are excluded from the search process. Regarding the tabu search variant implemented, these attributes are the nodes involved in the move (all the moves used in the this method can be characterized by indicating only two nodes) and the corresponding routes where these nodes belong to. The number ofiterations that arcs’mobility is restricted is known as tabu list size or tabu tenure. The management of the tabu list is achieved by removing the move which has been on the tabu list longest.
2.3. Aspiration criterion
The aspiration criterion is a strategy for overriding the short-term memory functions. The tabu search method implemented, uses the standard aspiration criterion: if a move gives a higher quality solution than the best found so far, then the move is selected regardless its tabu status.
Tabu Search algorithm terminates when the number of iterations conducted is larger than the maximum number of iterations allowed.
3. Developing the internet-based application tool
Web services offer new opportunities in business landscape, facilitating a global marketplace where business rapidly create innovative products and serve customers better. Whatever that business needs is, Web services have the flexibility to meet the demand and allow to accelerate outsourcing. In turn, the developer can focus on building core competencies to create customer and shareholder value. Application development is also more efficient because existing Web services, regardless of where they were developed, can easily be reused.
Many of the technology requirements for Web services exist today, such as open standards for business to-business applications, mission-critical transaction platforms and secure integration and messaging products. However, to enable robust and dynamic integration of applications, the industry standards and tools that extend the capabilities of to days business-to-business interoperability are required. The key to taking full advantage of Web services is to understand what Web services are and how the market is likely to evolve. One needs to be able to invest in platforms and applications today that will enable the developer to quickly and effectively realize these benefits as well as to be able to meet the specific needs and increase business productivity.
Typically, there are two basic technologies to be implemented when dealing with internet-based applications; namely server-based and client-based. Both technologies have their strong points regarding development of the code and the facilities they provide. Server-based applications involve the development of dynamically created web pages. These pages are transmitted to the web browser of the client and contain code in the form of HTML and JAVASCRIPT language. The HTML part is the static part of the page that contains forms and controls for user needs and the JA VASCRIPT part is the dynamic part of the page. Typically, the structure of the code can be completely changed through the intervention of web server mechanisms added on the transmission part and implemented by server-based languages such as ASP, JSP, PHP, etc. This comes to the development of an integrated dynamic page application where user desire regarding problem peculiarities (calculating shortest paths, execute routing algorithms, transact with the database, etc.) is implemented by appropriately invoking different parts of the dynamic content of such pages. In server-based applications all calculations are executed on the server. In client-based applications, JAVA applets prevail. Communication of the user is guaranteed by the well-known JA VA mechanism that acts as the medium between the user and code.
Everything is executed on the client side. Data in this case have to be retrieved, once and this might be the time-consuming part of the transaction.
In server-based applications, server resources are used for all calculations and this requires powerful server facilities with respect to hardware and software. Client-based applications are burdened with data transmission (chiefly related to road network data). There is a remedy to that; namely caching. Once loaded, they are left in the cache archives of the web browser to be instantly recalled when needed.
In our case, a client-based application was developed. The main reason was the demand from the users point of view for personal data discretion regarding their clients. In fact, this information was kept secret in our system even from the server side involved.
Data management plays major role in the good function of our system. This role becomes more substantial when the distribution takes place within a large and detailed road network like this of a major complex city. More specifically, in order to produce the proposed the routing plan, the system uses information about:
●the locations of the depot and the customers within the road network of the city
(their co-ordinates attached in the map of the city),
●the demand of the customers serviced,
●the capacity of the vehicles used,
●the spatial characteristics of road segments of the net work examined,
●the topography of the road network,
●the speed of the vehicle, considering the spatial characteristics of the road and the
area within of which is moved,
●the synthesis of the company fleet of vehicles.
Consequently, the system combines, in real time, the available spatial characteristics with all other information mentioned above, and tools for modelling, spatial, non-spatial, and statistical analysis, image processing forming a scalable, extensible and interoperable application environment.
The validation and verification of addresses of customers ensure the accurate estimation of travel times and distances travelled. In the case of boundary in the total route duration, underestimates of travel time may lead to failure of the programmed routing plan whereas overestimates can lower the utilization of drivers and vehicles, and create unproductive wait times as well (Assad, 1991). The data corresponding to the area of interest involved two different details. A more detailed network, appropriately for geocoding (approximately 250,000 links) and a less detailed for routing (about 10,000 links). The two networks overlapped exactly. The tool that provides solutions to problems of effectively determining the shortest path, expressed in terms of travel time or distance travelled, within a specific road network, using the Dijkstra’s algorithm(Winston,1993). In particular, the Dijkstra’s algorithm is used in two cases during the process of developing the routing plan. In the first case, it calculates the travel times between all possible pairs of depot and customers so that the optimizer would generate the vehicle routes connecting them and in the second case it determines the shortest path between two involved nodes (depot or customer)
in the routing plan, as this was determined by the algorithm previously. Due to the fact, that U-turn and left-,right-turn restrictions were taken into consideration for network junctions, an arc-based variant of the algorithm was taken into consideration (Jiang, Han, & Chen, 2002).
The system uses the optimization algorithms mentioned in the following part in order to automatically generate the set of vehicle routes (which vehicles should deliver to which customers and in which order) minimizing simultaneously the vehicle costs and the total distance travelled by the vehicles This process involves activities that tend to be more strategic and less structured than operational procedures. The system helps planners and managers to view information in new way and examine issues such as: ●the average cost per vehicle, and route,
●the vehicle and capacity utilization,
●the service level and cost,
●the modification of the existing routing scenario by adding or subtracting
customers.
In order to support the above activities, the interface of the proposed system provides a variety of analyzed geographic and tabulated data capabilities. Moreover, the system can graphically represent each vehicle route separately, cutting it o? from the final routing plan and offering the user the capability for perceiving the road network and the locations of depot and customers with all details.
4. Case study
The system developed was used in the Central Food Market of Athens, Greece. The specific Market involves 2 an area of 320,000m in the south-west region of Athens greater area (Agios Ioannis Rentis, Athens, Greece) at the boundary of port of Pireaus, Greece. This Market is basically a hybrid of two submarkets; the first one involves fresh vegetables and fruits and the second one fresh meat. A Central Food Market is an organization that involves numerous small enterprises that sell and distribute fresh food products, chiefly fresh vegetables, fruits fish and meat. It is considered to be the place where supply and demand come together and where prices are determined in conditions of transparency and open exchange. Every day, the market is visited by thousands of operators and traders who consider it the best place in which to carry out their transactions. The market is used by companies specializing in the food sector, traditional retailers, the city markets, supermarkets, hypermarkets, hotel and catering establishments.
The fresh vegetables and fruits market involves 690 small and medium enterprises that cover an area of 2 7,100m , while the Meat market involves 105 small 2 and medium enterprises that cover an area of 6050m . As a complementary area to the Markets, Athens Central Food Market has a Services and Warehouses Area, to serve the growing economic activity generated by the Food Unit. Cash& Carry, purchase centers, distribution and logistics, storage, handling and packaging, cold stores
available for rent, motor vehicle services .Inshort, all the services operators required. The market need for effcient logistics requires specialization and investment (trucks, cold stores, etc.), in order to be competitive and provide the growing level of service demanded. Every day, this market complex offers a selection of fruits and vegetables, both in the range of products and varieties and in the sheer volume on offer, which makes it the largest fruit and vegetable market in Greece and one of the largest in Europe. Athens Central Market responds to the challenge of effciently and reliably serving the most important food sector in Greece, offering a wide variety of vegetables, fruits, meats, meat products in unrivalled conditions of hygiene and safety. The Meat Market is concerned not only with distribution but also with production. Many farmers participate directly in the Athens Central Market, as it actively promotes products with denomination of origin and quality certificates. Athens Central Market installations involve roughly 500 parking places.
The application can be found at the internet address http://www.okaa.gr/router/default.asp, through secure cookie entrance. The system was appropriately coded in the form of a java applet encapsulated in a Web page accessible by the users through the Web Server of the organization. There were several restrictions that were taken into consideration as user requirements. The application had to be compact, user-friendly, the data entered that would concern a specific enterprise could not be transparent to others, including the organization and full reports ready to use by truck drivers had to be generated.
5. Conclusions
This paper presented an system to coordinate and disseminate tasks and related spatial and non-spatial information for solving the heterogeneous vehicle routing problem using metaheuristic algorithms. This system used to automatically generate vehicle routing plans such that all customers demands were met, no constraints were violated and a combination of vehicle costs and distance travelled was minimized. The architecture of the system was based on an integrated JAV A Web Applet equipped with interactive communication capabilities between peripheral software tools. The system that was developed in distributed software fashion technology for all Web browsers running on any platform, and it was successfully applied to the area of Greater Athens for the benefits of Athens Central Food Market enterprises.
基于互联网的连锁企业的物流管理系统
N. Prindezis，C.T. Kiranoudis
化工学院，国立技术大学，15780雅典，希腊
收到2003年9月13日，在经修订的形式收到的2003年12月20号，接受
2004年1月27日
可在线二〇〇四年十二月十日
摘要
本文介绍了一种基于Internet的物流管理系统，以协调和传播解决异构车辆路径问题采用适当的启发式技术，任务和相关信息，为企业的连锁网络作品的使用。其体系结构包括一个JA VA的Web小程序与外设之间的互动沟通的软件工具的功能配备。该系统的开发方式，在分布式软件技术的所有电脑使用一个WebBrowser平台，在雅典的详细道路网络为重点和雅典中央食品市场企业的需要。2004 Elsevier公司保留所有权利。
关键词：决策支持系统，电子物流，运输，车辆路径问题
1、前言
企业连锁经营模式是对当前及未来的市场，包括中小型公司规模。显然，使集团的重点目标是可以理解的活动有利于提高市场占有率由一家公司成功的商标保证在外地。几个合作模式，基本上包括引入特许经营作为这一进程的一部分。当这种网络的引入，以利用商业理念或企业的倡议，并随后扩大市场渗透率的增长，若干管理问题方面出现的整个网络的运作。这种网络是组织和较集中的方式对一些普通业务供应链和物流从评估的理想场所，工具，组织管理流程及个别公司的业务需要开发的，可以更集中的方式发展和该工具提供的服务可以提供给每个网络成员促进交易和处理业务类似。基于Web的应用是一个理想的起点为开发此类应用的地方。通常这些系统作为分配在物流领域的共同服务的中心仓库。商业应用存储在中央服务器和服务的每个组的成员提供。
一个这样的服务器原型描述了以前的工作（Prindezis，Kiranoudis，库里斯，2003年）。
本文介绍了完成跨网系统，在雅典中央副食品批发市场中央Web服务器上安装的处理分配690公司，包括一个独特的物流和零售连锁企业的整合问题。每家公司的需要是强调和算法开发的范围内统一的网络环境描述。解决问题和服务的每一个公司提供的是一个涉及通过混合车队的卡车货物分配。严谨启发式解法为就业提供新的见解。阿特征的案例研究，提出说明，通过详细的道路网络雅典的一个现实世界的分布问题提出方法的有效性。
2、通过异构车队分布
该舰队管理问题本文提出需要的车辆混合车队使用的方式来分配网络的客户货物
（Tarantilis，Kiranoudis，及阿迪斯，2003，2004）。因此，该系统是为了设计，自动生成车辆路线（即车辆应提供哪些客户的顺序），使用合理，数量，空间和非空间信息和车辆，同时尽量减少成本和总距离行驶的车辆，须符合下列限制：
●每辆车有一个预先确定的负载能力，通常是由组成的船队（异质性）的所有
其他车辆不同，
●车辆的能力，不能超越，
●一个单一的汽车用品每个客户的需求，
●所用车辆的数目，预先确定的。
这个问题具有明显的商业价值，已引起或社会的关注。它的巨大成功可以归功于以下事实：这是一个无论从实用的角度来看，和理论很有趣的问题。关于实际角度来看，问题所涉及的分布起着一定的分配管理的业务水平，提高效率的中央计划的作用，产生经济的路线，有助于降低分销成本，同时提供显着的一切有关费用节省（资本，燃料费用，司机工资）。它的重要性，在实践上，在紧张的理论工作动机和高效率的算法。
对于学术研究机构及专业团体在OR / MS分析问题，在一个关于解决问题的车辆路由信息系统（VRIS）数量发展论文的数目。讨论的问题是一个NP难
优化问题，即在全球的优化问题只能通过对指数的时间和空间复杂度算法透露有关问题的大小。存在的问题与启发式或启发式技术对付这种类型。对启发式算法的开发研究（Tarantilis＆Kiranoudis，2001,2002~2002年）为车队管理问题，取得了自认为是在60年代初首次提出的算法相当大的进展。其中，禁忌搜索是冠军（拉波特，根德罗，普托文，及Semet，2000）。最强大的搜索演算法现在是解决中等规模，甚至大型工程在时间方面的负荷，极少数情况下，能够计算环境。在算法方面，时间大概要集中精力，快，简单（与发展的几个参数）和更强大的算法，即使这导致在品质的解决方案小的损失。这些属性是必不可少的，如果一个算法是在一个商业软件包实施。
发达国家以外的系统算法是搜索的性质。如前所述，由于算法可以保证没有透露全局最优的一个算法是留给提出解决问题的时间是非常重要的问题。当然，有一个与贸易之间的休息时间的解决方案，并诱导其质量的预期。这部分是执行一个简单的方法。如果系统询问用户生产出高品质的解决方案，即刻，那么积极的战略的实施程序。如果用户放松时间的解决方案要获得，也就是说，如果该算法留下来搜索解空间更高效，那么就有更加详细的算法空间。
该算法采用了两个不同的部分。第一个是广义的路线构造算法创建质量很好的路线，被后面的阶段改善。建造算法考虑到了车队的不同性质和特点的用户希望利用自己的意愿拥有或租用的车辆，根据他的日常需要。
广义算法就是，是一个两阶段算法在未布线客户到已建成的部分解决方案插入。部分解决方案的设置最初是空的，在这种情况下，插入种子路线只包含仓库。竞争对手节点插入，然后检查所有路线就业涉及单未布线的客户。插入过程采用两个标准的C1（i，u，j）和C2（i，u，j）之间插入两个相邻的客户提供了新的客户用户接口和当前部分路线?。第一个标准，找到最佳可行插入点（i*，j*）最小化的在这个特定的插入点插入一个节点的计算，
C1(i,u,j)=d(I,u)+d(u,j)-d(I,j) (1)
在这个公式中，D表达式（k，1）代表在覆盖节点之间的距离，k和湖所涉及的实际成本克拉克和赖特的节能计算在这个阶段推出可作为适当的生产结构的初步非常好的质量，在改善过程中是极为必要组成强有力的加强技术。
第二阶段是实际确定最佳节点之间必须相邻节点插入（i*，j *）在第一阶段（所罗门，1987年）发现。从所有竞争对手节点，选择一个最大化的表达
C2 (i*, u, j *)=[d(0,u)+d(u,0)]- C1(i*, u, j *) (2)
其中0表示车厂节点。表达式选择行驶距离是直接从/到站到/从客户和额外的距离表示。
由第一个标准，总之，建筑算法的第一阶段要求在所有可能的途径种子最佳的插入点，当这是检测到相应的节点插入。如果没有找到可行的节点，一个新的种子路线，其中包含一个仓库，插入。
该算法迭代，直到没有未布线节点。必须延伸路线的方式与客户充满了由有关用户的愿望指导。
车队车辆的利用率。这就是说，车辆进行排序按照分配和调度运用的需要。车辆首先要使用（关于用户的成本和车辆方面的情况）将提交给别人，而较低的重要性，用户加载。通常情况下，所有用户访问表示有更大吨位的车辆，而不是利用低吨位的愿望，因此，装载车辆降序秩序的能力。
对于随后的搜索算法的启发式实施积极的一部分。在此应用程序采用这种算法的基本组成部分是附近的定义，短期记忆和期望的标准。
2.1 邻里
附近的定义是最有利的本地搜索动作，变换另一种解决办法融合。特别是，通过在其禁忌搜索迭代的移动类型随机决定。预定义的概率水平，分配给每个移动类型。在此之后，决定是否执行移动操作是在一个单一的路线或不同的路线，再次随机。这一次，这两个行动的概率水平分配50％的价值。随后，最好的邻居说，此举意味着选择计算。此举类型就业是2选项移动（贝尔等人。，1983），交易所将在1-1（埃文斯与努尔贝克，1985），当前第1页- 0 移动交换（埃文斯与努尔贝克，1985年），单路和不同路线。
2.2 短期记忆
短期记忆，因为禁忌名单称为，是禁忌搜索最常用的组成部分。禁忌名单去限制从重新被认为以前并劝阻，从解决方案的子集之间的循环搜索过程的解决办法。为实现这一目标，属性的动作，更准确地原有的的逆转，被存储在一个禁忌名单。逆转动作，包含属性禁忌列表存储在指定禁忌，他们在搜索过程之外。关于禁忌搜索变种实施，这些属性是在移动过程中的节点（所有的动作
中使用的这种方法可以通过指出只有两个节点的特点）和在这些节点属于相应的路线。这个数字是；灵活限制被称为禁忌列表的大小或禁忌的任期。禁忌的列表管理是通过消除已禁忌名单上最长的已移动。
2.3 标准意愿
标准的愿望是压倒一切的短期记忆功能的策略。禁忌搜索方法的实施，使用标准的期望标准：如果此举给出了更高质量的最佳解决方案，比迄今为止发现的话，将被选中，不论其禁忌的地位。禁忌搜索算法终止时的迭代次数进行比允许的最大数量较大的迭代。
3、发展基于互联网的应用工具
Web服务提供的商业景观的新机会，促进全球市场在业务快速推出创新的产品和客户提供更好的服务。无论是企业需要的是，Web服务可以灵活地满足需求，并允许加速外包。反过来，开发人员可以专注于构建核心竞争力，创造客户和股东价值。应用程序开发，也更有效，因为现有的Web服务，无论他们在那里开发的，可以很容易地重用。
对网络服务的技术要求，很多今天存在的，如营业标准，业务应用，关键任务交易平台和安全的一体化和信息产品。不过，为使强大和动态系统的综合应用，行业标准和工具，扩大天的业务能力，对企业的互操作性是必需的。在采取了充分利用网络服务的关键是要了解什么是Web服务，以及如何在市场可能发生变化。人们需要能够在今天的平台和应用的投资，使开发人员快速而有效地实现这些好处，也能够满足特定需求，提高企业的生产力。
通常，有两种实施处理时，互联网的应用程序，即基于服务器和基本技术，基于客户的。这两种技术
有自己的长处对代码的发展和它们所提供的设施。服务器的应用程序涉及的动态创建的网页的发展。这些网页传送给客户端的网络浏览器和包含在HTML和JavaScript语言形式的代码。部分的HTML的网页，其中包含形式和用户需求和JavaScript的部分控制部分是静态页面的动态部分。通常情况下，代码的结构完全可以通过干预机制的Web服务器上的改变增加
传动部分和服务器实现基于如ASP，JSP，PHP和语言等，这涉及到一个综合的动态网页应用程序开发的用户希望有关问题的特殊性（计算最短路径，执行路由算法，处理与数据库，等）是通过适当援引这些网页的动态内容的不同部分。在基于服务器的所有应用
计算在服务器上执行。在客户端的应用程序，Java小程序为准。用户的通信保障由著名的JA VA的机制，充当用户的代码。
一切都执行在客户端。在这种情况下的数据必须被检索，一次，这可能是费时的交易的一部分。在服务器的应用程序，服务器资源是所有计算中，这就要求有关的硬件和软件功能强大的服务器设施。基于客户端的应用程序与数据传输负担（主要是与道路网络数据）。有一个该补救方法，即缓存。一旦加载，他们留在Web浏览器的快取档案将在需要时立即召回。
就我们而言，客户端的应用程序的开发。主要的原因是从有关个人资料的客户自行查看用户的用电量。事实上，这些信息是保密的，甚至在我们的系统从服务器涉及的方面。数据管理在我们的制度好职能的主要作用。这种作用变得更为实质性的分配时，需要在一个像一个大的城市大型复杂和详细的道路网进行。更具体地说，为了生产计划提出的路线，系统使用的信息：
●在城市道路网在车厂地点和客户（他们统筹重视在城市地图）接受服务
的客户的需求，
●所用车辆的能力，
●的净工作道路部分的空间特征研究，
●道路网地形，
●车辆的速度，考虑到道路的空间特征和地区范围内的移动，
●该公司车队车辆的合成。
因此，该系统结合实时，可用空间特征与上述其他所有信息，以及造型，空间，非空间，和统计分析工具，图像处理形成一个可伸缩，可扩展和可互操作的应用环境。验证和核查，确保客户的地址的旅行时间和旅行距离准确估计。在边界线的总时间的情况，可能导致低估了，而高估了编程路由计划可以降低司机的利用和失败的旅行时间车辆，并建立非生产性等待时间，以及（阿萨德，
1991）。数据对应感兴趣的区域，涉及两个不同的细节。更详细的网络，适当地地理编码（约250,000链接）和更少的路由（约10,000个链接）详细。两个网络完全重叠。该工具提供了解决方案有效地确定最短路径问题，在旅行时间和旅行距离来计算，在一个特定的道路网络，利用Dijkstra算法（温斯顿，1993年）。特别是，Dijkstra算法是在两种情况下使用，在发展过程中的路由计划。在第一种情况，它计算之间的车厂和可能对所有客户的旅行时间，以便优化器将生成的车辆路线连接并在第二种情况下它决定了涉及两个节点（仓库或客户中）最短路径路由计划，因为这是确定先前的算法。由于这样的事实，即掉头和左，右转向限制是考虑到网络的路口，一个弧形的算法的变种考虑（江，韩，及陈，2002）。
该系统使用的算法在以下部分中提到的优化，以自动生成车辆路线设置（即车辆应提供哪些客户的顺序），同时最大限度地减少车辆的费用和总距离行驶的车辆，这一过程涉及活动往往更具有战略性和业务程序不到结构。该系统可以帮助规划人员和管理人员，以查看新的方式的信息和研究的问题，例如：
●每辆车的平均成本，和路线，
●车辆和产能利用率，
●服务水平和成本，
●通过增加或减少客户现有的路由方案的修改。
为了支持上述活动，拟议的系统接口提供了各种分析和列的地理数据功能。此外，该系统可以图形方式表示每辆汽车的路线分别削减它从最后的路由计划和为用户提供了感知的道路网络，并与所有细节车厂和客户的地点的能力。
4、案例研究
该系统研制的用于中央食品市场的希腊雅典。具体的市场涉及2 32万平方米的西南地区大面积在雅典的比雷埃夫斯，希腊港口边界（Ioannis伦蒂斯，雅典，希腊）地区。这个市场基本上是两亚市场杂交种;的第一项是新鲜蔬菜和水果，第二个鲜肉。阿中央粮食市场是一个组织，涉及众多的小企业，销售和分发新鲜食品，主要是新鲜蔬菜，水果，鱼和肉。它被认为是地方供求走到一起，在
价格中的透明度和公开交换条件决定的。每天，市场是由访问的运营商和贸易商谁认为这是最好的地方，进行他们的交易数以千计。市场是利用在粮食部门的专业公司，传统的零售商，在城市市场，超市，大卖场，酒店和食肆。新鲜的蔬菜和水果市场，涉及690中小型企业，涵盖了21700平方米面积，而肉类市场涉及105个小型和中小型企业，涵盖了6050平方米领域。作为补充的市场领域，雅典环副食品批发市场的服务业和仓库区，为日益增长的经济活动所产生的食品股。现购自运，采购中心，分销和物流，仓储，装卸和包装，可租用冷库，汽车服务、所有的服务运营商需求。对于高效率的物流市场的需求，需要专业化和投资（车，冷藏库等），以具有竞争力和提供的服务水平要求越来越多。每一天，这个市场提供了一个复杂的水果和蔬菜的选择，在产品的品种和发行量巨增，这使得它的各种中，最大的水果和蔬菜市场，在希腊和欧洲最大的之一。雅典中央市场响应了高效挑战和可靠地服务于希腊最重要的粮食部门，提供蔬菜，水果，肉类，在卫生和安全条件的肉类产品无与伦比的多种。在肉类市场关注的是，不仅分布，而且与生产。许多农民直接参与雅典中央市场，因为它积极推动与原产地和产品质量认证证书面额。雅典中央市场设施包括约500个停车位。
应用程序可在互联网地址http://www.okaa.gr/router/default.asp，通过安全Cookie的入口。该系统在适当的编码在一个封装的网页，通过该组织的Web 服务器的用户访问了Java applet的形式。有报道说，考虑到了用户需求数的限制。应用程序必须紧凑，方便用户，输入的数据，将特定的企业的关注不能是透明的其他方面，包括组织和备用卡车司机等。
5、结论
提出一种制度，以协调和传播任务和有关空间和非解决异构车辆路径问题使用启发式算法的空间信息。用于自动生成车辆调度计划等，所有客户的要求得到满足，没有任何限制，受到侵犯和车辆费用组合和路程的距离减少到最低限度这一制度。该系统的架构是基于JA VA的网络集成外设之间的互动沟通的软件工具性能都有小程序。即在分布式软件技术开发的方式为所有网站在任何平台上运行的浏览器系统，它成功地应用于雅典中部的食品市场企业的利益在雅典地区。
八大菜系的英文翻译
八大菜系的英文翻译 No. 1 Sichuan Cuisine 川菜 Specialties Include: (特别推荐) pockmarked bean curd 麻婆豆腐 chicken cubes with peanuts 宫保鸡丁 pork shreds with fishy flavour 鱼香肉丝 translucent beef slices 水晶牛片 No.2 Guangdong cuisine 粤菜 Specialties include: roasted sucking pig 烤乳猪 fricassee three kinds of snakes and cat 三蛇龙虎凤大会 steamed turtle with chives sauce 虾夷葱酱汁清炖甲鱼 king snake with bamboo slices 蛇王炒鸡丝 gourd cups 汤类 No. 3 Shandong Cuisine 山东菜系 dezhou grilled chicken 炙鸡 b ird’s nest in a clear soup quick-boiled clam 龙凤酸辣汤 lotus flower and shrimp 青辣椒镶虾 No. 4 Huaiyang Cuisine (also known as Weiyang Cuisine) 苏州菜yincai vegetalbes cooked with chicken slices 鸡汤煮干丝 crab meat & minced pork ball in casserole 清炖蟹粉 chicken mousse broth with fresh corn squid with crispy rice crust 桃花饭
《化学工程与工艺专业英语》课文翻译 完整版
Unit 1 Chemical Industry 化学工业 1.Origins of the Chemical Industry Although the use of chemicals dates back to the ancient civilizations, the evolution of what we know as the modern chemical industry started much more recently. It may be considered to have begun during the Industrial Revolution, about 1800, and developed to provide chemicals roe use by other industries. Examples are alkali for soapmaking, bleaching powder for cotton, and silica and sodium carbonate for glassmaking. It will be noted that these are all inorganic chemicals. The organic chemicals industry started in the 1860s with the exploitation of William Henry Perkin‘s discovery if the first synthetic dyestuff—mauve. At the start of the twentieth century the emphasis on research on the applied aspects of chemistry in Germany had paid off handsomely, and by 1914 had resulted in the German chemical industry having 75% of the world market in chemicals. This was based on the discovery of new dyestuffs plus the development of both the contact process for sulphuric acid and the Haber process for ammonia. The later required a major technological breakthrough that of being able to carry out chemical reactions under conditions of very high pressure for the first time. The experience gained with this was to stand Germany in good stead, particularly with the rapidly increased demand for nitrogen-based compounds (ammonium salts for fertilizers and nitric acid for explosives manufacture) with the outbreak of world warⅠin 1914. This initiated profound changes which continued during the inter-war years (1918-1939). 1．化学工业的起源 尽管化学品的使用可以追溯到古代文明时代，我们所谓的现代化学工业的发展却是非常近代（才开始的）。可以认为它起源于工业革命其间，大约在1800年，并发展成为为其它工业部门提供化学原料的产业。比如制肥皂所用的碱，棉布生产所用的漂白粉，玻璃制造业所用的硅及Na2CO3. 我们会注意到所有这些都是无机物。有机化学工业的开始是在十九世纪六十年代以William Henry Perkin 发现第一种合成染料—苯胺紫并加以开发利用为标志的。20世纪初，德国花费大量资金用于实用化学方面的重点研究，到1914年，德国的化学工业在世界化学产品市场上占有75%的份额。这要归因于新染料的发现以及硫酸的接触法生产和氨的哈伯生产工艺的发展。而后者需要较大的技术突破使得化学反应第一次可以在非常高的压力条件下进行。这方面所取得的成绩对德国很有帮助。特别是由于1914年第一次世界大仗的爆发，对以氮为基础的化合物的需求飞速增长。这种深刻的改变一直持续到战后（1918-1939）。 date bake to/from: 回溯到 dated: 过时的，陈旧的 stand sb. in good stead: 对。。。很有帮助
酒店各部门英文缩写
酒店各部门英文缩写 总经理办公室:GM 人力资源部:HR 财务部:FN 餐饮部:F&B 客房部:HSKP 工程部:ENG 保安部:SEC 康乐部:ENT 前厅部:FO 销售部:S&M 市场传讯部MC Marketing Communications DEPARTMENT 酒店各职位英文缩写 GM---GENERAL MANAGER 总经理 DGM---DUTY GENERAL MANAGER 副总 DOR---DIRECTOR OF ROOMS 客务部总监 AM---ASSISTANT MANAGER 大堂经理 DOM---DIRECTOR OF SALES&MARKETING 销售部总监 FO---FRONT OFFICE 前厅部 FOM---FRONT OFFICE MANAGER 前厅部经理 CON---CONCIERGE 礼宾部 BC---BUSINESS CENTER 商务中心 F&B---FOOD&BEVERAGE 餐饮部 ENG---ENGINEERING 工程部 HR---HUMAN RESOURCES 人力资源部 FN---FINANCIAL DEPARTMENT 财务部 FC---FINANCIAL CONTROLLER财务总监 行政总厨 A.T.K Administrative total kitchen
收益管理经理 Revenue Manager RECP---RECEPTION 接待处 HSKP---HOUSEKEEPING DEPARTMENT客房中心酒店职位英语 董事长 Board Chairman (Director) 董事总经理Managing Director 经济师Economist 首席会计师 Chief Accountant 总经理General Manager 副总经理Deputy General Manager (Vice) 驻店经理Resident Manager 总经理行政助理Executive Assistant Manager 总经理秘书Executive Secretary 总经理室Executive Office (G.M office) 机要秘书Secretary 接待文员Clerk 副总经理Vice General Manager 总经理助理Assistant to General Manager 总经理秘书Secretary to General Manager 行政秘书Executive Secretary 人力资源部Human Resources Division 人事部Personnel Department 培训部Training Department 质检部Quality Inspection Department 员工关系部 Staffing Relationship Department 人力资源开发总监Director of Human Resources 人事培训经理P&T Manager 人事部经理Personnel Manager 培训部经理Training Manager 质检部经理Quality Inspection Manager
污水处理 英文文献3 翻译
丹宁改性絮凝剂处理城市污水 J.Beltrán-heredia，J.ánche z-Martin 埃斯特雷马杜拉大学化学工程系和物理化学系,德埃娃儿，S / N 06071，巴达霍斯，西班牙 摘要 一种新的以丹宁为主要成分的混凝剂和絮凝剂已经过测试用以处理城市污水。TANFLOC 证实了其在浊度的去除上的高效性（接近100%，取决于剂量），并且近50%的BOD5和COD 被去除，表明TANFLOC是合适的凝集剂，效力可与明矾相媲美。混凝絮凝剂过程不依赖于温度，发现最佳搅拌速度和时间为40转/每分钟和30分钟。多酚含量不显著增加，30%的阴离子表面活性剂被去除。沉淀过程似乎是一种絮凝分离，所以污泥体积指数和它随絮凝剂剂量的改变可以确定。证明TANFLOC是相当有效的可用于污水处理的混凝絮凝剂。 关键词: 基于丹宁的絮凝剂城市污水絮凝天然混凝剂 1．简介 人类活动是废物的来源。特别是在城市定居点，来自家庭和工业的废水可能是危险有害的产品[ 1 ]，需要适当的处理，以避免对环境[ 2 ]和健康的影响[ 3,4 ]。2006年12月4日联合国大会通过决议宣布2008为国际卫生年。无效的卫生基础设施促使每年220万人死于腹泻，主要在3岁以下儿童，600万人因沙眼失明，两亿人感染血吸虫病，只是为了给出一些数据[ 5 ]。显然，他们中的大多数都是在发展中国家，所以谈及城市污水，必须研究适当的技术来拓宽可能的处理技术种类。 在这个意义上，许多类型的水处理被使用。他们之间的分歧在于经济和技术特点上。了摆脱危险的污染[ 6 ]，一些令人关注的论文已经发表的关于城市污水处理的几种天然的替代方法，包括绿色过滤器、化学初步分离、紫外消毒[ 7 ]和多级程序[ 8 ]。 几个以前的文件指出了城市污水管理[9,10]的重要性。这种类型的废物已成为社会研究的目标，因为它涉及到几个方面，都与社会结构和社会组织[11 ]相关。根据这一维度，必须认识到废水管理作为发展中国家的一种社会变化的因素，事关污水处理和生产之间的平衡，是非常重要的，一方面，人类要发展，另一方面，显而易见。 对水处理其它程序的研究一直是这和其他文件的范围。几年来，研究者关注的是发展中国家间的合作，他们正在致力于水处理的替代过程，主要考虑可持续发展，社会承受能力和可行性等理念。在这个意义上，自然混凝絮凝剂这一广为传播，易于操作的资源即使是非专业人员也不难操作。有一些例子，如辣木[ 14 ]和仙人掌榕[ 15 ]。丹宁可能是一个新的混凝剂和絮凝剂。 一些开拓者已经研究了丹宁水处理能力。 ?zacar和sengil [ 16 ]：从瓦罗NIA获得的丹宁，从土耳其的autoctonous树的果壳中获得丹宁，并用于他们的–污水混凝絮凝过程。他们表明，丹宁有很好的效果，结合Al2（SO4）3可进一步提高污泥去除率。 詹和赵[ 17 ]试着用丹宁为主要成分的凝胶作为吸收剂除去水中的铝，丹宁凝胶改进了金属去除过程，一定意义上也可参照Nakano等人的[ 18 ]，Kim 和Nakano[ 19 ]。 ?zacar和sengil [ 20 ]加强以前的文章给出了关于三卤甲烷的形成和其他不良化合物特殊的数据，以及处理后的水质安全。他们始终使用丹宁与Al2（SO4）3的组合。 帕尔马等人将丹宁从辐射松的树皮为原位提取，用于重金属去除中聚合固体。树皮本
酒店专用术语中英文定稿版
酒店专用术语中英文 HUA system office room 【HUA16H-TTMS2A-HUAS8Q8-HUAH1688】
(1)Accommodation(住宿)：提供的给予睡觉休息的场所。 (2)AdjoiningRoom(邻近房)：指两间房间近连在一起。 (3)AdvancedDeposit(订金)：客人为了确保能有房间而提前支付给酒店一笔直按金。 (4)AdvancePayment（预付金/押金）：按照酒店财务规定和有关规定，前台服务员要求客人预先支付房费和不可预测费用的付费方式，如现金担保、信用卡预授权。 (5)Amenity（致意品）：指酒店免费向住店客人提供的一些礼品，如水果、鲜花或饮品等。 (6)Arrival(到店)：指客人入住酒店的抵店，如：ArrvialDate。 (8)Block(预告锁房)：指为了把某间房能够保留下来，而提前把此房间在某日锁起来，使其在该时间段显示被占用，有利于控制房间的预售。 (9)Cancellation(取消)：指客人取消订房。 (10)Check-In：指客人登记入住酒店，包括机场登机手续也是同样的叫法。 (11)Check-Out：指客人结账离开酒店。 (12)Complimentary(免费)：指由总经理批准提供给某个客人的不需要收费的房间，即COMP。
(13)Confirmation(确认)：指酒店发给订房客人的一种十分详细的订房书而协议，承认客人在将来的某一天有权居住在本酒店。另，机票中的往返票，连程票，在中转途中要求做位置的Comfirmation，否则航空公司有权取消该位置而转售他人。 (14)Connecting(连通房)：指两间房中间有一扇门连通起来的房间。 (15)CorporateRate(公司合同价)：指与酒店有协议而提供给公司的客人的房间价格，这类价格通常为特别价，且保密。 (16)CreditCard(信用卡)：指由银行签发的一种可以作为交易的卡片，代替现金支付的凭证。 (17)ExpectedDepartureDate(预离日期):指客人预计离店的日期。 (18)DoubleSale(双重出售)：指两个没有关系的客人，被错误地安排入住同一间房。 (19)预离未离房：指某个房间应该是空房，但到了中午十二点以后，客人仍然没有退房。 (20)EarlyArrival(提前抵达)：在下午两点以前到达酒店办理入住手续的客人。 (21)Extension(续住)：经过批准后的客人延长居住。另外，有分机的意思，如ExtensionNumber1102，表达分机号1102，通常表述为Ext.No.1102。其动词Extend，续住又可以说成Extendedstay. (22)ExtraBed(加床)：一般应收费。
外文文献翻译——参考格式
广东工业大学华立学院 本科毕业设计（论文） 外文参考文献译文及原文 系部经济学部 专业经济学 年级 2007级 班级名称 07经济学6班 学号 16020706001 学生姓名张瑜琴 指导教师陈锶 2011 年05月
目录 1挑战：小额贷款中的进入和商业银行的长期承诺 (1) 2什么商业银行带给小额贷款和什么把他们留在外 (2) 3 商业银行的四个模型进入小额贷款之内 (4) 3.1内在的单位 (4) 3.2财务子公司 (5) 3.3策略的同盟 (5) 3.4服务公司模型 (6) 4 合法的形式和操作的结构比较 (8) 5 服务的个案研究公司模型：厄瓜多尔和Haiti5 (9)
1 挑战：小额贷款中的进入和商业银行的长期承诺 商业银行已经是逐渐重要的运动员在拉丁美洲中的小额贷款服务的发展2到小额贷款市场是小额贷款的好消息客户因为银行能提供他们一完整类型的财务的服务，包括信用，储蓄和以费用为基础的服务。整体而言，它也对小额贷款重要，因为与他们广泛的身体、财务的和人类。如果商业银行变成重的运动员在小额贷款，他们能提供非常强烈的竞争到传统的小额贷款机构。资源，银行能廉宜地发射而且扩张小额贷款服务rela tively。如果商业广告银行在小额贷款中成为严重的运动员，他们能提出非常强烈的竞争给传统的小额贷款机构。然而，小额贷款社区里面有知觉哪一商业银行进入进入小额贷款将会是短命或浅的。举例来说，有知觉哪一商业银行首先可能不搬进小额贷款因为时候建立小额贷款操作到一个有利润的水平超过银行的标准投资时间地平线。或，在进入小额贷款，银行之后可能移动在－上面藉由增加贷款数量销售取利润最大值－或者更坏的事，退出如果他们是不满意与小额贷款的收益性的水平。这些知觉已经被特性加燃料商业银行的情形进入小额贷款和后来的出口之内。在最极端的，一些开业者已经甚至宣布，”降低尺度死！”而且抛弃了与主意合作的商业银行。 在最 signific 看得到的地方，蚂蚁利益商业银行可能带给小额贷款，国际的ACCION 发展发射而且扩张的和一些商业银行的关系小额贷款操作。在这些情形的大部分方面， ACCION 和它的合伙人正在使用方法，已知的当做服务公司模型，表演早答应当做一个能工作的方法克服真正的。 商业银行的障碍进入和穿越建立长命的小额贷款操作一个商业银行 这论文描述如何服务公司模型、住址商业银行中的主要议题进入进小额贷款，监定成功建立的因素动作井小额贷款服务公司，和礼物结果和小额贷款的课servic e 公司用最长的经验，在海地和审判官席 del 的 SOGEBANK│ SOGESOL 初期结果指出那这服务公司模型表现一重要的突破在促成商业银行进入和留在小额贷款。在厄瓜多尔的 Pichincha│ CREDIFE。初期结果指出服务公司模型在促成商业广告中表现一次重要的突破银行进入而且留在小额贷款。
各专业的英文翻译剖析
哲学Philosophy 马克思主义哲学Philosophy of Marxism 中国哲学Chinese Philosophy 外国哲学Foreign Philosophies 逻辑学Logic 伦理学Ethics 美学Aesthetics 宗教学Science of Religion 科学技术哲学Philosophy of Science and Technology 经济学Economics 理论经济学Theoretical Economics 政治经济学Political Economy 经济思想史History of Economic Thought 经济史History of Economic 西方经济学Western Economics 世界经济World Economics 人口、资源与环境经济学Population, Resources and Environmental Economics 应用经济学Applied Economics 国民经济学National Economics 区域经济学Regional Economics 财政学（含税收学）Public Finance (including Taxation) 金融学（含保险学）Finance (including Insurance) 产业经济学Industrial Economics 国际贸易学International Trade 劳动经济学Labor Economics 统计学Statistics 数量经济学Quantitative Economics 中文学科、专业名称英文学科、专业名称 国防经济学National Defense Economics 法学Law 法学Science of Law 法学理论Jurisprudence 法律史Legal History 宪法学与行政法学Constitutional Law and Administrative Law 刑法学Criminal Jurisprudence 民商法学(含劳动法学、社会保障法学) Civil Law and Commercial Law (including Science of Labour Law and Science of Social Security Law ) 诉讼法学Science of Procedure Laws
毕业设计_英语专业论文外文翻译
1. Introduction America is one of the countries that speak English. Because of the special North American culture, developing history and the social environment, American English has formed its certain unique forms and the meaning. Then it turned into American English that has the special features of the United States. American English which sometimes also called United English or U.S English is the form of the English language that used widely in the United States .As the rapid development of American economy, and its steady position and strong power in the world, American English has become more and more widely used. As in 2005, more than two-thirds of English native speakers use various forms of American English. The philologists of the United States had divided the English of the United States into four major types: “America n creating”; “Old words given the new meaning”; “Words that eliminated by English”;“The phonetic foreign phrases and the languages that are not from the English immigrates”[1]. Compared to the other languages, American English is much simple on word spelling, usage and grammar, and it is one of the reasons that American English is so popular in the world. The thesis analyzes the differences between American English and British English. With the main part, it deals with the development of American English, its peculiarities compared to that of British English, its causes and tendency. 2. Analyses the Differences As we English learners, when we learning English in our junior or senior school, we already came across some words that have different spellings, different pronunciations or different expressions, which can be represented by following contrasted words: spellings in "color" vs. "colour"; pronunciations in "sec-re-ta-ry" vs. "sec-re-try";
八大菜系英文简介
China covers a large territory and has many nationalities, hence a variety of Chinese food with different but fantastic and mouthwatering flavor. Since China's local dishes have their own typical characteristics, generally, Chinese food can be roughly divided into eight regional cuisines, which has been widely accepted around. Certainly, there are many other local cuisines that are famous, such as Beijing Cuisine and Shanghai Cuisine. 中国地域辽阔，民族众多，因此各种中国饮食口味不同，却都味美，令人垂涎。因为中国地方菜肴各具特色，总体来讲，中国饮食可以大致分为八大地方菜系，这种分类已被广为接受。当然，还有其他很多著名的地方菜系，例如北京菜和上海菜。 Shandong Cuisine 山东菜系 Consisting of Jinan cuisine and Jiaodong cuisine, Shandong cuisine, clear, pure and not greasy, is characterized by its emphasis on aroma, freshness, crispness and tenderness. Shallot and garlic are usually used as seasonings so Shangdong dishes tastes pungent usually. Soups are given much emphasis in Shangdong dishes. Thin soup features clear and fresh while creamy soup looks thick and tastes strong. Jinan cuisine is adept at deep-frying, grilling, frying and stir-frying while Jiaodong division is famous for cooking seafood with fresh and light taste. 山东菜系，由济南菜系和胶东菜系组成，清淡，不油腻，以其香，鲜，酥，软而闻名。因为使用青葱和大蒜做为调料，山东菜系通常很辣。山东菜系注重汤品。清汤清澈新鲜，而油汤外观厚重，味道浓重。济南菜系擅长炸，烤，煎，炒，而胶东菜系则以其烹饪海鲜的鲜淡而闻名。 Shandong is the birthplace of many famous ancient scholars such as Confucious and Mencius. And much of Shandong cuisine's history is as old as Confucious himself, making it the oldest existing major cuisine in China. But don't expect to gain more wisdom from a fortune cookie at a Shandong restaurant in the West since fortune cookies aren't even indigenous to China. 山东是许多著名学者的故乡，例如孔夫子和孟子。许多山东菜的历史和孔夫子一样悠久，使得山东菜系成为中国现存的最古老的主要菜系之一。但是不要期望在西方国家的山东菜馆里从签饼(中国餐馆的折叠形小饼,内藏有预测运气话语的纸条)获得更多的好运气，因为签饼在中国也不是本土的。 Shandong is a large peninsula surrounded by the sea to the East and the Y ellow River meandering through the center. As a result, seafood is a major component of Shandong cuisine. Shandong's most famous dish is the Sweat and Sour Carp. A truly authentic Sweet and Sour Carp must come from the Y ellow River. But with the current amount of pollution in the Y ellow River, you would be better off if the carp was from elsewhere. Shandong dishes are mainly quick-fried, roasted, stir-fried or deep-fried. The dishes are mainly clear, fresh and fatty, perfect with Shandong's own famous beer, Qingdao Beer
酒店手册(含英文翻译)
酒店手册含英文翻译 前台服务 接待：(内线电话：2100、2101) 总台接待处24小时为阁下服务，为宾客办理住宿登记，提供相关信息查询。 订房：(内线电话：2108、2118、2035) 营销中心为客人提供客房预订服务。您若有订房需要，请与营销中心联系。 结帐：(内线电话：2102) 总台结帐处24小时为您提供交付押金、退房、结帐及帐务查询服务。住客可以用现金或酒店接受的信用卡支付您的房、餐、洗衣、 旅游咨询：（内线电话2035、2114） 为您提供旅游咨询，代办旅游业务。 外币兑换：(内线电话：2102) 总台收银处提供世界通用的主要货币兑换人民币服务。 贵重物品寄存处：(内线电话：2100、2101) 总台接待处免费为您提供贵重物品寄存服务。 行李处：(内线电话：2008) 住客需要行李搬运，请与大堂行李处联系，大堂设有免费行李寄存处。 失物招领：(内线电话：2106) 如果您发现物品遗失或招领失物，请与大堂副理联系。 商场：(内线电话：2090) 为您提供各色食品、茶叶、饮品、精美工艺品、旅游纪念品、日用百货，任您选购。
商务中心：(内线电话：2114、2117) 为您提供打字、复印、传真、旅游办理、订票、邮寄、出租电脑等服务，服务时间：7:30—21:00,其余时间可与前台联系. 客房服务 小酒吧：(内线电话：2121) 房内小酒吧酒水、小食品价格详见价格表，使用时签单认可。请阁下注意：酒水饮料一经开启，无论饮用与否，其费用即计入您的帐单。若需添加，请通知客房中心。 洗衣服务：(内线电话：2121) 如您需洗衣或熨烫衣服，请将衣服准备好，装入洗衣袋内，填好洗衣单，服务员于每日上午10时前收集,当天送回。酒店亦可办理5小时加快服务，最后收取时间为15点。阁下务必将衣服中物品取出，酒店不对衣袋内物品因洗涤导致的损失负责。 宽网服务：(内线电话：2121) 阁下房间内配备国际互联网“Internet”插口，提供免费上网服务。上网操作，请参照上网须知。 客房用品：(内线电话：2121) 客房内为阁下配备了多项客房用品，如您不慎损坏或遗失，敬请赔偿。如您想购买纪念，请与房务中心联系，其费用将记入您的账单。 请勿打扰：(内线电话：9) 当您需要清静时，可将“请勿打扰”牌挂在房门外把手上，并通知总机不要将电话转到您的房间。 钥匙： 酒店使用先进的IC卡门锁，请阁下留意，当超过您预住时
java毕业论文外文文献翻译
Advantages of Managed Code Microsoft intermediate language shares with Java byte code the idea that it is a low-level language witha simple syntax , which can be very quickly translated intonative machine code. Having this well-defined universal syntax for code has significant advantages. Platform independence First, it means that the same file containing byte code instructions can be placed on any platform; atruntime the final stage of compilation can then be easily accomplished so that the code will run on thatparticular platform. In other words, by compiling to IL we obtain platform independence for .NET, inmuch the same way as compiling to Java byte code gives Java platform independence. Performance improvement IL is actually a bit more ambitious than Java bytecode. IL is always Just-In-Time compiled (known as JIT), whereas Java byte code was ofteninterpreted. One of the disadvantages of Java was that, on execution, the process of translating from Javabyte code to native executable resulted in a loss of performance. Instead of compiling the entire application in one go (which could lead to a slow start-up time), the JITcompiler simply compiles each portion of code as it is called (just-in-time). When code has been compiled.once, the resultant native executable is stored until the application exits, so that it does not need to berecompiled the next time that portion of code is run. Microsoft argues that this process is more efficientthan compiling the entire application code at the start, because of the likelihood that large portions of anyapplication code will not actually be executed in any given run. Using the JIT compiler, such code willnever be compiled.
中国八大菜系代表作英文翻译
中国八大菜系代表作（英文翻译） No.1 Sichuan Cuisine Pockmarked bean curd Chicken cubes with peanuts Pork shreds with fishy flavour Translucent beef slices No. 2 Guangdong cuisine Roasted sucking pig Fricassee three kinds of snakes and cat Steamed turtle with chives sauce King snake with bamboo slices Gourd cups No. 3 Shandong Cuisine Dezhou grilled chicken Bird’s nest in a clear soup Quick-boiled clam Lotus flower and shrimp No. 4 Huaiyang Cuisine (also known as Weiyang Cuisine) Yincai vegetalbes cooked with chicken slices Crab meat & minced pork ball in casserole Chicken mousse broth with fresh corn Squid with crispy rice crust 川菜 麻婆豆腐 宫保鸡丁 鱼香肉丝 灯影牛肉 粤菜 烤乳猪 龙虎烩 清蒸甲鱼 笋片烧蛇 葫芦盅 鲁菜 德州扒鸡 清汤燕窝羹 油爆大蛤 荷花大虾 淮阳菜 蔬菜炒鸡片 砂锅蟹肉丸 奶油鸡丝玉米汤鱿鱼锅巴
常见的有机化学基团名称翻译
有机化学基团名称翻译 A 伸乙烷合萘基;伸二氢苊基acenaphtheneylene 亚乙烷合萘基;亚二氢苊基acenaphthenylidene 醋酰胺基;乙酰胺基acetamido; acetamino 乙炔基acetenyl;ethynyl 乙酰乙酰基acetoacetyl 丙酮基acetonyl 亚丙酮基acetonylidene 乙酰氧基acetoxy 乙酰基acetyl 乙酰亚胺基acetylimino 酸硝基aci-nitro 吖啶基acridinyl 丙烯酰基acrylyl; acryloyl 己二酰基adipoyl; adipyl 脲[基]羰基;脲甲酰基allophanyl; allophanoyl 烯丙基allyl 甲脒基amidino; guanyl 酰胺基amido 酰胺草酰基;草酰胺酰基amidoxalyl; oxamoyl 胺基amino 戊基amyl; pentyl 伸戊基amylene 亚戊基amylidene 亚戊基amylidene; pentylidene 苯胺基anilino 大茴香亚甲基;对甲氧苯亚甲基;对甲氧亚苄 基anisal; anisylidene 甲氧苯胺基anisidino 大茴香酰基;对甲氧苯甲酰基;对甲氧苄酰基anisoyl 大茴香亚甲基;对甲氧亚苄基;对甲氧苯亚甲 基anisylidene; p-methoxybenzylidene; anisal 邻胺苯甲酰基;邻胺苄酰基anthraniloyl; anthranoyl 蒽基anthranyl; anthryl 蒽醌基anthraquinonyl 伸蒽基;次蒽基anthrylene 精胺酰基arginyl 亚胂酸基arsinico 胂基arsino 胂酸基arsono 亚胂基arsylene 细辛基;2,4,5-三甲氧苯基asaryl; 2,4,5-trimethoxyphenyl 天[门]冬酰胺酰基asparaginyl; asparagyl 天[门]冬胺酰基aspartyl 阿托酰基;颠茄酰基;2-苯丙烯酰基atropoyl 壬二酰基azelaxyl 迭氮基;三氮基azido; triazo 偶氮亚胺基azimino; azimido 次偶氮基azino 偶氮基azo 氧偶氮基azoxy B 苯亚甲基;亚苄基benzal 苯甲酰胺基;苄酰胺基benzamido 苯亚磺酰基benzene sulfinyl; phenylsulfinyl 苯磺酰胺基benzenesulfonamido 苯磺酰基benzenesulfonyl 次苄基benzenyl; benzylidyne 二苯甲基benzhydryl; diphenylmethyl 二苯亚甲基benzhydrylidene; diphenylmethylene 联苯胺基benzidino 亚苄基;苯亚甲基benzilidene 二苯羟乙酰基benziloyl 苯并咪唑基benzimidazolyl 苯甲酰亚胺基benzimido; benzoylimino 亚胺苄基benzimidoyl; benzimidoyle 苯并呋喃基;熏草基benzofuryl 苯并哌喃基benzopyranyl 苯并【口+咢】【口+井】基benzoxazinyl 苯并【口+咢】唑基benzoxazolyl 苯甲酰氧基;苄酰氧基benzoxy; benzoyloxy 苯甲酰基;苄酰基benzoyl 伸苯甲酰基benzoylene 苯甲酰亚胺基benzoylimino; benzimido 苯甲酰氧基benzoyloxy; benzoxy 苄基;苯甲基benzyl 亚苄基;苯亚甲基benzylidene; benzylene; benzal 次苄基;苯次甲基benzylidyne; benzenyl 联苯基biphenylyl 【草(之上)+伯】基;龙脑基;冰片基;莰基bornyl; camphenyl 丁二烯基butadienyl 次丁烯基butenylidyne 丁氧基butoxy 丁基butyl 伸丁基butylene 亚丁基butylidene