Log in

Relevant bibliographies by topics / Coded Computation / Journal articles

To see the other types of publications on this topic, follow the link: Coded Computation.

Journal articles on the topic 'Coded Computation'

Author: Grafiati

Published: 6 September 2023

Last updated: 25 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 'Coded Computation.'

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

Kim, Minchul, and Jungwoo Lee. "Private Secure Coded Computation." IEEE Communications Letters 23, no. 11 (2019): 1918–21. http://dx.doi.org/10.1109/lcomm.2019.2934436.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kosaian, Jack, K. V. Rashmi, and Shivaram Venkataraman. "Learning-Based Coded Computation." IEEE Journal on Selected Areas in Information Theory 1, no. 1 (2020): 227–36. http://dx.doi.org/10.1109/jsait.2020.2983165.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jia, Zhuqing, and Syed Ali Jafar. "Cross Subspace Alignment Codes for Coded Distributed Batch Computation." IEEE Transactions on Information Theory 67, no. 5 (2021): 2821–46. http://dx.doi.org/10.1109/tit.2021.3064827.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Tian, Xiaolin. "Enhanced Distributed Computation for Machine Learning: Coded Strategies and Multidisciplinary Impact." ITM Web of Conferences 73 (2025): 03026. https://doi.org/10.1051/itmconf/20257303026.

Full text

Abstract:

This article explores methods to accelerate distributed computation, focusing on its application in machine learning. It discusses two primary concepts: coded multiplication and data shuffling, along with a non-linear core to Random Access Memory (RAM) approach, presenting new avenues for future research. The challenges and future developments of coded computation in machine learning are examined, along with a general discussion on its applications across various scientific fields. The need for systems capable of handling massive data volumes has led to the adoption of large-scale distributed

APA, Harvard, Vancouver, ISO, and other styles

5

Reisizadeh, Amirhossein, Saurav Prakash, Ramtin Pedarsani, and Amir Salman Avestimehr. "Coded Computation Over Heterogeneous Clusters." IEEE Transactions on Information Theory 65, no. 7 (2019): 4227–42. http://dx.doi.org/10.1109/tit.2019.2904055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Yuan, Shijie. "Advancements in Coded Computation: Integrating Encoding Matrices with Data Shuffling for Enhanced Data Transmission Efficiency." ITM Web of Conferences 73 (2025): 03023. https://doi.org/10.1051/itmconf/20257303023.

Full text

Abstract:

In the interconnected age of big data, cloud computing, and the Internet of Things, the demand for robust data processing and transmission systems is critical. This study delves into the fundamental principles, technological advantages, and applications of coded computation, emphasizing the integration of encoding matrices and data shuffling techniques. Encoding matrices enhance data reliability, fault tolerance, and security, reducing transmission and storage costs. Data shuffling techniques, by reordering data, decrease communication overhead and computational burden, thereby optimizing the

APA, Harvard, Vancouver, ISO, and other styles

7

Ozfatura, Emre, Sennur Ulukus, and Deniz Gündüz. "Straggler-Aware Distributed Learning: Communication–Computation Latency Trade-Off." Entropy 22, no. 5 (2020): 544. http://dx.doi.org/10.3390/e22050544.

Full text

Abstract:

When gradient descent (GD) is scaled to many parallel workers for large-scale machine learning applications, its per-iteration computation time is limited by straggling workers. Straggling workers can be tolerated by assigning redundant computations and/or coding across data and computations, but in most existing schemes, each non-straggling worker transmits one message per iteration to the parameter server (PS) after completing all its computations. Imposing such a limitation results in two drawbacks: over-computation due to inaccurate prediction of the straggling behavior, and under-utilizat

APA, Harvard, Vancouver, ISO, and other styles

8

Chen, Li, Kaifeng Han, Ying Du, and Zhiqin Wang. "Block-Division-Based Wireless Coded Computation." IEEE Wireless Communications Letters 11, no. 2 (2022): 283–87. http://dx.doi.org/10.1109/lwc.2021.3125983.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Obead, Sarah A., Hsuan-Yin Lin, Eirik Rosnes, and Jorg Kliewer. "Private Linear Computation for Noncolluding Coded Databases." IEEE Journal on Selected Areas in Communications 40, no. 3 (2022): 847–61. http://dx.doi.org/10.1109/jsac.2022.3142362.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hong, Sangwoo, Heecheol Yang, and Jungwoo Lee. "Squeezed Polynomial Codes: Communication-Efficient Coded Computation in Straggler-Exploiting Distributed Matrix Multiplication." IEEE Access 8 (2020): 190516–28. http://dx.doi.org/10.1109/access.2020.3031590.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

B., Hasirciolu, Gómez-Vilardebó Jesús, and Gunduz D. "Bivariate Polynomial Codes for Secure Distributed Matrix Multiplication." IEEE J Sel Areas Commun 40, no. 3 (2022): 955–67. https://doi.org/10.1109/JSAC.2022.3142355.

Full text

Abstract:

We consider the problem of secure distributed matrix multiplication (SDMM). Coded computation has been shown to be an effective solution in distributed matrix multiplication, both providing privacy against workers and boosting the computation speed by efficiently mitigating stragglers. In this work, we present a non-direct secure extension of the recently introduced bivariate polynomial codes. Bivariate polynomial codes have been shown to be able to further speed up distributed matrix multiplication by exploiting the partial work done by the stragglers rather than completely ignoring them whil

APA, Harvard, Vancouver, ISO, and other styles

12

Moritaka, Kiyoshi, and Tomonori Kawano. "Use of Colored Reflectors for Negation or Highlighting of Scanned Color Information on Film-Based CIELAB-Coded Optical Logic Gate Models." Journal of Advanced Computational Intelligence and Intelligent Informatics 17, no. 6 (2013): 799–804. http://dx.doi.org/10.20965/jaciii.2013.p0799.

Full text

Abstract:

In the last two decades, a number of researchers have been engaged in the study of natural computing systems that employ physical, chemical, and biological properties as direct media for manifesting computations. Among such attempts, studies focusing on the use of lights as key computation components in particular have attracted the attention of researchers and engineers, since these studies are potentially applicable to signal processing through optical interconnections between electronic devices. Our research team has recently been engaged in the study of a novel color-based natural computin

APA, Harvard, Vancouver, ISO, and other styles

13

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

14

Choi, Sang Won. "Index Coded Automatic Repeat Request (ARQ)." Entropy 22, no. 8 (2020): 869. http://dx.doi.org/10.3390/e22080869.

Full text

Abstract:

In this paper, an index-coded Automatic Repeat Request (ARQ) is studied in the perspectives of transmission efficiency and memory overhead. Motivated by reducing significant computational complexity from huge matrix inverse computation of random linear network coding, a near-to-optimal broadcasting scheme, called index-coded Automatic Repeat Request (ARQ) is proposed. The main idea is to consider the principal packet error pattern across all receivers. With the help of coded side information formed by successfully decoded packets associated with the dominant packet error pattern, it is shown t

APA, Harvard, Vancouver, ISO, and other styles

15

Akbari-Nodehi, Hanzaleh, and Mohammad Ali Maddah-Ali. "Secure Coded Multi-Party Computation for Massive Matrix Operations." IEEE Transactions on Information Theory 67, no. 4 (2021): 2379–98. http://dx.doi.org/10.1109/tit.2021.3050853.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Zhang, Fan, Yuxuan Sun, and Sheng Zhou. "Coded Computation Over Heterogeneous Workers With Random Task Arrivals." IEEE Communications Letters 25, no. 7 (2021): 2338–42. http://dx.doi.org/10.1109/lcomm.2021.3067888.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Yang, Heecheol, Sangwoo Hong, and Jungwoo Lee. "Securely Straggler-Exploiting Coded Computation for Distributed Matrix Multiplication." IEEE Access 9 (2021): 167374–88. http://dx.doi.org/10.1109/access.2021.3135581.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Asif, M. Salman, Ali Ayremlou, Aswin Sankaranarayanan, Ashok Veeraraghavan, and Richard G. Baraniuk. "FlatCam: Thin, Lensless Cameras Using Coded Aperture and Computation." IEEE Transactions on Computational Imaging 3, no. 3 (2017): 384–97. http://dx.doi.org/10.1109/tci.2016.2593662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Pearce, Christopher, Adam McLeod, Jon Patrick, et al. "Coding and classifying GP data: the POLAR project." BMJ Health & Care Informatics 26, no. 1 (2019): e100009. http://dx.doi.org/10.1136/bmjhci-2019-100009.

Full text

Abstract:

BackgroundData, particularly ‘big’ data are increasingly being used for research in health. Using data from electronic medical records optimally requires coded data, but not all systems produce coded data.ObjectiveTo design a suitable, accurate method for converting large volumes of narrative diagnoses from Australian general practice records to codify them into SNOMED-CT-AU. Such codification will make them clinically useful for aggregation for population health and research purposes.MethodThe developed method consisted of using natural language processing to automatically code the texts, fol

APA, Harvard, Vancouver, ISO, and other styles

20

Jonsson, Erik, and Michael Felsberg. "Efficient computation of channel-coded feature maps through piecewise polynomials." Image and Vision Computing 27, no. 11 (2009): 1688–94. http://dx.doi.org/10.1016/j.imavis.2008.11.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Fiorini, Rodolfo A. "Towards Advanced Quantum Cognitive Computation." International Journal of Software Science and Computational Intelligence 9, no. 1 (2017): 1–19. http://dx.doi.org/10.4018/ijssci.2017010101.

Full text

Abstract:

Computational information conservation theory (CICT) can help us to develop competitive applications and even advanced quantum cognitive computational application and systems towards deep computational cognitive intelligence. CICT new awareness of a discrete HG (hyperbolic geometry) subspace (reciprocal space, RS) of coded heterogeneous hyperbolic structures, underlying the familiar Q Euclidean (direct space, DS) system surface representation can open the way to holographic information geometry (HIG) to recover lost coherence information in system description and to develop advanced quantum co

APA, Harvard, Vancouver, ISO, and other styles

22

Zhang, Lin. "Research on distributed coding computation based on matrix multiplication." Applied and Computational Engineering 14, no. 1 (2023): 74–80. http://dx.doi.org/10.54254/2755-2721/14/20230763.

Full text

Abstract:

Matrix multiplication is used in machine learning to train larger, more accurate models with massive data more effectively. The distributed machine learning paradigm necessitates the distributed computing of many matrix multiplications once it is adopted. The execution time of distributed machine learning algorithms increases on dropout nodes, which are computational nodes in distributed clusters that randomly slow down computation due to a variety of factors (e.g., node failure, system failure, communication bottlenecks, etc.), becoming a significant bottleneck in distributed computing system

APA, Harvard, Vancouver, ISO, and other styles

23

Weissman, Jon B., Andrew S. Grimshaw, and R. D. Ferraro. "Parallel Object-Oriented Computation Applied to a Finite Element Problem." Scientific Programming 2, no. 4 (1993): 133–44. http://dx.doi.org/10.1155/1993/859092.

Full text

Abstract:

The conventional wisdom in the scientific computing community is that the best way to solve large-scale numerically intensive scientific problems on today's parallel MIMD computers is to use Fortran or C programmed in a data-parallel style using low-level message-passing primitives. This approach inevitably leads to nonportable codes and extensive development time, and restricts parallel programming to the domain of the expert programmer. We believe that these problems are not inherent to parallel computing but are the result of the programming tools used. We will show that comparable performa

APA, Harvard, Vancouver, ISO, and other styles

24

Woolsey, Nicholas, Rong-Rong Chen, and Mingyue Ji. "Coded Elastic Computing on Machines With Heterogeneous Storage and Computation Speed." IEEE Transactions on Communications 69, no. 5 (2021): 2894–908. http://dx.doi.org/10.1109/tcomm.2021.3056089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Aliasgari, Malihe, Jorg Kliewer, and Osvaldo Simeone. "Coded Computation Against Processing Delays for Virtualized Cloud-Based Channel Decoding." IEEE Transactions on Communications 67, no. 1 (2019): 28–38. http://dx.doi.org/10.1109/tcomm.2018.2869791.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Zhang, Shu Zhen, and Hai Long Song. "A Secret Sharing Algorithm Based on Regenerating Codes." Applied Mechanics and Materials 397-400 (September 2013): 2031–36. http://dx.doi.org/10.4028/www.scientific.net/amm.397-400.2031.

Full text

Abstract:

As a kind of special MDS erasure coding, regenerating codes are firstly used to solve the fault-tolerant problem in distributed storage systems. This paper constructs a new kind of secret sharing algorithm based on regenerating codes. The main process is that the original secret data is firstly stripped and coded with MDS erasure coding algorithm, then the vector components are periodically distributed to secret sharers in a certain order. The secret data can be rebuilt by decoding algorithm of regenerating codes if there are enough shares of the secret. Theoretical analysis shows that the alg

APA, Harvard, Vancouver, ISO, and other styles

27

Cimino, J. J., and X. Jing. "A Complementary Graphical Method for Reducing and Analyzing Large Data Sets." Methods of Information in Medicine 53, no. 03 (2014): 173–85. http://dx.doi.org/10.3414/me13-01-0075.

Full text

Abstract:

SummaryObjectives: Graphical displays can make data more understandable; however, large graphs can challenge human comprehension. We have previously described a filtering method to provide high-level summary views of large data sets. In this paper we demonstrate our method for setting and selecting thresholds to limit graph size while retaining important information by applying it to large single and paired data sets, taken from patient and bibliographic databases.Methods: Four case studies are used to illustrate our method. The data are either patient discharge diagnoses (coded using the Inte

APA, Harvard, Vancouver, ISO, and other styles

28

Solano Donado, Fernando. "On the Optimal Calculation of the Rice Coding Parameter." Algorithms 13, no. 8 (2020): 181. http://dx.doi.org/10.3390/a13080181.

Full text

Abstract:

In this article, we design and evaluate several algorithms for the computation of the optimal Rice coding parameter. We conjecture that the optimal Rice coding parameter can be bounded and verify this conjecture through numerical experiments using real data. We also describe algorithms that partition the input sequence of data into sub-sequences, such that if each sub-sequence is coded with a different Rice parameter, the overall code length is minimised. An algorithm for finding the optimal partitioning solution for Rice codes is proposed, as well as fast heuristics, based on the understandin

APA, Harvard, Vancouver, ISO, and other styles

29

Kang, Xuejiao, David F. Gleich, Ahmed Sameh, and Ananth Grama. "Adaptive Erasure Coded Fault Tolerant Linear System Solver." ACM Transactions on Parallel Computing 8, no. 4 (2021): 1–19. http://dx.doi.org/10.1145/3490557.

Full text

Abstract:

As parallel and distributed systems scale, fault tolerance is an increasingly important problem—particularly on systems with limited I/O capacity and bandwidth. Erasure coded computations address this problem by augmenting a given problem instance with redundant data and then solving the augmented problem in a fault oblivious manner in a faulty parallel environment. In the event of faults, a computationally inexpensive procedure is used to compute the true solution from a potentially fault-prone solution. These techniques are significantly more efficient than conventional solutions to the faul

APA, Harvard, Vancouver, ISO, and other styles

30

Vierinen, J., J. L. Chau, N. Pfeffer, M. Clahsen, and G. Stober. "Coded continuous wave meteor radar." Atmospheric Measurement Techniques Discussions 8, no. 7 (2015): 7879–907. http://dx.doi.org/10.5194/amtd-8-7879-2015.

Full text

Abstract:

Abstract. The concept of coded continuous wave meteor radar is introduced. The radar uses a continuously transmitted pseudo-random waveform, which has several advantages: coding avoids range aliased echoes, which are often seen with commonly used pulsed specular meteor radars (SMRs); continuous transmissions maximize pulse compression gain, allowing operation with significantly lower peak transmit power; the temporal resolution can be changed after performing a measurement, as it does not depend on pulse spacing; and the low signal to noise ratio allows multiple geographically separated transm

APA, Harvard, Vancouver, ISO, and other styles

31

Xu, Fan, Shuo Shao, and Meixia Tao. "New Results on the Computation-Communication Tradeoff for Heterogeneous Coded Distributed Computing." IEEE Transactions on Communications 69, no. 4 (2021): 2254–70. http://dx.doi.org/10.1109/tcomm.2021.3049821.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Huang, Ping, Yue Heng Li, and Mei Yan Ju. "Efficient LLR Optimization Based on GMI for LDPC Coded BICM Systems." Applied Mechanics and Materials 519-520 (February 2014): 1016–20. http://dx.doi.org/10.4028/www.scientific.net/amm.519-520.1016.

Full text

Abstract:

In this paper, A new on-line LLR optimization method based on the generalized mutual information (GMI) maximization is proposed for LDPC coded BICM systems. As the BP decoder is sensitive to imperfect soft demodulator output information, it is necessary to correct the LLRs to provide the reliable information for BP decoder. The proposed method searched the scalar factors to maximize the GMI for each bit channel, and applied them to the demodulator output LLRs. Different from the previous reference, the proposed found the factors by on-line computation with minor complexity. This characteristic

APA, Harvard, Vancouver, ISO, and other styles

33

Makhalemele, C. R., L. Rundora, and S. O. Adesanya. "Convective Flow of Hydromagnetic Couple Stress Fluid with Varying Heating through Vertical Channel." International Journal of Applied Mechanics and Engineering 26, no. 2 (2021): 107–27. http://dx.doi.org/10.2478/ijame-2021-0022.

Full text

Abstract:

Abstract This article addresses the impact of magnetic field induction on the buoyancy-induced oscillatory flow of couple stress fluid with varying heating. Modelled equations for the incompressible fluid are coupled and nonlinear due to the inclusion of viscous heating and thermal effect on the fluid density. Approximate solutions are constructed and coded on a symbolic package to ease the computational complexity. Graphical representations of the symbolic solutions are presented with detailed explanations. Results of the present computation show that the effect of induced magnetic field on t

APA, Harvard, Vancouver, ISO, and other styles

34

Li, Ying, Yan Pu Yang, Deng Kai Chen, and Sui Huai Yu. "Form Innovation Method Based on Genetic Algorithm and Product Semantics." Applied Mechanics and Materials 422 (September 2013): 336–42. http://dx.doi.org/10.4028/www.scientific.net/amm.422.336.

Full text

Abstract:

From the perspective of combination principles, product form is divided into several modules for extracting profile curves; applying Genetic Algorithm (GA), product form chromosomes are coded in tree structure, through crossover and mutation operators to generate new programs; the method of product semantics is introduced into the process of evolutionary computation to enhance the interactivity of evolutionary computation by fuzzification, in which designer can decide the orientation from the selected products and guarantee the results can reflect the designer's innovative ideas. With Visual B

APA, Harvard, Vancouver, ISO, and other styles

35

WANG, KAIER, and MEIYING YE. "PARAMETER ESTIMATION OF SCHOTTKY-BARRIER DIODE MODEL BY PARTICLE SWARM OPTIMIZATION." International Journal of Modern Physics C 20, no. 05 (2009): 687–99. http://dx.doi.org/10.1142/s0129183109013911.

Full text

Abstract:

This paper presents particle swarm optimization (PSO) method to solve the parameter estimation problem of the Schottky-barrier diode model. Based on the synthetic and experimental data, we have demonstrated that the proposed method has high parameter estimation accuracy. Besides, the initial guesses for the model parameter values are not required in the PSO method. Also, the performance of the PSO method is compared with that of the genetic algorithm (GA) method. The results indicate that the PSO method outperforms the binary-coded and real-coded GA methods in terms of estimation accuracy and

APA, Harvard, Vancouver, ISO, and other styles

36

Vierinen, Juha, Jorge L. Chau, Nico Pfeffer, Matthias Clahsen, and Gunter Stober. "Coded continuous wave meteor radar." Atmospheric Measurement Techniques 9, no. 2 (2016): 829–39. http://dx.doi.org/10.5194/amt-9-829-2016.

Full text

Abstract:

Abstract. The concept of a coded continuous wave specular meteor radar (SMR) is described. The radar uses a continuously transmitted pseudorandom phase-modulated waveform, which has several advantages compared to conventional pulsed SMRs. The coding avoids range and Doppler aliasing, which are in some cases problematic with pulsed radars. Continuous transmissions maximize pulse compression gain, allowing operation at lower peak power than a pulsed system. With continuous coding, the temporal and spectral resolution are not dependent on the transmit waveform and they can be fairly flexibly chan

APA, Harvard, Vancouver, ISO, and other styles

37

Guigon, Emmanuel. "Computing with Populations of Monotonically Tuned Neurons." Neural Computation 15, no. 9 (2003): 2115–27. http://dx.doi.org/10.1162/089976603322297313.

Full text

Abstract:

The parametric variation in neuronal discharge according to the values of sensory or motor variables strongly influences the collective behavior of neuronal populations. A multitude of studies on the populations of broadly tuned neurons (e.g., cosine tuning) have led to such well-known computational principles as population coding, noise suppression, and line attractors. Much less is known about the properties of populations of monotonically tuned neurons. In this letter, we show that there exists an efficient weakly biased linear estimator for monotonic populations and that neural processing

APA, Harvard, Vancouver, ISO, and other styles

38

Wang, Lin, Zhongqiang Luo, and Li Gao. "Stochastic Computing Architectures: Modeling, Optimization, and Applications." Symmetry 16, no. 12 (2024): 1701. https://doi.org/10.3390/sym16121701.

Full text

Abstract:

With the rapid development of artificial intelligence (AI), the design and implementation of very large-scale integrated circuits (VLSI) based on traditional binary computation are facing challenges of high complexity, computational power, and high power consumption. The development of Moore’s law has reached the limit of physical technology, and there is an urgent need to explore new computing architectures to make up for the shortcomings of traditional binary computing. To address the existing problems, Stochastic Computing (SC) is an unconventional stochastic sequence that converts binary n

APA, Harvard, Vancouver, ISO, and other styles

39

Jhan, J. P., J. Y. Rau, and C. M. Chou. "4D ANIMATION RECONSTRUCTION FROM MULTI-CAMERA COORDINATES TRANSFORMATION." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B5 (June 16, 2016): 841–47. http://dx.doi.org/10.5194/isprs-archives-xli-b5-841-2016.

Full text

Abstract:

Reservoir dredging issues are important to extend the life of reservoir. The most effective and cost reduction way is to construct a tunnel to desilt the bottom sediment. Conventional technique is to construct a cofferdam to separate the water, construct the intake of tunnel inside and remove the cofferdam afterwards. In Taiwan, the ZengWen reservoir dredging project will install an Elephant-trunk Steel Pipe (ETSP) in the water to connect the desilting tunnel without building the cofferdam. Since the installation is critical to the whole project, a 1:20 model was built to simulate the installa

APA, Harvard, Vancouver, ISO, and other styles

40

Jhan, J. P., J. Y. Rau, and C. M. Chou. "4D ANIMATION RECONSTRUCTION FROM MULTI-CAMERA COORDINATES TRANSFORMATION." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B5 (June 16, 2016): 841–47. http://dx.doi.org/10.5194/isprsarchives-xli-b5-841-2016.

Full text

Abstract:

Reservoir dredging issues are important to extend the life of reservoir. The most effective and cost reduction way is to construct a tunnel to desilt the bottom sediment. Conventional technique is to construct a cofferdam to separate the water, construct the intake of tunnel inside and remove the cofferdam afterwards. In Taiwan, the ZengWen reservoir dredging project will install an Elephant-trunk Steel Pipe (ETSP) in the water to connect the desilting tunnel without building the cofferdam. Since the installation is critical to the whole project, a 1:20 model was built to simulate the installa

APA, Harvard, Vancouver, ISO, and other styles

41

Bidabad, Bijan. "New Algorithms for L1 Norm Regression." Bangladesh Journal of Multidisciplinary Scientific Research 1, no. 1 (2019): 1–18. http://dx.doi.org/10.46281/bjmsr.v1i1.311.

Full text

Abstract:

In this paper, we propose four algorithms for L1 norm computation of regression parameters, where two of them are more efficient for simple and multiple regression models. However, we start with restricted simple linear regression and corresponding derivation and computation of the weighted median problem. In this respect, a computing function is coded. With discussion on the m parameters model, we continue to expand the algorithm to include unrestricted simple linear regression, and two crude and efficient algorithms are proposed. The procedures are then generalized to the m parameters model

APA, Harvard, Vancouver, ISO, and other styles

42

Valencia, Camilo, Juan Gomez, and Nicolás Guarín-Zapata. "A General-Purpose Element-Based Approach to Compute Dispersion Relations in Periodic Materials with Existing Finite Element Codes." Journal of Theoretical and Computational Acoustics 28, no. 01 (2019): 1950005. http://dx.doi.org/10.1142/s2591728519500051.

Full text

Abstract:

The numerical determination of dispersion relations in periodic materials via the finite element method is a difficult task in most standard codes. Here, we propose a novel technique which allows the computation of these band structures from local elemental subroutines in contrast with existing methods which impose Bloch boundary conditions on the global arrays. The proposed local approach is thus readily applicable to several physical contexts and space dimensionalities. Here we present the details of this element-based algorithm and provide verification results for three different kinematic

APA, Harvard, Vancouver, ISO, and other styles

43

Guo, Xiaojin, Liying Sang, and Huanlin Liu. "Minimization Number of Network-Coded Links Based on Improved Adaptive Genetic Algorithm for Multi-source Optical Networks." Journal of Optical Communications 40, no. 3 (2019): 205–12. http://dx.doi.org/10.1515/joc-2017-0030.

Full text

Abstract:

Abstract With the rapid development of multi-source optical multicast application, the wavelength division multiplexing (WDM) with limited number of wavelength channels is facing with the new challenge of bandwidth shortage. Optical multicast adopting network coding can improve the bandwidth utilization, but optical network coding needs to increase optical storage and computation overhead in WDM optical network. For reducing the number of optical network-coded links, an improved adaptive genetic algorithm (IAGA) is proposed to minimize the number of network-coded links for multicast. By design

APA, Harvard, Vancouver, ISO, and other styles

44

Caballero-Morales, Santiago-Omar. "Development of a coded suite of models to explore relevant problems in logistics." PeerJ Computer Science 6 (November 30, 2020): e329. http://dx.doi.org/10.7717/peerj-cs.329.

Full text

Abstract:

Logistics is the aspect of the supply chain which is responsible of the efficient flow and delivery of goods or services from suppliers to customers. Because a logistic system involves specialized operations such as inventory control, facility location and distribution planning, the logistic professional requires mathematical, technological and managerial skills and tools to design, adapt and improve these operations. The main research is focused on modeling and solving logistic problems through specialized tools such as integer programing and meta-heuristics methods. In practice, the use of t

APA, Harvard, Vancouver, ISO, and other styles

45

Conde‐Canencia, L., and E. Boutillon. "Application of bubble‐check algorithm to non‐binary LLR computation in QAM coded schemes." Electronics Letters 50, no. 25 (2014): 1937–38. http://dx.doi.org/10.1049/el.2014.2652.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Phadke, A. R., M. Fozdar, K. R. Niazi, N. Mithulananthan, and R. C. Bansal. "New technique for computation of closest Hopf bifurcation point using real-coded genetic algorithm." IET Generation, Transmission & Distribution 5, no. 1 (2011): 11. http://dx.doi.org/10.1049/iet-gtd.2009.0668.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Shilpa, V., and V. Shetty Suma. "Design of Systolic Architecture Using Evolutionary Computation." International Journal of Trend in Scientific Research and Development 2, no. 4 (2018): 2815–20. https://doi.org/10.31142/ijtsrd15776.

Full text

Abstract:

This work presents a new concept for finding the optimal values for the entire three fundamental design vectors namely scheduling, projection and processor so that not only architecture design could be feasible along with that maximum hardware utilizing efficiency could be achieved. This Approach also having the focus to minimize the total delay involved with systolic architecture design. Evolutionary programming has applied to find the optimal solution. Presented work and result will provide facility to designer without any involvement to find out best suited architecture for a particular app

APA, Harvard, Vancouver, ISO, and other styles

48

Sakthivel, R., Ch Vijayalakshmi, M. Vanitha, et al. "Hardware optimization for effective switching power reduction during data compression in GOLOMB rice coding." PLOS ONE 19, no. 9 (2024): e0308796. http://dx.doi.org/10.1371/journal.pone.0308796.

Full text

Abstract:

Loss-less data compression becomes the need of the hour for effective data compression and computation in VLSI test vector generation and testing in addition to hardware AI/ML computations. Golomb code is one of the effective technique for lossless data compression and it becomes valid only when the divisor can be expressed as power of two. This work aims to increase compression ratio by further encoding the unary part of the Golomb Rice (GR) code so as to decrease the amount of bits used, it mainly focuses on optimizing the hardware for encoding side. The algorithm was developed and coded in

APA, Harvard, Vancouver, ISO, and other styles

49

Naeem, Saad, Noreen Jamil, Habib Ullah Khan, and Shah Nazir. "Complexity of Deep Convolutional Neural Networks in Mobile Computing." Complexity 2020 (September 17, 2020): 1–8. http://dx.doi.org/10.1155/2020/3853780.

Full text

Abstract:

Neural networks employ massive interconnection of simple computing units called neurons to compute the problems that are highly nonlinear and could not be hard coded into a program. These neural networks are computation-intensive, and training them requires a lot of training data. Each training example requires heavy computations. We look at different ways in which we can reduce the heavy computation requirement and possibly make them work on mobile devices. In this paper, we survey various techniques that can be matched and combined in order to improve the training time of neural networks. Ad

APA, Harvard, Vancouver, ISO, and other styles

50

Dai, Mingjun, Xiong Lai, Yanli Tong, and Bingchun Li. "Newton-like Polynomial-Coded Distributed Computing for Numerical Stability." Symmetry 15, no. 7 (2023): 1372. http://dx.doi.org/10.3390/sym15071372.

Full text

Abstract:

For coded distributed computing (CDC), polynomial code is one prevalent encoding method for CDC (called Poly-CDC). It suffers from poor numerical stability due to the Vandermonde matrix serving as the coefficient matrix which needs to be inverted, and whose condition number increases exponentially with the size of the matrix or equivalently with the number of parallel worker nodes. To improve the numerical stability, especially for large networks, we propose a Newton-like polynomial code (NLPC)-based CDC (NLPC-CDC), with a design dedicated for both matrix–vector and matrix–matrix multiplicatio

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!