RECONFIGURABLE PRODUCTION LINE MODELING AND SCHEDULING USING PETRI NETS AND GENETIC ALGORITHM

In response to the production capacity and functionality variations, a genetic algorithm （GA） embedded with deterministic timed Petri nets（DTPN） for reconfigurable production line（RPL） is proposed to solve its scheduling problem. The basic DTPN modules are presented to model the corresponding variable structures in RPL, and then the scheduling model of the whole RPL is constructed. And in the scheduling algorithm, firing sequences of the Petri nets model are used as chromosomes, thus the selection, crossover, and mutation operator do not deal with the elements in the problem space, but the elements of Petri nets model. Accordingly, all the algorithms for GA operations embedded with Petri nets model are proposed. Moreover, the new weighted single-objective optimization based on reconfiguration cost and E/T is used. The results of a DC motor RPL scheduling suggest that the presented DTPN-GA scheduling algorithm has a significant impact on RPL scheduling, and provide obvious improvements over the conventional scheduling method in practice that meets duedate, minimizes reconfiguration cost, and enhances cost effectivity.

On the E-Valuation of Certain E-Business Strategies on Firm Performance by Adaptive Algorithmic Modeling： An Alternative Strategic Managerial Approach

This paper describes an innovative adaptive algorithmic modeling approach, for solving a wide class of e-business and strategic management problems under uncertainty conditions. The proposed methodology is based on basic ideas and concepts of four key-field interrelated sciences, i.e., computing science, applied mathematics, management sciences and economic sciences. Furthermore, the fundamental scientific concepts of adaptability and uncertainty are shown to play a critical role of major importance for a （near） optimum solution of a class of complex e-business/services and strategic management problems. Two characteristic case studies, namely measuring e-business performance under certain environmental pressures and organizational constraints and describing the relationships between technology, innovation and firm performance, are considered as effective applications of the proposed adaptive algorithmic modeling approach. A theoretical time-dependent model for the evaluation of firm e-business performances is also proposed.

A New Three-Dimensional(3D)Printing Prepress Algorithm for Simulation of Planned Surgery for Congenital Heart Disease

Background:Three-dimensional printing technology may become a key factor in transforming clinical practice and in significant improvement of treatment outcomes.The introduction of this technique into pediatric cardiac surgery will allow us to study features of the anatomy and spatial relations of a defect and to simulate the optimal surgical repair on a printed model in every individual case.Methods:We performed the prospective cohort study which included 29 children with congenital heart defects.The hearts and the great vessels were modeled and printed out.Measurements of the same cardiac areas were taken in the same planes and points at multislice computed tomography images(group 1)and on printed 3D models of the hearts(group 2).Pre-printing treatment of the multislice computed tomography data and 3D model preparation were performed according to a newly developed algorithm.Results:The measurements taken on the 3D-printed cardiac models and the tomographic images did not differ significantly,which allowed us to conclude that the models were highly accurate and informative.The new algorithm greatly simplifies and speeds up the preparation of a 3D model for printing,while maintaining high accuracy and level of detail.Conclusions:The 3D-printed models provide an accurate preoperative assessment of the anatomy of a defect in each case.The new algorithm has several important advantages over other available programs.They enable the development of customized preliminary plans for surgical repair of each specific complex congenital heart disease,predict possible issues,determine the optimal surgical tactics,and significantly improve surgical outcomes.

Research on a Fog Computing Architecture and BP Algorithm Application for Medical Big Data

Although the Internet of Things has been widely applied,the problems of cloud computing in the application of digital smart medical Big Data collection,processing,analysis,and storage remain,especially the low efficiency of medical diagnosis.And with the wide application of the Internet of Things and Big Data in the medical field,medical Big Data is increasing in geometric magnitude resulting in cloud service overload,insufficient storage,communication delay,and network congestion.In order to solve these medical and network problems,a medical big-data-oriented fog computing architec-ture and BP algorithm application are proposed,and its structural advantages and characteristics are studied.This architecture enables the medical Big Data generated by medical edge devices and the existing data in the cloud service center to calculate,compare and analyze the fog node through the Internet of Things.The diagnosis results are designed to reduce the business processing delay and improve the diagnosis effect.Considering the weak computing of each edge device,the artificial intelligence BP neural network algorithm is used in the core computing model of the medical diagnosis system to improve the system computing power,enhance the medical intelligence-aided decision-making,and improve the clinical diagnosis and treatment efficiency.In the application process,combined with the characteristics of medical Big Data technology,through fog architecture design and Big Data technology integration,we could research the processing and analysis of heterogeneous data of the medical diagnosis system in the context of the Internet of Things.The results are promising:The medical platform network is smooth,the data storage space is sufficient,the data processing and analysis speed is fast,the diagnosis effect is remarkable,and it is a good assistant to doctors’treatment effect.It not only effectively solves the problem of low clinical diagnosis,treatment efficiency and quality,but also reduces the waiting time of patients,effectively solves the contradiction between doctors and patients,and improves the medical service quality and management level.

Mathematical Modeling Algorithms for Creating New Materials with Desired Properties Using Nano-Hierarchical Structures

In the enormous and still poorly mastered gap between the macro level, where well developed continuum theories of continuous media and engineering methods of calculation and design operate, and atomic, subordinate to the laws of quantum mechanics, there is an extensive meso-hierarchical level of the structure of matter. At this level unprecedented previously products and technologies can be artificially created. Nano technology is a qualitatively new strategy in technology: it creates objects in exactly the opposite way—large objects are created from small ones [1]. We have developed a new method for modeling acoustic monitoring of a layered-block elastic medium with several inclusions of various physical and mechanical hierarchical structures [2]. An iterative process is developed for solving the direct problem for the case of three hierarchical inclusions of l, m, s-th ranks based on the use of 2D integro-differential equations. The degree of hierarchy of inclusions is determined by the values of their ranks, which may be different, while the first rank is associated with the atomic structure, the following ranks are associated with increasing geometric sizes, which contain inclusions of lower ranks and sizes. Hierarchical inclusions are located in different layers one above the other: the upper one is abnormally plastic, the second is abnormally elastic and the third is abnormally dense. The degree of filling with inclusions of each rank for all three hierarchical inclusions is different. Modeling is carried out from smaller sizes to large inclusions;as a result, it becomes possible to determine the necessary parameters of the formed material from acoustic monitoring data.

Space-Time Chaos Filtering for the Incoherent Paradigm for 6G Wireless System Design from Theoretic Perspective

The following material is devoted to the generalization of the chaos modeling to random fields in communication channels and its application on the space-time filtering for the incoherent paradigm;that is the purpose of this research. The approach, presented hereafter, is based on the “Markovian” trend in modeling of random fields, and it is applied for the first time to the chaos field modeling through the well-known concept of the random “treatment” of deterministic dynamic systems, first presented by A. Kolmogorov, M. Born, etc. The material presents the generalized Stratonovich-Kushner Equations (SKE) for the optimum filtering of chaotic models of random fields and its simplified quasi-optimum solutions. In addition to this, the application of the multi-moment algorithms for quasi-optimum solutions is considered and, it is shown, that for scenarios, when the covariation interval of the input random field is less than the distance between the antenna elements, the gain of the space-time algorithms against their “time” analogies is significant. This is the general result presented in the following.

Nonlinear Model Algorithmic Control of a pH Neutralization Process

Control of pH neutralization processes is challenging in the chemical process industry because of their inherent strong nonlinearity. In this paper, the model algorithmic control (MAC) strategy is extended to nonlinear processes using Hammerstein model that consists of a static nonlinear polynomial function followed in series by a linear impulse response dynamic element. A new nonlinear Hammerstein MAC algorithm (named NLH-MAC) is presented in detail. The simulation control results of a pH neutralization process show that NLH-MAC gives better control performance than linear MAC and the commonly used industrial nonlinear propotional plus integral plus derivative (PID) controller. Further simulation experiment demonstrates that NLH-MAC not only gives good control response, but also possesses good stability and robustness even with large modeling errors.

Adaptive learning algorithm based on mixture Gaussian background

The key problem of the adaptive mixture background model is that the parameters can adaptively change according to the input data. To address the problem, a new method is proposed. Firstly, the recursive equations are inferred based on the maximum likelihood rule. Secondly, the forgetting factor and learning rate factor are redefined, and their still more general formulations are obtained by analyzing their practical functions. Lastly, the convergence of the proposed algorithm is proved to enable the estimation converge to a local maximum of the data likelihood function according to the stochastic approximation theory. The experiments show that the proposed learning algorithm excels the formers both in converging rate and accuracy.

Model algorithm control using neural networks for input delayed nonlinear control system

The performance of the model algorithm control method is partially based on the accuracy of the system＇s model. It is difficult to obtain a good model of a nonlinear system, especially when the nonlinearity is high. Neural networks have the ability to ＂learn＂the characteristics of a system through nonlinear mapping to represent nonlinear functions as well as their inverse functions. This paper presents a model algorithm control method using neural networks for nonlinear time delay systems. Two neural networks are used in the control scheme. One neural network is trained as the model of the nonlinear time delay system, and the other one produces the control inputs. The neural networks are combined with the model algorithm control method to control the nonlinear time delay systems. Three examples are used to illustrate the proposed control method. The simulation results show that the proposed control method has a good control performance for nonlinear time delay systems.

Multiple model tracking algorithms based on neural network and multiple process noise soft switching

A multiple model tracking algorithm based on neural network and multiple-process noise soft-switching for maneuvering targets is presented.In this algorithm, the＂current＂statistical model and neural network are running in parallel.The neural network algorithm is used to modify the adaptive noise filtering algorithm based on the mean value and variance of the＂current＂statistical model for maneuvering targets, and then the multiple model tracking algorithm of the multiple processing switch is used to improve the precision of tracking maneuvering targets.The modified algorithm is proved to be effective by simulation.

Nonlinear model predictive control based on support vector machine and genetic algorithm

This paper presents a nonlinear model predictive control(NMPC) approach based on support vector machine(SVM) and genetic algorithm(GA) for multiple-input multiple-output(MIMO) nonlinear systems.Individual SVM is used to approximate each output of the controlled plant Then the model is used in MPC control scheme to predict the outputs of the controlled plant.The optimal control sequence is calculated using GA with elite preserve strategy.Simulation results of a typical MIMO nonlinear system show that this method has a good ability of set points tracking and disturbance rejection.

Fast Parallel Algorithm for Slicing STL Based on Pipeline

In Additive Manufacturing field, the current researches of data processing mainly focus on a slicing process of large STL files or complicated CAD models. To improve the efficiency and reduce the slicing time, a parallel algorithm has great advantages. However, traditional algorithms can＇t make full use of multi-core CPU hardware resources. In the paper, a fast parallel algorithm is presented to speed up data processing. A pipeline mode is adopted to design the parallel algorithm. And the complexity of the pipeline algorithm is analyzed theoretically. To evaluate the performance of the new algorithm, effects of threads number and layers number are investigated by a serial of experiments. The experimental results show that the threads number and layers number are two remarkable factors to the speedup ratio. The tendency of speedup versus threads number reveals a positive relationship which greatly agrees with the Amdahl＇s law, and the tendency of speedup versus layers number also keeps a positive relationship agreeing with Gustafson＇s law. The new algorithm uses topological information to compute contours with a parallel method of speedup. Another parallel algorithm based on data parallel is used in experiments to show that pipeline parallel mode is more efficient. A case study at last shows a suspending performance of the new parallel algorithm. Compared with the serial slicing algorithm, the new pipeline parallel algorithm can make full use of the multi-core CPU hardware, accelerate the slicing process, and compared with the data parallel slicing algorithm, the new slicing algorithm in this paper adopts a pipeline parallel model, and a much higher speedup ratio and efficiency is achieved.

Optimization of the catch bench design using a genetic algorithm

Rockfalls are one of the hazards that may be associated with open pit mining. The majority of rockfalls occur due to the existing conditions of slopes, such as back break, fractures and joints. Constructing a berm on the catch bench is a popular method for the mitigation of rockfall hazards in open pit mining.The width of the catch bench and the height of the berm play a major role in the open pit bench design.However, there is no systematic method currently available to optimize the size of these parameters. This study proposes a novel methodology which calculates the optimum catch bench width by integrating the rockfall simulation model and genetic algorithm into a Simulation-Optimization Model. The proposed methodology is useful when used to determine the minimum catch bench width, or the maximum overall slope angle, insuring that a sufficient factor of safety of the slope is included while maximizing the overall profitability of the open pit mine.

MODELING, VALIDATION AND OPTIMAL DESIGN OF THE CLAMPING FORCE CONTROL VALVE USED IN CONTINUOUSLY VARIABLE TRANSMISSION

Associated dynamic performance of the clamping force control valve used in continuously variable transmission （CVT） is optimized. Firstly, the structure and working principle of the valve are analyzed, and then a dynamic model is set up by means of mechanism analysis. For the purpose of checking the validity of the modeling method, a prototype workpiece of the valve is manufactured for comparison test, and its simulation result follows the experimental result quite well. An associated performance index is founded considering the response time, overshoot and saving energy, and five structural parameters are selected to adjust for deriving the optimal associated performance index. The optimization problem is solved by the genetic algorithm （GA） with necessary constraints. Finally, the properties of the optimized valve are compared with those of the prototype workpiece, and the results prove that the dynamic performance indexes of the optimized valve are much better than those of the prototype workpiece.

Dynamic airspace sectorization via improved genetic algorithm

This paper deals with dynamic airspace sectorization （DAS） problem by an improved genetic algorithm （iGA）. A graph model is first constructed that represents the airspace static structure. Then the DAS problem is formulated as a graph-partitioning problem to balance the sector workload under the premise of ensuring safety. In the iGA, multiple populations and hybrid coding are applied to determine the optimal sector number and airspace sectorization. The sector constraints are well satisfied by the improved genetic operators and protect zones. This method is validated by being applied to the airspace of North China in terms of three indexes, which are sector balancing index, coordination workload index and sector average flight time index. The improvement is obvious, as the sector balancing index is reduced by 16.5 %, the coordination workload index is reduced by 11.2 %, and the sector average flight time index is increased by 11.4 % during the peak-hour traffic.

Method for improving RLS algorithms

The recursive least-square (RLS) algorithm has been extensively used in adaptive identification, prediction, filtering, and many other fields. This paper proposes adding a second-difference term to the standard recurrent formula to create a novel method for improving tracing capabilities. Test results show that this can greatly improve the convergence capability of RLS algorithms.

A Class of Generalized Approximate Inverse Solvers for Unsymmetric Linear Systems of Irregular Structure Based on Adaptive Algorithmic Modelling for Solving Complex Computational Problems in Three Space Dimensions

A class of general inverse matrix techniques based on adaptive algorithmic modelling methodologies is derived yielding iterative methods for solving unsymmetric linear systems of irregular structure arising in complex computational problems in three space dimensions. The proposed class of approximate inverse is chosen as the basis to yield systems on which classic and preconditioned iterative methods are explicitly applied. Optimized versions of the proposed approximate inverse are presented using special storage (k-sweep) techniques leading to economical forms of the approximate inverses. Application of the adaptive algorithmic methodologies on a characteristic nonlinear boundary value problem is discussed and numerical results are given.

Collusion detector based on G-N algorithm for trust model

In the open network environment, malicious attacks to the trust model have become increasingly serious. Compared with single node attacks, collusion attacks do more harm to the trust model. To solve this problem, a collusion detector based on the GN algorithm for the trust evaluation model is proposed in the open Internet environment. By analyzing the behavioral characteristics of collusion groups, the concept of flatting is defined and the G-N community mining algorithm is used to divide suspicious communities. On this basis, a collusion community detector method is proposed based on the breaking strength of suspicious communities. Simulation results show that the model has high recognition accuracy in identifying collusion nodes, so as to effectively defend against malicious attacks of collusion nodes.

Dislocation parameters of Gonghe earthquake jointly inferred by using genetic algorithms and least squares method

The Second Crustal Deformation Monitoring Center, China Seismological Bureau, has detected a marked uplift associated with the Gonghe Ms=7.0 earthquake on April 26, 1990, Qinghai Province. From the observed vertical deformations and using a rectangular uniform slip model in a homogeneous elastic half space, we first employ genetic algorithms (GA) to infer the approximate global optimal solution, and further use least squares method to get more accurate global optimal solution by taking the approximate solution of GA as the initial parameters of least squares. The inversion results show that the causative fault of Gonghe Ms=7.0 earthquake is a right-lateral reverse fault with strike NW60°, dip SW and dip angle 37°, the coseismic fracture length, width and slip are 37 km, 6 km and 2.7 m respectively. Combination of GA and least squares algorithms is an effective joint inversion method, which could not only escape from local optimum of least squares, but also solve the slow convergence problem of GA after reaching adjacency of global optimal solution.

Process Mining Discovery Techniques for Software Architecture Lightweight Evaluation Framework

This research recognizes the limitation and challenges of adaptingand applying Process Mining as a powerful tool and technique in theHypothetical Software Architecture (SA) Evaluation Framework with thefeatures and factors of lightweightness. Process mining deals with the largescalecomplexity of security and performance analysis, which are the goalsof SA evaluation frameworks. As a result of these conjectures, all ProcessMining researches in the realm of SA are thoroughly reviewed, and ninechallenges for Process Mining Adaption are recognized. Process mining isembedded in the framework and to boost the quality of the SA model forfurther analysis, the framework nominates architectural discovery algorithmsFlower, Alpha, Integer Linear Programming (ILP), Heuristic, and Inductiveand compares them vs. twelve quality criteria. Finally, the framework’s testingon three case studies approves the feasibility of applying process mining toarchitectural evaluation. The extraction of the SA model is also done by thebest model discovery algorithm, which is selected by intensive benchmarkingin this research. This research presents case studies of SA in service-oriented,Pipe and Filter, and component-based styles, modeled and simulated byHierarchical Colored Petri Net techniques based on the cases’ documentation.Processminingwithin this framework dealswith the system’s log files obtainedfrom SA simulation. Applying process mining is challenging, especially for aSA evaluation framework, as it has not been done yet. The research recognizesthe problems of process mining adaption to a hypothetical lightweightSA evaluation framework and addresses these problems during the solutiondevelopment.