This article addresses decentralized robust portfolio optimization based on multiagent systems. Decentralized robust portfolio optimization is first formulated as two distributed minimax optimization problems in a Markowitz return-risk framework. Cooperative-competitive multiagent systems are developed and applied for solving the formulated problems. The multiagent systems are shown to be able to reach consensuses in the expected stock prices and convergence in investment allocations through both intergroup and intragroup interactions. Experimental results of the multiagent systems with stock data from four major markets are elaborated to substantiate the efficacy of multiagent systems for decentralized robust portfolio optimization.In this article, we consider the power scheduling problem of the multihop transmission with limited power resources. For a discrete-time linear time-invariant process, we consider a more practical scenario where the forward-error-correcting (FEC) coding scheme is utilized. An approximate communication model is introduced to formulate the nonanalytical relationship between the consumption of power and the successful-decoding-probability. For the single-hop transmission, we propose an analytical method to figure out the optimal offline scheduling for the finite-time case and the optimal periodic schedule for the infinite-time case. We consider the process and terminal errors simultaneously, and explicitly discuss how different values of parameters affect the optimality. Moreover, we extend our conclusions to the multihop case. In order to deal with the difficulty and complexity brought by the multihop scenario, a novel method based on the equivalent-scheduling matrix (ESM) is proposed to describe the accumulated effects through the multihop transmission. Meanwhile, explicit solutions of the multihop case are provided for finite- and infinite-time cases, respectively. Numerical examples are provided to demonstrate the effectiveness of the proposed methods.The performance of decomposition-based algorithms is sensitive to the Pareto front shapes since their reference vectors preset in advance are not always adaptable to various problem characteristics with no a priori knowledge. For this issue, this article proposes an adaptive reference vector reinforcement learning (RVRL) approach to decomposition-based algorithms for industrial copper burdening optimization. The proposed approach involves two main operations, that is 1) a reinforcement learning (RL) operation and 2) a reference point sampling operation. Given the fact that the states of reference vectors interact with the landscape environment (quite often), the RL operation treats the reference vector adaption process as an RL task, where each reference vector learns from the environmental feedback and selects optimal actions for gradually fitting the problem characteristics. Accordingly, the reference point sampling operation uses estimation-of-distribution learning models to sample new reference points. Finally, the resultant algorithm is applied to handle the proposed industrial copper burdening problem. For this problem, an adaptive penalty function and a soft constraint-based relaxing approach are used to handle complex constraints. Experimental results on both benchmark problems and real-world instances verify the competitiveness and effectiveness of the proposed algorithm.The problem of classifying gas-liquid two-phase flow regimes from ultrasonic signals is considered. A new method, belt-shaped features (BSFs), is proposed for performing feature extraction on the preprocessed data. A convolutional neural network (CNN/ConvNet)-based classifier is then applied to categorize into one of the four flow regimes 1) annular; 2) churn; 3) slug; or 4) bubbly. The proposed ConvNet classifier includes multiple stages of convolution and pooling layers, which both decrease the dimension and learn the classification features. Using experimental data collected from an industrial-scale multiphase flow facility, the proposed ConvNet classifier achieved 97.40%, 94.57%, and 94.94% accuracy, respectively, for the training set, testing set, and validation set. These results demonstrate the applicability of the BSF features and the ConvNet classifier for flow regime classification in industrial applications.Healthcare big data (HBD) allows medical stakeholders to analyze, access, retrieve personal and electronic health records (EHR) of patients. Mostly, the records are stored on healthcare cloud and application (HCA) servers, and thus, are subjected to end-user latency, extensive computations, single point failures, and security and privacy risks.  https://www.selleckchem.com/products/2-aminoethyl-diphenylborinate.html  A joint solution is required to address the issues of responsive analytics, coupled with high data ingestion in HBD and secure EHR access. Motivated from the research gaps, the paper proposes a scheme, that integrates blockchain (BC)-based confidentiality-privacy (CP) preserving scheme, CP-BDHCA, that operates in two phases. In the first phase, elliptic curve cryptographic (ECC)-based digital signature framework, HCA-ECC is proposed to establish a session key for secure communication among different healthcare entities. Then, in the second phase, a two-step authentication framework is proposed that integrates RivestShamirAdleman (RSA) and advanced encryption standard (AES), named as HCARSAE is proposed that safeguards the ecosystem against possible denial-of-service (DoS) and distributed DoS (DDoS) based attack vectors. CP-BDAHCA is compared against existing HCA cloud applications in terms of parameters like response time, average delay, transaction and signing costs, signing and verifying of mined blocks, and resistance to DoS and DDoS attacks. We consider 10 BC nodes and create a real-world customized dataset to be used with SEER dataset. The dataset has 30; 000 patient profiles, with 1000 clinical accounts. Based on the combined dataset the proposed scheme outperforms traditional schemes like AI4SAFE, TEE, Secret, and IIoTEED, with a lower response time. For example, the scheme has a very less response time of 300 ms in DDoS. The average signing cost of mined BC transactions is 3; 34 seconds, and for 205 transactions, has a signing delay of 1405 ms, with improved accuracy of 12% than conventional state-of-the-art approaches.