基于XML的新闻管理系统设计

简要分析基于XML的新闻管理系统的架构及主要功能模块设计,构建Web Service实现新闻发布旨在实现信息资源共享,并通过案例加以说明。     

基于呼叫中心的客户关系管理系统服务流程优化研究

针对钢铁企业物流公司客户关系管理现状,及其客户服务请求处理流程中的不足,提出了基于呼叫中心的钢铁企业最优化客服请求处理流程及其技术实现,给出了平台功能设计,探讨了平台实现的关键技术。该系统充分满足客户满意度以及服务请求处理的及时性,快速性,确切性,可操作性等方面要求。     

New Paradigm of Data-Driven Smart Customisation through Digital Twin

Big data is one of the most important resources for the promotion of smart customisation. With access to data from multiple sources, manufacturers can provide on-demand and customised products. However, existing research of smart customisation has focused on data generated from the physical world, not virtual models. As physical data is constrained by what has already occurred, it is limited in the identification of new areas to improve customer satisfaction. A new technology called digital twin aims to achieve this integration of physical and virtual entities. Incorporation of digital twin into the paradigm of existing data-driven smart customisation will make the process more responsive, adaptable and predictive. This paper presents a new framework of data-driven smart customisation augmented by digital twin. The new framework aims to facilitate improved collaboration of all stakeholders in the customisation process. A case study of the elevator industry illustrates the efficacy of the proposed framework.     

Physics-guided logistic classification for tool life modeling and process parameter optimization in machining

This paper describes a physics-guided logistic classification method for tool life modeling and process parameter optimization in machining. Tool life is modeled using a classification method since the exact tool life cannot be measured in a typical production environment where tool wear can only be directly measured when the tool is replaced. In this study, laboratory tool wear experiments are used to simulate tool wear data normally collected during part production. Two states are defined: tool not worn (class 0) and tool worn (class 1). The non-linear reduction in tool life with cutting speed is modeled by applying a logarithmic transformation to the inputs for the logistic classification model. A method for interpretability of the logistic model coefficients is provided by comparison with the empirical Taylor tool life model. The method is validated using tool wear experiments for milling. Results show that the physics-guided logistic classification method can predict tool life using limited datasets. A method for pre-process optimization of machining parameters using a probabilistic machining cost model is presented. The proposed method offers a robust and practical approach to tool life modeling and process parameter optimization in a production environment.     

本体在Web服务发现中的应用

现在人们主要通过UDDI来查找Web服务,但其仅仅基于关键字,这决定了它不能根据所需功能的语义来更好地发现Web服务。本文先试图用DAML-S语言来描述Web服务的功能本体,然后提出了一个Web服务匹配框架-DAML-S/UDDI匹配器框架（DUMF）。虽然这一框架本身存在一些不完善的地方,但随着进一步改进,预计将在一定程度上解决Web服务发现的问题。     

浅议进一步发挥军事代表在武器装备全寿命费用管理中的作用

阐述了军事代表参与武器装备全寿命费用管理的现状和作用,提出了提高军事代表费用管理参与率的措施.     

20 kg铝锭铸造机铸模改进方案探讨

为了适应火车全面调速后货运高度的要求，提出了有效的铸模改进方案。对铸模改造前后的使用寿命进行了分析。通过改造达到了降低铝锭垛高的目的，同时延长了铸模的使用寿命。     

High-speed milling of titanium alloys using binderless CBN tools

The performance of conventional tools is poor when used to machine titanium alloys. In this paper, a new tool material, which is binderless cubic boron nitride (BCBN), is used for high-speed milling of a widely used titanium alloy Ti–6Al–4V. The performance and the wear mechanism of the BCBN tool have been investigated when slot milling the titanium alloy in terms of cutting forces, tool life and wear mechanism. This type of tool manifests longer tool life at high cutting speeds. Observations based on the SEM and EDX suggest that adhesion of workpiece and attrition are the main wear mechanisms of the BCBN tool when used in high-speed milling of Ti–6Al–4V.     

A GRASP × ELS approach for the job-shop with a web service paradigm packaging

The Job-Shop Scheduling Problem (JSSP) is well known for its complexity as an NP-hard disjunctive scheduling problem. The problem addressed in this paper is JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. An efficient GRASP × ELS approach is introduced for solving this problem. The efficiency is evaluated using the widely known 40 Laurence’s instances which encompass medium and large scale instances. The computational results prove that the proposed method competes with the best published methods in both quality of results and computational time. Recently, Web services have generated great interest in researchers. Such application architecture is based on the client–server model using existing Internet protocols and open standards. It provides new approaches to optimization methods. The proposed GRASP × ELS is packaged into a Web Service (WS), i.e., it offers for the research community an open access to our optimization approach. Moreover, the proposed web service can be even included in research future works with a very small programming effort.To favor utilization of the web service and to prove the facility in which the service could be used, we provide an example in Java proving that it is possible to obtain in less than 10 min a client application using the different methods exposed by this web service. Such usage extends to classical library inclusion in program with the difference that a method is called in the client side and represents an execution on the server.The Web Service paradigm is a new approach in spreading algorithms and therefore this paper stands at the crossroads of optimization research community and the web service community expectations. The GRASP × ELS provided in the web service, is a state of the art method which competes with previously published ones and which has the advantage of being available for free, in any languages, everywhere contributing in spreading operational research contribution.     

Self-scaling cooperative discovery of service compositions in unstructured P2P networks

We propose an efficient technique for improving the performance of automatic and cooperative compositions in unstructured Peer-to-Peer networks during service discovery. The technique exploits a probabilistic forwarding algorithm that uses different sources of knowledge, such as network density and service grouping, to reduce the amount of messages exchanged in the network. The technique, analysed in several network configurations by using a simulator to observe resolution time, recall and message overhead, presents good performance especially in dense and large-scale service networks.