Academic literature on the topic 'Tiling (Mathematics) Data processing'

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 'Tiling (Mathematics) Data processing.'

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 "Tiling (Mathematics) Data processing"

1

Rodríguez, Gabriel, Louis-Noël Pouchet, and Juan Touriño. "Representing Integer Sequences Using Piecewise-Affine Loops." Mathematics 9, no. 19 (September 24, 2021): 2368. http://dx.doi.org/10.3390/math9192368.

Full text
Abstract:
A formal, high-level representation of programs is typically needed for static and dynamic analyses performed by compilers. However, the source code of target applications is not always available in an analyzable form, e.g., to protect intellectual property. To reason on such applications, it becomes necessary to build models from observations of its execution. This paper details an algebraic approach which, taking as input the trace of memory addresses accessed by a single memory reference, synthesizes an affine loop with a single perfectly nested reference that generates the original trace. This approach is extended to support the synthesis of unions of affine loops, useful for minimally modeling traces generated by automatic transformations of polyhedral programs, such as tiling. The resulting system is capable of processing hundreds of gigabytes of trace data in minutes, minimally reconstructing 100% of the static control parts in PolyBench/C applications and 99.99% in the Pluto-tiled versions of these benchmarks. As an application example of the trace modeling method, trace compression is explored. The affine representations built for the memory traces of PolyBench/C codes achieve compression factors of the order of 106 and 103 with respect to gzip for the original and tiled versions of the traces, respectively.
APA, Harvard, Vancouver, ISO, and other styles
2

Kempeneers, Pieter, Tomas Kliment, Luca Marletta, and Pierre Soille. "Parallel Processing Strategies for Geospatial Data in a Cloud Computing Infrastructure." Remote Sensing 14, no. 2 (January 15, 2022): 398. http://dx.doi.org/10.3390/rs14020398.

Full text
Abstract:
This paper is on the optimization of computing resources to process geospatial image data in a cloud computing infrastructure. Parallelization was tested by combining two different strategies: image tiling and multi-threading. The objective here was to get insight on the optimal use of available processing resources in order to minimize the processing time. Maximum speedup was obtained when combining tiling and multi-threading techniques. Both techniques are complementary, but a trade-off also exists. Speedup is improved with tiling, as parts of the image can run in parallel. But reading part of the image introduces an overhead and increases the relative part of the program that can only run in serial. This limits speedup that can be achieved via multi-threading. The optimal strategy of tiling and multi-threading that maximizes speedup depends on the scale of the application (global or local processing area), the implementation of the algorithm (processing libraries), and on the available computing resources (amount of memory and cores). A medium-sized virtual server that has been obtained from a cloud service provider has rather limited computing resources. Tiling will not only improve speedup but can be necessary to reduce the memory footprint. However, a tiling scheme with many small tiles increases overhead and can introduce extra latency due to queued tiles that are waiting to be processed. In a high-throughput computing cluster with hundreds of physical processing cores, more tiles can be processed in parallel, and the optimal strategy will be different. A quantitative assessment of the speedup was performed in this study, based on a number of experiments for different computing environments. The potential and limitations of parallel processing by tiling and multi-threading were hereby assessed. Experiments were based on an implementation that relies on an application programming interface (API) abstracting any platform-specific details, such as those related to data access.
APA, Harvard, Vancouver, ISO, and other styles
3

Yassour, M., T. Kaplan, A. Jaimovich, and N. Friedman. "Nucleosome positioning from tiling microarray data." Bioinformatics 24, no. 13 (June 27, 2008): i139—i146. http://dx.doi.org/10.1093/bioinformatics/btn151.

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

Andonov, R., S. Balev, S. Rajopadhye, and N. Yanev. "Optimal semi-oblique tiling." IEEE Transactions on Parallel and Distributed Systems 14, no. 9 (September 2003): 944–60. http://dx.doi.org/10.1109/tpds.2003.1233716.

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

Amaral, Marcelo, David Chester, Fang Fang, and Klee Irwin. "Exploiting Anyonic Behavior of Quasicrystals for Topological Quantum Computing." Symmetry 14, no. 9 (August 26, 2022): 1780. http://dx.doi.org/10.3390/sym14091780.

Full text
Abstract:
The concrete realization of topological quantum computing using low-dimensional quasiparticles, known as anyons, remains one of the important challenges of quantum computing. A topological quantum computing platform promises to deliver more robust qubits with additional hardware-level protection against errors that could lead to the desired large-scale quantum computation. We propose quasicrystal materials as such a natural platform and show that they exhibit anyonic behavior that can be used for topological quantum computing. Different from anyons, quasicrystals are already implemented in laboratories. In particular, we study the correspondence between the fusion Hilbert spaces of the simplest non-abelian anyon, the Fibonacci anyons, and the tiling spaces of the one-dimensional Fibonacci chain and the two-dimensional Penrose tiling quasicrystals. A concrete encoding on these tiling spaces of topological quantum information processing is also presented by making use of inflation and deflation of such tiling spaces. While we outline the theoretical basis for such a platform, details on the physical implementation remain open.
APA, Harvard, Vancouver, ISO, and other styles
6

Olasz, A., B. Nguyen Thai, and D. Kristóf. "A NEW INITIATIVE FOR TILING, STITCHING AND PROCESSING GEOSPATIAL BIG DATA IN DISTRIBUTED COMPUTING ENVIRONMENTS." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences III-4 (June 3, 2016): 111–18. http://dx.doi.org/10.5194/isprs-annals-iii-4-111-2016.

Full text
Abstract:
Within recent years, several new approaches and solutions for Big Data processing have been developed. The Geospatial world is still facing the lack of well-established distributed processing solutions tailored to the amount and heterogeneity of geodata, especially when fast data processing is a must. The goal of such systems is to improve processing time by distributing data transparently across processing (and/or storage) nodes. These types of methodology are based on the concept of divide and conquer. Nevertheless, in the context of geospatial processing, most of the distributed computing frameworks have important limitations regarding both data distribution and data partitioning methods. Moreover, flexibility and expendability for handling various data types (often in binary formats) are also strongly required. <br><br> This paper presents a concept for tiling, stitching and processing of big geospatial data. The system is based on the IQLib concept (<a href="https://github.com/posseidon/IQLib/"target="_blank">https://github.com/posseidon/IQLib/</a>) developed in the frame of the IQmulus EU FP7 research and development project (<a href="http://www.iqmulus.eu"target="_blank">http://www.iqmulus.eu</a>). The data distribution framework has no limitations on programming language environment and can execute scripts (and workflows) written in different development frameworks (e.g. Python, R or C#). It is capable of processing raster, vector and point cloud data. The above-mentioned prototype is presented through a case study dealing with country-wide processing of raster imagery. Further investigations on algorithmic and implementation details are in focus for the near future.
APA, Harvard, Vancouver, ISO, and other styles
7

Olasz, A., B. Nguyen Thai, and D. Kristóf. "A NEW INITIATIVE FOR TILING, STITCHING AND PROCESSING GEOSPATIAL BIG DATA IN DISTRIBUTED COMPUTING ENVIRONMENTS." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences III-4 (June 3, 2016): 111–18. http://dx.doi.org/10.5194/isprsannals-iii-4-111-2016.

Full text
Abstract:
Within recent years, several new approaches and solutions for Big Data processing have been developed. The Geospatial world is still facing the lack of well-established distributed processing solutions tailored to the amount and heterogeneity of geodata, especially when fast data processing is a must. The goal of such systems is to improve processing time by distributing data transparently across processing (and/or storage) nodes. These types of methodology are based on the concept of divide and conquer. Nevertheless, in the context of geospatial processing, most of the distributed computing frameworks have important limitations regarding both data distribution and data partitioning methods. Moreover, flexibility and expendability for handling various data types (often in binary formats) are also strongly required. &lt;br&gt;&lt;br&gt; This paper presents a concept for tiling, stitching and processing of big geospatial data. The system is based on the IQLib concept (&lt;a href="https://github.com/posseidon/IQLib/"target="_blank"&gt;https://github.com/posseidon/IQLib/&lt;/a&gt;) developed in the frame of the IQmulus EU FP7 research and development project (&lt;a href="http://www.iqmulus.eu"target="_blank"&gt;http://www.iqmulus.eu&lt;/a&gt;). The data distribution framework has no limitations on programming language environment and can execute scripts (and workflows) written in different development frameworks (e.g. Python, R or C#). It is capable of processing raster, vector and point cloud data. The above-mentioned prototype is presented through a case study dealing with country-wide processing of raster imagery. Further investigations on algorithmic and implementation details are in focus for the near future.
APA, Harvard, Vancouver, ISO, and other styles
8

Jaworski, John, and Elizabeth Bliss. "Data Processing Mathematics." Mathematical Gazette 71, no. 458 (December 1987): 334. http://dx.doi.org/10.2307/3617092.

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

Richards, B. "Data processing mathematics." Data Processing 28, no. 3 (April 1986): 162. http://dx.doi.org/10.1016/0011-684x(86)90015-8.

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

Storch, Iago, Bruno Zatt, Luciano Agostini, Guilherme Correa, and Daniel Palomino. "Memory-aware Workload Balancing Technique based on Decision Trees for Parallel HEVC Video Coding." Journal of Integrated Circuits and Systems 15, no. 3 (December 28, 2020): 1–9. http://dx.doi.org/10.29292/jics.v15i3.96.

Full text
Abstract:
Video coding applications demand high computational effort to achieve high compression rates at a low perceptual quality expense. In order to reach acceptable encoding time for such applications, modern video coding standards have been em-ploying parallelism approaches to exploit multiprocessing plat-forms, such as the tiling tool from HEVC standard. When employing Tiles, each frame is divided into rectangular-shaped regions which can be encoded independently. However, alt-hough it is possible to distribute the data equally among the processing units when using Tiles, balancing the workload among processing units poses great challenges. Therefore, this paper proposes a workload balancing technique aiming to speed up the HEVC parallel encoding using Tiles. Different from other literature works, the proposed solution uses a novel approach employing static uniform tiling to avoid memory management difficulties that may emerge when dynamic tiling solutions are employed. The proposed technique relies on workload distribution history of previous frames to predict the workload distribution of the current frame. Then, the pro-posed technique balances the workload among Tiles by em-ploying a workload reduction scheme based on decision trees in the coding process. Experimental tests show that the pro-posed solution outperforms the standard uniform tiling and it is competitive with related works in terms of speedup. Moreo-ver, the solution optimizes resources usage in multiprocessing platforms, presents a negligible coding efficiency loss and avoids increasing memory bandwidth usage by 9.8%, on aver-age, when compared to dynamic tiling solutions, which can impact significantly the performance in memory-constrained platforms.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Tiling (Mathematics) Data processing"

1

Li, Yufei, and 李宇飛. "A study on surface and volume tiling for geometric modeling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B48329733.

Full text
Abstract:
Surface tiling, as well as its counterpart in 3D, i.e. volume tiling, is a fundamental research problem in the subject of computer graphics and geometric modeling, which has found applications in numerous areas, such as computer-aided design (CAD), physical simulation, realtime rendering and architectural modeling. The objective of surface tiling is to compute discrete mesh representations for given surfaces which are often required to possess some desirable geometric properties. Likewise, volume tiling focuses on the study of discretizing a given 3D volume with complex boundary into a set of high-quality volumetric elements. This thesis starts with the study of computing optimal sampling for parametric surfaces, that is, decompose the surface into quad patches such that 1) each quad patch should have their sides with equal length; and 2) the shapes and sizes of all the quad patches should be the same as much as possible. Then, the similar idea is applied to the discrete case, i.e. optimizing the face elements of a quad mesh surface with the goal of making it possess, as much as possible, face elements of desired shapes and sizes. This thesis further studies the computation of hexagonal tiling on free-form surfaces, where the planarity of the faces is more concerned. Free-form meshes with planar hexagonal faces, to be called P-Hex meshes, provide a useful surface representation in discrete differential geometry and are demanded in architectural design for representing surfaces built with planar glass/metal panels. We study the geometry of P-Hex meshes and present an algorithm for computing a free-form P-Hex mesh of a specified shape. Lastly, this thesis progresses to 3D volume case and proposes an automatic method for generating boundary-aligned all-hexahedron meshes with high quality, which possess nice numerical properties, such as a reduced number of elements and high approximation accuracy in physical simulation and mechanical engineering.
published_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
APA, Harvard, Vancouver, ISO, and other styles
2

Farnham, Rodrigo Bouchardet. "Processing and inpainting of sparse data as applied to atomic force microscopy imaging." California State University, Long Beach, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cena, Bernard Maria. "Reconstruction for visualisation of discrete data fields using wavelet signal processing." University of Western Australia. Dept. of Computer Science, 2000. http://theses.library.uwa.edu.au/adt-WU2003.0014.

Full text
Abstract:
The reconstruction of a function and its derivative from a set of measured samples is a fundamental operation in visualisation. Multiresolution techniques, such as wavelet signal processing, are instrumental in improving the performance and algorithm design for data analysis, filtering and processing. This dissertation explores the possibilities of combining traditional multiresolution analysis and processing features of wavelets with the design of appropriate filters for reconstruction of sampled data. On the one hand, a multiresolution system allows data feature detection, analysis and filtering. Wavelets have already been proven successful in these tasks. On the other hand, a choice of discrete filter which converges to a continuous basis function under iteration permits efficient and accurate function representation by providing a “bridge” from the discrete to the continuous. A function representation method capable of both multiresolution analysis and accurate reconstruction of the underlying measured function would make a valuable tool for scientific visualisation. The aim of this dissertation is not to try to outperform existing filters designed specifically for reconstruction of sampled functions. The goal is to design a wavelet filter family which, while retaining properties necessary to preform multiresolution analysis, possesses features to enable the wavelets to be used as efficient and accurate “building blocks” for function representation. The application to visualisation is used as a means of practical demonstration of the results. Wavelet and visualisation filter design is analysed in the first part of this dissertation and a list of wavelet filter design criteria for visualisation is collated. Candidate wavelet filters are constructed based on a parameter space search of the BC-spline family and direct solution of equations describing filter properties. Further, a biorthogonal wavelet filter family is constructed based on point and average interpolating subdivision and using the lifting scheme. The main feature of these filters is their ability to reconstruct arbitrary degree piecewise polynomial functions and their derivatives using measured samples as direct input into a wavelet transform. The lifting scheme provides an intuitive, interval-adapted, time-domain filter and transform construction method. A generalised factorisation for arbitrary primal and dual order point and average interpolating filters is a result of the lifting construction. The proposed visualisation filter family is analysed quantitatively and qualitatively in the final part of the dissertation. Results from wavelet theory are used in the analysis which allow comparisons among wavelet filter families and between wavelets and filters designed specifically for reconstruction for visualisation. Lastly, the performance of the constructed wavelet filters is demonstrated in the visualisation context. One-dimensional signals are used to illustrate reconstruction performance of the wavelet filter family from noiseless and noisy samples in comparison to other wavelet filters and dedicated visualisation filters. The proposed wavelet filters converge to basis functions capable of reproducing functions that can be represented locally by arbitrary order piecewise polynomials. They are interpolating, smooth and provide asymptotically optimal reconstruction in the case when samples are used directly as wavelet coefficients. The reconstruction performance of the proposed wavelet filter family approaches that of continuous spatial domain filters designed specifically for reconstruction for visualisation. This is achieved in addition to retaining multiresolution analysis and processing properties of wavelets.
APA, Harvard, Vancouver, ISO, and other styles
4

Turkmen, Muserref. "Digital Image Processing Of Remotely Sensed Oceanographic Data." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609948/index.pdf.

Full text
Abstract:
Developing remote sensing instrumentation allows obtaining information about an area rapidly and with low costs. This fact offers a challenge to remote sensing algorithms aimed at extracting information about an area from the available re¬
mote sensing data. A very typical and important problem being interpretation of satellite images. A very efficient approach to remote sensing is employing discrim¬
inant functions to distinguish different landscape classes from satellite images. Various methods on this direction are already studied. However, the efficiency of the studied methods are still not very high. In this thesis, we will improve efficiency of remote sensing algorithms. Besides we will investigate improving boundary detection methods on satellite images.
APA, Harvard, Vancouver, ISO, and other styles
5

van, Schaik Sebastiaan Johannes. "A framework for processing correlated probabilistic data." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:91aa418d-536e-472d-9089-39bef5f62e62.

Full text
Abstract:
The amount of digitally-born data has surged in recent years. In many scenarios, this data is inherently uncertain (or: probabilistic), such as data originating from sensor networks, image and voice recognition, location detection, and automated web data extraction. Probabilistic data requires novel and different approaches to data mining and analysis, which explicitly account for the uncertainty and the correlations therein. This thesis introduces ENFrame: a framework for processing and mining correlated probabilistic data. Using this framework, it is possible to express both traditional and novel algorithms for data analysis in a special user language, without having to explicitly address the uncertainty of the data on which the algorithms operate. The framework will subsequently execute the algorithm on the probabilistic input, and perform exact or approximate parallel probability computation. During the probability computation, correlations and provenance are succinctly encoded using probabilistic events. This thesis contains novel contributions in several directions. An expressive user language – a subset of Python – is introduced, which allows a programmer to implement algorithms for probabilistic data without requiring knowledge of the underlying probabilistic model. Furthermore, an event language is presented, which is used for the probabilistic interpretation of the user program. The event language can succinctly encode arbitrary correlations using events, which are the probabilistic counterparts of deterministic user program variables. These highly interconnected events are stored in an event network, a probabilistic interpretation of the original user program. Multiple techniques for exact and approximate probability computation (with error guarantees) of such event networks are presented, as well as techniques for parallel computation. Adaptations of multiple existing data mining algorithms are shown to work in the framework, and are subsequently subjected to an extensive experimental evaluation. Additionally, a use-case is presented in which a probabilistic adaptation of a clustering algorithm is used to predict faults in energy distribution networks. Lastly, this thesis presents techniques for integrating a number of different probabilistic data formalisms for use in this framework and in other applications.
APA, Harvard, Vancouver, ISO, and other styles
6

Smith, Sydney. "Approaches to Natural Language Processing." Scholarship @ Claremont, 2018. http://scholarship.claremont.edu/cmc_theses/1817.

Full text
Abstract:
This paper explores topic modeling through the example text of Alice in Wonderland. It explores both singular value decomposition as well as non-­‐‑negative matrix factorization as methods for feature extraction. The paper goes on to explore methods for partially supervised implementation of topic modeling through introducing themes. A large portion of the paper also focuses on implementation of these techniques in python as well as visualizations of the results which use a combination of python, html and java script along with the d3 framework. The paper concludes by presenting a mixture of SVD, NMF and partially-­‐‑supervised NMF as a possible way to improve topic modeling.
APA, Harvard, Vancouver, ISO, and other styles
7

Akleman, Ergun. "Pseudo-affine functions : a non-polynomial implicit function family to describe curves and sufaces." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/15409.

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

Paterson, Judith Evelyn. "A study of nine girl's learning before, during and after their introduction to some of the basics of LOGO." Thesis, University of Cape Town, 1986. http://hdl.handle.net/11427/23348.

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

Palmer, David Donald. "Modeling uncertainty for information extraction from speech data /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/5834.

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

Tang, Cham-wing, and 鄧湛榮. "The attitudes of secondary school mathematics teachers towards the teaching of mathematics by using computers." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31958886.

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

Books on the topic "Tiling (Mathematics) Data processing"

1

Xue, Jingling. Loop tiling for parallelism. Boston, MA: Kluwer Academic, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Loop tiling for parallelism. Boston, MA: Kluwer Academic, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bliss, Elizabeth. Data processing mathematics. Englewood Cliffs, N.J: Prentice-Hall, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xue, Jingling. Loop Tiling for Parallelism. Boston, MA: Springer US, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

McCullough, Robert N. Mathematics for data processing. Dubuque, Iowa: W.C. Brown, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Price, Wilson T. Elements of data processing mathematics. 3rd ed. New York: Holt, Rinehart, and Winston, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mignotte, Maurice. Mathematics for computer algebra. New York: Springer-Verlag, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kolatis, Maria Shopay. Mathematics for data processing and computing. Reading, Mass: Addison-Wesley Pub., 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Goodman, I. R. Mathematics of Data Fusion. Dordrecht: Springer Netherlands, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kaltofen, Erich. Computers and Mathematics. New York, NY: Springer US, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Tiling (Mathematics) Data processing"

1

Kandemir, Mahmut, Alok Choudhary, and J. Ramanujam. "I/O-Conscious Tiling for Disk-Resident Data Sets." In Euro-Par’99 Parallel Processing, 430–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48311-x_57.

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

Gorawski, Marcin, and Pawel Marks. "Resumption of Data Extraction Process in Parallel Data Warehouses." In Parallel Processing and Applied Mathematics, 478–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11752578_58.

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

Korch, Matthias, and Tim Werner. "Multi-workgroup Tiling to Improve the Locality of Explicit One-Step Methods for ODE Systems with Limited Access Distance on GPUs." In Parallel Processing and Applied Mathematics, 3–12. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43229-4_1.

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

Gorawski, Marcin, and Rafal Malczok. "Distributed Spatial Data Warehouse." In Parallel Processing and Applied Mathematics, 676–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24669-5_88.

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

Jackson, Colin. "Data Collection, Processing and Analysis." In All-Attainment Teaching in Secondary Mathematics, 75–84. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-92361-7_6.

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

Fox, Geoffrey C., Mehmet S. Aktas, Galip Aydin, Hasan Bulut, Harshawardhan Gadgil, Sangyoon Oh, Shrideep Pallickara, Marlon E. Pierce, Ahmet Sayar, and Gang Zhai. "Grids for Real Time Data Applications." In Parallel Processing and Applied Mathematics, 320–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11752578_39.

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

Kwedlo, Wojciech. "Parallelizing Evolutionary Algorithms for Clustering Data." In Parallel Processing and Applied Mathematics, 430–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11752578_52.

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

Cai, Min, Istvan Jonyer, and Marcin Paprzycki. "Improving Parallelism in Structural Data Mining." In Parallel Processing and Applied Mathematics, 455–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11752578_55.

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

Głut, Barbara, and Tomasz Jurczyk. "Mesh Adaptation Based on Discrete Data." In Parallel Processing and Applied Mathematics, 559–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11752578_67.

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

Słota, Renata, Darin Nikolow, Marcin Kuta, Mariusz Kapanowski, Kornel Skałkowski, Marek Pogoda, and Jacek Kitowski. "Replica Management for National Data Storage." In Parallel Processing and Applied Mathematics, 184–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14403-5_20.

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

Conference papers on the topic "Tiling (Mathematics) Data processing"

1

Jin, R., K. Vaidyanathan, G. Yang, and G. Agrawal. "Using tiling to scale parallel data cube construction." In International Conference on Parallel Processing, 2004. ICPP 2004. IEEE, 2004. http://dx.doi.org/10.1109/icpp.2004.1327944.

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

Nusantari, Diah Oga, Deni Nasir Ahmad, and Ihwan Zulkarnain. "Community Service: Processing Data Statistically." In SEMANTIK Conference of Mathematics Education (SEMANTIK 2019). Paris, France: Atlantis Press, 2020. http://dx.doi.org/10.2991/assehr.k.200827.108.

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

Vashisht, Manisha, and Madhulika Bhatia. "Role of Mathematics in Image Processing." In 2019 International Conference on Machine Learning, Big Data, Cloud and Parallel Computing (COMITCon). IEEE, 2019. http://dx.doi.org/10.1109/comitcon.2019.8862438.

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

Wang, Jinyu, Yifei Kang, Yiwen Li, Weiguo Wu, Song Liu, and Longxiang Wang. "Hexagonal Tiling based Multiple FPGAs Stencil Computation Acceleration and Optimization Methodology." In 2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom). IEEE, 2021. http://dx.doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom52081.2021.00101.

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

Kumkov, Sergey I., Alexander A. Redkin, Svetlana V. Pershina, Evgeniya A. Il’ina, Alexander A. Kataev, and Yury P. Zaikov. "Interval approach to processing the noised thermophysical data." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2019. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0028149.

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

Wu, Ronghua. "Mathematics Education and Teaching Based on Big Data Analysis." In 2021 International Conference on Computers, Information Processing and Advanced Education (CIPAE). IEEE, 2021. http://dx.doi.org/10.1109/cipae53742.2021.00077.

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

Bistrian, D. A., G. Dimitriu, and I. M. Navon. "Processing epidemiological data using dynamic mode decomposition method." In APPLICATION OF MATHEMATICS IN TECHNICAL AND NATURAL SCIENCES: 11th International Conference for Promoting the Application of Mathematics in Technical and Natural Sciences - AMiTaNS’19. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5130825.

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

Kaliyagina, L., J. Mopoz, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "Methods of Empirical Data Processing in Developing Processes." In ICNAAM 2010: International Conference of Numerical Analysis and Applied Mathematics 2010. AIP, 2010. http://dx.doi.org/10.1063/1.3497818.

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

Hussien, Nur Syahela, Sarina Sulaiman, and Siti Mariyam Shamsuddin. "Tools in data science for better processing." In ADVANCES IN INDUSTRIAL AND APPLIED MATHEMATICS: Proceedings of 23rd Malaysian National Symposium of Mathematical Sciences (SKSM23). Author(s), 2016. http://dx.doi.org/10.1063/1.4954530.

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

Zhelev, Svetoslav, and Anna Rozeva. "Big data processing in the cloud - Challenges and platforms." In PROCEEDINGS OF THE 43RD INTERNATIONAL CONFERENCE APPLICATIONS OF MATHEMATICS IN ENGINEERING AND ECONOMICS: (AMEE’17). Author(s), 2017. http://dx.doi.org/10.1063/1.5014007.

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

Reports on the topic "Tiling (Mathematics) Data processing"

1

Modlo, Yevhenii O., Serhiy O. Semerikov, Stanislav L. Bondarevskyi, Stanislav T. Tolmachev, Oksana M. Markova, and Pavlo P. Nechypurenko. Methods of using mobile Internet devices in the formation of the general scientific component of bachelor in electromechanics competency in modeling of technical objects. [б. в.], February 2020. http://dx.doi.org/10.31812/123456789/3677.

Full text
Abstract:
An analysis of the experience of professional training bachelors of electromechanics in Ukraine and abroad made it possible to determine that one of the leading trends in its modernization is the synergistic integration of various engineering branches (mechanical, electrical, electronic engineering and automation) in mechatronics for the purpose of design, manufacture, operation and maintenance electromechanical equipment. Teaching mechatronics provides for the meaningful integration of various disciplines of professional and practical training bachelors of electromechanics based on the concept of modeling and technological integration of various organizational forms and teaching methods based on the concept of mobility. Within this approach, the leading learning tools of bachelors of electromechanics are mobile Internet devices (MID) – a multimedia mobile devices that provide wireless access to information and communication Internet services for collecting, organizing, storing, processing, transmitting, presenting all kinds of messages and data. The authors reveals the main possibilities of using MID in learning to ensure equal access to education, personalized learning, instant feedback and evaluating learning outcomes, mobile learning, productive use of time spent in classrooms, creating mobile learning communities, support situated learning, development of continuous seamless learning, ensuring the gap between formal and informal learning, minimize educational disruption in conflict and disaster areas, assist learners with disabilities, improve the quality of the communication and the management of institution, and maximize the cost-efficiency. Bachelor of electromechanics competency in modeling of technical objects is a personal and vocational ability, which includes a system of knowledge, skills, experience in learning and research activities on modeling mechatronic systems and a positive value attitude towards it; bachelor of electromechanics should be ready and able to use methods and software/hardware modeling tools for processes analyzes, systems synthesis, evaluating their reliability and effectiveness for solving practical problems in professional field. The competency structure of the bachelor of electromechanics in the modeling of technical objects is reflected in three groups of competencies: general scientific, general professional and specialized professional. The implementation of the technique of using MID in learning bachelors of electromechanics in modeling of technical objects is the appropriate methodic of using, the component of which is partial methods for using MID in the formation of the general scientific component of the bachelor of electromechanics competency in modeling of technical objects, are disclosed by example academic disciplines “Higher mathematics”, “Computers and programming”, “Engineering mechanics”, “Electrical machines”. The leading tools of formation of the general scientific component of bachelor in electromechanics competency in modeling of technical objects are augmented reality mobile tools (to visualize the objects’ structure and modeling results), mobile computer mathematical systems (universal tools used at all stages of modeling learning), cloud based spreadsheets (as modeling tools) and text editors (to make the program description of model), mobile computer-aided design systems (to create and view the physical properties of models of technical objects) and mobile communication tools (to organize a joint activity in modeling).
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!

To the bibliography