The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we study the purchasing strategy problem when the suppliers' reliability is uncertain. This problem is derived from the real world situation in the power metering device industry. Besides the price and product category each supplier can provide, the purchasing strategy is also influenced by other intangible impacts, i.e. wild fluctuations of suppliers' reliability and lead time can...
In this paper, we propose a dynamic resource optimization scheme for a heterogeneous wireless network combining with a radio frequency (RF) access point (AP) and multiple visible light communication (VLC) APs. For adapting to the stochastic media content arrival rates and dynamic wireless channel conditions, a two-timescale stochastic network resource optimization problem is formulated by employing...
One of the goals of 5G wireless systems stated by the NGMN alliance is to provide moderate rates (50+ Mbps) everywhere and with very high reliability. We term this service Ultra-Reliable Ubiquitous-Rate Communication (UR2C). This paper investigates the role of frequency reuse in supporting UR2C in the downlink. To this end, two frequency reuse schemes are considered: user-specific frequency reuse...
Low-carbon electric power systems are often characterized by high shares of renewables, such as wind power. The variable nature and limited predictability of some renewables will require novel system operation methods to properly size and cost-efficiently allocate the required reserves. The current state-of-the-art stochastic unit commitment models internalize this sizing and allocation process by...
We describe a kind of supply chain optimization problem as a commodity stream routing problem upon a stochastic flow network. We divide the optimization problem to two parts: Firstly, establish model to calculate the optimal commodity stream allocation policy on all minimal paths; secondly, convert these allocation policy on all minimal paths to the optimal routing policy on all arcs. A multi-objective...
In this paper, two problems of optimal resource allocation to modules during testing phase are studied: (1) maximization of the number of faults removed when the amount of testing-effort is fixed, and (2) maximization of the number of faults removed satisfying a certain percentage of initial faults to be removed with a fixed amount of testing-effort. These optimization problems are formulated as nonlinear...
This paper proposes a fast forward medium access control protocol (FFMAC) for quality-of-service (QoS) guarantee in multihop IEEE 802.11s wireless mesh networks with multiple channels. To the best of our knowledge, the proposed protocol is the first one which considers the multihop and multichannel issues simultaneously. It provides higher priority for real-time applications, while remaining the distributed...
R and D projects are viewed as networks of inter-related events to be achieved in proper ordered sequence. This paper generalizes some earlier work. The present paper takes cognizance of technical performance and scarce resources as well as time. By means of the analysis presented herein, it is possible to find the optimal combination of time, technical performance level, and resources for any project.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.