Reusability of project components, either at the code level or at the conceptual specification level, is considered a fundamental aspect in application development. More recently it as been argued that project histories can support reuse of design decisions. We propose a solution based on so-called process chunks which are generic process frames to resolve the issue stated by a generic requirem...

We consider downlink OFDMA in which users are imposed with different proportional-rate constraints, and a base station would like to maximise user rate over subcarrier assignment (SA) and power allocation (PA). To attain the objective, we propose a chunk-based SA and low-complexity PA algorithms. Numerical results show that the proposed SA and PA can provide higher average minimum achievable ra...

Since sub-sentential alignment is critically important to the translation quality of an ExampleBased Machine Translation (EBMT) system, which operates by finding and combining phrase-level matches against the training examples, we developed a new alignment algorithm for the purpose of improving the EBMT system’s performance. This new Symmetric Probabilistic Alignment (SPA) algorithm treats the ...

To understand the contribution of the human pre-supplementary motor area (pre-SMA) in sequential motor behavior, we performed a series of finger key-press experiments. Experiment 1 revealed that each subject had a spontaneous tendency to organize or “chunk” a long sequence into shorter components. We hypothesized that the pre-SMA might have a special role in initiating each chunk but not at oth...

Loops are the largest source of parallelism in many applications. All prior DOALL loop scheduling algorithms such as Self-Scheduling, Guided Self-Scheduling, Trapezoid Self-Scheduling, and Factoring try to achieve workload balance through decreasing chunk sizes. Moreover, they have been analyzed only for shared memory platforms. In this work, the prior loop scheduling methods will be evaluated ...

1. Introduction Content addressable storage (CAS) is an emerging mechanism that can reduce the costs associated with this volume of data by eliminating such redundancy. Essentially, CAS uses cryptographic hashing techniques to identify data by its content rather than by name. Consequently, a CAS-based system will identify sets of identical objects and only store or transmit a single copy even i...

After doing research on Google File System, we find out some methods to improve the performance of Google file system. Google File System is a scalable distributed file system for large size distributed data-intensive applications. It provides high fault tolerance while running on inexpensive commodity hardware and it delivers high aggregate performance to a large number of clients. But there a...

Chunking consists in grouping items of a sequence into small clusters, named chunks, with the assumed goal of lessening working memory load. Despite extensive research, the current methods used to detect chunks, and to identify different chunking strategies, remain discordant and difficult to implement. Here, we propose a simple and reliable method to identify chunks in a sequence and to determ...

Machine Translation systems expect target language output to be grammatically correct within the frame of proper grammatical category. In Myanmar-English statistical machine translation system, the target language output (English) can often be ungrammatical. To solve this need, we propose an ongoing chunk-based grammar checker for translated English sentences. Most of the typical grammar checke...

The taste of this particular chunk of fresh pineapple, the one which I am just now eating, is scrumptious. That taste is something the chunk has in common with other such chunks, like the one I had a few seconds ago and the one I will have in a few seconds time. The taste of this pineapple chunk is thus a feature, a property,which this and various other chunksof pineapple share. Now, intuitivel...