Search results

Gives introductory remarks about chapter 1 of this group of 31 papers, from ISEF 1999 Proceedings, in the methodologies for field analysis, in the electromagnetic community. Observes that computer package implementation theory contributes to clarification. Discusses the areas covered by some of the papers ‐ such as artificial intelligence using fuzzy logic. Includes applications such as permanent magnets and looks at eddy current problems. States the finite element method is currently the most popular method used for field computation. Closes by pointing out the amalgam of topics.

The purpose of this paper is to provide an effective and simple technique to structural damage identification, particularly to identify a crack in a structure. Artificial neural networks approach is an alternative to identify the extent and location of the damage over the classical methods. Radial basis function (RBF) networks are good at function mapping and generalization ability among the various neural network approaches. RBF neural networks are chosen for the present study of crack identification.

Analyzing the vibration response of a structure is an effective way to monitor its health and even to detect the damage. A novel two‐stage improved radial basis function (IRBF) neural network methodology with conventional RBF in the first stage and a reduced search space moving technique in the second stage is proposed to identify the crack in a cantilever beam structure in the frequency domain. Latin hypercube sampling (LHS) technique is used in both stages to sample the frequency modal patterns to train the proposed network. Study is also conducted with and without addition of 5% white noise to the input patterns to simulate the experimental errors.

The results show a significant improvement in identifying the location and magnitude of a crack by the proposed IRBF method, in comparison with conventional RBF method and other classical methods. In case of crack location in a beam, the average identification error over 12 test cases was 0.69 per cent by IRBF network compared to 4.88 per cent by conventional RBF. Similar improvements are reported when compared to hybrid CPN BPN networks. It also requires much less computational effort as compared to other hybrid neural network approaches and classical methods.

The proposed novel IRBF crack identification technique is unique in originality and not reported elsewhere. It can identify the crack location and crack depth with very good accuracy, less computational effort and ease of implementation.

Aim of the present monograph is the economic analysis of the role of MNEs regarding globalisation and digital economy and in parallel there is a reference and examination of some legal aspects concerning MNEs, cyberspace and e‐commerce as the means of expression of the digital economy. The whole effort of the author is focused on the examination of various aspects of MNEs and their impact upon globalisation and vice versa and how and if we are moving towards a global digital economy.

This paper aims to provide a solution to the first phase of a force-controlled circular Peg-In-Hole assembly using an industrial robot. The paper suggests motion planning of the robot’s end-effector so as to perform Peg-In-Hole search with minimum a priori information of the working environment.

The paper models Peg-In-Hole search problem as a problem of finding the minima in depth profile for a particular assembly. Thereafter, various optimization techniques are used to guide the robot to locate minima and complete the hole search. This approach is inspired by a human’s approach of searching a hole by moving peg in various directions so as to search a point of maximum insertion which is same as the minima in depth profile.

The usage of optimization techniques for hole search allows the robot to work with minimum a priori information of the working environment. Also, the iterative nature of the techniques adapts to any disturbance during assembly.

The techniques discussed here are quite useful if a force-controlled assembly needs to be performed in a highly unknown environment and also when the assembly setup can get disturbed in between.

The concept is original and provides a non-conventional use of optimization techniques, not for optimization of some process directly but for an industrial robot’s motion planning.

Introduces papers from this area of expertise from the ISEF 1999 Proceedings. States the goal herein is one of identifying devices or systems able to provide prescribed performance. Notes that 18 papers from the Symposium are grouped in the area of automated optimal design. Describes the main challenges that condition computational electromagnetism’s future development. Concludes by itemizing the range of applications from small activators to optimization of induction heating systems in this third chapter.

The purpose of this paper is to develop an effective and efficient approach to exploit meta‐heuristic in particle swarm optimization (PSO) for the job shop scheduling problem (JSP), a class of NP‐hard optimization problems. The approach is to be built on a PSO with multiple independent swarms. PSO was inspired by bird flocking and animal social behaviors. The particles operate collectively like a swarm that flies through the hyperdimensional space to search for possible optimal solutions. The behavior of the particles is influenced by their tendency to learn from their personal past experience and from the success of their peers to adjust their flying speed and direction. Research in fusing the multiple‐swarm concept into PSO is well‐established in solving single objective optimization problems and multimodal problems.

This study examines the optimization of the JSP via a search space division scheme and use of the meta‐heuristic method of PSO by assigning each machine in a JSP an independent swarm of particles. The use of multiple swarms in PSO is motivated by the idea of “divide and conquer” to reduce the computational complexity incurred through solving a NP‐hard combinatorial optimization problem. The resulted design, JSP/PSO algorithm, fully exploits the computing power presented by the multiple‐swarm PSO.

Simulation experiments show that the proposed JSP/PSO algorithm can effectively solve the JSP problems from small to median size. If certain mechanism of information sharing between swarms can be incorporated, it is believed that the new design could offer even more computing power to tackle the large‐sized problems.

The proposed JSP/PSO algorithm is effective in solving JSPs. The proposed algorithm shows considerable promise when searching the space of non‐delay schedules. It demands relatively lower number of function evaluations compared to other state‐of‐the‐art. The drawback to the JSP/PSO is that the GT scheduling adopted is too computationally expensive. Future works will address this concern.

Briefly reviews previous literature by the author before presenting an original 12 step system integration protocol designed to ensure the success of companies or countries in their efforts to develop and market new products. Looks at the issues from different strategic levels such as corporate, international, military and economic. Presents 31 case studies, including the success of Japan in microchips to the failure of Xerox to sell its invention of the Alto personal computer 3 years before Apple: from the success in DNA and Superconductor research to the success of Sunbeam in inventing and marketing food processors: and from the daring invention and production of atomic energy for survival to the successes of sewing machine inventor Howe in co‐operating on patents to compete in markets. Includes 306 questions and answers in order to qualify concepts introduced.

To achieve a full understanding of the role of marketing from plan to profit requires a knowledge of the basic building blocks. This textbook introduces the key concepts in the art or science of marketing to practising managers. Understanding your customers and consumers, the 4 Ps (Product, Place, Price and Promotion) provides the basic tools for effective marketing. Deploying your resources and informing your managerial decision making is dealt with in Unit VII introducing marketing intelligence, competition, budgeting and organisational issues. The logical conclusion of this effort is achieving sales and the particular techniques involved are explored in the final section.

The purpose of this paper is three-fold: to review the categories explaining mainly optimization algorithms (techniques) in that needed to improve the generalization performance and learning speed of the Feedforward Neural Network (FNN); to discover the change in research trends by analyzing all six categories (i.e. gradient learning algorithms for network training, gradient free learning algorithms, optimization algorithms for learning rate, bias and variance (underfitting and overfitting) minimization algorithms, constructive topology neural networks, metaheuristic search algorithms) collectively; and recommend new research directions for researchers and facilitate users to understand algorithms real-world applications in solving complex management, engineering and health sciences problems.

The FNN has gained much attention from researchers to make a more informed decision in the last few decades. The literature survey is focused on the learning algorithms and the optimization techniques proposed in the last three decades. This paper (Part II) is an extension of Part I. For the sake of simplicity, the paper entitled “Machine learning facilitated business intelligence (Part I): Neural networks learning algorithms and applications” is referred to as Part I. To make the study consistent with Part I, the approach and survey methodology in this paper are kept similar to those in Part I.

Combining the work performed in Part I, the authors studied a total of 80 articles through popular keywords searching. The FNN learning algorithms and optimization techniques identified in the selected literature are classified into six categories based on their problem identification, mathematical model, technical reasoning and proposed solution. Previously, in Part I, the two categories focusing on the learning algorithms (i.e. gradient learning algorithms for network training, gradient free learning algorithms) are reviewed with their real-world applications in management, engineering, and health sciences. Therefore, in the current paper, Part II, the remaining four categories, exploring optimization techniques (i.e. optimization algorithms for learning rate, bias and variance (underfitting and overfitting) minimization algorithms, constructive topology neural networks, metaheuristic search algorithms) are studied in detail. The algorithm explanation is made enriched by discussing their technical merits, limitations, and applications in their respective categories. Finally, the authors recommend future new research directions which can contribute to strengthening the literature.

The FNN contributions are rapidly increasing because of its ability to make reliably informed decisions. Like learning algorithms, reviewed in Part I, the focus is to enrich the comprehensive study by reviewing remaining categories focusing on the optimization techniques. However, future efforts may be needed to incorporate other algorithms into identified six categories or suggest new category to continuously monitor the shift in the research trends.

The authors studied the shift in research trend for three decades by collectively analyzing the learning algorithms and optimization techniques with their applications. This may help researchers to identify future research gaps to improve the generalization performance and learning speed, and user to understand the applications areas of the FNN. For instance, research contribution in FNN in the last three decades has changed from complex gradient-based algorithms to gradient free algorithms, trial and error hidden units fixed topology approach to cascade topology, hyperparameters initial guess to analytically calculation and converging algorithms at a global minimum rather than the local minimum.

The existing literature surveys include comparative study of the algorithms, identifying algorithms application areas and focusing on specific techniques in that it may not be able to identify algorithms categories, a shift in research trends over time, application area frequently analyzed, common research gaps and collective future directions. Part I and II attempts to overcome the existing literature surveys limitations by classifying articles into six categories covering a wide range of algorithm proposed to improve the FNN generalization performance and convergence rate. The classification of algorithms into six categories helps to analyze the shift in research trend which makes the classification scheme significant and innovative.