Search results for: almost periodic solution
2545 Solution of Nonlinear Second-Order Pantograph Equations via Differential Transformation Method
Authors: Nemat Abazari, Reza Abazari
Abstract:
In this work, we successfully extended one-dimensional differential transform method (DTM), by presenting and proving some theorems, to solving nonlinear high-order multi-pantograph equations. This technique provides a sequence of functions which converges to the exact solution of the problem. Some examples are given to demonstrate the validity and applicability of the present method and a comparison is made with existing results.
Keywords: Nonlinear multi-pantograph equation, delay differential equation, differential transformation method, proportional delay conditions, closed form solution.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 25602544 Cross-Industry Innovations–Systematic Identification of Ideas for Radical Problem Solving
Authors: Niklas Echterhoff, Benjamin Amshoff, Jürgen Gausemeier
Abstract:
Creativity is often based on an unorthodox recombination of knowledge; in fact: 80% of all innovations use given knowledge and put it into a new combination. Cross-industry innovations follow this way of thinking and bring together problems and solution ideas from different industries. Therefore analogies and search strategies have to be developed. Taking this path, the questions where to search, what to search and how to search have to be answered. Afterwards, the gathered information can be used within a planned search process. Identified solution ideas have to be assessed and analyzed in detail for the success promising adaption planning.Keywords: analogy building, cross-industry innovations, knowledge transfer, solution adaption.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20592543 Evolutionary Computing Approach for the Solution of Initial value Problems in Ordinary Differential Equations
Authors: A. Junaid, M. A. Z. Raja, I. M. Qureshi
Abstract:
An evolutionary computing technique for solving initial value problems in Ordinary Differential Equations is proposed in this paper. Neural network is used as a universal approximator while the adaptive parameters of neural networks are optimized by genetic algorithm. The solution is achieved on the continuous grid of time instead of discrete as in other numerical techniques. The comparison is carried out with classical numerical techniques and the solution is found with a uniform accuracy of MSE ≈ 10-9 .
Keywords: Neural networks, Unsupervised learning, Evolutionary computing, Numerical methods, Fitness evaluation function.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17822542 Deterministic Method to Assess Kalman Filter Passive Ranging Solution Reliability
Authors: Ronald M. Yannone
Abstract:
For decades, the defense business has been plagued by not having a reliable, deterministic method to know when the Kalman filter solution for passive ranging application is reliable for use by the fighter pilot. This has made it hard to accurately assess when the ranging solution can be used for situation awareness and weapons use. To date, we have used ad hoc rules-of-thumb to assess when we think the estimate of the Kalman filter standard deviation on range is reliable. A reliable algorithm has been developed at BAE Systems Electronics & Integrated Solutions that monitors the Kalman gain matrix elements – and a patent is pending. The “settling" of the gain matrix elements relates directly to when we can assess the time when the passive ranging solution is within the 10 percent-of-truth value. The focus of the paper is on surface-based passive ranging – but the method is applicable to airborne targets as well.Keywords: Electronic warfare, extended Kalman filter (EKF), fighter aircraft, passive ranging, track convergence.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20652541 Constant Order Predictor Corrector Method for the Solution of Modeled Problems of First Order IVPs of ODEs
Authors: A. A. James, A. O. Adesanya, M. R. Odekunle, D. G. Yakubu
Abstract:
This paper examines the development of one step, five hybrid point method for the solution of first order initial value problems. We adopted the method of collocation and interpolation of power series approximate solution to generate a continuous linear multistep method. The continuous linear multistep method was evaluated at selected grid points to give the discrete linear multistep method. The method was implemented using a constant order predictor of order seven over an overlapping interval. The basic properties of the derived corrector was investigated and found to be zero stable, consistent and convergent. The region of absolute stability was also investigated. The method was tested on some numerical experiments and found to compete favorably with the existing methods.
Keywords: Interpolation, Approximate Solution, Collocation, Differential system, Half step, Converges, Block method, Efficiency.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 23362540 Making Data Structures and Algorithms more Understandable by Programming Sudoku the Human Way
Authors: Roelien Goede
Abstract:
Data Structures and Algorithms is a module in most Computer Science or Information Technology curricula. It is one of the modules most students identify as being difficult. This paper demonstrates how programming a solution for Sudoku can make abstract concepts more concrete. The paper relates concepts of a typical Data Structures and Algorithms module to a step by step solution for Sudoku in a human type as opposed to a computer oriented solution.Keywords: Data Structures, Algorithms, Sudoku, ObjectOriented Programming, Programming Teaching, Education.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 30972539 Optimal Solution of Constraint Satisfaction Problems
Authors: Jeffrey L. Duffany
Abstract:
An optimal solution for a large number of constraint satisfaction problems can be found using the technique of substitution and elimination of variables analogous to the technique that is used to solve systems of equations. A decision function f(A)=max(A2) is used to determine which variables to eliminate. The algorithm can be expressed in six lines and is remarkable in both its simplicity and its ability to find an optimal solution. However it is inefficient in that it needs to square the updated A matrix after each variable elimination. To overcome this inefficiency the algorithm is analyzed and it is shown that the A matrix only needs to be squared once at the first step of the algorithm and then incrementally updated for subsequent steps, resulting in significant improvement and an algorithm complexity of O(n3).Keywords: Algorithm, complexity, constraint, np-complete.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14222538 Hydrodynamic Analysis of Reservoir Due to Vertical Component of Earthquake Using an Analytical Solution
Authors: M. Pasbani Khiavi, M. A. Ghorbani
Abstract:
This paper presents an analytical solution to get a reliable estimation of the hydrodynamic pressure on gravity dams induced by vertical component earthquake when solving the fluid and dam interaction problem. Presented analytical technique is presented for calculation of earthquake-induced hydrodynamic pressure in the reservoir of gravity dams allowing for water compressibility and wave absorption at the reservoir bottom. This new analytical solution can take into account the effect of bottom material on seismic response of gravity dams. It is concluded that because the vertical component of ground motion causes significant hydrodynamic forces in the horizontal direction on a vertical upstream face, responses to the vertical component of ground motion are of special importance in analysis of concrete gravity dams subjected to earthquakes.
Keywords: Dam, Reservoir, Analytical solution, Vertical component, Earthquake
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17502537 Preparation of Metallic Copper Nanoparticles by Reduction of Copper Ions in Aqueous Solution and Their Metal-Metal Bonding Properties
Authors: Y. Kobayashi, T. Shirochi, Y. Yasuda, T. Morita
Abstract:
This paper describes a method for preparing metallic Cu nanoparticles in aqueous solution, and a metal-metal bonding technique using the Cu particles.Preparation of the Cu particle colloid solution was performed in water at room temperature in air using a copper source (0.01 M Cu(NO3)2), a reducing reagent (0.2 - 1.0 M hydrazine), and stabilizers (0.5×10-3 M citric acid and 5.0×10-3 M cetyltrimethylammonium bromide). The metallic Cu nanoparticles with sizes of ca. 60nm were prepared at all the hydrazine concentrations examined. A stage and a plate of metallic Cu were successfully bonded under annealing at 400oC and pressurizing at 1.2 MPa for 5min in H2 gas with help of the metallic Cu particles. A shear strength required for separating the bonded Cu substrates reached the maximum value at a hydrazine concentration of 0.8M, and it decreased beyond the concentration. Consequently, the largest shear strength of 22.9 MPa was achieved at the 0.8 M hydrazine concentration.
Keywords: Aqueous solution, Bonding, Colloid, Copper, Nanoparticle.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 56582536 PoPCoRN: A Power-Aware Periodic Surveillance Scheme in Convex Region using Wireless Mobile Sensor Networks
Authors: A. K. Prajapati
Abstract:
In this paper, the periodic surveillance scheme has been proposed for any convex region using mobile wireless sensor nodes. A sensor network typically consists of fixed number of sensor nodes which report the measurements of sensed data such as temperature, pressure, humidity, etc., of its immediate proximity (the area within its sensing range). For the purpose of sensing an area of interest, there are adequate number of fixed sensor nodes required to cover the entire region of interest. It implies that the number of fixed sensor nodes required to cover a given area will depend on the sensing range of the sensor as well as deployment strategies employed. It is assumed that the sensors to be mobile within the region of surveillance, can be mounted on moving bodies like robots or vehicle. Therefore, in our scheme, the surveillance time period determines the number of sensor nodes required to be deployed in the region of interest. The proposed scheme comprises of three algorithms namely: Hexagonalization, Clustering, and Scheduling, The first algorithm partitions the coverage area into fixed sized hexagons that approximate the sensing range (cell) of individual sensor node. The clustering algorithm groups the cells into clusters, each of which will be covered by a single sensor node. The later determines a schedule for each sensor to serve its respective cluster. Each sensor node traverses all the cells belonging to the cluster assigned to it by oscillating between the first and the last cell for the duration of its life time. Simulation results show that our scheme provides full coverage within a given period of time using few sensors with minimum movement, less power consumption, and relatively less infrastructure cost.Keywords: Sensor Network, Graph Theory, MSN, Communication.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14642535 Unique Positive Solution of Nonlinear Fractional Differential Equation Boundary Value Problem
Authors: Fengxia Zheng
Abstract:
By using two new fixed point theorems for mixed monotone operators, the positive solution of nonlinear fractional differential equation boundary value problem is studied. Its existence and uniqueness is proved, and an iterative scheme is constructed to approximate it.
Keywords: Fractional differential equation, boundary value problem, positive solution, existence and uniqueness, fixed point theorem, mixed monotone operator.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16022534 Soft Real-Time Fuzzy Task Scheduling for Multiprocessor Systems
Authors: Mahdi Hamzeh, Sied Mehdi Fakhraie, Caro Lucas
Abstract:
All practical real-time scheduling algorithms in multiprocessor systems present a trade-off between their computational complexity and performance. In real-time systems, tasks have to be performed correctly and timely. Finding minimal schedule in multiprocessor systems with real-time constraints is shown to be NP-hard. Although some optimal algorithms have been employed in uni-processor systems, they fail when they are applied in multiprocessor systems. The practical scheduling algorithms in real-time systems have not deterministic response time. Deterministic timing behavior is an important parameter for system robustness analysis. The intrinsic uncertainty in dynamic real-time systems increases the difficulties of scheduling problem. To alleviate these difficulties, we have proposed a fuzzy scheduling approach to arrange real-time periodic and non-periodic tasks in multiprocessor systems. Static and dynamic optimal scheduling algorithms fail with non-critical overload. In contrast, our approach balances task loads of the processors successfully while consider starvation prevention and fairness which cause higher priority tasks have higher running probability. A simulation is conducted to evaluate the performance of the proposed approach. Experimental results have shown that the proposed fuzzy scheduler creates feasible schedules for homogeneous and heterogeneous tasks. It also and considers tasks priorities which cause higher system utilization and lowers deadline miss time. According to the results, it performs very close to optimal schedule of uni-processor systems.Keywords: Computational complexity, Deadline, Feasible scheduling, Fuzzy scheduling, Priority, Real-time multiprocessor systems, Robustness, System utilization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21292533 Performance Analysis of Heat Pipe Using Copper Nanofluid with Aqueous Solution of n-Butanol
Authors: Senthilkumar R, Vaidyanathan S, Sivaraman B
Abstract:
This study presents the improvement of thermal performance of heat pipe using copper nanofluid with aqueous solution of n-Butanol. The nanofluids kept in the suspension of conventional fluids have the potential of superior heat transfer capability than the conventional fluids due to their improved thermal conductivity. In this work, the copper nanofluid which has a 40 nm size with a concentration of 100 mg/lit is kept in the suspension of the de-ionized (DI) water and an aqueous solution of n-Butanol and these fluids are used as a working medium in the heat pipe. The study discusses about the effect of heat pipe inclination, type of working fluid and heat input on the thermal efficiency and thermal resistance. The experimental results are evaluated in terms of its performance metrics and are compared with that of DI water.Keywords: copper nanofluid with aqueous solution of n-Butanol, heat pipe, thermal efficiency, thermal resistance
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 34142532 Na Promoted Ni/γ-Al2O3 Catalysts Prepared by Solution Combustion Method for Syngas Methanation
Authors: Yan Zeng, Hongfang Ma, Haitao Zhang, Weiyong Ying
Abstract:
Ni-based catalysts with different amounts of Na as promoter from 2 to 6 wt % were prepared by solution combustion method. The catalytic activity was investigated in syngas methanation reaction. Carbon oxides conversion and methane selectivity are greatly influenced by sodium loading. Adding 2 wt% Na remarkably improves catalytic activity and long-term stability, attributed to its smaller mean NiO particle size, better distribution, and milder metal-support interaction. However, excess addition of Na results in deactivation distinctly due to the blockage of active sites.
Keywords: Nickel catalysts, Syngas methanation, Sodium, Solution combustion method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 43052531 Hopf Bifurcation for a New Chaotic System
Authors: Kejun Zhuang
Abstract:
In this paper, a three dimensional autonomous chaotic system is considered. The existence of Hopf bifurcation is investigated by choosing the appropriate bifurcation parameter. Furthermore, formulas for determining the direction of the Hopf bifurcation and the stability of bifurcating periodic solutions are derived with the help of normal form theory. Finally, a numerical example is given.
Keywords: Chaotic system, Hopf bifurcation, normal form theory.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14462530 Numerical Solution of Linear Ordinary Differential Equations in Quantum Chemistry by Clenshaw Method
Authors: M. Saravi, F. Ashrafi, S.R. Mirrajei
Abstract:
As we know, most differential equations concerning physical phenomenon could not be solved by analytical method. Even if we use Series Method, some times we need an appropriate change of variable, and even when we can, their closed form solution may be so complicated that using it to obtain an image or to examine the structure of the system is impossible. For example, if we consider Schrodinger equation, i.e., We come to a three-term recursion relations, which work with it takes, at least, a little bit time to get a series solution[6]. For this reason we use a change of variable such as or when we consider the orbital angular momentum[1], it will be necessary to solve. As we can observe, working with this equation is tedious. In this paper, after introducing Clenshaw method, which is a kind of Spectral method, we try to solve some of such equations.Keywords: Chebyshev polynomials, Clenshaw method, ODEs, Spectral methods
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14212529 Optimizing Hadoop Block Placement Policy and Cluster Blocks Distribution
Authors: Nchimbi Edward Pius, Liu Qin, Fion Yang, Zhu Hong Ming
Abstract:
The current Hadoop block placement policy do not fairly and evenly distributes replicas of blocks written to datanodes in a Hadoop cluster.
This paper presents a new solution that helps to keep the cluster in a balanced state while an HDFS client is writing data to a file in Hadoop cluster. The solution had been implemented, and test had been conducted to evaluate its contribution to Hadoop distributed file system.
It has been found that, the solution has lowered global execution time taken by Hadoop balancer to 22 percent. It also has been found that, Hadoop balancer respectively over replicate 1.75 and 3.3 percent of all re-distributed blocks in the modified and original Hadoop clusters.
The feature that keeps the cluster in a balanced state works as a core part to Hadoop system and not just as a utility like traditional balancer. This is one of the significant achievements and uniqueness of the solution developed during the course of this research work.
Keywords: Balancer, Datanode, Distributed file system, Hadoop, Replicas.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 49622528 A Method for Improving the Embedded Runge Kutta Fehlberg 4(5)
Authors: Sunyoung Bu, Wonkyu Chung, Philsu Kim
Abstract:
In this paper, we introduce a method for improving the embedded Runge-Kutta-Fehlberg4(5) method. At each integration step, the proposed method is comprised of two equations for the solution and the error, respectively. These solution and error are obtained by solving an initial value problem whose solution has the information of the error at each integration step. The constructed algorithm controls both the error and the time step size simultaneously and possesses a good performance in the computational cost compared to the original method. For the assessment of the effectiveness, EULR problem is numerically solved.
Keywords: Embedded Runge-Kutta-Fehlberg method, Initial value problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 27522527 Application of Homotopy Perturbation Method to Solve Steady Flow of Walter B Fluid A Vertical Channel In Porous Media
Authors: A.Memari
Abstract:
In this article, a simulation method called the Homotopy Perturbation Method (HPM) is employed in the steady flow of a Walter's B' fluid in a vertical channel with porous wall. We employed Homotopy Perturbation Method to derive solution of a nonlinear form of equation obtained from exerting similarity transforming to the ordinary differential equation gained from continuity and momentum equations of this kind of flow. The results obtained from the Homotopy Perturbation Method are then compared with those from the Runge–Kutta method in order to verify the accuracy of the proposed method. The results show that the Homotopy Perturbation Method can achieve good results in predicting the solution of such problems. Ultimately we use this solution to obtain the other terms of velocities and physical discussion about it.
Keywords: Steady flow; Walter's B' Fluid;, vertical channel;porous media, Homotopy Perturbation Method (HPM), Numerical Solution (NS).
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19802526 An Exact Solution of Axi-symmetric Conductive Heat Transfer in Cylindrical Composite Laminate under the General Boundary Condition
Authors: M.kayhani, M.Nourouzi, A. Amiri Delooei
Abstract:
This study presents an exact general solution for steady-state conductive heat transfer in cylindrical composite laminates. Appropriate Fourier transformation has been obtained using Sturm-Liouville theorem. Series coefficients are achieved by solving a set of equations that related to thermal boundary conditions at inner and outer of the cylinder, also related to temperature continuity and heat flux continuity between each layer. The solution of this set of equations are obtained using Thomas algorithm. In this paper, the effect of fibers- angle on temperature distribution of composite laminate is investigated under general boundary conditions. Here, we show that the temperature distribution for any composite laminates is between temperature distribution for laminates with θ = 0° and θ = 90° .Keywords: exact solution, composite laminate, heat conduction, cylinder, Fourier transformation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 24482525 Typical Day Prediction Model for Output Power and Energy Efficiency of a Grid-Connected Solar Photovoltaic System
Authors: Yan Su, L. C. Chan
Abstract:
A novel typical day prediction model have been built and validated by the measured data of a grid-connected solar photovoltaic (PV) system in Macau. Unlike conventional statistical method used by previous study on PV systems which get results by averaging nearby continuous points, the present typical day statistical method obtain the value at every minute in a typical day by averaging discontinuous points at the same minute in different days. This typical day statistical method based on discontinuous point averaging makes it possible for us to obtain the Gaussian shape dynamical distributions for solar irradiance and output power in a yearly or monthly typical day. Based on the yearly typical day statistical analysis results, the maximum possible accumulated output energy in a year with on site climate conditions and the corresponding optimal PV system running time are obtained. Periodic Gaussian shape prediction models for solar irradiance, output energy and system energy efficiency have been built and their coefficients have been determined based on the yearly, maximum and minimum monthly typical day Gaussian distribution parameters, which are obtained from iterations for minimum Root Mean Squared Deviation (RMSD). With the present model, the dynamical effects due to time difference in a day are kept and the day to day uncertainty due to weather changing are smoothed but still included. The periodic Gaussian shape correlations for solar irradiance, output power and system energy efficiency have been compared favorably with data of the PV system in Macau and proved to be an improvement than previous models.
Keywords: Grid Connected, RMSD, Solar PV System, Typical Day.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16792524 Stability and Bifurcation Analysis in a Model of Hes1 Selfregulation with Time Delay
Authors: Kejun Zhuang, Hailong Zhu
Abstract:
The dynamics of a delayed mathematical model for Hes1 oscillatory expression are investigated. The linear stability of positive equilibrium and existence of local Hopf bifurcation are studied. Moreover, the global existence of large periodic solutions has been established due to the global bifurcation theorem.Keywords: Hes1, Hopf bifurcation, time delay, transcriptional repression loop
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13942523 Hardware Approach to Solving Password Exposure Problem through Keyboard Sniff
Authors: Kyungroul Lee, Kwangjin Bae, Kangbin Yim
Abstract:
This paper introduces a hardware solution to password exposure problem caused by direct accesses to the keyboard hardware interfaces through which a possible attacker is able to grab user-s password even where existing countermeasures are deployed. Several researches have proposed reasonable software based solutions to the problem for years. However, recently introduced hardware vulnerability problems have neutralized the software approaches and yet proposed any effective software solution to the vulnerability. Hardware approach in this paper is expected as the only solution to the vulnerabilityKeywords: Keyboard sniff, password exposure, hardware vulnerability, privacy problem, insider security.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15782522 A Sum Operator Method for Unique Positive Solution to a Class of Boundary Value Problem of Nonlinear Fractional Differential Equation
Authors: Fengxia Zheng, Chuanyun Gu
Abstract:
By using a fixed point theorem of a sum operator, the existence and uniqueness of positive solution for a class of boundary value problem of nonlinear fractional differential equation is studied. An iterative scheme is constructed to approximate it. Finally, an example is given to illustrate the main result.Keywords: Fractional differential equation, Boundary value problem, Positive solution, Existence and uniqueness, Fixed point theorem of a sum operator.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14842521 Energy Efficient Resource Allocation in Distributed Computing Systems
Authors: Samee Ullah Khan, C. Ardil
Abstract:
The problem of mapping tasks onto a computational grid with the aim to minimize the power consumption and the makespan subject to the constraints of deadlines and architectural requirements is considered in this paper. To solve this problem, we propose a solution from cooperative game theory based on the concept of Nash Bargaining Solution. The proposed game theoretical technique is compared against several traditional techniques. The experimental results show that when the deadline constraints are tight, the proposed technique achieves superior performance and reports competitive performance relative to the optimal solution.Keywords: Energy efficient algorithms, resource allocation, resource management, cooperative game theory.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17902520 Continuous Threshold Prey Harvesting in Predator-Prey Models
Authors: Jonathan Bohn, Jorge Rebaza, Kaitlin Speer
Abstract:
The dynamics of a predator-prey model with continuous threshold policy harvesting functions on the prey is studied. Theoretical and numerical methods are used to investigate boundedness of solutions, existence of bionomic equilibria, and the stability properties of coexistence equilibrium points and periodic orbits. Several bifurcations as well as some heteroclinic orbits are computed.Keywords: Predator-prey models, threshold harvesting, dynamicalsystems
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 23042519 Parallel Branch and Bound Model Using Logarithmic Sampling (PBLS) for Symmetric Traveling Salesman Problem
Authors: Sheikh Muhammad Azam, Masood-ur-Rehman, Adnan Khalid Bhatti, Nadeem Daudpota
Abstract:
Very Large and/or computationally complex optimization problems sometimes require parallel or highperformance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is “Traveling Salesman Problem". In this paper we have introduced a Branch & Bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the “symmetric traveling salesman problem". We reviewed some of already available algorithms and felt that there is need of new algorithm which should give optimal solution or near to the optimal solution. On the basis of the use of logarithmic sampling, it was found that the proposed algorithm produced a relatively optimal solution for the problem and results excellent performance as compared with the traditional algorithms of this series.
Keywords: Parallel execution, symmetric traveling salesman problem, branch and bound algorithm, logarithmic sampling.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 23402518 An Efficient and Secure Solution for the Problems of ARP Cache Poisoning Attacks
Authors: Md. Ataullah, Naveen Chauhan
Abstract:
The Address Resolution Protocol (ARP) is used by computers to map logical addresses (IP) to physical addresses (MAC). However ARP is an all trusting protocol and is stateless which makes it vulnerable to many ARP cache poisoning attacks such as Man-in-the-Middle (MITM) and Denial of service (DoS) attacks. These flaws result in security breaches thus weakening the appeal of the computer for exchange of sensitive data. In this paper we describe ARP, outline several possible ARP cache poisoning attacks and give the detailed of some attack scenarios in network having both wired and wireless hosts. We have analyzed each of proposed solutions, identify their strengths and limitations. Finally get that no solution offers a feasible solution. Hence, this paper presents an efficient and secure version of ARP that is able to cope up with all these types of attacks and is also a feasible solution. It is a stateful protocol, by storing the information of the Request frame in the ARP cache, to reduce the chances of various types of attacks in ARP. It is more efficient and secure by broadcasting ARP Reply frame in the network and storing related entries in the ARP cache each time when communication take place.Keywords: ARP cache poisoning, MITM, DoS
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 29222517 Numerical Implementation of an Interfacial Edge Dislocation Solution in a Multi-Layered Medium
Authors: Aditya Khanna, Andrei Kotousov
Abstract:
A novel method is presented for obtaining the stress field induced by an edge dislocation in a multilayered composite. To demonstrate the applications of the obtained solution, we consider the problem of an interfacial crack in a periodically layered bimaterial medium. The crack is modelled as a continuous distribution of edge dislocations and the Distributed Dislocation Technique (DDT) is utilized to obtain numerical results for the energy release rate (ERR). The numerical implementation of the dislocation solution in MATLAB is also provided.Keywords: Distributed dislocation technique, Edge dislocation, Elastic field, Interfacial crack, Multi-layered composite.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 22302516 Speciation Analysis by Solid-Phase Microextraction and Application to Atrazine
Authors: K. Benhabib, X. Pierens, V-D Nguyen, G. Mimanne
Abstract:
The main hypothesis of the dynamics of solid phase microextraction (SPME) is that steady-state mass transfer is respected throughout the SPME extraction process. It considers steady-state diffusion is established in the two phases and fast exchange of the analyte at the solid phase film/water interface. An improved model is proposed in this paper to handle with the situation when the analyte (atrazine) is in contact with colloid suspensions (carboxylate latex in aqueous solution). A mathematical solution is obtained by substituting the diffusion coefficient by the mean of diffusion coefficient between analyte and carboxylate latex, and also thickness layer by the mean thickness in aqueous solution. This solution provides an equation relating the extracted amount of the analyte to the extraction a little more complicated than previous models. It also gives a better description of experimental observations. Moreover, the rate constant of analyte obtained is in satisfactory agreement with that obtained from the initial curve fitting.
Keywords: Pesticide, SPME methods, polyacrylate, steady state.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 696