Inspection models applicable to a finite planning horizon are developed for the following lifetime distributions: uniform, exponential, and Weibull distribution. For a given lifetime distribution, maximization of prof...
详细信息
Inspection models applicable to a finite planning horizon are developed for the following lifetime distributions: uniform, exponential, and Weibull distribution. For a given lifetime distribution, maximization of profit is used as the sole optimization criterion for determining an optimal planning horizon over which a system may be operated as well as ideal inspection times. Illustrative examples (focusing on the uniform and Weibull distributions and using Mathematica programs) are given. For some situations, evenly spreading inspections over the entire planning horizon are seen to result in the attainment of desirable profit levels over a shorter planning horizon. Scope for further research is given as well. Copyright (C) 2016 John Wiley & Sons, Ltd.
To meet the rapidly growing demand of localisation and tracking information of mobile agents in cyber-physical systems, in this paper, we propose a fully pipelined and parallel (FPP) hardware architecture of particle ...
详细信息
To meet the rapidly growing demand of localisation and tracking information of mobile agents in cyber-physical systems, in this paper, we propose a fully pipelined and parallel (FPP) hardware architecture of particle probability hypothesis density (PHD) filter for multi-target tracking on the multi-cores processor hardware platforms, where an improved resampling algorithm is designed. We formulate the demand of minimising the processing delay in this architecture as an optimisation problem, which can be efficiently solved by transforming it to a group of mixed non-linear integerprogramming problems. Delay analysis shows that the proposed FPP particle PHD filter achieves significant improvement of real-time performance, and simulation results demonstrate that tracking performance remains at the same level as traditional particle PHD filters.
In this paper, we propose novel mathematical models involving both single- and biobjective functions that deal with a flexible job shop scheduling problem in cellular manufacturing environment by taking into considera...
详细信息
In this paper, we propose novel mathematical models involving both single- and biobjective functions that deal with a flexible job shop scheduling problem in cellular manufacturing environment by taking into consideration exceptional parts, intercellular moves, intercellular transportation times, sequence-dependent family setup times, and recirculation. The problem has been known as NP-hard. The proposed models have been tested and solved using Lingo 11.0 with minimization of makespan for the problems involving about 4 cells, 4 part families, 15 parts, and 12 machines. The most suitable model among the proposed single-objective models is determined using the test results. Then, another objective function as total tardiness is added to this model. The obtained biobjective model is solved using the scalarization methods, the weighted sum method, e-constraint method, and conic scalarization method (CSM), in order to convert the mathematical model's objectives into a single-objective function. By utilizing these scalarization methods, the Pareto effective solutions are generated for a specific test problem. The advantages of the CSM are demonstrated by considering the Pareto effective solutions.
Content-Aware networking is the paradigm of network design, in which users' requests refer to the content instead of servers' addresses for accessing data. Such network architecture assumes that it is the resp...
详细信息
ISBN:
(纸本)9780769547374;9781467320016
Content-Aware networking is the paradigm of network design, in which users' requests refer to the content instead of servers' addresses for accessing data. Such network architecture assumes that it is the responsibility of the network itself to locate content and deliver it to the user in the most efficient way. In Content-Aware Network (CAN), data objects are replicated on multiple server machines, on behalf of content publishers, with the use of caching protocol. Client user access the content from the most appropriate server, at the rate allocated by the CAN, which affects the perceived utility. In this paper the problem of content placement and transmission rate allocation is considered. The problem is formulated as maximizing the total income of CAN operator, which receives payments proportional to the utility from subscribed users. However, CAN operator needs to pay for link utilization to the physical network operator and for server storage space to the hosting company. A two-level decomposition algorithm is presented which can be used as a decision support tool for the CAN operator.
暂无评论