The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Detecting spelling errors and correcting those errors automatically is a great research challenge. Developing a precise spell checker for Bangla language which detects spelling errors and provides suggestions for correcting those errors, is quite difficult because of the complex rules of Bangla spelling. In this paper, a clustering-based spell checking technique is proposed for Bangla language that...
Map images are widely used in variety applications such as personal navigation, mobile computing, internet and academia. The usage of raster maps in many applications especially in small storage devices has negative impacts because of its relatively large size. The efficient use of compression method is essential to meet such requirements. A fast lossless compression scheme for raster map images is...
Encoders based on the High Efficiency Video Coding (HEVC) standard consider an input sequence as a succession of slices grouped in Structures of Pictures (SOP). The SOP used while encoding specifies many parameters, such as the coding order of frames, or the reference frames used during inter-prediction. Reference encoders typically make use of a fixed SOP structure of a given size, which is periodically...
Industrial product design is characterized by increasing complexity due to the high number of involved parameters, objectives, and boundary conditions, all typically changing over time. Population-based evolutionary design optimization targets to solve these kinds of application problems, offering efficient algorithms striving for high-quality solutions. An important factor in the optimization setup...
Lossless image compression can preserve all information of the original image and is useful for security and medical image processing. In this paper, we apply improved adaptive arithmetic coding to further improve the coding efficiency of context-based adaptive lossless image coding (CALIC), which is a well-known lossless image compression algorithm. We apply the techniques of mutual learning, initialization...
The LOCO-I / JPEG-LS algorithm aims at providing lossless compression ratios but with a much lower algorithm complexity. Official designation of JPEG-LS is ISO-14495-1/ITU-T.87. JPEG-LS is a simple and efficient algorithm that mainly consists of two stages modeling and encoding. Thus it divides the whole compression process in two phases of spatial pixel prediction and entropy coding and uses contexts...
Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. To make termination checks scale to large systems, interprocedural termination analysis seems essential, which is a largely unexplored area of research in termination analysis, where most effort has focussed on difficult...
Hierarchical State Transition Matrix (HSTM) is a table-based modeling language that has been broadly used for developing software designs of embedded systems. In this paper, we describe a model checker Garakabu2, which we have been implementing for verifying HSTM designs against LTL properties. The HSTM designs that Garakabu2 takes as input are those developed using an industrial-strength model-based...
An increasing volume of data puts MapReduce data analytic platforms such as Hadoop under constant resource pressure. A new two-phase text compression scheme has been specially designed to accelerate data analysis and reduce cluster resource usage, and this has been implemented for Hadoop. The scheme consists of two levels of compression. The first level compression allows a Hadoop program to consume...
Communication traces help developers of high-performance computing (HPC) applications understand and improve their codes. When run on large-scale HPC facilities, the scalability of tracing tools becomes a challenge. To address this problem, traces can be clustered into groups of processes that exhibit similar behavior. Instead of collecting traces information of each individual node, it then suffices...
DNA sequencing has emerged as one of the principal research directions in systems biology because of its usefulness in predicting the provenance of disease but also has profound impact in other fields like biotechnology, biological systematic and forensic medicine. The experiments in high throughput DNA sequencing technology are notorious for generating DNA sequences in huge quantities, and this poses...
HEVC uses up to 35 prediction modes for intra prediction and it can well predict blocks with uni-directional structures or sharp edges, but the intra prediction still suffers from its discontinuous characteristics. To improve coding performance of intra prediction, the inpainting technique has been studied but it is impractical because of its high computational complexity. In this paper, we employ...
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains two main contributions: 1) We present an atomic shared-memory emulation algorithm that we call Coded Atomic Storage (CAS). This algorithm uses erasure coding methods. In a storage system with 'N' servers that...
We describe an adaptive context tree weighting (ACTW) algorithm, as an extension to the standard context tree weighting (CTW) algorithm. Unlike the standard CTW algorithm, which weights all observations equally regardless of the depth, ACTW gives increasing weight to more recent observations, aiming to improve performance in cases where the input sequence is from a non-stationary distribution. Data...
The paper presents a lossless coding method based on predictor blending approach that codes nine widely used benchmark images with the lowest average bitrate ever published. At the same time the algorithm is more time efficient than its most important competitors: TMWLEGO, MRP 0.5, and Multi-WLS. A set of 20 blended predictors is applied, including adaptive RLS/OLS ones, ALCM, CoBALP, and a texture...
The recentH.264/AVCvideo coding standard provides a higher coding efficiency than previous standards. H.264/AVCachieves a bit rate saving of more than 50 % with many new technologies, but it shows very heavy computational complexity. In this paper, a fast mode decision scheme for inter-frame coding is proposed to reduce the computational complexity for H.264/AVC video encoding system. To reduce the...
The importance of domain knowledge in the design of effective evolutionary algorithms (EAs) is widely acknowledged in the meta-heuristics community. In the last few decades, a plethora of EAs has been manually designed by domain experts for solving domain-specific problems. Specialization has been achieved mainly by embedding available domain knowledge into the algorithms. Although programming libraries...
Bit Plane Coding (BPC) is an important component of the EBCOT block in JPEG2000 encoder. This paper introduced new algorithm for neighboring significance contribution and Run Length Coding (RLC). The paper also presented a fast word level sequential scheme and parallel architecture for bit plane coding. Bit plane coding adopted by EBCOT is mainly divided into three stages: significance generation,...
As a new international standard for still image compression, JPEG2000 has many advantages, but the high complexity of its computation limits greatly its efficiency and applications. EBCOT's Tier-1 is the most computationally intensive part of the JPEG2000 image coding, it scans a bit-plane three times to code the bit-plane, wasting evidently the coding time. Thus some people have proposed pass-parallel...
Constraints in form regular expressions over strings are ubiquitous. They occur often in programming languages like Perl and C#, in SQL in form of LIKE expressions, and in web applications. Providing support for regular expression constraints in program analysis and testing has several useful applications. We introduce a method and a tool called Rex, for symbolically expressing and analyzing regular...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.