Crack and flaw identification in elastodynamics using Kalman filter techniques

Filter-driven optimization based on the extended Kalman filter concept is used here for the numerical solution of crack and flaw identification problems in elastodynamics. The mechanical modeling of the studied two-dimensional problem, which includes the effect of unilateral contact along the sides of the crack, is done with the help of the boundary element method. The effect of various dynamical test loads and the applicability of this method for crack and defect identification in disks are investigated. The work has been supported by the German Research Foundation (DFG). Partial support has been provided by a Greek-German Research Cooperation Grant (IKYDA2001). This support is greatfully acknowledged.     

高校图书馆特色数据库建设的现状、问题与对策研究

个性化服务是图书馆的发展方向,提高特色资源,提高特色服务是图书馆的重要途径。随网络数字化的发展,图书馆的特色化更是生存和发展的要求。本文主要介绍了现在高校图书馆的特色数据库建设的现状和问题。以及提出了对图书馆的特设数据库发展提出了建设性对策。     

中职学校计算机教学中值得重视的四个问题

随着当今社会的飞速发展,计算机的发展愈来愈迅速,应用也愈来愈普及,中职学校的计算机专业的很多课程已渗透到其他专业,计算机教学已越来越普及、重要。本文根据作者多年计算机教学的体会,简单总结和分析了在中职学校计算机教学中值得重视的强化学生学习计算机知识的意识、合理安排计算机课程比例、培养学生对计算机知识的自学能力、考核计算机教学中的实践能力等四个问题。     

浅议ERP系统在企业财务管理中的应用

本文首先简单介绍了SAPERP系统;其次,分析了ERP系统对企业财务管理的影响;最后,探讨了ERP系统在企业财务管理中的应用问题及对策。     

无线传感网中的安全问题

发展物联网已提升到我国国家战略的重要高度。无线传感网作为物联网的重要组成部分,随着其应用越来越广,其安全问题已成为关注的焦点。在介绍无线传感网特性的基础上,全面分析了无线传感网存在的安全问题,为无线传感网安全研究和应用指出了努力的方向。     

无线局域网技术安全性

本文在阐述无线局域网安全发展概况的基础上,分析了无线局域网的安全必要性,并从不同方面总结了无线局域网遇到的安全风险,同时重点分析了IEEE802.11b标准的安全性、影响因素及其解决方案,最后对无线局域网的安全技术发展趋势进行了展望。     

高校档案数字化实践中的思考

档案数字化是信息时代对于档案工作的新要求,推进档案数字化建设也是高校信息化工程中的一项基础性工作。档案数字化工作给予了档案人新的使命和机遇,然而在实际工作中也存在很多问题和困难。本文就高校档案数字化实践中存在的若干问题以及我们的思考探索做了阐述。     

ERP在企业应用中存在的问题及对策研究

为了迎接挑战,增强企业竞争实力,使企业在日趋全球化的市场竞争中获得生存与发展的空间,许多企业正在实施或准备实施EKP.本文从ERP在我国企业应用的现状入手,分析了ERP在实际应用中存在的问题,并提出了相应的对策,以期进一步完善ERP在我国企业中的应用,增强企业竞争力.     

云南少数民族地区计算机高等教育的现状与思考

本文从云南少数民族计算机高等教育的概念出发,分析了当前云南省民族地区计算机高等教育的现状以及存在的问题,并在此基础上提出了民族地区少数民族高等教育的对策。     

A New Algorithm To Solve Vehicle Routing Problems (VRPs)

Efficient Resource management has a direct influence on business performance and profitability. Vehicle Routing Problems (VRPs) considered in this paper are resource management problems where the aim is to use the limited number of resources to a large number of jobs so that the maximum number of jobs can be completed with minimum cost. A VRP consists of a workforce of maintenance engineers and a set of geographically distributed customers requiring certain services. The problem is complicated by incorporating certain technological and temporal constraints. The objective is to maximize the amount of work done measured in terms of total number of jobs completed and to minimize the total distance travelled by all the engineers. The solution to a VRP is a list of engineers and for each engineer a tour consisting of an ordered list of services to be completed by him under the given constraints. These Problems belong to the class of NP-Complete problems. The stochastic techniques such as Hill-Climbing (HC), Tabu Search (TS), Genetic Algorithms (GA) and Simulated Annealing (SA) are found to be suitable for solving these problems efficiently. It is found empirically that out of these SA gives good results for VRPs. But in some cases it also gives poor quality results. This happens due to not allocating intelligently the unallocated jobs in SA in subsequent iterations. A new algorithm is proposed to solve VRPs in this paper. This is achieved by allocating unallocated jobs intelligently in SA. The proposed algorithm is tested empirically on a number of randomly generated VRPs. Three types of VRPs considered are over resourced, under resourced and critically resourced VRPs. In almost all cases, the proposed algorithm completes a large number of jobs with minimum cost in comparison with SA.