User control of large-scale programming models

1981 ◽  
pp. 7-9
Author(s):  
Paul Fuglestad
2014 ◽  
Vol 31 (04) ◽  
pp. 1450022 ◽  
Author(s):  
ALEXANDER ENGAU

We present two recent integer programming models in molecular biology and study practical reformulations to compute solutions to some of these problems. In extension of previously tested linearization techniques, we formulate corresponding semidefinite relaxations and discuss practical rounding strategies to find good feasible approximate solutions. Our computational results highlight the possible advantages and remaining challenges of this approach especially on large-scale problems.


2021 ◽  
Vol 9 (1) ◽  
pp. 32-46
Author(s):  
Amro Khaswaneh ◽  
Nagen Nagarur

This research considers modeling production and inventory quantities in the presence of demand surge due to pandemics like Covid-19. The aim of this research is to help health care organizations better prepare and respond to a demand surge due to a pandemic. A large-scale pandemic such as Covd-19 can cause an overwhelming demand for urgent medical supplies in a very short notice. Well-established supply chain planning and modeling are necessary to avoid any national level or company health supply chain problems resulting from demand shortages. This paper addresses the issues from supply chain perspective. The need to be prepared for any surge in demand is addressed in terms of emergency inventories, including those of Work-in-Process and finished goods. Linear Programming models are developed to minimize the costs of production, inventories, and transportation of goods from one stage to next stage. Several scenarios are tested out for various levels of demand, cost, and capacities.


2013 ◽  
pp. 287-321
Author(s):  
Judy Qiu ◽  
Jaliya Ekanayake ◽  
Thilina Gunarathne ◽  
Jong Youl Choi ◽  
Seung-Hee Bae ◽  
...  

Data intensive computing, cloud computing, and multicore computing are converging as frontiers to address massive data problems with hybrid programming models and/or runtimes including MapReduce, MPI, and parallel threading on multicore platforms. A major challenge is to utilize these technologies and large-scale computing resources effectively to advance fundamental science discoveries such as those in Life Sciences. The recently developed next-generation sequencers have enabled large-scale genome sequencing in areas such as environmental sample sequencing leading to metagenomic studies of collections of genes. Metagenomic research is just one of the areas that present a significant computational challenge because of the amount and complexity of data to be processed. This chapter discusses the use of innovative data-mining algorithms and new programming models for several Life Sciences applications. The authors particularly focus on methods that are applicable to large data sets coming from high throughput devices of steadily increasing power. They show results for both clustering and dimension reduction algorithms, and the use of MapReduce on modest size problems. They identify two key areas where further research is essential, and propose to develop new O(NlogN) complexity algorithms suitable for the analysis of millions of sequences. They suggest Iterative MapReduce as a promising programming model combining the best features of MapReduce with those of high performance environments such as MPI.


2020 ◽  
pp. 1-9 ◽  
Author(s):  
Alejandro Corbellini ◽  
Daniela Godoy ◽  
Cristian Mateos ◽  
Silvia Schiaffino ◽  
Alejandro Zunino

Author(s):  
Nur Rokhman ◽  
Amelia Nursanti

The implementation of parallel algorithms is very interesting research recently. Parallelism is very suitable to handle large-scale data processing. MapReduce is one of the parallel and distributed programming models. The implementation of parallel programming faces many difficulties. The Cascading gives easy scheme of Hadoop system which implements MapReduce model.Frequent itemsets are most often appear objects in a dataset. The Frequent Itemset Mining (FIM) requires complex computation. FIM is a complicated problem when implemented on large-scale data. This paper discusses the implementation of MapReduce model on Cascading for FIM. The experiment uses the Amazon dataset product co-purchasing network metadata.The experiment shows the fact that the simple mechanism of Cascading can be used to solve FIM problem. It gives time complexity O(n), more efficient than the nonparallel which has complexity O(n2/m).


2005 ◽  
Vol 21 (3) ◽  
pp. 417-437 ◽  
Author(s):  
Franck Cappello ◽  
Samir Djilali ◽  
Gilles Fedak ◽  
Thomas Herault ◽  
Frédéric Magniette ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document