Search

In this paper, we have the percussive rotational drilling regime that is determined by the combination of the rotational speed of the tool, the axial force applied on the rock the optimal values of these parameters d epend in particular on the type of tool and on the physico mechanical properties of the rocks to be felled. The aim of the research is to improve the operating regimes of percussive d rilling machines under the conditions of the Algerian limestone quarries (Hadjar soud quarry) and to obtain a better compromise between the technical and economic indices, in order to ensure a minimum cost price for a meter of drilled hole. The experimenta l results carried that this methodology, which consists of assuming that under the concrete conditions can find the combination of the setting parameters that ensure the best techno economic indices, as well as to carpenter the cost price for a meter of dr illed holes.

With the rapid progress of wireless communication technologies along with their digital revolutions, the quantity of Internet of Things (IoT) has been increased by manifolds resulting in a huge increase in data volume and network traffic. It became easier for an intruder to pretend as a valid service provider, and generate different types of network attacks. This becomes even more severe when the service involves digital financial transactions. This paper proposes an intrusion detection system (IDS) based on a stacked autoencoder (AE) and a deep neural network (DNN). The stacked AE learns the features of the input network record in an unsupervised manner to decrease the feature width. Then, the DNN is trained in a supervised manner to extract deep-learned features for the classifier. In the proposed system, the stacked AE has two latent layers and the DNN has two or three layers, where each layer has a fully-connected layer, a batch normalization, and a dropout. The system was evaluated on three publicly available datasets: KDDCup99, NSL-KDD, and AWID. Experimental results exhibited that the proposed IDS achieved 94.2%, 99.7%, 99.9% accuracy, respectively, for multiclass classification.

In this paper, we propose and analyze SPARQ-SGD, an event-triggered and compressed algorithm for decentralized training of large-scale machine learning models over a graph. Each node can locally compute a condition (event) which triggers a communication where quantized and sparsified local model parameters are sent. In SPARQ-SGD, each node first takes a fixed number of local gradient steps and then checks if the model parameters have significantly changed compared to its last update; it communicates further compressed model parameters only when there is a significant change, as specified by a (design) criterion. We prove that SPARQ-SGD converges as $O\left( {\frac{1}{{nT}}} \right)$ and $O\left( {\frac{1}{{\sqrt {nT} }}} \right)$ in the strongly-convex and non-convex settings, respectively, demonstrating that aggressive compression, including event-triggered communication, model sparsification and quantization does not affect the overall convergence rate compared to uncompressed decentralized training; thereby theoretically yielding communication efficiency for ‘free’. We evaluate SPARQ-SGD over real datasets to demonstrate significant savings in communication bits over the state-of-the-art.

One of the combinatorial optimization problems is Knapsack problem, which aims to maximize the benefit of objects whose weight not exceeding the capacity of knapsack. This paper introduces artificial bee colony algorithm to select a subset of project and represented by knapsack problem to put the best investment plan which achieve the highest profits within a determined costs, this plan is one of the applications of the financial field. The result from the proposed algorithm implemented by matlab (8.3) show the ability to find best solution with precisely and rapidity compared to genetic algorithm http://dx.doi.org/10.25130/tjps.23.2018.039

Recently, various algorithms for data-driven simulation and control have been proposed based on the Willems' fundamental lemma. However, when collected data are noisy, these methods lead to ill-conditioned data-driven model structures. In this work, we present a maximum likelihood framework to obtain an optimal data-driven model, the signal matrix model, in the presence of output noise. Data compression and noise level estimation schemes are also proposed to apply the algorithm efficiently to large datasets and unknown noise level scenarios. Two approaches in system identification and receding horizon control are developed based on the derived optimal estimator. The first one identifies a finite impulse response model. This approach improves the least-squares estimator with less restrictive assumptions. The second one applies the signal matrix model as the predictor in predictive control. The control performance is shown to be better than existing data-driven predictive control algorithms, especially under high noise levels. Both approaches demonstrate that the derived estimator provides a promising framework to apply data-driven algorithms to noisy data., IEEE Transactions on Automatic Control, 68 (1), ISSN:0018-9286, ISSN:1558-2523

This paper studies periodic event-triggered networked control for nonlinear systems, where the plants and controllers are connected by multiple independent communication channels. Several network-induced imperfections are considered simultaneously, including time-varying inter-sampling times, sensor node scheduling, and especially, large time-varying transmission delays, where the transmitted signal may arrive at the destination node after the next transmission occurs. A new hybrid system approach is provided to model the closed-loop system that contains all communication related behavior. Then, by constructing new storage functions on the system state and updating errors, the relationship between the maximum allowable sampling period (MASP) and maximum allowable delay number in sampling (MADNS) is analyzed, where the latter denotes how many inter-sampling periods can be included in one transmission delay. Moreover, to efficiently reduce unnecessary transmissions, a new dynamic event-triggered control scheme is proposed, where the event-triggering conditions are detected only at aperiodic and asynchronous sampling instants. From emulation-based method, where the controllers are initially designed by ignoring all the network-induced imperfections, sufficient conditions on the dynamic event-triggered control are given to ensure closed-loop input-to-state stability with respect to external disturbances. Moreover, according to different capacities of the communication channels, the corresponding implementation strategies of the designed dynamic event-triggered control schemes are discussed. Finally, two nonlinear examples are simulated to illustrate the feasibility and efficiency of the theoretical results., Comment: 18 pages, 6 figures, 3 tables

Physiological studies have shown that there are some differences in speech and facial activities between depressive and healthy individuals. Based on this fact, we propose a novel Spatio-Temporal Attention (STA) network and a Multimodal Attention Feature Fusion (MAFF) strategy to obtain the multimodal representation of depression cues for predicting the individual depression level. Specifically, we firstly divide the speech amplitude spectrum/video into fixed-length segments and input these segments into the STA network, which not only integrates the spatial and temporal information through attention mechanism, but also emphasizes the audio/video frames related to depression detection. The audio/video segment-level feature is obtained from the output of the last full connection layer of the STA network. Secondly, this paper employs the eigen evolution pooling method to summarize the changes of each dimension of the audio/video segment-level features to aggregate them into the audio/video level feature. Thirdly, the multimodal representation with modal complementary information is generated using the MAFF and inputs into the support vector regression predictor for estimating depression severity. Experimental results on the AVEC2013 and AVEC2014 depression databases illustrate the effectiveness of our method.

Textual emotion detection is an attractive task while previous studies mainly focused on polarity or single-emotion classification. However, human expressions are complex, and multiple emotions often occur simultaneously with non-negligible emotion correlations. In this paper, a Multi-label Emotion Detection Architecture (MEDA) is proposed to detect all associated emotions expressed in a given piece of text. MEDA is mainly composed of two modules: Multi-Channel Emotion-Specified Feature Extractor (MC-ESFE) and Emotion Correlation Learner (ECorL). MEDA captures underlying emotion-specified features through MC-ESFE module in advance. MC-ESFE is composed of multiple channel-wise ESFE networks. Each channel is devoted to the feature extraction of a specified emotion from sentence-level to context-level through a hierarchical structure. Based on obtained features, emotion correlation learning is implemented through an emotion sequence predictor in ECorL. During model training, we define a new loss function, which is called multi-label focal loss. With this loss function, the model can focus more on misclassified positive-negative emotion pairs and improve the overall performance by balancing the prediction of positive and negative emotions. The evaluation of proposed MEDA architecture is carried out on emotional corpus: RenCECps and NLPCC2018 datasets. The experimental results indicate that the proposed method can achieve better performance than state-of-the-art methods in this task.

In this article, a three-axis attitude manoeuvre spacecraft consisting of a central rigid body and a rotating solar array is studied. The rotating solar array is considered a disturbance to the spacecraft. In the design of the controller, the coupled terms and the rotating solar array are considered a disturbance. The improved extended state observer is proposed by combing the sliding mode observer with the originally extended state observer to estimate the disturbance. The sliding mode control method is adopted to adjust the attitude of the spacecraft. Numerical simulations are presented to demonstrate the outstanding performance of the present observer.

In this paper, we study detectability problem of Networked Discrete Event Systems (NDES) where the communication between the plant and the agent is carried out through a network that can have several channels, so that, communication delays can cause changes in the order of the observations, and, also, loss of observations. We deploy an approach previously presented in the literature to construct an untimed nondeterministic automaton that models the behavior of a NDES, and, based on this model, we present a methodology for the state estimation of NDES, and new networked D-detectability definitions. Finally, we show that the NDES is networked D-detectable if, and only if, the equivalent untimed nondeterministic model is D-detectable.

Aquaponics, one of the vertical farming methods, is a combination of aquaculture and hydroponics. To enhance the production capabilities of the aquaponics system and maximize crop yield on a commercial level, integration of Industry 4.0 technologies is needed. Industry 4.0 is a strategic initiative characterized by the fusion of emerging technologies such as big data and analytics, internet of things, robotics, cloud computing, and artificial intelligence. The realization of aquaponics 4.0, however, requires an efficient flow and integration of data due to the presence of complex biological processes. A key challenge in this essence is to deal with the semantic heterogeneity of multiple data resources. An ontology that is regarded as one of the normative tools solves the semantic interoperation problem by describing, extracting, and sharing the domains’ knowledge. In the field of agriculture, several ontologies are developed for the soil-based farming methods, but so far, no attempt has been made to represent the knowledge of the aquaponics 4.0 system in the form of an ontology model. Therefore, this study proposes a unified ontology model, AquaONT, to represent and store the essential knowledge of an aquaponics 4.0 system. This ontology provides a mechanism for sharing and reusing the aquaponics 4.0 system’s knowledge to solve the semantic interoperation problem. AquaONT is built from indoor vertical farming terminologies and is validated and implemented by considering experimental test cases related to environmental parameters, design configuration, and product quality. The proposed ontology model will help vertical farm practitioners with more transparent decision-making regarding crop production, product quality, and facility layout of the aquaponics farm. For future work, a decision support system will be developed using this ontology model and artificial intelligence techniques for autonomous data-driven decisions.

This paper develops a safety analysis method for stochastic systems that is sensitive to the possibility and severity of rare harmful outcomes. We define risk-sensitive safe sets as sub-level sets of the solution to a non-standard optimal control problem, where a random maximum cost is assessed via Conditional Value-at-Risk (CVaR). The objective function represents the maximum extent of constraint violation of the state trajectory, averaged over a given percentage of worst cases. This problem is well-motivated but difficult to solve tractably because the temporal decomposition for CVaR is history-dependent. Our primary theoretical contribution is to derive computationally tractable under-approximations to risk-sensitive safe sets. Our method provides a novel, theoretically guaranteed, parameter-dependent upper bound to the CVaR of a maximum cost without the need to augment the state space. For a fixed parameter value, the solution to only one Markov decision process problem is required to obtain the under-approximations for any family of risk-sensitivity levels. In addition, we propose a second definition for risk-sensitive safe sets and provide a tractable method for their estimation without using a parameter-dependent upper bound. The second definition is expressed in terms of a new coherent risk functional, which is inspired by CVaR. We demonstrate our primary theoretical contribution via numerical examples.

In this paper, a non‐negative matrix factorization feature expansion (NMFFE) approach was proposed to overcome the feature‐sparsity issue when expanding features of short‐text. First, we took the internal relationships of short texts and words into account when segmenting words from texts and constructing their relationship matrix. Second, we utilized the Dual regularization non‐negative matrix tri‐factorization (DNMTF) algorithm to obtain the words clustering indicator matrix, which was used to get the feature space by dimensionality reduction methods. Thirdly, words with close relationship were selected out from the feature space and added into the short‐text to solve the sparsity issue. The experimental results showed that the accuracy of short text classification of our NMFFE algorithm increased 25.77%, 10.89%, and 1.79% on three data sets: Web snippets, Twitter sports, and AGnews, respectively compared with the Word2Vec algorithm and Char‐CNN algorithm. It indicated that the NMFFE algorithm was better than the BOW algorithm and the Char‐CNN algorithm in terms of classification accuracy and algorithm robustness.

International audience

International audience

This article proposes a model predictive control as a secure service (MPCaaSS) framework for cyber-physical systems (CPS) in the presence of both cyber threats and external disturbances. Firstly, in order to take advantage of the cloud-edge computing, we design a double-layer controller architecture by using a novel control parameterization based on Gaussian radial basis functions. In this controller architecture, the cloud-side controller optimizes the controller parameters of the edge-side controller, whereas the edge-side controller implements the real-time control law using the generated controller parameters. Secondly, in order to securely transmit data packets, we integrate an encoding scheme and an elliptic curve cryptography (ECC) based encryption into the proposed MPCaaSS framework. Then, the controller parameters and the state measurements can be encrypted such that no malicious attackers can corrupt and intercept the transmission. It is shown that the recursive feasibility of MPCaaSS is achieved under some sufficient conditions, and the robust stability of the closed-loop system is guaranteed if the optimization problem is recursively feasible. Simulated examples are conducted to demonstrate the effectiveness of the proposed method.

The clustering of incomplete patterns is a very challenging task because the estimations may negatively affect the distribution of real centers and thus cause uncertainty and imprecision in the results. To address this problem, a new belief-based incomplete pattern unsupervised classification method (BPC) is proposed in this paper. Firstly, the complete patterns are grouped into a few clusters by a classical soft method like fuzzy c-means to obtain the corresponding reliable centers and thereby are partitioned into reliable patterns and unreliable ones by an optimization method. Secondly, a basic classifier trained by reliable patterns is employed to classifies unreliable patterns and the incomplete patterns edited by the neighbors. In this way, most of the edited incomplete patterns can be submitted to specific clusters. Finally, some ambiguous patterns will be carefully repartitioned again by a new distance-based rule depending on the obtained reliable centers and belief functions theory. By doing this, a few patterns that are very difficult to classify between different specific clusters will be reasonably submitted to meta-cluster which can characterize the uncertainty and imprecision of the clusters due to missing values. The simulation results show that the BPC has the potential to deal with real datasets. © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

The control of a microgrid is quite challenging thus this work implements a robust and fast control technique based on circular limited cycle oscillator frequency locked loop with inner loop filter (CLO-FLL-WIF) for switching operation between an islanded and the grid-connected modes. This microgrid combing solar PV (Photovoltaic) generation, SyRG (Synchronous Reluctance Generator) for pico-hydro generation, and the battery, which works in both standalone and grid-connected modes while feeding local loads uninterruptedly. The output power conversion of a PV array is influenced by irradiation of solar PV array and has low efficiency, therefore, a MPPT (Maximum Power Point Tracking) namely an INC (Incremental Conductance) method is used. In the implemented system, the interfaced power converter is gated in the grid-connected mode and islanded mode using same enhanced second order generalized integrator with a modified frequency locked loop (ESOGI-MFLL) control method. The comparative results validate that the response of ESOGI-MFLL in comparison to the existing control algorithm, is faster under load and generation perturbations. The implemented control techniques are used for fundamental extraction of load component of voltage and current for assessment of reference currents with their respective phases of synchronization while maintaining the required IEEE power quality standard-519. Simulated results of a microgrid for grid-tied PV-BES-SyRG are obtained in MATLAB/Simulink platform to demonstrate its performance.

The target's threat prediction is an essential procedure for the situation analysis in an aerial defense system. However, the traditional threat prediction methods mostly ignore the effect of commander's emotion. They only predict a target's present threat from the target's features itself, which leads to their poor ability in a complex situation. To aerial targets, this paper proposes a method for its potential threat prediction considering commander emotion (PTP-CE) that uses the Bi-directional LSTM (BiLSTM) network and the backpropagation neural network (BP) optimized by the sparrow search algorithm (SSA). Furthermore, we use the BiLSTM to predict the target's future state from real-time series data, and then adopt the SSA-BP to combine the target's state with the commander's emotion to establish a threat prediction model. Therefore, the target's potential threat level can be obtained by this threat prediction model from the predicted future state and the recognized emotion. The experimental results show that the PTP-CE is efficient for aerial target's state prediction and threat prediction, regardless of commander's emotional effect.

To improve the safety of HMX, HMX/NH2-GO composite was prepared with aqueous ammonia functionalized graphene oxide (NH2-GO). The composite was characterized by SEM, Zeta potential, XPS, Raman spectrum, XRD, HPLC, DSC and BAM sensitivity test. The results indicated that the functionalization with aqueous ammonia can enhance the interaction between GO and HMX, and more efficiently desensitize the explosive. The optimal impact sensitivity of the HMX/NH2-GO composite can be not less than 40 J, which is also the most insensitivity compared to the previous reports prepared by coating desensitization with non-energetic desensitized material. Moreover, the potential reason for the different impact and friction sensitivity was also discussed, which may bring a novel perspective to achieve the desensitization of energetic material.

In this article, a distributed adaptive event-triggered formation control strategy is proposed for unified nonlinear heterogeneous multiagent systems under uncertainties and disturbances to achieve time-varying formations. To reduce the frequency of data transmission, a distributed dual adaptive observer with an event-triggered strategy is developed to estimate the states of a reference exosystem. Without incurring prior global information about a communication graph, a novel robust formation controller, with dynamic distributed compensators for uncertainties and disturbances, is designed based on an observer result and a nonlinear internal control principle. Finally, both simulation and experiment are conducted for tracking and patrolling formation to verify the effectiveness of the proposed formation control strategy and its robustness.

Due to many applications, the Choquet integral as a powerful tool for modeling non-deterministic problems needs to be further extended. Therefore the paper is devoted to a generalization of the Choquet integral. As a basis, the pseudo-integral for bounded integrand is extended to the case for nonnegative integrands at first, and then the generalized Choquet integral is defined. As special cases, pseudo-Choquet Stieltjes integrals, pseudo-fuzzy Stieltjes integrals, g-Choquet integrals, pseudo-(N)fuzzy integrals and pseudo-(S)fuzzy integrals are obtained, and various kinds of properties and convergence theorems are shown, meanwhile Markov, Jensen, Minkowski and Holder inequalities are proved. In the end, the generalized discrete Choquet integral is discussed. The obtained results for the generalized Choquet integral cover some previous results on different types of nonadditive integrals.

In this article, the problem of H∞ codesign for nonlinear control systems with unmatched uncertainties and adjustable parameters is investigated. The main purpose is to solve the adjustable parameters and H∞ controller simultaneously so that better robust control performance can be achieved. By introducing a bounded function and defining a special cost function, the problem of solving the Hamilton-Jacobi-Isaacs equation is transformed into an optimization problem with nonlinear inequality constraints. Based on the sum of squares technique, a novel policy iteration algorithm is proposed to solve the problem of the H∞ codesign. Moreover, one modified algorithm for optimizing the robust performance index is given. The convergence and the performance improvement of new iteration policy algorithms are proved. Simulation results are presented to demonstrate the effectiveness of the proposed algorithms.

There are several approaches for evaluating conflict within belief functions. In this paper, we develop one of them based on axioms and show its connections to the decomposition approach. We describe a class of conflict measures satisfying this system of axioms and show that measuring conflict can be realized through the clusterization of a body of evidence. We also show that well-known conflict measures like the auto-conflict measure and the measure of dissonance do not satisfy the proposed system of axioms. We also tackle the problem of simplifying a body of evidence based on clusterization and show the application of developed theoretical constructions for data processing.

The problem of finite-time prescribed performance control (PPC) for spacecraft attitude maneuvering is researched. To the best of the authors' knowledge, limited results have been reported. How to achieve the prescribed performance attitude tracking within a preset time interval is still an open problem, especially in the presence of inertia perturbations, external disturbances, actuator saturations, and faults. On account of this, a finite-time performance function is first constructed as the predefined boundary of tracking errors. Second, Chebyshev neural network is utilized to approximate the lumped uncertainties. Then, the Nussbaum gain technique compensating for actuator saturations and faults is incorporated into the backstepping design to develop a new fault-tolerant attitude controller. Both transient and steady-state performances (e.g., the maximum overshoot, steady-state error, and settling time) are guaranteed. Compared with the common PPC or finite-time control achievements on spacecraft attitude tracking, the setting time herein can be set in advance without relying on initial states. Finally, experiments are performed to verify the effectiveness of the solution and comparisons with related works are displayed. National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [61773108]; Natural Sciences and Engineering Research Council of CanadaNatural Sciences and Engineering Research Council of Canada (NSERC)CGIAR This work was supported in part by the National Natural Science Foundation of China under Grant 61773108, and in part by the Natural Sciences and Engineering Research Council of Canada.

In this article, an aperiodic sampled-data control problem is investigated for polytopic uncertain switched complex dynamical networks subject to actuator saturation. Due to the constraint on the upper bound of the sampling interval being no greater than the dwell time, the issue concerning the asynchronization between the sampled-data controller mode and the system mode is hence considered to be caused by subsystems that may switch in a sampling interval. By considering the sampling interval without switching and the sampling interval with switching, the parameters-dependent loop-based Lyapunov functionals are constructed, respectively. With the help of the constructed functional, mean-square exponential stability criteria for the error polytopic uncertain switched complex dynamical networks are presented under the definition of average dwell time. Furthermore, based on the stability criteria, the asynchronous aperiodic sampled-data controller is designed for polytopic uncertain switched complex dynamical networks subject to actuator saturation. The polytopic uncertain switched complex dynamical networks can be guaranteed to exponentially synchronize with the target node based on the proposed stability conditions and aperiodic sampled-data controller design method. Finally, by transforming the proposed theoretical conditions into the LMI-based objective optimization problem, the domain of attraction of polytopic uncertain switched complex dynamical networks is estimated. An example based on switched Chua's circuit is applied to verify the effectiveness of the proposed method.

Ti6Al4V is widely applied in the integral cascades of aero engines. As an effective machining method, electrochemical trepanning (ECTr) has unique advantages in processing surface parts made of hard-to-cut materials. In ECTr, the state of the flow field has a significant effect on processing stability and machining quality. To improve the uniformity of the flow field when ECTr is applied to Ti6Al4V, two different flow modes are designed, namely full-profile electrolyte supply (FPES) and edges electrolyte supply (EES). Different from the traditional forward flow mode, the flow directions of the electrolyte in the proposed modes are controlled by inlet channels. Simulations show that the flow field under EES is more uniform than that under FPES. To further enhance the uniformity of the flow field, the structure of EES is optimized by modifying the insulating sleeve. In the optimized configuration, the longitudinal distance between the center of the inlet hole and the center of the blade is 6.0 mm, the lateral distance between the centers of the inlet holes on both sides is 16.5 mm, the length to which the electrolyte enters the machining area is 1.5 mm, and the height of the insulating sleeve is 13.5 mm. A series of ECTr experiments are performed under the two flow modes. Compared with EES, the blade machined by FPES is less accurate and has poorer surface quality, with a surface roughness (Ra) of 3.346 μm. Under the optimized EES, the machining quality is effectively enhanced, with the surface quality improved from Ra = 2.621 μm to Ra = 1.815 μm, thus confirming the efficacy of the proposed methods.

Recently, Paiva et al. introduced the concept of quasi-overlap functions on bounded lattices and investigated some vital properties of them. In this paper, we continue consider this research topic and focus on the constructions of quasi-overlap functions along with their generalized forms on bounded partially ordered sets. To be specific, firstly, we generalize the truth values set of quasi-overlap functions from bounded lattices to bounded partially ordered sets and introduce the notions of 0 P -quasi-overlap functions, 1 P -quasi-overlap functions and 0 P , 1 P -quasi-overlap functions on any bounded partially ordered set P by considering the weaker boundary conditions than the quasi-overlap functions on P. Secondly, we give the constructions of quasi-overlap functions, 0 P -quasi-overlap functions, 1 P -quasi-overlap functions and 0 P , 1 P -quasi-overlap functions on any bounded partially ordered set P via the so-called Galois s-connections and 0,1-homomorphisms, 1-homomorphisms, 0-homomorphisms and ord-homomorphisms, respectively. In particular, we prove that those constructions contain the methods of extending the known quasi-overlap functions, 0 P -quasi-overlap functions, 1 P -quasi-overlap functions and 0 P , 1 P -quasi-overlap functions from any bounded partially ordered set P to any other bounded partially ordered sets. Finally, we show that those extensions maintain some basic properties of the known quasi-overlap functions, 0 P -quasi-overlap functions, 1 P -quasi-overlap functions and 0 P , 1 P -quasi-overlap functions on P, such as, idempotent, Archimedean property and cancellation law.

The automatic segmentation of blood cells for detecting hematological disorders is a crucial job. It has a vital role in diagnosis, treatment planning, and output evaluation. The existing methods suffer from the issues like noise, improper seed-point detection, and oversegmentation problems, which are solved here using a Laplacian-of-Gaussian (LoG)-based modified highboosting operation, bounded opening followed by fast radial symmetry (BOFRS)-based seed-point detection, and hybrid ellipse fitting (EF), respectively. This article proposes a novel hybrid EF-based blood-cell segmentation approach, which may be used for detecting various hematological disorders. Our prime contributions are: 1) more accurate seed-point detection based on BO-FRS; 2) a novel least-squares (LS)-based geometric EF approach; and 3) an improved segmentation performance by employing a hybridized version of geometric and algebraic EF techniques retaining the benefits of both approaches. It is a computationally efficient approach since it hybridizes noniterative-geometric and algebraic methods. Moreover, we propose to estimate the minor and major axes based on the residue and residue offset factors. The residue offset parameter, proposed here, yields more accurate segmentation with proper EF. Our method is compared with the state-of-the-art methods. It outperforms the existing EF techniques in terms of dice similarity, Jaccard score, precision, and F1 score. It may be useful for other medical and cybernetics applications.

In this study, the approximate and exact solutions for the stationary-state of the solids model with neglecting reactant consumption for both non-uniform and uniform temperature systems were applied on gas ignition under a constant pressure condition. The criticality conditions for a slab, an infinite cylinder, and a sphere are determined and discussed using dimensionless temperatures under constant ambient and surface temperatures for a non-uniform temperature system. Exact solution for a Semenov model with convection heat loss was also presented. The solution of the Semenov problem for constant volume or density as a solid and constant pressure were compared. The critical parameter δ is calculated and compared with those of Frank-Kamenetskii solution values. The validation of the calculated ignition temperatures with other exact solution and experimental results were offered. The relation between critical parameters form Semenov and F.K. models solution was introduced.

We study the trace set of the commutator subgroup of Gamma(2), a type of Local-Global problem about thin groups. We determine the local obstructions and then use the correspondence between binary quadratic forms and hyperbolic matrices to find some global obstructions. We then develop a probabilistic argument for the existence of sufficiently large admissible traces by modeling the elements as non-backtracking random walks in a 2-dimensional lattice via their homology class and word length. Finally, we investigate the number of commutators needed to represent matrices in the commutator subgroup. This is done using an algorithm of Goldstein and Turner along with utilizing properties of level k-Markoff type surfaces. We conjecture that any trace in the commutator subgroup of $Gamma(2)$ can be represented with either 1 or 2 commutators.

The file attached to this record is the author's final peer reviewed version. A twofold personalized feedback mechanism is established for consensus reaching in social network group decision making (SN-GDM). It consists of two stages: (1) generating the trusted recommendation advice for individuals; and (2) producing personalized adoption coefficient for reducing unnecessary adjustment costs. This is achieved by means of a uninorm interval-valued trust propagation operator to obtain indirect trust. The trust relationship is used to generate personalized recommendation advice based on the principle of ‘a recommendation being more acceptable the higher the level of trust it derives from’. An optimization model is built to minimise the total adjustment cost of reaching consensus by determining personalized feedback adoption coefficient based on individuals’ consensus levels. Consequently, the proposed twofold personalized feedback mechanism achieves a balance between group consensus and individual personality. An example to demonstrate how the proposed twofold personalized feedback mechanism works is included, which is also used to show its rationality by comparison with the traditional feedback mechanism in GDM.

With ever-expanding computation and communication capabilities of modern embedded platforms, Internet of Things (IoT) technologies enable development of Reconfigurable Manufacturing Systems---a new generation of highly modularized industrial equipment suitable for highly-customized manufacturing. Sequential control in these systems is largely based on discrete events, while their formal execution semantics is specified as Control Interpreted Petri Nets (CIPN). Despite industry-wide use of programming languages based on the CIPN formalism, formal verification of such control applications in the presence of adversarial activity is not supported. Consequently, in this paper we focus on security-aware modeling and verification challenges for CIPN-based sequential control applications. Specifically, we show how CIPN models of networked industrial IoT controllers can be transformed into Time Petri Net (TPN)-based models, and composed with plant and security-aware channel models in order to enable system-level verification of safety properties in the presence of network-based attacks. Additionally, we introduce realistic channel-specific attack models that capture adversarial behavior using nondeterminism. Moreover, we show how verification results can be utilized to introduce security patches and motivate design of attack detectors that improve overall system resiliency, and allow satisfaction of critical safety properties. Finally, we evaluate our framework on an industrial case study.

The advanced modular powertrains are envisioned as primary part of future hybrid fuel cell vehicles (FCVs). The existing papers in the literature solely cope with the hardware side of modularity, while the software side is also vital to capitalize on the total capacity of these powertrains. Driven by this motivation, this article puts forward a comparative study of two novel decentralized convex optimization frameworks based on alternating direction method of multipliers (ADMM) to solve a multi-objective power allocation strategy (PAS) problem in a modular FCV (MFCV). The MFCV in this article is composed of two fuel cell (FC) stacks and a battery pack. Despite the existing centralized strategies for such a modular system, this manuscript proposes two decentralized PASs (Dec-PASs) based on Consensus ADMM (C-ADMM) and Proximal Jacobian ADMM (PJ-ADMM) to bridge the gap regarding the appreciation of modularity in software terms. Herein, after formulating the central PAS optimization problem, the principle of utilizing such decentralized algorithms is presented in detail. Subsequently, the performance of the proposed Dec-PASs is examined through several numerical simulations as well as experiments on a developed small-scale test bench. The obtained results illustrate that decomposition into decentralized forms enables solving the complex PAS optimization problem faster and provides modularity and flexibility. Furthermore, the proposed Dec-PASs can cope with fault and malfunction and thus augment the durability and robustness of modular powertrain systems.

In this paper, we consider the problem of aggregating a collection of transitive fuzzy binary relations in such a way that the aggregation process preserves transitivity. Specifically, we focus our efforts on the characterization of those functions that aggregate a collection of fuzzy binary relations which are transitive with respect to a collection of t-norms preserving the transitivity. We characterize them in terms of triangular triplets. Further, the relationship between triangular triplets, the monotonicity of the aggregation function and an appropriate dominance notion is explicitly stated. Special attention is paid to a few classes of transitive fuzzy binary relations that are relevant in the literature. Concretely, we describe, in terms of triangular triplets, those functions that aggregate a collection of fuzzy pre-orders, fuzzy partial orders, relaxed indistinguishability relations, indistinguishability relations and equalities. A surprising relationship between functions that aggregate transitive fuzzy relations into a T M -transitive fuzzy relation and those that aggregate relaxed indistinguishability relations is shown. A few consequences of the new results are also provided for those cases in which all the t-norms of the given collection are the same. Some celebrated results are retrieved as a particular case from the exposed theory.

The study of consistency in decision-making models is of great importance. Our proposal deals with a special type of extended aggregation functions to guarantee consistency that is based on T-S consistency of linearly ordered fuzzy preference relations (fuzzy ranking for preferences). Necessary conditions to ensure consistency in the aggregation process are provided. Moreover, sufficient conditions to guarantee the existence of extended aggregation functions verifying T-S consistency are presented. Some examples of functions of this type are also given. The equivalence between T-S consistency and the additive consistency for fuzzy preference relations is established.

Constrained multiobjective optimization problems (CMOPs) involve both conflicting objective functions and various constraints. Due to the presence of constraints, CMOPs' Pareto-optimal solutions are very likely lying on constraint boundaries. The experience from the constrained single-objective optimization has shown that to quickly obtain such an optimal solution, the search should surround the boundary of the feasible region from both the feasible and infeasible sides. In this article, we extend this idea to cope with CMOPs and, accordingly, we propose a novel constrained multiobjective evolutionary algorithm with bidirectional coevolution, called BiCo. BiCo maintains two populations, that is: 1) the main population and 2) the archive population. To update the main population, the constraint-domination principle is equipped with an NSGA-II variant to move the population into the feasible region and then to guide the population toward the Pareto front (PF) from the feasible side of the search space. While for updating the archive population, a nondominated sorting procedure and an angle-based selection scheme are conducted in sequence to drive the population toward the PF within the infeasible region while maintaining good diversity. As a result, BiCo can get close to the PF from two complementary directions. In addition, to coordinate the interaction between the main and archive populations, in BiCo, a restricted mating selection mechanism is developed to choose appropriate mating parents. Comprehensive experiments have been conducted on three sets of CMOP benchmark functions and six real-world CMOPs. The experimental results suggest that BiCo can obtain quite competitive performance in comparison to eight state-of-the-art-constrained multiobjective evolutionary optimizers.

The paper studies the aggregation of pairs of T-indistinguishability operators. More concretely we address the question whether A ( E , E ′ ) is a T-indistinguishability operator if E , E ′ are T-indistinguishability operators. The answer depends on the aggregation function, the t-norm T, and the chosen T-indistinguishability operators. It is well-known that an aggregation function preserves T-transitive relations if and only if it dominates the t-norm T. We show the important role of the minimum t-norm T M in this preservation problem. In particular we develop weaker forms of domination that are used to provide characterizations of T M -indistinguishability preservation under aggregation. We also prove that the existence of a single strictly monotone aggregation that satisfies the indistinguishability operator preservation property guarantees all aggregations to have the same preservation property.

We study decentralized non-convex finite-sum minimization problems described over a network of nodes, where each node possesses a local batch of data samples. In this context, we analyze a single-timescale randomized incremental gradient method, called GT-SAGA. GT-SAGA is computationally efficient as it evaluates one component gradient per node per iteration and achieves provably fast and robust performance by leveraging node-level variance reduction and network-level gradient tracking. For general smooth non-convex problems, we show the almost sure and mean-squared convergence of GT-SAGA to a first-order stationary point and further describe regimes of practical significance where it outperforms the existing approaches and achieves a network topology-independent iteration complexity respectively. When the global function satisfies the Polyak-Lojaciewisz condition, we show that GT-SAGA exhibits linear convergence to an optimal solution in expectation and describe regimes of practical interest where the performance is network topology-independent and improves upon the existing methods. Numerical experiments are included to highlight the main convergence aspects of GT-SAGA in non-convex settings.

Dynamic consolidation of virtual machines (VMs) is an effective way to improve resource utilization and power efficiency in cloud computing. For example, determining when it is best to relocate VMs from an overloaded host is one aspect of dynamic VM consolidation that directly influences the resource utilization and Quality of Service (QoS) offered by the system. This paper presents a new proposal with an Interval-valued Fuzzy Logic approach to address the uncertainties and inaccuracies in determining resource usage, aiming at energy savings with minimal performance degradation. The results obtained in a simulated cloud computing environment showed improvements for energy efficiency of 2.3% with Inter Quartile Range (IQR). With regard to Service Level Agreement (SLA), results of 10.1% were achieved with Threshold Policy (THR), and finally, IQR obtained 7.9% better results considering the reduction in the number of VM migrations.

Motivated by the problem of optimization of force-field systems in physics using large-scale computer simulations, we consider exploration of a deterministic complex multivariate response surface. The objective is to find input combinations that generate output close to some desired or "target" vector. In spite of reducing the problem to exploration of the input space with respect to a one-dimensional loss function, the search is nontrivial and challenging due to infeasible input combinations, high dimensionalities of the input and output space and multiple "desirable" regions in the input space and the difficulty of emulating the objective function well with a surrogate model. We propose an approach that is based on combining machine learning techniques with smart experimental design ideas to locate multiple good regions in the input space.

We outline recent trends in capacity-based aggregation in large universes. Capacities (fuzzy measures) model dependencies among the inputs, and aggregation by the discrete Choquet, Sugeno and other fuzzy integrals accounts for synergies and redundancies. For large number of inputs the exponential complexity of all interactions is a major obstacle. We exemplify the need for aggregation of a large number of dependent inputs on several applications and discuss the challenges and approaches to reducing the complexity of capacity-based aggregation. We also state which mathematical and computational tools are required for large scale capacity modelling.

The ongoing trend from mass-produced to mass-customized products with batch sizes as small as a single unit has highlighted the need for highly adaptable robotic systems with lower downtime for maintenance. To address these demands, this article proposes the development of a novel reconfigurable collaborative robot (cobot), which has the potential to open up many new scenarios within the rapidly emerging flexible manufacturing environments. As the technological contribution, we present a complete hard- and software architecture for a quickly reconfigurable EtherCAT-based robot. This novel approach allows to automatically reconstruct the topology of different robot structures, composed of a set of body modules, each of which represents an EtherCAT slave. As the theoretical contribution, we propose a method to obtain in an automatic way the kinematic and dynamic model of the robot and store it in universal robot description format (URDF) as soon as the physical robot is assembled or reconfigured. The method also automatically reshapes a generic optimization-based controller to be instantly used after reconfiguration. While this article focuses on reconfigurable manipulators, the proposed concept can support arbitrary serial kinematic tree-like configurations. We demonstrate the contributions with examples of the following: how the topology of the robot is reconstructed and the URDF model is generated, and a Cartesian task application for a cobot built with the basic modules, demonstrating the quick reconfigurabilty of the system from a 4-degrees-of-freedom (DOF) robot to a 5-DOF robot, in order to satisfy new workspace requirements.

We consider calculation of the mode of compositional data, the data related to each other through a linear constraint. Compositional data arises in various extensions of the fuzzy sets theory (type-2 interval-valued, intuitionistic, hesitant fuzzy sets), biomedicine (relative abundance, genome sequencing, activity recognition), and data analytics (various wealth indices, interval-valued observations, traffic congestion, etc.). Mode is a pre-aggregation function in the case of single variable, used as a classical estimator robust to outliers, but its multivariate extensions face the challenges of high computational complexity and potential oversmoothing. In this work we present several novel techniques for mode estimation on the unit k-simplex representing compositional, interval-valued, and general vector-valued data. We highlight the re-weighted k-nearest neighbours algorithm based on the Choquet integral with respect to a 2-additive fuzzy measure, compare its performance against other approaches based on spatial partitioning, and illustrate its applications to aggregation of real-world interval-valued data sets.

This paper presents some new criteria for partial exponential stability of a slow-fast nonlinear system with a fast scalar variable using periodic averaging methods. Unlike classical averaging techniques, we construct an averaged system by averaging over this fast scalar variable instead of the time variable. We then show that partial exponential stability of the averaged system implies partial exponential stability of the original one. As some intermediate results, we also obtain a new converse Lyapunov theorem and some perturbation theorems for partially exponentially stable systems. We then apply our established criteria to study remote synchronization of Kuramoto-Sakaguchi oscillators coupled by a star network with two peripheral nodes. We analytically show that detuning the natural frequency of the central mediating oscillator can increase the robustness of the remote synchronization against phase shifts.

A 3D laser scanning strategy based on cascaded deep neural network is proposed for the scanning system converted from 2D Lidar with a pitching motion device. The strategy is aimed at moving target detection and monitoring. Combining the device characteristics, the strategy first proposes a cascaded deep neural network, which inputs 2D point cloud, color image and pitching angle. The outputs are target distance and speed classification. And the cross-entropy loss function of network is modified by using focal loss and uniform distribution to improve the recognition accuracy. Then a pitching range and speed model are proposed to determine pitching motion parameters. Finally, the adaptive scanning is realized by integral separate speed PID. The experimental results show that the accuracies of the improved network target detection box, distance and speed classification are 90.17%, 96.87% and 96.97%, respectively. The average speed error of the improved PID is 0.4239°/s, and the average strategy execution time is 0.1521 s. The range and speed model can effectively reduce the collection of useless information and the deformation of the target point cloud. Conclusively, the experimental of overall scanning strategy show that it can improve target point cloud integrity and density while ensuring the capture of target.

This study focuses on dissipativity-based fault detection for multiple delayed uncertain switched Takagi-Sugeno fuzzy stochastic systems with intermittent faults and unmeasurable premise variables. Nonlinear dynamics, exogenous disturbances, and measurement noise are also considered. In contrast to the existing study works, there is a wider range of applications. An observer is explored to detect faults. A controller is studied to stabilize the considered system. A piecewise fuzzy Lyapunov function is collected to obtain delay-dependent sufficient conditions by means of linear matrix inequalities. The designed observer has less conservatism. In addition, the strict (Q, S,R)-e-dissipativity performance is achieved in the residual dynamic. Besides, the elaborate H∞ performance and the elaborate H performance are also acquired. Finally, the availability of the method in this study is verified through two simulation examples.

In this article, a frequency-domain approach is developed to deal with the global consensus problem for a class of general second-order multiagent systems (MASs) subject to actuator saturations. By employing the describing function and the generalized Nyquist criterion, the global consensus problem is thoroughly investigated for both undirected and directed topologies. First, the describing function is introduced to characterize the actuator saturations in the s -plane, and the inherent representation error is quantitatively analyzed from a frequency-domain perspective. Then, by means of the Kronecker product, the addressed consensus problem of the MAS is transformed into a corresponding stability analysis problem for a certain multi-input-multi-output (MIMO) system and, consequently, the generalized Nyquist criterion for MIMO systems is exploited to derive the condition for the global consensus of the MAS where the impact from the actuator saturation is explicitly reflected. Finally, numerical simulations are provided to illustrate the validity of the proposed theoretical result.

It is well known that the conventional fractional-order neural networks (FONNs) cannot generate nonconstant periodic oscillation. For this point, this article discusses a class of impulsive FONNs with piecewise Caputo derivatives (IPFONNs). By using the differential inclusion theory, the existence of the Filippov solutions for a discontinuous IPFONNs is investigated. Furthermore, some decision theorems are established for the existence and uniqueness of the (periodic) solution, global exponential stability, and impulsive control global stabilization to IPFONNs. This article achieves four key issues that were not solved in the previously existing literature: 1) the existence of at least one Filippov solution in a discontinuous IPFONN; 2) the existence and uniqueness of periodic oscillation in a nonautonomous IPFONN; 3) global exponential stability of IPFONNs; and 4) impulsive control global Mittag-Leffler stabilization for FONNs.