Particle filtering in high-dimensional chaotic systems

We present an efficient particle filtering algorithm for multiscale systems, that is adapted for simple atmospheric dynamics models which are inherently chaotic. Particle filters represent the posterior conditional distribution of the state variables by a collection of particles, which evolves and adapts recursively as new information becomes available. The difference between the estimated state and the true state of the system constitutes the error in specifying or forecasting the state, which is amplified in chaotic systems that have a number of positive Lyapunov exponents. The purpose of the present paper is to show that the homogenization method developed in Imkeller et al. (2011), which is applicable to high dimensional multi-scale filtering problems, along with important sampling and control methods can be used as a basic and flexible tool for the construction of the proposal density inherent in particle filtering. Finally, we apply the general homogenized particle filtering algorithm developed here to the Lorenz'96 atmospheric model that mimics mid-latitude atmospheric dynamics with microscopic convective processes.Comment: 28 pages, 12 figure

Registration (Management) System for an Academic Conference

In every college or university, people will conduct different academic conferences so that students will know what is going on in the world related to the latest technological updates. The conference information should be distributed globally to reach a larger number of people. For many people, physical communication is insufficient, and it won\u27t help people clear their doubts. We propose an online registration management system for the conduct of academic conferences in any college or university to overcome all of the limitations of a physical system in conducting the conference. This new web application will reach every nook and cranny of the globe. People can view the information, they can register with this application, can communicate with the conference people, can get suggestions or recommendations from experts in the same field, etc. To achieve these things, the user needs to sign up with the application, which he should be logged into for doing the different operations in the application. If any of the users want to change their personal information, they will be given the edit option, and they can search for people who are experts in the related field. If needed, they can communicate with them by using this application. Based on the information provided by the user, experts will recommend the related research field so that he or she can opt for it. To create the above application, we will use.Net to create the GUI and implement the application\u27s various operations. We will be using HTML, CSS, BOOTSTRAP, JavaScript, and jQuery in coding, and to store the data, we will be using SQL Server management studio. The framework we are going to use isASP.Net Framework 4.5. According to the schedule, the project will be completed by December 10, 2022

Encoding Two-Dimensional Range Top-k Queries

We consider various encodings that support range top-k queries on a two-dimensional array containing elements from a total order. For an m x n array, we first propose an almost optimal encoding for answering one-sided top-k queries, whose query range is restricted to [1 ... m][1 .. a], for 1 <= a <= n. Next, we propose an encoding for the general top-k queries that takes m^2 * lg(binom((k+1)n)(n)) + m * lg(m) + o(n) bits. This generalizes the one-dimensional top-k encoding of Gawrychowski and Nicholson [ICALP, 2015]. Finally, for a 2 x n array, we obtain a 2 lg(binom(3n)(n)) + 3n + o(n)-bit encoding for answering top-2 queries