Search results for: center–focus problem
4493 Dynamic Admission Control Based on Effective Demand for Next Generation Wireless Networks
Authors: Somenath Mukherjee, Rajdeep Ray, Raj Kumar Samanta, Mofazzal H. Khondekar, Gautam Sanyal
Abstract:
In next generation wireless networks (i.e., 4G and beyond), one of the main objectives is to ensure highest level of customer satisfaction in terms of data transfer speed, decrease in cost and delay, non-rejection and no drop of calls, availability of ‘always-on’ connectivity and services, continuity of connected services, hastle-free roaming in addition to the convenience of use of network services from anywhere and anytime. To take care of these requirements effectively, internet service providers (ISPs) and network planners have to go for major capacity enhancement of network resources and at the same time these resources are to be used effectively and efficiently to reduce cost and to increase revenue. In this work, the effective bandwidth available in a Mobile Switching Center (MSC) of a wireless network providing multi-class multimedia services is analyzed. Bandwidth requirement of the users for a customized Quality of Service (QoS) is estimated. The findings of the QoS estimation are applied for the capacity planning and admission control of the multi-class traffic flows coming into the MSC.
Keywords: Next generation wireless network, mobile switching center, multi-class traffic, quality of service, admission control, effective bandwidth.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 8324492 Key Factors of Curriculum Innovation in Language Teacher Education
Authors: Liliana Mâţă
Abstract:
The focus of the study is to understand the factors of curriculum innovation from the perspective of Language teacher education. The overall aim of the study is to investigate Language educators- perceptions of factors of curriculum innovation. In the theoretical framework the main focus is on discussion about different curriculum approaches for language teacher education and limiting and facilitating factors of innovation. In order to achieve the aim of the study, an observational research is employed. The empirical basis of the study consists of questionnaire with sixty-three language teachers from eight Romanian higher education institutions. The findings reveal variation in Language teachers- conceptions of the dominant factors of curricular innovation.Keywords: curriculum innovation, factors, Language teacher education
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 167994491 A New Heuristic Approach for Large Size Zero-One Multi Knapsack Problem Using Intercept Matrix
Authors: K. Krishna Veni, S. Raja Balachandar
Abstract:
This paper presents a heuristic to solve large size 0-1 Multi constrained Knapsack problem (01MKP) which is NP-hard. Many researchers are used heuristic operator to identify the redundant constraints of Linear Programming Problem before applying the regular procedure to solve it. We use the intercept matrix to identify the zero valued variables of 01MKP which is known as redundant variables. In this heuristic, first the dominance property of the intercept matrix of constraints is exploited to reduce the search space to find the optimal or near optimal solutions of 01MKP, second, we improve the solution by using the pseudo-utility ratio based on surrogate constraint of 01MKP. This heuristic is tested for benchmark problems of sizes upto 2500, taken from literature and the results are compared with optimum solutions. Space and computational complexity of solving 01MKP using this approach are also presented. The encouraging results especially for relatively large size test problems indicate that this heuristic can successfully be used for finding good solutions for highly constrained NP-hard problems.
Keywords: 0-1 Multi constrained Knapsack problem, heuristic, computational complexity, NP-Hard problems.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18434490 Solution of Two-Point Nonlinear Boundary Problems Using Taylor Series Approximation and the Ying Buzu Shu Algorithm
Authors: U. C. Amadi, N. A. Udoh
Abstract:
One of the major challenges faced in solving initial and boundary problems is how to find approximate solutions with minimal deviation from the exact solution without so much rigor and complications. The Taylor series method provides a simple way of obtaining an infinite series which converges to the exact solution for initial value problems and this method of solution is somewhat limited for a two point boundary problem since the infinite series has to be truncated to include the boundary conditions. In this paper, the Ying Buzu Shu algorithm is used to solve a two point boundary nonlinear diffusion problem for the fourth and sixth order solution and compare their relative error and rate of convergence to the exact solution.
Keywords: Ying Buzu Shu, nonlinear boundary problem, Taylor series algorithm, infinite series.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 4384489 Application of GAMS and GA in the Location and Penetration of Distributed Generation
Authors: Alireza Dehghani Pilehvarani, Mojtaba Hakimzadeh, Mohammad Jafari Far, Reza Sedaghati
Abstract:
Distributed Generation (DG) can help in reducing the cost of electricity to the costumer, relieve network congestion and provide environmentally friendly energy close to load centers. Its capacity is also scalable and it provides voltage support at distribution level. Hence, DG placement and penetration level is an important problem for both the utility and DG owner. DG allocation and capacity determination is a nonlinear optimization problem. The objective function of this problem is the minimization of the total loss of the distribution system. Also high levels of penetration of DG are a new challenge for traditional electric power systems. This paper presents a new methodology for the optimal placement of DG and penetration level of DG in distribution system based on General Algebraic Modeling System (GAMS) and Genetic Algorithm (GA).
Keywords: Distributed Generation, Location, Loss Reduction, Distribution Network, GA, GAMS.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 26254488 Relay Node Placement for Connectivity Restoration in Wireless Sensor Networks Using Genetic Algorithms
Authors: Hanieh Tarbiat Khosrowshahi, Mojtaba Shakeri
Abstract:
Wireless Sensor Networks (WSNs) consist of a set of sensor nodes with limited capability. WSNs may suffer from multiple node failures when they are exposed to harsh environments such as military zones or disaster locations and lose connectivity by getting partitioned into disjoint segments. Relay nodes (RNs) are alternatively introduced to restore connectivity. They cost more than sensors as they benefit from mobility, more power and more transmission range, enforcing a minimum number of them to be used. This paper addresses the problem of RN placement in a multiple disjoint network by developing a genetic algorithm (GA). The problem is reintroduced as the Steiner tree problem (which is known to be an NP-hard problem) by the aim of finding the minimum number of Steiner points where RNs are to be placed for restoring connectivity. An upper bound to the number of RNs is first computed to set up the length of initial chromosomes. The GA algorithm then iteratively reduces the number of RNs and determines their location at the same time. Experimental results indicate that the proposed GA is capable of establishing network connectivity using a reasonable number of RNs compared to the best existing work.
Keywords: Connectivity restoration, genetic algorithms, multiple-node failure, relay nodes, wireless sensor networks.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10924487 Compression and Filtering of Random Signals under Constraint of Variable Memory
Authors: Anatoli Torokhti, Stan Miklavcic
Abstract:
We study a new technique for optimal data compression subject to conditions of causality and different types of memory. The technique is based on the assumption that some information about compressed data can be obtained from a solution of the associated problem without constraints of causality and memory. This allows us to consider two separate problem related to compression and decompression subject to those constraints. Their solutions are given and the analysis of the associated errors is provided.Keywords: stochastic signals, optimization problems in signal processing.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13244486 On the Exact Solution of Non-Uniform Torsion for Beams with Asymmetric Cross-Section
Authors: A.Campanile, M. Mandarino, V. Piscopo
Abstract:
This paper deals with the problem of non-uniform torsion in thin-walled elastic beams with asymmetric cross-section, removing the basic concept of a fixed center of twist, necessary in the Vlasov-s and Benscoter-s theories to obtain a warping stress field equivalent to zero. In this new torsion/flexure theory, despite of the classical ones, the warping function will punctually satisfy the first indefinite equilibrium equation along the beam axis and it wont- be necessary to introduce the classical congruence condition, to take into account the effect of the beam restraints. The solution, based on the Fourier development of the displacement field, is obtained assuming that the applied external torque is constant along the beam axis and on both beam ends the unit twist angle and the warping axial displacement functions are totally restrained. Finally, in order to verify the feasibility of the proposed method and to compare it with the classical theories, two applications are carried out. The first one, relative to an open profile, is necessary to test the numerical method adopted to find the solution; the second one, instead, is relative to a simplified containership section, considered as full restrained in correspondence of two adjacent transverse bulkheads.Keywords: Non-uniform torsion, Asymmetric cross-section, Fourier series, Helmholtz equation, FE method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19304485 Automated Ranking of Hints
Authors: Sylvia Encheva
Abstract:
The importance of hints in an intelligent tutoring system is well understood. The problems however related to their delivering are quite a few. In this paper we propose delivering of hints to be based on considering their usefulness. By this we mean that a hint is regarded as useful to a student if the student has succeeded to solve a problem after the hint was suggested to her/him. Methods from the theory of partial orderings are further applied facilitating an automated process of offering individualized advises on how to proceed in order to solve a particular problem.
Keywords: Decision support services, uncertainty management, partial orderings.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14824484 Exploring the Potential of Chatbots in Higher Education: A Preliminary Study
Authors: S. Studente, S. Ellis, S. F. Garivaldis
Abstract:
We report upon a study introducing a chatbot to develop learning communities at a London University, with a largely international student base. The focus of the chatbot was twofold; to ease the transition for students into their first year of university study, and to increase study engagement. Four learning communities were created using the chatbot; level 3 foundation, level 4 undergraduate, level 6 undergraduate and level 7 post-graduate. Students and programme leaders were provided with access to the chat bot via mobile app prior to their study induction and throughout the autumn term of 2019. At the end of the term, data were collected via questionnaires and focus groups with students and teaching staff to allow for identification of benefits and challenges. Findings indicated a positive correlation between study engagement and engagement with peers. Students reported that the chatbot enabled them to obtain support and connect to their programme leader. Both staff and students also made recommendation on how engagement could be further enhanced using the bot in terms of; clearly specified purpose, integration with existing university systems, leading by example and connectivity. Extending upon these recommendations, a second pilot study is planned for September 2020, for which the focus will be upon improving attendance rates, student satisfaction and module pass rates.
Keywords: Chatbot, e-learning, learning communities, student engagement.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16754483 Fuzzy C-Means Clustering Algorithm for Voltage Stability in Large Power Systems
Authors: Mohamad R. Khaldi, Christine S. Khoury, Guy M. Naim
Abstract:
The steady-state operation of maintaining voltage stability is done by switching various controllers scattered all over the power network. When a contingency occurs, whether forced or unforced, the dispatcher is to alleviate the problem in a minimum time, cost, and effort. Persistent problem may lead to blackout. The dispatcher is to have the appropriate switching of controllers in terms of type, location, and size to remove the contingency and maintain voltage stability. Wrong switching may worsen the problem and that may lead to blackout. This work proposed and used a Fuzzy CMeans Clustering (FCMC) to assist the dispatcher in the decision making. The FCMC is used in the static voltage stability to map instantaneously a contingency to a set of controllers where the types, locations, and amount of switching are induced.Keywords: Fuzzy logic, Power system control, Reactive power control, Voltage control
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18724482 A Novel Pareto-Based Meta-Heuristic Algorithm to Optimize Multi-Facility Location-Allocation Problem
Authors: Vahid Hajipour, Samira V. Noshafagh, Reza Tavakkoli-Moghaddam
Abstract:
This article proposes a novel Pareto-based multiobjective meta-heuristic algorithm named non-dominated ranking genetic algorithm (NRGA) to solve multi-facility location-allocation problem. In NRGA, a fitness value representing rank is assigned to each individual of the population. Moreover, two features ranked based roulette wheel selection including select the fronts and choose solutions from the fronts, are utilized. The proposed solving methodology is validated using several examples taken from the specialized literature. The performance of our approach shows that NRGA algorithm is able to generate true and well distributed Pareto optimal solutions.
Keywords: Non-dominated ranking genetic algorithm, Pareto solutions, Multi-facility location-allocation problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21574481 Optimal Economic Load Dispatch Using Genetic Algorithms
Authors: Vijay Kumar, Jagdev Singh, Yaduvir Singh, Sanjay Sood
Abstract:
In a practical power system, the power plants are not located at the same distance from the center of loads and their fuel costs are different. Also, under normal operating conditions, the generation capacity is more than the total load demand and losses. Thus, there are many options for scheduling generation. In an interconnected power system, the objective is to find the real and reactive power scheduling of each power plant in such a way as to minimize the operating cost. This means that the generator’s real and reactive powers are allowed to vary within certain limits so as to meet a particular load demand with minimum fuel cost. This is called optimal power flow problem. In this paper, Economic Load Dispatch (ELD) of real power generation is considered. Economic Load Dispatch (ELD) is the scheduling of generators to minimize total operating cost of generator units subjected to equality constraint of power balance within the minimum and maximum operating limits of the generating units. In this paper, genetic algorithms are considered. ELD solutions are found by solving the conventional load flow equations while at the same time minimizing the fuel costs.Keywords: ELD, Equality constraints, Genetic algorithms, Strings.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 38504480 On a Way for Constructing Numerical Methods on the Joint of Multistep and Hybrid Methods
Authors: G.Mehdiyeva, M.Imanova, V.Ibrahimov
Abstract:
Taking into account that many problems of natural sciences and engineering are reduced to solving initial-value problem for ordinary differential equations, beginning from Newton, the scientists investigate approximate solution of ordinary differential equations. There are papers of different authors devoted to the solution of initial value problem for ODE. The Euler-s known method that was developed under the guidance of the famous scientists Adams, Runge and Kutta is the most popular one among these methods. Recently the scientists began to construct the methods preserving some properties of Adams and Runge-Kutta methods and called them hybrid methods. The constructions of such methods are investigated from the middle of the XX century. Here we investigate one generalization of multistep and hybrid methods and on their base we construct specific methods of accuracy order p = 5 and p = 6 for k = 1 ( k is the order of the difference method).Keywords: Multistep and hybrid methods, initial value problem, degree and stability of hybrid methods
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15854479 GPS Signal Correction to Improve Vehicle Location during Experimental Campaign
Authors: L. Della Ragione, G. Meccariello
Abstract:
In recent years in Italy the progress of the automobile industry, in the field of reduction of emissions values, is very remarkable. Nevertheless their evaluation and reduction is a key problem, especially in the cities, that account for more than 50% of world population. In this paper we dealt with the problem of describing a quantitatively approach for the reconstruction of GPS coordinates and altitude, in the context of correlation study between driving cycles / emission / geographical location, during an experimental campaign realized with some instrumented cars.
Keywords: Air pollution, Driving cycles, GPS signal.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19044478 A Fault Tolerant Token-based Algorithm for Group Mutual Exclusion in Distributed Systems
Authors: Abhishek Swaroop, Awadhesh Kumar Singh
Abstract:
The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the present paper a token-based group mutual exclusion algorithm, capable of handling transient faults, is proposed. The algorithm uses the concept of dynamic request sets. A time out mechanism is used to detect the token loss; also, a distributed scheme is used to regenerate the token. The worst case message complexity of the algorithm is n+1. The maximum concurrency and forum switch complexity of the algorithm are n and min (n, m) respectively, where n is the number of processes and m is the number of groups. The algorithm also satisfies another desirable property called smooth admission. The scheme can also be adapted to handle the extended group mutual exclusion problem.Keywords: Dynamic request sets, Fault tolerance, Smoothadmission, Transient faults.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16614477 Economical Operation of Hydro-Thermal Power System based on Multi-path Adaptive Tabu Search
Authors: J. Kluabwang
Abstract:
An economic operation scheduling problem of a hydro-thermal power generation system has been properly solved by the proposed multipath adaptive tabu search algorithm (MATS). Four reservoirs with their own hydro plants and another one thermal plant are integrated to be a studied system used to formulate the objective function under complicated constraints, eg water managements, power balance and thermal generator limits. MATS with four subsearch units (ATSs) and two stages of discarding mechanism (DM), has been setting and trying to solve the problem through 25 trials under function evaluation criterion. It is shown that MATS can provide superior results with respect to single ATS and other previous methods, genetic algorithms (GA) and differential evolution (DE).Keywords: Hydro-thermal scheduling problem, economic dispatch, adaptive tabu search, multipath adaptive tabu search
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16834476 An Intelligent Optimization Model for Multi-objective Order Allocation Planning
Authors: W. K. Wong, Z. X. Guo, P.Y. Mok
Abstract:
This paper presents a multi-objective order allocation planning problem with the consideration of various real-world production features. A novel hybrid intelligent optimization model, integrating a multi-objective memetic optimization process, a Monte Carlo simulation technique and a heuristic pruning technique, is proposed to handle this problem. Experiments based on industrial data are conducted to validate the proposed model. Results show that (1) the proposed model can effectively solve the investigated problem by providing effective production decision-making solutions, which outperformsan NSGA-II-based optimization process and an industrial method.Keywords: Multi-objective order allocation planning, Pareto optimization, Memetic algorithm, Mento Carlo simulation
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16304475 Mechanical Quadrature Methods for Solving First Kind Boundary Integral Equations of Stationary Stokes Problem
Authors: Xin Luo, Jin Huang, Pan Cheng
Abstract:
By means of Sidi-Israeli’s quadrature rules, mechanical quadrature methods (MQMs) for solving the first kind boundary integral equations (BIEs) of steady state Stokes problem are presented. The convergence of numerical solutions by MQMs is proved based on Anselone’s collective compact and asymptotical compact theory, and the asymptotic expansions with the odd powers of the errors are provided, which implies that the accuracy of the approximations by MQMs possesses high accuracy order O (h3). Finally, the numerical examples show the efficiency of our methods.
Keywords: Stokes problem, boundary integral equation, mechanical quadrature methods, asymptotic expansions.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13884474 Controllability of Efficiency of Antiviral Therapy in Hepatitis B Virus Infections
Authors: Shyam S.N. Perera
Abstract:
An optimal control problem for a mathematical model of efficiency of antiviral therapy in hepatitis B virus infections is considered. The aim of the study is to control the new viral production, block the new infection cells and maintain the number of uninfected cells in the given range. The optimal controls represent the efficiency of antiviral therapy in inhibiting viral production and preventing new infections. Defining the cost functional, the optimal control problem is converted into the constrained optimization problem and the first order optimality system is derived. For the numerical simulation, we propose the steepest descent algorithm based on the adjoint variable method. A computer program in MATLAB is developed for the numerical simulations.
Keywords: Virus infection model, Optimal control, Adjoint system, Steepest descent
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 12454473 Behrens-Fisher Problem with One Variance Unknown
Authors: Sa-aat Niwitpong, Rada Somkhuean, Suparat Niwitpong
Abstract:
This paper presents the generalized p-values for testing the Behrens-Fisher problem when one variance is unknown. We also derive a closed form expression of the upper bound of the proposed generalized p-value.
Keywords: Generalized p-value, hypothesis testing, upper bound.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14514472 Optimal Design of UPFC Based Damping Controller Using Iteration PSO
Authors: Amin Safari, Hossein Shayeghi
Abstract:
This paper presents a novel approach for tuning unified power flow controller (UPFC) based damping controller in order to enhance the damping of power system low frequency oscillations. The design problem of damping controller is formulated as an optimization problem according to the eigenvalue-based objective function which is solved using iteration particle swarm optimization (IPSO). The effectiveness of the proposed controller is demonstrated through eigenvalue analysis and nonlinear time-domain simulation studies under a wide range of loading conditions. The simulation study shows that the designed controller by IPSO performs better than CPSO in finding the solution. Moreover, the system performance analysis under different operating conditions show that the δE based controller is superior to the mB based controller.
Keywords: UPFC, Optimization Problem, Iteration ParticleSwarm Optimization, Damping Controller, Low FrequencyOscillations.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17964471 Optimal Risk Reduction in the Railway Industry by Using Dynamic Programming
Authors: Michael Todinov, Eberechi Weli
Abstract:
The paper suggests for the first time the use of dynamic programming techniques for optimal risk reduction in the railway industry. It is shown that by using the concept ‘amount of removed risk by a risk reduction option’, the problem related to optimal allocation of a fixed budget to achieve a maximum risk reduction in the railway industry can be reduced to an optimisation problem from dynamic programming. For n risk reduction options and size of the available risk reduction budget B (expressed as integer number), the worst-case running time of the proposed algorithm is O (n x (B+1)), which makes the proposed method a very efficient tool for solving the optimal risk reduction problem in the railway industry.
Keywords: Optimisation, railway risk reduction, budget constraints, dynamic programming.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21634470 Assessment of Tourist and Community Perception with Regard to Tourism Sustainability Indicators: A Case Study of Sinharaja World Heritage Rainforest, Sri Lanka
Authors: L. P. K. Liyanage, N. R. P. Withana, A. L. Sandika
Abstract:
The purpose of this study was to determine tourist and community perception-based sustainable tourism indicators as well as Human Pressure Index (HPI) and Tourist Activity Index (TAI). Study was carried out in Sinharaja forest which is considered as one of the major eco-tourism destination in Sri Lanka. Data were gathered using a pre-tested semi-structured questionnaire as well as records from Forest department. Convenient sampling technique was applied. For the majority of issues, the responses were obtained on multi-point Likert-type scales. Visual portrayal was used for display analyzed data. The study revealed that the host community of the Kudawa gets many benefits from tourism. Also, tourism has caused negative impacts upon the environment and community. The study further revealed the need of proper waste management and involvement of local cultural events for the tourism business in the Kudawa conservation center. The TAI, which accounted to be 1.27 and monthly evolution of HPI revealed that congestion can be occurred in the Sinharaja rainforest during peak season. The results provide useful information to any party involved with tourism planning anywhere, since such attempts would be more effective once the people’s perceptions on these aspects are taken into account.
Keywords: Kudawa conservation center, Sinharaja world heritage rainforest, sustainability indicators.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 11414469 An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem
Authors: Y. Wang
Abstract:
The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is O(CNmaxn2) where C is the iterations, Nmax is the maximum number of frequency quadrilaterals containing each edge and n is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5n edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced.
Keywords: Frequency quadrilateral, iterative algorithm, sparse graph, traveling salesman problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10024468 Nonlinear Model Predictive Swing-Up and Stabilizing Sliding Mode Controllers
Authors: S. Kahvecioglu, A. Karamancioglu, A. Yazici
Abstract:
In this paper, a nonlinear model predictive swing-up and stabilizing sliding controller is proposed for an inverted pendulum-cart system. In the swing up phase, the nonlinear model predictive control is formulated as a nonlinear programming problem with energy based objective function. By solving this problem at each sampling instant, a sequence of control inputs that optimize the nonlinear objective function subject to various constraints over a finite horizon are obtained. Then, this control drives the pendulum to a predefined neighborhood of the upper equilibrium point, at where sliding mode based model predictive control is used to stabilize the systems with the specified constraints. It is shown by the simulations that, due to the way of formulating the problem, short horizon lengths are sufficient for attaining the swing up goal.Keywords: Inverted pendulum, model predictive control, swingup, stabilization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21814467 A Family of Distributions on Learnable Problems without Uniform Convergence
Authors: César Garza
Abstract:
In supervised binary classification and regression problems, it is well-known that learnability is equivalent to uniform convergence of the hypothesis class, and if a problem is learnable, it is learnable by empirical risk minimization. For the general learning setting of unsupervised learning tasks, there are non-trivial learning problems where uniform convergence does not hold. We present here the task of learning centers of mass with an extra feature that “activates” some of the coordinates over the unit ball in a Hilbert space. We show that the learning problem is learnable under a stable RLM rule. We introduce a family of distributions over the domain space with some mild restrictions for which the sample complexity of uniform convergence for these problems must grow logarithmically with the dimension of the Hilbert space. If we take this dimension to infinity, we obtain a learnable problem for which the uniform convergence property fails for a vast family of distributions.
Keywords: Statistical learning theory, learnability, uniform convergence, stability, regularized loss minimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3234466 Microseismicity of the Tehran Region Based on Three Seismic Networks
Authors: Jamileh Vasheghani Farahani
Abstract:
The main purpose of this research is to show the current active faults and active tectonic of the area by three seismic networks in Tehran region: 1-Tehran Disaster Mitigation and Management Organization (TDMMO), 2-Broadband Iranian National Seismic Network Center (BIN), 3-Iranian Seismological Center (IRSC). In this study, we analyzed microearthquakes happened in Tehran city and its surroundings using the Tehran networks from 1996 to 2015. We found some active faults and trends in the region. There is a 200-year history of historical earthquakes in Tehran. Historical and instrumental seismicity show that the east of Tehran is more active than the west. The Mosha fault in the North of Tehran is one of the active faults of the central Alborz. Moreover, other major faults in the region are Kahrizak, Eyvanakey, Parchin and North Tehran faults. An important seismicity region is an intersection of the Mosha and North Tehran fault systems (Kalan village in Lavasan). This region shows a cluster of microearthquakes. According to the historical and microseismic events analyzed in this research, there is a seismic gap in SE of Tehran. The empirical relationship is used to assess the Mmax based on the rupture length. There is a probability of occurrence of a strong motion of 7.0 to 7.5 magnitudes in the region (based on the assessed capability of the major faults such as Parchin and Eyvanekey faults and historical earthquakes).
Keywords: Iran, major faults, microseismicity, Tehran.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15044465 Genetic Algorithms with Oracle for the Traveling Salesman Problem
Authors: Robin Gremlich, Andreas Hamfelt, Héctor de Pereda, Vladislav Valkovsky
Abstract:
By introducing the concept of Oracle we propose an approach for improving the performance of genetic algorithms for large-scale asymmetric Traveling Salesman Problems. The results have shown that the proposed approach allows overcoming some traditional problems for creating efficient genetic algorithms.
Keywords: Genetic algorithms, Traveling Salesman Problem, optimal decision distribution, oracle.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17124464 Optimization Approach to Estimate Hammerstein–Wiener Nonlinear Blocks in Presence of Noise and Disturbance
Authors: Leili Esmaeilani, Jafar Ghaisari, Mohsen Ahmadian
Abstract:
Hammerstein–Wiener model is a block-oriented model where a linear dynamic system is surrounded by two static nonlinearities at its input and output and could be used to model various processes. This paper contains an optimization approach method for analysing the problem of Hammerstein–Wiener systems identification. The method relies on reformulate the identification problem; solve it as constraint quadratic problem and analysing its solutions. During the formulation of the problem, effects of adding noise to both input and output signals of nonlinear blocks and disturbance to linear block, in the emerged equations are discussed. Additionally, the possible parametric form of matrix operations to reduce the equation size is presented. To analyse the possible solutions to the mentioned system of equations, a method to reduce the difference between the number of equations and number of unknown variables by formulate and importing existing knowledge about nonlinear functions is presented. Obtained equations are applied to an instance H–W system to validate the results and illustrate the proposed method.Keywords: Identification, Hammerstein-Wiener, optimization, quantization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 792