Finding Optimal Addition Chains Using a Genetic Algorithm Approach
- 格式:pdf
- 大小:204.26 KB
- 文档页数:10
关于物流工作的英语作文Logistics is a critical component of modern business operations. It encompasses the planning, implementation, and control of the efficient and effective flow and storage of goods, services, and related information from the point of origin to the point of consumption. Logistics professionals play a vital role in ensuring that products and services are delivered to the right place at the right time, in the right condition, and at the optimal cost.One of the primary responsibilities of logistics professionals is transportation management. This involves coordinating the movement of goods from suppliers to customers, utilizing various modes of transportation such as trucks, trains, ships, and airplanes. Logistics professionals must consider factors such as delivery time, cost, and environmental impact when selecting the most appropriate mode of transportation. They also need to manage the logistics of warehousing and inventory, ensuring that products are stored efficiently and accessible when needed.Another key aspect of logistics is supply chain management.Logistics professionals work closely with procurement, production, and distribution teams to ensure that the entire supply chain operates smoothly. This includes managing relationships with suppliers, monitoring inventory levels, and coordinating the flow of materials and information throughout the supply chain. Effective supply chain management can lead to reduced costs, improved customer satisfaction, and increased competitive advantage.In addition to transportation and supply chain management, logistics professionals also play a role in customer service. They are responsible for ensuring that customers receive their orders on time and in good condition. This may involve tracking shipments, handling customer inquiries, and resolving any issues that may arise. Excellent customer service is essential for building and maintaining strong relationships with clients.One of the challenges faced by logistics professionals is the increasing complexity of global supply chains. As businesses expand their operations across borders, logistics professionals must navigate a variety of cultural, regulatory, and infrastructural differences. They must also be adept at using technology to optimize logistics operations, such as utilizing GPS tracking, warehouse management systems, and data analytics.Another challenge is the need to constantly adapt to changingmarket conditions and customer demands. Logistics professionals must be agile and responsive, able to quickly adjust their plans and strategies to accommodate new requirements or unexpected events. This may involve rerouting shipments, adjusting inventory levels, or implementing new technologies to improve efficiency.Despite these challenges, the logistics industry offers numerous opportunities for growth and career advancement. As businesses continue to seek ways to streamline their operations and reduce costs, the demand for skilled logistics professionals is expected to remain high. Logistics professionals can specialize in areas such as transportation, warehousing, supply chain management, or customer service, and can work in a variety of industries, from retail and manufacturing to healthcare and e-commerce.To succeed in the logistics field, individuals must possess a range of skills, including problem-solving, critical thinking, communication, and attention to detail. They must also be adept at using technology and data analysis tools to optimize logistics operations. Additionally, logistics professionals must be able to work collaboratively with cross-functional teams, as logistics often involves coordination with various departments within an organization.In conclusion, logistics is a dynamic and essential field that plays a crucial role in the success of modern businesses. Logisticsprofessionals are responsible for ensuring the efficient and effective flow of goods, services, and information throughout the supply chain. As the global economy continues to evolve, the demand for skilled logistics professionals will only increase, making it an attractive and rewarding career path for those with the right skills and mindset.。
曾长淦简历曾长淦,2007年8月被聘为中国科大教授,2008年入选中科院“百人计划”和教育部“新世纪优秀人才支持计划”,2011年被聘为中国科大唐仲英讲席教授。
主要从事低维凝聚态体系的构筑和新型电磁行为研究。
通过结合扫描隧道显微术和其它测量手段,对若干低维体系做了系统研究,发现了一些新型量子效应并揭示了其微观机制,比如:揭示了一维电荷序拓扑孤子激发的原子尺度行为;实现对一维体系电磁有序态的尺寸和压力调控;验证了理论预言的磁性离子在半导体薄膜中的“亚活性剂外延”奇异动力学途径,并以此实现高T c稀磁半导体;进一步澄清了反常霍尔效应这一基本自旋输运效应的起源;实验上实现超低温度的大面积石墨稀外延生长。
共发表SCI论文35篇, 包括1篇Nature Mater.,6篇Phys. Rev. Lett.,1篇Nature,1篇J. Am. Chem. Soc.。
总他引数938次,H因子为19。
近年来的代表性论文:1.H. Zhang, J.-H. Choi, Y. Xu, X. Wang, X. Zhai, B. Wang, C. Zeng*, J.-H. Cho*,Z. Zhang, and J. G. Hou, "Atomic structure, energetics, and dynamics of topological solitons in indium chains on Si(111) surfaces", Phys. Rev. Lett.106, 026801 (2011).2.Z. Li, P. Wu, C. Wang, X. Fan, W. Zhang, X. Zhai, C. Zeng*, Z. Li*, J. Yang, andJ. G. Hou, "Low-temperature growth of graphene by chemical vapor deposition using solid and liquid carbon sources" ACS Nano5, 3385 (2011).3. C. Zeng, P. R. C. Kent, T.-H. Kim, A.-P. Li, and H. H. Weitering, “Charge orderfluctuations in one-dimensional silicides”, Nature Mater.7, 539 (2008).4. C. Zeng, Z. Zhang, K. van Benthem, M. F. Chisholm, and H. H. Weitering,“Optimal doping control of magnetic semiconductors via subsurfactant epitaxy”, Phys. Rev. Lett.100, 066101 (2008).5. C. Zeng, Y. Yao, Q. Niu, and H. H. Weitering, “Linear magnetization dependenceof the intrinsic anomalous Hall effect”, Phys. Rev. Lett. 96, 37204 (2006).。
DOI: 10.12358/j.issn.1001-5620.2024.01.009钻井液用高性能增黏剂的研制及性能评价孙振峰, 杨超, 李杰, 张敬辉, 赵凯强, 王晨(中石化(大连)石油化工研究院有限公司, 辽宁大连 116045)孙振峰,杨超,李杰,等. 钻井液用高性能增黏剂的研制及性能评价[J]. 钻井液与完井液,2024,41(1):84-91. SUN Zhenfeng, YANG Chao, LI Jie, et al.Development and performance evaluation of a high performance drilling fluid viscosifier[J]. Drilling Fluid & Completion Fluid ,2024, 41(1):84-91.摘要 为了解决钻井液用增黏剂高温高盐易降解失效的问题,以两性离子单体N-甲基二烯丙基丙磺酸(MAPS )、甲基丙烯酰胺(MAC )、N-乙烯基吡咯烷酮(NVP )为聚合单体,以偶氮二异丁脒盐酸盐(AIBA )为引发剂,采用自由基共聚法合成了高性能增黏剂DV-1。
通过正交实验对合成过程中的主要影响因素进行了考察,确定了最佳合成条件:反应温度为50 ℃,单体浓度为40%,引发剂用量为0.4%,反应时间为4 h 。
利用FTIR ,1H-NMR ,TG-DTA 等方法对DV-1进行了表征测试,并对产物的增黏性能、抗高温抗盐性能及长效性能等进行了评价。
评价结果显示,1%的DV-1水溶液表观黏度可达44.7 mPa·s 。
180 ℃、16 h 高温老化后,溶液黏度保持率高达53.2%;DV-1对高浓度盐离子的耐受性能较好。
经180 ℃老化72 h 和120 h 后,溶液黏度保持率能够达到50.5%和40.7%,长效性能优异。
DV-1的半致死浓度EC 50值为30 200 mg·L −1,符合水基钻井液在海域的排放标准。
we knowthey knowS p e n d m a n a g e m e nt e-b u s i n e s sESM solutions put spend visibility in focus, giving your company the abilityto better identify trends, track expendi-tures and forecast for strategic planning. At the same time, you gain the abilityto standardize procurement processes and improve supplier connectivity and relationships. By helping to reduce pro-cess costs and maximize the value of every transaction, the benefi ts of ESM go straight to the bottom line.IBM and Ariba have joined forces to bring you a comprehensive solution designed from the ground up to manage and optimize enterprisewide spend.The IBM-Ariba alliance provides a suite of integrated offerings, leveraging IBMe-business expertise and the Ariba®Spend Management™ Suite, which enable you to manage, control and leverage the entire spend lifecycle.Pinpoint spending leaks. Plug them. Save. With ESM, chief fi nancial offi cers and procurement professionals fi nally have access to a single, centralized solution that puts them in control of spend.At the heart of the IBM-Ariba ESM solution is the Ariba Spend Management Suite, which integrates analysis, sourcing and procurement solutions to give youa straightforward approach to managing spend. Our solution will help you fi nd where you can save money, get the most savings possible and keep those savings on an ongoing basis. Analysis—fi nd savingsTo fi nd potential savings, your companymust scrutinize every spend processcategory.• Ariba® Analysis™ is an application thatenables you to collect and analyze com-plex spend data so you can understandcurrent spending patterns and identifyopportunities for improvement. AribaAnalysis provides a single repository ofaccurate spend data and easy-to-usetools to analyze that data, whichcan help your company identify sourc-ing opportunities, consolidate demandacross divisions and spot emergingtrends. Buyers are able to negotiatebetter pricing terms, and identifyingmaverick users who are not buying withcontracted suppliers becomes easier.Sourcing—get savingsThe ability to automate the sourcingprocess, negotiate better contracts withsuppliers and improve sourcing pro-ductivity is essential to reducing andcontrolling costs, and increasing savings.• Ariba® Enterprise Sourcing™ helps youachieve greater competitive advan-tage and profi tability by moving fromtraditional, event-based sourcing toenterprise sourcing. Ariba EnterpriseSourcing streamlines and automatesthe entire sourcing process, fromdefi nition and aggregation of spendingrequirements to supplier manage-ment, negotiation and establishmentof optimal contracts with suppliers.Buyers and suppliers can capturepurchasing trade-offs and optimizesourcing activities with fl exible biddingoptions and decision support tools.Procurement—keep savingsDriving widespread compliance withnegotiated contracts enables you to keepand sustain savings. The Ariba Procure-ment Solution provides plan-to-payfunctionality and requisitioning capabilityto help drive enterprisewide compliancewith negotiated contracts. Ariba Procure-ment Solution applications include:• Ariba® Buyer™—an integral part of theAriba Spend Management Suite andhub of the Ariba Procurement Solution.It provides requisition managementand online purchasing capabilities forall users and commodities. Ariba Buyersecurely automates the full buying cycle for improved management and tracking of spend. In addition to restricting maverick buying and other uncontrolled spending by driving com-pliance with negotiated contracts, Ariba Buyer delivers rapid cost savingsby increasing the effi ciency of the entire procurement process from requi-sition to payment—slashing transaction expenses, decreasing cycle times and leveraging supplier relationships.• Ariba® Contracts™—a new application that helps your procurement profes-sionals manage contract usage and compliance, and eliminate contract leakage. Ariba Contracts provides com-prehensive enterprisewide management of the entire contract lifecycle and pro-vides buyers access to a centralized repository of contracted products and services. From Ariba Contracts’ central-ized contract management tool, buyers can launch purchasing transactions, extend contracts, renegotiate service terms and monitor the compliance levels of suppliers. • Ariba® Invoice™—a new applicationthat automates and streamlines everystep in the invoicing process to helpyour company reduce reconciliationcycle times and improve exceptionhandling. Ariba Invoice replacesmanual and paper-intensive activitieswith effi cient electronic invoicing. AribaInvoice provides an intuitive user inter-face, robust workfl ow-based exceptionhandling and realtime supplier commu-nication for greater time, resource andcost effi ciencies.• Ariba® Workforce™—extends thebenefi ts and cost savings of ESM tothe procurement of temporary staffi ng,contractors and consulting services.By automating the complete workforceprocurement lifecycle, Ariba Workforceenables you to dramatically improveprocess effi ciency, cut costs, enhancesupplier collaboration and interaction,reduce billing and payment errors, andbetter understand and manage yourcontingent worker spend.The Ariba Spend Management Suite alsoincludes Ariba® Supplier Network™ (AribaSN), the most widely adopted globalcommerce network for transparent col-laboration between buyers, suppliers anddistribution channels, with over 32,000enabled vendors. Ariba SN providescompanies and their suppliers with asingle point of connection to facilitate allspend management processes.Industry-leading e-business know-how,infrastructure and support servicesIBM and Ariba provide advancedtechnology solutions and services tohelp businesses reap the greatestpossible benefi ts from ESM. Together,we can help your business rapidly inte-grate ESM solutions and cutting-edgetechnologies into your infrastructure tomaximize business opportunities.IBM offers a single point-of-contact,including hardware, software,services, support and fi nancing forquick implementation and dynamicexecution. IBM has built valuechains—using proven, comprehensivesolutions and services—for every indus-try. IBM capabilities encompass businesstransformation consulting, implementationand support services, middleware,hardware and outsourcing.“The IBM team expertly integrated Ariba Buyer withour backend enterprise systems and deployed thesolution in just 67 days—enabling an even fasterreturn on investment.”—Dan Olsen, director of Supply Management Services, Hydro OneIBM service professionals have the knowledge and skills to quickly deploy and adapt processes and applications worldwide. Based on experience work-ing with a wide range of information technology systems—including complex, heterogeneous environments—IBM can leverage your infrastructure to help auto-mate end-to-end ESM processes.IBM technology and capabilities include:Services—IBM offers a variety of stra-tegic consulting services to help your company determine its ESM strategy, then implement it using our knowledge of e-business and industry best prac-tices and leading methodologies. IBM can also host and manage your ESM solution so your information technology team can focus on core competencies.Software—IBM has combined databasestrengths in IBM DB2®, security strengthsin Tivoli® systems and e-business inte-gration solutions with powerful offeringssuch as IBM WebSphere MQ and theIBM WebSphere® business integrationsolutions, so that IBM can help youintegrate existing systems (legacy, ERPand more) with new ESM applicationsfrom Ariba.Hardware—IBM robust solutions powere-commerce around the world. Forexample, the IBM ^ line, fromIntel-based servers to mainframes, isdesigned to provide the best scalability,availability and dependability to fi t yourbusiness requirements.IBM also has an extensive system-and solution-testing infrastructure, sup-ported by a team of several thousandprofessionals at more than 100 sitesworldwide. Research and developmentexperts test product interoperability,scalability, proof of concepts and perfor-mance to drive ultimate benefi ts for you.Becoming spend-wise with help from IBMand AribaIBM and Ariba have merged advancedtechnology, high-level e-businessinfrastructure and swift implementationcapabilities to help you gain enterprise-wide spend visibility quickly and easily.IBM, with our e-business expertise andglobal implementation and consultingservices, is ready to power your businesswith a comprehensive, world-class ESMsolution. And the integrated and auto-mated Ariba Spend Management Suitefor analysis, sourcing and procurementprovides effective management solu-tions for the full spend lifecycle. Supplierconnectivity and relationships take onwhole new meanings. As does processcontrol. The money that was once lostto unobserved processes, poor com-munication and loose relationships cannow be found, captured and kept. Andthe savings goes straight to where youneed it most—the bottom line.For more informationTo learn more about IBM and Ariba ESMsolutions, please call 1 866 426-6010or visit:Ariba spend management:• Signifi cant reductions in spend•Enterprisewide visibility and control•Spend lifecycle solution—analysis, sourcing and procurement© Copyright IBM Corporation 2002IBM Corporation1133 Westchester AvenueWhite Plains, NY 10604U.S.A.IBM, the IBM logo, the e(logo), the e-business logo,DB2, Tivoli and WebSphere are trademarks or registered trademarks of International Business MachinesCorporation in the United States, other countries, or both.References in this publication to IBM products orservices do not imply that IBM intends to make them available in all countries in which IBM operates.© 2002 Ariba, Inc.Ariba, Inc.1565 Charleston RoadMountain View, CA 94043U.S.A.Ariba and the Ariba logo are trademarks, or registered trademarks of Ariba, Inc. Ariba Spend Management, Ariba Analysis, Ariba Buyer, Ariba Contracts, AribaEnterprise Sourcing, Ariba Invoice, Ariba SupplierNetwork and Ariba Workforce are trademarks orservice marks of Ariba, Inc.Other company, product and service names may be trademarks or service marks of others.Printed in the United States of America04-02All Rights ReservedG580-3384-01。
英语作文-快递服务的物流管理与运营Logistics and Operations of Express Delivery Services。
In today's fast-paced world, the efficient management and operation of logistics in express delivery services play a crucial role in meeting customer expectations and ensuring timely deliveries. The logistics and operations involved in this industry are complex and require meticulous planning, coordination, and execution at every step of the process.Firstly, at the core of express delivery logistics is the process of order fulfillment. This begins as soon as a customer places an order through various channels such as online platforms or directly with the delivery service provider. The logistics team initiates the process by validating the order details, including the delivery address, package dimensions, and any special handling instructions. Accuracy at this stage is paramount to avoid delays and ensure customer satisfaction.Following order validation, the logistics team plans the most efficient route for each delivery. This involves optimizing delivery routes based on factors like geographical proximity, traffic conditions, and delivery time windows. Advanced routing software and algorithms are often employed to streamline this process, minimizing travel time and fuel consumption while maximizing the number of deliveries per route.Simultaneously, warehouse operations play a critical role in the logistics chain of express delivery services. Upon receiving orders, warehouse staff pick, pack, and label each item with precision. The packaging phase is particularly important as it ensures that products are secure and protected during transit. Quality packaging not only prevents damage but also enhances the overall customer experience by presenting goods in pristine condition upon delivery.Moreover, effective inventory management is essential to the smooth functioning of express delivery logistics. Real-time tracking systems enable logistics teams to monitor stock levels accurately and anticipate demand fluctuations. This proactive approach helpsin maintaining optimal inventory levels, reducing the risk of stockouts, and ensuring timely replenishment to meet customer orders promptly.In addition to physical operations, technology plays a pivotal role in enhancing the efficiency and reliability of logistics in express delivery services. Automated sorting systems, barcode scanners, and GPS-enabled tracking devices enable real-time visibility of shipments throughout the delivery process. Customers can track their parcels from the moment they leave the warehouse until they reach their doorstep, providing transparency and peace of mind.Furthermore, the role of logistics extends beyond operational efficiency to include sustainability initiatives. Many express delivery companies are increasingly adopting eco-friendly practices such as optimizing delivery routes to minimize carbon emissions, using recyclable packaging materials, and investing in electric or hybrid delivery vehicles. These initiatives not only reduce environmental impact but also contribute to corporate social responsibility goals, enhancing brand reputation.Lastly, customer satisfaction is the ultimate measure of success in express delivery logistics. Timely deliveries, accurate order fulfillment, and responsive customer service are key factors that influence customer experience. By continuously optimizing logistics operations and embracing technological advancements, delivery service providers can meet growing customer expectations for speed, reliability, and transparency in every shipment.In conclusion, the logistics and operations of express delivery services are integral to ensuring seamless and efficient delivery of goods to customers worldwide. Through meticulous planning, advanced technology adoption, and a commitment to customer satisfaction, logistics providers can navigate the complexities of modern supply chains and deliver exceptional service in today's competitive marketplace.。
International Journal of Intelligence Science, 2013, 3, 1-4doi:10.4236/ijis.2013.31001 Published Online January 2013 (/journal/ijis)Improving Rule Base Quality to Enhance ProductionSystems PerformanceNabil ArmanDepartment of Computer Science, Palestine Polytechnic University, Hebron, PalestineReceived September 1,2012; revised October 3, 2012; accepted October 12,2012ABSTRACTProduction systems have a special value since they are used in state-space searching algorithms and expert systems in addition to their use as a model for problem solving in artificial intelligence. Therefore, it is of high importance to con- sider different techniques to improve their performance. In this research, rule base is the component of the production system that we aim to focus on. This work therefore seeks to investigate this component and its relationship with other components and demonstrate how the improvement of its quality has a great impact on the performance of the produc- tion system as a whole. In this paper, the improvement of rule base quality is accomplished in two steps. The first step involves re-writing the rules having conjunctions of literals and producing a new set of equivalent rules in which long inference chains can be obtained easily. The second step involves augmenting the rule base with inference short-cut rules devised from the long inference chains. These inference short-cut rules have a great impact on the performance of the production system. Finally, simulations are performed on randomly generated rule bases with different sizes and goals to be proved. The simulations demonstrate that the suggested enhancements are very beneficial in improving the performance of production systems.Keywords: Production System; Rule Base Quality; Inference Short-Cut Rules; Inference Chains1. IntroductionA production system, in the context of artificial intelli- gence, is a model of computation that has proved par- ticularly important in different sub domains such as search algorithms implementation and modeling human problem-solving [1]. A schematic diagram of a produc- tion system is presented in Figure 1. As shown, a pro- duction system is defined by three major components, namely the set of production rules (a rule base), a work- ing memory containing a description of the current state of the world in a reasoning process, and the recognize-act cycle that represents the control structure for a produc- tion system.Production systems are intensively used in state-space searching algorithms and expert systems in addition to their use as a model for problem solving in artificial in- telligence. Thus, improving their performance is an issue of great importance. The improvement can be focused on either improving the representation and access of facts in the working memory or improving the rule base quality. In this paper, rule base quality is the component that we focus on. This work therefore seeks to demonstrate how the enhancement of the rule base quality has a great im- pact on the performance of the production system as a whole.In this paper, the enhancement of rule base quality is performed by firstly re-writing the production system rules having conjunctions of literals and producing a new set of equivalent rules in which long inference chains can be devised. Secondly, augmenting the rule base with in- ference short-cut rules obtained from the long inference chains. These inference short-cut rules improve the per-formance of the production system. Finally, several simulations are performed on a set of random rule bases with different sizes and goals to be proved. These simu- lations demonstrate that these enhancements are very useful in improving the performance of the production system.2. Related WorkThe performance of a production system has attracted a large amount of research efforts. Improving performance of production systems by restructuring facts, where the focus was on the set of facts in the production system, was presented in [2]. A genetic algorithm for produc- tion systems optimization was presented in [3]. The algo- rithm finds an ordering of condition elements in the rules of a production system that results in a (near) optimal production system with respect to execution time. TryingN. ARMAN. 2Figure 1. A production system.to find such an ordering can be complicated since there is often a large number of ways to order condition elements in the rules of a production system. In addition, using heuristics to order condition elements, in many cases, conflict with each other. The improvements presented in [2,3] are considered dynamic improvements that are em-ployed during production system execution and thus in-curred additional overhead that may slow down the pro-duction system execution. This affects the performance of a production system negatively.The quality of rule bases has been a subject of a large amount of research efforts in the context of different ap- plication domains including information distribution systems, active databases, expert systems to name just a few [4,5]. In [4], the focus was on generating a set of rules that are fault-free and has a minimum cost in case the cost of applying different rules is known and of great importance. In [5], the focus was on dynamic rule bases where rules’ status changes during the operation of the rule-based system. However, these improvements did not include the issue of the rule-based system execution per se.Another technique for improving the quality of a rule base was presented in [6]. This technique used a number of heuristics to suggest certain corrections of the rule base faults found in the rule base. Again, this technique did not consider the issue of rule-based system execution.A declarative verification approach for improving the quality of rule-based applications was presented in [7]. This approach presented a particular way to control and to improve the rule quality by means of rule verification using a declarative approach. Although the approach is flexible and easy to maintain, it did not take into account the issue of rule-based system execution.A state-based knowledge representation approach, in which domain-specific knowledge is expressed by com- binations of the relevant objects’ states were presented in [8]. Using this technique, a method for detecting logical inconsistencies was developed, which can deal with the demands of various domain-specific situations through reducing part of restrictions in existing methods. How- ever, this approach did not affect the execution of the system.In this paper, the focus is on the quality of the rule base rather than the ordering of the facts in the fact base or the ordering of the condition elements in the rules of a production system or the rule base verification. This can be performed before the production system starts execu- tion as a preprocessing step and thus speeds up the pro- duction system execution without incurring additional overhead during the production system execution. Therefore, this is considered a static improvement that is performed before a production system starts execution. 3. Rule Base Quality Enhancement of a Production System PerformanceThe performance of a production system depends largely on the rules in its rule base. The structure of rules in a production system and their interrelationships determine how the search space is explored. In large production systems, many rules are used and these rules will be tried in order based on a conflict resolution strategy. A number of conflict resolution strategies have been used including refraction, recency, priority, and specificity. In this paper, priority is used to order the rules for possible firing during the production system execution.To improve the performance of a production system, one should consider enhancing the quality of its rule base by handling all possible problems and anomalies associ- ated with rule bases including inconsistency, contradic- tion, circularity, and redundancy [9]. This should be han- dled before the production system starts execution and can be performed using well-known verification tools and techniques [5,9]. An inconsistency exists in the rule base of a production system if a condition of one rule is mutu- ally exclusive to the consequent or action of such rule (or a chain of rules). A contradiction exists if two rules con- clude different actions from the same condition. A redun- dancy exists if two rules conclude the same action from the same rule condition. A subsumption exists if two rules conclude the same action, but one has additional con- straints in the rule condition, which may or may not be necessary (a specific kind of redundancy). A circularity exists if the rule base contains a cycle that makes the production system to enter an endless loop by keeping the insertion of the same facts to the fact base of the produc- tion system without making any progress towards the solution or goal of the problem.In this paper, the focus is on the issues that affect the production system performance during its execution. A restructuring of the rules based on their ations/consequent makes it easier to apply the major improvement of theN. ARMAN. 3quality of the rule base. Re-writing the rules having a conjunction of literals is of high importance since it fa- cilitates the process of checking other types of anomalies and to apply other improvements. For example, a rule of the form:12n p q q q →∧∧∧Λcan be re-written as a set of rules of the form:12,,n p q p q p q →→→Λwhere the conjunction of literals 12n is used to devise the set of new rules obtained by having the left-hand side p of the original rule to be the left-hand side of all new rules and taking each literal q i as the right-hand side of the new rules. This makes it easier to detect long chains in the rule base of the production system. In large rule bases, long chains may result when one rule triggers a second rule, and the second rule triggers a third rule, and so on. In this case, a number of new rules represent-ing a form of inference short-cuts can be added to the production system rule base. The original rule base of the production system is augmented with these inference short cut rules. These rules can be assigned a higher prior-ity to guarantee their applications first during the infer-ence process of the production system. For example, a rule base of the production system having a set of rules of the form:q q q ∧∧∧Λ122311,,,j j n p p p p p p p p +-→→→→ΛΛn can be augmented with a number of inference short-cut rules depending on the selected value of j representing the inference chain length. For example, if j is selected with a value of 3, then the rule base is augmented with the rules:142533,,,j j n p p p p p p p p +-→→→→ΛΛnAgain, these inference short-cut rules are assigned higher priorities than rules with the same conditions to guarantee their applications first and thus rule base ordering can be based on that.Based on the improvements presented above, our ap- proach can be presented in the following algorithm:Rule Base Quality Enhacement (Rule Base (RB ), Aug-mented Rule Base (ARB ), Inference Chain Length (J )) {Use a Verification Tool to Handle Anomalies (Incon-sistencies , Contradictions , Redundancies , and Circulari-ties ) in RBRe-write rules having actions /consequents consisting of conjunction of literals in the modified RBAugment the modified RB with a number of inference short-cut rules based on the value of J and devise ARB }4. Results and Performance EvaluationTo determine the performance of our approach, several simulations were performed for random rule bases with 50, 100, 150, and 200 rules and proving/answering a setof 30 randomly generated goals. The same 30 randomly generated goals were answered using the original rule base without the enhancements suggested. The time taken to prove these goals was determined for both tech- niques and the times were plotted for different sizes of the rule bases as presented in Figure 2. As shown in Figure 2, our approach for proving the goals outperforms the traditional approach.In addition, a rule base of 200 rules was tested for varying number of inference chain length of values 2, 3, 4 and 5 and proving/answering a set of 30 randomly generated goals. The same 30 randomly generated goals were answered using the original rule base without in-troducing the inference short-cut rules. The time taken to prove these goals was determined for both techniques and the times were plotted for different sizes of the rule bases as presented in Figure 3. As shown in Figure 3, our approach for proving the goals outperforms the tradi-tional approach since our approach benefits from the inference short cuts and the re-ordering of the rule bases based on new inference short-cut rules’ priorities.5. Discussion and ConclusionIn this paper, we proposed an approach for enhancing theFigure 2. Performance evaluation of our approach using rule base size.Figure 3. Performance evaluation of our approach using inference chain length.N. ARMAN. 4quality of a rule base component of a production system which is of high importance to improve the performance of a production system. Production systems have a spe- cial value since they are used in state-space searching algorithms and expert systems in addition to their use as a model for problem solving in artificial intelligence. The simulations demonstrated that the improvement of rule base quality, in terms of augmenting the rule base with inference short-cut rules obtained after replacing rules with conjunctions of literals by a new set of equivalent rules in which long inference chains can be obtained eas-ily, has a great impact on the performance of the produc- tion system as a whole.6. AcknowledgementsThe author thanks the reviewers for suggestions to im-prove the paper.REFERENCES[1]G. Luger, “Artificial Intelligence: Structures and Strate-gies for Complex Problem Solving,” 6th Edition, Addi-son-Wesley, Boston, 2009, pp. 200-201.[2]W. Mustafa, “Improving Performance of Production Sys-tems by Restructuring Facts,” Abhath Al-Yarmouk Jour-nal of Natural Sciences and Engineering, Vol. 11, No. 1A, 2002, pp. 105-120.[3]W. Mustafa, “Optimization of Production Systems UsingGenetic Algorithms,” International Journal of Computa- tional Intelligence and Applications, Vol. 3, No. 3, 2003,pp. 233-248. doi:10.1142/S1469026803000987[4]N. Arman, “Generating Minimum-Cost Fault-Free RuleBases Using Minimum Spanning Trees,” InternationalJournal of Computing and Information Sciences, Vol. 4, No. 3, 2006, pp. 114-118.[5]N. Arman, “Fault Detection in Dynamic Rule Bases Us-ing Spanning Trees and Disjoint Sets,” The InternationalArab Journal of Information Technology, Vol. 4, No. 1, 2007, pp. 67-72.[6]N. Arman, D. Richards and D. Rine, “Structural and Syn-tactic Fault Correction Algorithms in Rule-Based Sys- tems,” International Journal of Computing and Informa-tion Sciences, Vol. 2, No. 1, 2004, pp. 1-12.[7]S. Lukichev, “Improving the Quality of Rule-Based Ap-plications Using the Declarative Verification Approach,”I nternational Journal of Knowledge Engineering andData Mining, Vol. 1, No. 3, 2011, pp. 254-272.doi:10.1504/IJKEDM.2011.037646[8]J. Ma, G. Zhang and J. Lu, “A State-Based KnowledgeRepresentation Approach for Information Logical Incon- sistency Detection in Warning Systems,” Knowledge-Based Systems, Vol. 23, No. 2, 2010, pp. 254-272.doi:10.1016/j.knosys.2009.05.010[9]N. Arman, D. Rine and D. Richards, “General Fault De-tection Algorithms in Constrained Rule-Based Informa- tion Distribution Systems,” Yarmouk University ResearchJournal, Pure Science and Engineering Series, Vol. 11, No. 2, 2003, pp. 190-203.。
岳劲峰简历岳劲峰现任美国中田纳西州立大学杰宁琼斯商学院管理与市场系副教授(终身教授)(Associate Professor with tenure, Middle Tennessee StateUniversity)联系地址:Jinfeng Yue, Ph.D.Associate ProfessorDepartment of Management and MarketingJenning A. Jones College of BusinessMiddle Tennessee State UniversityMurfreesboro, TN 37132USAE-MAIL: jyue@电话:001-615-898-5126学历:1983年7月:北京大学地球物理专业;学士1989年4月:西北工业大学管理系统工程专业;硕士1995年7月:内布拉斯加大学卡尼分校工商管理学;工商管理硕士(MBA, University of Nebraska at Kearney, USA)2000年5月:华盛顿州立大学统计学;硕士(MS in Statistics,Washington State University, USA)2000年7月:华盛顿州立大学工商管理学;博士(Ph.D. in Business Administration, Washington State University, USA)工作经历:2006年8月- 至今:中田纳西州立大学管理与市场系;副教授(获终身教职);2001年8月- 2006年7月:中田纳西州立大学管理与市场系,助理教授2000年8月- 2001年7月:东南奥克拉荷马州立(Southeastern Oklahoma State University)大学管理与市场系,助理教授1995年8月- 2000年7月:华盛顿州立大学管理与运筹系;助教1994年8月-1995年7月:内布拉斯加大学卡尼分校经济系;助教科研教学获奖总结从事管理科学与运筹学方面的研究,主要研究方向包括有限信息情况下的决策理论;供应链管理;库存管理;质量管理;多目标决策模型。
Power tools for mechanical design. AutoCAD®Mechanical 20092To compete and win in today’s design marketplace,engineers need to create and revise mechanical drawings faster than ever before. AutoCAD ®Mechanical software offers significant productivity gains over basic AutoCAD ®software by simplifying complex mechanical design work.The AutoCAD Mechanical AdvantageWith comprehensive libraries of standards-based parts and tools for automating common design tasks, AutoCAD Mechanical accelerates themechanical design process. Innovative design and drafting tools are wholly focused on ease of use forthe AutoCAD user.6810Keeping the AutoCAD user experience intact allows designers to maintain their existing workflows while adopting the enhanced functionality of AutoCAD Mechanical at their own pace. Designers gain a competitive edge by saving countless hours of design time and rework, so they can spend time innovating rather than managing workflow issues.3Creating mechanical drawings with generic software can inadvertently introduce design errors and inconsistencies, wasting both time and money. AutoCAD Mechanical helps designers catch errors before they cause costly delays.Error Checking and PreventionScalingSave hours of rework by maintaining only one copy of a drawing, instead of multiple copies at different scales. AutoCAD Mechanical offers several options for scaling drawings to fit on larger or smaller paper sizes. Update the scale factor and the drawingcorrectly resizes. All annotations (text, dimensions, blocks, hatches, and linetypes) remain appropriately displayed.Construction LinesReduce the time required to create geometry and align drawings with a comprehensive construction line toolset. Construction lines are automatically placed in their own color and layer group, clearly distinguishing them from design geometry. Con-struction lines do not show up when printing.Fit ListsInstantly create fit lists that are linked to the actual information in a design, helping to reduce errors and improve productivity. As special fit informa-tion is added to a design, the fit list table updates automatically.Paper Space Annotation ViewsReduce errors and drafting time by easily creating multiple paper drawings from one master model. Add specific parts and assemblies directly to apaper drawing. Apply visibility, scale, color, and view overrides directly to each drawing without the use of layers. The seamlessly integrated parts list keeps accurate count of how many parts have been addedto each drawing for the parts lists totals.4Standards-Based Drafting and Part LibrariesStandard Parts, Features, and HolesProduce accurate designs faster with standards-based parts from the libraries in AutoCADMechanical, saving hours of design time. AutoCAD Mechanical contains more than 700,000 parts such as screws, nuts, washers, pins, rivets, and bushings. It also includes 100,000 predrawn features such as undercuts, keyways, and thread ends. AutoCAD Mechanical also contains more than 8,000 predrawn holes, including through, blind, and oblong holes. When users incorporate these features into a design, AutoCAD Mechanical automatically cleans up the insertion area, reducing the need for manual edits.Realize consistent results on the shop floor by producing accurate designs using a comprehensive set of more than 700,000 standard parts.Standard Part FavoritesCustomize AutoCAD Mechanical to fit your work-flow. Users can now save frequently used parts as favorites, where they can be accessed quickly for easy reuse.Standards-Based DesignMultiply productivity with tools that help users de-liver consistent, standards-based design documenta-tion. AutoCAD Mechanical supports ANSI, BSI, CSN, DIN, GB, ISO, and JIS drafting environments. Using standards-based drafting environments helps groupsof users maintain a common form of communication.2D Structural Steel ShapesCreate designs more quickly and accurately using predrawn geometry. AutoCAD Mechanical contains more than 11,000 predrawn standard structural steel shapes that users can incorporate quickly into any design. These include common structural shapes such as U-shape, I-shape, T-shape, L-shape, Z-shape, rectangular tube, round tube, rectangular full beam, and rectangular round beam.Title and Revision BlocksQuickly generate drawings with uniform, precre-ated title and revision blocks. AutoCAD Mechanical includes a full set of configurable title and revision blocks in both English and metric units. Users can easily customize these blocks with company-specific information.Annotation Symbols and NotesSave time and increase accuracy by usingstandards-based mechanical symbols and notes. AutoCAD Mechanical includes drafting tools to create standards-based surface texture symbols, geometric dimensioning and tolerances, datum identifiers and targets, notes, taper and slope symbols, and weld symbols.Screw ConnectionsAutomate the creation and management of screw connections with this easy-to-use graphical inter-face that supplies thousands of connection options, while helping users choose the best parts for their design. Create, copy, and edit entire fastener assem-blies at one time. Pick the desired type of screw, cor-responding washers, and type of nut. Appropriate sizes for nuts, washers, and holes are presented depending on the screw selected and material thick-ness. The hole is added to the part where specified, and the entire fastener assembly is inserted into the hole. All inserted parts are instantly captured by thebill of materials (BOM).6Machinery Generators and CalculatorsSpring GeneratorSelect, calculate, and insert compression springs, extension springs, torsion springs, and Belleville spring washers into a design using the spring gen-erator, a fast, valuable, and easy-to-use tool. Control the representation type of the spring, and create a specification form to incorporate in the drawing. The spring calculator helps users select the right spring on the first try.Shaft GeneratorAccelerate shaft drawings and analysis with minimal input and effort. The extensive library of common features and parts makes it easy to finish the draw-ing. The shaft generator creates drawing views of solid and hollow shafts. Add standard features such as center holes, chamfers, cones, fillets, grooves, profiles, threads, undercuts, and wrench fittings. In addition, standard parts commonly found in shafts, such as bearings, gears, retaining rings, and seals, are supported and conveniently grouped together. Automatically create associated side views and vali-date the capability of completed shafts with built-in calculated graphs and tables.Cam GeneratorQuickly design and analyze cams while increas-ing access to crucial information about the cam’s functionality. The cam generator creates linear, circular, and cylindrical cams based on the input border connections set by the user. Calculate and display acceleration and jerk, as well as the cam curve path. Couple driven elements to the cam, and create computer numerical control (CNC) data viathe curve path.Accelerate the design process and improve design accuracy with a comprehensive collection of automated machinery generators and calculators.7Belt and Chain GeneratorQuickly and easily create chain and belt assemblies that are based on engineering calculations for opti-mum performance. Automatically calculate optimal lengths for chains and belts based on user input, and insert these assemblies into a design. Simply select belts and chains from the standard libraries to get started.Moment of Inertia, Deflection, and Load CalculationsSave time and reduce the tedium of manual calcula-tions by using built-in engineering calculators.Instantly generate many different sets of calculated graphs and tables for screws, bearings, cams, and shafts with minimal additional input. Quickly perform engineering calculations, such as a moment of inertia of a cross section or deflection of a profile with given forces and supports.2D Finite Element Analysis (FEA)Quickly identify potential areas of failure and ana-lyze a design’s integrity under various loads, thereby avoiding costly product testing or field mainte-nance. The 2D FEA feature is an easy-to-use tool for determining the resistance capability of an object under static load. Add movable and fixed supports to the part to be analyzed, as well as stress points,lines, and areas.8Design and Drafting Productivity ToolsMechanical Drawing ToolbarCreate drawings more accurately with purpose-built tools. AutoCAD Mechanical provides options beyond those in basic AutoCAD software for draw-ing creation, including more than 30 options for creating rectangles, arcs, and lines; specialty lines for breakout views and section lines; and mechani-cal centerlines and hatching additions. 2D HideReduce drafting effort with automatically generated hidden lines that update to reflect drawing revi-sions. Perform 2D hidden-line calculations based on user-defined foreground and background selections that update automatically. These selections auto-matically redraw geometry, reducing the tedious manual task of trimming and changing properties of lines in AutoCAD. The 2D hide feature also warns users of potential geometrical errors and provides a graphical workflow that is easy to learn and use.WorkspacesQuickly customize toolbars and settings with the Workspaces toolbar, which offers a pull-down menu where designers can easily store and access differ-ent user-interface setups. Several prebuilt work-spaces ship with the product, including the classic AutoCAD workspace as well as workspaces that make it easier to learn AutoCAD Mechanical.Power DimensionsQuickly change, edit, or delete dimensions, saving significant time and effort. AutoCAD Mechanical makes AutoCAD dimensions easier to use with ab-breviated dialog boxes that conveniently control and expand only the variables relevant for manufactur-ing. With automatic dimensioning, users can create multiple dimensions with minimal input, resulting in instant groups of ordinate, parallel, or sym-metric items that are appropriately spaced. Smart dimensioning tools force overlapping dimensions to automatically space themselves appropriately while integrating tolerance and fit list information into the drawing. Inspection dimensions enable users tospecify testing criteria.Built to save users time, AutoCAD Mechanical has a specific tool for almost every aspect of the mechanical design process.Associative Detailing ToolsUpdate drawings quickly with powerful tools that enable users to edit previous operations, saving valuable design time. Easily re-edit features without having to remove and re-create the original feature. For example, resize a chamfer using the original dialog parameters by simply double-clicking the chamfer.Design NavigationUse the design navigation feature to better under-stand how designs fit together. As the user moves the cursor across a design, a small window displays part names. Expand this window to show parent/child relationships inside assemblies. The entire part geometry is highlighted, with a single grip placed at the base point and an arrow showing defaultorientation.Software Developer Kit (SDK)Customize and combine features in AutoCAD Mechanical to achieve higher levels of productiv-ity. The SDK for the API (application programming interface) provides information to customize and automate individual features or combinations of fea-tures in AutoCAD Mechanical. It includes updated API documentation and sample scripts.Power SnapsEase the repetitive task of geometry selection by using task-based power snap settings. AutoCAD Mechanical includes five settings for object snaps, as well as many more options for selecting specific geometry than basic AutoCAD software offers. Quickly choose the snap setting that works best for the task at hand.Dimension StretchEasily update designs to specific sizes and shapes simply by changing the dimension values. The ge-ometry of a design resizes accordingly. For complex designs, use multiple selection windows to choose exactly which geometry should be changed by thedimension value.10Data Management and Reporting ToolsBalloons and Bills of MaterialsUse standards-based balloons and parts lists and automatically update the BOM to seamlessly track any changes—helping to keep teams on schedule by reducing costly breaks in production due to incorrect part counts, identification, and ordering. AutoCAD Mechanical includes support for multiple parts lists per drawing, collapsible assemblies, automatic recognition of standard parts, and customizable options so features can be revised to match current company practices. The new BOM configuration manager simplifies setup and customization.Hole ChartsQuickly create accurate hole charts that automati-cally update based on design changes, reducing errors associated with creating charts manually. When users place standard holes in the design, the software automatically generates hole charts that display detailed design information. Dynamic highlighting helps ensure that all holes needed for the chart are accurately represented. After the user places a chart, it remains linked to the design, dynamically updating to reflect changes and addi-tions. Filtering capabilities enable users to separate different hole sizes into different hole charts for streamlined manufacturing processes.Language TranslationAccelerate language translation and simplify international communications with built-in tools. AutoCAD Mechanical offers a basic library of prewritten language strings that can automati-cally translate drawing text from one language to another. The library is an open format that can be expanded and modified.Integrated Data ManagementSecurely store and manage work-in-progress design data and related documents with data management tools for workgroups. Team members can accelerate development cycles and increase their company’s return on investment in design data by driving design reuse.Autodesk ProductstreamOrganize, manage, and automate key design and release management processes. With Autodesk ® Productstream ® software your company’s designs are complete, accurate, approved, and released tomanufacturing in a timely and effective manner.AutoCAD Mechanical helps workgroups organize and manage valuable design data and provide accurate reports to downstream users.11Interoperability and CollaborationDWF TechnologyPublish DWF™ files directly from Autodesk manufac-turing design applications, and securely collaborate on 2D and 3D designs with customers, suppliers, planners, and others outside your engineering work-group. Using the free* Autodesk ® Design Review software, team members can digitally review, mea-sure, mark up, and comment on 2D and 3D designs while protecting intellectual property. Tight integra-tion with Autodesk manufacturing products allows for accurate communication of design information, including assembly instructions, bills of materials, and FEA results, without requiring CAD expertise. Autodesk Design Review automatically tracks com-ments and their status, and the DWF-based markups can be round-tripped, helping accelerate the revision process and minimize information loss.Autodesk DWG Product RecognitionEasily identify which Autodesk product created a DWG file, and open the file with the optimalprogram for maintaining file intelligence. When the user moves the cursor over the DWG™ icon, a small window appears with information about which prod-uct was used to create the DWG file.STEP/IGES TranslatorsSimplify accurate collaboration with suppliers and customers by enabling sharing and reuse of design data with other CAD/CAM systems. Read and write design and drawing data using industry-standard formats.Autodesk Inventor AssociativityEasily detail and document native Autodesk ® Inventor™ part and assembly models. Browsethrough Inventor files, and begin creating new, linked AutoCAD Mechanical drawings that are based on the most current 3D designs. Incorporate design revi-sions quickly and easily through the associative link, which alerts users to changes and regenerates the 2D drawing. Visualize design intent by shading and rotating solid models, and review other attributes as-sociated with the Inventor design. Information stored in Inventor models is automatically available to the BOM database in AutoCAD Mechanical, so users canquickly add balloons, parts lists, and annotations.The intelligent file formats in AutoCAD Mechanical and tight integration with Autodesk ®manufacturing products facilitate collaboration by enabling workgroups to share accurate design information reliably and securely.。
Logistics park Development in Slovak Republic外文翻译外文翻译原文Logistics park Development in Slovak RepublicMaterial Source: //.u.lt Author: Marian SulganAbstract: The paper deals with the actual situation in the Slovak Republic concerning the logistics parks development. It presents the theoretical base of the logistics park development, i.e. the comparative analysis, SWOT analysis, transport infrastructure survey, marketing study and marketing plan for logistics park. It also presents the basic characteristic of logistics park, logistics chains and activities connected with the transport, logistics and goods distribution.Keywords: transport, logistics, logistics park, logistics centre, freight transport.IntroductionNowadays, we are witnessing the deep structural changes in Europe. Globalization processes determine not only transport but also all human activities. The objective of the Europe Commission’s White Paper“European transport policy for 2010: time to decide” is to refocus Europe’s transport policy on the demands and needs of its citizens. The White Paper proposes more than 60 measures to meet this challenge. The first of these measures is designed to shift the balance between modes of transport by 2010, by revitalizing the railways, promoting maritime and inland waterway transport and linking up the different modes of transport. The principal objective of the EU’s regional policy is to eliminate regional disparities and to promote integration and social cohesion. The Union seeks to use the policy to help the lagging regions to catch up, restructure declining industrial regions, diversify the economies of rural areas with declining agriculture and revitalise decling neighborhoods in the cities.Transport policy plays a major role in strengthening the economic and social cohesion of the European Union. Firstly, it helps reduce regional disparities, particularly by improving access to island and peripheral regions. It also has a beneficial effect on employment, by encouraging investment in transport infrastructure and assisting workers’ mobility.Zilina University together with the Zilina Municipality are involved in solving objectives of the international REDETRAL project Regional Deve-lopment and Transport Logistics ?European best practice in the development of logistics parks. The project is financed by theEuropean Union under the ERDF-Interreg IIIC East Community Initiative.The overall objective of REDTRAL “is to develop a European Best Practice Approach to the development of logistics parks in view of the importance of sustainable traffic and transport solutions in the framework of regional development”.In the Slovak Republic, freight transport has changed rapidly and there are a lot of new logistics parks in the regional developing aims. The new logistics activities are presented as subsystems of corporate or logistics system of business association. The logistics structure contains bookings, material handling, spacing, stocks, storages, packing activities, customer service, transport, informational systems, etc. From the analysis of logistics companies the development in developed European countries resulted when attention was initially set on raw material deliveries in order to limit and minimize stocks, transfer of production from buffer stores to trading partners and consumers Activities enabling the formation of present complex logistics chains were gradually assigned. Each transport Chain can be the element of certain logistics chain thus becoming the organized sequence of procedures. Forwarding, which represents an important element of future logistics Chains and enables the development of combined transport, plays an important role nowadays. It should be also understood that this new stage, which is directed at transmodality, is based on logistics.Logistics park development-theoretical baseThere are a few steps in the beginning of the logistics park development. The first step is to create the Comparative Analysis profile of the region. Each REDETRAL partner had to complete a questionnaire regarding their respective region that sought data and information under a number of headings. A copy of the Comparative Analysis questionnaire was issued to each partner organisation. The important part of the Comparative Analysis are the Socio-Economic Indicators-areakm2, population, unemployment rate, principal economic sectors, ect. The next part of the Analysis is the SWOT Analysis-the sheet for each region was made with the main information about the Strengths, Opportunities, Weaknesses and Threats in the region. The final part of the Analysis is the Transport Infrastructure Survey-the transport netwok, motorwayskm, railwayskm, airports, international corridors, intermodal terminals, sea ports, ect.The next step is to create the Marketing study of territory, based on effective approach including phases:Audit of territory;Determination of vision and objectives;Marketing strategy;Plan of implementation;Implementation and control. Marketing plan for logistics park includes;Situation analysis of region-territory orientated for transport and logistics;Marketing objectives of transport and logistics solution: positive image, competitive advantage of region, attractiveness of regional labour market , development of new transport projects for new industrial parks, increasing of transport accessibility and transport quality, creation of logistics chains, ect.;Selection of segments for logistics solution: population of region, institutional units, industrial subjects, export markets, visitors of region;Elaboration of marketing plan-marketing mix of logistics park.Among the key regional conditions for the development of logistics park we can rank the transport and infrastructure level, telecommunicationsdevelopments in information technology are seen as critical in the development of European logistics, energy costs and the likelihood of shortage, social infrastructure, labour force, markets, environmental issuesincreasing attention to environmental issues in response to public concerns, land using and spatial planning.Regional conditions dealt with at present have concentrated on those infrastructal items that “directly” impact on the successfuldevelopment of logistics parks. However, perhaps equally as important are “quality of life ”conditions that also determine the attractiveness of locations. People and, by association, companies and investment development are often attracted to areas and regions where there is a vibrant social and cultural life, coupled with a wide range of services and cultural life, coupled with a wide range of services including education, healthcare and childcare facilities and ready access to entertainment and amenity facilities.Logistics park should encourage intermodal transport. Intermodal transport involves the movement of goods in one and the same loading unit or vehicle that successively uses several modes of transport without handling of the goods themselves in changing modes.Basic of Logistics ParkLP characteristic:Point of the concentration of logistics flows and logistics operations;Concentrative node of the traffic flows;Centre of the customer supplier chains effectively managed.Logistics park is an exactly delimited domain including the activities connected with the transport, logistics and goods distribution. There is a working area for operators, traffic and logistics companies, the place for buildings and facilities within the logistics park, there is a concentration point of public facilities, services and access forall relevant companies. LP supports the multimodal transport and is established and managed by the one company.Industrial production analysis and opportunities of logistics services brought information about the foods, beverages, textiles, footwear, electronics, white technicals fridges, washers, cook ranges, etc., tyres and machine products which are the most suitable piece-goods for logistics produced and manufactured in the Slovak Republic Demand for transport services results from commodity demand. Goods and commodity movement are characterized by freight transport principles, which are realized form manufacturers to dealers or consumers in required quantity, quality and delivery terms Growth of customer demand for various kinds of goods creates pressure onto shopkeepers and requires to find optimal goods delivery chains by appropriate logistics solutions including freight transport services.Logistics park allows the incoming of carriers, forwarders, logistics service, logistics industry, business organizations, governmental agencies, financial and insurance companies and other businessmen.LP allows the connection of at least two modes of transport, and supports the synergetics effects by the cooperation projects of participating firms. The most significant clients of the logistics parks are the car production plants, the supermarket and hypermarket chains,the electronic industry and information technology industry.There are a lot of differences among the LP conception, importance, range and characteristic features within Europe and also among the names of LP. For example there is a Freight Village in Great Britain, a Plate Forme Logistique in France, a Guterverkehrszentrum GVZ in Germany, an Inter-porto in Italy, a Logistics Centre and Cargo Centre in Austria, etc.Logistics parks in the Slovak RepublicLogistics parks in the Slovak Republic are displayed in Table 1. There is only one LP in operation. The other planned parks can exploit a lot of new in-ternational experiences according to the REDETRAL project. The strategic investors Volkswagen, KIA Motors, etc. need to have the modern and efficient Logistics parks.Table 1. Logistics parks in the Slovak RepublicLocality name Total areaBratislava-Raca 66600m2Bratislava Logistics Park 300000 m2Devinska N.Ves Logistics Park 200000 m2Logistics Park Trnava 500000 m2Logistics Park Trencin 1000000 m2Euro Logistics Park Lozorno in operation 100000 m2ConclusionsLocality relationship with the technical infrastructure networks must evaluate the traffic connections with the road and railway network, the existence of the build up of the duct, the build up of the sewarage, proximity of the gas line and the energetics network.Further influences on the locality selection are the limits of the environment, strong points and weakness of the locality, possibilities of the locality potential, constraint and risks.There are a lot of opportunities for logistics centre and logistics services development in the Zilina region because this area is characterired by a huge industry development existing machineries, chemical and textile enterprises, KIA Motors car factory and a lot of subsuppliers factories and by increasing of the customers demand.The European best practice approach to the development of logistics parks and know-how obtained by building logistics centres in the Slovak Republic should be utilized in building the Zilina Logistics centre. Reorganization of the freight transport is one of the important instruments for practical realization of logistics goals.译文斯洛伐克共和国物流园区发展资料来源: //.u.lt 作者:Marian Sulgan摘要:本文主要是关于斯洛伐克共和国物流园区发展的实际情况。
Finding Optimal Addition Chains Using aGenetic Algorithm ApproachNareli Cruz-Cort´e sFrancisco Rodr´ıguez-Henr´ıquezRa´u l Ju´a rez MoralesCarlos A.Coello CoelloComputer Science Section,Electrical Engineering DepartmentCentro de Investigaci´o n y de Estudios Avanzados del IPNAv.Instituto Polit´e cnico Nacional No.2508,M´e xico D.F.nareli@computacion.cs.cinvestav.mx,{francisco,coello}@cs.cinvestav.mxAbstract.Since most public key cryptosystem primitives require thecomputation of modular exponentiation as their main building block,the problem of performing modular exponentiation efficiently has re-ceived considerable attention over the years.It is known that optimal(shortest)addition chains are the key mathematical concept for accom-plishing modular exponentiations optimally.However,finding an optimaladdition chain of length r is an NP-hard problem whose search spacesize is comparable to r!.In this contribution we explore the usage of aGenetic Algorithm(GA)approach for the problem offinding optimal(shortest)addition chains.We explain our GA strategy in detail report-ing several promising experimental results that suggest that evolutionaryalgorithms may be a viable alternative to solve this illustrious problemin a quasi optimal fashion.1IntroductionArgueably,thefield or modular exponentiation is the most important single arithmetic operation in public key cryptosystems.The search for efficient algo-rithm solutions for this problem has a long history whose roots can be traced as far back as the ancient works of Hindu mathematicians in200B.C[10]. In addition to its historical and theoretical relevance,field exponentiation has many important practical applications in the areas of error-correcting codes and cryptography.Modular exponentiation is used in several major public-key cryp-tosystems such as RSA,Diffie-Hellman and DSA[11].For instance,the RSA crypto-scheme is based on the computation of M e mod n,where e is afixed number,M is an arbitrarily chosen numeric message and n is the product of two large primes,namely,n=pq.Typical bit-lengths for n used in commercial appli-cations range from1024up to4096bits.In addition,modular exponentiation is also a major building block for several number theory problems including integer prime testing,integer factorization,field multiplicative inverse computation,etc.Letαbe an arbitrary integer in the range[1,n−1],and e and arbitrary pos-itive integer.Then,we define modular exponentiation as the problem offindingthe unique integerβ∈[1,n−1]that satisfies the equationβ=αe mod n(1) In order to improve legibility,in the rest of this paper we will drop the modular operator whenever it results unambiguous.In general,there exist two main strategies for computing Equation(1)effi-ciently.One approach is to implement modular multiplication,the main building block required for modular exponentiation,as efficiently as possible.The other is to reduce the total number of multiplications needed to computeβ.In this paper we address the latter approach,assuming that arbitrary choices of the base elementαare allowed but with the restriction that the exponent e isfixed.The problem of determining the correct sequence of multiplications required for performing a modular exponentiation can be elegantly formulated by using the concept of addition chains.Formally,An addition chain for e of length l is a sequence U of positive integers,u0=1,u1...,u l=e such that for each i>1, u i=u j+u k for some j and k with0≤j≤k<i.Therefore,if U is an addition chain that computes e as mentioned above,then for anyα∈[1,n−1]we can findβ=αe mod n by successively computing:α,αu1,...,αu l−1,αe.Let l(e)be the shortest length of any valid addition chain for a given positive integer e.Then the theoretical minimum number offield multiplications required for computing the modular exponentiation of(1)is precisely l(e).Unfortunately, the problem of determining an addition chain for e with the shortest length l(e) is an NP-hard problem[11].Therefore we have to use some sort of heuristic strategy in order tofind an optimal addition chain when dealing with sufficiently large exponents e.Generally speaking,a heuristic strategy tries tofind in a reasonable time near optimal results for hard optimization problems,i.e.those problems having huge search spaces.Typically,a heuristic method starts from a non-optimal solution population and iteration after iteration improves itsfindings until a reasonable and/or valid solution can be achieved.The gradual improvement on the partial results is done using either deterministic or probabilistic search criteria.Given a fixed set of initial conditions,the optimized solutions obtained by a deterministic heuristic will remain unchanged from run to run.On the contrary,repeated executions of a probabilistic heuristic may produce differentfinal solutions.Across the centuries,a vast amount of algorithms for computing modular exponentiation have been reported.Reported strategies include:binary,m-ary, adaptive m-ary,power tree,the factor method,etc.[9–11].On the other hand,relatively few probabilistic heuristics have been reported so far forfinding near optimal addition chains[13,4,3].In[13]a genetic algorithm search engine was proposed for solving this optimization problem but authors’strategy was only tested for small exponents.In[4]it was proposed the use of an artificial immune system as a probabilistic heuristic forfinding minimal-length addition chains.Those optimal addition chains were then used for computing multiplicative inverses on binary extensionfields.Although the addition chains found there were theoretically minimal,the required exponent sizes for that application are small(typically less than10bits).During the last three decades the interest on biologically inspired computing systems has grown in an important way [12,7,6].Evolutionary Algorithms are perhaps the most well-known techniques from this group [8,1],and they have been successfully applied to solve a very broad variety of optimization problems.In this paper,we present a Genetic Algorithm (GA)suited to optimize addition chains.The results obtained suggest that this approach is a very competitive alternative to the solution of the problem.The rest of this paper is organized as follows.In Section 2the problem in hand is stated in a formal way.Then,in Section 3some well-known determin-istic strategies for computing modular exponentiation are briefly described.In Section 4the Genetic Algorithm approach used in this work is described in detail.Section 5presents several experimental results obtained using our GA approach comparing them against the ones obtained by several selected deter-ministic strategies.Finally,in Section 6,our concluding remarks are drawn.2Problem StatementThe problem addressed in this work consists of finding the shortest addition chain for an exponent e .Formally,an addition chain can be defined as follows,Definition An addition chain U for a positive integer e of length l is a sequence of positive integers U ={u 0,u 1,···,u l },and an associated sequence of r pairs V ={v 1,v 2···,v l }with v i =(i 1,i 2),0≤i 2≤i 1<i ,such that:–u 0=1and u l =e ;–for each u i ,1≤i ≤l,u i =u i 1+u i 2.The search space for computing optimal addition chains increments its size at a factorial rate as there exist r !different and valid addition chains with length r .Clearly,the problem of finding the shortest ones becomes more and more complicated as r grows larger.3Deterministic Heuristics for Modular Exponentiation In this section,we briefly review some deterministic heuristics proposed in the literature for computing field exponentiation.For a complete description of these and other methods,interested readers are referred to [10,2].Let e be an arbitrary m -bit positive integer e ,with a binary expansion rep-resentation given as,e =(1e m −2...e 1e 0)2=2m −1+ m −2i =02i e i .Then,y =x e =x m −1i =02i e i =m −1i =0x 2i e i = e i =0x 2i (2)Binary strategies evaluate equation (2)by scanning the bits of the exponent e one by one,either from left to right (MSB-first binary algorithm)or from right to left (LSB-first binary algorithm)applying Horner’s rule.Both strategies requirea total of m−1iterations.At each iteration a squaring operation is performed, and if the value of the scanned bit is one,a subsequentfield multiplication is performed.Therefore,the binary strategy requires a total of m−1squarings and H(e)−1field multiplications,where H(e)is the Hamming weight of the binary representation of e.Thus,the computational complexity of the binary algorithm is given as,P(e,m)=m+H(e)−2= log2(e) +H(e)−1(3) The binary method discussed above can be generalized by scanning more than one bit at a time.Hence,the window method(first described in[10])scans k bits at a time.The window method is based on a k-ary expansion of the exponent, where the bits of the exponent e are divided into k-bit words or digits.The resulting words of e are then scanned performing k consecutive squarings and a subsequent multiplication as needed.For k=1,2,3,4the window method is called,respectively,binary,quaternary octary and hexa MSB-first exponentiation method.4The Proposed Genetic AlgorithmIn this work,we present a Genetic Algorithm(GA)approach suited forfinding optimal addition chains.When applying a GA strategy it results crucial to se-lect an appropriate chromosome representation as well as a well-definedfitness function.Additionally,any GA approach is instrumented by applying two main operators,namely,crossover and mutation operators.In the rest of this Section we describe how these design decisions were taken.4.1RepresentationOne of the most difficult decisions that must be taken when designing a GA is to select the most appropriate type of representation to encode the potential solutions of the problem of interest.In this work,we adopt an integer encoding,using variable-length chromo-somes.Each element from the addition chain is directly mapped on each gene in the chromosome.Then,in this case,the genotype and the phenotype are both the same.For example,if we are minimizing the addition chain for the exponent e= 6271,one candidate solution could be1→2→4→8→10→20→30→60→90→180→360→720→1440→2880→5760→5970→6150→6240→6270→6271This integer sequence represents a chromosome or individual I,where each gene I k corresponds to one step on the addition chain,for0≤k≤l with length l=20,and I l=6271.4.2Fitness FunctionSince we are looking for the minimal addition chain’s length,then the indi-vidual’sfitness is precisely the addition chain’s length,or in other words,the chromosome’s length.The shorter the chromosome’s length is,the better its fitness value,and vice versa.For example,consider the following addition chain,1→2→4→8→10→20→30→60→90→180→360→720→1440→2880→5760→5970→6150→6240→6270→6271.The associatedfitness of this chain is equal to20because its length is precisely l=20.4.3Crossover OperatorThe crossover operator creates two children from two parents.In our GA,we adopt one point crossover.Some extra considerations must be taken,however, mainly because of two reasons:first,it is necessary to assure that the resulting children are valid addition chains(i.e.,feasible ones)and second,the chromo-somes are of variable length.The way this operator produces offspring is illus-trated in Figure1and it is defined in the following pseudocode,Begin Function CrossoverFor a pair of parents(P1and P2)do:1.Select a randomly selected crossover point p such that(2≤p≤l−2)where l isthe chromosome length.2.Create child(C1),copy the P1’s values to the C1starting from0until p is reached,hence,For(k=0)to(k=p)C1k←P1kFrom the point p until e is reached,complete the child C1following the rules by which P2was created,in the following way,For(k=p+1)to(k=length)–Look for a and b values such that,P2k=P2a+P2b–Set C1k←C1a+C1bEndFor3.Create child(C2):For(k=0)to(k=p)–C2k←P2kEndForFor(k=p+1)to(k=length)–Look for a and b values such that,P1k=P1a+P1b–Set C2k←C2a+C2bEndForEnd Function CrossoverWe point out that the crossover operator is applied in the way described above only when that data manipulation does not produce values exceeding the exponent e. In case the value indicated by the crossover operator exceeds e then the value assigned would be the maximum allowable.Fig.1.Crossover Operator.4.4Mutation OperatorNext,we explain how the mutation operator was defined for this genetic algorithm. It is noted that our definition of this operator allows us to introduce random changes into the chromosome,while preserving addition chains’validity.BEGIN Function MutationFor each child(C)do:1.Randomly select a mutation point i and a random number j such that2≤j<i<(l−2),where l is the chromosome length.2.The new value of the child at the mutation point C i+1will be C i+1=C i+C j3.Repair the upper part of the chromosome{C k>i+1},using the following criterion:For k=i+2to l,with C l=e doIf(Flip(Z))then use the doubling rule whenever is possible,i.e,C k=2C k−1 Else if(flip(0.5))set C k=C k−1+C k−2Else set C k=C m+C n,where m and n are two randomly selectedintegers such that0≤m,n<l.END Function MutationF lip(Z)is a function that receives an input parameter Z such that0≤Z≤1.It returns true with probability Z,or false in other case.General GAHaving defined the main Genetic Algorithm primitives,we proceed to put them together into the skeleton structure of the GA strategy outlined below,BEGIN-General-GA1.Randomly create an initial population size N.2.cont←03.Repeat:(a)Compute individuals’fitness.(b)Select the N parents to be reproduced.(c)With probability P c,apply crossover operator to the N parents so that apopulation of N children is created.(d)Apply the mutation operator to the children with a probability P m.(e)Children will form the next generation population.(f)cont←cont+14.Go to step3.(a)until cont=Generations5.Report thefittest individual.END-General-GA.5Experiments and ResultsIn order to validate the GA approach described in the previous Section,we conducted a series of experiments,with the aim of comparing our GA’s experimental results against the ones obtained by using several traditional deterministic methods.Thefirst set of experiments consisted onfinding the accumulated addition chain lengths for all exponents e in a given interval as it was done in[2].Then,as a second test, we applied our genetic algorithm to a special class of exponents whose optimal addition chains are particularly hard tofind.All our experiments were performed by applying the following GA’s parameters:Population size N=100,Number of Generations= 300,Crossover Rate P c=0.6,Mutation Rate P m=0.5,Probability Z=0.7(used in the mutation operator),Selection=Binary Tournament.All the statistical results shown here were produced from30independent runs of the algorithm with different and independent random seeds(adopting a uniform distribution).Using our genetic algorithm approach,we computed the accumulated addition chain lengths for all thefirst1000exponents,i.e.e∈[1,1000].The accumulated value so ob-tained was then compared against the accumulated values reported in[2]by applying the following deterministic methods:Dyadic,Total,Fermat,Dichotomic,Factor,Qua-ternary and Binary[10,2].All results found are shown in Table1.It can be seen that in the best case,our GA approach obtained better results than all the other six meth-ods.In average,the GA approach was ranked in second place,only behind the Total method.It is noted that none of the features strategies was able tofind the optimal value that was found by performing an exhaustive search.Table1.Accumulated addition chain lengths for exponents e∈[1,1000]Optimal value=10808Strategy Total lengthDyadic[2]10837Total[2]10821Fermat[2]10927Dichotomic[2]11064Factor[2]11088Binary11925Quaternary11479Genetic Algorithm Best:10818Average:10824.07Averagen:10824Worst:10830Std.Dev.:2.59Furthermore,we computed the accumulated addition chain lengths for all the ex-ponents in the ranges e∈[1,512],e∈[1,2000]and e∈[1,4096].The methods used were the GA strategy,the binary method and the quaternary method.Once again andfor comparison purposes,we computed the corresponding optimal values(obtained by enumeration).Those results are shown in Table2.Clearly,the results obtained by the GA strategy outperformed both,the binary and the quaternary method,even in the worst case.We can observe that for the three cases considered(i.e.,512,2000and4096),the GA obtained a reasonably good ap-proximation of the optimal value.Table2.Accumulated addition chain lengths for512,2000and4096for all e∈[1,512]for all e∈[1,2000]for all e∈[1,4096]Optimal:4924Optimal:24063Optimal:54425Binary:5388Binary:26834Binary:61455Quaternary:5226Quaternary:25923Quaternary:58678Genetic Algorithm Genetic Algorithm Genetic AlgorithmBest:4925Best:24124Best:54648Average:4927.7Average:24135.17Average:54684.13Averagen:4927Averagen:24136Averagen:54685Worst:4952Worst:24144Worst:54709Std.Dev.:4.74Std.Dev:5.65Std.Dev.:13.55A special class of exponents hard to optimizeLet e=c(r)be the smallest exponent that can be reached using an addition chain of length r.Solutions for that class of exponents are known up to r=30and a compilation of them can be found in[5].Interesting enough,the computational difficulty offinding shortest addition chains for those exponents seems to be among the hardest if not the hardest one from the studied exponent families[10].We show the solutions found by the GA for the class of exponents shown in Table3.It is noted that in24out of30 exponents,the GA approach was able tofind the shortest addition chain.However, for the6remaining exponents(namely,357887,1176431,2211837,4169527,7624319 and14143037),our GA strategy found addition chains that where one unit above the optimal.Notice that the searching space size for this special class of exponents(considering both feasible and infeasible individuals)is r!.Hence,in the case of r=30,finding the shortest addition chain for the exponent c(r=30)=14143037,implied to launch a searching effort over a search space size of about,r!=30!=265252859812191058636308480000000≈2107possibilities.6Conclusions and Future WorkIn this paper we described how a genetic algorithm strategy can be applied to the problem offinding shortest addition chains for optimalfield exponentiation computa-tions.The GA heuristic presented in this work was capable offinding almost all the optimal addition chains for any givenfixed exponent e with e<4096.Taking into account the optimal value(which was found by enumeration)the percentage error of our GA strategy was within0.4%from the optimal for all cases considered.In other words,for any givenfixed exponent e with e<4096,our strategy was able tofind the requested shortest addition chain in at least99.6%of the cases.In a second experimentfor assessing the actual power of the GA strategy as a search engine,we tested it for generating the shortest addition chains of a class of exponents particularly hard to optimize,whose optimal lengths happen to be known for thefirst30members of the family.In most cases considered,the GA strategy was able tofind the optimal values. Future work includesfinding quasi optimal addition chains for128-bit exponents and beyond such as the ones typically used in commercial cryptographic applications. AcknowledgmentsThefirst and second authors acknowledge support from CONACyT through the CONA-CyT project number45306.The third and fourth authors acknowledge support from CONACyT through the NSF-CONACyT project number42435-Y.References1.Thomas B¨a ck,David B.Fogel,and Zbigniew Michalewicz,editors.Handbook ofEvolutionary Computation.Institute of Physics Publishing and Oxford University Press,New York,1997.2. F.Bergeron,J.Berstel,and S.Brlek.Efficient computation of addition chains.Journal de thorie des nombres de Bordeaux,6:21–38,1994.3.J.Bos and M.Coster.Addition chain heuristics.In G.Brassard,(editor)Advancesin Cryptology—CRYPTO89Lecture Notes in Computer Science,435:400–407, 1989.4.N.Cruz-Cortes,F..Rodriguez-Henriquez,and C.Coello Coello.On the optimalcomputation offinitefield exponentiation.In C Lematre,C.Reyes,J.Gonzlez, (editors)Advances in Artificial Intelligence-IBERAMIA2004:9th Ibero-American Conference on AI Lecture Notes in Computer Science,3315:747–756,November 2004.5. D.Bleinchenbacher and A.Flammenkamp.An Efficient Algorithm for ComputingShortest Addition Chains,1997.6.Leandro Nunes de Castro and Jonathan Timmis.An Introduction to ArtificialImmune Systems:A New Computational Intelligence Paradigm.Springer-Verlag, 2002.7.M.Dorigo and G.Di Caro.The Ant Colony Optimization Meta-Heuristic.InD.Corne,M.Dorigo,and F.Glover,editors,New Ideas in Optimization.McGraw-Hill,1989.8.David E.Goldberg.Genetic Algorithms in Search,Optimization and MachineLearning.Addison-Wesley Publishing Co.,Reading,Massachusetts,1989.9. D.M.Gordon.A survey of fast exponentiation methods.Journal of Algorithms,27(1):129–146,April1998.10.Donald Ervin Knuth.The Art of Computer Programming3rd.ed.Addison-Wesley,Reading,Massachusetts,1997.11. A.J.Menezes,Paul C.van Oorschot,and Scott A.Vanstone.Handbook of AppliedCryptography.CRC Press,Boca Raton,Florida,1996.12. A.Michalewicz and D.Fogel.How to Solve It:Modern Heuristics.Springer,1996.13.N.Nedjah and LD.Mourelle.Efficient pre-processing for large window-based mod-ular exponentiation using genetic algorithms.In Developments in Applied Artificial Intelligence Lecture Notes in Artificial Intelligence,2718:625–635,2003.Table3.Shortest addition chains for a special class of exponentsexponent Addition Chain Length e=c(r)r 110 21→21 31→2→32 51→2→3→53 71→2→3→5→74 111→2→3→5→8→115 191→2→3→5→7→12→196 291→2→3→4→7→11→18→297 471→2→3→5→10→20→40→45→478 711→2→3→5→7→12→17→34→68→719 1271→2→4→6→12→24→48→72→120→126→12710 1911→2→3→5→10→20→21→42→63→126→189→19111 3791→2→4→5→10→15→25→50→75→150→300→375→37912 6071→2→4→6→12→24→48→96→192→384→576→600→606→60713 10871→2→3→6→12→18→36→74→144→216→432→864→865→108114→108719031→2→3→5→10→13→26→52→104→105→210→420→840→168015→1890→190335831→2→3→6→12→18→36→72→108→216→432→864→1728→345616→3564→3582→358362711→2→3→6→12→24→48→96→192→384→768→1536→3072→614417→6240→6264→6270→6271112311→2→3→6→12→24→25→50→100→200→400→800→1600→320018→6400→9600→11200→11225→11231182871→2→3→6→9→15→30→45→47→94→188→190→380→760→152019→3040→6080→12160→18240→18287343031→2→3→6→12→14→28→56→112→224→448→504→1008→201620→4032→8064→16128→32256→34272→34300→34303651311→2→3→6→12→24→48→72→144→288→576→1152→2304→460821→4611→9222→18444→27666→55332→55908→65130→65131110591→1→2→4→5→10→20→40→80→160→320→640→1280→256022→2570→5140→7710→12850→25700→51400→102800→110510→110590→1105911965911→2→3→6→12→15→30→60→120→240→480→720→1440→288023→5760→11520→23040→46080→92160→184320→19584→196560→196590→1965913578871→2→3→4→8→16→32→64→128→256→257→514→771→1154224→3084→6168→12336→24672→49344→49347→98691→148038→296076→345423→357759→3578876859511→2→4→6→7→14→21→42→84→168→336→504→840→168025→3360→6720→13440→26880→53760→57120→114240→228480→342720→685440→685944→68595111764311→2→4→5→10→15→19→38→76→152→304→608→61227→1224→2448→4896→9792→19584→29376→58752→117504→235008→352512→587520→1175040→1176264→1176416→117643122118371→2→3→6→9→15→30→60→120→126→252→504→100828→2016→4032→8062→16128→16143→32286→64572→129144→258288→516576→1033152→2066304→2195448→2211591→2211717→221183741695271→2→3→6→12→24→48→96→192→384→768→1536→230429→4608→9216→18432→36864→73728→147456→294912→589824→589825→1179650→1769475→3538950→4128775→4165639→414167943→4169479→416952776243191→2→3→6→12→18→36→72→144→288→576→1152→122430→2448→4896→9792→19584→39168→78336→156672→313344→626688→1253376→1254600→1274184→1274185→2548370→5096740→6370925→7624301→7624319141430371→2→3→6→12→18→30→60→120→240→480→960→96131→1922→3844→7688→11532→23064→46128→92256→184512→369024→461280→830304→1660608→3321216→6642432→13284864→14115168→14138232→14142076→14143037。