Log in

Relevant bibliographies by topics / Estimation scalable de l'incertitude / Journal articles

To see the other types of publications on this topic, follow the link: Estimation scalable de l'incertitude.

Journal articles on the topic 'Estimation scalable de l'incertitude'

Author: Grafiati

Published: 25 May 2024

Last updated: 19 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Estimation scalable de l'incertitude.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Perret, Christian, P. Marchand, Arnaud Belleville, et al. "La variabilité en fonction du temps des relations hauteur débit. Sa prise en compte dans l'estimation des incertitudes des données hydrométriques par une méthode tabulée." La Houille Blanche, no. 4 (August 2018): 65–72. http://dx.doi.org/10.1051/lhb/2018043.

Full text

Abstract:

La démarche engagée depuis plusieurs années par la communauté des hydromètres pour quantifier les incertitudes associées au processus d'élaboration des données de débit mériterait de trouver des applications opérationnelles. La présente étude incite notamment les gestionnaires des stations hydrométriques à mieux valoriser les jaugeages effectués en systématisant la démarche de précision du modèle de courbe de tarage. Les auteurs proposent ensuite une démarche simplifiée de quantification de l'incertitude associée à une valeur de débit prédite par une courbe de tarage à partir du calcul de l'écart type des écarts en pour cent des jaugeages à la courbe de tarage et d'une tabulation en fonction des quantiles de débits observés. Elle s'appuie sur une démarche classique d'identification des sources d'incertitude et de leur propagation. Cette méthode permet de proposer une estimation de l'incertitude observée en moyenne sur les stations françaises pour la médiane des débits observés. On propose la formulation suivante : pour 45 à 55 % des stations françaises, la valeur la plus probable de l'incertitude au seuil de confiance de 95 % pour le quantile 50 % des débits observés en France est inférieure à 22 %.

APA, Harvard, Vancouver, ISO, and other styles

2

Jiang, Zhuqing, Likuo Wei, Ganmin Zeng, et al. "Bitrate Estimation for Spatial Scalable Videos." IEEE Transactions on Broadcasting 67, no. 2 (2021): 549–55. http://dx.doi.org/10.1109/tbc.2021.3064278.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wang, Xianglu. "Gaussian graphical model estimation with measurement error." JUSTC 53, no. 11 (2023): 1105. http://dx.doi.org/10.52396/justc-2022-0108.

Full text

Abstract:

It is well known that regression methods designed for clean data will lead to erroneous results if directly applied to corrupted data. Despite the recent methodological and algorithmic advances in Gaussian graphical model estimation, how to achieve efficient and scalable estimation under contaminated covariates is unclear. Here a new methodology called convex conditioned innovative scalable efficient estimation (COCOISEE) for Gaussian graphical model under both additive and multiplicative measurement errors is developed. It combines the strengths of the innovative scalable efficient estimation in Gaussian graphical model and the nearest positive semi-definite matrix projection, thus enjoying stepwise convexity and scalability. Comprehensive theoretical guarantees are provided and the effectiveness of the proposed methodology is demonstrated through numerical studies.

APA, Harvard, Vancouver, ISO, and other styles

4

Surya A, Kavya Sri Vaipava S, Ashika Deulin J, and Janani S. "Cognitive Brain Age Estimation." International Research Journal on Advanced Engineering Hub (IRJAEH) 3, no. 03 (2025): 648–52. https://doi.org/10.47392/irjaeh.2025.0089.

Full text

Abstract:

Cognitive brain age estimation combines computational techniques with health sciences to assess cognitive health. Traditional methods like neuroimaging and clinical evaluations are costly and not scalable. This research proposes a machine learning-based system for cognitive age estimation using non-invasive data, including speech patterns, behavioral metrics, and lifestyle factors. The system follows a modular architecture with data collection, preprocessing, feature extraction, and predictive modelling. By analyzing behavioral logs, speech characteristics, and lifestyle metrics, it generates real-time cognitive age estimates. This scalable and cost-effective approach, free from neuroimaging, enables deployment in healthcare settings and wearable devices. It also supports large-scale applications, such as public health monitoring and aging studies, enhancing accessibility, early detection, and personalized interventions in cognitive health.

APA, Harvard, Vancouver, ISO, and other styles

5

Cicala, Marco, Egidio D’Amato, Immacolata Notaro, and Massimiliano Mattei. "Scalable Distributed State Estimation in UTM Context." Sensors 20, no. 9 (2020): 2682. http://dx.doi.org/10.3390/s20092682.

Full text

Abstract:

This article proposes a novel approach to the Distributed State Estimation (DSE) problem for a set of co-operating UAVs equipped with heterogeneous on board sensors capable of exploiting certain characteristics typical of the UAS Traffic Management (UTM) context, such as high traffic density and the presence of limited range, Vehicle-to-Vehicle communication devices. The proposed algorithm is based on a scalable decentralized Kalman Filter derived from the Internodal Transformation Theory enhanced on the basis of the Consensus Theory. The general benefit of the proposed algorithm consists of, on the one hand, reducing the estimation problem to smaller local sub-problems, through a self-organization process of the local estimating nodes in response to the time varying communication topology; and on the other hand, of exploiting measures carried out nearby in order to improve the accuracy of the local estimates. In the UTM context, this enables each vehicle to estimate both its own position and velocity, as well as those of the neighboring vehicles, using both on board measurements and information transmitted by neighboring vehicles. A numerical simulation in a simplified UTM scenario is presented, in order to illustrate the salient aspects of the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

6

Li, Cheng, Sanvesh Srivastava, and David B. Dunson. "Simple, scalable and accurate posterior interval estimation." Biometrika 104, no. 3 (2017): 665–80. http://dx.doi.org/10.1093/biomet/asx033.

Full text

Abstract:

Summary Standard posterior sampling algorithms, such as Markov chain Monte Carlo procedures, face major challenges in scaling up to massive datasets. We propose a simple and general posterior interval estimation algorithm to rapidly and accurately estimate quantiles of the posterior distributions for one-dimensional functionals. Our algorithm runs Markov chain Monte Carlo in parallel for subsets of the data, and then averages quantiles estimated from each subset. We provide strong theoretical guarantees and show that the credible intervals from our algorithm asymptotically approximate those from the full posterior in the leading parametric order. Our algorithm has a better balance of accuracy and efficiency than its competitors across a variety of simulations and a real-data example.

APA, Harvard, Vancouver, ISO, and other styles

7

Emerson, Joseph, Robert Alicki, and Karol Życzkowski. "Scalable noise estimation with random unitary operators." Journal of Optics B: Quantum and Semiclassical Optics 7, no. 10 (2005): S347—S352. http://dx.doi.org/10.1088/1464-4266/7/10/021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

马, 跃. "Scalable Model Averaging Estimation with Missing Responses." Advances in Applied Mathematics 13, no. 05 (2024): 2520–29. http://dx.doi.org/10.12677/aam.2024.135240.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chen, Dong, Hua You Su, Wen Mei, Li Xuan Wang, and Chun Yuan Zhang. "Scalable Parallel Motion Estimation on Muti-GPU System." Applied Mechanics and Materials 347-350 (August 2013): 3708–14. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.3708.

Full text

Abstract:

With NVIDIA’s parallel computing architecture CUDA, using GPU to speed up compute-intensive applications has become a research focus in recent years. In this paper, we proposed a scalable method for multi-GPU system to accelerate motion estimation algorithm, which is the most time consuming process in video encoding. Based on the analysis of data dependency and multi-GPU architecture, a parallel computing model and a communication model are designed. We tested our parallel algorithm and analyzed the performance with 10 standard video sequences in different resolutions using 4 NVIDIA GTX460 GPUs, and calculated the overall speedup. Our results show that a speedup of 36.1 times using 1 GPU and more than 120 times for 4 GPUs on 1920x1080 sequences. Further, our parallel algorithm demonstrated the potential of nearly linear speedup according to the number of GPUs in the system.

APA, Harvard, Vancouver, ISO, and other styles

10

Galante, Franco, Giovanni Neglia, and Emilio Leonardi. "Scalable Decentralized Algorithms for Online Personalized Mean Estimation." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 16 (2025): 16699–707. https://doi.org/10.1609/aaai.v39i16.33835.

Full text

Abstract:

In numerous settings, agents lack sufficient data to learn a model directly. Collaborating with other agents may help, but introduces a bias-variance trade-off when local data distributions differ. A key challenge is for each agent to identify clients with similar distributions while learning the model, a problem that remains largely unresolved. This study focuses on a particular instance of the overarching problem, where each agent collects samples from a real-valued distribution over time to estimate its mean. Existing algorithms face impractical per-agent space and time complexities (linear in the number of agents |A|). To address scalability challenges, we propose a framework where agents self-organize into a graph, allowing each agent to communicate with only a selected number of peers r. We propose two collaborative mean estimation algorithms: one employs a consensus-based approach, while the other uses a message-passing scheme, with complexity O(r) and O(r log |A|), respectively. We establish conditions for both algorithms to yield asymptotically optimal estimates and we provide a theoretical characterization of their performance.

APA, Harvard, Vancouver, ISO, and other styles

11

Hassan, Beenish, Sobia Baig, and Saad Aslam. "On Scalability of FDD-Based Cell-Free Massive MIMO Framework." Sensors 23, no. 15 (2023): 6991. http://dx.doi.org/10.3390/s23156991.

Full text

Abstract:

Cell-free massive multiple-input multiple-output (MIMO) systems have the potential of providing joint services, including joint initial access, efficient clustering of access points (APs), and pilot allocation to user equipment (UEs) over large coverage areas with reduced interference. In cell-free massive MIMO, a large coverage area corresponds to the provision and maintenance of the scalable quality of service requirements for an infinitely large number of UEs. The research in cell-free massive MIMO is mostly focused on time division duplex mode due to the availability of channel reciprocity which aids in avoiding feedback overhead. However, the frequency division duplex (FDD) protocol still dominates the current wireless standards, and the provision of angle reciprocity aids in reducing this overhead. The challenge of providing a scalable cell-free massive MIMO system in an FDD setting is also prevalent, since computational complexity regarding signal processing tasks, such as channel estimation, precoding/combining, and power allocation, becomes prohibitively high with an increase in the number of UEs. In this work, we consider an FDD-based scalable cell-free network with angular reciprocity and a dynamic cooperation clustering approach. We have proposed scalability for our FDD cell-free and performed a comparative analysis with reference to channel estimation, power allocation, and precoding/combining techniques. We present expressions for scalable spectral efficiency, angle-based precoding/combining schemes and provide a comparison of overhead between conventional and scalable angle-based estimation as well as combining schemes. Simulations confirm that the proposed scalable cell-free network based on an FDD scheme outperforms the conventional matched filtering scheme based on scalable precoding/combining schemes. The angle-based LP-MMSE in the FDD cell-free network provides 14.3% improvement in spectral efficiency and 11.11% improvement in energy efficiency compared to the scalable MF scheme.

APA, Harvard, Vancouver, ISO, and other styles

12

Ju, Cheng, Susan Gruber, Samuel D. Lendle, et al. "Scalable collaborative targeted learning for high-dimensional data." Statistical Methods in Medical Research 28, no. 2 (2017): 532–54. http://dx.doi.org/10.1177/0962280217729845.

Full text

Abstract:

Robust inference of a low-dimensional parameter in a large semi-parametric model relies on external estimators of infinite-dimensional features of the distribution of the data. Typically, only one of the latter is optimized for the sake of constructing a well-behaved estimator of the low-dimensional parameter of interest. Optimizing more than one of them for the sake of achieving a better bias-variance trade-off in the estimation of the parameter of interest is the core idea driving the general template of the collaborative targeted minimum loss-based estimation procedure. The original instantiation of the collaborative targeted minimum loss-based estimation template can be presented as a greedy forward stepwise collaborative targeted minimum loss-based estimation algorithm. It does not scale well when the number p of covariates increases drastically. This motivates the introduction of a novel instantiation of the collaborative targeted minimum loss-based estimation template where the covariates are pre-ordered. Its time complexity is [Formula: see text] as opposed to the original [Formula: see text], a remarkable gain. We propose two pre-ordering strategies and suggest a rule of thumb to develop other meaningful strategies. Because it is usually unclear a priori which pre-ordering strategy to choose, we also introduce another instantiation called SL-C-TMLE algorithm that enables the data-driven choice of the better pre-ordering strategy given the problem at hand. Its time complexity is [Formula: see text] as well. The computational burden and relative performance of these algorithms were compared in simulation studies involving fully synthetic data or partially synthetic data based on a real world large electronic health database; and in analyses of three real, large electronic health databases. In all analyses involving electronic health databases, the greedy collaborative targeted minimum loss-based estimation algorithm is unacceptably slow. Simulation studies seem to indicate that our scalable collaborative targeted minimum loss-based estimation and SL-C-TMLE algorithms work well. All C-TMLEs are publicly available in a Julia software package.

APA, Harvard, Vancouver, ISO, and other styles

13

ADACHI, Ryosuke, Yuh YAMASHITA, and Koichi KOBAYASHI. "Distributed Estimation over Delayed Sensor Network with Scalable Communication." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A, no. 5 (2019): 712–20. http://dx.doi.org/10.1587/transfun.e102.a.712.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chun-Su Park, Seung-Jin Baek, Seung-Won Jung, Hye-Soo Kim, and Sung-Jea Ko. "Estimation-Based Interlayer Intra Prediction for Scalable Video Coding." IEEE Transactions on Circuits and Systems for Video Technology 19, no. 12 (2009): 1902–7. http://dx.doi.org/10.1109/tcsvt.2009.2026945.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Fröhlich, Fabian, Barbara Kaltenbacher, Fabian J. Theis, and Jan Hasenauer. "Scalable Parameter Estimation for Genome-Scale Biochemical Reaction Networks." PLOS Computational Biology 13, no. 1 (2017): e1005331. http://dx.doi.org/10.1371/journal.pcbi.1005331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Molino, A., F. Vacca, G. Masera, and T. Q. Nguyen. "Scalable phase extraction methods for phase plane motion estimation." IEE Proceedings - Vision, Image, and Signal Processing 153, no. 6 (2006): 860. http://dx.doi.org/10.1049/ip-vis:20060011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Choi, Jinha. "Motion vector memory reduction scheme for scalable motion estimation." Optical Engineering 48, no. 9 (2009): 090502. http://dx.doi.org/10.1117/1.3212689.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Jingning Han, Vinay Melkote, and Kenneth Rose. "An Estimation-Theoretic Framework for Spatially Scalable Video Coding." IEEE Transactions on Image Processing 23, no. 8 (2014): 3684–97. http://dx.doi.org/10.1109/tip.2014.2331761.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Dimitrov, D., and E. Atanassov. "Scalable system with accelerators for financial option prices estimation." International Journal of Data Science 1, no. 4 (2016): 305. http://dx.doi.org/10.1504/ijds.2016.081367.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Ghosal, S., and P. Vanek. "A fast scalable algorithm for discontinuous optical flow estimation." IEEE Transactions on Pattern Analysis and Machine Intelligence 18, no. 2 (1996): 181–94. http://dx.doi.org/10.1109/34.481542.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Mietens, S., P. H. N. de With, and C. Hentschel. "Computational-complexity scalable motion estimation for mobile MPEG encoding." IEEE Transactions on Consumer Electronics 50, no. 1 (2004): 281–91. http://dx.doi.org/10.1109/tce.2004.1277875.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Warrington, Stephen, Wai-Yip Chan, and Subramania Sudharsanan. "Scalable high-throughput variable block size motion estimation architecture." Microprocessors and Microsystems 33, no. 4 (2009): 319–25. http://dx.doi.org/10.1016/j.micpro.2009.02.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Watts, Stephen C., Scott C. Ritchie, Michael Inouye, and Kathryn E. Holt. "FastSpar: rapid and scalable correlation estimation for compositional data." Bioinformatics 35, no. 6 (2018): 1064–66. http://dx.doi.org/10.1093/bioinformatics/bty734.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

ABBAS, GHULAM. "Bandwidth Price Estimation for Scalable and Responsive Rate Control." Journal of Interconnection Networks 16, no. 03n04 (2016): 1650005. http://dx.doi.org/10.1142/s0219265916500055.

Full text

Abstract:

This paper concerns the analysis of important algorithmic attributes, namely, the rate of convergence and scalability, and their impact on Network Utility Maximization (NUM). The contribution of the paper is a novel distributed rate control mechanism with strong convergence and scalability properties. The proposed algorithm employs a distinctive distributed framework, where rate control is derived as a Sequential Quadratic Programming (SQP) mechanism incorporated with interior-point and trust-region methods. The NUM problem is solved by a barrier method that penalizes any violation of constraints. Lagrangian is applied to the barrier objective function, where multipliers are estimated using Least-square method to iteratively solve the quadratic approximation of the Lagrangian function at the current point to generate a search direction. The uniqueness of the algorithm is that it allows sources to estimate bandwidth prices and thereby enforces a scalable network core by pushing algorithmic complexity to the edges. The fast convergence of the algorithm, in turn, improves the responsiveness of rate control and enables reduced buffer occupancy. The convergence of the proposed algorithm is proved theoretically and is evaluated via simulations. The results demonstrate reasonable reduction of computation-time in tracking the optimal rates and validate the strong convergence properties of the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

25

Chen, Yian, and Mihai Anitescu. "Scalable Physics-Based Maximum Likelihood Estimation Using Hierarchical Matrices." SIAM/ASA Journal on Uncertainty Quantification 11, no. 2 (2023): 682–725. http://dx.doi.org/10.1137/21m1458880.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Ila, Viorela, Lukas Polok, Marek Solony, and Pavel Svoboda. "SLAM++-A highly efficient and temporally scalable incremental SLAM framework." International Journal of Robotics Research 36, no. 2 (2017): 210–30. http://dx.doi.org/10.1177/0278364917691110.

Full text

Abstract:

The most common way to deal with the uncertainty present in noisy sensorial perception and action is to model the problem with a probabilistic framework. Maximum likelihood estimation is a well-known estimation method used in many robotic and computer vision applications. Under Gaussian assumption, the maximum likelihood estimation converts to a nonlinear least squares problem. Efficient solutions to nonlinear least squares exist and they are based on iteratively solving sparse linear systems until convergence. In general, the existing solutions provide only an estimation of the mean state vector, the resulting covariance being computationally too expensive to recover. Nevertheless, in many simultaneous localization and mapping (SLAM) applications, knowing only the mean vector is not enough. Data association, obtaining reduced state representations, active decisions and next best view are only a few of the applications that require fast state covariance recovery. Furthermore, computer vision and robotic applications are in general performed online. In this case, the state is updated and recomputed every step and its size is continuously growing, therefore, the estimation process may become highly computationally demanding. This paper introduces a general framework for incremental maximum likelihood estimation called SLAM++, which fully benefits from the incremental nature of the online applications, and provides efficient estimation of both the mean and the covariance of the estimate. Based on that, we propose a strategy for maintaining a sparse and scalable state representation for large scale mapping, which uses information theory measures to integrate only informative and non-redundant contributions to the state representation. SLAM++ differs from existing implementations by performing all the matrix operations by blocks. This led to extremely fast matrix manipulation and arithmetic operations used in nonlinear least squares. Even though this paper tests SLAM++ efficiency on SLAM problems, its applicability remains general.

APA, Harvard, Vancouver, ISO, and other styles

27

Eschle, Jonas, Albert Navarro Puig, Rafael Silva Coutinho, and Nicola Serra. "zfit: scalable pythonic fitting." EPJ Web of Conferences 245 (2020): 06025. http://dx.doi.org/10.1051/epjconf/202024506025.

Full text

Abstract:

Statistical modeling and fitting is a key element in most HEP analyses. This task is usually performed in the C++ based framework ROOT/RooFit. Recently the HEP community started shifting more to the Python language, which the tools above are only loose integrated into, and a lack of stable, native Python based toolkits became clear. We presented zfit, a project that aims at building a fitting ecosystem by providing a carefully designed, stable API and a workflow for libraries to communicate together with an implementation fully integrated into the Python ecosystem. It is built on top of one of the state-of-theart industry tools, TensorFlow, which is used the main computational backend. zfit provides data loading, extensive model building capabilities, loss creation, minimization and certain error estimation. Each part is also provided with convenient base classes built for customizability and extendability.

APA, Harvard, Vancouver, ISO, and other styles

28

Starr, Jeffrey, Scott Moses, and Le Gruenwald. "A scalable approach for estimation of resource availability using bitfields." Integrated Computer-Aided Engineering 11, no. 4 (2004): 349–58. http://dx.doi.org/10.3233/ica-2004-11405.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Cândido, Paulo Gustavo Lopes, Jonathan Andrade Silva, Elaine Ribeiro Faria, and Murilo Coelho Naldi. "Optimization Algorithms for Scalable Stream Batch Clustering with k Estimation." Applied Sciences 12, no. 13 (2022): 6464. http://dx.doi.org/10.3390/app12136464.

Full text

Abstract:

The increasing volume and velocity of the continuously generated data (data stream) challenge machine learning algorithms, which must evolve to fit real-world problems. The data stream clustering algorithms face issues such as the rapidly increasing volume of the data, the variety of the number of clusters, and their shapes. The present work aims to improve the accuracy of sequential clustering batches of data streams for scenarios in which clusters evolve dynamically and continuously, automatically estimating their number. In order to achieve this goal, three evolutionary algorithms are presented, along with three novel algorithms designed to deal with clusters of normal distribution based on goodness-of-fit tests in the context of scalable batch stream clustering with automatic estimation of the number of clusters. All of them are developed on top of MapReduce, Discretized-Stream models, and the most recent MPC frameworks to provide scalability, reliability, resilience, and flexibility. The proposed algorithms are experimentally compared with state-of-the-art methods and present the best results for accuracy for normally distributed data sets, reaching their goal.

APA, Harvard, Vancouver, ISO, and other styles

30

Ullah, Mahbuba Sheba, Ahmed Tewfik, and Robert W. Heath. "Leveraging Waveform Structure to Develop a Power Scalable AoA Estimation." IEEE Open Journal of the Communications Society 2 (2021): 2739–59. http://dx.doi.org/10.1109/ojcoms.2021.3134812.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Metta, Ravindra, Martin Becker, Prasad Bokil, Samarjit Chakraborty, and R. Venkatesh. "TIC: a scalable model checking based approach to WCET estimation." ACM SIGPLAN Notices 51, no. 5 (2016): 72–81. http://dx.doi.org/10.1145/2980930.2907961.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Gong, Wei, Ivan Stojmenovic, Amiya Nayak, Kebin Liu, and Haoxiang Liu. "Fast and Scalable Counterfeits Estimation for Large-Scale RFID Systems." IEEE/ACM Transactions on Networking 24, no. 2 (2016): 1052–64. http://dx.doi.org/10.1109/tnet.2015.2406669.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Bates, Stephen, and Robert Tibshirani. "Log‐ratio lasso: Scalable, sparse estimation for log‐ratio models." Biometrics 75, no. 2 (2019): 613–24. http://dx.doi.org/10.1111/biom.12995.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Zhang, Jingru, and Wei Lin. "Scalable estimation and regularization for the logistic normal multinomial model." Biometrics 75, no. 4 (2019): 1098–108. http://dx.doi.org/10.1111/biom.13071.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Mrak, M., N. Sprljan, and E. Izquierdo. "Motion estimation in temporal subbands for quality scalable motion coding." Electronics Letters 41, no. 19 (2005): 1050. http://dx.doi.org/10.1049/el:20052863.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

McLoughlin, Terence H., and Mark Campbell. "Scalable Sensing, Estimation, and Control Architecture for Large Spacecraft Formations." Journal of Guidance, Control, and Dynamics 30, no. 2 (2007): 289–300. http://dx.doi.org/10.2514/1.21322.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Vincent, Robert J., David J. Ives, and Seb J. Savory. "Scalable Capacity Estimation for Nonlinear Elastic All-Optical Core Networks." Journal of Lightwave Technology 37, no. 21 (2019): 5380–91. http://dx.doi.org/10.1109/jlt.2019.2942710.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Kucuk, Kerem, and Adnan Kavak. "Scalable location estimation using smart antennas in wireless sensor networks." Ad Hoc Networks 8, no. 8 (2010): 889–903. http://dx.doi.org/10.1016/j.adhoc.2010.04.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Fan, Yingying, and Jinchi Lv. "Innovated scalable efficient estimation in ultra-large Gaussian graphical models." Annals of Statistics 44, no. 5 (2016): 2098–126. http://dx.doi.org/10.1214/15-aos1416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Wang, Gang, Georgios B. Giannakis, and Jie Chen. "Robust and Scalable Power System State Estimation via Composite Optimization." IEEE Transactions on Smart Grid 10, no. 6 (2019): 6137–47. http://dx.doi.org/10.1109/tsg.2019.2897100.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Jin, Ming, Igor Molybog, Reza Mohammadi-Ghazi, and Javad Lavaei. "Scalable and Robust State Estimation From Abundant But Untrusted Data." IEEE Transactions on Smart Grid 11, no. 3 (2020): 1880–94. http://dx.doi.org/10.1109/tsg.2019.2944986.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Benallal, Abdellah, Nawal Cheggaga, Amine Hebib, and Adrian Ilinca. "LSTM-Based State-of-Charge Estimation and User Interface Development for Lithium-Ion Battery Management." World Electric Vehicle Journal 16, no. 3 (2025): 168. https://doi.org/10.3390/wevj16030168.

Full text

Abstract:

State-of-charge (SOC) estimation is pivotal in optimizing lithium-ion battery management systems (BMSs), ensuring safety, performance, and longevity across various applications. This study introduces a novel SOC estimation framework that uniquely integrates Long Short-Term Memory (LSTM) neural networks with Hyperband-driven hyperparameter optimization, a combination not extensively explored in the literature. A comprehensive experimental dataset is created using data of LG 18650HG2 lithium-ion batteries subjected to diverse operational cycles and thermal conditions. The proposed framework demonstrates superior prediction accuracy, achieving a Mean Square Error (MSE) of 0.0023 and a Mean Absolute Error (MAE) of 0.0043, outperforming traditional estimation methods. The Hyperband optimization algorithm accelerates model training and enhances adaptability to varying operating conditions, making it scalable for diverse battery applications. Developing an intuitive, real-time user interface (UI) tailored for practical deployment bridges the gap between advanced SOC estimation techniques and user accessibility. Detailed residual and regression analyses confirm the proposed solution’s robustness, generalizability, and reliability. This work offers a scalable, accurate, and user-friendly SOC estimation solution for commercial BMSs, with future research aimed at extending the framework to other battery chemistries and hybrid energy systems.

APA, Harvard, Vancouver, ISO, and other styles

43

Ambroise, B. "Génèse des débits dans les petits bassins versants ruraux en milieu tempéré : 2 - Modélisation systémique et dynamique." Revue des sciences de l'eau 12, no. 1 (2005): 125–53. http://dx.doi.org/10.7202/705346ar.

Full text

Abstract:

La deuxième partie de cette synthèse bibliographique sur la genèse des débits montre comment les connaissances acquises sur le fonctionnement des petits bassins ruraux (cf. Partie 1) peuvent être utilisées pour les modéliser. Elle présente les différents types de modèles hydrologiques (empiriques globaux de type "boîte noire", conceptuels globaux ou semi-spatialisés, physiques spatialisés, physico-conceptuels semi-spatialisés) disponibles pour générer des chroniques événementielles ou continues, et déduit de l'analyse de leurs avantages et limites respectifs certaines recommandations pour leur choix et leur usage. Elle indique ensuite différents problèmes rencontrés dans toute modélisation, et quelques pistes possibles pour les résoudre: incorporation des flux couplés à l'eau dans les modèles hydrologiques, erreurs liées à la structure du modèle (limites et simplifications théoriques, approximations numériques, discrétisations temporelle et spatiale), problèmes métrologiques et méthodologiques limitant la disponibilité des données, hétérogénéités à toutes les échelles limitant l'adéquation des données pour paramétrer les modèles, calage du modèle limitant son aptitude à simuler des scénarios de changement. Elle souligne la nécessité d'une validation multicritère des modèles et d'une estimation de l'incertitude sur les simulations générée par ces diverses sources d'erreurs, ainsi que le besoin d'une meilleure interaction entre expérimentation de terrain et modélisation.

APA, Harvard, Vancouver, ISO, and other styles

44

Yu, Chen, Luo Haiyong, Zhao Fang, Wang Qu, and Shao Wenhua. "Adaptive Kalman filtering-based pedestrian navigation algorithm for smartphones." International Journal of Advanced Robotic Systems 17, no. 3 (2020): 172988142093093. http://dx.doi.org/10.1177/1729881420930934.

Full text

Abstract:

Pedestrian navigation with daily smart devices has become a vital issue over the past few years and the accurate heading estimation plays an essential role in it. Compared to the pedestrian dead reckoning (PDR) based solutions, this article constructs a scalable error model based on the inertial navigation system and proposes an adaptive heading estimation algorithm with a novel method of relative static magnetic field detection. To mitigate the impact of magnetic fluctuation, the proposed algorithm applies a two-way Kalman filter process. Firstly, it achieves the historical states with the optimal smoothing algorithm. Secondly, it adjusts the noise parameters adaptively to reestimate current attitudes. Different from the pedestrian dead reckoning-based solution, the error model system in this article contains more state information, which means it is more sensitive and scalable. Moreover, several experiments were conducted, and the experimental results demonstrate that the proposed heading estimation algorithm obtains better performance than previous approaches and our system outperforms the PDR system in terms of flexibility and accuracy.

APA, Harvard, Vancouver, ISO, and other styles

45

Bijur, Gururaj, Ramakrishna Mundugar, Vinayak Mantoor, and Karunakar A Kotegar. "Estimation of Adaptation Parameters for Dynamic Video Adaptation in Wireless Network Using Experimental Method." Computers 10, no. 4 (2021): 39. http://dx.doi.org/10.3390/computers10040039.

Full text

Abstract:

A wireless network gives flexibility to the user in terms of mobility that attracts the user to use wireless communication more. The video communication in the wireless network experiences Quality of Services (QoS) and Quality of Experience (QoE) issues due to network dynamics. The parameters, such as node mobility, routing protocols, and distance between the nodes, play a major role in the quality of video communication. Scalable Video Coding (SVC) is an extension to H.264 Advanced Video Coding (AVC), allows partial removal of layers, and generates a valid adapted bit-stream. This adaptation feature enables the streaming of video data over a wireless network to meet the availability of the resources. The video adaptation is a dynamic process and requires prior knowledge to decide the adaptation parameter for extraction of the video levels. This research work aims at building the adaptation parameters that are required by the adaptation engines, such as Media Aware Network Elements (MANE), to perform adaptation on-the-fly. The prior knowledge improves the performances of the adaptation engines and gives the improved quality of the video communication. The unique feature of this work is that, here, we used an experimental evaluation method to identify the video levels that are suitable for a given network condition. In this paper, we estimated the adaptation parameters for streaming scalable video over the wireless network using the experimental method. The adaptation parameters are derived using node mobility, link bandwidth, and motion level of video sequences as deciding parameters. The experimentation is carried on the OMNeT++ tool, and Joint Scalable Video Module (JSVM) is used to encode and decode the scalable video data.

APA, Harvard, Vancouver, ISO, and other styles

46

Zheng, Liang-Wei. "Computation Controllable Mode Decision and Motion Estimation for Scalable Video Coding." ETRI Journal 35, no. 3 (2013): 469–79. http://dx.doi.org/10.4218/etrij.13.0112.0421.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

HoangVan, Xiem. "Adaptive Quantization Parameter Estimation for HEVC Based Surveillance Scalable Video Coding." Electronics 9, no. 6 (2020): 915. http://dx.doi.org/10.3390/electronics9060915.

Full text

Abstract:

Visual surveillance systems have been playing a vital role in human modern life with a large number of applications, ranging from remote home management, public security to traffic monitoring. The recent High Efficiency Video Coding (HEVC) scalable extension, namely SHVC, provides not only the compression efficiency but also the adaptive streaming capability. However, SHVC is originally designed for videos captured from generic scenes rather than from visual surveillance systems. In this paper, we propose a novel HEVC based surveillance scalable video coding (SSVC) framework. First, to achieve high quality inter prediction, we propose a long-term reference coding method, which adaptively exploits the temporal correlation among frames in surveillance video. Second, to optimize the SSVC compression performance, we design a quantization parameter adaptation mechanism in which the relationship between SSVC rate-distortion (RD) performance and the quantization parameter is statistically modeled by a fourth-order polynomial function. Afterwards, an appropriate quantization parameter is derived for frames at long-term reference position. Experiments conducted for a common set of surveillance videos have shown that the proposed SSVC significantly outperforms the relevant SHVC standard, notably by around 6.9% and 12.6% bitrate saving for the low delay (LD) and random access (RA) coding configurations, respectively while still providing a similar perceptual decoded frame quality.

APA, Harvard, Vancouver, ISO, and other styles

48

Na, Sangkwon, and Chong-Min Kyung. "Activity-Based Motion Estimation Scheme for H.264 Scalable Video Coding." IEEE Transactions on Circuits and Systems for Video Technology 20, no. 11 (2010): 1475–85. http://dx.doi.org/10.1109/tcsvt.2010.2077493.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Lin, Weiyao, Krit Panusopone, David M. Baylon, and Ming-Ting Sun. "A Computation Control Motion Estimation Method for Complexity-Scalable Video Coding." IEEE Transactions on Circuits and Systems for Video Technology 20, no. 11 (2010): 1533–43. http://dx.doi.org/10.1109/tcsvt.2010.2077773.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Abebe, Ameha Tsegaye, and Chung G. Kang. "Joint Channel Estimation and MUD for Scalable Grant-Free Random Access." IEEE Communications Letters 23, no. 12 (2019): 2229–33. http://dx.doi.org/10.1109/lcomm.2019.2945577.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!