Electrical capacitance tomography for flow imaging: System model for development of image reconstruction algorithms and design of primary sensors

A software tool that facilitates the development of image reconstruction algorithms, and the design of optimal capacitance sensors for a capacitance-based 12-electrode tomographic flow imaging system are described. The core of this software tool is the finite element (FE) model of the sensor, which is implemented in OCCAM-2 language and run on the Inmos T800 transputers. Using the system model, the in-depth study of the capacitance sensing fields and the generation of flow model data are made possible, which assists, in a systematic approach, the design of an improved image-reconstruction algorithm. This algorithm is implemented on a network of transputers to achieve a real-time performance. It is found that the selection of the geometric parameters of a 12-electrode sensor has significant effects on the sensitivity distributions of the capacitance fields and on the linearity of the capacitance data. As a consequence, the fidelity of the reconstructed images are affected. Optimal sensor designs can, therefore, be provided, by accommodating these effect

Incentive effects of common and separate queues with multiple servers: The principal-agent perspective

A two-server service network has been studied by Gilbert and Weng [13] fromthe principal-agent perspective. In the model, services are rendered by twoindependent facilities coordinated by an agency. The agency must devise astrategy to allocate customers to the facilities and determine the compensation.A common queue allocation scheme and separate queue allocation scheme are thencompared. It has been shown that the separate queue system gives morecompetition incentives to the independent facilities and induces a higherservice capacity. The main aim of this paper is to extend the results of thetwo-server queueing model to the case of multiple-server queueing model. Ouranalysis shows that in the case of multiple servers the separate queueallocation scheme creates more competition incentives for servers to increasetheir service capacities. In particular, when there are not severe diseconomiesassociated with increasing service capacity, the separate queue allocationscheme gives a lower expected sojourn time in equilibrium. © 2009 IEEE.published_or_final_versionProceedings of the 39th International Conference on Computers and Industrial Engineering (CIE39), Troyes, France, 6-8 July 2009, p. 1249-125

Quantity discount contract for supply chain coordination with false failure returns

Consumer return attracts more and more academic attention due to its rapidly expanding size, and a large portion of it falls into the category of false failure return, which refers to return without functional defect. In this paper, we exclusively consider profit results from exerting costly effort to reduce false failure returns in a reverse supply chain consisting of a retailer and a supplier. The supply chain as a whole has strong incentive to reduce false failure returns because it can avoid much reprocessing cost associated. But typically, retailers enjoy a full credit provided by suppliers in case of returns, and hence they may not have sufficient incentives to exert enough effort for supply chain profit maximization. In some scenarios they may even have the motivation to actually encourage such returns. We suggest using a coordination contract to resolve such profit conflicts. The contract we propose is a quantity discount contract specifying a payment to the retailer with an amount exponentially decreasing in the number of false failure returns. We give explicit forms of such contracts given different assumptions about distribution of the number of returns and we also prove that such contract is capable of increasing both retailer's and supplier's profit simultaneously. Besides, when the contract is used together with other forward supply chain coordination contracts in a closed-loop chain, it is shown that it can act to deter retailer's potential incentive to encourage false failure returns. Moreover, some modifications of the contract may lead to easy allocation of incremental profit within the supply chain. © 2010 IEEE.published_or_final_versionThe 6th International Conference on Natural Computation (ICNC 2010), Yantai, Shandong, China, 10-12 August 2010. In Proceedings of the International Conference on Natural Computation, 2010, v. 8, p. 4450-445

On improving incentive in a supply chain: Wholesale price contract vs quantity dependent contract

Theme: Soft Computing Techniques for Advanced Manufacturing and Service SystemsIn this paper, we first study the performance of a supply chain consisting of one retailer and one supplier. The supplier sets the price scheme of some goods and the retailer then decides the order level and sells the goods in the market. Specifically, a quadratic cost function is assumed here to approximate the U-shape cost curve commonly observed in industries. Two kinds of contracts offered by the supplier are investigated, namely wholesale price contract and quantity dependent contract. Wholesale price is fixed under the first contract but varies depending on order level under the second one. We show that certain wholesale price contract successfully induces the retailer to order at a level such that supply chain profit is maximized, but extra cost in implementation may occur due to supplier's disagreement on this price. Given this, we propose an efficiency measure to show to what extent the wholesale price contract helps to increase supply chain profit. For quantity dependent contract, we show that it can coordinate the supply chain and leads to a proportional division of supply chain profit. We then generalize the analysis to cover the case of multiple retailers and single supplier where similar results are also obtained.published_or_final_versionThe 40th International Conference on Computers and Industrial Engineering, (CIE 2010), Hyogo, Japan, 25-28 July 2010. In Proceedings of the International Conference on Computers & Industrial Engineering, 2010, p. 1-

Inducing optimal service capacities via performance-based allocation of demand in a queueing system with multiple servers

Theme: Soft Computing Techniques for Advanced Manufacturing and Service SystemsIn this paper, we study the use of performance-based allocation of demand in a multiple-server queueing system. The same problem with two servers have been studied in the literature. Specifically, it has been proposed and proved that the linear allocation and mixed threshold allocation policies are, respectively, the optimal state-independent and state-dependent allocation policy in the two-server case. The multiple-server linear allocation has also been shown to be the optimal state-independent policy with multiple servers. In our study, we focus on the use of a multiple-server mixed threshold allocation policy to replicate the demand allocation of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. Our results indicate that, for any given multiple-server state-independent policy that prohibits server overloading, there exists a multiple-server mixed threshold policy that gives the same demand allocation and thus have the same Nash equilibrium (if any). Moreover, such a policy can be designed so that the expected sojourn time at a symmetric equilibrium is minimized. Therefore, our results concur with previous two-server results and affirm that a trade-off between incentives and efficiency need not exist in the case of multiple servers.published_or_final_versionThe 40th International Conference on Computers and Industrial Engineering, (CIE 2010), Hyogo, Japan, 25-28 July 2010. In Proceedings of the International Conference on Computers & Industrial Engineering, 2010, p. 1-

Minimizing equilibrium expected sojourn time via performance-based mixed threshold demand allocation in a multiple-server queueing environment

We study the optimal demand allocation policies to induce high service capacity and achieve minimum expected sojourn times in equilibrium in a queueing system with multiple strategic servers. We propose the mixed threshold allocation policy as an optimal state-dependent policy that induces optimal service capacity from strategic servers. Compensation to the server can be paid at customer allocation or upon job completion. Our study focuses on the use of a multiple-server mixed threshold allocation policy to replicate the demand of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. The results indicate that, under both payment schemes, for any given multiple-server state-independent policy, there exists a multiple-server threshold policy that produces identical demand allocation and Nash equilibrium (if any). Moreover, the policy can be designed to minimize the expected sojourn time at a symmetric equilibrium. Further-more, under the payment-at-allocation scheme, our results, combining with existing results on the optimality of the multiple-server linear allocation policy, show that the mixed threshold policy can achieve the maximum feasible service capacity and thus the minimum feasible equilibrium expected sojourn time. Hence, our results agree with previous two-server results and affirm that a trade-off between incentives and efficiency need not exist in the case of multiple servers.published_or_final_versio

Pharmacological interventions in myopia management

Daily low-dose atropine has been shown to result in a reduction of > 50% in myopia progression over 3 years - with little to no rebound effect

Fiber-device-fiber gain from a sol-gel erbium-doped waveguide amplifier

Published versio

TSK Inference with Sparse Rule Bases

The Mamdani and TSK fuzzy models are fuzzy inference engines which have been most widely applied in real-world problems. Compared to the Mamdani approach, the TSK approach is more convenient when the crisp outputs are required. Common to both approaches, when a given observation does not overlap with any rule antecedent in the rule base (which usually termed as a sparse rule base), no rule can be fired, and thus no result can be generated. Fuzzy rule interpolation was proposed to address such issue. Although a number of important fuzzy rule interpolation approaches have been proposed in the literature, all of them were developed for Mamdani inference approach, which leads to the fuzzy outputs. This paper extends the traditional TSK fuzzy inference approach to allow inferences on sparse TSK fuzzy rule bases with crisp outputs directly generated. This extension firstly calculates the similarity degrees between a given observation and every individual rule in the rule base, such that the similarity degrees between the observation and all rule antecedents are greater than 0 even when they do not overlap. Then the TSK fuzzy model is extended using the generated matching degrees to derive crisp inference results. The experimentation shows the promising of the approach in enhancing the TSK inference engine when the knowledge represented in the rule base is not complete