Coxsackie B2 Virus Infection Causing Multiorgan Failure and Cardiogenic Shock in a 42-Year-Old Man

Infections from coxsackie B2 viruses often cause viral myocarditis and, only rarely, multisystem organ impairment. We present the unusual case of a 42-year-old man in whom coxsackie B2 virus infection caused multiorgan infection, necessitating distal pancreatectomy, splenectomy, renal dialysis, and venoarterial extracorporeal membrane oxygenation with mechanical ventilation. In addition, the patient had a rapid-eye-movement sleep-related conduction abnormality that caused frequent sinus pauses of longer than 10 s, presumably due to myocarditis from the coxsackievirus infection. He recovered after permanent pacemaker placement and was discharged from the hospital. We discuss our aggressive supportive care and the few other reports of multiorgan impairment from coxsackieviruses

Determine the Optimal Sequence-Dependent Completion Times for Multiple Demand with Multi-Products Using Genetic Algorithm

Sequencing is the most impact factor on the total completion time , the products sequences inside demands that consist from muti-product and for multiple demands . It is very important in assembly line and batch production . The most important drawback of existing methods used to solve the sequencing problems is the sequence must has a few products and dependent completion time for single demand . In this paper we used genetic algorithm –based Travelling Salesman Problem with Precedence Constraints Approach ( TSPPCA)  to minimize completion time . The main advantage of this new method , it is used to solve the sequencing problems for multiple demand with multi-product In this paper , we compare between modify the assignment method ( MAM ) and genetic algorithm  depend on least completion time , the results discern that   GA  has minimum completion time Keywords: products sequences , completion time , travel salesman problem (TSP ) , TSPPCA , genetic algorithm. 

Determine The Optimal Sequence - dependent Setup Cost and / or Setup Time for Single Demand with Multiple Products Using Modified Assignment Method

Sequencing is the most impact factor on the total setup cost and / or time and the products sequences inside demands that consist from muti-products . It is very important in assembly line and batch production . The most important drawback of existing methods used to solve the sequencing problems is the sequence must has a few products and dependent setup cost or setup time . In this paper we modify the assignment method –based goal programming method to minimize the setup cost and / or setup time. The main advantage of this new method , it is not affected by the number of products in the sequence and can treatment the sequence problems with two or more objectives . Keywords: products sequences , setup cost , setup time , travel salesman problem (TSP ) , modified assignment method , goal programming