COMMIT TIME DECISION FOR MEASURING DEMAND SIDE QUALITY COSTS WITH LIMITED DISTRIBUTION INFORMATION

2004 ◽  
Vol 03 (03) ◽  
pp. 435-452 ◽  
Author(s):  
JINFENG YUE ◽  
MIN-CHIANG WANG ◽  
ZHIMIN HUANG
Keyword(s):  
Processing Time ◽  
Maximum Amount ◽  
Time Range ◽  
Demand Side ◽  
Delivery Time ◽  
Numerical Examples ◽  
Additional Information ◽  
Quality Costs ◽  
The Mean ◽  
Machine Processing

Consider a single machine processing multiproducts situation when only the mean and standard deviation of processing time for each product are available. The bounds of optimal commit delivery time range are obtained. A decision of the robust commit delivery time is suggested. An extension to the situation with information of orders in queue is also discussed. Numerical examples show that the suggested decision performs well. The expected value of additional information, which measures the maximum amount a decision maker is willing to pay for knowledge of true distribution information, is small, and that further demonstrates the worthiness of the suggested robust decision.

scholarly journals Exercise Intensity during Olympic-Distance Triathlon in Well-Trained Age-Group Athletes: An Observational Study

Sports ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 18
Author(s):  
Atsushi Aoyagi ◽  
Keisuke Ishikura ◽  
Yoshiharu Nabekura
Keyword(s):  
Heart Rate ◽  
Observational Study ◽  
Exercise Intensity ◽  
Time Range ◽  
Age Group ◽  
Slow Group ◽  
H 41 ◽  
The Mean ◽  
Aerobic And Anaerobic ◽  
Very High

The aim of this study was to examine the exercise intensity during the swimming, cycling, and running legs of nondraft legal, Olympic-distance triathlons in well-trained, age-group triathletes. Seventeen male triathletes completed incremental swimming, cycling, and running tests to exhaustion. Heart rate (HR) and workload corresponding to aerobic and anaerobic thresholds, maximal workloads, and maximal HR (HRmax) in each exercise mode were analyzed. HR and workload were monitored throughout the race. The intensity distributions in three HR zones for each discipline and five workload zones in cycling and running were quantified. The subjects were then assigned to a fast or slow group based on the total race time (range, 2 h 07 min–2 h 41 min). The mean percentages of HRmax in the swimming, cycling, and running legs were 89.8% ± 3.7%, 91.1% ± 4.4%, and 90.7% ± 5.1%, respectively, for all participants. The mean percentage of HRmax and intensity distributions during the swimming and cycling legs were similar between groups. In the running leg, the faster group spent relatively more time above HR at anaerobic threshold (AnT) and between workload at AnT and maximal workload. In conclusion, well-trained male triathletes performed at very high intensity throughout a nondraft legal, Olympic-distance triathlon race, and sustaining higher intensity during running might play a role in the success of these athletes.

scholarly journals Improved Visual Localization via Graph Filtering

2021 ◽  
Vol 7 (2) ◽  
pp. 20
Author(s):  
Carlos Lassance ◽  
Yasir Latif ◽  
Ravi Garg ◽  
Vincent Gripon ◽  
Ian Reid
Keyword(s):  
Image Retrieval ◽  
Large Scale ◽  
Visual Localization ◽  
Localization Accuracy ◽  
Additional Information ◽  
Feature Representations ◽  
The Mean ◽  
Classical Image ◽  
Vision Based Localization ◽  
Improve Reliability

Vision-based localization is the problem of inferring the pose of the camera given a single image. One commonly used approach relies on image retrieval where the query input is compared against a database of localized support examples and its pose is inferred with the help of the retrieved items. This assumes that images taken from the same places consist of the same landmarks and thus would have similar feature representations. These representations can learn to be robust to different variations in capture conditions like time of the day or weather. In this work, we introduce a framework which aims at enhancing the performance of such retrieval-based localization methods. It consists in taking into account additional information available, such as GPS coordinates or temporal proximity in the acquisition of the images. More precisely, our method consists in constructing a graph based on this additional information that is later used to improve reliability of the retrieval process by filtering the feature representations of support and/or query images. We show that the proposed method is able to significantly improve the localization accuracy on two large scale datasets, as well as the mean average precision in classical image retrieval scenarios.

Stochastic Analysis of Temperature Distribution in a Solid With Random Heat Conductivity

1988 ◽  
Vol 110 (1) ◽  
pp. 23-29 ◽  
Author(s):  
Da Yu Tzou
Keyword(s):  
Thermal Conductivity ◽  
Temperature Distribution ◽  
Heat Conductivity ◽  
Stochastic Analysis ◽  
Solid Medium ◽  
Mean Value ◽  
Random Response ◽  
Thermal Failure ◽  
Numerical Examples ◽  
The Mean

Stochastic temperature distribution in a solid medium with random heat conductivity is investigated by the method of perturbation. The intrinsic randomness of the thermal conductivity k(x) is considered to be a distribution function with random amplitude in the solid, and several typical stochastic processes are considered in the numerical examples. The formulation used in the present analysis describes a situation that the statistical orders of the random response of the system are the same as those of the intrinsic random excitations, which is characteristic for the problem with extrinsic randomness. The maximum standard deviation of the temperature distribution from the mean value in the solid medium reveals the amount of unexpected energy experienced by the solid continuum, which should be carefully inspected in the thermal-failure design of structures with intrinsic randomness.

scholarly journals A New Approach for Analyzing the Reliability of the Repair Facility in a Series System with Vacations

2012 ◽  
Vol 2012 ◽  
pp. 1-16
Author(s):  
Renbin Liu ◽  
Yong Wu
Keyword(s):  
Renewal Process ◽  
Decomposition Method ◽  
Process Theory ◽  
Series System ◽  
New Approach ◽  
Numerical Examples ◽  
Special Cases ◽  
The Mean ◽  
Repair Facility

Based on the renewal process theory we develop a decomposition method to analyze the reliability of the repair facility in ann-unit series system with vacations. Using this approach, we study the unavailability and the mean replacement number during(0,t]of the repair facility. The method proposed in this work is novel and concise, which can make us see clearly the structures of the facility indices of a series system with an unreliable repair facility, two convolution relations. Special cases and numerical examples are given to show the validity of our method.

scholarly journals THE LUCK IN “TALENT VERSUS LUCK” MODELING

2020 ◽  
Vol 23 (03) ◽  
pp. 2050007
Author(s):  
SEAN ELVIDGE
Keyword(s):  
Mean Value ◽  
Maximum Amount ◽  
Random Numbers ◽  
Individual Parameter ◽  
Input Parameters ◽  
The Mean ◽  
Model Variability ◽  
The Impact ◽  
The Relationship

This paper further investigates the Talent versus Luck (TvL) model described by [Pluchino et al. Talent versus luck: The role of randomness in success and failure, Adv. Complex Syst. 21 (2018) 1850014] which models the relationship between ‘talent’ and ‘luck’ on the impact of an individuals career. It is shown that the model is very sensitive to both random sampling and the choice of value for the input parameters. Running the model repeatedly with the same set of input parameters gives a range of output values of over 50% of the mean value. The sensitivity of the inputs of the model is analyzed using a variance-based approach based upon generating Sobol sequences of quasi-random numbers. When using the model to look at the talent associated with an individual who has the maximum capital over a model run it has been shown that the choice for the standard deviation of the talent distribution contributes to 67% of the model variability. When investigating the maximum amount of capital returned by the model the probability of a lucky event at any given epoch has the largest impact on the model, almost three times more than any other individual parameter. Consequently, during the analysis of the model results one must keep in mind the impact that only small changes in the input parameters can have on the model output.

scholarly journals Treatment planning comparison of volumetric modulated arc therapy with Trilogy and Halcyon for bilateral breast cancer

2021 ◽  
Author(s):  
Tao Sun ◽  
Xiutong Lin ◽  
Guifang Zhang ◽  
Qingtao Qiu ◽  
Chengqiang Li ◽  
...  
Keyword(s):  
Breast Cancer ◽  
Treatment Planning ◽  
Volumetric Modulated Arc Therapy ◽  
Bilateral Breast Cancer ◽  
Planning System ◽  
Skin Dose ◽  
Delivery Time ◽  
Dose Volume ◽  
Arc Therapy ◽  
The Mean

Abstract Background: The Halcyon is a new machine from the Varian company. The purpose of this study was to evaluate the dosimetry of the Halcyon in treatment of bilateral breast cancer with volumetric modulated arc therapy. Methods: On CT images of 10 patients with bilateral breast cancer, four Halcyon plans with different setup fields were generated, and dosimetric comparisons using Bonferroni’s multiple comparisons test were conducted among the four plans. Whole and partial arc plans on the Trilogy and the Halcyon, referred to as T-4arc, T-8arc, H-4arc and H-8arc, were designed. The prescription dose was 50 Gy in 2-Gy fractions. All plans were designed with the Eclipse version 15.5 treatment planning system. The dosimetric differences between whole and partial arc plans in the same accelerator were compared using the Mann-Whitney U test. The better Halcyon plan was selected for the further dosimetric comparison of the plan quality and delivery efficiency between the Trilogy and the Halcyon. Results:Halcyon plans with high‐quality megavoltage cone beam CT setup fields increased the Dmean, D2 and V107 of the planning target volume (PTV) and the V5 and Dmean of the heart, left ventricle (LV) and lungs compared with other Halcyon setup plans. The mean dose and low dose volume of the heart, lungs and liver were significantly decreased in T-8arc plans compared to T-4arc plans. In terms of the V5, V20, V30, V40 and Dmean of the heart, the V20, V30, V40 and Dmean of the LV, the V30, V40, Dmax and Dmean of the left anterior descending artery (LAD), and the V5 and V40 of lungs, H-8arc was significantly higher than H-4arc (p<0.05). Compared with the Trilogy’s plans, the Halcyon’s plans reduced the high-dose volume of the heart and LV but increased the mean dose of the heart. For the dose of the LAD and the V20 and V30 of lungs, there was no significant difference between the two accelerators. Compared with the Trilogy, plans on the Halcyon significantly increased the skin dose but also significantly reduced the delivery time. Conclusion: For the Halcyon, the whole-arc plans have more dosimetric advantages than partial-arc plans in bilateral breast cancer radiotherapy. Although the mean dose of the heart and the skin dose are increased, the doses of the cardiac substructure and other OARs are comparable to the Trilogy, and the delivery time is significantly reduced.

Application of Interactive Deformation to Assembled Mesh Models for CAE Analysis

2007 ◽  
Author(s):  
Hiroshi Masuda ◽  
Kenta Ogawa
Keyword(s):  
Mean Curvature ◽  
Processing Time ◽  
Mesh Deformation ◽  
Mechanical Parts ◽  
Sheet Structure ◽  
Cae Analysis ◽  
The Mean ◽  
Mesh Models ◽  
New Framework ◽  
Assembly Models

Mesh deformation, which is sometimes referred to as mesh morphing in CAE, is useful for providing various shapes of meshes for CAE tools. This paper proposes a new framework for interactively and consistently deforming assembly models of sheet structure for mechanical parts. This framework is based on a surface-based deformation, which calculates the vertex positions so that the mean curvature normal is preserved at each vertex in a least squares sense. While existing surface-based deformation techniques cannot simultaneously deform assembly mesh models, our method allows us to smoothly deform disconnected meshes by propagating the rotations and translations through disconnected vertices. In addition, we extend our deformation technique to handle non-manifold conditions, because shell structure models may include non-manifold edges. We have applied our method to assembly mesh models of automobile parts. Our experimental results have shown that our method requires almost the same pre-processing time as existing methods and can deform practical assembly models interactively.

scholarly journals Optimal Buffer Allocation For Unpaced Balanced And Unbalanced Mean Processing Time

2012 ◽  
Author(s):  
Zalinda Othman ◽  
Shahrul Kamaruddin ◽  
Mohd. Shihabudin Ismail
Keyword(s):  
Key Words ◽  
Coefficient Of Variation ◽  
Production Line ◽  
Processing Time ◽  
Simulation Method ◽  
Buffer Allocation ◽  
Throughput Rate ◽  
Processing Times ◽  
The Mean

Artikel ini membincangkan peruntukan penampan optimum untuk talian pengeluaran unpaced yang pendek dan boleh diharap (tiada mesin rosak). Parameter utama yang mempengaruhi talian dalam kajian ini adalah min masa pemprosesan (μ) dan pekali variasinya (Cv). Lapan taburan min masa pemprosesan telah dikaji. Setiap taburan dipadankan dengan 15 konfigurasi peruntukan penampan. Kaedah simulasi digunakan bagi menganggar kadar keluaran talian untuk setiap kes. Keputusan kajian menunjukkan peruntukan penampan tertentu mempengaruhi kadar keluaran talian. Bagi talian yang boleh diharap dan min seimbang, peruntukan penampan yang optima adalah dengan mengagihkan bilangan penampan secara sama rata ke setiap slot penampan. Jika penampan tambahan diperlukan selepas agihan dilakukan, letakkan penampan tambahan tersebut pada slot penampan yang di tengah. Manakala bentuk peruntukan penampan yang baik bagi talian yang mempunyai min tidak seimbang (dengan anggapan setiap stesen mempunyai Cv tetap dan boleh diharap) ialah mengikut bentuk taburan min masa pemprosesan talian tersebut. Kata kunci: Talian pengeluaran unpaced, min tidak seimbang, peruntukan penampan optima, talian seimbang, talian pengeluaran unpaced boleh diharap This article discusses an optimal buffer allocation for short unpaced production line and it is assumed reliable (no machines breakdown). The main parameters that affect the line are mean processing time (μ) and its coefficient of variation (Cv). Eight different mean processing time distributions were studied. Each distribution was matched with 15 different buffer allocations. Simulation method was used to estimate the line throughput rate. The results showed that the allocation of buffers affect the throughput rate. For a reliable and balanced line, the optimum buffer allocation is by equally distributing the number of buffers to each buffer slot. In the case of an extra buffer is needed after equally distribution, it is placed at the center buffer slot. Meanwhile, the best buffer allocation shape for a line with unbalanced mean (with the assumption that each station is having fixed Cv and is reliable) follows the shape of the mean processing times of that line. Key words: Unpaced production line, unbalanced mean, optimal buffer allocation, balanced line, reliable unpaced production line

scholarly journals Heuristic for Stochastic Online Flowshop Problem with Preemption Penalties

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Mohammad Bayat ◽  
Mehdi Heydari ◽  
Mohammad Mahdavi Mazdeh
Keyword(s):  
Standard Deviation ◽  
Processing Time ◽  
Heuristic Method ◽  
Heuristic Procedure ◽  
Release Date ◽  
Numerical Examples ◽  
Processing Times ◽  
Flowshop Problem ◽  
Expected Makespan ◽  
Actual Processing Time

The deterministic flowshop model is one of the most widely studied problems; whereas its stochastic equivalent has remained a challenge. Furthermore, the preemptive online stochastic flowshop problem has received much less attention, and most of the previous researches have considered a nonpreemptive version. Moreover, little attention has been devoted to the problems where a certain time penalty is incurred when preemption is allowed. This paper examines the preemptive stochastic online flowshop with the objective of minimizing the expected makespan. All the jobs arrive overtime, which means that the existence and the parameters of each job are unknown until its release date. The processing time of the jobs is stochastic and actual processing time is unknown until completion of the job. A heuristic procedure for this problem is presented, which is applicable whenever the job processing times are characterized by their means and standard deviation. The performance of the proposed heuristic method is explored using some numerical examples.

Reliability Analysis of a System with Multiple-Stage Policy Considering Type I and II Errors

2019 ◽  
Vol 26 (06) ◽  
pp. 1950028
Author(s):  
Mitsuhiro Imaizumi ◽  
Mitsutaka Kimura
Keyword(s):  
Type I Error ◽  
The Other ◽  
Renewal Processes ◽  
Type I ◽  
Numerical Examples ◽  
Markov Renewal Processes ◽  
The Mean ◽  
Mean Time ◽  
Server System ◽  
Multiple Stages

This paper formulates a stochastic model for a system with illegal access. The server has the function of IDS, and illegal access is checked in multiple stages which consist of simple check and detailed check. In this model, we consider type I and II errors of simple check and a type I error of detailed check. There are two cases where IDS judges the occurrence of illegal access erroneously. One is when illegal access does not occur, and the other is when illegal access occurs. We apply the theory of Markov renewal processes to a system with illegal access, and derive the mean time and the expected checking number until a server system becomes faulty. Further, an optimal policy which minimizes the expected cost is discussed. Finally, numerical examples are given.

Sign in / Sign up

Export Citation Format

Share Document