Distributed Stochastic Optimization with Compression for Non-Strongly Convex Objectives

We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization parameters through the wireless network,large-scale training models can create communication bottlenecks,resulting in slower training times.To address this issue,CHOCO-SGD was proposed,which allows compressing information with arbitrary precision without reducing the convergence rate for strongly convex objective functions.Nevertheless,most convex functions are not strongly convex(such as logistic regression or Lasso),which raises the question of whether this algorithm can be applied to non-strongly convex functions.In this paper,we provide the first theoretical analysis of the convergence rate of CHOCO-SGD on non-strongly convex objectives.We derive a sufficient condition,which limits the fidelity of compression,to guarantee convergence.Moreover,our analysis demonstrates that within the fidelity threshold,this algorithm can significantly reduce transmission burden while maintaining the same convergence rate order as its no-compression equivalent.Numerical experiments further validate the theoretical findings by demonstrating that CHOCO-SGD improves communication efficiency and keeps the same convergence rate order simultaneously.And experiments also show that the algorithm fails to converge with low compression fidelity and in time-varying topologies.Overall,our study offers valuable insights into the potential applicability of CHOCO-SGD for non-strongly convex objectives.Additionally,we provide practical guidelines for researchers seeking to utilize this algorithm in real-world scenarios.

A Distributed Particle Filter Applied in Single Object Tracking

Visual object-tracking is a fundamental task applied in many applications of computer vision. Particle filter is one of the techniques which has been widely used in object tracking. Due to the virtue of extendability and flexibility on both linear and non-linear environments, various particle filter-based trackers have been proposed in the literature. However, the conventional approach cannot handle very large videos efficiently in the current data intensive information age. In this work, a parallelized particle filter is provided in a distributed framework provided by the Hadoop/Map-Reduce infrastructure to tackle object-tracking tasks. The experiments indicate that the proposed algorithm has a better convergence and accuracy as compared to the traditional particle filter. The computational power and the scalability of the proposed particle filter in single object tracking have been enhanced as well.

A Performance-Driven Approach for Restructuring Distributed Object-Oriented Software

Object oriented techniques make applications substantially easier to build by providing a high-level platform for appli-cation development. There have been a large number of projects based on the Distributed Object Oriented approach for solving complex problems in various scientific fields. One important aspect of Distributed Object Oriented systems is the efficient distribution of software classes among different processors. The initial design of the Distributed Object Oriented application does not necessarily have the best class distribution and may require to be restructured. In this paper, we propose a methodology for efficiently restructuring the Distributed Object Oriented software systems to get better performance. We use Distributed Object-Oriented performance (DOOP) model as guidance for our restructuring methodology. The proposed methodology consists of two phases. The first phase introduces a recursive graph clustering technique to partition the OO system into subsystems with low coupling. The second phase is concerned with mapping the generated partitions to the set of available machines in the target distributed architecture.

Comprehensive Evaluation of Distributed PV Grid-Connected Based on Combined Weighting Weights and TOPSIS-RSR Method

To effectively quantify the impact of distributed photovoltaic(PV)access on the distribution network,this paper proposes a comprehensive evaluation method of distributed PV grid connection combining subjective and objective combination of assignment and technique for order preference by similarity to an ideal solution(TOPSIS)—rank sum ratio(RSR)(TOPSIS-RSR)method.Based on the traditional distribution network evaluation system,a comprehensive evaluation system has been constructed.It fully considers the new development requirements of distributed PV access on the environmental friendliness and absorptive capacity of the distribution grid and comprehensively reflects the impact of distributed PV grid connection.The analytic hierarchy process(AHP)was used to determine the subjective weights of the primary indicators,and the Spearman consistency test was combined to determine the weights of the secondary indicators based on three objective assignment methods.The subjective and objective combination weights of each assessment indicator were calculated through the principle of minimum entropy.Calculate the distance between the indicators to be evaluated and the positive and negative ideal solutions,the relative closeness ranking,and qualitative binning by TOPSIS-RSR method to obtain the comprehensive evaluation results of different scenarios.By setting up different PV grid-connected scenarios and utilizing the IEEE33 node simulation algorithm,the correctness and effectiveness of the proposed subject-object combination assignment and integrated assessment method are verified.

Analysis and Design of Soils and Terrain Digital Database (SOTER) Management System Based on Object-Oriented Method

A SOTER management system was developed by analyzing, designing, programming, testing, repeated proceeding and progressing based on the object-oriented method. The function of the attribute database management is inherited and expanded in the new system. The integrity and security of the SOTER database are enhanced. The attribute database management, the spatial database management and the model base are integrated into SOTER based on the component object model (COM), and the graphical user interface (GUI) for Windows is used to interact with clients, thus being easy to create and maintain the SOTER, and convenient to promote the quantification and automation of soil information application.

Distributed Parallelization of a Global Atmospheric Data Objective Analysis System

It is difficult to parallelize a subsistent sequential algorithm. Through analyzing the sequential algorithm of a Global Atmospheric Data Objective Analysis System, this article puts forward a distributed parallel algorithm that statically distributes data on a massively parallel processing (MPP) computer. The algorithm realizes distributed parailelization by extracting the analysis boxes and model grid point Iatitude rows with leaped steps, and by distributing the data to different processors. The parallel algorithm achieves good load balancing, high parallel efficiency, and low parallel cost. Performance experiments on a MPP computer arc also presented.

Data Utilization-Based Adaptive Data Management Method for Distributed Storage System in WAN Environment

Recently,research on a distributed storage system that efficiently manages a large amount of data has been actively conducted following data production and demand increase.Physical expansion limits exist for traditional standalone storage systems,such as I/O and file system capacity.However,the existing distributed storage system does not consider where data is consumed and is more focused on data dissemination and optimizing the lookup cost of data location.And this leads to system performance degradation due to low locality occurring in a Wide Area Network(WAN)environment with high network latency.This problem hinders deploying distributed storage systems to multiple data centers over WAN.It lowers the scalability of distributed storage systems to accommodate data storage needs.This paper proposes a method for distributing data in a WAN environment considering network latency and data locality to solve this problem and increase overall system performance.The proposed distributed storage method monitors data utilization and locality to classify data temperature as hot,warm,and cold.With assigned data temperature,the proposed algorithm adaptively selects the appropriate data center and places data accordingly to overcome the excess latency from the WAN environment,leading to overall system performance degradation.This paper also conducts simulations to evaluate the proposed and existing distributed storage methods.The result shows that our proposed method reduced latency by 38%compared to the existing method.Therefore,the proposed method in this paper can be used in large-scale distributed storage systems over a WAN environment to improve latency and performance compared to existing methods,such as consistent hashing.

On Distributed Object Storage Architecture Based on Mimic Defense

With the advent of the era of big data,cloud computing,Internet of things,and other information industries continue to develop.There is an increasing amount of unstructured data such as pictures,audio,and video on the Internet.And the distributed object storage system has become the mainstream cloud storage solution.With the increasing number of distributed applications,data security in the distributed object storage system has become the focus.For the distributed object storage system,traditional defenses are means that fix discovered system vulnerabilities and backdoors by patching,or means to modify the corresponding structure and upgrade.However,these two kinds of means are hysteretic and hardly deal with unknown security threats.Based on mimic defense theory,this paper constructs the principle framework of the distributed object storage system and introduces the dynamic redundancy and heterogeneous function in the distributed object storage system architecture,which increases the attack cost,and greatly improves the security and availability of data.

A Jave-Based Multi-tier Distributed Object Enterprise Computing Model

In this paper, we adopt Java platform to achieve a multi-tier distributed object enterprise computing model which provides an open, flexible, robust and cross-platform standard for enterprise applications of new generation. In addition to this model, we define remote server objects as session or entity objects according to their roles in a distributed application server, which separate information details from business operations for software reuse. A web store system is implement by using this multi-tier distributed object enterprise computing model.

Distributed Alternating Direction Method of Multipliers for Multi-Objective Optimization

In this paper, a distributed algorithm is proposed to solve a kind of multi-objective optimization problem based on the alternating direction method of multipliers. Compared with the centralized algorithms, this algorithm does not need a central node. Therefore, it has the characteristics of low communication burden and high privacy. In addition, numerical experiments are provided to validate the effectiveness of the proposed algorithm.

Development of a distributed and integratable manufacturing execution system framework

Using remote method invocation (RMI) and a distributed object-oriented technique, this paper presents a systematic approach to developing a manufacturing execution system (MES) framework, which is open, modularized, distributed, configurable, interoperable and maintainable. Moreover, the design patterns for the framework .are developed and a variety of functional components are designed by inheriting appropriate patterns. And then an application is constructed by invoking corresponding methods of related components. An MES system implementing the framework and design patterns can be facilely integrated with other manufacturing applications, such as enterprise resource planning (ERP) and floor control system (FCS) .

Robust Airfoil Optimization with Multi-objective Estimation of Distribution Algorithm

A transonic airfoil designed by means of classical point-optimization may result in its dramatically inferior performance under off-design conditions. To overcome this shortcoming, robust design is proposed to find out the optimal profile of an airfoil to maintain its performance in an uncertain environment. The robust airfoil optimization is aimed to minimize mean values and variances of drag coefficients while satisfying the lift and thickness constraints over a range of Mach numbers. A multi-objective estimation of distribution algorithm is applied to the robust airfoil optimization on the base of the RAE2822 benchmark airfoil. The shape of the airfoil is obtained through superposing ten Hick-Henne shape functions upon the benchmark airfoil. A set of design points is selected according to a uniform design table for aerodynamic evaluation. A Kriging model of drag coefficient is constructed with those points to reduce computing costs. Over the Mach range from 0.7 to 0.8, the airfoil generated by the robust optimization has a configuration characterized by supercritical airfoil with low drag coefficients. The small fluctuation in its drag coefficients means that the performance of the robust airfoil is insensitive to variation of Mach number.

Sediment distribution pattern mapped from the combination of objective analysis and geostatistics in the large shallow Taihu Lake, China

Investigation was made into sediment depth at 723 irregularly scattered measurement points which cover all the regions in Taihu Lake, China. The combination of successive correction scheme and geostatistical method was used to get all the values of recent sediment thickness at the 69×69 grids in the whole lake. The results showed that there is the significant difference in sediment depth between the eastern area and the western region, and most of the sediments are located in the western shore-line and northern regimes but just a little in the center and eastern parts. The notable exception is the patch between the center and Xishan Island where the maximum sediment depth is more than 4.0 m. This sediment distribution pattern is more than likely related to the current circulation pattern induced by the prevailing wind-forcing in Taihu Lake. The numerical simulation of hydrodynamics can strong support the conclusion. Sediment effects on water quality was also studied and the results showed that the concentrations of TP, TN and SS in the western part are obviously larger than those in the eastern regime, which suggested that more nutrients can be released from thicker sediment areas.

A compound objective reconfiguration of distribution networks using hierarchical encoded particle swarm optimization

With the development of automation in smart grids,network reconfiguration is becoming a feasible approach for improving the operation of distribution systems.A novel reconfiguration strategy was presented to get the optimal configuration of improving economy of the system,and then identifying the important nodes.In this strategy,the objectives increase the node importance degree and decrease the active power loss subjected to operational constraints.A compound objective function with weight coefficients is formulated to balance the conflict of the objectives.Then a novel quantum particle swarm optimization based on loop switches hierarchical encoded was employed to address the compound objective reconfiguration problem.Its main contribution is the presentation of the hierarchical encoded scheme which is used to generate the population swarm particles of representing only radial connected solutions.Because the candidate solutions are feasible,the search efficiency would improve dramatically during the optimization process without tedious topology verification.To validate the proposed strategy,simulations are carried out on the test systems.The results are compared with other techniques in order to evaluate the performance of the proposed method.

Multi-objective Optimisation Design of Water Distribution Systems:Comparison of Two Evolutionary Algorithms

In order to compare two advanced multi-objective evolutionary algorithms,a multi-objective water distribution problem is formulated in this paper.The multi-objective optimization has received more attention in the water distribution system design.On the one hand the cost of water distribution system including capital,operational,and maintenance cost is mostly concerned issue by the utilities all the time;on the other hand improving the performance of water distribution systems is of equivalent importance,which is often conflicting with the previous goal.Many performance metrics of water networks are developed in recent years,including total or maximum pressure deficit,resilience,inequity,probabilistic robustness,and risk measure.In this paper,a new resilience metric based on the energy analysis of water distribution systems is proposed.Two optimization objectives are comprised of capital cost and the new resilience index.A heuristic algorithm,speedconstrained multi-objective particle swarm optimization( SMPSO) extended on the basis of the multi-objective particle swarm algorithm,is introduced to compare with another state-of-the-art heuristic algorithm,NSGA-II.The solutions are evaluated by two metrics,namely spread and hypervolume.To illustrate the capability of SMPSO to efficiently identify good designs,two benchmark problems( two-loop network and Hanoi network) are employed.From several aspects the results demonstrate that SMPSO is a competitive and potential tool to tackle with the optimization problem of complex systems.

Novel Approach for Motion Planning of Multiple Distributed Agent-based Robotic

In this paper, the Distributed Agent based Multirobots Assembly System(DAMAS) is introduced. Then, on the baseis of survey of previous research work on motion planning of multiple robots, a novel approach for the motion planning of multi cooperating robots is presented. This approach takes advantages of the Agent theory and the authors built computer network environment, together with the distributed object technology provided and supported by Windows NT and Visual C++.

Internet based design of distributed virtual environment for multi-robot teleoperation

Studies the design of distributed virtual environments （DVEs） for tele-multi-robotics. The proposed design, incorporating two models （ distributlon-supported model and VE-supported model）, attempts to represent common functionality, communication issues, and requirements found in multi-operator DVEs. The distribution-supported model concentrates on the introduction of computer-supported collaborative work （CSCW） to realize the coordination of multi-operators, while the VE-supported model concentrates on the utilization of an object-oriented approach to strengthen the expandability and robustness of the system. Finally, the configuration anti running environments of the system are given.

Efficiency and Feasibility of an Integrated Algorithm for Distributed Hydrological M odel Calibration

Increasing complexity of distributed hydrological model （DHM） has lowered the efficiency of convergence.In this study,global sensitivity analysis （SA） was introduced by combining multiobjective （MO） optimization for DHM calibration.Latin Hypercube-once at a time （LH-OAT） was adopted in global parameter SA to obtain relative sensitivity of model parameter,which can be categorized into different sensitivity levels.Two comparative study cases were conducted to present the efficiency and feasibility by combining SA with MO（SA-MO）.WetSpa model with non-dominated sorting genetic algorithm-Ⅱ （NSGA-Ⅱ） algorithm and EasyDHM model with multi-objective sequential complex evolutionary metropolis-uncertainty analysis （MOSCEM-UA）algorithm were adopted to demonstrate the general feasibility of combining SA in optimization.Results showed that the LH-OAT was globally effective in selecting high sensitivity parameters.It proves that using parameter from high sensitivity groups results in higher convergence efficiency.Study case Ⅰ showed a better Pareto front distribution and convergence compared with model calibration without SA.Study case Ⅱ indicated a more efficient convergence of parameters in sequential evolution of MOSCEM-UA under the same iteration.It indicates that SA-MO is feasible and efficient for high dimensional DHM calibration.

Estimation of Distribution Algorithm with Multivariate <i>T</i>-Copulas for Multi-Objective Optimization

Estimation of distribution algorithms are a class of evolutionary optimization algorithms based on probability distribution model. In this article, a Pareto-based multi-objective estimation of distribution algorithm with multivariate T-copulas is proposed. The algorithm employs Pareto-based approach and multivariate T-copulas to construct probability distribution model. To estimate joint distribution of the selected solutions, the correlation matrix of T-copula is firstly estimated by estimating Kendall’s tau and using the relationship of Kendall’s tau and correlation matrix. After the correlation matrix is estimated, the degree of freedom of T-copula is estimated by using the maximum likelihood method. Afterwards, the Monte Carte simulation is used to generate new individuals. An archive with maximum capacity is used to maintain the non-dominated solutions. The Pareto optimal solutions are selected from the archive on the basis of the diversity of the solutions, and the crowding-distance measure is used for the diversity measurement. The archive gets updated with the inclusion of the non-dominated solutions from the combined population and current archive, and the archive which exceeds the maximum capacity is cut using the diversity consideration. The proposed algorithm is applied to some well-known benchmark. The relative experimental results show that the algorithm has better performance and is effective.