Search results for: sequence alignment problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 8489

Search results for: sequence alignment problem

7679 Learning to Translate by Learning to Communicate to an Entailment Classifier

Authors: Szymon Rutkowski, Tomasz Korbak

Abstract:

We present a reinforcement-learning-based method of training neural machine translation models without parallel corpora. The standard encoder-decoder approach to machine translation suffers from two problems we aim to address. First, it needs parallel corpora, which are scarce, especially for low-resource languages. Second, it lacks psychological plausibility of learning procedure: learning a foreign language is about learning to communicate useful information, not merely learning to transduce from one language’s 'encoding' to another. We instead pose the problem of learning to translate as learning a policy in a communication game between two agents: the translator and the classifier. The classifier is trained beforehand on a natural language inference task (determining the entailment relation between a premise and a hypothesis) in the target language. The translator produces a sequence of actions that correspond to generating translations of both the hypothesis and premise, which are then passed to the classifier. The translator is rewarded for classifier’s performance on determining entailment between sentences translated by the translator to disciple’s native language. Translator’s performance thus reflects its ability to communicate useful information to the classifier. In effect, we train a machine translation model without the need for parallel corpora altogether. While similar reinforcement learning formulations for zero-shot translation were proposed before, there is a number of improvements we introduce. While prior research aimed at grounding the translation task in the physical world by evaluating agents on an image captioning task, we found that using a linguistic task is more sample-efficient. Natural language inference (also known as recognizing textual entailment) captures semantic properties of sentence pairs that are poorly correlated with semantic similarity, thus enforcing basic understanding of the role played by compositionality. It has been shown that models trained recognizing textual entailment produce high-quality general-purpose sentence embeddings transferrable to other tasks. We use stanford natural language inference (SNLI) dataset as well as its analogous datasets for French (XNLI) and Polish (CDSCorpus). Textual entailment corpora can be obtained relatively easily for any language, which makes our approach more extensible to low-resource languages than traditional approaches based on parallel corpora. We evaluated a number of reinforcement learning algorithms (including policy gradients and actor-critic) to solve the problem of translator’s policy optimization and found that our attempts yield some promising improvements over previous approaches to reinforcement-learning based zero-shot machine translation.

Keywords: agent-based language learning, low-resource translation, natural language inference, neural machine translation, reinforcement learning

Procedia PDF Downloads 125
7678 Numerical Computation of Sturm-Liouville Problem with Robin Boundary Condition

Authors: Theddeus T. Akano, Omotayo A. Fakinlede

Abstract:

The modelling of physical phenomena, such as the earth’s free oscillations, the vibration of strings, the interaction of atomic particles, or the steady state flow in a bar give rise to Sturm-Liouville (SL) eigenvalue problems. The boundary applications of some systems like the convection-diffusion equation, electromagnetic and heat transfer problems requires the combination of Dirichlet and Neumann boundary conditions. Hence, the incorporation of Robin boundary condition in the analyses of Sturm-Liouville problem. This paper deals with the computation of the eigenvalues and eigenfunction of generalized Sturm-Liouville problems with Robin boundary condition using the finite element method. Numerical solutions of classical Sturm–Liouville problems are presented. The results show an agreement with the exact solution. High results precision is achieved with higher number of elements.

Keywords: Sturm-Liouville problem, Robin boundary condition, finite element method, eigenvalue problems

Procedia PDF Downloads 355
7677 Research on the Effectiveness of Online Guided Case Teaching in Problem-Based Learning: A Preschool Special Education Course

Authors: Chen-Ya Juan

Abstract:

Problem-Based Learning uses vague questions to guide student thinking and enhance their self-learning and collaboration. Most teachers implement PBL in a physical classroom, where teachers can monitor and evaluate students’ learning progress and guide them to search resources for answers. However, the prevalence of the Covid-19 in the world had changed from physical teaching to distance teaching. This instruction used many cases and applied Problem-Based Learning combined on the distance teaching via the internet for college students. This study involved an experimental group with PBL and a control group without PBL. The teacher divided all students in PBL class into eight groups, and 7~8 students in each group. The teacher assigned different cases for each group of the PBL class. Three stages of instruction were developed, including background knowledge of Learning, case analysis, and solving problems for each case. This study used a quantitative research method, a two-sample t-test, to find a significant difference in groups with PBL and without PBL. Findings indicated that PBL incased the average score of special education knowledge. The average score was improved by 20.46% in the PBL group and 15.4% without PBL. Results didn’t show significant differences (0.589>0.05) in special education professional knowledge. However, the feedback of the PBL students implied learning more about the application, problem-solving skills, and critical thinking. PBL students were more likely to apply professional knowledge on the actual case, find questions, resources, and answers. Most of them understood the importance of collaboration, working as a team, and communicating with other team members. The suggestions of this study included that (a) different web-based teaching instruments influenced student’s Learning; (b) it is difficult to monitor online PBL progress; (c) online PBL should be implemented flexible and multi-oriented; (d) although PBL did not show a significant difference on the group with PBL and without PBL, it did increase student’s problem-solving skills and critical thinking.

Keywords: problem-based learning, college students, distance learning, case analysis, problem-solving

Procedia PDF Downloads 125
7676 An Analysis of the Relationship between Manufacturing Growth and Economic Growth in South Africa: A Cointegration Approach

Authors: Johannes T. Tsoku, Teboho J. Mosikari, Diteboho Xaba, Thatoyaone Modise

Abstract:

This paper examines the relationship between manufacturing growth and economic growth in South Africa using quarterly data ranging from 2001 to 2014. The paper employed the Johansen cointegration to test the Kaldor’s hypothesis. The Johansen cointegration results revealed that there is a long run relationship between GDP, manufacturing, service and employment. The Granger causality results revealed that there is a unidirectional causality running from manufacturing growth to GDP growth. The overall findings of the study confirm that Kaldor’s first law of growth is applicable in South African economy. Therefore, investment strategies and policies should be alignment towards promoting growth in the manufacturing sector in order to boost the economic growth of South Africa.

Keywords: cointegration, economic growth, Kaldor’s law, manufacturing growth

Procedia PDF Downloads 381
7675 Genome-Wide Assessment of Putative Superoxide Dismutases in Unicellular and Filamentous Cyanobacteria

Authors: Shivam Yadav, Neelam Atri

Abstract:

Cyanobacteria are photoautotrophic prokaryotes able to grow in diverse ecological habitats, originated 2.5 - 3.5 billion years ago and brought oxygenic photosynthesis. Since then superoxide dismutases (SODs) acquired great significance due to their ability to catalyze detoxification of byproducts of oxygenic photosynthesis, i.e. superoxide radicals. Sequence information from several cyanobacterial genomes offers a unique opportunity to conduct a comprehensive comparative analysis of the superoxide dismutases family. In the present study, we extracted information regarding SODs from species of sequenced cyanobacteria and investigated their diversity, conservation, domain structure, and evolution. 144 putative SOD homologues were identified. SODs are present in all cyanobacterial species reflecting their significant role in survival. However, their distribution varies, fewer in unicellular marine strains whereas abundant in filamentous nitrogen-fixing cyanobacteria. Motifs and invariant amino acids typical in eukaryotic SODs were conserved well in these proteins. These SODs were classified into three major families according to their domain structures. Interestingly, they lack additional domains as found in proteins of other family. Phylogenetic relationships correspond well with phylogenies based on 16S rRNA and clustering occurs on the basis of structural characteristics such as domain organization. Similar conserved motifs and amino acids indicate that cyanobacterial SODs make use of a similar catalytic mechanism as eukaryotic SODs. Gene gain-and-loss is insignificant during SOD evolution as evidenced by absence of additional domain. This study has not only examined an overall background of sequence-structure-function interactions for the SOD gene family but also revealed variation among SOD distribution based on ecophysiological and morphological characters.

Keywords: comparative genomics, cyanobacteria, phylogeny, superoxide dismutases

Procedia PDF Downloads 128
7674 Active Learning Based on Science Experiments to Improve Scientific Literacy

Authors: Kunihiro Kamataki

Abstract:

In this study, active learning based on simple science experiments was developed in a university class of the freshman, in order to improve their scientific literacy. Through the active learning based on simple experiments of generation of cloud in a plastic bottle, students increased the interest in the global atmospheric problem and were able to discuss and find solutions about this problem positively from various viewpoints of the science technology, the politics, the economy, the diplomacy and the relations among nations. The results of their questionnaires and free descriptions of this class indicate that they improve the scientific literacy and motivations of other classroom lectures to acquire knowledge. It is thus suggested that the science experiment is strong tool to improve their intellectual curiosity rapidly and the connections that link the impression of science experiment and their interest of the social problem is very important to enhance their learning effect in this education.

Keywords: active learning, scientific literacy, simple scientific experiment, university education

Procedia PDF Downloads 254
7673 The Challenge of Graduate Unemployment in Nigeria: The Role of Entrepreneurship Education

Authors: Sunday Ose Ugadu

Abstract:

Unemployment, especially graduate unemployment is, for now, the greatest problem facing Nigeria as a nation. It is responsible for most of the other ills of the country, including kidnapping, armed robbery, youth restiveness, thuggery, to mention but a few. More and more people in Nigeria are now losing confidence in the prospect of tertiary education as an instrument par excellence for effecting national development. This paper, therefore, critically examined the problem of graduate unemployment in Nigeria. It briefly traced the history of university education in Nigeria. The rate and causes of graduate unemployment in Nigeria were also discussed. Previous attempts made by the government to solve the problem of unemployment were highlighted. The paper also harped on the prospect of entrepreneurship education as an instrument for fighting graduate unemployment identifying obstacles to entrepreneurship education in Nigeria. The paper drew conclusion, and major recommendation made was a call for converting the National Youth Service Corps Scheme in Nigeria to entrepreneurship and skills acquisition scheme as soon as possible.

Keywords: graduate, unemployment, entrepreneurship education, national development

Procedia PDF Downloads 181
7672 Optimizing Network Latency with Fast Path Assignment for Incoming Flows

Authors: Qing Lyu, Hang Zhu

Abstract:

Various flows in the network require to go through different types of middlebox. The improper placement of network middlebox and path assignment for flows could greatly increase the network latency and also decrease the performance of network. Minimizing the total end to end latency of all the ows requires to assign path for the incoming flows. In this paper, the flow path assignment problem in regard to the placement of various kinds of middlebox is studied. The flow path assignment problem is formulated to a linear programming problem, which is very time consuming. On the other hand, a naive greedy algorithm is studied. Which is very fast but causes much more latency than the linear programming algorithm. At last, the paper presents a heuristic algorithm named FPA, which takes bottleneck link information and estimated bandwidth occupancy into consideration, and achieves near optimal latency in much less time. Evaluation results validate the effectiveness of the proposed algorithm.

Keywords: flow path, latency, middlebox, network

Procedia PDF Downloads 201
7671 Multi-Objective Simulated Annealing Algorithms for Scheduling Just-In-Time Assembly Lines

Authors: Ghorbanali Mohammadi

Abstract:

New approaches to sequencing mixed-model manufacturing systems are present. These approaches have attracted considerable attention due to their potential to deal with difficult optimization problems. This paper presents Multi-Objective Simulated Annealing Algorithms (MOSAA) approaches to the Just-In-Time (JIT) sequencing problem where workload-smoothing (WL) and the number of set-ups (St) are to be optimized simultaneously. Mixed-model assembly lines are types of production lines where varieties of product models similar in product characteristics are assembled. Moreover, this type of problem is NP-hard. Two annealing methods are proposed to solve the multi-objective problem and find an efficient frontier of all design configurations. The performances of the two methods are tested on several problems from the literature. Experimentation demonstrates the relative desirable performance of the presented methodology.

Keywords: scheduling, just-in-time, mixed-model assembly line, sequencing, simulated annealing

Procedia PDF Downloads 123
7670 Decision Making for Industrial Engineers: From Phenomenon to Value

Authors: Ali Abbas

Abstract:

Industrial Engineering is a broad multidisciplinary field with intersections and applications in numerous areas. In out current environment, the path from a phenomenon to value involves numerous people with expertise in various areas including domain knowledge of a field and the ability to make decisions within an operating environment that lead to value creation. We propose some skills that industrial engineering programs should focus on, and argue that an industrial engineer is a decision maker instead of a problem solver.

Keywords: decision analysis, problem-solving, value creation, industrial engineering

Procedia PDF Downloads 368
7669 Understanding the Issue of Reproductive Matters among Urban Women: A Study of Four Cities in India from National Family Health Survey-4

Authors: Priyanka Dixit

Abstract:

Reproductive health problem is an important public health issue in most of the developing countries like India. It is a common problem in India for women in the reproductive age group to suffer from reproductive illnesses and not seek care. Existing literatures tell us very little about the several dimensions of reproductive morbidity. In addition the general perception says, metros have better medical infrastructure, so its residents should lead a healthier life. However some of the studies reveal a very different picture. Therefore, the present study is conducted with the specific objectives to find out the prevalence of reproductive health problem and treatment seeking behavior of currently married women in four metro cities in India namely; Mumbai, Delhi, Chennai and Kolkata. In addition, this paper also examines the effect of socio-economic and demographic factors on self-reported reproductive health problems. Bi-variate and multivariate regression have been applied to achieve the proposed objectives. Study is based on National Family Health Survey 2015-16 data. The analysis shows that the prevalence of any reproductive health problem among women is the highest in Mumbai followed by Delhi, Chennai, and Kolkata. A bulk of women in all four metro cities has reported abdominal pain, itching and burning sensation as the major problems while urinating. However, in spite of the high prevalence of reproductive health problems, a huge proportion of such women in all these cities do not seek any advice or treatment for these problems. This study also investigates determinants that affect the prevalence of reproductive health problem to policy makers plan for proper interventions for improving women’s reproductive health.

Keywords: reproductive health, India, national family health survey-4, city

Procedia PDF Downloads 204
7668 Comparison of Effects over the Autonomic Nervous System When Using Force Training and Interval Training in Indoor Cycling with University Students

Authors: Daniel Botero, Oscar Rubiano, Pedro P. Barragan, Jaime Baron, Leonardo Rodriguez Perdomo, Jaime Rodriguez

Abstract:

In the last decade interval training (IT) has gained importance when is compare with strength training (ST). However, there are few studies analyzing the impact of these training over the autonomic nervous system (ANS). This work has aimed to compare the activity of the autonomic nervous system, when is expose to an IT or ST indoor cycling mode. After approval by the ethics committee, a cross-over clinical trial with 22 healthy participants (age 21 ± 3 years) was implemented. The selection of participants for the groups with sequence force-interval (F-I) and interval-force (I-F) was made randomly with assignation of 11 participants for each group. The temporal series of heart rate was obtained before and after each training using the POLAR TEAM® heart monitor. The evaluation of the ANS was performed with spectral analysis of the heart rate variability (HRV) using the fast Fourier transform (Kubios software). A training of 8 weeks in each sequence (4 weeks with each training) with an intermediate period of two weeks of washout was implemented for each group. The power parameter of the HRV in the low frequency band (LF = 0.04-0.15Hz related to the sympathetic nervous system), high frequency (HF = 0.15-0.4Hz, related to the parasympathetic) and LF/HF (with reference to a modulation of parasympathetic over the sympathetic), were calculated. Afterward, the difference between the parameters before and after was realized. Then, to evaluate statistical differences between each training was implemented the method of Wellek (Wellek and Blettner, 2012, Medicine, 109 (15), 276-81). To determine the difference of effect over parasympathetic when FT and IT are used, the T test is implemented obtaining a T value of 0.73 with p-value ≤ 0.1. For the sympathetic was obtained a T of 0.33 with p ≤ 0.1 and for LF/HF the T was 1.44 with a p ≥ 0.1. Then, the carry over effect was evaluated and was not present. Significant changes over autonomic activity with strength or interval training were not observed. However, a modulation of the parasympathetic over the sympathetic can be observed. Probably, these findings should be explained because the sample is little and/or the time of training was insufficient to generate changes.

Keywords: autonomic nervous, force training, indoor cycling, interval training

Procedia PDF Downloads 220
7667 A Multi Objective Reliable Location-Inventory Capacitated Disruption Facility Problem with Penalty Cost Solve with Efficient Meta Historic Algorithms

Authors: Elham Taghizadeh, Mostafa Abedzadeh, Mostafa Setak

Abstract:

Logistics network is expected that opened facilities work continuously for a long time horizon without any failure; but in real world problems, facilities may face disruptions. This paper studies a reliable joint inventory location problem to optimize cost of facility locations, customers’ assignment, and inventory management decisions when facilities face failure risks and doesn’t work. In our model we assume when a facility is out of work, its customers may be reassigned to other operational facilities otherwise they must endure high penalty costs associated with losing service. For defining the model closer to real world problems, the model is proposed based on p-median problem and the facilities are considered to have limited capacities. We define a new binary variable (Z_is) for showing that customers are not assigned to any facilities. Our problem involve a bi-objective model; the first one minimizes the sum of facility construction costs and expected inventory holding costs, the second one function that mention for the first one is minimizes maximum expected customer costs under normal and failure scenarios. For solving this model we use NSGAII and MOSS algorithms have been applied to find the pareto- archive solution. Also Response Surface Methodology (RSM) is applied for optimizing the NSGAII Algorithm Parameters. We compare performance of two algorithms with three metrics and the results show NSGAII is more suitable for our model.

Keywords: joint inventory-location problem, facility location, NSGAII, MOSS

Procedia PDF Downloads 521
7666 Efficient Control of Brushless DC Motors with Pulse Width Modulation

Authors: S. Shahzadi, J. Rizk

Abstract:

This paper describes the pulse width modulated control of a three phase, 4 polar DC brushless motor. To implement this practically the Atmel’s AVR ATmega 328 microcontroller embedded on an Arduino Eleven board is utilized. The microcontroller programming is done in an open source Arduino IDE development environment. The programming logic effectively manipulated a six MOSFET bridge which was used to energize the stator windings as per control requirements. The results obtained showed accurate, precise and efficient pulse width modulated operation. Another advantage offered by this pulse width modulated control was the efficient speed control of the motor. By varying the time intervals between successive commutations, faster energizing of the stator windings was possible thereby leading to quicker rotor alignment with these energized phases and faster revolutions.

Keywords: brushless DC motors, commutation, MOSFET, PWM

Procedia PDF Downloads 507
7665 Old Community Spatial Integration: Discussion on the Mechanism of Aging Space System Replacement

Authors: Wan-I Chen, Tsung-I Pai

Abstract:

Future the society aging of population will create the social problem has not had the good mechanism solution in the Asian country, especially in Taiwan. In the future ten year the people in Taiwan must facing the condition which is localization aging social problem. In this situation, how to use the spatial in eco way to development space use to solve the old age spatial demand is the way which might develop in the future Taiwan society. Over the next 10 years, taking care of the aging people will become part of the social problem of aging phenomenon. The research concentrate in the feasibility of spatial substitution, secondary use of spatial might solve out of spatial problem for aging people. In order to prove the space usable, the research required to review the project with the support system and infill system for space experiment, by using network grid way. That defined community level of space elements location relationship, make new definitions of space and return to cooperation. Research to innovation in the the appraisal space causes the possibility, by spatial replacement way solution on spatial insufficient suitable condition. To evaluation community spatial by using the support system and infill system in order to see possibilities of use in replacement inner space and modular architecture into housing. The study is discovering the solution on the Eco way to develop space use to figure out the old age spatial demand.

Keywords: sustainable use, space conversion, integration, replacement


Procedia PDF Downloads 174
7664 Scheduling in a Single-Stage, Multi-Item Compatible Process Using Multiple Arc Network Model

Authors: Bokkasam Sasidhar, Ibrahim Aljasser

Abstract:

The problem of finding optimal schedules for each equipment in a production process is considered, which consists of a single stage of manufacturing and which can handle different types of products, where changeover for handling one type of product to the other type incurs certain costs. The machine capacity is determined by the upper limit for the quantity that can be processed for each of the products in a set up. The changeover costs increase with the number of set ups and hence to minimize the costs associated with the product changeover, the planning should be such that similar types of products should be processed successively so that the total number of changeovers and in turn the associated set up costs are minimized. The problem of cost minimization is equivalent to the problem of minimizing the number of set ups or equivalently maximizing the capacity utilization in between every set up or maximizing the total capacity utilization. Further, the production is usually planned against customers’ orders, and generally different customers’ orders are assigned one of the two priorities – “normal” or “priority” order. The problem of production planning in such a situation can be formulated into a Multiple Arc Network (MAN) model and can be solved sequentially using the algorithm for maximizing flow along a MAN and the algorithm for maximizing flow along a MAN with priority arcs. The model aims to provide optimal production schedule with an objective of maximizing capacity utilization, so that the customer-wise delivery schedules are fulfilled, keeping in view the customer priorities. Algorithms have been presented for solving the MAN formulation of the production planning with customer priorities. The application of the model is demonstrated through numerical examples.

Keywords: scheduling, maximal flow problem, multiple arc network model, optimization

Procedia PDF Downloads 397
7663 Assessment of DNA Sequence Encoding Techniques for Machine Learning Algorithms Using a Universal Bacterial Marker

Authors: Diego Santibañez Oyarce, Fernanda Bravo Cornejo, Camilo Cerda Sarabia, Belén Díaz Díaz, Esteban Gómez Terán, Hugo Osses Prado, Raúl Caulier-Cisterna, Jorge Vergara-Quezada, Ana Moya-Beltrán

Abstract:

The advent of high-throughput sequencing technologies has revolutionized genomics, generating vast amounts of genetic data that challenge traditional bioinformatics methods. Machine learning addresses these challenges by leveraging computational power to identify patterns and extract information from large datasets. However, biological sequence data, being symbolic and non-numeric, must be converted into numerical formats for machine learning algorithms to process effectively. So far, some encoding methods, such as one-hot encoding or k-mers, have been explored. This work proposes additional approaches for encoding DNA sequences in order to compare them with existing techniques and determine if they can provide improvements or if current methods offer superior results. Data from the 16S rRNA gene, a universal marker, was used to analyze eight bacterial groups that are significant in the pulmonary environment and have clinical implications. The bacterial genes included in this analysis are Prevotella, Abiotrophia, Acidovorax, Streptococcus, Neisseria, Veillonella, Mycobacterium, and Megasphaera. These data were downloaded from the NCBI database in Genbank file format, followed by a syntactic analysis to selectively extract relevant information from each file. For data encoding, a sequence normalization process was carried out as the first step. From approximately 22,000 initial data points, a subset was generated for testing purposes. Specifically, 55 sequences from each bacterial group met the length criteria, resulting in an initial sample of approximately 440 sequences. The sequences were encoded using different methods, including one-hot encoding, k-mers, Fourier transform, and Wavelet transform. Various machine learning algorithms, such as support vector machines, random forests, and neural networks, were trained to evaluate these encoding methods. The performance of these models was assessed using multiple metrics, including the confusion matrix, ROC curve, and F1 Score, providing a comprehensive evaluation of their classification capabilities. The results show that accuracies between encoding methods vary by up to approximately 15%, with the Fourier transform obtaining the best results for the evaluated machine learning algorithms. These findings, supported by the detailed analysis using the confusion matrix, ROC curve, and F1 Score, provide valuable insights into the effectiveness of different encoding methods and machine learning algorithms for genomic data analysis, potentially improving the accuracy and efficiency of bacterial classification and related genomic studies.

Keywords: DNA encoding, machine learning, Fourier transform, Fourier transformation

Procedia PDF Downloads 13
7662 Antibacterial Activity of Endophytic Bacteria against Multidrug-Resistant Bacteria: Isolation, Characterization, and Antibacterial Activity

Authors: Maryam Beiranvand, Sajad Yaghoubi

Abstract:

Background: Some microbes can colonize plants’ inner tissues without causing obvious damage and can even produce useful bioactive substances. In the present study, the diversity of the endophytic bacteria associated with medicinal plants from Iran was investigated by culturing techniques, molecular gene identification, as well as measuring them for antibacterial activity. Results: In the spring season from 2013 to 2014, 35 herb pharmacology samples were collected, sterilized, meshed, and then cultured on selective media culture. A total of 199 endophytic bacteria were successfully isolated from 35 tissue cultures of medical plants, and sixty-seven out of 199 bacterial isolates were subjected to identification by the 16S rRNA gene sequence analysis method. Based on the sequence similarity gene and phylogenetic analyses, these isolates were grouped into five classes, fourteen orders, seventeen families, twenty-one genera, and forty strains. The most abundant group of endophytic bacteria was actinobacterial, consisting of thirty-two (47%) out of 67 bacterial isolates. Ten (22.3%) out of 67 bacterial isolates remained unidentified and classified at the genus level. The signature of the 16S rRNA gene formed a distinct line in a phylogenetic tree showing that they might be new species of bacteria. One (5.2%) out of 67 bacterial isolates was still not well categorized. Forty-two out of 67 strains were candidates for antimicrobial activity tests. Nineteen (45%) out of 42 strains showed antimicrobial activity multidrug resistance (MDR); thirteen (68%) out of 19 strains were allocated to classes actinobacteria. Four (21%) out of 19 strains belonged to the Bacillaceae family, one (5.2%) out of 19 strains was the Paenibacillaceae family, and one (5.2%) out of 19 strains belonged to the Pseudomonadaceae family. The other twenty-three strains did not show inhibitory activities. Conclusions: Our research showed a high-level phylogenetic diversity and the intoxicating antibiotic activity of endophytic bacteria in the herb pharmacology of Iran.

Keywords: Antibacterial activity, endophytic bacteria, multidrug-resistant bacteria, whole genom sequencing

Procedia PDF Downloads 78
7661 Cars in a Neighborhood: A Case of Sustainable Living in Sector 22 Chandigarh

Authors: Maninder Singh

Abstract:

The Chandigarh city is under the strain of exponential growth of car density across various neighborhood. The consumerist nature of society today is to be blamed for this menace because everyone wants to own and ride a car. Car manufacturers are busy selling two or more cars per household. The Regional Transport Offices are busy issuing as many licenses to new vehicles as they can in order to generate revenue in the form of Road Tax. The car traffic in the neighborhoods of Chandigarh has reached a tipping point. There needs to be a more empirical and sustainable model of cars per household, which should be based on specific parameters of livable neighborhoods. Sector 22 in Chandigarh is one of the first residential sectors to be established in the city. There is scope to think, reflect, and work out a method to know how many cars we need to sell our citizens before we lose the argument to traffic problems, parking problems, and road rage. This is where the true challenge of a planner or a designer of the city lies. Currently, in Chandigarh city, there are no clear visible answers to this problem. The way forward is to look at spatial mapping, planning, and design of car parking units to address the problem, rather than suggesting extreme measures of banning cars (short-term) or promoting plans for citywide transport (very long-term). This is a chance to resolve the problem with a pragmatic approach from a citizen’s perspective, instead of an orthodox development planner’s methodology. Since citizens are at the center of how the problem is to be addressed, acceptable solutions are more likely to emerge from the car and traffic problem as defined by the citizens. Thus, the idea and its implementation would be interesting in comparison to the known academic methodologies. The novel and innovative process would lead to a more acceptable and sustainable approach to the issue of number of car parks in the neighborhood of Chandigarh city.

Keywords: cars, Chandigarh, neighborhood, sustainable living, walkability

Procedia PDF Downloads 146
7660 Stable Time Reversed Integration of the Navier-Stokes Equation Using an Adjoint Gradient Method

Authors: Jurriaan Gillissen

Abstract:

This work is concerned with stabilizing the numerical integration of the Navier-Stokes equation (NSE), backwards in time. Applications involve the detection of sources of, e.g., sound, heat, and pollutants. Stable reverse numerical integration of parabolic differential equations is also relevant for image de-blurring. While the literature addresses the reverse integration problem of the advection-diffusion equation, the problem of numerical reverse integration of the NSE has, to our knowledge, not yet been addressed. Owing to the presence of viscosity, the NSE is irreversible, i.e., when going backwards in time, the fluid behaves, as if it had a negative viscosity. As an effect, perturbations from the perfect solution, due to round off errors or discretization errors, grow exponentially in time, and reverse integration of the NSE is inherently unstable, regardless of using an implicit time integration scheme. Consequently, some sort of filtering is required, in order to achieve a stable, numerical, reversed integration. The challenge is to find a filter with a minimal adverse affect on the accuracy of the reversed integration. In the present work, we explore an adjoint gradient method (AGM) to achieve this goal, and we apply this technique to two-dimensional (2D), decaying turbulence. The AGM solves for the initial velocity field u0 at t = 0, that, when integrated forward in time, produces a final velocity field u1 at t = 1, that is as close as is feasibly possible to some specified target field v1. The initial field u0 defines a minimum of a cost-functional J, that measures the distance between u1 and v1. In the minimization procedure, the u0 is updated iteratively along the gradient of J w.r.t. u0, where the gradient is obtained by transporting J backwards in time from t = 1 to t = 0, using the adjoint NSE. The AGM thus effectively replaces the backward integration by multiple forward and backward adjoint integrations. Since the viscosity is negative in the adjoint NSE, each step of the AGM is numerically stable. Nevertheless, when applied to turbulence, the AGM develops instabilities, which limit the backward integration to small times. This is due to the exponential divergence of phase space trajectories in turbulent flow, which produces a multitude of local minima in J, when the integration time is large. As an effect, the AGM may select unphysical, noisy initial conditions. In order to improve this situation, we propose two remedies. First, we replace the integration by a sequence of smaller integrations, i.e., we divide the integration time into segments, where in each segment the target field v1 is taken as the initial field u0 from the previous segment. Second, we add an additional term (regularizer) to J, which is proportional to a high-order Laplacian of u0, and which dampens the gradients of u0. We show that suitable values for the segment size and for the regularizer, allow a stable reverse integration of 2D decaying turbulence, with accurate results for more then O(10) turbulent, integral time scales.

Keywords: time reversed integration, parabolic differential equations, adjoint gradient method, two dimensional turbulence

Procedia PDF Downloads 218
7659 A Column Generation Based Algorithm for Airline Cabin Crew Rostering Problem

Authors: Nan Xu

Abstract:

In airlines, the crew scheduling problem is usually decomposed into two stages: crew pairing and crew rostering. In the crew pairing stage, pairings are generated such that each flight is covered by exactly one pairing and the overall cost is minimized. In the crew rostering stage, the pairings generated in the crew pairing stage are combined with off days, training and other breaks to create individual work schedules. The paper focuses on cabin crew rostering problem, which is challenging due to the extremely large size and the complex working rules involved. In our approach, the objective of rostering consists of two major components. The first is to minimize the number of unassigned pairings and the second is to ensure the fairness to crew members. There are two measures of fairness to crew members, the number of overnight duties and the total fly-hour over a given period. Pairings should be assigned to each crew member so that their actual overnight duties and fly hours are as close to the expected average as possible. Deviations from the expected average are penalized in the objective function. Since several small deviations are preferred than a large deviation, the penalization is quadratic. Our model of the airline crew rostering problem is based on column generation. The problem is decomposed into a master problem and subproblems. The mater problem is modeled as a set partition problem and exactly one roster for each crew is picked up such that the pairings are covered. The restricted linear master problem (RLMP) is considered. The current subproblem tries to find columns with negative reduced costs and add them to the RLMP for the next iteration. When no column with negative reduced cost can be found or a stop criteria is met, the procedure ends. The subproblem is to generate feasible crew rosters for each crew member. A separate acyclic weighted graph is constructed for each crew member and the subproblem is modeled as resource constrained shortest path problems in the graph. Labeling algorithm is used to solve it. Since the penalization is quadratic, a method to deal with non-additive shortest path problem using labeling algorithm is proposed and corresponding domination condition is defined. The major contribution of our model is: 1) We propose a method to deal with non-additive shortest path problem; 2) Operation to allow relaxing some soft rules is allowed in our algorithm, which can improve the coverage rate; 3) Multi-thread techniques are used to improve the efficiency of the algorithm when generating Line-of-Work for crew members. Here a column generation based algorithm for the airline cabin crew rostering problem is proposed. The objective is to assign a personalized roster to crew member which minimize the number of unassigned pairings and ensure the fairness to crew members. The algorithm we propose in this paper has been put into production in a major airline in China and numerical experiments show that it has a good performance.

Keywords: aircrew rostering, aircrew scheduling, column generation, SPPRC

Procedia PDF Downloads 142
7658 Numerical Solution of Portfolio Selecting Semi-Infinite Problem

Authors: Alina Fedossova, Jose Jorge Sierra Molina

Abstract:

SIP problems are part of non-classical optimization. There are problems in which the number of variables is finite, and the number of constraints is infinite. These are semi-infinite programming problems. Most algorithms for semi-infinite programming problems reduce the semi-infinite problem to a finite one and solve it by classical methods of linear or nonlinear programming. Typically, any of the constraints or the objective function is nonlinear, so the problem often involves nonlinear programming. An investment portfolio is a set of instruments used to reach the specific purposes of investors. The risk of the entire portfolio may be less than the risks of individual investment of portfolio. For example, we could make an investment of M euros in N shares for a specified period. Let yi> 0, the return on money invested in stock i for each dollar since the end of the period (i = 1, ..., N). The logical goal here is to determine the amount xi to be invested in stock i, i = 1, ..., N, such that we maximize the period at the end of ytx value, where x = (x1, ..., xn) and y = (y1, ..., yn). For us the optimal portfolio means the best portfolio in the ratio "risk-return" to the investor portfolio that meets your goals and risk ways. Therefore, investment goals and risk appetite are the factors that influence the choice of appropriate portfolio of assets. The investment returns are uncertain. Thus we have a semi-infinite programming problem. We solve a semi-infinite optimization problem of portfolio selection using the outer approximations methods. This approach can be considered as a developed Eaves-Zangwill method applying the multi-start technique in all of the iterations for the search of relevant constraints' parameters. The stochastic outer approximations method, successfully applied previously for robotics problems, Chebyshev approximation problems, air pollution and others, is based on the optimal criteria of quasi-optimal functions. As a result we obtain mathematical model and the optimal investment portfolio when yields are not clear from the beginning. Finally, we apply this algorithm to a specific case of a Colombian bank.

Keywords: outer approximation methods, portfolio problem, semi-infinite programming, numerial solution

Procedia PDF Downloads 304
7657 A Coupled Stiffened Skin-Rib Fully Gradient Based Optimization Approach for a Wing Box Made of Blended Composite Materials

Authors: F. Farzan Nasab, H. J. M. Geijselaers, I. Baran, A. De Boer

Abstract:

A method is introduced for the coupled skin-rib optimization of a wing box where mass minimization is the objective and local buckling is the constraint. The structure is made of composite materials where continuity of plies in multiple adjacent panels (blending) has to be satisfied. Blending guarantees the manufacturability of the structure; however, it is a highly challenging constraint to treat and has been under debate in recent research in the same area. To fulfill design guidelines with respect to symmetry, balance, contiguity, disorientation and percentage rule of the layup, a reference for the stacking sequences (stacking sequence table or SST) is generated first. Then, an innovative fully gradient-based optimization approach in relation to a specific SST is introduced to obtain the optimum thickness distribution all over the structure while blending is fulfilled. The proposed optimization approach aims to turn the discrete optimization problem associated with the integer number of plies into a continuous one. As a result of a wing box deflection, a rib is subjected to load values which vary nonlinearly with the amount of deflection. The bending stiffness of a skin affects the wing box deflection and thus affects the load applied to a rib. This indicates the necessity of a coupled skin-rib optimization approach for a more realistic optimized design. The proposed method is examined with the optimization of the layup of a composite stiffened skin and rib of a wing torsion box subjected to in-plane normal and shear loads. Results show that the method can successfully prescribe a valid design with a significantly cheap computation cost.

Keywords: blending, buckling optimization, composite panels, wing torsion box

Procedia PDF Downloads 400
7656 Classification of Construction Projects

Authors: M. Safa, A. Sabet, S. MacGillivray, M. Davidson, K. Kaczmarczyk, C. T. Haas, G. E. Gibson, D. Rayside

Abstract:

To address construction project requirements and specifications, scholars and practitioners need to establish a taxonomy according to a scheme that best fits their need. While existing characterization methods are continuously being improved, new ones are devised to cover project properties which have not been previously addressed. One such method, the Project Definition Rating Index (PDRI), has received limited consideration strictly as a classification scheme. Developed by the Construction Industry Institute (CII) in 1996, the PDRI has been refined over the last two decades as a method for evaluating a project's scope definition completeness during front-end planning (FEP). The main contribution of this study is a review of practical project classification methods, and a discussion of how PDRI can be used to classify projects based on their readiness in the FEP phase. The proposed model has been applied to 59 construction projects in Ontario, and the results are discussed.

Keywords: project classification, project definition rating index (PDRI), risk, project goals alignment

Procedia PDF Downloads 674
7655 Model Updating-Based Approach for Damage Prognosis in Frames via Modal Residual Force

Authors: Gholamreza Ghodrati Amiri, Mojtaba Jafarian Abyaneh, Ali Zare Hosseinzadeh

Abstract:

This paper presents an effective model updating strategy for damage localization and quantification in frames by defining damage detection problem as an optimization issue. A generalized version of the Modal Residual Force (MRF) is employed for presenting a new damage-sensitive cost function. Then, Grey Wolf Optimization (GWO) algorithm is utilized for solving suggested inverse problem and the global extremums are reported as damage detection results. The applicability of the presented method is investigated by studying different damage patterns on the benchmark problem of the IASC-ASCE, as well as a planar shear frame structure. The obtained results emphasize good performance of the method not only in free-noise cases, but also when the input data are contaminated with different levels of noises.

Keywords: frame, grey wolf optimization algorithm, modal residual force, structural damage detection

Procedia PDF Downloads 381
7654 Isolation, Characterization, and Antibacterial Activity of Endophytic Bacteria from Iranian Medicinal Plants

Authors: Maryam Beiranvand, Sajad Yaghoubi

Abstract:

Background: Some microbes can colonize plants’ inner tissues without causing obvious damage and can even produce useful bioactive substances. In the present study, the diversity of the endophytic bacteria associated with medicinal plants from Iran was investigated by culturing techniques, molecular gene identification, as well as measuring them for antibacterial activity. Results: In the spring season from 2013 to 2014, 35 herb pharmacology samples were collected, sterilized, meshed, and then cultured on selective media culture. A total of 199 endophytic bacteria were successfully isolated from 35 tissue cultures of medical plants, and sixty-seven out of 199 bacterial isolates were subjected to identification by the 16S rRNA gene sequence analysis method. Based on the sequence similarity gene and phylogenetic analyses, these isolates were grouped into five classes, fourteen orders, seventeen families, twenty-one genera, and forty strains. The most abundant group of endophytic bacteria was actinobacterial, consisting of thirty-two (47%) out of 67 bacterial isolates. Ten (22.3%) out of 67 bacterial isolates remained unidentified and classified at the genus level. The signature of the 16S rRNA gene formed a distinct line in a phylogenetic tree showing that they might be new species of bacteria. One (5.2%) out of 67 bacterial isolates was still not well categorized. Forty-two out of 67 strains were candidates for antimicrobial activity tests. Nineteen (45%) out of 42 strains showed antimicrobial activity multidrug-resistance (MDR); thirteen (68%) out of 19 strains were allocated to classes actinobacteria. Four (21%) out of 19 strains belonged to the Bacillaceae family, one (5.2%) out of 19 strains was the Paenibacillaceae family, and one (5.2%) out of 19 strains belonged to the Pseudomonadaceae family. The other twenty-three strains did not show inhibitory activities. Conclusions: Our research showed a high-level phylogenetic diversity and the intoxicating antibiotic activity of endophytic bacteria in the herb pharmacology of Iran.

Keywords: medical plant, endophytic bacteria, antimicrobial activity, whole genome sequencing analysis

Procedia PDF Downloads 118
7653 The Examination of Withdrawn Behavior in Chinese Adolescents

Authors: Zhidong Zhang, Zhi-Chao Zhang, Georgiana Duarte

Abstract:

This study examined withdrawn syndromes of Chinese school children in northeast China in Northeast China. Specifically, the study examined withdrawn behaviors and the relationship to anxious syndromes and education environments. The purpose is to examine how the elements of educational environments and the early adolescents’ behaviors as independent variables influence and possibly predict the school children’s withdrawn problems. Achenbach System of Empirically Based Assessment (ASEBA), was the instrument, used in collection of data. A stratified sampling method was utilized to collect data from 2532 participants in seven schools. The results indicated that several background variables influenced withdrawn problem. Specifically, age, grade, sports activities and hobbies had a relationship with the anxious/depressed variable. Further withdrawn syndromes and anxious problem indicate a significant correlation.

Keywords: anxious/depressed problem, ASEBA, CBCL, withdrawn syndromes

Procedia PDF Downloads 295
7652 A Modified NSGA-II Algorithm for Solving Multi-Objective Flexible Job Shop Scheduling Problem

Authors: Aydin Teymourifar, Gurkan Ozturk, Ozan Bahadir

Abstract:

NSGA-II is one of the most well-known and most widely used evolutionary algorithms. In addition to its new versions, such as NSGA-III, there are several modified types of this algorithm in the literature. In this paper, a hybrid NSGA-II algorithm has been suggested for solving the multi-objective flexible job shop scheduling problem. For a better search, new neighborhood-based crossover and mutation operators are defined. To create new generations, the neighbors of the selected individuals by the tournament selection are constructed. Also, at the end of each iteration, before sorting, neighbors of a certain number of good solutions are derived, except for solutions protected by elitism. The neighbors are generated using a constraint-based neural network that uses various constructs. The non-dominated sorting and crowding distance operators are same as the classic NSGA-II. A comparison based on some multi-objective benchmarks from the literature shows the efficiency of the algorithm.

Keywords: flexible job shop scheduling problem, multi-objective optimization, NSGA-II algorithm, neighborhood structures

Procedia PDF Downloads 222
7651 Legal Judgment Prediction through Indictments via Data Visualization in Chinese

Authors: Kuo-Chun Chien, Chia-Hui Chang, Ren-Der Sun

Abstract:

Legal Judgment Prediction (LJP) is a subtask for legal AI. Its main purpose is to use the facts of a case to predict the judgment result. In Taiwan's criminal procedure, when prosecutors complete the investigation of the case, they will decide whether to prosecute the suspect and which article of criminal law should be used based on the facts and evidence of the case. In this study, we collected 305,240 indictments from the public inquiry system of the procuratorate of the Ministry of Justice, which included 169 charges and 317 articles from 21 laws. We take the crime facts in the indictments as the main input to jointly learn the prediction model for law source, article, and charge simultaneously based on the pre-trained Bert model. For single article cases where the frequency of the charge and article are greater than 50, the prediction performance of law sources, articles, and charges reach 97.66, 92.22, and 60.52 macro-f1, respectively. To understand the big performance gap between articles and charges, we used a bipartite graph to visualize the relationship between the articles and charges, and found that the reason for the poor prediction performance was actually due to the wording precision. Some charges use the simplest words, while others may include the perpetrator or the result to make the charges more specific. For example, Article 284 of the Criminal Law may be indicted as “negligent injury”, "negligent death”, "business injury", "driving business injury", or "non-driving business injury". As another example, Article 10 of the Drug Hazard Control Regulations can be charged as “Drug Control Regulations” or “Drug Hazard Control Regulations”. In order to solve the above problems and more accurately predict the article and charge, we plan to include the article content or charge names in the input, and use the sentence-pair classification method for question-answer problems in the BERT model to improve the performance. We will also consider a sequence-to-sequence approach to charge prediction.

Keywords: legal judgment prediction, deep learning, natural language processing, BERT, data visualization

Procedia PDF Downloads 117
7650 Three-Dimensional Optimal Path Planning of a Flying Robot for Terrain Following/Terrain Avoidance

Authors: Amirreza Kosari, Hossein Maghsoudi, Malahat Givar

Abstract:

In this study, the three-dimensional optimal path planning of a flying robot for Terrain Following / Terrain Avoidance (TF/TA) purposes using Direct Collocation has been investigated. To this purpose, firstly, the appropriate equations of motion representing the flying robot translational movement have been described. The three-dimensional optimal path planning of the flying vehicle in terrain following/terrain avoidance maneuver is formulated as an optimal control problem. The terrain profile, as the main allowable height constraint has been modeled using Fractal Generation Method. The resulting optimal control problem is discretized by applying Direct Collocation numerical technique, and then transformed into a Nonlinear Programming Problem (NLP). The efficacy of the proposed method is demonstrated by extensive simulations, and in particular, it is verified that this approach could produce a solution satisfying almost all performance and environmental constraints encountering a low-level flying maneuver

Keywords: path planning, terrain following, optimal control, nonlinear programming

Procedia PDF Downloads 181