Search results for: block world problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 5416

Search results for: block world problem

4786 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 1796
4785 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 2164
4784 Research on the Protection and Reuse Model of Historical Buildings in Chinese Airports

Authors: Jie Ouyang, Chen Nie

Abstract:

China had constructed a large number of military and civilian airports before and after World War II, and then began large-scale repairs, reconstructions or relocation of airports after the baptism of wars after World War I and World War II. The airport's historical area and its historical buildings such as terminals, hangars, and towers have adopted different protection strategies and reuse application strategies. This paper is based on the judgment of the value of airport historical buildings to study different protection and reuse strategies. The protection and reuse models of historical buildings are classified in three dimensions: the airport historical area, the airport historical building complex and its individual buildings, and combined with specific examples to discuss and summarize the technical characteristics, protection strategies and successful experiences of different modes of protection and reuse of historical areas and historical buildings of airports.

Keywords: Airport, airport area, historic airport building, protection, reuse model.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 653
4783 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 1004
4782 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 2183
4781 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 327
4780 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 1713
4779 Visual Identity Components of Tourist Destination

Authors: Petra Barisic, Zrinka Blazevic

Abstract:

In the world of modern communications, visual identity has predominant influence on the overall success of tourist destinations, but despite of these, the problem of designing thriving tourist destination visual identity and their components are hardly addressed. This study highlights the importance of building and managing the visual identity of tourist destination, and based on the empirical study of well-known Mediterranean destination of Croatia analyses three main components of tourist destination visual identity; name, slogan, and logo. Moreover, the paper shows how respondents perceive each component of Croatia’s visual identity. According to study, logo is the most important, followed by the name and slogan. Research also reveals that Croatian economy lags behind developed countries in understanding the importance of visual identity, and its influence on marketing goal achievements.

Keywords: Components of visual identity, Croatia, tourist destination, visual identity.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3475
4778 Conceptual Multidimensional Model

Authors: Manpreet Singh, Parvinder Singh, Suman

Abstract:

The data is available in abundance in any business organization. It includes the records for finance, maintenance, inventory, progress reports etc. As the time progresses, the data keep on accumulating and the challenge is to extract the information from this data bank. Knowledge discovery from these large and complex databases is the key problem of this era. Data mining and machine learning techniques are needed which can scale to the size of the problems and can be customized to the application of business. For the development of accurate and required information for particular problem, business analyst needs to develop multidimensional models which give the reliable information so that they can take right decision for particular problem. If the multidimensional model does not possess the advance features, the accuracy cannot be expected. The present work involves the development of a Multidimensional data model incorporating advance features. The criterion of computation is based on the data precision and to include slowly change time dimension. The final results are displayed in graphical form.

Keywords: Multidimensional, data precision.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1446
4777 Fundamental Problems in the Operation of the Automotive Parts Industry Small and Medium Businesses in Bangkok and Surrounding Provinces

Authors: P. Thepnarintra

Abstract:

The purposes of this study were to: 1) investigate operation conditions of SME automotive part industry in Bangkok and vicinity and 2) to compare operation problem levels of SME automotive part industry in Bangkok and vicinity according to the sizes of the enterprises. Samples in this study included 196 entrepreneurs of SME automotive part industry in Bangkok and vicinity derived from simple random sampling and calculation from R. V. Krejcie and D. W. Morgan’s tables. Research statistics included frequency, percentage, mean, standard deviation, and T-test. The results revealed that in general the problem levels of SME automotive part industry in Bangkok and vicinity were high. When considering in details, it was found that the problem levels were high at every aspect, i.e. personal, production, export, finance, and marketing respectively. The comparison of the problem levels according to the sizes of the enterprises revealed statistically significant differences at .05. When considering on each aspect, it was found that the aspect with the statistical difference at .05 included 5 aspects, i.e. production, marketing, finance, personal, and export. The findings also showed that small enterprises faced more severe problems than those of medium enterprises.

Keywords: Automotive part industry, operation problems, SME, perimeter.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1587
4776 Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method

Authors: Miloš Šeda

Abstract:

Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.

Keywords: Boolean algebra, Karnaugh map, Quine-McCluskey method, set covering problem, genetic algorithm.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2787
4775 Combining Ant Colony Optimization and Dynamic Programming for Solving a Dynamic Facility Layout Problem

Authors: A. Udomsakdigool, S. Bangsaranthip

Abstract:

This paper presents an algorithm which combining ant colony optimization in the dynamic programming for solving a dynamic facility layout problem. The problem is separated into 2 phases, static and dynamic phase. In static phase, ant colony optimization is used to find the best ranked of layouts for each period. Then the dynamic programming (DP) procedure is performed in the dynamic phase to evaluate the layout set during multi-period planning horizon. The proposed algorithm is tested over many problems with size ranging from 9 to 49 departments, 2 and 4 periods. The experimental results show that the proposed method is an alternative way for the plant layout designer to determine the layouts during multi-period planning horizon.

Keywords: Ant colony optimization, Dynamicprogramming, Dynamic facility layout planning, Metaheuristic

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1936
4774 Starting Pitcher Rotation in the Chinese Professional Baseball League based on AHP and TOPSIS

Authors: Chih-Cheng Chen, Meng-Lung Lin, Yung-Tan Lee, Tien-Tze Chen

Abstract:

The rotation of starting pitchers is a strategic issue which has a significant impact on the performance of a professional team. Choosing an optimal starting pitcher from among many alternatives is a multi-criteria decision-making (MCDM) problem. In this study, a model using the Analytic Hierarchy Process (AHP) and Technique for Order Performance by Similarity to the Ideal Solution (TOPSIS) is proposed with which to arrange the starting pitcher rotation for teams of the Chinese Professional Baseball League. The AHP is used to analyze the structure of the starting pitcher selection problem and to determine the weights of the criteria, while the TOPSIS method is used to make the final ranking. An empirical analysis is conducted to illustrate the utilization of the model for the starting pitcher rotation problem. The results demonstrate the effectiveness and feasibility of the proposed model.

Keywords: AHP, TOPSIS, starting pitcher rotation, CPBL

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2347
4773 Effective Online Staff Training: Is This Possible?

Authors: C. Rogerson, E. Scott

Abstract:

The purpose of this paper is to consider the introduction of online courses to replace the current classroom-based staff training. The current training is practical, and must be completed before access to the financial computer system is authorized. The long term objective is to measure the efficacy, effectiveness and efficiency of the training, and to establish whether a transfer of knowledge back to the workplace has occurred. This paper begins with an overview explaining the importance of staff training in an evolving, competitive business environment and defines the problem facing this particular organization. A summary of the literature review is followed by a brief discussion of the research methodology and objective. The implementation of the alpha version of the online course is then described. This paper may be of interest to those seeking insights into, or new theory regarding, practical interventions of online learning in the real world.

Keywords: Computer-based courses, e-learning, online training, workplace training.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1674
4772 Maximizing Sum-Rate for Multi-User Two-Way Relaying Networks with ANC Protocol

Authors: Muhammad Abrar, Xiang Gui, Amal Punchihewa

Abstract:

In this paper we study the resource allocation problem for an OFDMA based cooperative two-way relaying (TWR) network. We focus on amplify and forward (AF) analog network coding (ANC) protocol. An optimization problem for two basic resources namely, sub-carrier and power is formulated for multi-user TWR networks. A joint optimal optimization problem is investigated and two-step low complexity sub-optimal resource allocation algorithm is proposed for multi-user TWR networks with ANC protocol. The proposed algorithm has been evaluated in term of total achievable system sum-rate and achievable individual sum-rate for each userpair. The good tradeoff between system sum-rate and fairness is observed in the two-step proportional resource allocation scheme.

Keywords: Relay Network, Relay Protocols, Resource Allocation, Two –way relaying.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1652
4771 Contact Stress on the Surface of Gear Teeth with Different Profile

Authors: K. Farhangdoost, H. Heirani

Abstract:

Contact stress is an important problem in industry. This is a problem that in the first attention may be don-t appears, but disregard of these stresses cause a lot of damages in machines. These stresses occur at locations such as gear teeth, bearings, cams and between a locomotive wheel and the railroad rail. These stresses cause failure by excessive elastic deformation, yielding and fracture. In this paper we intend show the effective parameters in contact stress and ponder effect of curvature. In this paper we study contact stresses on the surface of gear teeth and compare these stresses for four popular profiles of gear teeth (involute, cycloid, epicycloids, and hypocycloid). We study this problem with mathematical and finite element methods and compare these two methods on different profile surfaces.

Keywords: Contact stress, Cycloid, Epicycloids, Finite element, Gear, Hypocycloid, Involute, Radius of curvature.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1665
4770 Simulink Approach to Solve Fuzzy Differential Equation under Generalized Differentiability

Authors: N. Kumaresan , J. Kavikumar, Kuru Ratnavelu

Abstract:

In this paper, solution of fuzzy differential equation under general differentiability is obtained by simulink. The simulink solution is equivalent or very close to the exact solution of the problem. Accuracy of the simulink solution to this problem is qualitatively better. An illustrative numerical example is presented for the proposed method.

Keywords: Fuzzy differential equation, Generalized differentiability, H-difference and Simulink.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2427
4769 The Fundamental Reliance of Iterative Learning Control on Stability Robustness

Authors: Richard W. Longman

Abstract:

Iterative learning control aims to achieve zero tracking error of a specific command. This is accomplished by iteratively adjusting the command given to a feedback control system, based on the tracking error observed in the previous iteration. One would like the iterations to converge to zero tracking error in spite of any error present in the model used to design the learning law. First, this need for stability robustness is discussed, and then the need for robustness of the property that the transients are well behaved. Methods of producing the needed robustness to parameter variations and to singular perturbations are presented. Then a method involving reverse time runs is given that lets the world behavior produce the ILC gains in such a way as to eliminate the need for a mathematical model. Since the real world is producing the gains, there is no issue of model error. Provided the world behaves linearly, the approach gives an ILC law with both stability robustness and good transient robustness, without the need to generate a model.

Keywords: Iterative learning control, stability robustness, monotonic convergence.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1591
4768 Collaborative E-Learning with Multiple Imaginary Co-Learner: Design, Issues and Implementation

Authors: Melvin Ballera, Mosbah Mohamed Elssaedi, Ahmed Khalil Zohdy

Abstract:

Collaborative problem solving in e-learning can take in the form of discussion among learner, creating a highly social learning environment and characterized by participation and interactivity. This paper, designed a collaborative learning environment where agent act as co-learner, can play different roles during interaction. Since different roles have been assigned to the agent, learner will assume that multiple co-learner exists to help and guide him all throughout the collaborative problem solving process, but in fact, alone during the learning process. Specifically, it answers the questions what roles of the agent should be incorporated to contribute better learning outcomes, how agent will facilitate the communication process to provide social learning and interactivity and what are the specific instructional strategies that facilitate learner participation, increased skill acquisition and develop critical thinking.

Keywords: Collaborative e-learning, collaborative problem solving, , imaginary co-learner, social learning.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1588
4767 Review of Various Designs and Development in Hydropower Turbines

Authors: F. Behrouzi, A. Maimun, M. Nakisa

Abstract:

The growth of population, rising fossil fuel prices (limited and decreasing day by day), pollution problem due to use of fossil fuels and increasing electrical demand are important factors that encourage the use of green and renewable energy technologies. Among the different renewable energy technologies, hydro power generation (large and small scale) is the prime choice in terms of contribution to the world's electricity generation by using water current turbines. Currently, researchers mainly focused on design and development of different kind of turbines to capture hydropower to generate electricity as clean and reliable energy. This paper is a review of the status of research on water current turbines carried out to generate electricity from hydrokinetic energy especially in places where there is no electricity, but there is access to flowing water.

Keywords: Turbines, Renewable Energy, Hydropower.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 4562
4766 An Approach towards Designing an Energy Efficient Building through Embodied Energy Assessment: A Case of Apartment Building in Composite Climate

Authors: Ambalika Ekka

Abstract:

In today’s world, the growing demand for urban built forms has resulted in the production and consumption of building materials i.e. embodied energy in building construction, leading to pollution and greenhouse gas (GHG) emissions. Therefore, new buildings will offer a unique opportunity to implement more energy efficient building without compromising on building performance of the building. Embodied energy of building materials forms major contribution to embodied energy in buildings. The paper results in an approach towards designing an energy efficient apartment building through embodied energy assessment. This paper discusses the trend of residential development in Rourkela, which includes three case studies of the contemporary houses, followed by architectural elements, number of storeys, predominant material use and plot sizes using primary data. It results in identification of predominant material used and other characteristics in urban area. Further, the embodied energy coefficients of various dominant building materials and alternative materials manufactured in Indian Industry is taken in consideration from secondary source i.e. literature study. The paper analyses the embodied energy by estimating materials and operational energy of proposed building followed by altering the specifications of the materials based on the building components i.e. walls, flooring, windows, insulation and roof through res build India software and comparison of different options is assessed with consideration of sustainable parameters. This paper results that autoclaved aerated concrete block only reaches the energy performance Index benchmark i.e. 69.35 kWh/m2 yr i.e. by saving 4% of operational energy and as embodied energy has no particular index, out of all materials it has the highest EE 23206202.43  MJ.

Keywords: Energy efficient, embodied energy, energy performance index, building materials.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 981
4765 Cryptography Over Elliptic Curve Of The Ring Fq[e], e4 = 0

Authors: Chillali Abdelhakim

Abstract:

Groups where the discrete logarithm problem (DLP) is believed to be intractable have proved to be inestimable building blocks for cryptographic applications. They are at the heart of numerous protocols such as key agreements, public-key cryptosystems, digital signatures, identification schemes, publicly verifiable secret sharings, hash functions and bit commitments. The search for new groups with intractable DLP is therefore of great importance.The goal of this article is to study elliptic curves over the ring Fq[], with Fq a finite field of order q and with the relation n = 0, n ≥ 3. The motivation for this work came from the observation that several practical discrete logarithm-based cryptosystems, such as ElGamal, the Elliptic Curve Cryptosystems . In a first time, we describe these curves defined over a ring. Then, we study the algorithmic properties by proposing effective implementations for representing the elements and the group law. In anther article we study their cryptographic properties, an attack of the elliptic discrete logarithm problem, a new cryptosystem over these curves.

Keywords: Elliptic Curve Over Ring, Discrete Logarithm Problem.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3573
4764 The Potential Use of Nanofilters to Supply Potable Water in Persian Gulf and Oman Sea Watershed Basin

Authors: Sara Zamani, Mojtaba Fazeli, Abdollah Rashidi Mehrabadi

Abstract:

In a world worried about water resources with the shadow of drought and famine looming all around, the quality of water is as important as its quantity. The source of all concerns is the constant reduction of per capita quality water for different uses. Iran With an average annual precipitation of 250 mm compared to the 800 mm world average, Iran is considered a water scarce country and the disparity in the rainfall distribution, the limitations of renewable resources and the population concentration in the margins of desert and water scarce areas have intensified the problem. The shortage of per capita renewable freshwater and its poor quality in large areas of the country, which have saline, brackish or hard water resources, and the profusion of natural and artificial pollutant have caused the deterioration of water quality. Among methods of treatment and use of these waters one can refer to the application of membrane technologies, which have come into focus in recent years due to their great advantages. This process is quite efficient in eliminating multi-capacity ions; and due to the possibilities of production at different capacities, application as treatment process in points of use, and the need for less energy in comparison to Reverse Osmosis processes, it can revolutionize the water and wastewater sector in years to come. The article studied the different capacities of water resources in the Persian Gulf and Oman Sea watershed basins, and processes the possibility of using nanofiltration process to treat brackish and non-conventional waters in these basins.

Keywords: Membrane processes, saline waters, brackish waters, hard waters, zoning water quality in the Persian Gulf and the Oman Sea Watershed area, nanofiltration.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1943
4763 Further the Effectiveness of Software Testability Measure

Authors: Liang Zhao, Feng Wang, Bo Deng, Bo Yang

Abstract:

Software testability is proposed to address the problem of increasing cost of test and the quality of software. Testability measure provides a quantified way to denote the testability of software. Since 1990s, many testability measure models are proposed to address the problem. By discussing the contradiction between domain testability and domain range ratio (DRR), a new testability measure, semantic fault distance, is proposed. Its validity is discussed.

Keywords: Software testability, DRR, Domain testability.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2039
4762 Construction Methods for Sign Patterns Allowing Nilpotence of Index k

Authors: Jun Luo

Abstract:

In this paper, the smallest such integer k is called by the index (of nilpotence) of B such that Bk = 0. In this paper, we study sign patterns allowing nilpotence of index k and obtain four methods to construct sign patterns allowing nilpotence of index at most k, which generalizes some recent results.

Keywords: Sign pattern, Nilpotence, Jordan block.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1643
4761 Completion Latin Square for Wavelength Routing

Authors: Ali Habiboghli, Rouhollah Mostafaei, Vasif Nabiyev

Abstract:

Optical network uses a tool for routing called Latin router. These routers use particular algorithms for routing. For example, we can refer to LDF algorithm that uses backtracking (one of CSP methods) for problem solving. In this paper, we proposed new approached for completion routing table (DRA&CRA algorithm) and compare with pervious proposed ways and showed numbers of backtracking, blocking and run time for DRA algorithm less than LDF and CRA algorithm.

Keywords: Latin Router, Constraint Satisfaction Problem, Wavelength Routing.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1647
4760 Multimachine Power System Stabilizers Design Using PSO Algorithm

Authors: H. Shayeghi, A. Safari, H. A. Shayanfar

Abstract:

In this paper, multiobjective design of multi-machine Power System Stabilizers (PSSs) using Particle Swarm Optimization (PSO) is presented. The stabilizers are tuned to simultaneously shift the lightly damped and undamped electro-mechanical modes of all machines to a prescribed zone in the s-plane. A multiobjective problem is formulated to optimize a composite set of objective functions comprising the damping factor, and the damping ratio of the lightly damped electromechanical modes. The PSSs parameters tuning problem is converted to an optimization problem which is solved by PSO with the eigenvalue-based multiobjective function. The proposed PSO based PSSs is tested on a multimachine power system under different operating conditions and disturbances through eigenvalue analysis and some performance indices to illustrate its robust performance.

Keywords: PSS Design, Particle Swarm Optimization, Dynamic Stability, Multiobjective Optimization.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2637
4759 An Optimal Control Problem for Rigid Body Motions on Lie Group SO(2, 1)

Authors: Nemat Abazari, Ilgin Sager

Abstract:

In this paper smooth trajectories are computed in the Lie group SO(2, 1) as a motion planning problem by assigning a Frenet frame to the rigid body system to optimize the cost function of the elastic energy which is spent to track a timelike curve in Minkowski space. A method is proposed to solve a motion planning problem that minimize the integral of the square norm of Darboux vector of a timelike curve. This method uses the coordinate free Maximum Principle of Optimal control and results in the theory of integrable Hamiltonian systems. The presence of several conversed quantities inherent in these Hamiltonian systems aids in the explicit computation of the rigid body motions.

Keywords: Optimal control, Hamiltonian vector field, Darboux vector, maximum principle, lie group, Rigid body motion, Lorentz metric.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1326
4758 Cognition Technique for Developing a World Music

Authors: Haider Javed Uppal, Javed Yunas Uppal

Abstract:

In today's globalized world, it is necessary to develop a form of music that is able to evoke equal emotional responses among people from diverse cultural backgrounds. Indigenous cultures throughout history have developed their own music cognition, specifically in terms of the connections between music and mood. With the advancements in artificial intelligence technologies, it has become possible to analyze and categorize music features such as timbre, harmony, melody, and rhythm, and relate them to the resulting mood effects experienced by listeners. This paper presents a model that utilizes a screenshot translator to convert music from different origins into waveforms, which are then analyzed using machine learning and information retrieval techniques. By connecting these waveforms with Thayer's matrix of moods, a mood classifier has been developed using fuzzy logic algorithms to determine the emotional impact of different types of music on listeners from various cultures.

Keywords: Cognition, world music, artificial intelligence, Thayer’s matrix.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 113
4757 A New Heuristic Approach for the Large-Scale Generalized Assignment Problem

Authors: S. Raja Balachandar, K.Kannan

Abstract:

This paper presents a heuristic approach to solve the Generalized Assignment Problem (GAP) which is NP-hard. It is worth mentioning that many researches used to develop algorithms for identifying the redundant constraints and variables in linear programming model. Some of the algorithms are presented using intercept matrix of the constraints to identify redundant constraints and variables prior to the start of the solution process. Here a new heuristic approach based on the dominance property of the intercept matrix to find optimal or near optimal solution of the GAP is proposed. In this heuristic, redundant variables of the GAP are identified by applying the dominance property of the intercept matrix repeatedly. This heuristic approach is tested for 90 benchmark problems of sizes upto 4000, taken from OR-library and the results are compared with optimum solutions. Computational complexity is proved to be O(mn2) of solving GAP using this approach. The performance of our heuristic is compared with the best state-ofthe- art heuristic algorithms with respect to both the quality of the solutions. The encouraging results especially for relatively large size test problems indicate that this heuristic approach can successfully be used for finding good solutions for highly constrained NP-hard problems.

Keywords: Combinatorial Optimization Problem, Generalized Assignment Problem, Intercept Matrix, Heuristic, Computational Complexity, NP-Hard Problems.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2338