Journal articles: 'Parallel merge sort'

7

Romm, Ya E. "Parallel merge sort using comparison matrices. I." Cybernetics and Systems Analysis 30, no. 5 (1994): 631–47. http://dx.doi.org/10.1007/bf02367744.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhang, Jun, Yong Ping Gao, Yue Shun He, and Xue Yuan Wang. "Algorithm Improvement of Two-Way Merge Sort Based on OpenMP." Applied Mechanics and Materials 701-702 (December 2014): 24–29. http://dx.doi.org/10.4028/www.scientific.net/amm.701-702.24.

Full text

Abstract:

Two-way merge sort algorithm has a good time efficiency which has been used widely. The sort algorithm can be improved on speed and efficient based on its own potential parallelism via the parallel processing capacity of multi-core processor and the convenient programming interface of OpenMP. The time complexity is improved to O(nlog2n/TNUM) and inversely proportional to the number of parallel threads. The experiment results show that the improved two-way merge sort algorithm become much more efficient compared to the traditional one.

APA, Harvard, Vancouver, ISO, and other styles

9

Marszałek, Zbigniew, Marcin Woźniak, and Dawid Połap. "Fully Flexible Parallel Merge Sort for Multicore Architectures." Complexity 2018 (December 2, 2018): 1–19. http://dx.doi.org/10.1155/2018/8679579.

Full text

Abstract:

The development in multicore architectures gives a new line of processors that can flexibly distribute tasks between their logical cores. These need flexible models of efficient algorithms, both fast and stable. A new line of efficient sorting algorithms can support these systems to efficiently use all available resources. Processes and calculations shall be flexibly distributed between cores to make the performance as high as possible. In this article we present a fully flexible sorting method designed for parallel processing. The idea we describe in this article is based on modified merge so

APA, Harvard, Vancouver, ISO, and other styles

10

Yudiswara, I. Nyoman Aditya, and Abba Suganda. "Analisis Kinerja Algoritma Quick Double Merge Sort Paralel Menggunakan openMP." Ultima Computing : Jurnal Sistem Komputer 11, no. 2 (2020): 95–102. http://dx.doi.org/10.31937/sk.v11i2.1294.

Full text

Abstract:

Processor technology currently tends to increase the number of cores more than increasing the clock speed. This development is very useful and becomes an opportunity to improve the performance of sequential algorithms that are only done by one core. This paper discusses the sorting algorithm that is executed in parallel by several logical CPUs or cores using the openMP library. This algorithm is named QDM Sort which is a combination of sequential quick sort algorithm and double merge algorithm. This study uses a data parallelism approach to design parallel algorithms from sequential algorithms

APA, Harvard, Vancouver, ISO, and other styles

11

Trahan, Robin, and Susan Rodger. "Simulation and visualization tools for teaching parallel merge sort." ACM SIGCSE Bulletin 25, no. 1 (1993): 237–41. http://dx.doi.org/10.1145/169073.169461.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Evans, D. J., and Nadia Y. Yousif. "The parallel neighbour sort and 2-way merge algorithm." Parallel Computing 3, no. 1 (1986): 85–90. http://dx.doi.org/10.1016/0167-8191(86)90009-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Arman, Arif, and Dmitri Loguinov. "Origami." Proceedings of the VLDB Endowment 15, no. 2 (2021): 259–71. http://dx.doi.org/10.14778/3489496.3489507.

Full text

Abstract:

Mergesort is a popular algorithm for sorting real-world workloads as it is immune to data skewness, suitable for parallelization using vectorized intrinsics, and relatively simple to multi-thread. In this paper, we introduce Origami , an in-memory merge-sort framework that is optimized for scalar, as well as all current SIMD (single-instruction multiple-data) CPU architectures. For each vector-extension set (e.g., SSE, AVX2, AVX-512), we present an in-register sorter for small sequences that is up to 8× faster than prior methods and a branchless streaming merger that achieves up to a 1.5× spee

APA, Harvard, Vancouver, ISO, and other styles

14

Wolf, J. L., D. M. Dias, and P. S. Yu. "A parallel sort merge join algorithm for managing data skew." IEEE Transactions on Parallel and Distributed Systems 4, no. 1 (1993): 70–86. http://dx.doi.org/10.1109/71.205654.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

DEHNE, FRANK, and HAMIDREZA ZABOLI. "DETERMINISTIC SAMPLE SORT FOR GPUS." Parallel Processing Letters 22, no. 03 (2012): 1250008. http://dx.doi.org/10.1142/s0129626412500089.

Full text

Abstract:

We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU BUCKET SORT) is not only considerably faster than the best comparison-based sorting algorithm for GPUs (THRUST MERGE [Satish et.al., Proc. IPDPS 2009]) but also as fast as randomized sample sort for GPUs (GPU SAMPLE SORT [Leischner et.al., Proc. IPDPS 2010]). However, deterministic sample sort has the advantage that bucket sizes are guaranteed and therefore its running time does not have the input data dependent fluctuations that can occur for randomized sample sort.

APA, Harvard, Vancouver, ISO, and other styles

16

Kyi, Lai Lai Win, and Nay Min Tun. "Performance Comparison of Parallel Sorting Algorithms on Homogeneous Cluster of Workstations." Advanced Materials Research 433-440 (January 2012): 3900–3904. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.3900.

Full text

Abstract:

Sorting appears the most attention among all computational tasks over the past years because sorted data is at the heart of many computations. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. Many parallel sorting algorithms have been investigated for a variety of parallel computer architectures. In this paper, three parallel sorting algorithms have been implemented and compared in terms of their overall execution time. The algorithms implemented are the o

APA, Harvard, Vancouver, ISO, and other styles

17

Srivastava, Rahul. "Research Paper on Visualization of Sorting Algorithm." INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 08, no. 05 (2024): 1–5. http://dx.doi.org/10.55041/ijsrem34569.

Full text

Abstract:

In the realm of sorting algorithms, visualization projects serve as educational tools to comprehend and demonstrate various sorting techniques. This paper presents an analysis and review of sorting visualization projects that do not utilize parallelism. By exploring sorting algorithms without parallel processing, this review aims to provide insights into the efficiency, functionality, and visual representation of these algorithms. Understanding sorting algorithms without parallelism contributes to a foundational understanding of their sequential execution and computational complexities. Keywor

APA, Harvard, Vancouver, ISO, and other styles

18

Schneider, G. Michael. "Using Parallel Merge Sort to Teach Fundamental Concepts in Distributed Parallelism." Computer Science Education 9, no. 2 (1999): 148–61. http://dx.doi.org/10.1076/csed.9.2.148.3810.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

AL-Azzam, Saad, and Mohammad Qatawneh. "Parallel Processing of Sorting and Searching Algorithms Comparative Study." Modern Applied Science 12, no. 4 (2018): 143. http://dx.doi.org/10.5539/mas.v12n4p143.

Full text

Abstract:

Recently, supercomputers structure and its software optimization have been popular subjects. Much of the software recently consumes a long period of time both to sort and search datasets, and thus optimizing these algorithms becomes a priority. In order to discover the most efficient sorting and searching algorithms for parallel processing units, one can compare CPU runtime as a performance index. In this paper, Quick, Bubble, and Merge sort algorithms have been chosen for comparison, as well as sequential and binary as search algorithms. Each one of the sort and search algorithms was tested i

APA, Harvard, Vancouver, ISO, and other styles

20

Albutiu, Martina-Cezara, Alfons Kemper, and Thomas Neumann. "Massively parallel sort-merge joins in main memory multi-core database systems." Proceedings of the VLDB Endowment 5, no. 10 (2012): 1064–75. http://dx.doi.org/10.14778/2336664.2336678.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

SAXENA, SANJEEV, P. C. P. BHATT, and V. C. PRASAD. "ON PARALLEL PREFIX COMPUTATION." Parallel Processing Letters 04, no. 04 (1994): 429–36. http://dx.doi.org/10.1142/s0129626494000399.

Full text

Abstract:

We prove that prefix sums of n integers of at most b bits can be found on a COMMON CRCW PRAM in [Formula: see text] time with a linear time-processor product. The algorithm is optimally fast, for any polynomial number of processors. In particular, if [Formula: see text] the time taken is [Formula: see text]. This is a generalisation of previous result. The previous [Formula: see text] time algorithm was valid only for O(log n)-bit numbers. Application of this algorithm to r-way parallel merge sort algorithm is also considered. We also consider a more realistic PRAM variant, in which the word s

APA, Harvard, Vancouver, ISO, and other styles

22

Nugroho, Eko Dwi, Ilham Firman Ashari, Muhammad Nashrullah, Muhammad Habib Algifari, and Miranti Verdiana. "Comparative Analysis of OpenMP and MPI Parallel Computing Implementations in Team Sort Algorithm." Journal of Applied Informatics and Computing 7, no. 2 (2023): 141–49. http://dx.doi.org/10.30871/jaic.v7i2.6409.

Full text

Abstract:

Tim Sort is a sorting algorithm that combines Merge Sort and Binary Insertion Sort sorting algorithms. Parallel computing is a computational processing technique in parallel or is divided into several parts and carried out simultaneously. The application of parallel computing to algorithms is called parallelization. The purpose of parallelization is to reduce computational processing time, but not all parallelization can reduce computational processing time. Our research aims to analyse the effect of implementing parallel computing on the processing time of the Tim Sort algorithm. The Team Sor

APA, Harvard, Vancouver, ISO, and other styles

23

Hosseini-Rad, Mina, Majid Abdulrozzagh-Nezzad, and Seyyed-Mohammad Javadi-Moghaddam. "Study of Scheduling in Programming Languages of Multi-Core Processor." Data Science: Journal of Computing and Applied Informatics 2, no. 2 (2019): 101–9. http://dx.doi.org/10.32734/jocai.v2.i2-282.

Full text

Abstract:

Over the recent decades, the nature of multi core processors caused changing the serial programming model to parallel mode. There are several programming languages for the parallel multi core processors and processors with different architectures that these languages have faced programmers to challenges to achieve higher performance. In additional, different scheduling methods in the programming languages for the multi core processors have significant impact on efficiency of the programming languages. Therefore, this article addresses the investigation of the conventional scheduling techniques

APA, Harvard, Vancouver, ISO, and other styles

24

Hosseini-Rad, Mina, Majid Abdolrazzagh-Nezhad, and Seyyed-Mohammad Javadi-Moghaddam. "Study of Scheduling in Programming Languages of Multi-Core Processor." Data Science: Journal of Computing and Applied Informatics 2, no. 2 (2018): 101–9. http://dx.doi.org/10.32734/jocai.v2.i2-327.

Full text

Abstract:

Over the recent decades, the nature of multi-core processors caused changing the serial programming model to parallel mode. There are several programming languages for the parallel multi-core processors and processors with different architectures that these languages have faced programmers to challenges to achieve higher performance. In addition, different scheduling methods in the programming languages for the multi-core processors have the significant impact on the efficiency of the programming languages. Therefore, this article addresses the investigation of the conventional scheduling tech

APA, Harvard, Vancouver, ISO, and other styles

25

Keller, Jörg, Christoph Kessler, and Rikard Hultén. "Optimized On-Chip-Pipelining for Memory-Intensive Computations on Multi-Core Processors with Explicit Memory Hierarchy." JUCS - Journal of Universal Computer Science 18, no. (14) (2012): 1987–2023. https://doi.org/10.3217/jucs-018-14-1987.

Full text

Abstract:

Limited bandwidth to off-chip main memory tends to be a performance bottleneck in chip multiprocessors, and this will become even more problematic with an increasing number of cores. Especially for streaming computations where the ratio between computational work and memory transfer is low, transforming the program into more memory-efficient code is an important program optimization. On-chip pipelining reorganizes the computation so that partial results of subtasks are forwarded immediately between the cores over the high-bandwidth internal network, in order to reduce the volume of main memory

APA, Harvard, Vancouver, ISO, and other styles

26

Lee, JinWoo, Jung-Im Won, and JeeHee Yoon. "A Sort and Merge Method for Genome Variant Call Format (GVCF) Files using Parallel and Distributed Computing." Journal of KIISE 48, no. 3 (2021): 358–67. http://dx.doi.org/10.5626/jok.2021.48.3.358.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Adam, George K. "Co-Design of Multicore Hardware and Multithreaded Software for Thread Performance Assessment on an FPGA." Computers 11, no. 5 (2022): 76. http://dx.doi.org/10.3390/computers11050076.

Full text

Abstract:

Multicore and multithreaded architectures increase the performance of computing systems. The increase in cores and threads, however, raises further issues in the efficiency achieved in terms of speedup and parallelization, particularly for the real-time requirements of Internet of things (IoT)-embedded applications. This research investigates the efficiency of a 32-core field-programmable gate array (FPGA) architecture, with memory management unit (MMU) and real-time operating system (OS) support, to exploit the thread level parallelism (TLP) of tasks running in parallel as threads on multiple

APA, Harvard, Vancouver, ISO, and other styles

28

Rui, Ran, Hao Li, and Yi-Cheng Tu. "Efficient join algorithms for large database tables in a multi-GPU environment." Proceedings of the VLDB Endowment 14, no. 4 (2020): 708–20. http://dx.doi.org/10.14778/3436905.3436927.

Full text

Abstract:

Relational join processing is one of the core functionalities in database management systems. It has been demonstrated that GPUs as a general-purpose parallel computing platform is very promising in processing relational joins. However, join algorithms often need to handle very large input data, which is an issue that was not sufficiently addressed in existing work. Besides, as more and more desktop and workstation platforms support multi-GPU environment, the combined computing capability of multiple GPUs can easily achieve that of a computing cluster. It is worth exploring how join processing

APA, Harvard, Vancouver, ISO, and other styles

29

Niu, Yue, Jonathan Sterling, Harrison Grodin, and Robert Harper. "A cost-aware logical framework." Proceedings of the ACM on Programming Languages 6, POPL (2022): 1–31. http://dx.doi.org/10.1145/3498670.

Full text

Abstract:

We present calf , a c ost- a ware l ogical f ramework for studying quantitative aspects of functional programs. Taking inspiration from recent work that reconstructs traditional aspects of programming languages in terms of a modal account of phase distinctions , we argue that the cost structure of programs motivates a phase distinction between intension and extension . Armed with this technology, we contribute a synthetic account of cost structure as a computational effect in which cost-aware programs enjoy an internal noninterference property: input/output behavior cannot depend on cost. As a

APA, Harvard, Vancouver, ISO, and other styles

30

King, Stephen F., and Phil Aisthorpe. "Re-Engineering in the Face of a Merger: Soft Systems and Concurrent Dynamics." Journal of Information Technology 15, no. 2 (2000): 165–79. http://dx.doi.org/10.1177/026839620001500207.

Full text

Abstract:

Business process re-engineering (BPR) was presented as the key to successful organizational transformation in the early 1990s. In this paper we examine a BPR initiative at a medium-sized UK building society in order to explore whether BPR succeeded or failed and to place BPR within the wider context of an organization facing a merger. The study describes the development of a novel BPR methodology which combines both hard and soft modelling approaches and reveals a degree of success in terms of process modelling and gaining consensus on process content and faults. However, two more far-reaching

APA, Harvard, Vancouver, ISO, and other styles

31

Locatell, Christian. "Translating and Exegeting Hebrew Poetry: Illustrated with Psalm 70." Journal of Translation 11, no. 1 (2015): 35–60. http://dx.doi.org/10.54395/jot-p46yv.

Full text

Abstract:

Biblical Hebrew (BH) poetry poses unique challenges to translators and exegetes because of its often complex textual development, its defamiliarized mode of communication, and its understudied relationship to its co-text. While a comprehensive analysis is welcomed for any discourse type, the unique challenges of BH poetry call for a holistic approach that marshals insights from the extra-linguistic setting, co-text, and multifaceted discourse features. The method of discourse analysis proposed by Wendland (1994) seems to provide a helpful framework for such investigation. Applying this approac

APA, Harvard, Vancouver, ISO, and other styles

32

Xie, Weiying, Haonan Qin, Yunsong Li, Zhuo Wang, and Jie Lei. "A Novel Effectively Optimized One-Stage Network for Object Detection in Remote Sensing Imagery." Remote Sensing 11, no. 11 (2019): 1376. http://dx.doi.org/10.3390/rs11111376.

Full text

Abstract:

With great significance in military and civilian applications, the topic of detecting small and densely arranged objects in wide-scale remote sensing imagery is still challenging nowadays. To solve this problem, we propose a novel effectively optimized one-stage network (NEOON). As a fully convolutional network, NEOON consists of four parts: Feature extraction, feature fusion, feature enhancement, and multi-scale detection. To extract effective features, the first part has implemented bottom-up and top-down coherent processing by taking successive down-sampling and up-sampling operations in co

APA, Harvard, Vancouver, ISO, and other styles

33

Kotov, V. G. "Engraved images of the Shulgan-Tash (Kapova) cave, Bashkortostan, South Ural." VESTNIK ARHEOLOGII, ANTROPOLOGII I ETNOGRAFII, no. 2(61) (June 15, 2023): 5–15. http://dx.doi.org/10.20874/2071-0437-2023-61-2-1.

Full text

Abstract:

The cave of Shulgan-Tash (Kapova) with wall drawings of the Upper Paleolithic is located in the mountain course of the River Belaya in the Southern Urals, nearby the village of Gadelgareevo, Burzyansky district of the Republic of Bashkortostan. In the process of more than 50 years of studying the cave sanctuary, the search for engraved images has been carried out. Two compositions with engraved images were discovered in 2008. Com-position No. 1 is located in the Main Gallery, 100 m from the entrance, in a niche on the western wall at a height of about 2 m above the floor level. It consists of

APA, Harvard, Vancouver, ISO, and other styles

34

Tank, W. J., B. C. Curran, and E. E. Wadleigh. "Targeting Horizontal Wells—Efficient Oil Capture and Fracture Insights." SPE Reservoir Evaluation & Engineering 2, no. 02 (1999): 180–85. http://dx.doi.org/10.2118/55984-pa.

Full text

Abstract:

Summary Horizontal well targeting is often a greater challenge in massive, fractured carbonates than in low-productivity, poorly connected, and relatively thin reservoirs. This paper discusses methods to target horizontal wellbores in three-dimensional space to both confirm the fracture interpretation and establish high-efficiency oil capture. Several well examples are presented to illustrate the targeting objectives and the resulting well performance. Early in the program, the horizontal drilling objectives sought to maximize the lateral length in a direction determined by offset well product

APA, Harvard, Vancouver, ISO, and other styles

35

Zečević, Slobodan. "Contribution to discussions about existence of the constitutional law of the European Union." Arhiv za pravne i drustvene nauke 11, no. 1 (2023): 9–27. http://dx.doi.org/10.5937/adpn2301009z.

Full text

Abstract:

In relation to the topic, the formal absence of a legal text called the constitution of the European Union is noticeable. Simple logic dictates the conclusion that in absence of European constitution, there is no constitutional law of the European Union. However, the reality is much more complex than it seems. The United Kingdom, for example, does not have a written act called a constitution, but instead several constitutional contents whose sources are in laws, legal practice and so-called constitutional customs. Germany also formally does not have a constitution, but a Fundamental Law that p

APA, Harvard, Vancouver, ISO, and other styles

36

PhD, Soha S. Zaghloul,, Laila M. AlShehri, Maram F. AlJouie, Nojood E. AlEissa, and Nourah A. AlMogheerah. "Analytical and Experimental Performance Evaluation of Parallel Merge sort on Multicore System." International Journal Of Engineering And Computer Science, June 30, 2017. http://dx.doi.org/10.18535/ijecs/v6i6.36.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Dimitrov, Metodi, and Tzvetomir Vassilev. "Research on the Amount of Information Needed to Restore the Original Order of Four or Eight Elements Lists, when Using Different Sorting Algorithms." Proceedings of the Bulgarian Academy of Sciences 77, no. 9 (2024). http://dx.doi.org/10.7546/crabs.2024.09.07.

Full text

Abstract:

Data sorting is essential in most software applications, but sometimes elements need to be restored to their original order after processing. If this restoration happens long after sorting or on a different computer, additional information is needed to restore the order. This work explores the information needed to restore sequences of 4 and 8 elements. The following sorting algorithms were studied: parallel neighbour (odd even) sort, insertion sort, bubble sort, shell sort, merge-insertion sort, and merge sort. For each algorithm, the amount of information required in bytes to restore the ori

APA, Harvard, Vancouver, ISO, and other styles

38

Zhang, Jin, Jincheng Zhou, Xiang Zhang, Di Ma, and Chunye Gong. "Fine-grained vectorized merge sorting on RISC-V: from register to cache." CCF Transactions on High Performance Computing, December 18, 2024. https://doi.org/10.1007/s42514-024-00201-2.

Full text

Abstract:

AbstractMerge sort as a divide-sort-merge paradigm has been widely applied in computer science fields. As modern reduced instruction set computing architectures like the fifth generation (RISC-V) regard multiple registers as a vector register group for wide instruction parallelism, optimizing merge sort with this vectorized property is becoming increasingly common. In this paper, we overhaul the divide-sort-merge paradigm, from its register-level sort to the cache-aware merge, to develop a fine-grained RISC-V vectorized merge sort (RVMS). From the register-level view, the inline vectorized tra

APA, Harvard, Vancouver, ISO, and other styles

39

Lai, Lai Win Kyi, and Min Tun Nay. "Performance Comparison of Parallel Sorting Algorithms on the Cluster of Workstations." March 24, 2011. https://doi.org/10.5281/zenodo.1059595.

Full text

Abstract:

Sorting appears the most attention among all computational tasks over the past years because sorted data is at the heart of many computations. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. Many parallel sorting algorithms have been investigated for a variety of parallel computer architectures. In this paper, three parallel sorting algorithms have been implemented and compared in terms of their overall execution time. The algorithms implemented are the o

APA, Harvard, Vancouver, ISO, and other styles

40

Altarawneh, Muhyidean, Umur Inan, and Basima Elshqeirat. "Empirical Analysis Measuring the Performance of Multi-threading in Parallel Merge Sort." International Journal of Advanced Computer Science and Applications 13, no. 1 (2022). http://dx.doi.org/10.14569/ijacsa.2022.0130110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Ketchaya, Sirilak, and Apisit Rattanatranurak. "Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP." Scientific Reports 13, no. 1 (2023). http://dx.doi.org/10.1038/s41598-023-33583-4.

Full text

Abstract:

AbstractQuicksort is an important algorithm that uses the divide and conquer concept, and it can be run to solve any problem. The performance of the algorithm can be improved by implementing this algorithm in parallel. In this paper, the parallel sorting algorithm named the Multi-Deque Partition Dual-Deque Merge Sorting algorithm (MPDMSort) is proposed and run on a shared memory system. This algorithm contains the Multi-Deque Partitioning phase, which is a block-based parallel partitioning algorithm, and the Dual-Deque Merging phase, which is a merging algorithm without compare-and-swap operat

APA, Harvard, Vancouver, ISO, and other styles

42

Gandi, Carlo, Luigi Cosenza, Marco Campetella, et al. "What can the metaverse do for urology?" Urologia Journal, June 2, 2023, 039156032311759. http://dx.doi.org/10.1177/03915603231175940.

Full text

Abstract:

Everyone talks about the metaverse but few know what it really is. Augmented reality, virtual reality, internet of things (IoT), 5G, blockchain: these are just some of the technologies underlying the structure of the metaverse, a sort of parallel dimension in which the physical and virtual worlds merge together enabling users to interact by emerging technologies in order to enhance their actions and decisions. The healthcare scientific community is already looking at the metaverse as a new research frontier, a tool to improve medical knowledge and patient care. We reviewed the metaverse applic

APA, Harvard, Vancouver, ISO, and other styles

43

Goyal, Kapil Dev, Muhammad Raihan Abbas, Vishal Goyal, and Yasir Saleem. "Forward-backward transliteration of Punjabi Gurmukhi script using n-gram language model." ACM Transactions on Asian and Low-Resource Language Information Processing, June 9, 2022. http://dx.doi.org/10.1145/3542924.

Full text

Abstract:

Transliterating the text of a language to a foreign script is called forward transliteration and transliterating the text back to the original script is called backward transliteration. In this work, we perform both forward as well as backward transliteration on Punjabi. We transliterate Punjabi person names from Gurmukhi script to English Roman script and from English Roman script back to Gurmukhi script using n-gram language model. We used more than one million parallel entities of person names in Gurmukhi and Roman script as the training corpus. We generated English to Punjabi and Punjabi t

APA, Harvard, Vancouver, ISO, and other styles

44

Bharti, Urmil, Anita Goel, and S. C. Gupta. "ReactiveFnJ: A choreographed model for Fork-Join Workflow in Serverless Computing." Journal of Cloud Computing 12, no. 1 (2023). http://dx.doi.org/10.1186/s13677-023-00429-3.

Full text

Abstract:

AbstractFunction-as-a-Service (FaaS) is an event-based reactive programming model where functions run in ephemeral stateless containers for short duration. For building complex serverless applications, function composition is crucial to coordinate and synchronize the workflow of an application. Some serverless orchestration systems exist, but they are in their primitive state and do not provide inherent support for non-trivial workflows like, Fork-Join. To address this gap, we propose a fully serverless and scalable design model ReactiveFnJ for Fork-Join workflow. The intent of this work is to

APA, Harvard, Vancouver, ISO, and other styles

45

Shazia, Rana, and Saeed Muhammad. "PCTLHS-Matrix, Time-based Level Cuts, Operators, and unified time-layer health state Model." October 2, 2022. https://doi.org/10.5281/zenodo.7135347.

Full text

Abstract:

: This article aims to introduce a unique hypersoft time-based matrix model that organizes and classifies higher-dimensional information scattered in numerous forms and vague appearances varying on specific time levels. Classical matrices as rank-2 tensors single-handedly relate equations and variables across rows and columns are a limited approach to organizing higher-dimensional information. This Plithogenic Crisp Time Leveled Hypersoft Matrix (PCTLHS-Matrix) model is designed to sort the higher dimensional information flowing in parallel time layers as a combined view of events. This matrix

APA, Harvard, Vancouver, ISO, and other styles

46

Emilio Faroldi. "The architecture of differences." TECHNE - Journal of Technology for Architecture and Environment, May 26, 2021, 9–15. http://dx.doi.org/10.36253/techne-11023.

Full text

Abstract:

Following in the footsteps of the protagonists of the Italian architectural debate is a mark of culture and proactivity. The synthesis deriving from the artistic-humanistic factors, combined with the technical-scientific component, comprises the very root of the process that moulds the architect as an intellectual figure capable of governing material processes in conjunction with their ability to know how to skilfully select schedules, phases and actors: these are elements that – when paired with that magical and essential compositional sensitivity – have fuelled this profession since its orig

APA, Harvard, Vancouver, ISO, and other styles

47

Wallace, Derek. "'Self' and the Problem of Consciousness." M/C Journal 5, no. 5 (2002). http://dx.doi.org/10.5204/mcj.1989.

Full text

Abstract:

Whichever way you look at it, self is bound up with consciousness, so it seems useful to review some of the more significant existing conceptions of this relationship. A claim by Mikhail Bakhtin can serve as an anchoring point for this discussion. He firmly predicates the formation of self not just on the existence of an individual consciousness, but on what might be called a double or social (or dialogic) consciousness. Summarising his argument, Pam Morris writes: 'A single consciousness could not generate a sense of its self; only the awareness of another consciousness outside the self can p

APA, Harvard, Vancouver, ISO, and other styles

48

Burns, Alex. "Select Issues with New Media Theories of Citizen Journalism." M/C Journal 10, no. 6 (2008). http://dx.doi.org/10.5204/mcj.2723.

Full text

Abstract:

   “Journalists have to begin a new type of journalism, sometimes being the guide on the side of the civic conversation as well as the filter and gatekeeper.” (Kolodzy 218) “In many respects, citizen journalism is simply public journalism removed from the journalism profession.” (Barlow 181) 1. Citizen Journalism — The Latest Innovation? New Media theorists such as Dan Gillmor, Henry Jenkins, Jay Rosen and Jeff Howe have recently touted Citizen Journalism (CJ) as the latest innovation in 21st century journalism. “Participatory journalism” and “user-driven journalism” are othe

APA, Harvard, Vancouver, ISO, and other styles

49

Burns, Alex. "Select Issues with New Media Theories of Citizen Journalism." M/C Journal 11, no. 1 (2008). http://dx.doi.org/10.5204/mcj.30.

Full text

Abstract:

“Journalists have to begin a new type of journalism, sometimes being the guide on the side of the civic conversation as well as the filter and gatekeeper.” (Kolodzy 218) “In many respects, citizen journalism is simply public journalism removed from the journalism profession.” (Barlow 181) 1. Citizen Journalism — The Latest Innovation? New Media theorists such as Dan Gillmor, Henry Jenkins, Jay Rosen and Jeff Howe have recently touted Citizen Journalism (CJ) as the latest innovation in 21st century journalism. “Participatory journalism” and “user-driven journalism” are other terms to describe C

APA, Harvard, Vancouver, ISO, and other styles

50

Goldman, Jonathan E. "Double Exposure." M/C Journal 7, no. 5 (2004). http://dx.doi.org/10.5204/mcj.2414.

Full text

Abstract:

I. Happy Endings Chaplin’s Modern Times features one of the most subtly strange endings in Hollywood history. It concludes with the Tramp (Chaplin) and the Gamin (Paulette Goddard) walking away from the camera, down the road, toward the sunrise. (Figure 1.) They leave behind the city, their hopes for employment, and, it seems, civilization itself. The iconography deployed is clear: it is 1936, millions are unemployed, and to walk penniless into the Great Depression means destitution if not death. Chaplin invokes a familiar trope of 1930s texts, the “marginal men,” for whom “life on the road is

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Parallel merge sort'

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