炼油废白土在水泥厂燃煤自备电厂中再利用的实践

本项目主要研究和实现了工业废白土在BAYAH燃煤自备电厂中的再利用,实现变废为宝,减少了环境污染,同时为企业创造了一定的经济效益。针对废白土的特性,对燃料输送系统给煤机、皮带机、煤仓、下料溜子和排渣系统进行了改造。通过修改操作规程消除废白土对锅炉运行的影响。     

Output feedback controller for polytopic systems exploiting the direct searching of the design space

This paper deals with the problem of designing a robust static output feedback controller for polytopic systems. The current research that tackled this problem is mainly based on LMI method, which is conservative by nature. In this paper, a novel approach is proposed, which considers the design space of the controller parameters and iteratively partitions the space to small simplexes. Then, by assessing the stability in each simplex, the solution space for design parameters is directly determined. It has been theoretically proved that, if there exists a feasible solution in the design space, the algorithm can find it. To validate the result of the proposed approach, comparative simulation examples are given to illustrate the performance of the design methodology as compared to those of previous approaches.     

Unreliable numbers: error and harm induced by bad design can be reduced by better design

Number entry is a ubiquitous activity and is often performed in safety- and mission-critical procedures, such as healthcare, science, finance, aviation and in many other areas. We show that Monte Carlo methods can quickly and easily compare the reliability of different number entry systems. A surprising finding is that many common, widely used systems are defective, and induce unnecessary human error. We show that Monte Carlo methods enable designers to explore the implications of normal and unexpected operator behaviour, and to design systems to be more resilient to use error. We demonstrate novel designs with improved resilience, implying that the common problems identified and the errors they induce are avoidable.     

共网数字集群系统应用问题的研究

现今国内的数字集群网络发展存在局限性、差异性，还远没有达到“网”状分布的程度，因此，共网数字集群发展空间巨大、前景广阔。通过列举共网数字集群系统在龙嘉国际机场和长春雷锋车队的成功应用案例，探讨了我国共网数字集群系统应用的可行性和必要性。     

Decomposition of first-order hybrid Petri nets for hierarchical control of manufacturing systems

Although hybrid Petri net (HPN) is a popular formalism in modelling hybrid production systems, the HPN model of large scale systems gets substantially complicated for analysis and control due to large dimensionality of such systems. To overcome this problem, a typical approach is to decompose the net into subnets and then control the plant through hierarchical or decentralized structures. Although this concept has been widely discussed in the literature for discrete PNs, there is a lack of research for HPNs. In this paper, a new method of decomposition of first-order hybrid Petri nets (FOHPNs) is proposed first and then the hierarchical control of the subnets through a coordinator is introduced. The advantage of using the proposed approach is validated by an existing example. A sugar milling case study is analysed by using a decomposed FOHPN model and the optimization results are compared against the results of the approaches presented in other papers. Simulation results show not only an improvement in production rate, but also show the ability to control the plant online. In addition, by using the hierarchical control structure for an FOHPN model, it is possible to reduce the cost of communication links, improve the reliability of the system, maintain the plant locally, and partially redesign the system.     

An industrial case study on variability handling in large enterprise software systems

ContextEnterprise software systems (e.g., enterprise resource planning software) are often deployed in different contexts (e.g., different organizations or different business units or branches of one organization). However, even though organizations, business units or branches have the same or similar business goals, they may differ in how they achieve these goals. Thus, many enterprise software systems are subject to variability and adapted depending on the context in which they are used.ObjectiveOur goal is to provide a snapshot of variability in large scale enterprise software systems. We aim at understanding the types of variability that occur in large industrial enterprise software systems. Furthermore, we aim at identifying how variability is handled in such systems.MethodWe performed an exploratory case study in two large software organizations, involving two large enterprise software systems. Data were collected through interviews and document analysis. Data were analyzed following a grounded theory approach.ResultsWe identified seven types of variability (e.g., functionality, infrastructure) and eight mechanisms to handle variability (e.g., add-ons, code switches).ConclusionsWe provide generic types for classifying variability in enterprise software systems, and reusable mechanisms for handling such variability. Some variability types and handling mechanisms for enterprise software systems found in the real world extend existing concepts and theories. Others confirm findings from previous research literature on variability in software in general and are therefore not specific to enterprise software systems. Our findings also offer a theoretical foundation for describing variability handling in practice. Future work needs to provide more evaluations of the theoretical foundations, and refine variability handling mechanisms into more detailed practices.     

Cheese fortification using saturated monoglyceride self‐assembly structures as carrier of omega‐3 fatty acids

The purpose of this research was to study the capacity of emulsions containing saturated monoglyceride self‐assembly structures to deliver omega‐3 fatty acids in fresh soft cheese. To this aim, fortified emulsions containing different ratios of milk, saturated monoglycerides (MGs) and cod liver oil were added to milk before cheese‐making. These emulsions were characterised by distinct microstructural features observed by polarised light microscopy and apparent viscosity values. The omega‐3 delivery performance of MG emulsions highlighted that this strategy allowed a good retention of the omega‐3‐rich oil in the curd (up to 75%). The fortified cheeses showed yield value and fat content higher than those of control samples. The enriched cheese showed hardness and cohesiveness obtained by texture profile analysis similar to those of the unfortified product. Only a slight decrease in gumminess was detected in fortified cheese.     

Leader-following consensus of fractional-order multi-agent systems via adaptive control

This article focuses on the consensus problem of leader-following fractional-order multi-agent systems (MASs) with general linear and Lipschitz nonlinear dynamics. First, the distributed adaptive protocols for linear and nonlinear fractional-order MASs are constructed, respectively. We allow the control coupling gains to be time varying for each agent. Moreover, the adaptive modification schemes for the control gain are designed, which renders smaller control gains and thus requires smaller amplitude on the control input without sacrificing consensus convergence. Second, based on fractional-order Lyapunov stability theorem and Barbalat's lemma, two novel sufficient conditions in terms of linear matrix inequalities are provided to ensure that the leader-following consensus can be obtained in the case for any undirected connected communication graph. Furthermore, we show that the proposed algorithm also works for consensus of agents with intrinsic Lipschitz nonlinear dynamics. As a result, the proposed framework requires no global information and thus can be implemented in a fully distributed manner. Finally, the numerical simulations are given to demonstrate the effectiveness of obtained the theoretical results.     

Model checking temporal knowledge and commitments in multi-agent systems using reduction

Though modeling and verifying Multi-Agent Systems (MASs) have long been under study, there are still challenges when many different aspects need to be considered simultaneously. In fact, various frameworks have been carried out for modeling and verifying MASs with respect to knowledge and social commitments independently. However, considering them under the same framework still needs further investigation, particularly from the verification perspective. In this article, we present a new technique for model checking the logic of knowledge and commitments (CTLKC⁺). The proposed technique is fully-automatic and reduction-based in which we transform the problem of model checking CTLKC⁺ into the problem of model checking an existing logic of action called ARCTL. Concretely, we construct a set of transformation rules to formally reduce the CTLKC⁺ model into an ARCTL model and CTLKC⁺ formulae into ARCTL formulae to get benefit from the extended version of NuSMV symbolic model checker of ARCTL. Compared to a recent approach that reduces the problem of model checking CTLKC⁺ to another logic of action called GCTL¹, our technique has better scalability and efficiency. We also analyze the complexity of the proposed model checking technique. The results of this analysis reveal that the complexity of our reduction-based procedure is PSPACE-complete for local concurrent programs with respect to the size of these programs and the length of the formula being checked. From the time perspective, we prove that the complexity of the proposed approach is P-complete with regard to the size of the model and length of the formula, which makes it efficient. Finally, we implement our model checking approach on top of extended NuSMV and report verification results for the verification of the NetBill protocol, taken from business domain, against some desirable properties. The obtained results show the effectiveness of our model checking approach when the system scales up.     

Elitist clonal selection algorithm for optimal choice of free knots in B-spline data fitting

Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed.