Academic literature on the topic 'Lagrange Coded Computing'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Lagrange Coded Computing.'

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.

Journal articles on the topic "Lagrange Coded Computing"

1

Soleymani, Mahdi, Hessam Mahdavifar, and A. Salman Avestimehr. "Analog Lagrange Coded Computing." IEEE Journal on Selected Areas in Information Theory 2, no. 1 (2021): 283–95. http://dx.doi.org/10.1109/jsait.2021.3056377.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Asheralieva, Alia, and Dusit Niyato. "Fast and Secure Computational Offloading With Lagrange Coded Mobile Edge Computing." IEEE Transactions on Vehicular Technology 70, no. 5 (2021): 4924–42. http://dx.doi.org/10.1109/tvt.2021.3070723.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zeng, Qicheng, Zhaojun Nan, and Sheng Zhou. "Adaptive Privacy-Preserving Coded Computing with Hierarchical Task Partitioning." Entropy 26, no. 10 (2024): 881. http://dx.doi.org/10.3390/e26100881.

Full text
Abstract:
Coded computing is recognized as a promising solution to address the privacy leakage problem and the straggling effect in distributed computing. This technique leverages coding theory to recover computation tasks using results from a subset of workers. In this paper, we propose the adaptive privacy-preserving coded computing (APCC) strategy, designed to be applicable to various types of computation tasks, including polynomial and non-polynomial functions, and to adaptively provide accurate or approximated results. We prove the optimality of APCC in terms of encoding rate, defined as the ratio
APA, Harvard, Vancouver, ISO, and other styles
4

Galetzka, Armin, Dimitrios Loukrezis, and Herbert De Gersem. "Three-dimensional data-driven magnetostatic field computation using real-world measurement data." COMPEL - The international journal for computation and mathematics in electrical and electronic engineering 41, no. 2 (2021): 615–27. http://dx.doi.org/10.1108/compel-06-2021-0219.

Full text
Abstract:
Purpose The purpose of this paper is to present the applicability of data-driven solvers to computationally demanding three-dimensional problems and their practical usability when using real-world measurement data. Design/methodology/approach Instead of using a hard-coded phenomenological material model within the solver, the data-driven computing approach reformulates the boundary value problem such that the field solution is directly computed on raw measurement data. The data-driven formulation results in a double minimization problem based on Lagrange multipliers, where the sought solution
APA, Harvard, Vancouver, ISO, and other styles
5

Asheralieva, Alia, Dusit Niyato, and Zehui Xiong. "Auction-and-Learning Based Lagrange Coded Computing Model for Privacy-Preserving, Secure, and Resilient Mobile Edge Computing." IEEE Transactions on Mobile Computing, 2021, 1. http://dx.doi.org/10.1109/tmc.2021.3097380.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhu, Jinbao, Hengxuan Tang, Songze Li, and Yijia Chang. "Generalized Lagrange Coded Computing: A Flexible Computation-Communication Tradeoff for Resilient, Secure, and Private Computation." IEEE Transactions on Communications, 2024, 1. http://dx.doi.org/10.1109/tcomm.2024.3492071.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chung, Dang Huu. "On FSUM model and applications." Vietnam Journal of Mechanics 30, no. 4 (2008). http://dx.doi.org/10.15625/0866-7136/30/4/5629.

Full text
Abstract:
In this paper a 3D model (FSUM) on tidal flows with sediment transport and bed morphology process taking into account the temperature-salinity exchange in estuaries and coastal zones is introduced in more detail. The implicit finite difference method based on semi-Lagrange splitting is used. The software is coded with FORTRAN 90/95. The open boundary condition kinds together source/sink terms are well treated so that it can be applied to every computing domain with the complicated geometry. The software is validated and applied for many different cases and shows the ability of application in p
APA, Harvard, Vancouver, ISO, and other styles
8

"An Integrated Program to Simulate the Multibody Dynamics of Flapping Flight." JST: Smart Systems and Devices 31, no. 1 (2020): 76–84. http://dx.doi.org/10.51316/jst.150.ssad.2021.31.1.10.

Full text
Abstract:
This paper presents an in-house developed program that couples multibody dynamics and aerodynamics codes to simulate flapping flight of insects and micro air vehicles. The multibody dynamics code is built based on the numerical solution of the Lagrange equation, while the extended unsteady vortex-lattice method is employed to develop the aerodynamics code. The solution from the governing equation is obtained by the use of the fourth-order Runge-Kutta method and validated against the simulation results from a commercial software MSC Adams for a micro air vehicle model. In this work, parallel co
APA, Harvard, Vancouver, ISO, and other styles
9

Mulansky, Bernd, and Andreas Potschka. "A zonogon approach for computing small convex polygons of maximum perimeter." Mathematical Programming, June 21, 2025. https://doi.org/10.1007/s10107-025-02244-x.

Full text
Abstract:
Abstract We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with n vertices that is small (diameter at most one) and has maximum perimeter provided a stated conjecture is true. The formulation is based on a geometric construction using centrally symmetric polygons (zonogons). The resulting zonogons can be characterized by equivalence classes (under the action of the dihedral group) of 2n-vectors with entries either plus or minus one and a self-duality property and we study the number of these codes. We propose a two-phase computational appro
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Lagrange Coded Computing"

1

Saraswathy, RM. "Optimal Redundancy in Distributed Systems for Latency and Repair." Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5542.

Full text
Abstract:
Distributed systems are employed in many modern storage and computing architecture for greater reliability and cost-efficiency. There are several important considerations in the design and implementation of such distributed systems, such as latency, availability, storage cost, among others. We look into the interplay between redundancy and the parameters, latency and repair for the design of such systems. Data is replicated and stored redundantly over multiple servers for availability in distributed databases. In this thesis, we first study the impact of redundancy on system latency in distri
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Lagrange Coded Computing"

1

Poncet Raphaël, Peybernes Mathieu, Gasc Thibault, and De Vuyst Florian. "Performance modeling of a compressible hydrodynamics solver on multicore CPUs." In Advances in Parallel Computing. IOS Press, 2016. https://doi.org/10.3233/978-1-61499-621-7-449.

Full text
Abstract:
This work is devoted to the performance modeling of a vectorized multi-threaded implementation of a compressible hydrodynamics solver on current multicore CPUs. The underlying explicit time-advance scheme is based on a Lagrange+remap discretization. The algorithm consists in nine elementary kernels that exhibit, for most of them, a stencil update pattern. Using the Execution Cache Memory (ECM) model — a refinement of the Roofline model —, we devise a high fidelity performance model, allowing us to finely understand and overcome bottlenecks of the algorithm and accurately predict global code performance.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Lagrange Coded Computing"

1

Borah, Rimpi, and J. Harshan. "On Securing Analog Lagrange Coded Computing from Colluding Adversaries." In 2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619472.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Subramaniam, Adarsh M., Anoosheh Heidarzadeh, Asit Kumar Pradhan, and Krishna R. Narayanan. "Product Lagrange Coded Computing." In 2020 IEEE International Symposium on Information Theory (ISIT). IEEE, 2020. http://dx.doi.org/10.1109/isit44484.2020.9174440.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fahim, Mohammad, and Viveck R. Cadambe. "Lagrange Coded Computing with Sparsity Constraints." In 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2019. http://dx.doi.org/10.1109/allerton.2019.8919966.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xiong, Bohang, Jing Tian, and Zhongfeng Wang. "A High-Speed Codec Architecture for Lagrange Coded Computing." In 2022 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 2022. http://dx.doi.org/10.1109/iscas48785.2022.9937664.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Raviv, Netanel, Qian Yu, Jehoshua Bruck, and Salman Avestimehr. "Download and Access Trade-offs in Lagrange Coded Computing." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849547.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhu, Jinbao, and Songze Li. "Generalized Lagrange Coded Computing: A Flexible Computation-Communication Tradeoff." In 2022 IEEE International Symposium on Information Theory (ISIT). IEEE, 2022. http://dx.doi.org/10.1109/isit50566.2022.9834535.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhong, Xi, Jörg Kliewer, and Mingyue Ji. "Matrix Multiplication with Straggler Tolerance in Coded Elastic Computing via Lagrange Code." In ICC 2023 - IEEE International Conference on Communications. IEEE, 2023. http://dx.doi.org/10.1109/icc45041.2023.10279134.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gupta, Shivangi, and J. Harshan. "Analog Lagrange Coded Computing: On the Curious Case of Adversarial Workers." In 2024 National Conference on Communications (NCC). IEEE, 2024. http://dx.doi.org/10.1109/ncc60321.2024.10485866.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ni, Weiquan, Shaoliang Zhu, Md Monjurul Karim, et al. "Lagrange Coded Federated Learning (L-CoFL) Model for Internet of Vehicles." In 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 2022. http://dx.doi.org/10.1109/icdcs54860.2022.00088.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dauch, T., S. Braun, L. Wieth, et al. "Computation of Liquid Fuel Atomization and Mixing by Means of the SPH Method: Application to a Jet Engine Fuel Nozzle." In ASME Turbo Expo 2016: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/gt2016-56023.

Full text
Abstract:
At the “Institut für Thermische Strömungsmaschinen” (ITS) a numerical method based on the the meshfree “Smoothed Particle Hydrodynamics” (SPH) approach has been developed with the objective of computing primary breakup in the vicinity of fuel spray nozzles [1, 2]. In recent publications the successful application of the code to different flow problems is demonstrated [3, 4]. In this paper we present the first application of the method to investigate a simplified, but applied fuel spray nozzle geometry of the swirl cup design in 2D. The atomization process of Jet-A1 at ambient and at high press
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!