Sequential quadratic programming-based non-cooperative target distributed hybrid processing optimization method

The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense anti-missile targets defense problem is abstracted as a nonconvex constrained combinatorial optimization problem with the optimization objective of maximizing the degree of contribution of the processing scheme to non-cooperative targets, and the constraints mainly consider geographical conditions and anti-missile equipment resources. The grid discretization concept is used to partition the defense area into network nodes, and the overall defense strategy scheme is described as a nonlinear programming problem to solve the minimum defense cost within the maximum defense capability of the defense system network. In the solution of the minimum defense cost problem, the processing scheme, equipment coverage capability, constraints and node cost requirements are characterized, then a nonlinear mathematical model of the non-cooperative target distributed hybrid processing optimization problem is established, and a local optimal solution based on the sequential quadratic programming algorithm is constructed, and the optimal firepower processing scheme is given by using the sequential quadratic programming method containing non-convex quadratic equations and inequality constraints. Finally, the effectiveness of the proposed method is verified by simulation examples.

Combining reinforcement learning with mathematical programming:An approach for optimal design of heat exchanger networks

Heat integration is important for energy-saving in the process industry.It is linked to the persistently challenging task of optimal design of heat exchanger networks(HEN).Due to the inherent highly nonconvex nonlinear and combinatorial nature of the HEN problem,it is not easy to find solutions of high quality for large-scale problems.The reinforcement learning(RL)method,which learns strategies through ongoing exploration and exploitation,reveals advantages in such area.However,due to the complexity of the HEN design problem,the RL method for HEN should be dedicated and designed.A hybrid strategy combining RL with mathematical programming is proposed to take better advantage of both methods.An insightful state representation of the HEN structure as well as a customized reward function is introduced.A Q-learning algorithm is applied to update the HEN structure using theε-greedy strategy.Better results are obtained from three literature cases of different scales.

Parallel Image Processing: Taking Grayscale Conversion Using OpenMP as an Example

In recent years, the widespread adoption of parallel computing, especially in multi-core processors and high-performance computing environments, ushered in a new era of efficiency and speed. This trend was particularly noteworthy in the field of image processing, which witnessed significant advancements. This parallel computing project explored the field of parallel image processing, with a focus on the grayscale conversion of colorful images. Our approach involved integrating OpenMP into our framework for parallelization to execute a critical image processing task: grayscale conversion. By using OpenMP, we strategically enhanced the overall performance of the conversion process by distributing the workload across multiple threads. The primary objectives of our project revolved around optimizing computation time and improving overall efficiency, particularly in the task of grayscale conversion of colorful images. Utilizing OpenMP for concurrent processing across multiple cores significantly reduced execution times through the effective distribution of tasks among these cores. The speedup values for various image sizes highlighted the efficacy of parallel processing, especially for large images. However, a detailed examination revealed a potential decline in parallelization efficiency with an increasing number of cores. This underscored the importance of a carefully optimized parallelization strategy, considering factors like load balancing and minimizing communication overhead. Despite challenges, the overall scalability and efficiency achieved with parallel image processing underscored OpenMP’s effectiveness in accelerating image manipulation tasks.

Nonlinear Model-Based Process Operation under UncertaintyUsing Exact Parametric Programming

In the present work, two new, （multi-）parametric programming （mp-P）-inspired algorithms for the solutionof mixed-integer nonlinear programming （MINLP） problems are developed, with their main focus being onprocess synthesis problems. The algorithms are developed for the special case in which the nonlinearitiesarise because of logarithmic terms, with the first one being developed for the deterministic case, and thesecond for the parametric case （p-MINLP）. The key idea is to formulate and solve the square system of thefirst-order Karush-Kuhn-Tucker （KKT） conditions in an analytical way, by treating the binary variables and/or uncertain parameters as symbolic parameters. To this effect, symbolic manipulation and solution tech-niques are employed. In order to demonstrate the applicability and validity of the proposed algorithms, twoprocess synthesis case studies are examined. The corresponding solutions are then validated using state-of-the-art numerical MINLP solvers. For p-MINLP, the solution is given by an optimal solution as an explicitfunction of the uncertain parameters.

基于Arduino与Processing的悬挂画图机器人的设计

针对目前的绘画机器人存在价格高、结构复杂、难以实现、功能扩展有限等问题,设计一种基于Arduino与Processing的悬挂式画图机器人。对机器人的软硬件选择、程序设计以及机器人本体结构进行详细的介绍。文中机器人通过控制一支悬挂的笔,使其进行规律的机械运动来绘出用户在上位机中加载的图片。它能在各种垂直的平面上作画,并且作画范围可根据需求进行调整。经多次实验验证,能画出完整的作品,且运行稳定,有一定的应用前景。

The Role of Vacuolar Processing Enzyme

The classification, characters and maturation methods of VPEs were sum- marized, and its regulation function to vacuolar was also analyzed. Furthermore, effects of the enzyme in vacuolar-mediated plant defense mechanism were discussed to point out that VPEs were divided into 3 subfamilies via autocatalytic mature including seed-type VPE, vegetative-type VPE and new-type VPE. Especially, seed- type VPE mediated the process of storage protein, while vegetative-type VPE and new-type VPE regulated and controlled programmed death of plant cells.

Adaptive broadband beamformer for nonuniform linear array based on second order cone programming

Adaptive broadband beamforraing is a key issue in array applications. The adaptive broadband beamformer with tapped delay line （TDL） structure for nonuniform linear array （NLA） is designed according to the rule of minimizing the beamformer＇s output power while keeping the distortionless response （DR） in the direction of desired signal and keeping the constant beamwidth （CB） with the prescribed sidelobe level over the whole operating band. This kind of beamforming problem can be solved with the interior-point method after being converted to the form of standard second order cone programming （SOCP）. The computer simulations are presented which illustrate the effectiveness of our beamformer.

A Neuron-Oriented Programming System

A neruon-oriented programming system based on parallel neural information processing has been presented. With the neural programming system built upon 4～8 process elements(TMS C30), the system has thus provided users high speed, general purpose and large scale neural network application development platforms etc.

Approximate Dynamic Programming for Stochastic Resource Allocation Problems

A stochastic resource allocation model, based on the principles of Markov decision processes(MDPs), is proposed in this paper. In particular, a general-purpose framework is developed, which takes into account resource requests for both instant and future needs. The considered framework can handle two types of reservations(i.e., specified and unspecified time interval reservation requests), and implement an overbooking business strategy to further increase business revenues. The resulting dynamic pricing problems can be regarded as sequential decision-making problems under uncertainty, which is solved by means of stochastic dynamic programming(DP) based algorithms. In this regard, Bellman’s backward principle of optimality is exploited in order to provide all the implementation mechanisms for the proposed reservation pricing algorithm. The curse of dimensionality, as the inevitable issue of the DP both for instant resource requests and future resource reservations,occurs. In particular, an approximate dynamic programming(ADP) technique based on linear function approximations is applied to solve such scalability issues. Several examples are provided to show the effectiveness of the proposed approach.

Optimum blending of iron ore from Choghart stockpiles by using goal programming

Iron and steel industry is an important sector of Iran's economy.Choghart iron ore mine is an important iron ore producer of Iran steel industry.Phosphorous contained in the iron ore concentrates of Choghart mine has a detrimental effect on the steel making process,whereby this causes cracks to form in the refractory lining of blast furnaces.In the past,about 1.43 Mt of low-grade and 4.53 Mt of high-phosphorous materials had been transported to low grade and high phosphorous stockpiles,respectively,for future beneficiation.As a result of the progressive depletion of high-grade ore and establishment of beneficiation plant in Choghart,exploitation of these two stockpiles in this mine became an important issue.In this work,a linear goal programming(GP) model was developed in order to determine the optimum iron ore blend in terms of quality from low grade and high phosphorous stockpiles of Choghart mine.The model was solved by the SOLVER V.9 program.Results show that feeding with acceptable quality(w(Fe)≥50% and w(P)≤1.2%,mass fraction) materials can be blended from stockpiles that satisfy the needs of the Choghart processing line.

Synthesis of refrigeration system based on generalized disjunctive programming model

Refrigeration system holds an important role in process industries. The optimal synthesis cannot only reduce the energy consumption, but also save the production costs. In this study, a general methodology is developed for the optimal design of refrigeration cycle and heat exchanger network(HEN) simultaneously. Taking the heat integration between the external heat sources/sinks and the refrigeration cycle into consideration, a superstructure with sub-coolers is developed. Through defining logical variables that indicate the relative temperature positions of refrigerant streams after sub-coolers, the synthesis is formulated as a Generalized Disjunctive Programming(GDP) problem based on LP transshipment model, with the target of minimizing the total compressor shaft work in the refrigeration system. The GDP model is then reformulated as a Mixed Integer Nonlinear Programming(MINLP) problem with the aid of binary variables and Big-M Constraint Method. The efficacy of the process synthesis model is demonstrated by a case study of ethylene refrigeration system. The result shows that the optimization can significantly reduce the exergy loss as well as the total compression shaft work.

Performance Potential-based Neuro-dynamic Programming for SMDPs

An alpha-uniformized Markov chain is defined by the concept of equivalent infinitesimalgenerator for a semi-Markov decision process (SMDP) with both average- and discounted-criteria.According to the relations of their performance measures and performance potentials, the optimiza-tion of an SMDP can be realized by simulating the chain. For the critic model of neuro-dynamicprogramming (NDP), a neuro-policy iteration (NPI) algorithm is presented, and the performanceerror bound is shown as there are approximate error and improvement error in each iteration step.The obtained results may be extended to Markov systems, and have much applicability. Finally, anumerical example is provided.

Developing of robot flexible processing system for shipbuilding profile steel

A robot flexible processing system of shipbuilding profile steel was developed. The system consists of computer integrated control and robot. An off line programming robot was used for marking and cutting of shipbuilding profile steel. In the system the deformation and position error of profile steel can be detected by precise sensors, and figure position coordinate error resulted from profile steel deformation can be compensated by modifying traveling track of robotic arm online. The practical operation results show that the system performance can meet the needs of profile steel processing.

Improved Group Fuzzy Preference Programming Method Based on Fuzzy Random Theory

A new prioritization method in the analytic hierarchy process （AHP）, which improves the group fuzzy preference programming （GFPP） method, is proposed. The fuzzy random theory is applied in the new prioritization method. By modifying the principle of decision making implied in the GFPP method, the improved group fuzzy preference programming （IGFPP） method is formulated as a fuzzy linear programming problem to maximize the average degree of the group satisfaction with all possible group priority vectors. The IGFPP method inherits the advantages of the GFPP method, and solves the weighting trouble existed in the GFPP method. Numerical tests indicate that the IGFPP method performs more effectively than the GFPP method in the case of very contradictive comparison judgments from decision makers.

Off-line Programming Technology Based on RPC Communication Method and its Application

This paper puts forward a communication programming method between robot and external computer based on RPC (Remote Produce Call) communication method, which realizes robot distributed controlling network system model. And a new Robot off line programming method is built based on this communication method and network model. Further more, as an example, robot auto marking and auto cutting of shipbuilding profile system is developed, which proves the ideas of author’s off line programming and development methods of robot flexible automation system. As a result, this paper presents a new method for developing robot flexible automation system.

Context-aware BPEL workflow system using aspect-oriented programming

Business process execution language(BPEL)is a most recognized standard workflow language.However,it is difficult to be used in the ubiquitous system computing environment because it is difficult to describe the context information in the selection of the flow through the branch.To solve this problem,we propose a new BPEL workflow system with context-awareness by using aspect-oriented programming(AOP).This system is composed of a BPEL system module and a weaving module using AOP for context-aware.The BPEL system module generates a BPEL workflow program.And the weaving module converts a context-aware mark-up language(CAML)document to the aspect-oriented program that is applied to context-aware code without modification of the existing BPEL document.We also define a new document form that is called CAML,which provides a context-aware that is not available in BPEL.The system can generate a context-aware workflow program.It is developed in a way that inserts context information using AOP to provide context-aware services.

Extending Extreme Programming User Stories to Meet ISO 9001 Formality Requirements

For software organizations needing ISO 9001 certification, including those that have adopted agile methodologies, it is important that their software life cycle processes be able to manage the requirements imposed by this certification standard. However, the user stories in the XP agile methodology do not provide auditors with enough evidence that certain steps and activities have been performed in compliance with ISO 9001. This paper proposes an extension to the user story, based on four sub processes related to the CMMI-DEV model: 1) identification of the source of the user story;2) categorization of the non functional requirements;3) identification of the user story relationships;and 4) prioritization of the user stories. These sub processes are aligned with the XP release planning phase, and enhance the ability of user stories to accumulate the information that is mandatory for achieving ISO 9001 certification.

Experimental Study of Methods of Scenario Lattice Construction for Stochastic Dual Dynamic Programming

The stochastic dual dynamic programming (SDDP) algorithm is becoming increasingly used. In this paper we present analysis of different methods of lattice construction for SDDP exemplifying a realistic variant of the newsvendor problem, incorporating storage of production. We model several days of work and compare the profits realized using different methods of the lattice construction and the corresponding computer time spent in lattice construction. Our case differs from the known one because we consider not only a multidimensional but also a multistage case with stage dependence. We construct scenario lattice for different Markov processes which play a crucial role in stochastic modeling. The novelty of our work is comparing different methods of scenario lattice construction. We considered a realistic variant of the newsvendor problem. The results presented in this article show that the Voronoi method slightly outperforms others, but the k-means method is much faster overall.

An Evolutionary Firefly Algorithm, Goal Programming Optimization Approach for Setting the Osmotic Dehydration Parameters of Papaya

An evolutionary nature-inspired Firefly Algorithm (FA) is employed to set the optimal osmotic dehydration parameters in a case study of papaya. In the case, the functional form of the dehydration model is established via a response surface technique with the resulting optimization formulation being a non-linear goal programming model. For optimization, a computationally efficient, FA-driven method is employed and the resulting solution is shown to be superior to those from previous approaches for determining the osmotic process parameters. The final component of this study provides a computational experimentation performed on the FA to illustrate the relative sensitivity of this evolutionary metaheuristic approach over a range of the two key parameters that most influence its running time-the number of iterations and the number of fireflies. This sensitivity analysis revealed that for intermediate-to-high values of either of these two key parameters, the FA would always determine overall optimal solutions, while lower values of either parameter would generate greater variability in solution quality. Since the running time complexity of the FA is polynomial in the number of fireflies but linear in the number of iterations, this experimentation shows that it is more computationally practical to run the FA using a “reasonably small” number of fireflies together with a relatively larger number of iterations than the converse.

创意编程在平面设计中的应用研究——以Processing为例

在信息与数字化技术不断发展的背景下,编程语言从初期的机器语言衍生出许多新的高级语言,每种语言的用途都有区别,特别是在计算机硬件以及互联网的飞速发展下,编程语言的发展得到了显著的提升,而Processing作为一种新型的计算机语言,以数字艺术作为大发展背景。Processing支持Java的语言构架,其最突出的优势就是在语法方面要更加的简易,对于一些视觉作品以及互动媒体的创作有着重要的应用价值。本文以Processing作为创意编程的研究基础,阐述创意编程在平面设计中的应用思路,以期为艺术设计创作与研究提供有益的参考。