NotesWhat is notes.io?

Notes brand slogan

Notes - notes.io

Microphysical characterization involving free of charge area visual hyperlink as a result of hydrometeor and also fog results.
Despite the existence of an extensive literature, no definitive conclusion seems to emerge on the extent to which minorities are guaranteed by democratic rules in political systems. This paper contributes to this debate by proposing a modified Heigselmann and Krauss two-dimensional model of preferences in order to capture the role of abstention on minority representativeness. Regardless of the typology of abstention, simulation results show that voter abstention always benefits minorities.Autoencoders are a self-supervised learning system where, during training, the output is an approximation of the input. Typically, autoencoders have three parts Encoder (which produces a compressed latent space representation of the input data), the Latent Space (which retains the knowledge in the input data with reduced dimensionality but preserves maximum information) and the Decoder (which reconstructs the input data from the compressed latent space). Autoencoders have found wide applications in dimensionality reduction, object detection, image classification, and image denoising applications. Variational Autoencoders (VAEs) can be regarded as enhanced Autoencoders where a Bayesian approach is used to learn the probability distribution of the input data. VAEs have found wide applications in generating data for speech, images, and text. In this paper, we present a general comprehensive overview of variational autoencoders. We discuss problems with the VAEs and present several variants of the VAEs that attempt to provide solutions to the problems. We present applications of variational autoencoders for finance (a new and emerging field of application), speech/audio source separation, and biosignal applications. Experimental results are presented for an example of speech source separation to illustrate the powerful application of variants of VAE VAE, β-VAE, and ITL-AE. We conclude the paper with a summary, and we identify possible areas of research in improving performance of VAEs in particular and deep generative models in general, of which VAEs and generative adversarial networks (GANs) are examples.We analyze the permutation entropy of deterministic chaotic signals affected by a weak observational noise. We investigate the scaling dependence of the entropy increase on both the noise amplitude and the window length used to encode the time series. In order to shed light on the scenario, we perform a multifractal analysis, which allows highlighting the emergence of many poorly populated symbolic sequences generated by the stochastic fluctuations. We finally make use of this information to reconstruct the noiseless permutation entropy. While this approach works quite well for Hénon and tent maps, it is much less effective in the case of hyperchaos. We argue about the underlying motivations.Vehicle Routing Problems (VRP) comprise many variants obtained by adding to the original problem constraints representing diverse system characteristics. Different variants are widely studied in the literature; however, the impact that these constraints have on the structure of the search space associated with the problem is unknown, and so is their influence on the performance of search algorithms used to solve it. This article explores how assignation constraints (such as a limited vehicle capacity) impact VRP by disturbing the network structure defined by the solution space and the local operators in use. This research focuses on Fitness Landscape Analysis for the multiple Traveling Salesman Problem (m-TSP) and Capacitated VRP (CVRP). We propose a new Fitness Landscape Analysis measure that provides valuable information to characterize the fitness landscape's structure under specific scenarios and obtain several relationships between the fitness landscape's structure and the algorithmic performance.The exothermic reactor for ammonia synthesis is a primary device determining the performance of the energy storage system. The Braun-type ammonia synthesis reactor is used as the exothermic reactor to improve the heat release rate. Due to the entirely different usage scenarios and design objectives, its parameters need to be redesigned and optimized. Based on finite-time thermodynamics, a one-dimensional model is established to analyze the effects of inlet gas molar flow rate, hydrogen-nitrogen ratio, reactor length and inlet temperature on the total entropy generation rate and the total exothermic rate of the reactor. It's found that the total exothermic rate mainly depends on the inlet molar flow rate. Furthermore, considering the minimum total entropy generation rate and maximum total exothermic rate, the NSGA-II algorithm is applied to optimize seven reactor parameters including the inlet molar flow rate, lengths and temperatures of the three reactors. Lastly, the optimized reactor is obtained from the Pareto front using three fuzzy decision methods and deviation index. Compared with the reference reactor, the total exothermic rate of the optimized reactor is improved by 12.6% while the total entropy generation rate is reduced by 3.4%. The results in this paper can provide some guidance for the optimal design and application of exothermic reactors in practical engineering.Goal programming (GP) is applied to the discrete and continuous version of multi-criteria optimization. Recently, some essential analogies between multi-criteria decision making under certainty (M-DMC) and scenario-based one-criterion decision making under uncertainty (1-DMU) have been revealed in the literature. The aforementioned similarities allow the adjustment of GP to an entirely new domain. The aim of the paper is to create a new decision rule for mixed uncertain problems on the basis of the GP methodology. The procedure can be used by pessimists, optimists and moderate decision makers. It is designed for one-shot decisions. One of the significant advantages of the novel approach is related to the possibility to analyze neutral criteria, which are not directly taken into account in existing classical procedures developed for 1-DMU.With population explosion and globalization, the spread of infectious diseases has been a major concern. In 2019, a newly identified type of Coronavirus caused an outbreak of respiratory illness, popularly known as COVID-19, and became a pandemic. Although enormous efforts have been made to understand the spread of COVID-19, our knowledge of the COVID-19 dynamics still remains limited. The present study employs the concepts of chaos theory to examine the temporal dynamic complexity of COVID-19 around the world. The false nearest neighbor (FNN) method is applied to determine the dimensionality and, hence, the complexity of the COVID-19 dynamics. The methodology involves (1) reconstruction of a single-variable COVID-19 time series in a multi-dimensional phase space to represent the underlying dynamics; and (2) identification of "false" neighbors in the reconstructed phase space and estimation of the dimension of the COVID-19 series. For implementation, COVID-19 data from 40 countries/regions around the world are studied. Two types of COVID-19 data are analyzed (1) daily COVID-19 cases; and (2) daily COVID-19 deaths. The results for the 40 countries/regions indicate that (1) the dynamics of COVID-19 cases exhibit low- to medium-level complexity, with dimensionality in the range 3 to 7; and (2) the dynamics of COVID-19 deaths exhibit complexity anywhere from low to high, with dimensionality ranging from 3 to 13. The results also suggest that the complexity of the dynamics of COVID-19 deaths is greater than or at least equal to that of the dynamics of COVID-19 cases for most (three-fourths) of the countries/regions. These results have important implications for modeling and predicting the spread of COVID-19 (and other infectious diseases), especially in the identification of the appropriate complexity of models.It is well known that the waveguide beam splitter can be used as a source for the quantum entanglement of photons. The analysis of such quantum entanglement is a difficult problem even for monochromatic photons, since the system under study is multiparametric. This paper will show that quantum entanglement can be represented in a simple form not only for monochromatic photons but also for non-monochromatic ones. It will be shown that quantum entanglement for non-monochromatic photons can be very different from monochromatic photons, which can be used to create large quantum entanglement.Setting sights on the problem of input-output constraints in most industrial systems, an implicit generalized predictive control algorithm based on an improved particle swarm optimization algorithm (PSO) is presented in this paper. PSO has the advantages of high precision and fast convergence speed in solving constraint problems. In order to effectively avoid the problems of premature and slow operation in the later stage, combined with the idea of the entropy of system (SR), a new weight attenuation strategy and local jump out optimization strategy are introduced into PSO. The velocity update mechanism is cancelled, and the algorithm is adjusted respectively in the iterative process and after falling into local optimization. The improved PSO is used to optimize the performance index in predictive control. The combination of PSO and gradient optimization for rolling-horizon improves the optimization effect of the algorithm. The simulation results show that the system overshoot is reduced by about 7.5% and the settling time is reduced by about 6% compared with the implicit generalized predictive control algorithm based on particle swarm optimization algorithm (PSO-IGPC).When a network has relay nodes, there is a risk that a part of the information is leaked to an untrusted relay. Secure network coding (secure NC) is known as a method to resolve this problem, which enables the secrecy of the message when the message is transmitted over a noiseless network and a part of the edges or a part of the intermediate (untrusted) nodes are eavesdropped. If the channels on the network are noisy, the error correction is applied to noisy channels before the application of secure NC on an upper layer. In contrast, secure physical layer network coding (secure PLNC) is a method to securely transmit a message by a combination of coding operation on nodes when the network is composed of set of noisy channels. Since secure NC is a protocol on an upper layer, secure PLNC can be considered as a cross-layer protocol. In this paper, we compare secure PLNC with a simple combination of secure NC and error correction over several typical network models studied in secure NC.A thermodynamic description of porous media must handle the size- and shape-dependence of media properties, in particular on the nano-scale. Such dependencies are typically due to the presence of immiscible phases, contact areas and contact lines. We propose a way to obtain average densities suitable for integration on the course-grained scale, by applying Hill's thermodynamics of small systems to the subsystems of the medium. We argue that the average densities of the porous medium, when defined in a proper way, obey the Gibbs equation. All contributions are additive or weakly coupled. From the Gibbs equation and the balance equations, we then derive the entropy production in the standard way, for transport of multi-phase fluids in a non-deformable, porous medium exposed to differences in boundary pressures, temperatures, and chemical potentials. Linear relations between thermodynamic fluxes and forces follow for the control volume. Fluctuation-dissipation theorems are formulated for the first time, for the fluctuating contributions to fluxes in the porous medium.
Here's my website:
     
 
what is notes.io
 

Notes.io is a web-based application for taking notes. You can take your notes and share with others people. If you like taking long notes, notes.io is designed for you. To date, over 8,000,000,000 notes created and continuing...

With notes.io;

  • * You can take a note from anywhere and any device with internet connection.
  • * You can share the notes in social platforms (YouTube, Facebook, Twitter, instagram etc.).
  • * You can quickly share your contents without website, blog and e-mail.
  • * You don't need to create any Account to share a note. As you wish you can use quick, easy and best shortened notes with sms, websites, e-mail, or messaging services (WhatsApp, iMessage, Telegram, Signal).
  • * Notes.io has fabulous infrastructure design for a short link and allows you to share the note as an easy and understandable link.

Fast: Notes.io is built for speed and performance. You can take a notes quickly and browse your archive.

Easy: Notes.io doesn’t require installation. Just write and share note!

Short: Notes.io’s url just 8 character. You’ll get shorten link of your note when you want to share. (Ex: notes.io/q )

Free: Notes.io works for 12 years and has been free since the day it was started.


You immediately create your first note and start sharing with the ones you wish. If you want to contact us, you can use the following communication channels;


Email: [email protected]

Twitter: http://twitter.com/notesio

Instagram: http://instagram.com/notes.io

Facebook: http://facebook.com/notesio



Regards;
Notes.io Team

     
 
Shortened Note Link
 
 
Looding Image
 
     
 
Long File
 
 

For written notes was greater than 18KB Unable to shorten.

To be smaller than 18KB, please organize your notes, or sign in.