Search results for: imperialist competitive algorithm

Authors: Ousmane Youme, Jean Marie Dembele, Eugene Ezin, Christophe Cambier

Abstract:

In recent years, the convolutional neural networks (CNN) architectures designed by evolution algorithms have proven to be competitive with handcrafted architectures designed by experts. However, these algorithms need a lot of computational power, which is beyond the capabilities of most researchers and engineers. To overcome this problem, we propose an evolution architecture under length constraints. It consists of two algorithms: a search length strategy to find an optimal space and a search architecture strategy based on a genetic algorithm to find the best individual in the optimal space. Our algorithms drastically reduce resource costs and also keep good performance. On the Cifar-10 dataset, our framework presents outstanding performance with an error rate of 5.12% and only 4.6 GPU a day to converge to the optimal individual -22 GPU a day less than the lowest cost automatic evolutionary algorithm in the peer competition.

Keywords: CNN architecture, genetic algorithm, evolution algorithm, length constraints

Procedia PDF Downloads 95

Authors: Samaneh Pouyanfar, Michael Oliff

Abstract:

Nowadays, customer satisfaction and discovering the superior services, are counted as vital issues in most manufacturing and services companies. In these terms, gaining the competitive advantage by a business depends on products and services which are able to cause the customer satisfaction. Given the importance of this subject, this paper tries to investigate the correlation between components of customer satisfaction and gaining the competitive advantage by the business. For this purpose, after reviewing the research literature and doing deep interviews with authors and active people in the industry, based on the variables affecting the customer satisfaction and determinant components of business competitive advantage, research questionnaire was prepared. In sum, 96 executives of PARS-KHAZAR Company were asked in a survey. The results of P.L.S. Test for the research structure analysis showed that the measuring tools in terms of technical features, like convergent and divergent validity and compound reliability were very appropriate. Moreover the results showed that, the structure of products and factors related to foundation, has affected the competitive advantage performance positively and significantly; but the influence of structure of services and business environment on competitive advantage was not confirmed.

Keywords: customer satisfaction, competitive advantage, products, foundation, home appliances

Procedia PDF Downloads 250

Authors: Somdech Rungsrisawas

Abstract:

The objectives of this study are to examine the relationship between the competitive advantage of small and medium enterprises (SMEs) and their overall performance. A mixed method has been applied to identify the effect of determinants toward competitive advantage. The sample is composed of SMEs in product and service businesses. The study has been tested at an organizational level with samples of SME entrepreneurs, business successors, and board of directors or management team. Quantitative analysis has been conducted through multiple regression analysis with 400 samples. The findings illustrate that each aspect of competitive advantage needs a different set of driving factors to explain either the direct or the indirect effect on firm performance. Interestingly, technological capability is a perfect mediator and interorganizational cooperation toward competitive advantage. In addition, differentiation is difficult to be perceived by customers, as well as difficult to manage; however, it is considered important to develop an SMEs product or service for firm sustainably.

Keywords: competitive advantage, firm performance, technological capability, Small and Medium Enterprise (SMEs)

Procedia PDF Downloads 266

Authors: Gaohuizi Guo, Ning Zhang

Abstract:

Firefly algorithm (FA) and Sine Cosine algorithm (SCA) are two very popular and advanced metaheuristic algorithms. However, these algorithms applied to multi-objective optimization problems have some shortcomings, respectively, such as premature convergence and limited exploration capability. Combining the privileges of FA and SCA while avoiding their deficiencies may improve the accuracy and efficiency of the algorithm. This paper proposes a hybridization of FA and SCA algorithms, named multi-objective firefly-sine cosine algorithm (MFA-SCA), to develop a more efficient meta-heuristic algorithm than FA and SCA.

Keywords: firefly algorithm, hybrid algorithm, multi-objective optimization, sine cosine algorithm

Procedia PDF Downloads 131

Authors: Safeer Hussain Khan

Abstract:

In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corresponding results proved for the above three iterative algorithms to a class of more general operators. At the end, we remark that nothing prevents us to extend our result to the case of the iterative algorithm with error terms.

Keywords: contractive-like operator, iterative algorithm, fixed point, strong convergence

Procedia PDF Downloads 514

Authors: Zhoucheng Bao, Haiyan Zhu, Tingting Pang, Zuling Wang

Abstract:

This paper proposes a multi-population DE with adaptive mutation and local search for global optimization, named AMMADE. In order to better coordinate the cooperation between the populations and the rational use of resources. In AMMADE, the population is divided based on the Euclidean distance sorting method at each generation to appropriately coordinate the cooperation between subpopulations and the usage of resources, such that the best-performed subpopulation will get more computing resources in the next generation. Further, an adaptive local search strategy is employed on the best-performed subpopulation to achieve a balanced search. The proposed algorithm has been tested by solving optimization problems taken from CEC2014 benchmark problems. Experimental results show that our algorithm can achieve a competitive or better than related methods. The results also confirm the significance of devised strategies in the proposed algorithm.

Keywords: differential evolution, multi-mutation strategies, memetic algorithm, adaptive local search

Procedia PDF Downloads 118

Authors: Hassan Habibi, Hossein Soltani, Amir Moghadam, Najmeh Bakhshi

Abstract:

The purpose of this study was to compare competitive state anxiety among elite and non-elite futsal players and its relationship with situational factors. 130 non-elite and 70 elite male futsal players participated in the study. Competitive State Anxiety Inventory-2 and situational factors Inventory were applied. Data was analyzed using one-way ANOVA and product moment correlation. Results showed there was significant difference between competitive state anxiety subscales (cognitive anxiety somatic anxiety & self-confidence) and situational factors among elite and non-elite futsal players (P<0.05) but there was no significant correlations between situational factors subscales among elite and non-elite futsal players (P<0.05).

Keywords: competitive state anxiety, situational factors, elite players, non-elite players

Procedia PDF Downloads 620

Authors: Xu LiYun, Briand Florent, Fan GuoLiang

Abstract:

The loop-layout design problem (LLDP) aims at optimizing the sequence of positioning of the machines around the cyclic production line. Traffic congestion is the usual criteria to minimize in this type of problem, i.e. the number of additional cycles spent by each part in the network until the completion of its required routing sequence of machines. This paper aims at applying several improvements mechanisms such as a positioned-based crossover operator for the Genetic Algorithm (GA) called a Two Points Crossover (TPC) and an offspring selection process. The performance of the improved GA is measured using well-known examples from literature and compared to other evolutionary algorithms. Good results show that GA can still be competitive for this type of problem against more recent evolutionary algorithms.

Keywords: crossover, genetic algorithm, layout design problem, loop-layout, manufacturing optimization

Procedia PDF Downloads 240

Authors: Phatthanan Chaiyabut

Abstract:

This research paper investigates whether the development of environmentally friendly practices by luxury hotel resorts can be used as a strategy for gaining competitive advantage through differentiation, and suggests ways to do it. The focus is on luxury hotel resorts in Samut Songkram Province, Thailand. A questionnaire was utilized as a tool to collect data. Statistics utilized in this research included frequency, percentage, mean, standard deviation, and multiple regression analysis. Findings indicate that environmentally friendly development of hotel resorts in Samut Songkram Province has a very limited use as a corporate strategy. Only two luxury hotel resorts had it incorporated in their strategy, it is not much used in marketing indicating environmental issues are not seen as important. This was confirmed through the interviews with the managers that it is not seen as important issue to promote.

Keywords: competitive advantage, competitive strategy, Samut Songkram Province, hotel and resort

Procedia PDF Downloads 248

Authors: Salim Al Harthy, Alexandre A. Bachkirov

Abstract:

This study delves into the complexities of competitive aggressiveness in the oil and gas industry, focusing on the characteristics of the identified competitive actions. The current quantitative research on competitive aggressiveness lacks agreement on the connection between antecedents and outcomes, prompting a qualitative investigation. To address this gap, the research utilizes qualitative interviews with CEOs from Oman's oil and gas service industry to explore the dynamics of competitive aggressiveness. Using Noklenain's typology, the study categorizes and analyzes identified actions, shedding light on the spectrum of competitive behaviors within the industry. Notably, actions predominantly fall under the "Bring about" and "Preserve" elements, with a notable absence in the "Forebear" and "Destroy" categories, possibly linked to the study's focus on service-oriented businesses. The study also explores the detectability of actions, revealing that "Bring about" actions are detectable, while those in "Preserve" and "Suppress" are not. This challenges conventional definitions of competitive aggressiveness, suggesting that not all actions are readily detectable despite being considered competitive. The presence of non-detectable actions introduces complexity to measurement methods reliant on visible empirical data. Moreover, the study contends that companies can adopt an aggressive competitive approach without directly challenging rivals. This challenges traditional views and emphasizes the innovative and entrepreneurial aspects of actions not explicitly aimed at competitors. By not revealing strategic intentions, such actions put rivals at a disadvantage, underscoring the need for a nuanced understanding of competitive aggressiveness. In summary, the lack of consensus in existing literature regarding the relationship between antecedents and outcomes in competitive aggressiveness is addressed. The study reveals a spectrum of detectable and undetectable actions, posing challenges in measurement and emphasizing the need for alternative methods to assess undetectable actions in competitive behavior. This research contributes to a more nuanced understanding of competitive aggressiveness, acknowledging the diverse actions shaping a company's strategic positioning in dynamic business environments.

Keywords: competitive aggressiveness, qualitative exploration, noklenain's typology, oil and gas industry

Procedia PDF Downloads 13

Authors: Umer Mukhtar

Abstract:

Supply Chain Competitiveness is the capability of a supply chain to deliver value to the customer for the sake of competitive advantage. Service Performance and Quality intervene between supply chain actors including functions inside the firm in a significant way for the supply chain to achieve a competitive position in the market to gain competitive advantage. Supply Chain competitiveness is the current issue of interest because of supply chains’ competition for competitive advantage rather than firms’. A proposed theoretical model is developed by extracting and integrating different theories to pursue further inquiry based on case studies and survey design. It is also intended to develop a scale of service performance for functions of the focal firm that is a revolving center for a whole supply chain.

Keywords: supply chain competitiveness, service performance in supply chain, service quality in supply chain, competitive advantage by supply chain, networks and supply chain, customer value, value supply chain, value chain

Procedia PDF Downloads 571

Authors: Hari Om Kashyap, Rohit Gurudas Maulingkar

Abstract:

The aim of the study was to compare sports competition anxiety levels between male and female college athletes of Ponda City. A total number of 50 athletes were selected as a subject for this research, where 25 male athletes and 25 female athletes of age between 18 to 22 years were selected. The purposive method was used for the selection of samples from Ponda city. Sports Competitive Anxiety Test (SCAT) by R. Martin, 1990, was used for data collection. For comparing Sports Competitive Anxiety between male and female college athletes independent “t” test was applied at a 0.05 level of significance. The result of the study indicates that the p-value is .013178, and the result is significant at p<.05, which means there was a significant difference found in sports competitive anxiety between male athletes and female athletes who are taking part in various intercollegiate sports competitions.

Keywords: competitive anxiety, athlete, male, female

Procedia PDF Downloads 67

Authors: Abdullah Eqal Al Mazrooei

Abstract:

In this paper, we introduce a mathematical algorithm which is used for estimating the states in the bilinear systems. This algorithm uses a special linearization of the second-order term by using the best available information about the state of the system. This technique makes our algorithm generalizes the well-known Kalman estimators. The system which is used here is of the bilinear class, the evolution of this model is linear-bilinear in the state of the system. Our algorithm can be used with linear and bilinear systems. We also here introduced a real application for the new algorithm to prove the feasibility and the efficiency for it.

Keywords: estimation algorithm, bilinear systems, Kakman filter, second order linearization

Procedia PDF Downloads 447

Authors: Mohammed A. Zidan, Alaa Sagheer, Nasser Metwally

Abstract:

Real-time learning is an important goal that most of artificial intelligence researches try to achieve it. There are a lot of problems and applications which require low cost learning such as learn a robot to be able to classify and recognize patterns in real time and real-time recall. In this contribution, we suggest a model of quantum competitive learning based on a series of quantum gates and additional operator. The proposed model enables to recognize any incomplete patterns, where we can increase the probability of recognizing the pattern at the expense of the undesired ones. Moreover, these undesired ones could be utilized as new patterns for the system. The proposed model is much better compared with classical approaches and more powerful than the current quantum competitive learning approaches.

Keywords: competitive learning, quantum gates, quantum gates, winner-take-all

Procedia PDF Downloads 436

Authors: Khanita Tumphasuwan

Abstract:

The Wualai community of Northern Thailand represents important intellectual and social capital and their silver handicraft products are desirable tourist souvenirs within Chiang Mai Province. This community has been in danger of losing this social and intellectual capital due to the application of an improper tool, the Scottish Enterprise model of clustering. This research aims to analyze and increase its competitive advantages for preventing the loss of social and intellectual capital. To improve the Wualai’s competitive advantage, analysis is undertaken using a Porterian cluster approach, including the diamond model, five forces model and cluster mapping. Research results suggest that utilizing the community’s Buddhist beliefs can foster collaboration between community members and is the only way to improve cluster effectiveness, increase competitive advantage, and in turn conserve the Wualai community.

Keywords: industry clustering, silver handicraft, competitive advantage, intellectual capital, social capital

Procedia PDF Downloads 519

Authors: Nassiri Khalid, El Hibaoui Abdelaaziz et Hajar Moha

Abstract:

In this paper, we introduce and analyse a probabilistic distributed algorithm for a construction of a minimum spanning tree on network. This algorithm is based on the handshake concept. Firstly, each network node is considered as a sub-spanning tree. And at each round of the execution of our algorithm, a sub-spanning trees are merged. The execution continues until all sub-spanning trees are merged into one. We analyze this algorithm by a stochastic process.

Keywords: Spanning tree, Distributed Algorithm, Handshake Algorithm, Matching, Probabilistic Analysis

Procedia PDF Downloads 629

Authors: Mateusz Rak

Abstract:

Objective: The paper aims to present various sources of competitive advantage which may occur when an enterprise strategically applies its concept of corporate philanthropy. Methodology: The review of the literature and available reports on the research regarding corporate philanthropy. Results: Strategic philanthropy is a positive phenomenon. Unfortunately, enterprises in Poland do not see all positive sides of such activities yet. Three kinds of corporate philanthropy may be described. They are to fulfil a social duty, improve the company reputation and gain a competitive edge. Practical implications: Showing enterprises the advantages of taking philanthropic actions, in particular, a large role of strategic philanthropy in gaining a competitive edge in the market as well as how to avoid negative consequences of corporate philanthropy. The paper presents corporate philanthropy on a few layers: as a CSR element, actions generating values in products, actions improving a corporate image in the market, altruist actions of employees.

Keywords: corporate philanthropy, corporate social responsibility, corporate foundations, CSR

Procedia PDF Downloads 218

Authors: Kang-Mo Jung

Abstract:

Least squares support vector machine (LS-SVM) is a penalized regression which considers both fitting and generalization ability of a model. However, the squared loss function is very sensitive to even single outlier. We proposed a weighted absolute deviation loss function for the robustness of the estimates in least absolute deviation support vector machine. The proposed estimates can be obtained by a quadratic programming algorithm. Numerical experiments on simulated datasets show that the proposed algorithm is competitive in view of robustness to outliers.

Keywords: least absolute deviation, quadratic programming, robustness, support vector machine, weight

Procedia PDF Downloads 490

Authors: Ismail El Gayar, Ossama Ismail, Yousri El Gamal

Abstract:

This paper presented a technique to solve one of the transportation problems that faces us in real life which is the Bus Scheduling Problem. Most of the countries using buses in schools, companies and traveling offices as an example to transfer multiple passengers from many places to specific place and vice versa. This transferring process can cost time and money, so we build a decision support system that can solve this problem. In this paper, a genetic algorithm with the shortest path technique is used to generate a competitive solution to other well-known techniques. It also presents a comparison between our solution and other solutions for this problem.

Keywords: bus scheduling problem, decision support system, genetic algorithm, shortest path

Procedia PDF Downloads 370

Authors: Vishnu Pratap Singh Kirar

Abstract:

Artificial Neural Network (ANN) can be trained using backpropagation (BP). It is the most widely used algorithm for supervised learning with multi-layered feed-forward networks. Efficient learning by the BP algorithm is required for many practical applications. The BP algorithm calculates the weight changes of artificial neural networks, and a common approach is to use a two-term algorithm consisting of a learning rate (LR) and a momentum factor (MF). The major drawbacks of the two-term BP learning algorithm are the problems of local minima and slow convergence speeds, which limit the scope for real-time applications. Recently the addition of an extra term, called a proportional factor (PF), to the two-term BP algorithm was proposed. The third increases the speed of the BP algorithm. However, the PF term also reduces the convergence of the BP algorithm, and criteria for evaluating convergence are required to facilitate the application of the three terms BP algorithm. Although these two seem to be closely related, as described later, we summarize various improvements to overcome the drawbacks. Here we compare the different methods of convergence of the new three-term BP algorithm.

Keywords: neural network, backpropagation, local minima, fast convergence rate

Procedia PDF Downloads 465

Authors: T. Niracharapa, W. Angkana

Abstract:

Since information and communication technology (ICT) plays a critical role in enhancing national competitiveness, it is a driving force for social and economic growth and prosperity. The ASEAN Economic Community (AEC) will integrate this into ASEAN countries as a new mechanism and a measure that will improve economic performance as a global economy. Government policies may support or impede such harmonization. This study was to investigate, analyze the status of Thai IT entrepreneurs and define key strategies to enhance their competitive advantage. Data were collected based on in-depth interviews, questionnaires, focus groups, seminars and fieldwork on information technology excluding communication. SWOT was used as a tool to analyze the study. The results of this study can be used to enable the government to guide policy, measures and strategies for creating a competitive advantage for Thailand’s IT entrepreneurs in the global market.

Keywords: AEC, ASEAN, competitive advantage, IT entrepreneurs

Procedia PDF Downloads 324

Authors: Kevin Worrall, Euan McGookin

Abstract:

The use of optimization algorithms is common across a large number of diverse fields. This work presents the use of a hybrid optimization algorithm applied to a mobile robot tasked with carrying out a search of an unknown environment. The algorithm is then applied to the multiple robots case, which results in a reduction in the time taken to carry out the search. The hybrid algorithm is a Random Search Algorithm fused with a Tabu mechanism. The work shows that the algorithm locates the desired points in a quicker time than a brute force search. The Tabu Random algorithm is shown to work within a simulated environment using a validated mathematical model. The simulation was run using three different environments with varying numbers of targets. As an algorithm, the Tabu Random is small, clear and can be implemented with minimal resources. The power of the algorithm is the speed at which it locates points of interest and the robustness to the number of robots involved. The number of robots can vary with no changes to the algorithm resulting in a flexible algorithm.

Keywords: algorithms, control, multi-agent, search and rescue

Procedia PDF Downloads 212

Authors: Thomas Yeboah

Abstract:

Cloud Computing is newly paradigm in computing that promises a delivery of computing as a service rather than a product, whereby shared resources, software, and information are provided to computers and other devices as a utility (like the electricity grid) over a network (typically the Internet). As Cloud Computing is a newly style of computing on the internet. It has many merits along with some crucial issues that need to be resolved in order to improve reliability of cloud environment. These issues are related with the load balancing, fault tolerance and different security issues in cloud environment.In this paper the main concern is to develop an effective load balancing algorithm that gives satisfactory performance to both, cloud users and providers. This proposed algorithm (hybrid Bee Ant Colony algorithm) is a combination of two dynamic algorithms: Ant Colony Optimization and Bees Life algorithm. Ant Colony algorithm is used in this hybrid Bee Ant Colony algorithm to solve load balancing issues whiles the Bees Life algorithm is used for optimization of job scheduling in cloud environment. The results of the proposed algorithm shows that the hybrid Bee Ant Colony algorithm outperforms the performances of both Ant Colony algorithm and Bees Life algorithm when evaluated the proposed algorithm performances in terms of Waiting time and Response time on a simulator called CloudSim.

Keywords: ant colony optimization algorithm, bees life algorithm, scheduling algorithm, performance, cloud computing, load balancing

Procedia PDF Downloads 594

Authors: Sardar Ameer Akram Khan, Shahzad Amin Sheikh

Abstract:

Blind equalization is an important technique amongst equalization family. Multimodulus algorithms based on blind equalization removes the undesirable effects of ISI and cater ups the phase issues, saving the cost of rotator at the receiver end. In this paper a new algorithm combination of recursive least square and Multimodulus algorithm named as RLSMMA is proposed by providing few assumption, fast convergence and minimum Mean Square Error (MSE) is achieved. The excellence of this technique is shown in the simulations presenting MSE plots and the resulting filter results.

Keywords: blind equalizations, constant modulus algorithm, multi-modulus algorithm, recursive least square algorithm, quadrature amplitude modulation (QAM)

Procedia PDF Downloads 615

Authors: Safa Adi

Abstract:

This paper will consider the problem of sequential mining patterns embedded in a database by handling the time constraints as defined in the GSP algorithm (level wise algorithms). We will compare two previous approaches GTC and PSP, that resumes the general principles of GSP. Furthermore this paper will discuss PG-hybrid algorithm, that using PSP and GTC. The results show that PSP and GTC are more efficient than GSP. On the other hand, the GTC algorithm performs better than PSP. The PG-hybrid algorithm use PSP algorithm for the two first passes on the database, and GTC approach for the following scans. Experiments show that the hybrid approach is very efficient for short, frequent sequences.

Keywords: database, GTC algorithm, PSP algorithm, sequential patterns, time constraints

Procedia PDF Downloads 354

Authors: Ali Nourollah, Mohsen Movahedinejad

Abstract:

In this paper a new algorithm to generate random simple polygons from a given set of points in a two dimensional plane is designed. The proposed algorithm uses a genetic algorithm to generate polygons with few vertices. A new merge algorithm is presented which converts any two polygons into a simple polygon. This algorithm at first changes two polygons into a polygonal chain and then the polygonal chain is converted into a simple polygon. The process of converting a polygonal chain into a simple polygon is based on the removal of intersecting edges. The merge algorithm has the time complexity of O ((r+s) *l) where r and s are the size of merging polygons and l shows the number of intersecting edges removed from the polygonal chain. It will be shown that 1 < l < r+s. The experiments results show that the proposed algorithm has the ability to generate a great number of different simple polygons and has better performance in comparison to celebrated algorithms such as space partitioning and steady growth.

Keywords: Divide and conquer, genetic algorithm, merge polygons, Random simple polygon generation.

Procedia PDF Downloads 504

Authors: Rania Sherif Abd El-Azim

Abstract:

The role of corporate social responsibility (CSR) in business has evolved and led to an era where industry leaders can no longer overlook the importance of being participative corporate citizens. This is not only because of the media’s skeptical attitude toward whether or not companies’ CSR efforts are sincere but also due to key stakeholders’ ability to hold companies to a higher standard than ever before as companies can gain competitive advantage through CSR. These programs result in addressing global challenges, such as climate, and poverty, or simply improving employee retention, so it has become increasingly clear that CSR is not just the new trend for companies but a necessary tool that organizations must integrate into their overall business strategies to build a stronger reputation as well as to also increase credibility among their key audience and enhance customers’ willingness to repurchase, pay premium price and enhancing positive word of mouth. According to the literature review, the link between CSR and competitive advantage at the firm level has long been an important topic for both CSR researchers and practitioners. Thus CSR can play an important role in enhancing the firm's competitive advantage, which seems an attractive area to investigate specially in Egypt. So, this paper will investigate the role of corporate social responsibility in enhancing the firm competitive advantage.

Keywords: corporate social responsibility, competitive advantage, corporate reputation, customers' willingness to repurchase, willingness to pay premium price, positive word of mouth

Procedia PDF Downloads 280

Authors: Abdolrasoul Ghasemi, Ali Arabmazar Yazdi, Yasaman Boroumand, Aliasghar Banouei

Abstract:

In regional studies, choosing an appropriate approach to analyze regional success or failure has always been a challenge. Hence, this study introduces an innovative approach to establish a link between regional success and failure in the past as well as the potential success of a region in the future. The former can be sought in the historical evaluation of comparative advantages, while the latter is portrayed as competitive advantage analysis with a forward-looking approach. Based on the interaction of comparative and competitive advantages, activities are classified into four groups, including activities with no advantage, hidden advantage, fragile advantage and synergistic advantage. In analyzing the comparative advantage of activities, the location quotient method is applied, and in analyzing their competitive advantage, Porter`s diamond model using the survey method is applied. According to the results, the share of no advantage, fragile advantage, hidden advantage and synergic advantage activities are respectively 10%, 42%, 16%, and 32%. Also, to achieve economic development in regional activities, our model provides various levels of priority. First, the activities with synergistic advantage should be prioritized, then the ones with hidden advantage, and finally the activities with fragile advantage.

Keywords: regional advantage, comparative advantage, competitive advantage, Porter's diamond model

Procedia PDF Downloads 326

Authors: Ying Li, Yan Li

Abstract:

A new algorithm for single hidden layer feedforward neural networks (SLFN), Orthogonal Basis Extreme Learning (OBEL) algorithm, is proposed and the algorithm derivation is given in the paper. The algorithm can decide both the NNs parameters and the neuron number of hidden layer(s) during training while providing extreme fast learning speed. It will provide a practical way to develop NNs. The simulation results of function approximation showed that the algorithm is effective and feasible with good accuracy and adaptability.

Keywords: neural network, orthogonal basis extreme learning, function approximation

Procedia PDF Downloads 504

Authors: Wullapa Wongsinlatam

Abstract:

Back propagation algorithm (BP) is a widely used technique in artificial neural network and has been used as a tool for solving the time series problems, such as decreasing training time, maximizing the ability to fall into local minima, and optimizing sensitivity of the initial weights and bias. This paper proposes an improvement of a BP technique which is called IM-COH algorithm (IM-COH). By combining IM-COH algorithm with cuckoo search algorithm (CS), the result is cuckoo search improved control output hidden layer algorithm (CS-IM-COH). This new algorithm has a better ability in optimizing sensitivity of the initial weights and bias than the original BP algorithm. In this research, the algorithm of CS-IM-COH is compared with the original BP, the IM-COH, and the original BP with CS (CS-BP). Furthermore, the selected benchmarks, four time series samples, are shown in this research for illustration. The research shows that the CS-IM-COH algorithm give the best forecasting results compared with the selected samples.

Keywords: artificial neural networks, back propagation algorithm, time series, local minima problem, metaheuristic optimization

Procedia PDF Downloads 114