scholarly journals Data-Driven Approaches Can Overcome the Cost–Accuracy Trade-Off in Multireference Diagnostics

2020 ◽  
Vol 16 (7) ◽  
pp. 4373-4387 ◽  
Author(s):  
Chenru Duan ◽  
Fang Liu ◽  
Aditya Nandy ◽  
Heather J. Kulik
Keyword(s):  
Data Driven ◽  
Trade Off ◽  
The Cost

Developing Schedule With Linear Programming (Case Study: STTF II Project Komplek Sukamukti Banjaran)

2020 ◽  
Vol 4 (02) ◽  
pp. 34-45
Author(s):  
Naufal Dzikri Afifi ◽  
Ika Arum Puspita ◽  
Mohammad Deni Akbar
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Project Scheduling ◽  
Time Limit ◽  
Minimum Time ◽  
Service Cost ◽  
Trade Off ◽  
Overtime Work ◽  
The Cost

Shift to The Front II Komplek Sukamukti Banjaran Project is one of the projects implemented by one of the companies engaged in telecommunications. In its implementation, each project including Shift to The Front II Komplek Sukamukti Banjaran has a time limit specified in the contract. Project scheduling is an important role in predicting both the cost and time in a project. Every project should be able to complete the project before or just in the time specified in the contract. Delay in a project can be anticipated by accelerating the duration of completion by using the crashing method with the application of linear programming. Linear programming will help iteration in the calculation of crashing because if linear programming not used, iteration will be repeated. The objective function in this scheduling is to minimize the cost. This study aims to find a trade-off between the costs and the minimum time expected to complete this project. The acceleration of the duration of this study was carried out using the addition of 4 hours of overtime work, 3 hours of overtime work, 2 hours of overtime work, and 1 hour of overtime work. The normal time for this project is 35 days with a service fee of Rp. 52,335,690. From the results of the crashing analysis, the alternative chosen is to add 1 hour of overtime to 34 days with a total service cost of Rp. 52,375,492. This acceleration will affect the entire project because there are 33 different locations worked on Shift to The Front II and if all these locations can be accelerated then the duration of completion of the entire project will be effective

scholarly journals Black Hole Algorithm for Sustainable Design of Counterfort Retaining Walls

2020 ◽  
Vol 12 (7) ◽  
pp. 2767 ◽  
Author(s):  
Víctor Yepes ◽  
José V. Martí ◽  
José García
Keyword(s):  
Black Hole ◽  
Sustainable Design ◽  
Retaining Walls ◽  
The Other ◽  
Trade Off ◽  
Construction Company ◽  
Geometric Variables ◽  
The Stability ◽  
The Cost ◽  
Black Hole Algorithm

The optimization of the cost and CO 2 emissions in earth-retaining walls is of relevance, since these structures are often used in civil engineering. The optimization of costs is essential for the competitiveness of the construction company, and the optimization of emissions is relevant in the environmental impact of construction. To address the optimization, black hole metaheuristics were used, along with a discretization mechanism based on min–max normalization. The stability of the algorithm was evaluated with respect to the solutions obtained; the steel and concrete values obtained in both optimizations were analyzed. Additionally, the geometric variables of the structure were compared. Finally, the results obtained were compared with another algorithm that solved the problem. The results show that there is a trade-off between the use of steel and concrete. The solutions that minimize CO 2 emissions prefer the use of concrete instead of those that optimize the cost. On the other hand, when comparing the geometric variables, it is seen that most remain similar in both optimizations except for the distance between buttresses. When comparing with another algorithm, the results show a good performance in optimization using the black hole algorithm.

Hybrid last mile delivery fleets with crowdsourcing: A systems view of managing the cost‐service trade‐off

2021 ◽  
Author(s):  
Vincent E. Castillo ◽  
John E. Bell ◽  
Diane A. Mollenkopf ◽  
Theodore P. Stank
Keyword(s):  
Service Trade ◽  
Trade Off ◽  
Last Mile ◽  
The Cost ◽  
Last Mile Delivery ◽  
Systems View

scholarly journals Aggregation of cohorts for histopathological diagnosis with deep morphological analysis

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Jeonghyuk Park ◽  
Yul Ri Chung ◽  
Seo Taek Kong ◽  
Yeong Won Kim ◽  
Hyunho Park ◽  
...  
Keyword(s):  
Cancer Detection ◽  
Morphological Analysis ◽  
Deep Neural Networks ◽  
Large Datasets ◽  
Histopathological Diagnosis ◽  
Single Model ◽  
Trade Off ◽  
Detection Model ◽  
Optimal Behavior ◽  
The Cost

AbstractThere have been substantial efforts in using deep learning (DL) to diagnose cancer from digital images of pathology slides. Existing algorithms typically operate by training deep neural networks either specialized in specific cohorts or an aggregate of all cohorts when there are only a few images available for the target cohort. A trade-off between decreasing the number of models and their cancer detection performance was evident in our experiments with The Cancer Genomic Atlas dataset, with the former approach achieving higher performance at the cost of having to acquire large datasets from the cohort of interest. Constructing annotated datasets for individual cohorts is extremely time-consuming, with the acquisition cost of such datasets growing linearly with the number of cohorts. Another issue associated with developing cohort-specific models is the difficulty of maintenance: all cohort-specific models may need to be adjusted when a new DL algorithm is to be used, where training even a single model may require a non-negligible amount of computation, or when more data is added to some cohorts. In resolving the sub-optimal behavior of a universal cancer detection model trained on an aggregate of cohorts, we investigated how cohorts can be grouped to augment a dataset without increasing the number of models linearly with the number of cohorts. This study introduces several metrics which measure the morphological similarities between cohort pairs and demonstrates how the metrics can be used to control the trade-off between performance and the number of models.

scholarly journals A trade-off between classical and quantum circuit size for an attack against CSIDH

2020 ◽  
Vol 15 (1) ◽  
pp. 4-17
Author(s):  
Jean-François Biasse ◽  
Xavier Bonnetain ◽  
Benjamin Pring ◽  
André Schrottenloher ◽  
William Youmans
Keyword(s):  
Endomorphism Ring ◽  
State Of The Art ◽  
Quantum Circuit ◽  
List Type ◽  
Hard Problem ◽  
Trade Off ◽  
Classical State ◽  
Security Parameter ◽  
The Cost ◽  
Quadratic Order

AbstractWe propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order 𝒪). Let Δ = Disc(𝒪) (in CSIDH, Δ = −4p for p the security parameter). Let 0 < α < 1/2, our algorithm requires:A classical circuit of size $2^{\tilde{O}\left(\log(|\Delta|)^{1-\alpha}\right)}.$A quantum circuit of size $2^{\tilde{O}\left(\log(|\Delta|)^{\alpha}\right)}.$Polynomial classical and quantum memory.Essentially, we propose to reduce the size of the quantum circuit below the state-of-the-art complexity $2^{\tilde{O}\left(\log(|\Delta|)^{1/2}\right)}$ at the cost of increasing the classical circuit-size required. The required classical circuit remains subexponential, which is a superpolynomial improvement over the classical state-of-the-art exponential solutions to these problems. Our method requires polynomial memory, both classical and quantum.

scholarly journals Machine learning applied to simulations of collisions between rotating, differentiated planets

2020 ◽  
Vol 7 (1) ◽  
Author(s):  
Miles L. Timpe ◽  
Maria Han Veiga ◽  
Mischa Knabenhans ◽  
Joachim Stadel ◽  
Stefano Marelli
Keyword(s):  
Machine Learning ◽  
Planet Formation ◽  
Critical Role ◽  
Ensemble Methods ◽  
Terrestrial Planet ◽  
Data Driven ◽  
Analytic Methods ◽  
Accurate Treatment ◽  
Post Impact ◽  
The Cost

AbstractIn the late stages of terrestrial planet formation, pairwise collisions between planetary-sized bodies act as the fundamental agent of planet growth. These collisions can lead to either growth or disruption of the bodies involved and are largely responsible for shaping the final characteristics of the planets. Despite their critical role in planet formation, an accurate treatment of collisions has yet to be realized. While semi-analytic methods have been proposed, they remain limited to a narrow set of post-impact properties and have only achieved relatively low accuracies. However, the rise of machine learning and access to increased computing power have enabled novel data-driven approaches. In this work, we show that data-driven emulation techniques are capable of classifying and predicting the outcome of collisions with high accuracy and are generalizable to any quantifiable post-impact quantity. In particular, we focus on the dataset requirements, training pipeline, and classification and regression performance for four distinct data-driven techniques from machine learning (ensemble methods and neural networks) and uncertainty quantification (Gaussian processes and polynomial chaos expansion). We compare these methods to existing analytic and semi-analytic methods. Such data-driven emulators are poised to replace the methods currently used in N-body simulations, while avoiding the cost of direct simulation. This work is based on a new set of 14,856 SPH simulations of pairwise collisions between rotating, differentiated bodies at all possible mutual orientations.

Predicting the cost-quality trade-off for information retrieval queries

2001 ◽  
Author(s):  
Henk Ernst Blok ◽  
Djoerd Hiemstra ◽  
Sunil Choenni ◽  
Franciska de Jong ◽  
Henk M. Blanken ◽  
...  
Keyword(s):  
Information Retrieval ◽  
Trade Off ◽  
The Cost

scholarly journals A Cost-Sensitive Diagnosis Method Based on the Operation and Maintenance Data of UAV

2021 ◽  
Vol 11 (23) ◽  
pp. 11116
Author(s):  
Ke Zheng ◽  
Guozhu Jia ◽  
Linchao Yang ◽  
Chunting Liu
Keyword(s):  
Fault Diagnosis ◽  
Data Distribution ◽  
Imbalanced Data ◽  
Data Driven ◽  
Total Cost ◽  
Operation And Maintenance ◽  
Diagnosis Method ◽  
Overall Performance ◽  
Diagnosis Model ◽  
The Cost

In the fault diagnosis of UAVs, extremely imbalanced data distribution and vast differences in effects of fault modes can drastically affect the application effect of a data-driven fault diagnosis model under the limitation of computing resources. At present, there is still no credible approach to determine the cost of the misdiagnosis of different fault modes that accounts for the interference of data distribution. The performance of the original cost-insensitive flight data-driven fault diagnosis models also needs to be improved. In response to this requirement, this paper proposes a two-step ensemble cost-sensitive diagnosis method based on the operation and maintenance data of UAV. According to the fault criticality from FMECA information, we defined a misdiagnosis hazard value and calculated the misdiagnosis cost. By using the misdiagnosis cost, a static cost matrix could be set to modify the diagnosis model and to evaluate the performance of the diagnosis results. A two-step ensemble cost-sensitive method based on the MetaCost framework was proposed using stratified bootstrapping, choosing LightGBM as meta-classifiers, and adjusting the ensemble form to enhance the overall performance of the diagnosis model and reduce the occupation of the computing resources while optimizing the total misdiagnosis cost. The experimental results based on the KPG component data of a large fixed-wing UAV show that the proposed cost-sensitive model can effectively reduce the total cost incurred by misdiagnosis, without putting forward excessive requirements on the computing equipment under the condition of ensuring a certain overall level of diagnosis performance.

MINIMIZING THE COMPLETE INFLUENCE TIME IN A SOCIAL NETWORK WITH STOCHASTIC COSTS FOR INFLUENCING NODES

2013 ◽  
Vol 21 (supp01) ◽  
pp. 63-74 ◽  
Author(s):  
YAODONG NI ◽  
QIAONI SHI
Keyword(s):  
Social Network ◽  
Computational Complexity ◽  
Stochastic Programming ◽  
Greedy Algorithm ◽  
Random Graphs ◽  
Minimum Time ◽  
Programming Models ◽  
Decision Criteria ◽  
Trade Off ◽  
The Cost

In this paper, we study the problem of targeting a set of individuals to trigger a cascade of influence in a social network such that the influence diffuses to all individuals with the minimum time, given that the cost of initially influencing each individual is with randomness and that the budget available is limited. We adopt the incremental chance model to characterize the diffusion of influence, and propose three stochastic programming models that correspond to three different decision criteria respectively. A modified greedy algorithm is presented to solve the proposed models, which can flexibly trade off between solution performance and computational complexity. Experiments are performed on random graphs, by which we show that the algorithm we present is effective.

Sign in / Sign up

Export Citation Format

Share Document