Intelligent modeling and optimization on time-sharing power dispatching system for electrolytic zinc process

Based on real time price counting of electric power, an optimization model of time sharing power for electrolytic zinc process(EZP) was established by means of an incremental fuzzy neural network(FNN), which is adopted to approximate the relationship of current efficiency, current density and acidity. Penalty function introduced and optimal objective function reconstructed, a single loop simulated annealing algorithm(SAA) by using mutation and extending searching spaces was used to obtain optimal time sharing power scheme. Industrial practical results show that the whole system can greatly decrease the power consumption of EZP and increase the time sharing profits.

3D parallel inversion of time-domain airborne EM data

To improve the inversion accuracy of time-domain airborne electromagnetic data, we propose a parallel 3D inversion algorithm for airborne EM data based on the direct Gauss-Newton optimization. Forward modeling is performed in the frequency domain based on the scattered secondary electrical field. Then, the inverse Fourier transform and convolution of the transmitting waveform are used to calculate the EM responses and the sensitivity matrix in the time domain for arbitrary transmitting waves. To optimize the computational time and memory requirements, we use the EM ＂footprint＂ concept to reduce the model size and obtain the sparse sensitivity matrix. To improve the 3D inversion, we use the OpenMP library and parallel computing. We test the proposed 3D parallel inversion code using two synthetic datasets and a field dataset. The time-domain airborne EM inversion results suggest that the proposed algorithm is effective, efficient, and practical.

Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times

A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.

Integrated parallel forecasting model based on modified fuzzy time series and SVM

A dynamic parallel forecasting model is proposed, which is based on the problem of current forecasting models and their combined model. According to the process of the model, the fuzzy C-means clustering algorithm is improved in outliers operation and distance in the clusters and among the clusters. Firstly, the input data sets are optimized and their coherence is ensured, the region scale algorithm is modified and non-isometric multi scale region fuzzy time series model is built. At the same time, the particle swarm optimization algorithm about the particle speed, location and inertia weight value is improved, this method is used to optimize the parameters of support vector machine, construct the combined forecast model, build the dynamic parallel forecast model, and calculate the dynamic weight values and regard the product of the weight value and forecast value to be the final forecast values. At last, the example shows the improved forecast model is effective and accurate.

Rescheduling to Minimize Total Completion Time Under a Limit Time Disruption for the Parallel Batch

In the rescheduling on a single machine, a set of the original jobs has already been scheduled, in order to make a given objective function is optimal. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. A batching machine is a machine that can handle up to some jobs simultaneously. In this paper,we consider the total completion time under a limit on the sequence disruptions for parallel batching based on rescheduling. For the parallel batching problem based on rescheduling, we research the properties of feasible schedules and optimal schedules on the total completion time under a limit on the maximum time disruptions or total time disruptions, in which the jobs are sequenced in SPT order, and give out the pseudo-polynomial time algorithms on the number of jobs and the processing time of jobs by applying the dynamic programming method.

A Novel Parallel Scheme for Fast Similarity Search in Large Time Series

The similarity search is one of the fundamental components in time series data mining,e.g.clustering,classification,association rules mining.Many methods have been proposed to measure the similarity between time series,including Euclidean distance,Manhattan distance,and dynamic time warping(DTW).In contrast,DTW has been suggested to allow more robust similarity measure and be able to find the optimal alignment in time series.However,due to its quadratic time and space complexity,DTW is not suitable for large time series datasets.Many improving algorithms have been proposed for DTW search in large databases,such as approximate search or exact indexed search.Unlike the previous modified algorithm,this paper presents a novel parallel scheme for fast similarity search based on DTW,which is called MRDTW(MapRedcuebased DTW).The experimental results show that our approach not only retained the original accuracy as DTW,but also greatly improved the efficiency of similarity measure in large time series.

Performance evaluation of series and parallel strategies for financial time series forecasting

Background:Improving financial time series forecasting is one of the most challenging and vital issues facing numerous financial analysts and decision makers.Given its direct impact on related decisions,various attempts have been made to achieve more accurate and reliable forecasting results,of which the combining of individual models remains a widely applied approach.In general,individual models are combined under two main strategies:series and parallel.While it has been proven that these strategies can improve overall forecasting accuracy,the literature on time series forecasting remains vague on the choice of an appropriate strategy to generate a more accurate hybrid model.Methods:Therefore,this study’s key aim is to evaluate the performance of series and parallel strategies to determine a more accurate one.Results:Accordingly,the predictive capabilities of five hybrid models are constructed on the basis of series and parallel strategies compared with each other and with their base models to forecast stock price.To do so,autoregressive integrated moving average(ARIMA)and multilayer perceptrons(MLPs)are used to construct two series hybrid models,ARIMA-MLP and MLP-ARIMA,and three parallel hybrid models,simple average,linear regression,and genetic algorithm models.Conclusion:The empirical forecasting results for two benchmark datasets,that is,the closing of the Shenzhen Integrated Index(SZII)and that of Standard and Poor’s 500(S&P 500),indicate that although all hybrid models perform better than at least one of their individual components,the series combination strategy produces more accurate hybrid models for financial time series forecasting.

Generalized multiple time windows model based parallel machine scheduling for TDRSS

The scheduling efficiency of the tracking and data relay satellite system（TDRSS）is strictly limited by the scheduling degrees of freedom（DoF）,including time DoF defined by jobs＇ flexible time windows and spatial DoF brought by multiple servable tracking and data relay satellites（TDRSs）.In this paper,ageneralized multiple time windows（GMTW）model is proposed to fully exploit the time and spatial DoF.Then,the improvements of service capability and job-completion probability based on the GMTW are theoretically proved.Further,an asymmetric path-relinking（APR）based heuristic job scheduling framework is presented to maximize the usage of DoF provided by the GMTW.Simulation results show that by using our proposal 11%improvement of average jobcompletion probability can be obtained.Meanwhile,the computing time of the time-to-target can be shorten to 1/9 of the GRASP.

New multi-DSP parallel computing architecture for real-time image processing

The flexibility of traditional image processing system is limited because those system are designed for specific applications. In this paper, a new TMS320C64x-based multi-DSP parallel computing architecture is presented. It has many promising characteristics such as powerful computing capability, broad I/O bandwidth, topology flexibility, and expansibility. The parallel system performance is evaluated by practical experiment.

A Distributed Algorithm for Parallel Multi-task Allocation Based on Profit Sharing Learning

经由联盟形成的任务分配是在多代理人系统(妈) 的几应用程序域的基本研究挑战，例如资源分配，灾难反应管理等等。怎么以一种分布式的方式分配许多未解决的任务到一些代理人，主要处理。在这篇论文，我们在自我组织、自我学习的代理人之中建议一个分布式的平行多工分配算法。处理状况，我们在二维的房间地理上驱散代理人和任务，然后介绍为寻找它的任务由的一个单个代理人的分享学习的利润(PSL ) 不断自我学习。我们也在代理人之中为通讯和协商介绍策略分配真实工作量到每个 tasked 代理人。最后，评估建议算法的有效性，我们把它与 Shehory 和 Krau 被许多研究人员在最近的年里讨论的分布式的任务分配算法作比较。试验性的结果证明建议算法罐头快速为每项任务形成一个解决的联盟。而且，建议算法罐头明确地告诉我们每个 tasked 代理人的真实工作量，并且能因此为实际控制任务提供一本特定、重要的参考书。

Share Time活动的开展与学生的主体发展

依据新课程确立学生主体地位的理念，针对本地中小学英语教学实际，笔者提出在Share Time活动中发展学生技能的英语学习方式。活动以话题为主要媒体，以个人、对子或小组为活动呈现方式，通过倾听、交流、协作、分享，从体验、表现、发展的角度，在常规授课之外，让学生最大限度地发展自己的学习空间，展示学习、生活和心智特征的活动过程。

RELIABILITY ANALYSIS FOR A REPAIRABLE PARALLEL SYSTEM WITH TIME-VARYING FAILURE RATES

To solve a real problem:how to calculate the reliability of a system with time-varying failure rates in industry systems,this paper studies a model for the load-sharing parallel system with time-varying failure rates,and obtains calculating formulas of reliability and availability of the system by solving differential equations.In this paper,the failure rates are expressed in polynomial configuration.The constant,linear and Weibull failure rate are in their special form.The polynomial failure rates provide flexibility in modeling the practical time-varying failure rates.

A Class of Parallel Algorithms of Real-TimeNumerical Simulation for Stiff Dynamic System

In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.

A Hybrid Estimation of Distribution Algorithm for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times

A hybrid estimation of distribution algorithm (EDA) with iterated greedy (IG) search (EDA-IG) is proposed for solving the unrelated parallel machine scheduling problem with sequence-dependent setup times (UPMSP-SDST). For makespan criterion, some properties about neighborhood search operators to avoid invalid search are derived. A probability model based on neighbor relations of jobs is built in the EDA-based exploration phase to generate new solutions by sampling the promising search region. Two types of deconstruction and reconstruction as well as an IG search are designed in the IG-based exploitation phase. Computational complexity of the algorithm is analyzed, and the effect of parameters is investigated by using the Taguchi method of design-of-experiment. Numerical tests on 1640 benchmark instances are carried out. The results and comparisons demonstrate the effectiveness of the EDA-IG. Especially, the bestknown solutions of 531 instances are updated. In addition, the effectiveness of the properties is also demonstrated by numerical comparisons. © 2014 Chinese Association of Automation.

A time-sharing multi-channel pulse amplitude analyzer

A conventional multi-channel pulse amplitude analyzer acquires single energy spectrum,but provides no information on its tendency with time.To address the limitation,we propose a scheme of time-sharing multichannel pulse amplitude analyzer(TSMCA).A dual-port random access memory is divided into two storage spaces,one for current energy spectrum data acquisition and another for previous energy spectrum data storage.The two tasks can be performed simultaneously,and the time-related variation tendency of energy spectrum can be obtained.A prototype system of TSMCA is designed.It performs nicely,with maximum channel number of 4096 in capacity of 2^(32)/Ch,minimal time-sharing slice of 25 ms,the differential nonlinearity of <1.5%,and the integral nonlinearity of <0.3%.

Design of efficient parallel algorithms on shared memory multiprocessors

The design of parallel algorithms is studied in this paper. These algorithms are applicable to shared memory MIMD machines In this paper, the emphasis is put on the methods for design of the efficient parallel algorithms. The design of efficient parallel algorithms should be based on the following considerationst algorithm parallelism and the hardware-parallelism; granularity of the parallel algorithm, algorithm optimization according to the underling parallel machine. In this paper , these principles are applied to solve a model problem of the PDE. The speedup of the new method is high. The results were tested and evaluated on a shared memory MIMD machine. The practical results were agree with the predicted performance.

The Model of Asynchronous Parallel Nonlinear Multisplitting Method on Shared Memory System

Nonlinear multisplitting method is known as parallel iterative methods for solving a large-scale system of nonlinear equations F(x) = 0. We extend the idea of nonlinear multisplitting and consider a new model ill which the iteration is executed asynchronously: Each processor calculate the solution of an individual nonlinear system belong to its nonlinear multisplitting and can update the global approximation residing in the shared memory at any time. A local convergence analysis of this model is presented. Finally, we give a uumerical example which shows a 'strange' property that speedup Sp > p and efficiency Ep > 1.

Driving Mechanism of Cotton Comber's Detaching Roller Based on Time-Sharing Unidirectional Drive

The high-speed reciprocating motion of a detaching roller limits the velocity of a cotton comber and affects the quality of comber slivers. The article has proposed a controllable time-sharing unidirectional hybrid drive mechanism after analyzing detaching roller's current numerical control drive method. The analysis focuses on the detaching roller motion required according to cotton comber's velocity and process. The double-servo motors of the mechanism consists of differential gear trains. The mechanism addresses the problem of increased servo motor power,and failure of promptly responded to the positive inversion process of mechanism driven by servo motors. A velocity calculation model of the detaching roller controllable drive mechanism will be generated by using superposition method and design of differential gear trains. The accuracy of the model will be verified using the test platform. This study has presented a reliable and practical high-speed drive mechanism and can be a reference to future studies on high-speed reciprocating motion drive.

Graphical Processing Unit Based Time-Parallel Numerical Method for Ordinary Differential Equations

On-line transient stability analysis of a power grid is crucial in determining whether the power grid will traverse to a steady state stable operating point after a disturbance. The transient stability analysis involves computing the solutions of the algebraic equations modeling the grid network and the ordinary differential equations modeling the dynamics of the electrical components like synchronous generators, exciters, governors, etc., of the grid in near real-time. In this research, we investigate the use of time-parallel approach in particular the Parareal algorithm implementation on Graphical Processing Unit using Compute Unified Device Architecture to compute solutions of ordinary differential equations. The numerical solution accuracy and computation time of the Parareal algorithm executing on the GPU are demonstrated on the single machine infinite bus test system. Two types of dynamic model of the single synchronous generator namely the classical and detailed models are studied. The numerical solutions of the ordinary differential equations computed by the Parareal algorithm are compared to that computed using the modified Euler’s method demonstrating the accuracy of the Parareal algorithm executing on GPU. Simulations are performed with varying numerical integration time steps, and the suitability of Parareal algorithm in computing near real-time solutions of ordinary different equations is presented. A speedup of 25× and 31× is achieved with the Parareal algorithm for classical and detailed dynamic models of the synchronous generator respectively compared to the sequential modified Euler’s method. The weak scaling efficiency of the Parareal algorithm when required to solve a large number of ordinary differential equations at each time step due to the increase in sequential computations and associated memory transfer latency between the CPU and GPU is discussed.

Parallel Machine Problems with a Single Server and Release Times

Parallel machine problems with a single server and release times are generalizations of classical parallel machine problems. Before processing, each job must be loaded on a machine, which takes a certain release times and a certain setup times. All these setups have to be done by a single server, which can handle at most one job at a time. In this paper, we continue studying the complexity result for parallel machine problem with a single and release times. New complexity results are derived for special cases.