The data set of batch biological and biotechnological processes can be organized in a three-way data matrix. In this paper the usefulness of different PCA approaches for monitoring is analyzed. Different ways of unfol...
详细信息
The data set of batch biological and biotechnological processes can be organized in a three-way data matrix. In this paper the usefulness of different PCA approaches for monitoring is analyzed. Different ways of unfolding and scaling of data have been applied to a pilot-scale SBR data. PCA is used to reduce the dimensionality and to remove the non-linearity dynamic of the data. Moreover, a new method to select the number of principal components is proposed. Loadings graphics are used to determinate the predominant variables for each one. The results show that whatever model can be applied depending on the goal of the monitoring, however the models implicate possible false alarms or faults omission.
This paper investigates the use of the cubic-regularized Newton method within a federated learning framework while addressing two major concerns that commonly arise in federated learning: privacy leakage and communica...
详细信息
This paper deals with the robust iterative learning control(ILC) for time-delay systems(TDS) with both model and delay *** ILC algorithm with anticipation in time is considered,and a frequency-domain approach to its d...
详细信息
This paper deals with the robust iterative learning control(ILC) for time-delay systems(TDS) with both model and delay *** ILC algorithm with anticipation in time is considered,and a frequency-domain approach to its design is *** shows that a necessary and sufficient convergence condition can be provided in terms of three design parameters:the lead time,the learning gain,and the performance weighting *** particular,if the lead time is chosen as just the delay estimate,then the convergence condition is derived independent of the delay and the *** this case,with the selection of the performance weighting function,the perfect tracking can be achieved,or the least upper bound of the L2-norm of the limit tracking error can be guaranteed less than the least upper bound of the L2-norm of the initial tracking error.
We propose a distributed Markov chain Monte Carlo (MCMC) inference algorithm for large scale Bayesian posterior simulation. We assume that the dataset is partitioned and stored across nodes of a cluster. Our procedure...
We propose a distributed Markov chain Monte Carlo (MCMC) inference algorithm for large scale Bayesian posterior simulation. We assume that the dataset is partitioned and stored across nodes of a cluster. Our procedure involves an independent MCMC posterior sampler at each node based on its local partition of the data. Moment statistics of the local posteriors are collected from each sampler and propagated across the cluster using expectation propagation message passing with low communication costs. The moment sharing scheme improves posterior estimation quality by enforcing agreement among the samplers. We demonstrate the speed and inference quality of our method with empirical studies on Bayesian logistic regression and sparse linear regression with a spike-and-slab prior.
Sound event detection (SED) in real life is an interesting but challenging task due to the polyphonic and long-term dependent nature of sound events. Recently, multi-label recurrent neural networks (RNNs) have shown p...
详细信息
ISBN:
(纸本)9781538646595
Sound event detection (SED) in real life is an interesting but challenging task due to the polyphonic and long-term dependent nature of sound events. Recently, multi-label recurrent neural networks (RNNs) have shown promises. However, even equipped with long short-term memory (LSTM) or gated recurrent unit (GRU) cells, RNNs are still limited to model the long-term dependency. In this paper, we propose a multiscale RNN to address this issue. By integrating information from different time resolutions, we can better capture both the fine-grained and long-term dependencies of sound events. We experiment on the development sets of Task3 of DCASE2016 and DCASE2017. Compared to our previously proposed single-scale RNN that won the third place among the 13 teams in Task3 of DCASE2017, the proposed multiscale model achieves statistically significantly better performance on the development datasets of both DECASE2016 and DCASE2017.
The zero-error classical capacity of a quantum channel is the asymptotic rate at which it can be used to send classical bits perfectly, so that they can be decoded with zero probability of error. The study of zero-err...
详细信息
ISBN:
(纸本)9781424478903
The zero-error classical capacity of a quantum channel is the asymptotic rate at which it can be used to send classical bits perfectly, so that they can be decoded with zero probability of error. The study of zero-error capacities dates right back to Shannon and the early days of information theory. We show that there exist pairs of quantum channels, neither of which individually have any zero-error capacity whatsoever (even if arbitrarily many uses of the channels are available), but such that access to even a single copy of both channels allows classical information to be sent perfectly reliably. In other words, we prove that the zero-error classical capacity can be superactivated. This result is the first example of superactivation of a classical capacity of a quantum channel. We further strengthen this result to show that there exist pairs of channels, neither of which have any zero-error classical capacity (as before), yet for which access to one copy of the joint channel even allows far more delicate quantum information to be transmitted perfectly. This subsumes the first result, and also implies that the quantum zero-error capacity can be superactivated. But it is strictly stronger than either of these. Indeed, this is the strongest conceivable form of superactivation, and nothing similar is possible for standard Shannon capacities of quantum channels or for zero-error capacities of classical channels.
We present AircraftVerse, a publicly available aerial vehicle design dataset. Aircraft design encompasses different physics domains and, hence, multiple modalities of representation. The evaluation of these cyber-phys...
We present AircraftVerse, a publicly available aerial vehicle design dataset. Aircraft design encompasses different physics domains and, hence, multiple modalities of representation. The evaluation of these cyber-physical system (CPS) designs requires the use of scientific analytical and simulation models ranging from computer- aided design tools for structural and manufacturing analysis, computational fluid dynamics tools for drag and lift computation, battery models for energy estimation, and simulation models for flight control and dynamics. AircraftVerse contains 27,714 diverse air vehicle designs - the largest corpus of engineering designs with this level of complexity. Each design comprises the following artifacts: a symbolic design tree describing topology, propulsion subsystem, battery subsystem, and other design details; a STandard for the Exchange of Product (STEP) model data; a 3D CAD design using a stereolithography (STL) file format; a 3D point cloud for the shape of the design; and evaluation results from high fidelity state-of-the-art physics models that characterize performance metrics such as maximum flight distance and hover-time. We also present baseline surrogate models that use different modalities of design representation to predict design performance metrics, which we provide as part of our dataset release. Finally, we discuss the potential impact of this dataset on the use of learning in aircraft design and, more generally, in CPS. AircraftVerse is accompanied by a data card, and it is released under Creative Commons Attribution-ShareAlike (CC BY-SA) license. The dataset is hosted at https://***/record/6525446 baseline models and code at https://***/SRI-CSL/AircraftVerse and the dataset description at https://***/.
Sensor registration is a basis for well-organized sensor network, and a precondition for data fusion. In cases of constant registration errors, batch processing methods are always applied, where the registration is ac...
详细信息
Sensor registration is a basis for well-organized sensor network, and a precondition for data fusion. In cases of constant registration errors, batch processing methods are always applied, where the registration is actually viewed as an optimization problem. Such methods are fast convergent, but sometimes they are not flexible in different cases and the optimal techniques used in batch processing methods may provide the suboptimum as solution. What's more, when dealing with a large number of sensors, the batch processing methods may come across numeric problems. To address the registration problem in some practical cases, the evolutionary algorithm based method can be explored. A method based on genetic algorithm, as well as the least squares method, are developed for sensor registration in different simulation scenarios and compared. Simulation results are analyzed to make clear the advantages and disadvantages of the methods.
This paper introduces a systematic approach to address the topological path identification (TPI) problem in power distribution networks. Our approach starts by listing the DSO’s raw information coming from several so...
详细信息
Ensuring safety in both autonomous driving and advanced driver-assistance systems (ADAS) depends critically on the efficient deployment of traffic sign recognition technology. While current methods show effectiveness,...
详细信息
暂无评论