Journal articles: 'Coded Computation'

1

Kim, Minchul, and Jungwoo Lee. "Private Secure Coded Computation." IEEE Communications Letters 23, no. 11 (November 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 (May 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 (May 2021): 2821–46. http://dx.doi.org/10.1109/tit.2021.3064827.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ozfatura, Emre, Sennur Ulukus, and Deniz Gündüz. "Straggler-Aware Distributed Learning: Communication–Computation Latency Trade-Off." Entropy 22, no. 5 (May 13, 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-utilization due to discarding partial computations carried out by stragglers. To overcome these drawbacks, we consider multi-message communication (MMC) by allowing multiple computations to be conveyed from each worker per iteration, and propose novel straggler avoidance techniques for both coded computation and coded communication with MMC. We analyze how the proposed designs can be employed efficiently to seek a balance between the computation and communication latency. Furthermore, we identify the advantages and disadvantages of these designs in different settings through extensive simulations, both model-based and real implementation on Amazon EC2 servers, and demonstrate that proposed schemes with MMC can help improve upon existing straggler avoidance schemes.

APA, Harvard, Vancouver, ISO, and other styles

7

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 (March 2022): 847–61. http://dx.doi.org/10.1109/jsac.2022.3142362.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

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 (November 20, 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 computing model. Our recent works included using CIELAB-coded colors on printed-paper to compute Boolean conjunctions (AND operations). In this study, we performed Boolean operations based on CIELAB-coded colors by placing color-printed films over aluminum-coated reflectors with and/or without color. The results of the operations were gathered by testing the color codes printed on the films for negation or highlighting. This type of CIELAB-based color computing has a wide range of potential applications, such as a method for security or access control to secured systems. Such applications could match paired color keys on which the arrays of color codes could be printed and optically computed.

APA, Harvard, Vancouver, ISO, and other styles

10

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 (April 2021): 2379–98. http://dx.doi.org/10.1109/tit.2021.3050853.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

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

13

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 (September 2017): 384–97. http://dx.doi.org/10.1109/tci.2016.2593662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Choi, Sang Won. "Index Coded Automatic Repeat Request (ARQ)." Entropy 22, no. 8 (August 7, 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 that two contradictory performance metrics such as transmission efficiency and transmit (receive) cache memory size for index coding (decoding) can be enhanced with a reasonable trade-off. Specifically, the transmission efficiency of the proposed scheme is proved to be asymptotically optimal, and memory overhead is shown to be asymptotically close to the conventional ARQ scheme. Numerical results also validate the proposed scheme in the sense of memory overhead and transmission efficiency in comparison with the conventional ARQ scheme and the optimal scheme using random linear network coding.

APA, Harvard, Vancouver, ISO, and other styles

15

Pearce, Christopher, Adam McLeod, Jon Patrick, Jason Ferrigi, Michael Michael Bainbridge, Natalie Rinehart, and Anna Fragkoudi. "Coding and classifying GP data: the POLAR project." BMJ Health & Care Informatics 26, no. 1 (November 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, followed by a manual process to correct codes and subsequent natural language processing re-computation. These steps were repeated for four iterations until 95% of the records were coded. The coded data were then aggregated into classes considered to be useful for population health analytics.ResultsCoding the data effectively covered 95% of the corpus. Problems with the use of SNOMED CT-AU were identified and protocols for creating consistent coding were created. These protocols can be used to guide further development of SNOMED CT-AU (SCT). The coded values will be immensely useful for the development of population health analytics for Australia, and the lessons learnt applicable elsewhere.

APA, Harvard, Vancouver, ISO, and other styles

16

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Fiorini, Rodolfo A. "Towards Advanced Quantum Cognitive Computation." International Journal of Software Science and Computational Intelligence 9, no. 1 (January 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 cognitive systems. This paper is a relevant contribution towards an effective and convenient “Science 2.0” universal computational framework to achieve deeper cognitive intelligence at your fingertips and beyond.

APA, Harvard, Vancouver, ISO, and other styles

18

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 performance can be achieved with little effort if better tools that present higher level abstractions are used. The vehicle for our demonstration is a 2D electromagnetic finite element scattering code we have implemented in Mentat, an object-oriented parallel processing system. We briefly describe the application. Mentat, the implementation, and present performance results for both a Mentat and a hand-coded parallel Fortran version.

APA, Harvard, Vancouver, ISO, and other styles

19

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 (May 2021): 2894–908. http://dx.doi.org/10.1109/tcomm.2021.3056089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

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 (January 2019): 28–38. http://dx.doi.org/10.1109/tcomm.2018.2869791.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

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 algorithm is a safe threshold scheme. Because the operations are mainly linear on small finite field and its computation cost is low, so it is easy to realize.

APA, Harvard, Vancouver, ISO, and other styles

22

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 International Classification of Diseases, Clinical Modifications [ICD9-CM]) or Medline citations (coded using the Medical Subject Headings [MeSH]). We use combinations of different thresholds to obtain filtered graphs for detailed analysis. The thresholds setting and selection, such as thresholds for node counts, class counts, ratio values, p values (for diff data sets), and percentiles of selected class count thresholds, are demonstrated with details in case studies. The main steps include: data preparation, data manipulation, computation, and threshold selection and visualization. We also describe the data models for different types of thresholds and the considerations for thresholds selection.Results: The filtered graphs are 1%-3% of the size of the original graphs. For our case studies, the graphs provide 1) the most heavily used ICD9-CM codes, 2) the codes with most patients in a research hospital in 2011, 3) a profile of publications on “heavily represented topics” in MEDLINE in 2011, and 4) validated knowledge about adverse effects of the medication of rosiglitazone and new interesting areas in the ICD9-CM hierarchy associated with patients taking the medication of pioglitazone.Conclusions: Our filtering method reduces large graphs to a manageable size by re -moving relatively unimportant nodes. The graphical method provides summary views based on computation of usage frequency and semantic context of hierarchical ter -minology. The method is applicable to large data sets (such as a hundred thousand records or more) and can be used to generate new hypotheses from data sets coded with hierarchical terminologies.

APA, Harvard, Vancouver, ISO, and other styles

23

Solano Donado, Fernando. "On the Optimal Calculation of the Rice Coding Parameter." Algorithms 13, no. 8 (July 27, 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 understanding of the problem trade-offs.

APA, Harvard, Vancouver, ISO, and other styles

24

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 (December 31, 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 fault tolerance problem. In this article, we show how we can minimize, to optimality, the overhead associated with our problem augmentation techniques for linear system solvers. Specifically, we present a technique that adaptively augments the problem only when faults are detected. At any point in execution, we only solve a system whose size is identical to the original input system. This has several advantages in terms of maintaining the size and conditioning of the system, as well as in only adding the minimal amount of computation needed to tolerate observed faults. We present, in detail, the augmentation process, the parallel formulation, and evaluation of performance of our technique. Specifically, we show that the proposed adaptive fault tolerance mechanism has minimal overhead in terms of FLOP counts with respect to the original solver executing in a non-faulty environment, has good convergence properties, and yields excellent parallel performance. We also demonstrate that our approach significantly outperforms an optimized application-level checkpointing scheme that only checkpoints needed data structures.

APA, Harvard, Vancouver, ISO, and other styles

25

Vierinen, J., J. L. Chau, N. Pfeffer, M. Clahsen, and G. Stober. "Coded continuous wave meteor radar." Atmospheric Measurement Techniques Discussions 8, no. 7 (July 30, 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 transmitters to be used in the same frequency band without significantly interfering with each other. The latter allows the same receiver antennas to be used to receive multiple transmitters. The principles of the signal processing are discussed, in addition to discussion of several practical ways to increase computation speed, and how to optimally detect meteor echoes. Measurements from a campaign performed with a coded continuous wave SMR are shown and compared with two standard pulsed SMR measurements. The type of meteor radar described in this paper would be suited for use in a large scale multi-static network of meteor radar transmitters and receivers. This would, for example, provide higher spatio-temporal resolution for mesospheric wind field measurements.

APA, Harvard, Vancouver, ISO, and other styles

26

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 (April 2021): 2254–70. http://dx.doi.org/10.1109/tcomm.2021.3049821.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

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 makes it is more effective in the real systems where the channel changes rapidly. Numerical and simulation results verify that the proposed method achieves noticeable performance improvement for MIMO-BICM systems with LDPC codes.

APA, Harvard, Vancouver, ISO, and other styles

28

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 (June 1, 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 the oscillatory flow and heat transfer is significant and cannot be neglected.

APA, Harvard, Vancouver, ISO, and other styles

29

Vierinen, Juha, Jorge L. Chau, Nico Pfeffer, Matthias Clahsen, and Gunter Stober. "Coded continuous wave meteor radar." Atmospheric Measurement Techniques 9, no. 2 (March 3, 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 changed after performing a measurement. The low signal-to-noise ratio before pulse compression, combined with independent pseudorandom transmit waveforms, allows multiple geographically separated transmitters to be used in the same frequency band simultaneously without significantly interfering with each other. Because the same frequency band can be used by multiple transmitters, the same interferometric receiver antennas can be used to receive multiple transmitters at the same time. The principles of the signal processing are discussed, in addition to discussion of several practical ways to increase computation speed, and how to optimally detect meteor echoes. Measurements from a campaign performed with a coded continuous wave SMR are shown and compared with two standard pulsed SMR measurements. The type of meteor radar described in this paper would be suited for use in a large-scale multi-static network of meteor radar transmitters and receivers. Such a system would be useful for increasing the number of meteor detections to obtain improved meteor radar data products.

APA, Harvard, Vancouver, ISO, and other styles

30

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 (May 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 computation efficiency.

APA, Harvard, Vancouver, ISO, and other styles

31

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 Basic and Rhinoceros platform a product form innovative design system is developed.

APA, Harvard, Vancouver, ISO, and other styles

32

Guigon, Emmanuel. "Computing with Populations of Monotonically Tuned Neurons." Neural Computation 15, no. 9 (September 1, 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 based on linear collective computation and least-square error learning in populations of intensity-coded neurons has specific generalization capacities.

APA, Harvard, Vancouver, ISO, and other styles

33

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 installation steps in a towing tank, i.e. launching, dragging, water injection, and sinking. To increase the construction safety, photogrammetry technic is adopted to record images during the simulation, compute its transformation parameters for dynamic analysis and reconstruct the 4D animations. In this study, several Australis© coded targets are fixed on the surface of ETSP for auto-recognition and measurement. The cameras orientations are computed by space resection where the 3D coordinates of coded targets are measured. Two approaches for motion parameters computation are proposed, i.e. performing 3D conformal transformation from the coordinates of cameras and relative orientation computation by the orientation of single camera. Experimental results show the 3D conformal transformation can achieve sub-mm simulation results, and relative orientation computation shows the flexibility for dynamic motion analysis which is easier and more efficiency.

APA, Harvard, Vancouver, ISO, and other styles

34

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 installation steps in a towing tank, i.e. launching, dragging, water injection, and sinking. To increase the construction safety, photogrammetry technic is adopted to record images during the simulation, compute its transformation parameters for dynamic analysis and reconstruct the 4D animations. In this study, several Australis© coded targets are fixed on the surface of ETSP for auto-recognition and measurement. The cameras orientations are computed by space resection where the 3D coordinates of coded targets are measured. Two approaches for motion parameters computation are proposed, i.e. performing 3D conformal transformation from the coordinates of cameras and relative orientation computation by the orientation of single camera. Experimental results show the 3D conformal transformation can achieve sub-mm simulation results, and relative orientation computation shows the flexibility for dynamic motion analysis which is easier and more efficiency.

APA, Harvard, Vancouver, ISO, and other styles

35

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 (December 2014): 1937–38. http://dx.doi.org/10.1049/el.2014.2652.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

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

37

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 (August 1, 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 assumptions applied to phononic crystals in a classical and a micropolar elastic medium. The paper also includes in the form of supplementary material, a fully-coded user subroutine and a test-problem to be used in a commercial finite element code.

APA, Harvard, Vancouver, ISO, and other styles

38

Bidabad, Bijan. "New Algorithms for L1 Norm Regression." Bangladesh Journal of Multidisciplinary Scientific Research 1, no. 1 (June 12, 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 by presenting two new algorithms, where the algorithm 4 is selected as more efficient. Various properties of these algorithms are discussed.

APA, Harvard, Vancouver, ISO, and other styles

39

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 these tools for large and complex problems requires mathematical and computational proficiency. In this context, the present work contributes with a coded suite of models to explore relevant problems by the logistic professional, undergraduate/postgraduate student and/or academic researcher. The functions of the coded suite address the following: (1) generation of test instances for routing and facility location problems with real geographical coordinates; (2) computation of Euclidean, Manhattan and geographical arc length distance metrics for routing and facility location problems; (3) simulation of non-deterministic inventory control models; (4) importing/exporting and plotting of input data and solutions for analysis and visualization by third-party platforms; and (5) designing of a nearest-neighbor meta-heuristic to provide very suitable solutions for large vehicle routing and facility location problems. This work is completed by a discussion of a case study which integrates the functions of the coded suite.

APA, Harvard, Vancouver, ISO, and other styles

40

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 (July 26, 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 designing the maximization difference crossover operation, IAGA can guarantee the diversity of population and avoid individuals from falling into a local optimal. By adaptively adjusting the crossover probability, IAGA makes the population diverse at the beginning stages and makes the excellent individuals remain in a stable condition. Compared with other algorithms, the simulation result shows that the proposed algorithm has fastest convergence speed, which means that it takes the shortest time to find the minimum numbers of coded link solutions.

APA, Harvard, Vancouver, ISO, and other styles

41

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. Additionally, we also review some extra recommendations to make the process work for mobile devices as well. We finally survey deep compression technique that tries to solve the problem by network pruning, quantization, and encoding the network weights. Deep compression reduces the time required for training the network by first pruning the irrelevant connections, i.e., the pruning stage, which is then followed by quantizing the network weights via choosing centroids for each layer. Finally, at the third stage, it employs Huffman encoding algorithm to deal with the storage issue of the remaining weights.

APA, Harvard, Vancouver, ISO, and other styles

42

Dai, Mingjun, Xiong Lai, Yanli Tong, and Bingchun Li. "Newton-like Polynomial-Coded Distributed Computing for Numerical Stability." Symmetry 15, no. 7 (July 6, 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 multiplications. The associated proof of the constructed code possesses a (n,k)-symmetrical combination property (CP), where symmetrical means the worker nodes have identical computation volume, CP means the k-symmetrical original computing tasks are encoded into n(n≥k)-symmetrically coded computing tasks, and the arbitrary k resulting from the n-coded computing tasks can recover the intended computing results. Extensive numerical studies verify the significant numerical stability improvement of our proposed NLPC-CDC over Poly-CDC.

APA, Harvard, Vancouver, ISO, and other styles

43

Thune, Neeta Nitin, and Sanjay Haridas. "Low Power Trellis Coded Modulation (TCM) Decoder by Using Modified Resource Sharing Method for IoT Enabler." International Journal of Electronics, Communications, and Measurement Engineering 11, no. 1 (January 1, 2022): 1–9. http://dx.doi.org/10.4018/ijecme.312260.

Full text

Abstract:

This paper proposes a new pre-computation approach based on the auxiliary trellis of the TCM decoder's ACSU (add compare select unit). The suggested method is based on pre-computation of path metrics and resource sharing of the ACSU unit. The Viterbi decoder itself is a power-consuming module of the communication system that comprises the TMU (transition metric unit) and ACSU (add compare select unit). By applying the suggested method, the authors would be able to achieve low dynamic power. The TCM decoder designed accordingly shows better SER/ BER results in comparison to the existing techniques. The 4D 8 PSK TCM encoder and decoder were implemented as per the design specifications given by consultative committee for space data system (CCSDS) for satellite applications. The simulations results are observed on 100 Mbps data for 8PSK modulation and the ¾ code rate of the TCM encoder. The results based on the new method show improved power-speed ratio with improved SER and BER.

APA, Harvard, Vancouver, ISO, and other styles

44

Haas, Timothy. "Developing political-ecological theory: The need for many-task computing." PLOS ONE 15, no. 11 (November 24, 2020): e0226861. http://dx.doi.org/10.1371/journal.pone.0226861.

Full text

Abstract:

Models of political-ecological systems can inform policies for managing ecosystems that contain endangered species. To increase the credibility of these models, massive computation is needed to statistically estimate the model’s parameters, compute confidence intervals for these parameters, determine the model’s prediction error rate, and assess its sensitivity to parameter misspecification. To meet this statistical and computational challenge, this article delivers statistical algorithms and a method for constructing ecosystem management plans that are coded as distributed computing applications. These applications can run on cluster computers, the cloud, or a collection of in-house workstations. This downloadable code is used to address the challenge of conserving the East African cheetah (Acinonyx jubatus). This demonstration means that the new standard of credibility that any political-ecological model needs to meet is the one given herein.

APA, Harvard, Vancouver, ISO, and other styles

45

Krishna, Merugumalli Rama, K. Sri Lakshmi, S. Lalitha, and C. Amulya. "Low Latency and Efficient LUT Based Multiplier for DSP Applications." International Journal of Advance Research and Innovation 8, no. 2 (2020): 91–96. http://dx.doi.org/10.51976/ijari.822016.

Full text

Abstract:

In digital signal processing memory based computation plays a vital role for DSP applications, which has multiplication with a fixed set of coefficient. LUT optimization for memory based multiplication can be done with these three computational techniques like Anti symmetry product coding (APC) and Odd multiple storage (OMS), combined APC-OMS. OMS technique with the modified APC-OMS based LUT multiplier can be discussed in terms of area and delay. These techniques are coded in VHDL language and synthesized in Xilinx ISE design suite 14.7. Thus, this proposes the APC-OMS based LUT multiplier can optimize the LUT size and consumes less area and obtains high speed when compared to other techniques. The proposed LUT based multiplier requires less significant area and less multiplication time than the canonical-signed-digit based multiplier.

APA, Harvard, Vancouver, ISO, and other styles

46

Nishisaka, Kazuki, and Hitoshi Iima. "A Real-coded Genetic Algorithm Searching for a Superior Solution Efficiently in Short Computation Time." IEEJ Transactions on Electronics, Information and Systems 140, no. 7 (July 1, 2020): 820–25. http://dx.doi.org/10.1541/ieejeiss.140.820.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Kawano, Tomonori. "Primitive Optical Computing Model with Films: Boolean Conjunction of the Square Matrix-Arrayed Color Codes." Journal of Advanced Computational Intelligence and Intelligent Informatics 17, no. 6 (November 20, 2013): 791–98. http://dx.doi.org/10.20965/jaciii.2013.p0791.

Full text

Abstract:

Color is one of the most useful and attractive characteristics of light applicable to optical science and the related industries. In recent decades, a number of studies focusing on the use of light as a key component of computation have attracted considerable attention from researchers and engineers because these studies are potentially applicable to signal processing through optical interconnections between electronic devices. Such studies include the optical parallel logic gates proposed by a Japanese research group, allowing spontaneous and parallel computing with spatial coding using lights, simply by overlaying a pair of shadowgram images. For computational handling of the colors visible to human eyes,Commission Internationale de l’Eclairgehas defined CIE 1976 color space (CIELAB). The author has been engaged in the development of CIELAB-based printable and computable color codes possibly used for novel optical logic gate system as one of natural computing approaches. In the present study, by employing the pairs of CIELAB-coded-printed transparent films overlaid, a Boolean operation for the crossing (conjugation) of 2-by-2 color matrices based on the scanning of CIELAB values was demonstrated. This approach is still primitive but might be a significant step for manifesting the array-based processing of colors representing print-preserved and digitalized information.

APA, Harvard, Vancouver, ISO, and other styles

48

Blikstein, Paulo. "Analyzing Engineering Design through the Lens of Computation." Journal of Learning Analytics 1, no. 2 (August 7, 2014): 151–86. http://dx.doi.org/10.18608/jla.2014.12.8.

Full text

Abstract:

Learning analytics and educational data mining are introducing a number of new techniques and frameworks for studying learning. The scalability and complexity of these novel techniques has afforded new ways for enacting education research and has helped scholars gain new insights into human cognition and learning. Nonetheless, there remain some domains for which pure computational analysis is currently infeasible. One such area, which is particularly important today, is open-ended, hands-on, engineering design tasks. These open-ended tasks are becoming increasingly prevalent in both K–12 and post-secondary learning institutions, as educators are adopting this approach in order to teach students real-world science and engineering skills (e.g., the “Maker Movement”). This paper highlights findings from a combined human–computer analysis of students as they complete a short engineering design task. The study uncovers novel insights and serves to advance the field’s understanding of engineering design patterns. More specifically, this paper uses machine learning on hand-coded video data to identify general patterns in engineering design and develop a fine-grained representation of how experience relates to engineering practices. Finally, the paper concludes with ideas on how the specific findings from this study can be used to improve engineering education and the nascent field of “making” and digital fabrication in education. We also discuss how human–computer collaborative analyses can grow the learning analytics community and make learning analytics more central to education research.

APA, Harvard, Vancouver, ISO, and other styles

49

Gu, Mei Hua, N. M. Yu, and De Fa Wang. "An Adaptive Partitioned Algorithm Based on Mean Coding and Vector Quantization." Key Engineering Materials 439-440 (June 2010): 884–89. http://dx.doi.org/10.4028/www.scientific.net/kem.439-440.884.

Full text

Abstract:

A hybrid algorithm based on mean coding and vector quantization is presented in this paper. The smooth image block is coded with the mean coding algorithm, which can reduce the vector quantization (VQ) search computation and improve the compression ratio effectively, and this method is called the basic blended algorithm (BBA). On this base, an adaptive partitioned algorithm (APA) algorithm based on 16×16 pixels image block is proposed, the optional image block sizes are 16×8, 8×16, 8×8, 8×4, 4×8, 4×4 pixels, the image is coded adaptively at different levels. The size of mean coding is chosen adaptively according to the size of the smooth image block, the Not-smooth 4×4 pixels image block is coded by VQ. In addition, the improved APA (IAPA) is also given in this paper. Simulations show that the APA and IAPA proposed in this paper are proven to have great performance for different kinds of images, especially significant for those have large areas of static background and little details. Compared with BBA, the compression ratio of APA and IAPA can be improved by 416% and 512%, the PSNR of APA and IAPA is reduced only 2.4% and 3.6%, the complexity can be reduced significantly, which is of advantage to hardware implementation.

APA, Harvard, Vancouver, ISO, and other styles

50

Moradmand, K., and M. D. Goldfinger. "Computation of long-distance propagation of impulses elicited by Poisson-process stimulation." Journal of Neurophysiology 74, no. 6 (December 1, 1995): 2415–26. http://dx.doi.org/10.1152/jn.1995.74.6.2415.

Full text

Abstract:

1. The purpose of this work was to determine whether computed temporally coded axonal information generated by Poisson process stimulation were modified during long-distance propagation, as originally suggested by S. A. George. Propagated impulses were computed with the use of the Hodgkin-Huxley equations and cable theory to simulate excitation and current spread in 100-microns-diam unmyelinated axons, whose total length was 8.1 cm (25 lambda) or 101.4 cm (312.5 lambda). Differential equations were solved numerically, with the use of trapezoidal integration over small, constant electrotonic and temporal steps (0.125 lambda and 1.0 microsecond, respectively). 2. Using dual-pulse stimulation, we confirmed that for interstimulus intervals between 5 and 11 ms, the conduction velocity of the second of a short-interval pair of impulses was slower than that of the first impulse. Further, with sufficiently long propagation distance, the second impulse's conduction velocity increased steadily and eventually approached that of the first impulse. This effect caused a spatially varying interspike interval: as propagation proceeded, the interspike interval increased and eventually approached stabilization. 3. With Poisson stimulation, the peak amplitude of propagating action potentials varied with interspike interval durations between 5 and 11 ms. Such amplitude attenuation was caused by the incomplete relaxation of parameters n (macroscopic K-conductance activation) and h (macroscopic Na-conductance inactivation) during the interspike period. 4. The stochastic properties of the impulse train became less Poisson-like with propagation distance. In cases of propagation over 99.4 cm, the impulse trains developed marked periodicities in Interevent Interval Distribution and Expectation Density function because of the axially modulated transformation of interspike intervals. 5. Despite these changes in impulse train parameters, the arithmetic value of the mean interspike interval did not change as a function of propagation distance. This work showed that in theory, whereas the pattern of Poisson-like impulse codes was modified during long-distance propagation, their mean rate was conserved.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Coded Computation'

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