Search results for: combinatorial%20stress
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 100

Search results for: combinatorial%20stress

40 A Hybrid Based Algorithm to Solve the Multi-objective Minimum Spanning Tree Problem

Authors: Boumesbah Asma, Chergui Mohamed El-amine

Abstract:

Since it has been shown that the multi-objective minimum spanning tree problem (MOST) is NP-hard even with two criteria, we propose in this study a hybrid NSGA-II algorithm with an exact mutation operator, which is only used with low probability, to find an approximation to the Pareto front of the problem. In a connected graph G, a spanning tree T of G being a connected and cycle-free graph, if k edges of G\T are added to T, we obtain a partial graph H of G inducing a reduced size multi-objective spanning tree problem compared to the initial one. With a weak probability for the mutation operator, an exact method for solving the reduced MOST problem considering the graph H is then used to give birth to several mutated solutions from a spanning tree T. Then, the selection operator of NSGA-II is activated to obtain the Pareto front approximation. Finally, an adaptation of the VNS metaheuristic is called for further improvements on this front. It allows finding good individuals to counterbalance the diversification and the intensification during the optimization search process. Experimental comparison studies with an exact method show promising results and indicate that the proposed algorithm is efficient.

Keywords: minimum spanning tree, multiple objective linear optimization, combinatorial optimization, non-sorting genetic algorithm, variable neighborhood search

Procedia PDF Downloads 64
39 A New Intelligent, Dynamic and Real Time Management System of Sewerage

Authors: R. Tlili Yaakoubi, H.Nakouri, O. Blanpain, S. Lallahem

Abstract:

The current tools for real time management of sewer systems are based on two software tools: the software of weather forecast and the software of hydraulic simulation. The use of the first ones is an important cause of imprecision and uncertainty, the use of the second requires temporal important steps of decision because of their need in times of calculation. This way of proceeding fact that the obtained results are generally different from those waited. The major idea of this project is to change the basic paradigm by approaching the problem by the "automatic" face rather than by that "hydrology". The objective is to make possible the realization of a large number of simulations at very short times (a few seconds) allowing to take place weather forecasts by using directly the real time meditative pluviometric data. The aim is to reach a system where the decision-making is realized from reliable data and where the correction of the error is permanent. A first model of control laws was realized and tested with different return-period rainfalls. The gains obtained in rejecting volume vary from 19 to 100 %. The development of a new algorithm was then used to optimize calculation time and thus to overcome the subsequent combinatorial problem in our first approach. Finally, this new algorithm was tested with 16- year-rainfall series. The obtained gains are 40 % of total volume rejected to the natural environment and of 65 % in the number of discharges.

Keywords: automation, optimization, paradigm, RTC

Procedia PDF Downloads 275
38 Effect of Halloysite on Heavy Metals Fate during Solid Waste Pyrolysis: A Combinatorial Experimental/Computational Study

Authors: Tengfei He, Mengjie Zhang, Baosheng Jin

Abstract:

In this study, the low-cost halloysite (Hal) was utilized for the first time to enhance the solid-phase enrichment and stability of heavy metals (HMs) during solid waste pyrolysis through experimental and theoretical methods, and compared with kaolinite (Kao). Experimental results demonstrated that Hal was superior to Kao in improving the solid-phase enrichment of HMs. Adding Hal reduced the proportion of HMs in the unstable fraction (F1+F2), consequently lowering the environmental risk of biochar and the extractable state of HMs. Through Grand canonical Monte Carlo and Density Functional Theory (DFT) simulations, the adsorption amounts and adsorption mechanisms of Cd/Pb compound on Hal/Kao surfaces were analyzed. The adsorption amounts of HMs by Hal were significantly higher than Kao and decreased with increasing temperature, and the difference in adsorption performance caused by structural bending was negligible. The DFT results indicated that Cd/Pb monomers were stabilized by establishing covalent bonds with OH or reactive O atoms on the Al-(0 0 1) surface, whereas the covalent bonds with ionic bonding properties formed between Cl atoms and unsaturated Al atoms played a crucial role in stabilizing HM chlorides. This study highlights the potential of Hal in stabilizing HMs during pyrolysis without requiring any modifications.

Keywords: heavy metals, halloysite, density functional theory, grand canonical Monte Carlo

Procedia PDF Downloads 48
37 Ameliorating Effects of Rosemary and Costus on Blood-Associated Toxicity in Ehrlich-Bearing Mice Treated with Cisplatin

Authors: Yousry El-Sayed Elbolkiny, Mohamed Labib Salem

Abstract:

Background: Rosemary (ROLE) and costus (SLRE) have been established to show antioxidant effects. Aim: This study aimed to evaluate the ameliorating effects of ROLE and SLRE on the side effects induced by cisplatin (CIS) in tumor-bearing mice. Materials and Methods: Extracts of ROLE and SLRE were examined for their phytochemical activities. To evaluate their anti-tumor effects, mice were inoculated intraperitoneally (i.p.) with 2.5x105 Ehrlich ascites carcinoma (EAC) and then treated i.p. with CIS at days 3-7 and with ROLE (dose) or SLRE (dose) at days 3-14. Mice were sacrificed on day 14 for CBC and T-cell analyses. Results: Phytochemical analysis revealed that both ROLE and SLRE showed similar antioxidant activities. Treatment of EAC-bearing mice with CIS-induced antitumor efficacy of about 90%. Treatment with CIS in combination with ROLE or SLRE did not further enhance the antitumor activity of CIS. However, co-administration of ROLE or SLRE with CIS significantly increased the antitumor efficacy of CIS. Flow cytometric analysis showed that the numbers of CD4+ and CD8+ T cells were decreased in EAC-bearing mice after treatment with CIS. Treatment with both ROLE and SLRE improved the number of these cells. Conclusion: Combinatorial treatment with rosemary and costus can enhance the antitumor activity of CIS

Keywords: CBC, cisplantin, costus, rosemary

Procedia PDF Downloads 11
36 Assignment of Airlines Technical Members under Disruption

Authors: Walid Moudani

Abstract:

The Crew Reserve Assignment Problem (CRAP) considers the assignment of the crew members to a set of reserve activities covering all the scheduled flights in order to ensure a continuous plan so that operations costs are minimized while its solution must meet hard constraints resulting from the safety regulations of Civil Aviation as well as from the airlines internal agreements. The problem considered in this study is of highest interest for airlines and may have important consequences on the service quality and on the economic return of the operations. In this communication, a new mathematical formulation for the CRAP is proposed which takes into account the regulations and the internal agreements. While current solutions make use of Artificial Intelligence techniques run on main frame computers, a low cost approach is proposed to provide on-line efficient solutions to face perturbed operating conditions. The proposed solution method uses a dynamic programming approach for the duties scheduling problem and when applied to the case of a medium airline while providing efficient solutions, shows good potential acceptability by the operations staff. This optimization scheme can then be considered as the core of an on-line Decision Support System for crew reserve assignment operations management.

Keywords: airlines operations management, combinatorial optimization, dynamic programming, crew scheduling

Procedia PDF Downloads 334
35 Conception of a Regulated, Dynamic and Intelligent Sewerage in Ostrevent

Authors: Rabaa Tlili Yaakoubi, Hind Nakouri, Olivier Blanpain

Abstract:

The current tools for real time management of sewer systems are based on two software tools: the software of weather forecast and the software of hydraulic simulation. The use of the first ones is an important cause of imprecision and uncertainty, the use of the second requires temporal important steps of decision because of their need in times of calculation. This way of proceeding fact that the obtained results are generally different from those waited. The major idea of the CARDIO project is to change the basic paradigm by approaching the problem by the "automatic" face rather than by that "hydrology". The objective is to make possible the realization of a large number of simulations at very short times (a few seconds) allowing to take place weather forecasts by using directly the real time meditative pluviometric data. The aim is to reach a system where the decision-making is realized from reliable data and where the correction of the error is permanent. A first model of control laws was realized and tested with different return-period rainfalls. The gains obtained in rejecting volume vary from 40 to 100%. The development of a new algorithm was then used to optimize calculation time and thus to overcome the subsequent combinatorial problem in our first approach. Finally, this new algorithm was tested with 16- year-rainfall series. The obtained gains are 60% of total volume rejected to the natural environment and of 80 % in the number of discharges.

Keywords: RTC, paradigm, optimization, automation

Procedia PDF Downloads 257
34 An Exploration of the Pancreatic Cancer miRNome during the Progression of the Disease

Authors: Barsha Saha, Shouvik Chakravarty, Sukanta Ray, Kshaunish Das, Nidhan K. Biswas, Srikanta Goswami

Abstract:

Pancreatic Ductal Adenocarcinoma is a well-recognised cause of cancer death with a five-year survival rate of about 9%, and its incidence in India has been found to be increased manifold in recent years. Due to delayed detection, this highly metastatic disease has a poor prognosis. Several molecular alterations happen during the progression of the disease from pre-cancerous conditions, and many such alterations could be investigated for their biomarker potential. MicroRNAs have been shown to be prognostic for PDAC patients in a variety of studies. We hereby used NGS technologies to evaluate the role of small RNA changes during pancreatic cancer development from chronic pancreatitis. Plasma samples were collected from pancreatic cancer patients (n=16), chronic pancreatitis patients (n=8), and also from normal individuals (n=16). Pancreatic tumour tissue (n=5) and adjacent normal tissue samples (n=5) were also collected. Sequencing of small RNAs was carried out after small RNAs were isolated from plasma samples and tissue samples. We find that certain microRNAs are highly deregulated in pancreatic cancer patients in comparison to normal samples. A combinatorial analysis of plasma and tissue microRNAs and subsequent exploration of their targets and altered molecular pathways could not only identify potential biomarkers for disease diagnosis but also help to understand the underlying mechanism.

Keywords: small RNA sequencing, pancreatic cancer, biomarkers, tissue sample

Procedia PDF Downloads 62
33 Simultaneous Targeting of MYD88 and Nur77 as an Effective Approach for the Treatment of Inflammatory Diseases

Authors: Uzma Saqib, Mirza S. Baig

Abstract:

Myeloid differentiation primary response protein 88 (MYD88) has long been considered a central player in the inflammatory pathway. Recent studies clearly suggest that it is an important therapeutic target in inflammation. On the other hand, a recent study on the interaction between the orphan nuclear receptor (Nur77) and p38α, leading to increased lipopolysaccharide-induced hyperinflammatory response, suggests this binary complex as a therapeutic target. In this study, we have designed inhibitors that can inhibit both MYD88 and Nur77 at the same time. Since both MYD88 and Nur77 are an integral part of the pathways involving lipopolysaccharide-induced activation of NF-κB-mediated inflammation, we tried to target both proteins with the same library in order to retrieve compounds having dual inhibitory properties. To perform this, we developed a homodimeric model of MYD88 and, along with the crystal structure of Nur77, screened a virtual library of compounds from the traditional Chinese medicine database containing ~61,000 compounds. We analyzed the resulting hits for their efficacy for dual binding and probed them for developing a common pharmacophore model that could be used as a prototype to screen compound libraries as well as to guide combinatorial library design to search for ideal dual-target inhibitors. Thus, our study explores the identification of novel leads having dual inhibiting effects due to binding to both MYD88 and Nur77 targets.

Keywords: drug design, Nur77, MYD88, inflammation

Procedia PDF Downloads 278
32 Non-Dominated Sorting Genetic Algorithm (NSGA-II) for the Redistricting Problem in Mexico

Authors: Antonin Ponsich, Eric Alfredo Rincon Garcia, Roman Anselmo Mora Gutierrez, Miguel Angel Gutierrez Andrade, Sergio Gerardo De Los Cobos Silva, Pedro Lara Velzquez

Abstract:

The electoral zone design problem consists in redrawing the boundaries of legislative districts for electoral purposes in such a way that federal or state requirements are fulfilled. In Mexico, this process has been historically carried out by the National Electoral Institute (INE), by optimizing an integer nonlinear programming model, in which population equality and compactness of the designed districts are considered as two conflicting objective functions, while contiguity is included as a hard constraint. The solution technique used by the INE is a Simulated Annealing (SA) based algorithm, which handles the multi-objective nature of the problem through an aggregation function. The present work represents the first intent to apply a classical Multi-Objective Evolutionary Algorithm (MOEA), the second version of the Non-dominated Sorting Genetic Algorithm (NSGA-II), to this hard combinatorial problem. First results show that, when compared with the SA algorithm, the NSGA-II obtains promising results. The MOEA manages to produce well-distributed solutions over a wide-spread front, even though some convergence troubles for some instances constitute an issue, which should be corrected in future adaptations of MOEAs to the redistricting problem.

Keywords: multi-objective optimization, NSGA-II, redistricting, zone design problem

Procedia PDF Downloads 345
31 A Hybrid Algorithm Based on Greedy Randomized Adaptive Search Procedure and Chemical Reaction Optimization for the Vehicle Routing Problem with Hard Time Windows

Authors: Imen Boudali, Marwa Ragmoun

Abstract:

The Vehicle Routing Problem with Hard Time Windows (VRPHTW) is a basic distribution management problem that models many real-world problems. The objective of the problem is to deliver a set of customers with known demands on minimum-cost vehicle routes while satisfying vehicle capacity and hard time windows for customers. In this paper, we propose to deal with our optimization problem by using a new hybrid stochastic algorithm based on two metaheuristics: Chemical Reaction Optimization (CRO) and Greedy Randomized Adaptive Search Procedure (GRASP). The first method is inspired by the natural process of chemical reactions enabling the transformation of unstable substances with excessive energy to stable ones. During this process, the molecules interact with each other through a series of elementary reactions to reach minimum energy for their existence. This property is embedded in CRO to solve the VRPHTW. In order to enhance the population diversity throughout the search process, we integrated the GRASP in our method. Simulation results on the base of Solomon’s benchmark instances show the very satisfactory performances of the proposed approach.

Keywords: Benchmark Problems, Combinatorial Optimization, Vehicle Routing Problem with Hard Time Windows, Meta-heuristics, Hybridization, GRASP, CRO

Procedia PDF Downloads 378
30 Production of Novel Antibiotics by Importing eryK and eryG Genes in Streptomyces fradiae

Authors: Neda Gegar Goshe, Hossein Rassi

Abstract:

The antibacterial properties of macrolide antibiotics (such as erythromycin and tylosin) depend ultimately on the glycosylation of otherwise inactive polyketide lactones. Among the sugars commonly found in such macrolides are various 6-deoxyhexoses including the 3-dimethylamino sugars mycaminose and desosamine (4-deoxymycaminose). Some macrolides (such as tylosin) possess multiple sugar moieties, whereas others (such as erythromycin) have two sugar substituents. Streptomyces fradiae is an ideal host for development of generic polyketide-overproducing strains because it contains three of the most common precursors-malonyl-CoA, methylmalonyl-CoA and ethylmalonyl-CoA-used by modular PKS, and is a host that is amenable to genetic manipulation. As patterns of glycosylation markedly influence a macrolide's drug activity, there is considerable interest in the possibility of using combinatorial biosynthesis to generate new pairings of polyketide lactones with sugars, especially 6-deoxyhexoses. Here, we report a successful attempt to alter the aminodeoxyhexose-biosynthetic capacity of Streptomyces fradiae (a producer of tylosin) by importing genes from the erythromycin producer Saccharopolyspora erythraea. The biotransformation of erythromycin-D into the desired major component erythromycin-A involves two final enzymatic reactions, EryK-catalyzed hydroxylation at the C-12 position of the aglycone and EryG-catalyzed O methylation at the C-3 position of macrose .This engineered S. fradiae produced substantial amounts of two potentially useful macrolides that had not previously been obtained by fermentation.

Keywords: Streptomyces fradiae, eryK and eryG genes, tylosin, antibiotics

Procedia PDF Downloads 300
29 Production of Novel Antibiotics of Tylosin by Importing eryK and eryG Genes in Streptomyces fradiae

Authors: Neda Gegar Goshe, M. Moradi, Hossein Rassi

Abstract:

The antibacterial properties of macrolide antibiotics (such as erythromycin and tylosin) depend ultimately on the glycosylation of otherwise inactive polyketide lactones. Among the sugars commonly found in such macrolides are various 6-deoxyhexoses including the 3-dimethylamino sugars mycaminose and desosamine (4-deoxymycaminose). Some macrolides (such as tylosin) possess multiple sugar moieties, whereas others (such as erythromycin) have two sugar substituents. Streptomyces fradiae is an ideal host for development of generic polyketide-overproducing strains because it contains three of the most common precursors-malonyl-CoA, methylmalonyl-CoA and ethylmalonyl-CoA-used by modular PKS, and is a host that is amenable to genetic manipulation. As patterns of glycosylation markedly influence a macrolide's drug activity, there is considerable interest in the possibility of using combinatorial biosynthesis to generate new pairings of polyketide lactones with sugars, especially 6-deoxyhexoses. Here, we report a successful attempt to alter the aminodeoxyhexose-biosynthetic capacity of Streptomyces fradiae (a producer of tylosin) by importing genes from the erythromycin producer Saccharopolyspora erythraea. The bio transformation of erythromycin-D into the desired major component erythromycin-A involves two final enzymatic reactions, EryK-catalyzed hydroxylation at the C-12 position of the aglycone and EryG-catalyzed O methylation at the C-3 position of macrose. This engineered S. fradiae produced substantial amounts of two potentially useful macrolides that had not previously been obtained by fermentation.

Keywords: tylosin, eryK and eryG genes, streptomyces fradiae

Procedia PDF Downloads 325
28 An Application of Integrated Multi-Objective Particles Swarm Optimization and Genetic Algorithm Metaheuristic through Fuzzy Logic for Optimization of Vehicle Routing Problems in Sugar Industry

Authors: Mukhtiar Singh, Sumeet Nagar

Abstract:

Vehicle routing problem (VRP) is a combinatorial optimization and nonlinear programming problem aiming to optimize decisions regarding given set of routes for a fleet of vehicles in order to provide cost-effective and efficient delivery of both services and goods to the intended customers. This paper proposes the application of integrated particle swarm optimization (PSO) and genetic optimization algorithm (GA) to address the Vehicle routing problem in sugarcane industry in India. Suger industry is very prominent agro-based industry in India due to its impacts on rural livelihood and estimated to be employing around 5 lakhs workers directly in sugar mills. Due to various inadequacies, inefficiencies and inappropriateness associated with the current vehicle routing model it costs huge money loss to the industry which needs to be addressed in proper context. The proposed algorithm utilizes the crossover operation that originally appears in genetic algorithm (GA) to improve its flexibility and manipulation more readily and avoid being trapped in local optimum, and simultaneously for improving the convergence speed of the algorithm, level set theory is also added to it. We employ the hybrid approach to an example of VRP and compare its result with those generated by PSO, GA, and parallel PSO algorithms. The experimental comparison results indicate that the performance of hybrid algorithm is superior to others, and it will become an effective approach for solving discrete combinatory problems.

Keywords: fuzzy logic, genetic algorithm, particle swarm optimization, vehicle routing problem

Procedia PDF Downloads 354
27 Bi-Criteria Vehicle Routing Problem for Possibility Environment

Authors: Bezhan Ghvaberidze

Abstract:

A multiple criteria optimization approach for the solution of the Fuzzy Vehicle Routing Problem (FVRP) is proposed. For the possibility environment the levels of movements between customers are calculated by the constructed simulation interactive algorithm. The first criterion of the bi-criteria optimization problem - minimization of the expectation of total fuzzy travel time on closed routes is constructed for the FVRP. A new, second criterion – maximization of feasibility of movement on the closed routes is constructed by the Choquet finite averaging operator. The FVRP is reduced to the bi-criteria partitioning problem for the so called “promising” routes which were selected from the all admissible closed routes. The convenient selection of the “promising” routes allows us to solve the reduced problem in the real-time computing. For the numerical solution of the bi-criteria partitioning problem the -constraint approach is used. An exact algorithm is implemented based on D. Knuth’s Dancing Links technique and the algorithm DLX. The Main objective was to present the new approach for FVRP, when there are some difficulties while moving on the roads. This approach is called FVRP for extreme conditions (FVRP-EC) on the roads. Also, the aim of this paper was to construct the solving model of the constructed FVRP. Results are illustrated on the numerical example where all Pareto-optimal solutions are found. Also, an approach for more complex model FVRP with time windows was developed. A numerical example is presented in which optimal routes are constructed for extreme conditions on the roads.

Keywords: combinatorial optimization, Fuzzy Vehicle routing problem, multiple objective programming, possibility theory

Procedia PDF Downloads 447
26 An MIPSSTWM-based Emergency Vehicle Routing Approach for Quick Response to Highway Incidents

Authors: Siliang Luan, Zhongtai Jiang

Abstract:

The risk of highway incidents is commonly recognized as a major concern for transportation authorities due to the hazardous consequences and negative influence. It is crucial to respond to these unpredictable events as soon as possible faced by emergency management decision makers. In this paper, we focus on path planning for emergency vehicles, one of the most significant processes to avoid congestion and reduce rescue time. A Mixed-Integer Linear Programming with Semi-Soft Time Windows Model (MIPSSTWM) is conducted to plan an optimal routing respectively considering the time consumption of arcs and nodes of the urban road network and the highway network, especially in developing countries with an enormous population. Here, the arcs indicate the road segments and the nodes include the intersections of the urban road network and the on-ramp and off-ramp of the highway networks. An attempt in this research has been made to develop a comprehensive and executive strategy for emergency vehicle routing in heavy traffic conditions. The proposed Cuckoo Search (CS) algorithm is designed by imitating obligate brood parasitic behaviors of cuckoos and Lévy Flights (LF) to solve this hard and combinatorial problem. Using a Chinese city as our case study, the numerical results demonstrate the approach we applied in this paper outperforms the previous method without considering the nodes of the road network for a real-world situation. Meanwhile, the accuracy and validity of the CS algorithm also show better performances than the traditional algorithm.

Keywords: emergency vehicle, path planning, cs algorithm, urban traffic management and urban planning

Procedia PDF Downloads 51
25 Evidence Theory Based Emergency Multi-Attribute Group Decision-Making: Application in Facility Location Problem

Authors: Bidzina Matsaberidze

Abstract:

It is known that, in emergency situations, multi-attribute group decision-making (MAGDM) models are characterized by insufficient objective data and a lack of time to respond to the task. Evidence theory is an effective tool for describing such incomplete information in decision-making models when the expert and his knowledge are involved in the estimations of the MAGDM parameters. We consider an emergency decision-making model, where expert assessments on humanitarian aid from distribution centers (HADC) are represented in q-rung ortho-pair fuzzy numbers, and the data structure is described within the data body theory. Based on focal probability construction and experts’ evaluations, an objective function-distribution centers’ selection ranking index is constructed. Our approach for solving the constructed bicriteria partitioning problem consists of two phases. In the first phase, based on the covering’s matrix, we generate a matrix, the columns of which allow us to find all possible partitionings of the HADCs with the service centers. Some constraints are also taken into consideration while generating the matrix. In the second phase, based on the matrix and using our exact algorithm, we find the partitionings -allocations of the HADCs to the centers- which correspond to the Pareto-optimal solutions. For an illustration of the obtained results, a numerical example is given for the facility location-selection problem.

Keywords: emergency MAGDM, q-rung orthopair fuzzy sets, evidence theory, HADC, facility location problem, multi-objective combinatorial optimization problem, Pareto-optimal solutions

Procedia PDF Downloads 62
24 Evaluating the Effectiveness of Combined Psychiatric and Psychotherapeutic Care versus Psychotherapy Alone in the Treatment of Depression and Anxiety in Cancer Patients

Authors: Nathen A. Spitz, Dennis Martin Kivlighan III, Arwa Aburizik

Abstract:

Background and Purpose: Presently, there is a paucity of naturalistic studies that directly compare the effectiveness of psychotherapy versus concurrent psychotherapy and psychiatric care for the treatment of depression and anxiety in cancer patients. Informed by previous clinical trials examining the efficacy of concurrent approaches, this study sought to test the hypothesis that a combined approach would result in the greatest reduction of depression and anxiety symptoms. Methods: Data for this study consisted of 433 adult cancer patients, with 252 receiving only psychotherapy and 181 receiving concurrent psychotherapy and psychiatric care at the University of Iowa Hospitals and Clinics. Longitudinal PHQ9 and GAD7 data were analyzed between both groups using latent growth curve analyses. Results: After controlling for treatment length and provider effects, results indicated that concurrent care was more effective than psychotherapy alone for depressive symptoms (γ₁₂ = -0.12, p = .037). Specifically, the simple slope for concurrent care was -0.25 (p = .022), and the simple slope for psychotherapy alone was -0.13 (p = .006), suggesting that patients receiving concurrent care experienced a greater reduction in depressive symptoms compared to patients receiving psychotherapy alone. In contrast, there were no significant differences between psychotherapy alone and concurrent psychotherapy and psychiatric care in the reduction of anxious symptoms. Conclusions: Overall, as both psychotherapy and psychiatric care may address unique aspects of mental health conditions, in addition to potentially providing synergetic support to each other, a combinatorial approach to mental healthcare for cancer patients may improve outcomes.

Keywords: psychiatry, psychology, psycho-oncology, combined care, psychotherapy, behavioral psychology

Procedia PDF Downloads 88
23 Sulfonic Acid Functionalized Ionic Liquid in Combinatorial Approach: A Recyclable and Water Tolerant-Acidic Catalyst for Friedlander Quinoline Synthesis

Authors: Jafar Akbari

Abstract:

Quinolines are very important compounds partially because of their pharmacological properties which include wide applications in medicinal chemistry. notable among them are antimalarial drugs, anti-inflammatory agents, antiasthamatic, antibacterial, antihypertensive, and tyrosine kinase inhibiting agents. Despite quinoline usage in pharmaceutical and other industries, comparatively few methods for their preparation have been reported.The Friedlander annulation is one of the simplest and most straightforward methods for the synthesis of poly substituted quinolines. Although, modified methods employing lewis or br¢nsted acids have been reported for the synthesis of quinolines, the development of water stable acidic catalyst for quinoline synthesis is quite desirable. One of the most remarkable features of ionic liquids is that the yields can be optimized by changing the anions or the cations. Recently, sulfonic acid functionalized ionic liquids were used as solvent-catalyst for several organic reactions. We herein report the one pot domino approach for the synthesis of quinoline derivatives in Friedlander manner using TSIL as a catalyst. These ILs are miscible in water, and their homogeneous system is readily separated from the reaction product, combining advantages of both homogeneous and heterogeneous catalysis. In this reaction, the catalyst plays a dual role; it ensures an effective condensation and cyclization of 2-aminoaryl ketone with second carbonyl group and it also promotes the aromatization to the final product. Various types of quinolines from 2-aminoaryl ketones and β-ketoesters/ketones were prepared in 85-98% yields using the catalytic system of SO3-H functionalized ionic liquid/H2O. More importantly, the catalyst could be easily recycled for five times without loss of much activity.

Keywords: antimalarial drugs, green chemistry, ionic liquid, quinolines

Procedia PDF Downloads 181
22 Integer Programming: Domain Transformation in Nurse Scheduling Problem.

Authors: Geetha Baskaran, Andrzej Barjiela, Rong Qu

Abstract:

Motivation: Nurse scheduling is a complex combinatorial optimization problem. It is also known as NP-hard. It needs an efficient re-scheduling to minimize some trade-off of the measures of violation by reducing selected constraints to soft constraints with measurements of their violations. Problem Statement: In this paper, we extend our novel approach to solve the nurse scheduling problem by transforming it through Information Granulation. Approach: This approach satisfies the rules of a typical hospital environment based on a standard benchmark problem. Generating good work schedules has a great influence on nurses' working conditions which are strongly related to the level of a quality health care. Domain transformation that combines the strengths of operation research and artificial intelligence was proposed for the solution of the problem. Compared to conventional methods, our approach involves judicious grouping (information granulation) of shifts types’ that transforms the original problem into a smaller solution domain. Later these schedules from the smaller problem domain are converted back into the original problem domain by taking into account the constraints that could not be represented in the smaller domain. An Integer Programming (IP) package is used to solve the transformed scheduling problem by expending the branch and bound algorithm. We have used the GNU Octave for Windows to solve this problem. Results: The scheduling problem has been solved in the proposed formalism resulting in a high quality schedule. Conclusion: Domain transformation represents departure from a conventional one-shift-at-a-time scheduling approach. It offers an advantage of efficient and easily understandable solutions as well as offering deterministic reproducibility of the results. We note, however, that it does not guarantee the global optimum.

Keywords: domain transformation, nurse scheduling, information granulation, artificial intelligence, simulation

Procedia PDF Downloads 369
21 The Non-Existence of Perfect 2-Error Correcting Lee Codes of Word Length 7 over Z

Authors: Catarina Cruz, Ana Breda

Abstract:

Tiling problems have been capturing the attention of many mathematicians due to their real-life applications. In this study, we deal with tilings of Zⁿ by Lee spheres, where n is a positive integer number, being these tilings related with error correcting codes on the transmission of information over a noisy channel. We focus our attention on the question ‘for what values of n and r does the n-dimensional Lee sphere of radius r tile Zⁿ?’. It seems that the n-dimensional Lee sphere of radius r does not tile Zⁿ for n ≥ 3 and r ≥ 2. Here, we prove that is not possible to tile Z⁷ with Lee spheres of radius 2 presenting a proof based on a combinatorial method and faithful to the geometric idea of the problem. The non-existence of such tilings has been studied by several authors being considered the most difficult cases those in which the radius of the Lee spheres is equal to 2. The relation between these tilings and error correcting codes is established considering the center of a Lee sphere as a codeword and the other elements of the sphere as words which are decoded by the central codeword. When the Lee spheres of radius r centered at elements of a set M ⊂ Zⁿ tile Zⁿ, M is a perfect r-error correcting Lee code of word length n over Z, denoted by PL(n, r). Our strategy to prove the non-existence of PL(7, 2) codes are based on the assumption of the existence of such code M. Without loss of generality, we suppose that O ∈ M, where O = (0, ..., 0). In this sense and taking into account that we are dealing with Lee spheres of radius 2, O covers all words which are distant two or fewer units from it. By the definition of PL(7, 2) code, each word which is distant three units from O must be covered by a unique codeword of M. These words have to be covered by codewords which dist five units from O. We prove the non-existence of PL(7, 2) codes showing that it is not possible to cover all the referred words without superposition of Lee spheres whose centers are distant five units from O, contradicting the definition of PL(7, 2) code. We achieve this contradiction by combining the cardinality of particular subsets of codewords which are distant five units from O. There exists an extensive literature on codes in the Lee metric. Here, we present a new approach to prove the non-existence of PL(7, 2) codes.

Keywords: Golomb-Welch conjecture, Lee metric, perfect Lee codes, tilings

Procedia PDF Downloads 130
20 Graphical Theoretical Construction of Discrete time Share Price Paths from Matroid

Authors: Min Wang, Sergey Utev

Abstract:

The lessons from the 2007-09 global financial crisis have driven scientific research, which considers the design of new methodologies and financial models in the global market. The quantum mechanics approach was introduced in the unpredictable stock market modeling. One famous quantum tool is Feynman path integral method, which was used to model insurance risk by Tamturk and Utev and adapted to formalize the path-dependent option pricing by Hao and Utev. The research is based on the path-dependent calculation method, which is motivated by the Feynman path integral method. The path calculation can be studied in two ways, one way is to label, and the other is computational. Labeling is a part of the representation of objects, and generating functions can provide many different ways of representing share price paths. In this paper, the recent works on graphical theoretical construction of individual share price path via matroid is presented. Firstly, a study is done on the knowledge of matroid, relationship between lattice path matroid and Tutte polynomials and ways to connect points in the lattice path matroid and Tutte polynomials is suggested. Secondly, It is found that a general binary tree can be validly constructed from a connected lattice path matroid rather than general lattice path matroid. Lastly, it is suggested that there is a way to represent share price paths via a general binary tree, and an algorithm is developed to construct share price paths from general binary trees. A relationship is also provided between lattice integer points and Tutte polynomials of a transversal matroid. Use this way of connection together with the algorithm, a share price path can be constructed from a given connected lattice path matroid.

Keywords: combinatorial construction, graphical representation, matroid, path calculation, share price, Tutte polynomial

Procedia PDF Downloads 107
19 Evaluation of Naringenin Role in Inhibiton of Lung Tumor Progression in Mice

Authors: Vishnu Varthan Vaithiyalingamjagannathan, M. N. Sathishkumar, K. S. Lakhsmi, D. Satheeshkumar, Srividyaammayappanrajam

Abstract:

Background:Naringenin, aglycone flavonoid possess certain activities like anti-oxidant, anti-estrogenic, anti-diabetic, cardioprotective, anti-obesity,anti-inflammatory, hepatoprotective and also have anti-cancer characteristics like carcinogenic inactivation, cell cycle arrest, anti-proliferation, apoptosis, anti-angiogenesis and enhances anti-oxidant activity. Methodology:The inhibitory effect of Naringenin in lung tumor progression estimated with adenocarcinoma (A549) cell lines (in vitro) and C57BL/6 mice injected with 5 X 106A549 cell lines (in vivo) in a tri-dose manner (Naringenin 100mg/kg,150mg/kg, and 200mg/kg) compared with standard chemotherapy drug cisplatin (7mg/kg). Results:The results of the present study revealed a dose-dependent activity in Naringenin and combination with cisplatin at a higher dose which showed decreased tumor progression in mice. In vitro studies carried out for estimation of cell survival and Nitric Oxide (NO) level, shows dose dependent action of Naringenin with IC50 value of 42µg/ml. In vivo studies were carried out in C57BL/6 mice. Naringenin satisfied the condition of an anti-cancer molecule with its characteristics in fragmentation assay, Zymography assay, anti-oxidant, and myeloperoxidase studies, than cisplatin which failed in anti-oxidant and myeloperoxidase effect. Both in vitro and in vivo establishes dose dependent decrease in NO levels. But whereas, Naringenin showed adverse results in Matrix Metalloproteinase (MMP) enzymatic levels with increase in dose levels. Conclusion:From the present study, Naringenin could suppress the lung tumor progression when given individually and also in combinatorial with standard chemotherapy drug.

Keywords: naringenin, in vitro, cell line, anticancer

Procedia PDF Downloads 410
18 Development of Wave-Dissipating Block Installation Simulation for Inexperienced Worker Training

Authors: Hao Min Chuah, Tatsuya Yamazaki, Ryosui Iwasawa, Tatsumi Suto

Abstract:

In recent years, with the advancement of digital technology, the movement to introduce so-called ICT (Information and Communication Technology), such as computer technology and network technology, to civil engineering construction sites and construction sites is accelerating. As part of this movement, attempts are being made in various situations to reproduce actual sites inside computers and use them for designing and construction planning, as well as for training inexperienced engineers. The installation of wave-dissipating blocks on coasts, etc., is a type of work that has been carried out by skilled workers based on their years of experience and is one of the tasks that is difficult for inexperienced workers to carry out on site. Wave-dissipating blocks are structures that are designed to protect coasts, beaches, and so on from erosion by reducing the energy of ocean waves. Wave-dissipating blocks usually weigh more than 1 t and are installed by being suspended by a crane, so it would be time-consuming and costly for inexperienced workers to train on-site. In this paper, therefore, a block installation simulator is developed based on Unity 3D, a game development engine. The simulator computes porosity. Porosity is defined as the ratio of the total volume of the wave breaker blocks inside the structure to the final shape of the ideal structure. Using the evaluation of porosity, the simulator can determine how well the user is able to install the blocks. The voxelization technique is used to calculate the porosity of the structure, simplifying the calculations. Other techniques, such as raycasting and box overlapping, are employed for accurate simulation. In the near future, the simulator will install an automatic block installation algorithm based on combinatorial optimization solutions and compare the user-demonstrated block installation and the appropriate installation solved by the algorithm.

Keywords: 3D simulator, porosity, user interface, voxelization, wave-dissipating blocks

Procedia PDF Downloads 59
17 A Combinatorial Approach of Treatment for Landfill Leachate

Authors: Anusha Atmakuri, R. D. Tyagi, Patrick Drogui

Abstract:

Landfilling is the most familiar and easy way to dispose solid waste. Landfill is generally received via wastes from municipal near to a landfill. The waste collected is from commercial, industrial, and residential areas and many more. Landfill leachate (LFL) is formed when rainwater passes through the waste placed in landfills and consists of several dissolved organic materials, for instance, aquatic humic substances (AHS), volatile fatty acids (VFAs), heavy metals, inorganic macro components, and xenobiotic organic matters, highly toxic to the environment. These components of LFL put a load on it, hence it necessitates the treatment of LFL prior to its discharge into the environment. Various methods have been used to treat LFL over the years, such as physical, chemical, biological, physicochemical, electrical, and advanced oxidation methods. This study focuses on the combination of biological and electrochemical methods- extracellular polymeric substances and electrocoagulation(EC). The coupling of electro-coagulation process with extracellular polymeric substances (EPS) (as flocculant) as pre and\or post treatment strategy provides efficient and economical process for the decontamination of landfill leachate contaminated with suspended matter, metals (e.g., Fe, Mn) and ammonical nitrogen. Electro-coagulation and EPS mediated coagulation approach could be an economically viable for the treatment of landfill leachate, along with possessing several other advantages over several other methods. This study utilised waste substrates such as activated sludge, crude glycerol and waste cooking oil for the production of EPS using fermentation technology. A comparison of different scenarios for the treatment of landfill leachate is presented- such as using EPS alone as bioflocculant, EPS and EC with EPS being the 1st stage, and EPS and EC with EC being the 1st stage. The work establishes the use of crude EPS as a bioflocculant for the treatment of landfill leachate and wastewater from a site near a landfill, along with EC being successful in removal of some major pollutants such as COD, turbidity, total suspended solids. A combination of these two methods is to be explored more for the complete removal of all pollutants from landfill leachate.

Keywords: landfill leachate, extracellular polymeric substances, electrocoagulation, bioflocculant.

Procedia PDF Downloads 55
16 Normalized P-Laplacian: From Stochastic Game to Image Processing

Authors: Abderrahim Elmoataz

Abstract:

More and more contemporary applications involve data in the form of functions defined on irregular and topologically complicated domains (images, meshs, points clouds, networks, etc). Such data are not organized as familiar digital signals and images sampled on regular lattices. However, they can be conveniently represented as graphs where each vertex represents measured data and each edge represents a relationship (connectivity or certain affinities or interaction) between two vertices. Processing and analyzing these types of data is a major challenge for both image and machine learning communities. Hence, it is very important to transfer to graphs and networks many of the mathematical tools which were initially developed on usual Euclidean spaces and proven to be efficient for many inverse problems and applications dealing with usual image and signal domains. Historically, the main tools for the study of graphs or networks come from combinatorial and graph theory. In recent years there has been an increasing interest in the investigation of one of the major mathematical tools for signal and image analysis, which are Partial Differential Equations (PDEs) variational methods on graphs. The normalized p-laplacian operator has been recently introduced to model a stochastic game called tug-of-war-game with noise. Part interest of this class of operators arises from the fact that it includes, as particular case, the infinity Laplacian, the mean curvature operator and the traditionnal Laplacian operators which was extensiveley used to models and to solve problems in image processing. The purpose of this paper is to introduce and to study a new class of normalized p-Laplacian on graphs. The introduction is based on the extension of p-harmonious function introduced in as discrete approximation for both infinity Laplacian and p-Laplacian equations. Finally, we propose to use these operators as a framework for solving many inverse problems in image processing.

Keywords: normalized p-laplacian, image processing, stochastic game, inverse problems

Procedia PDF Downloads 485
15 D-Wave Quantum Computing Ising Model: A Case Study for Forecasting of Heat Waves

Authors: Dmytro Zubov, Francesco Volponi

Abstract:

In this paper, D-Wave quantum computing Ising model is used for the forecasting of positive extremes of daily mean air temperature. Forecast models are designed with two to five qubits, which represent 2-, 3-, 4-, and 5-day historical data respectively. Ising model’s real-valued weights and dimensionless coefficients are calculated using daily mean air temperatures from 119 places around the world, as well as sea level (Aburatsu, Japan). In comparison with current methods, this approach is better suited to predict heat wave values because it does not require the estimation of a probability distribution from scarce observations. Proposed forecast quantum computing algorithm is simulated based on traditional computer architecture and combinatorial optimization of Ising model parameters for the Ronald Reagan Washington National Airport dataset with 1-day lead-time on learning sample (1975-2010 yr). Analysis of the forecast accuracy (ratio of successful predictions to total number of predictions) on the validation sample (2011-2014 yr) shows that Ising model with three qubits has 100 % accuracy, which is quite significant as compared to other methods. However, number of identified heat waves is small (only one out of nineteen in this case). Other models with 2, 4, and 5 qubits have 20 %, 3.8 %, and 3.8 % accuracy respectively. Presented three-qubit forecast model is applied for prediction of heat waves at other five locations: Aurel Vlaicu, Romania – accuracy is 28.6 %; Bratislava, Slovakia – accuracy is 21.7 %; Brussels, Belgium – accuracy is 33.3 %; Sofia, Bulgaria – accuracy is 50 %; Akhisar, Turkey – accuracy is 21.4 %. These predictions are not ideal, but not zeros. They can be used independently or together with other predictions generated by different method(s). The loss of human life, as well as environmental, economic, and material damage, from extreme air temperatures could be reduced if some of heat waves are predicted. Even a small success rate implies a large socio-economic benefit.

Keywords: heat wave, D-wave, forecast, Ising model, quantum computing

Procedia PDF Downloads 466
14 A Computational Framework for Decoding Hierarchical Interlocking Structures with SL Blocks

Authors: Yuxi Liu, Boris Belousov, Mehrzad Esmaeili Charkhab, Oliver Tessmann

Abstract:

This paper presents a computational solution for designing reconfigurable interlocking structures that are fully assembled with SL Blocks. Formed by S-shaped and L-shaped tetracubes, SL Block is a specific type of interlocking puzzle. Analogous to molecular self-assembly, the aggregation of SL blocks will build a reversible hierarchical and discrete system where a single module can be numerously replicated to compose semi-interlocking components that further align, wrap, and braid around each other to form complex high-order aggregations. These aggregations can be disassembled and reassembled, responding dynamically to design inputs and changes with a unique capacity for reconfiguration. To use these aggregations as architectural structures, we developed computational tools that automate the configuration of SL blocks based on architectural design objectives. There are three critical phases in our work. First, we revisit the hierarchy of the SL block system and devise a top-down-type design strategy. From this, we propose two key questions: 1) How to translate 3D polyominoes into SL block assembly? 2) How to decompose the desired voxelized shapes into a set of 3D polyominoes with interlocking joints? These two questions can be considered the Hamiltonian path problem and the 3D polyomino tiling problem. Then, we derive our solution to each of them based on two methods. The first method is to construct the optimal closed path from an undirected graph built from the voxelized shape and translate the node sequence of the resulting path into the assembly sequence of SL blocks. The second approach describes interlocking relationships of 3D polyominoes as a joint connection graph. Lastly, we formulate the desired shapes and leverage our methods to achieve their reconfiguration within different levels. We show that our computational strategy will facilitate the efficient design of hierarchical interlocking structures with a self-replicating geometric module.

Keywords: computational design, SL-blocks, 3D polyomino puzzle, combinatorial problem

Procedia PDF Downloads 100
13 Mechanism of in Vitro Inhibition of Alpha-Amylase, Alpha-Glucosidase by Ethanolic Extracts of Polyalthia Longifolia, Its in Vitro Cytotoxicity on L6, Vero Cell-Lines and Influence of Glucose Uptake by Rat Hemi-Diaphragm

Authors: P. Gayathri, G. P. Jeyanthi

Abstract:

The bark of Polyalthia longifolia is used in ayurvedic system of medicine for the manangement of various ailments including diabetes mellitus. The bark of P. longifolia extracts was extracted using various polar and non-polar solvents and tested for inhibition of alpha-amylase and alpha-glucosidase among which the ethanolic extracts were found to be more potent. The ethanolic extracts of the bark were tested for the in vitro inhibition of alpha-amylase using starch as substrate and alpha-glucosidase using p-nitro phenyl alpha-D-gluco pyranoside as substrate to establish its in vitro antidiabetic effect. The mechanism of inhibition was determined by Dixon plot and Cornish-Bowden plot. The cytotoxic effect of the extract was tested on L6 and Vero cell-lines. The extract was partially purified by TLC. The individual effect of the ethanolic extract, TLC fractions and its combinatorial effect with insulin and glibenclamide on glucose uptake by rat hemi-diaphragm were studied.Results revealed that the ethanolic extracts of Polyalthia longifolia bark exhibited competitive inhibition of alpha-amylase and alpha-glucosidase. The extracts were also found not to be cytotoxic at the highest dose of 1 mg/mL. Glucose uptake study revealed that the extract alone and when combined with insulin, decreased the glucose uptake when compared to insulin control, however the purified TLC fractions exhibited significantly higher (p<0.05) glucose uptake by the rat hemi-diaphragm when compared to insulin. The study shows various possible mechanism of in vitro antidiabetic effect of the P. longifolia bark.

Keywords: alpha-amylase, alpha-glucosidase, dixon, cornish-bowden, L6 , Vero cell-lines, glucose uptake, polyalthia longifolia bark, ethanolic extract, TLC fractions

Procedia PDF Downloads 444
12 The Contribution of Corpora to the Investigation of Cross-Linguistic Equivalence in Phraseology: A Contrastive Analysis of Russian and Italian Idioms

Authors: Federica Floridi

Abstract:

The long tradition of contrastive idiom research has essentially been focusing on three domains: the comparison of structural types of idioms (e.g. verbal idioms, idioms with noun-phrase structure, etc.), the description of idioms belonging to the same thematic groups (Sachgruppen), the identification of different types of cross-linguistic equivalents (i.e. full equivalents, partial equivalents, phraseological parallels, non-equivalents). The diastratic, diachronic and diatopic aspects of the compared idioms, as well as their syntactic, pragmatic and semantic properties, have been rather ignored. Corpora (both monolingual and parallel) give the opportunity to investigate the actual use of correlating idioms in authentic texts of L1 and L2. Adopting the corpus-based approach, it is possible to draw attention to the frequency of occurrence of idioms, their syntactic embedding, their potential syntactic transformations (e.g., nominalization, passivization, relativization, etc.), their combinatorial possibilities, the variations of their lexical structure, their connotations in terms of stylistic markedness or register. This paper aims to present the results of a contrastive analysis of Russian and Italian idioms referring to the concepts of ‘beginning’ and ‘end’, that has been carried out by using the Russian National Corpus and the ‘La Repubblica’ corpus. Beyond the digital corpora, bilingual dictionaries, like Skvorcova - Majzel’, Dobrovol’skaja, Kovalev, Čerdanceva, as well as monolingual resources, have been consulted. The study has shown that many of the idioms that have been traditionally indicated as cross-linguistic equivalents on bilingual dictionaries cannot be considered correspondents. The findings demonstrate that even those idioms, that are formally identical in Russian and Italian and are presumably derived from the same source (e.g., conceptual metaphor, Bible, classical mythology, World literature), exhibit differences regarding usage. The ultimate purpose of this article is to highlight that it is necessary to review and improve the existing bilingual dictionaries considering the empirical data collected in corpora. The materials gathered in this research can contribute to this sense.

Keywords: corpora, cross-linguistic equivalence, idioms, Italian, Russian

Procedia PDF Downloads 116
11 The Integration of Geographical Information Systems and Capacitated Vehicle Routing Problem with Simulated Demand for Humanitarian Logistics in Tsunami-Prone Area: A Case Study of Phuket, Thailand

Authors: Kiatkulchai Jitt-Aer, Graham Wall, Dylan Jones

Abstract:

As a result of the Indian Ocean tsunami in 2004, logistics applied to disaster relief operations has received great attention in the humanitarian sector. As learned from such disaster, preparing and responding to the aspect of delivering essential items from distribution centres to affected locations are of the importance for relief operations as the nature of disasters is uncertain especially in suffering figures, which are normally proportional to quantity of supplies. Thus, this study proposes a spatial decision support system (SDSS) for humanitarian logistics by integrating Geographical Information Systems (GIS) and the capacitated vehicle routing problem (CVRP). The GIS is utilised for acquiring demands simulated from the tsunami flooding model of the affected area in the first stage, and visualising the simulation solutions in the last stage. While CVRP in this study encompasses designing the relief routes of a set of homogeneous vehicles from a relief centre to a set of geographically distributed evacuation points in which their demands are estimated by using both simulation and randomisation techniques. The CVRP is modeled as a multi-objective optimization problem where both total travelling distance and total transport resources used are minimized, while demand-cost efficiency of each route is maximized in order to determine route priority. As the model is a NP-hard combinatorial optimization problem, the Clarke and Wright Saving heuristics is proposed to solve the problem for the near-optimal solutions. The real-case instances in the coastal area of Phuket, Thailand are studied to perform the SDSS that allows a decision maker to visually analyse the simulation scenarios through different decision factors.

Keywords: demand simulation, humanitarian logistics, geographical information systems, relief operations, capacitated vehicle routing problem

Procedia PDF Downloads 222