Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
7 result(s) for "rels algorithm"
Sort by:
Self-Tuning Distributed Fusion Filter for Multi-Sensor Networked Systems with Unknown Packet Receiving Rates, Noise Variances, and Model Parameters
In this study, we researched the problem of self-tuning (ST) distributed fusion state estimation for multi-sensor networked stochastic linear discrete-time systems with unknown packet receiving rates, noise variances (NVs), and model parameters (MPs). Packet dropouts may occur when sensor data are sent to a local processor. A Bernoulli distributed stochastic variable is adopted to depict phenomena of packet dropouts. By model transformation, the identification problem of packet receiving rates is transformed into that of unknown MPs for a new augmented system. The recursive extended least squares (RELS) algorithm is used to simultaneously identify packet receiving rates and MPs in the original system. Then, a correlation function method is used to identify unknown NVs. Further, a ST distributed fusion state filter is achieved by applying identified packet receiving rates, NVs, and MPs to the corresponding optimal estimation algorithms. It is strictly proven that ST algorithms converge to optimal algorithms under the condition that the identifiers for parameters are consistent. Two examples verify the effectiveness of the proposed algorithms.
An intelligent returned energy model of cell and grid using a gain sharing knowledge enhanced long short-term memory neural network
The reliable prediction of solar energy production and surplus is crucial for the stability of the electricity grid and effective energy distribution, particularly during peak consumption periods. Encouraging solar adoption by customers is also important despite fluctuations in solar energy generation. This paper addresses the need for an intelligent surplus solar energy prediction model, referred to as the Green Model, which aims to accurately predict surplus electrical energy that can be returned to the distribution grid. The Green Model utilizes a combination of a developed long short-term memory (LSTM) neural network and a novel optimization technique called deterministic selection network by gain sharing knowledge (DSN-GSK). The DSN-GSK optimizes the structure of LSTM by determining the optimal number of hidden layers, nodes in each layer, biases, weights, and activation functions based on the most important features that represent the relationship between generated solar energy and weather factors. The Green Model was evaluated and analysed, demonstrating high accuracy in the short-term prediction of surplus electrical energy with a minimal percentage of error. The model shows promising prospects for the development of returned electrical energy prediction. The main novelty of this paper lies in the development of the Green Model, which combines LSTM and DSN-GSK to enhance the accuracy of surplus solar energy prediction. The benefits of the Green Model include improved stability and efficiency of the electricity grid, effective utilization of renewable energy sources, and the reduction of negative environmental impacts. The contributions of this paper include advancing the field of intelligent energy prediction, optimizing the structure of LSTM, and providing valuable insights for the integration of renewable energy into the existing energy infrastructure.
Custom Score Function: Projection of Structural Attention in Stochastic Structures
This study introduces a novel approach to correlation-based feature selection and dimensionality reduction in high-dimensional data structures. To this end, a customized scoring function is proposed, designed as a dual-objective structure that simultaneously maximizes the correlation with the target variable while penalizing redundant information among features. The method is built upon three main components: correlation-based preliminary assessment, feature selection via the tailored scoring function, and integration of the selection results into a t-SNE visualization guided by Rel/Red ratios. Initially, features are ranked according to their Pearson correlation with the target, and then redundancy is assessed through pairwise correlations among features. A priority scheme is defined using a scoring function composed of relevance and redundancy components. To enhance the selection process, an optimization framework based on stochastic differential equations (SDEs) is introduced. Throughout this process, feature weights are updated using both gradient information and diffusion dynamics, enabling the identification of subsets that maximize overall correlation. In the final stage, the t-SNE dimensionality reduction technique is applied with weights derived from the Rel/Red scores. In conclusion, this study redefines the feature selection process by integrating correlation-maximizing objectives with stochastic modeling. The proposed approach offers a more comprehensive and effective alternative to conventional methods, particularly in terms of explainability, interpretability, and generalizability. The method demonstrates strong potential for application in advanced machine learning systems, such as credit scoring, and in broader dimensionality reduction tasks.
FlowMax: A Computational Tool for Maximum Likelihood Deconvolution of CFSE Time Courses
The immune response is a concerted dynamic multi-cellular process. Upon infection, the dynamics of lymphocyte populations are an aggregate of molecular processes that determine the activation, division, and longevity of individual cells. The timing of these single-cell processes is remarkably widely distributed with some cells undergoing their third division while others undergo their first. High cell-to-cell variability and technical noise pose challenges for interpreting popular dye-dilution experiments objectively. It remains an unresolved challenge to avoid under- or over-interpretation of such data when phenotyping gene-targeted mouse models or patient samples. Here we develop and characterize a computational methodology to parameterize a cell population model in the context of noisy dye-dilution data. To enable objective interpretation of model fits, our method estimates fit sensitivity and redundancy by stochastically sampling the solution landscape, calculating parameter sensitivities, and clustering to determine the maximum-likelihood solution ranges. Our methodology accounts for both technical and biological variability by using a cell fluorescence model as an adaptor during population model fitting, resulting in improved fit accuracy without the need for ad hoc objective functions. We have incorporated our methodology into an integrated phenotyping tool, FlowMax, and used it to analyze B cells from two NFκB knockout mice with distinct phenotypes; we not only confirm previously published findings at a fraction of the expended effort and cost, but reveal a novel phenotype of nfkb1/p105/50 in limiting the proliferative capacity of B cells following B-cell receptor stimulation. In addition to complementing experimental work, FlowMax is suitable for high throughput analysis of dye dilution studies within clinical and pharmacological screens with objective and quantitative conclusions.
Discrete-frequency convergence of iterative learning control for linear time-invariant systems with higher-order relative degree
In this paper, a discrete-frequency technique is developed for analyzing sufficiency and necessity of monotone convergence of a proportional higher-order-derivative iterative learning control scheme for a class of linear time-invariant systems with higher-order relative degree. The technique composes of two steps. The first step is to expand the iterative control signals, its driven outputs and the relevant signals as complex-form Fourier series and then to deduce the properties of the Fourier coefficients. The second step is to analyze the sufficiency and necessity of monotone convergence of the proposed proportional higher-order-derivative iterative learning control scheme by assessing the tracking errors in the forms of Paserval’s energy modes. Numerical simulations are illustrated to exhibit the validity and the effectiveness.
Digital Rights Management Implemented by RDF Graph Approach
This paper proposes a design framework for constructing Digital Rights Management (DRM) that enables learning objects in legal usage. The central theme of this framework is that any design of a DRM must have theories as foundations to make the maintenance, extension or interoperability easy. While a learning objective consists of learning resources and its metadata, a DRM also needs metadata for describing itself as Rights Expression Language (REL). The proposed Resource Description Framework (RDF) graph design in this study is based on the Boolean operations of graph theory, whereas the RDF graph provides not only more coherent operations, but also opportunities for maintenance and interoperability at different platforms. Two algorithms for encoding and verifying rights in DRM are designed to deal with REL metadata in RDF format. This technological support also reduces the sophistication among role assignments, learning objects and task ontology of DRM. The DRM module is embedded to SCORM-compliant Content Repository Management System (CRMS) for IPR (Intellectual Property Rights) protection. Finally, some implications of this study are also included.
Radio Resource Management in UMTS/HSPA Networks
This chapter contains sections titled: Admission and Congestion Control Packet Scheduler HSDPA Power Allocation Power Control and Link Adaptation Mobility Management Summary References