Search results for: buffer overflow problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 7545

Search results for: buffer overflow problem

6915 Solution of Logistics Center Selection Problem Using the Axiomatic Design Method

Authors: Fulya Zaralı, Harun Resit Yazgan

Abstract:

Logistics centers represent areas that all national and international logistics and activities related to logistics can be implemented by the various businesses. Logistics centers have a key importance in joining the transport stream and the transport system operations. Therefore, it is important where these centers are positioned to be effective and efficient and to show the expected performance of the centers. In this study, the location selection problem to position the logistics center is discussed. Alternative centers are evaluated according certain criteria. The most appropriate center is identified using the axiomatic design method.

Keywords: axiomatic design, logistic center, facility location, information systems

Procedia PDF Downloads 346
6914 Q-Efficient Solutions of Vector Optimization via Algebraic Concepts

Authors: Elham Kiyani

Abstract:

In this paper, we first introduce the concept of Q-efficient solutions in a real linear space not necessarily endowed with a topology, where Q is some nonempty (not necessarily convex) set. We also used the scalarization technique including the Gerstewitz function generated by a nonconvex set to characterize these Q-efficient solutions. The algebraic concepts of interior and closure are useful to study optimization problems without topology. Studying nonconvex vector optimization is valuable since topological interior is equal to algebraic interior for a convex cone. So, we use the algebraic concepts of interior and closure to define Q-weak efficient solutions and Q-Henig proper efficient solutions of set-valued optimization problems, where Q is not a convex cone. Optimization problems with set-valued maps have a wide range of applications, so it is expected that there will be a useful analytical tool in optimization theory for set-valued maps. These kind of optimization problems are closely related to stochastic programming, control theory, and economic theory. The paper focus on nonconvex problems, the results are obtained by assuming generalized non-convexity assumptions on the data of the problem. In convex problems, main mathematical tools are convex separation theorems, alternative theorems, and algebraic counterparts of some usual topological concepts, while in nonconvex problems, we need a nonconvex separation function. Thus, we consider the Gerstewitz function generated by a general set in a real linear space and re-examine its properties in the more general setting. A useful approach for solving a vector problem is to reduce it to a scalar problem. In general, scalarization means the replacement of a vector optimization problem by a suitable scalar problem which tends to be an optimization problem with a real valued objective function. The Gerstewitz function is well known and widely used in optimization as the basis of the scalarization. The essential properties of the Gerstewitz function, which are well known in the topological framework, are studied by using algebraic counterparts rather than the topological concepts of interior and closure. Therefore, properties of the Gerstewitz function, when it takes values just in a real linear space are studied, and we use it to characterize Q-efficient solutions of vector problems whose image space is not endowed with any particular topology. Therefore, we deal with a constrained vector optimization problem in a real linear space without assuming any topology, and also Q-weak efficient and Q-proper efficient solutions in the senses of Henig are defined. Moreover, by means of the Gerstewitz function, we provide some necessary and sufficient optimality conditions for set-valued vector optimization problems.

Keywords: algebraic interior, Gerstewitz function, vector closure, vector optimization

Procedia PDF Downloads 215
6913 Comparative Study of Propensity for Amyloidogenesis in Male and Female Mice

Authors: Keivan Jamshidi, Afshin Zahedi

Abstract:

Reactive amyloidosis is a condition that complicates a long list of chronic inflammation, chronic infectious, malignant, and hereditary disorders. In the present study the propensity for amyloidogenesis in male and female rats on spatio-temporal pattern was evaluated. For this purpose a total of 40 male and female Swiss mice, obtained from Pasteur Institute Tehran, after being weighted were randomly divided into 4 groups including 2 treatment groups [ 10 male (Group A1) and 10 female (Group B1) each], and 2 control groups [10 male (Group A2) and 10 female (Group B2) each]. At the end of 3rd, 5th and 7th weeks of experiment 3 mice were randomly selected and euthnised. Spleen samples of each animal were obtained and preserved in 10% neutral buffer formalin. Sample were then processed through different stages of dehydration, clearing and impregnation and finally embedded in paraffin blocks. Sections of 5µm thickness then cut and stained by alkaline Congo red techniques. The data obtained from polarized microscopic quantitative analysis did show significant differences between groups A1 and B1. A preferential expression of reactive amyloidosis is concluded in male, indicating sex differences in amyloidosis.

Keywords: amyloidosis, amyloidogenesis, mice, gender

Procedia PDF Downloads 593
6912 Parallel Version of Reinhard’s Color Transfer Algorithm

Authors: Abhishek Bhardwaj, Manish Kumar Bajpai

Abstract:

An image with its content and schema of colors presents an effective mode of information sharing and processing. By changing its color schema different visions and prospect are discovered by the users. This phenomenon of color transfer is being used by Social media and other channel of entertainment. Reinhard et al’s algorithm was the first one to solve this problem of color transfer. In this paper, we make this algorithm efficient by introducing domain parallelism among different processors. We also comment on the factors that affect the speedup of this problem. In the end by analyzing the experimental data we claim to propose a novel and efficient parallel Reinhard’s algorithm.

Keywords: Reinhard et al’s algorithm, color transferring, parallelism, speedup

Procedia PDF Downloads 611
6911 Trajectories of Conduct Problems and Cumulative Risk from Early Childhood to Adolescence

Authors: Leslie M. Gutman

Abstract:

Conduct problems (CP) represent a major dilemma, with wide-ranging and long-lasting individual and societal impacts. Children experience heterogeneous patterns of conduct problems; based on the age of onset, developmental course and related risk factors from around age 3. Early childhood represents a potential window for intervention efforts aimed at changing the trajectory of early starting conduct problems. Using the UK Millennium Cohort Study (n = 17,206 children), this study (a) identifies trajectories of conduct problems from ages 3 to 14 years and (b) assesses the cumulative and interactive effects of individual, family and socioeconomic risk factors from ages 9 months to 14 years. The same factors according to three domains were assessed, including child (i.e., low verbal ability, hyperactivity/inattention, peer problems, emotional problems), family (i.e., single families, parental poor physical and mental health, large family size) and socioeconomic (i.e., low family income, low parental education, unemployment, social housing). A cumulative risk score for the child, family, and socioeconomic domains at each age was calculated. It was then examined how the cumulative risk scores explain variation in the trajectories of conduct problems. Lastly, interactive effects among the different domains of cumulative risk were tested. Using group-based trajectory modeling, four distinct trajectories were found including a ‘low’ problem group and three groups showing childhood-onset conduct problems: ‘school-age onset’; ‘early-onset, desisting’; and ‘early-onset, persisting’. The ‘low’ group (57% of the sample) showed a low probability of conducts problems, close to zero, from 3 to 14 years. The ‘early-onset, desisting’ group (23% of the sample) demonstrated a moderate probability of CP in early childhood, with a decline from 3 to 5 years and a low probability thereafter. The ‘early-onset, persistent’ group (8%) followed a high probability of conduct problems, which declined from 11 years but was close to 70% at 14 years. In the ‘school-age onset’ group, 12% of the sample showed a moderate probability of conduct problems from 3 and 5 years, with a sharp increase by 7 years, increasing to 50% at 14 years. In terms of individual risk, all factors increased the likelihood of being in the childhood-onset groups compared to the ‘low’ group. For cumulative risk, the socioeconomic domain at 9 months and 3 years, the family domain at all ages except 14 years and child domain at all ages were found to differentiate childhood-onset groups from the ‘low’ group. Cumulative risk at 9 months and 3 years did not differentiate between the ‘school-onset’ group and ‘low’ group. Significant interactions were found between the domains for the ‘early-onset, desisting group’ suggesting that low levels of risk in one domain may buffer the effects of high risk in another domain. The implications of these findings for preventive interventions will be highlighted.

Keywords: conduct problems, cumulative risk, developmental trajectories, early childhood, adolescence

Procedia PDF Downloads 249
6910 The Relations between Language Diversity and Similarity and Adults' Collaborative Creative Problem Solving

Authors: Z. M. T. Lim, W. Q. Yow

Abstract:

Diversity in individual problem-solving approaches, culture and nationality have been shown to have positive effects on collaborative creative processes in organizational and scholastic settings. For example, diverse graduate and organizational teams consisting of members with both structured and unstructured problem-solving styles were found to have more creative ideas on a collaborative idea generation task than teams that comprised solely of members with either structured or unstructured problem-solving styles. However, being different may not always provide benefits to the collaborative creative process. In particular, speaking different languages may hinder mutual engagement through impaired communication and thus collaboration. Instead, sharing similar languages may have facilitative effects on mutual engagement in collaborative tasks. However, no studies have explored the relations between language diversity and adults’ collaborative creative problem solving. Sixty-four Singaporean English-speaking bilingual undergraduates were paired up into similar or dissimilar language pairs based on the second language they spoke (e.g., for similar language pairs, both participants spoke English-Mandarin; for dissimilar language pairs, one participant spoke English-Mandarin and the other spoke English-Korean). Each participant completed the Ravens Progressive Matrices Task individually. Next, they worked in pairs to complete a collaborative divergent thinking task where they used mind-mapping techniques to brainstorm ideas on a given problem together (e.g., how to keep insects out of the house). Lastly, the pairs worked on a collaborative insight problem-solving task (Triangle of Coins puzzle) where they needed to flip a triangle of ten coins around by moving only three coins. Pairs who had prior knowledge of the Triangle of Coins puzzle were asked to complete an equivalent Matchstick task instead, where they needed to make seven squares by moving only two matchsticks based on a given array of matchsticks. Results showed that, after controlling for intelligence, similar language pairs completed the collaborative insight problem-solving task faster than dissimilar language pairs. Intelligence also moderated these relations. Among adults of lower intelligence, similar language pairs solved the insight problem-solving task faster than dissimilar language pairs. These differences in speed were not found in adults with higher intelligence. No differences were found in the number of ideas generated in the collaborative divergent thinking task between similar language and dissimilar language pairs. In conclusion, sharing similar languages seem to enrich collaborative creative processes. These effects were especially pertinent to pairs with lower intelligence. This provides guidelines for the formation of groups based on shared languages in collaborative creative processes. However, the positive effects of shared languages appear to be limited to the insight problem-solving task and not the divergent thinking task. This could be due to the facilitative effects of other factors of diversity as found in previous literature. Background diversity, for example, may have a larger facilitative effect on the divergent thinking task as compared to the insight problem-solving task due to the varied experiences individuals bring to the task. In conclusion, this study contributes to the understanding of the effects of language diversity in collaborative creative processes and challenges the general positive effects that diversity has on these processes.

Keywords: bilingualism, diversity, creativity, collaboration

Procedia PDF Downloads 316
6909 A New Heuristic Algorithm for Maximization Total Demands of Nodes and Number of Covered Nodes Simultaneously

Authors: Ehsan Saghehei, Mahdi Eghbali

Abstract:

The maximal covering location problem (MCLP) was originally developed to determine a set of facility locations which would maximize the total customers' demand serviced by the facilities within a predetermined critical service criterion. However, on some problems that differences between the demand nodes are covered or the number of nodes each node is large, the method of solving MCLP may ignore these differences. In this paper, Heuristic solution based on the ranking of demands in each node and the number of nodes covered by each node according to a predetermined critical value is proposed. The output of this method is to maximize total demands of nodes and number of covered nodes, simultaneously. Furthermore, by providing an example, the solution algorithm is described and its results are compared with Greedy and Lagrange algorithms. Also, the results of the algorithm to solve the larger problem sizes that compared with other methods are provided. A summary and future works conclude the paper.

Keywords: heuristic solution, maximal covering location problem, ranking, set covering

Procedia PDF Downloads 572
6908 Variational Evolutionary Splines for Solving a Model of Temporomandibular Disorders

Authors: Alberto Hananel

Abstract:

The aim of this work is to modelize the occlusion of a person with temporomandibular disorders as an evolutionary equation and approach its solution by the construction and characterizing of discrete variational splines. To formulate the problem, certain boundary conditions have been considered. After showing the existence and the uniqueness of the solution of such a problem, a convergence result of a discrete variational evolutionary spline is shown. A stress analysis of the occlusion of a human jaw with temporomandibular disorders by finite elements is carried out in FreeFem++ in order to prove the validity of the presented method.

Keywords: approximation, evolutionary PDE, Finite Element Method, temporomandibular disorders, variational spline

Procedia PDF Downloads 377
6907 From Private Bodies to a Shareable Body Politic. A Theological Solution to a Foundational Political Problem.

Authors: Patrick Downey

Abstract:

The political problem besetting all nations, tribes, and families, as illuminated by Plato in the fifth book of his Republic, is the problem of our own private body with its own particular pleasures and pains. This problem we might label the “irrational love of one’s own.” The reasonable philosopher loves reality just because it is, but we love things only if we can convince ourselves that they are “ours” or an imaginative extension of “ours.” The resulting problem, that can only be medicated, but not cured, is that the “body private,” whether our own, our family, tribe, or nation, always lies underneath any level of “body politic” and threatens the bloodshed and disintegration of civil war. This is also the political problem the Bible deals with throughout, beginning with Adam and Eve’s fall from rationally shareable bodies (“the two were one flesh”) into unshareable bodies whose now shameful “privacy” must be hid behind a bloody rather than bloodless veil. The blood is the sign of always threatening civil war, whether murder between brothers, feuds within tribes, or later, war between nations. The scarlet thread of blood tying the entire Bible together, Old and New Testament, reminds us that however far our loves are pushed out beyond our private body to family, tribe or nation, they remain irrational because unshareable. Only by loving the creator God who first loved us, can we rationally love anything of our own, but it must be loved as gift rather than as a possession. Such a love renders all bodies and nations truly shareable, and achieving this shareability is the paradoxical plot of the Bible, wherein the Word becomes flesh in a particular body amidst a particular people and nation. Yet even with His own nation and His own Son, this Lord is not “partial” and demands justice towards widows, orphans, and sojourners, because the irrational love of only our own can become rational solely through the resurrection of this particular body, king of this particular nation and these particular people. His body, along with all other bodies, can thus now retain their particular wounds and history, while yet remaining shareable. Likewise, all nations will share in the nation of Israel, in the same way all distinct languages will share an understanding through the inner rational word that we see illustrated in Pentecost. Without the resurrection, however, this shareability of bodies and nations remains merely a useful fiction, as Plato saw, and the equally fictitious “rationality” of some sort of deductive universalism will not go away. Reading Scripture in terms of Plato’s “irrational love of one’s own” therefore raises questions for both a Protestant and Catholic understanding of nations, questions that neither can answer adequately without this philosophical and exegetical attention.

Keywords: body private, nations, shareability, body politic

Procedia PDF Downloads 88
6906 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 393
6905 Intrusion Detection System Using Linear Discriminant Analysis

Authors: Zyad Elkhadir, Khalid Chougdali, Mohammed Benattou

Abstract:

Most of the existing intrusion detection systems works on quantitative network traffic data with many irrelevant and redundant features, which makes detection process more time’s consuming and inaccurate. A several feature extraction methods, such as linear discriminant analysis (LDA), have been proposed. However, LDA suffers from the small sample size (SSS) problem which occurs when the number of the training samples is small compared with the samples dimension. Hence, classical LDA cannot be applied directly for high dimensional data such as network traffic data. In this paper, we propose two solutions to solve SSS problem for LDA and apply them to a network IDS. The first method, reduce the original dimension data using principal component analysis (PCA) and then apply LDA. In the second solution, we propose to use the pseudo inverse to avoid singularity of within-class scatter matrix due to SSS problem. After that, the KNN algorithm is used for classification process. We have chosen two known datasets KDDcup99 and NSLKDD for testing the proposed approaches. Results showed that the classification accuracy of (PCA+LDA) method outperforms clearly the pseudo inverse LDA method when we have large training data.

Keywords: LDA, Pseudoinverse, PCA, IDS, NSL-KDD, KDDcup99

Procedia PDF Downloads 225
6904 D6tions: A Serious Game to Learn Software Engineering Process and Design

Authors: Hector G. Perez-Gonzalez, Miriam Vazquez-Escalante, Sandra E. Nava-Muñoz, 
 Francisco E. Martinez-Perez, Alberto S. Nunez-Varela

Abstract:

The software engineering teaching process has been the subject of many studies. To improve this process, researchers have proposed merely illustrative techniques in the classroom, such as topic presentations and dynamics between students on one side or attempts to involve students in real projects with companies and institutions to bring them to a real software development problem on the other hand. Simulators and serious games have been used as auxiliary tools to introduce students to topics that are too abstract when these are presented in the traditional way. Most of these tools cover a limited area of the huge software engineering scope. To address this problem, we have developed D6tions, an educational serious game that simulates the software engineering process and is designed to experiment the different stages a software engineer (playing roles as project leader or as a developer or designer) goes through, while participating in a software project. We describe previous approaches to this problem, how D6tions was designed, its rules, directions, and the results we obtained of the use of this game involving undergraduate students playing the game.

Keywords: serious games, software engineering, software engineering education, software engineering teaching process

Procedia PDF Downloads 492
6903 Effect of the Fluid Temperature on the Crude Oil Fouling in the Heat Exchangers of Algiers Refinery

Authors: Rima Harche, Abdelkader Mouheb

Abstract:

The Algiers refinery as all the other refineries always suffers from the problem of stopping of the tubes of heat exchanger. For that a study experimental of this phenomenon was undertaken in site on the cell of heat exchangers E101 (E101 CBA and E101 EDF) intended for the heating of the crude before its fractionation, which are exposed to the problem of the fouling on the side tubes exchangers. It is of tube-calenders type with head floating. Each cell is made up of three heat exchangers, laid out in series.

Keywords: fouling, fluid temperatue , oil, tubular heat exchanger, fouling resistance, modeling, heat transfer coefficient

Procedia PDF Downloads 430
6902 Comparisons between Student Leaning Achievements and Their Problem Solving Skills on Stoichiometry Issue with the Think-Pair-Share Model and Stem Education Method

Authors: P. Thachitasing, N. Jansawang, W. Rakrai, T. Santiboon

Abstract:

The aim of this study is to investigate of the comparing the instructional design models between the Think-Pair-Share and Conventional Learning (5E Inquiry Model) Processes to enhance students’ learning achievements and their problem solving skills on stoichiometry issue for concerning the 2-instructional method with a sample consisted of 80 students in 2 classes at the 11th grade level in Chaturaphak Phiman Ratchadaphisek School. Students’ different learning outcomes in chemistry classes with the cluster random sampling technique were used. Instructional Methods designed with the 40-experimenl student group by Think-Pair-Share process and the 40-controlling student group by the conventional learning (5E Inquiry Model) method. These learning different groups were obtained using the 5 instruments; the 5-lesson instructional plans of Think-Pair-Share and STEM Education Method, students’ learning achievements and their problem solving skills were assessed with the pretest and posttest techniques, students’ outcomes of their instructional the Think-Pair-Share (TPSM) and the STEM Education Methods were compared. Statistically significant was differences with the paired t-test and F-test between posttest and pretest technique of the whole students in chemistry classes were found, significantly. Associations between student learning outcomes in chemistry and two methods of their learning to students’ learning achievements and their problem solving skills also were found. The use of two methods for this study is revealed that the students perceive their learning achievements to their problem solving skills to be differently learning achievements in different groups are guiding practical improvements in chemistry classrooms to assist teacher in implementing effective approaches for improving instructional methods. Students’ learning achievements of mean average scores to their controlling group with the Think-Pair-Share Model (TPSM) are lower than experimental student group for the STEM education method, evidence significantly. The E1/E2 process were revealed evidence of 82.56/80.44, and 83.02/81.65 which results based on criteria are higher than of 80/80 standard level with the IOC, consequently. The predictive efficiency (R2) values indicate that 61% and 67% and indicate that 63% and 67% of the variances in chemistry classes to their learning achievements on posttest in chemistry classes of the variances in students’ problem solving skills to their learning achievements to their chemistry classrooms on Stoichiometry issue with the posttest were attributable to their different learning outcomes for the TPSM and STEMe instructional methods.

Keywords: comparisons, students’ learning achievements, think-pare-share model (TPSM), stem education, problem solving skills, chemistry classes, stoichiometry issue

Procedia PDF Downloads 248
6901 Modified Bat Algorithm for Economic Load Dispatch Problem

Authors: Daljinder Singh, J.S.Dhillon, Balraj Singh

Abstract:

According to no free lunch theorem, a single search technique cannot perform best in all conditions. Optimization method can be attractive choice to solve optimization problem that may have exclusive advantages like robust and reliable performance, global search capability, little information requirement, ease of implementation, parallelism, no requirement of differentiable and continuous objective function. In order to synergize between exploration and exploitation and to further enhance the performance of Bat algorithm, the paper proposed a modified bat algorithm that adds additional search procedure based on bat’s previous experience. The proposed algorithm is used for solving the economic load dispatch (ELD) problem. The practical constraint such valve-point loading along with power balance constraints and generator limit are undertaken. To take care of power demand constraint variable elimination method is exploited. The proposed algorithm is tested on various ELD problems. The results obtained show that the proposed algorithm is capable of performing better in majority of ELD problems considered and is at par with existing algorithms for some of problems.

Keywords: bat algorithm, economic load dispatch, penalty method, variable elimination method

Procedia PDF Downloads 457
6900 Voltage Problem Location Classification Using Performance of Least Squares Support Vector Machine LS-SVM and Learning Vector Quantization LVQ

Authors: M. Khaled Abduesslam, Mohammed Ali, Basher H. Alsdai, Muhammad Nizam Inayati

Abstract:

This paper presents the voltage problem location classification using performance of Least Squares Support Vector Machine (LS-SVM) and Learning Vector Quantization (LVQ) in electrical power system for proper voltage problem location implemented by IEEE 39 bus New-England. The data was collected from the time domain simulation by using Power System Analysis Toolbox (PSAT). Outputs from simulation data such as voltage, phase angle, real power and reactive power were taken as input to estimate voltage stability at particular buses based on Power Transfer Stability Index (PTSI).The simulation data was carried out on the IEEE 39 bus test system by considering load bus increased on the system. To verify of the proposed LS-SVM its performance was compared to Learning Vector Quantization (LVQ). The results showed that LS-SVM is faster and better as compared to LVQ. The results also demonstrated that the LS-SVM was estimated by 0% misclassification whereas LVQ had 7.69% misclassification.

Keywords: IEEE 39 bus, least squares support vector machine, learning vector quantization, voltage collapse

Procedia PDF Downloads 439
6899 Review on Effective Texture Classification Techniques

Authors: Sujata S. Kulkarni

Abstract:

Effective and efficient texture feature extraction and classification is an important problem in image understanding and recognition. This paper gives a review on effective texture classification method. The objective of the problem of texture representation is to reduce the amount of raw data presented by the image, while preserving the information needed for the task. Texture analysis is important in many applications of computer image analysis for classification include industrial and biomedical surface inspection, for example for defects and disease, ground classification of satellite or aerial imagery and content-based access to image databases.

Keywords: compressed sensing, feature extraction, image classification, texture analysis

Procedia PDF Downloads 432
6898 Frequency Identification of Wiener-Hammerstein Systems

Authors: Brouri Adil, Giri Fouad

Abstract:

The problem of identifying Wiener-Hammerstein systems is addressed in the presence of two linear subsystems of structure totally unknown. Presently, the nonlinear element is allowed to be noninvertible. The system identification problem is dealt by developing a two-stage frequency identification method such a set of points of the nonlinearity are estimated first. Then, the frequency gains of the two linear subsystems are determined at a number of frequencies. The method involves Fourier series decomposition and only requires periodic excitation signals. All involved estimators are shown to be consistent.

Keywords: Wiener-Hammerstein systems, Fourier series expansions, frequency identification, automation science

Procedia PDF Downloads 534
6897 Multi-Fidelity Fluid-Structure Interaction Analysis of a Membrane Wing

Authors: M. Saeedi, R. Wuchner, K.-U. Bletzinger

Abstract:

In order to study the aerodynamic performance of a semi-flexible membrane wing, Fluid-Structure Interaction simulations have been performed. The fluid problem has been modeled using two different approaches which are the numerical solution of the Navier-Stokes equations and the vortex panel method. Nonlinear analysis of the structural problem is performed using the Finite Element Method. Comparison between the two fluid solvers has been made. Aerodynamic performance of the wing is discussed regarding its lift and drag coefficients and they are compared with those of the equivalent rigid wing.

Keywords: CFD, FSI, Membrane wing, Vortex panel method

Procedia PDF Downloads 484
6896 Numerical Simulation of Aeroelastic Influence Exerted by Kinematic and Geometrical Parameters on Oscillations' Frequencies and Phase Shift Angles in a Simulated Compressor of Gas Transmittal Unit

Authors: Liliia N. Butymova, Vladimir Y. Modorsky, Nikolai A. Shevelev

Abstract:

Prediction of vibration processes in gas transmittal units (GTU) is an urgent problem. Despite numerous scientific publications on the problem of vibrations in general, there are not enough works concerning FSI-modeling interaction processes between several deformable blades in gas-dynamic flow. Since it is very difficult to solve the problem in full scope, with all factors considered, a unidirectional dynamic coupled 1FSI model is suggested for use at the first stage, which would include, from symmetry considerations, two blades, which might be considered as the first stage of solving more general bidirectional problem. ANSYS CFX programmed multi-processor was chosen as a numerical computation tool. The problem was solved on PNRPU high-capacity computer complex. At the first stage of the study, blades were believed oscillating with the same frequency, although oscillation phases could be equal and could be different. At that non-stationary gas-dynamic forces distribution over the blades surfaces is calculated in run of simulation experiment. Oscillations in the “gas — structure” dynamic system are assumed to increase if the resultant of these gas-dynamic forces is in-phase with blade oscillation, and phase shift (φ=0). Provided these oscillation occur with phase shift, then oscillations might increase or decrease, depending on the phase shift value. The most important results are as follows: the angle of phase shift in inter-blade oscillation and the gas-dynamic force depends on the flow velocity, the specific inter-blade gap, and the shaft rotation speed; a phase shift in oscillation of adjacent blades does not always correspond to phase shift of gas-dynamic forces affecting the blades. Thus, it was discovered, that asynchronous oscillation of blades might cause either attenuation or intensification of oscillation. It was revealed that clocking effect might depend not only on the mutual circumferential displacement of blade rows and the gap between the blades, but also on the blade dynamic deformation nature.

Keywords: aeroelasticity, ANSYS CFX, oscillation, phase shift, clocking effect, vibrations

Procedia PDF Downloads 266
6895 An Abbattoir-Based Study on Relative Prevalence of Histopathologic Patterns of Hepatic Lesions in One-Humped Camels (Camelus deromedarius), Semnan, Iran

Authors: Keivan Jamshidi, Afshin Zahedi

Abstract:

An abattoir based study was carried out during spring 2011 to investigate pathological conditions of the liver in camels (Camelus deromedarius) slaughtered in the Semnan slaughter house, Northern East of Iran. In this study, 40 carcasses out of 150 randomly selected carcasses inspected at postmortem, found with liver lesions. Proper tissue samples obtained from the livers with macroscopic lesions, fixed in 10% neutral buffer formaldehyde, processed for routine histopathological techniques, and finally embedded in paraffin blocks. Sections of 5µm thickness then cut and stained by H&E staining techniques. In histopathological examination of hepatic tissues, following changes were observed: Hydatid cysts; 65%, Cirrhosis; 10%, Hepatic lipidosis (Mild to Severe fatty changes); 12.5%, Glycogen deposition; 2.5%, Cholangitis; 2.8%, Cholangiohepatitis; 5%, Calcified hydatid cyst; 2.5%, Hepatic abscess; 2.5%, lipofuscin pigments; 17.5%. It is concluded that the highest and lowest prevalent patterns of hepatic lesions were hydatid cysts and Hepatic abscess respectively.

Keywords: camel, liver, lesion, pathology, slaughterhouse

Procedia PDF Downloads 477
6894 A Model for Helicopter Routing Problem

Authors: Aydin Sipahioglu, Gokhan Celik

Abstract:

Helicopter routing problem (HRP) is finding good tours for helicopter so as to pick up and deliver personnel or material among specified nodes, mutually. It can be encountered in case of being lots of supply and demand points for different commodities and requiring delivering commodities with helicopter. For instance, to deliver personnel or material from shore to oil rig is a good example. In fact, HRP is a branch of vehicle routing problem with pickup and delivery (VRPPD). However, it has additional constraints such that fuel capacity, performance of helicopter in different altitude and temperature, and the number of maximum takeoff and landing allowed. This kind of pickup and delivery problems can be classified into 3 groups, basically. 1-1 (one to one), M-M (many to many) and 1-M-1 (one to many to one). 1-1 means each commodity has only one supply and one demand point. M-M means there can be more than one supply and demand points for each kind of commodity. 1-M-1 means commodities at depot are delivered to demand points and commodities at customers are delivered to depot. In this case helicopter takes off from its own base, complete its tour and return to its own base. In this study, we define 1-M-M-1 type HRP. That means helicopter takes off from its home base, deliver commodities among the nodes as well as between depot and customers and return to its home base. These problems have NP-hard nature. Therefore, obtaining a good solution in a reasonable time is not easy. In this study, a model is offered for 1-M-M-1 type HRP. It is shown on small scale test instances that the model can find the optimal solution.

Keywords: helicopter routing problem, vehicle routing with pickup and delivery, integer programming

Procedia PDF Downloads 429
6893 Faithful Extension of Constant Height and Constant Width between Finite Posets

Authors: Walied Hazim Sharif

Abstract:

The problem of faithful extension with the condition of keeping constant height h and constant width w, i.e. for hw-inextensibility, seems more interesting than the brute extension of finite poset (partially ordered set). We shall investigate some theorems of hw-inextensive and hw-extensive posets that can be used to formulate the faithful extension problem. A theorem in its general form of hw-inextensive posets are given to implement the presented theorems.

Keywords: faithful extension, poset, extension, inextension, height, width, hw-extensive, hw-inextensive

Procedia PDF Downloads 258
6892 The Development of Private Housing Schemes to Address the Housing Problem: A Case Study of Islamabad

Authors: Zafar Iqbal Zafar, Abdul Waheed

Abstract:

The Capital Development Authority (CDA) Ordinance 1960 requires CDA to acquire land for the provision of housing in Islamabad. However, the pace of residential development was slow and the demand for housing was increasing rapidly. To resolve the growing housing problem, CDA involved the private sector in the development of housing schemes. Detailed bye-laws for regulation of private housing schemes were prepared and these bylaws were called “Modalities & Procedures”. This paper explains how the Modalities and Procedures of CDA have been successful in regulating the development of private housing schemes in Islamabad.

Keywords: housing schemes, master plan, development works, zoning regulations

Procedia PDF Downloads 199
6891 An Adiabatic Quantum Optimization Approach for the Mixed Integer Nonlinear Programming Problem

Authors: Maxwell Henderson, Tristan Cook, Justin Chan Jin Le, Mark Hodson, YoungJung Chang, John Novak, Daniel Padilha, Nishan Kulatilaka, Ansu Bagchi, Sanjoy Ray, John Kelly

Abstract:

We present a method of using adiabatic quantum optimization (AQO) to solve a mixed integer nonlinear programming (MINLP) problem instance. The MINLP problem is a general form of a set of NP-hard optimization problems that are critical to many business applications. It requires optimizing a set of discrete and continuous variables with nonlinear and potentially nonconvex constraints. Obtaining an exact, optimal solution for MINLP problem instances of non-trivial size using classical computation methods is currently intractable. Current leading algorithms leverage heuristic and divide-and-conquer methods to determine approximate solutions. Creating more accurate and efficient algorithms is an active area of research. Quantum computing (QC) has several theoretical benefits compared to classical computing, through which QC algorithms could obtain MINLP solutions that are superior to current algorithms. AQO is a particular form of QC that could offer more near-term benefits compared to other forms of QC, as hardware development is in a more mature state and devices are currently commercially available from D-Wave Systems Inc. It is also designed for optimization problems: it uses an effect called quantum tunneling to explore all lowest points of an energy landscape where classical approaches could become stuck in local minima. Our work used a novel algorithm formulated for AQO to solve a special type of MINLP problem. The research focused on determining: 1) if the problem is possible to solve using AQO, 2) if it can be solved by current hardware, 3) what the currently achievable performance is, 4) what the performance will be on projected future hardware, and 5) when AQO is likely to provide a benefit over classical computing methods. Two different methods, integer range and 1-hot encoding, were investigated for transforming the MINLP problem instance constraints into a mathematical structure that can be embedded directly onto the current D-Wave architecture. For testing and validation a D-Wave 2X device was used, as well as QxBranch’s QxLib software library, which includes a QC simulator based on simulated annealing. Our results indicate that it is mathematically possible to formulate the MINLP problem for AQO, but that currently available hardware is unable to solve problems of useful size. Classical general-purpose simulated annealing is currently able to solve larger problem sizes, but does not scale well and such methods would likely be outperformed in the future by improved AQO hardware with higher qubit connectivity and lower temperatures. If larger AQO devices are able to show improvements that trend in this direction, commercially viable solutions to the MINLP for particular applications could be implemented on hardware projected to be available in 5-10 years. Continued investigation into optimal AQO hardware architectures and novel methods for embedding MINLP problem constraints on to those architectures is needed to realize those commercial benefits.

Keywords: adiabatic quantum optimization, mixed integer nonlinear programming, quantum computing, NP-hard

Procedia PDF Downloads 524
6890 Multi-Objective Four-Dimensional Traveling Salesman Problem in an IoT-Based Transport System

Authors: Arindam Roy, Madhushree Das, Apurba Manna, Samir Maity

Abstract:

In this research paper, an algorithmic approach is developed to solve a novel multi-objective four-dimensional traveling salesman problem (MO4DTSP) where different paths with various numbers of conveyances are available to travel between two cities. NSGA-II and Decomposition algorithms are modified to solve MO4DTSP in an IoT-based transport system. This IoT-based transport system can be widely observed, analyzed, and controlled by an extensive distribution of traffic networks consisting of various types of sensors and actuators. Due to urbanization, most of the cities are connected using an intelligent traffic management system. Practically, for a traveler, multiple routes and vehicles are available to travel between any two cities. Thus, the classical TSP is reformulated as multi-route and multi-vehicle i.e., 4DTSP. The proposed MO4DTSP is designed with traveling cost, time, and customer satisfaction as objectives. In reality, customer satisfaction is an important parameter that depends on travel costs and time reflects in the present model.

Keywords: multi-objective four-dimensional traveling salesman problem (MO4DTSP), decomposition, NSGA-II, IoT-based transport system, customer satisfaction

Procedia PDF Downloads 109
6889 A Fuzzy Multiobjective Model for Bed Allocation Optimized by Artificial Bee Colony Algorithm

Authors: Jalal Abdulkareem Sultan, Abdulhakeem Luqman Hasan

Abstract:

With the development of health care systems competition, hospitals face more and more pressures. Meanwhile, resource allocation has a vital effect on achieving competitive advantages in hospitals. Selecting the appropriate number of beds is one of the most important sections in hospital management. However, in real situation, bed allocation selection is a multiple objective problem about different items with vagueness and randomness of the data. It is very complex. Hence, research about bed allocation problem is relatively scarce under considering multiple departments, nursing hours, and stochastic information about arrival and service of patients. In this paper, we develop a fuzzy multiobjective bed allocation model for overcoming uncertainty and multiple departments. Fuzzy objectives and weights are simultaneously applied to help the managers to select the suitable beds about different departments. The proposed model is solved by using Artificial Bee Colony (ABC), which is a very effective algorithm. The paper describes an application of the model, dealing with a public hospital in Iraq. The results related that fuzzy multi-objective model was presented suitable framework for bed allocation and optimum use.

Keywords: bed allocation problem, fuzzy logic, artificial bee colony, multi-objective optimization

Procedia PDF Downloads 324
6888 Electrochemiluminescent Detection of DNA Damage Induced by Tetrachloro-1,4- Benzoquinone Using DNA Sensor

Authors: Tian-Fang Kang, Xue Sun

Abstract:

DNA damage induced by tetrachloro-1,4-benzoquinone (TCBQ), a reactive metabolite of pentachloro-phenol (PCP), was investigated using a glassy carbon electrode (GCE) modified with calf thymus double-stranded DNA (ds-DNA) in this work. DNA modified films were constructed by layer-by-layer adsorption of polycationic poly(diallyldimethyl- ammonium chloride) (PDDA) and negatively charged ds-DNA on the surface of a glassy carbon electrode. The DNA intercalator [Ru(bpy)2(dppz)]2+ (bpy=2, 2′-bipyridine, dppz0dipyrido [3, 2-a: 2′,3′-c] phenazine) was chosen as an electrochemical probe to detect DNA damage. After the sensor was incubated in 0.1 M pH 7.3 phosphate buffer solution (PBS) for 30min, the intact PDDA/DNA film produced a sensitive electrochemiluminescent (ECL) signal. However, after the sensor was incubated in 100 μM TCBQ or a mixed solution of 100 μM TCBQ and 2 mM H2O2, ECL signal decreased significantly. During the incubation of DNA in TCBQ or TCBQ-H2O2 solution, the double-helix of DNA was damaged, which resulted in the decrease of Ru-dppz bound to DNA. Additionally, the results were verified independently by fluorescence experiments. This paper provides a sensitive method to directly screen DNA damage induced by chemicals in the environment.

Keywords: DNA damage, detection, electrochemiluminescence, sensor

Procedia PDF Downloads 408
6887 A Mean–Variance–Skewness Portfolio Optimization Model

Authors: Kostas Metaxiotis

Abstract:

Portfolio optimization is one of the most important topics in finance. This paper proposes a mean–variance–skewness (MVS) portfolio optimization model. Traditionally, the portfolio optimization problem is solved by using the mean–variance (MV) framework. In this study, we formulate the proposed model as a three-objective optimization problem, where the portfolio's expected return and skewness are maximized whereas the portfolio risk is minimized. For solving the proposed three-objective portfolio optimization model we apply an adapted version of the non-dominated sorting genetic algorithm (NSGAII). Finally, we use a real dataset from FTSE-100 for validating the proposed model.

Keywords: evolutionary algorithms, portfolio optimization, skewness, stock selection

Procedia PDF Downloads 196
6886 Linear Stability of Convection in an Inclined Channel with Nanofluid Saturated Porous Medium

Authors: D. Srinivasacharya, Nidhi Humnekar

Abstract:

The goal of this research is to numerically investigate the convection of nanofluid flow in an inclined porous channel. Brownian motion and thermophoresis effects are accounted for by nanofluid. In addition, the flow in the porous region governs Brinkman’s equation. The perturbed state of the generalized eigenvalue problem is obtained using normal mode analysis, and Chebyshev spectral collocation was used to solve this problem. For various values of the governing parameters, the critical wavenumber and critical Rayleigh number are calculated, and preferred modes are identified.

Keywords: Brinkman model, inclined channel, nanofluid, linear stability, porous media

Procedia PDF Downloads 108