The Experts below are selected from a list of 8523 Experts worldwide ranked by ideXlab platform
Antra Banerjee - One of the best experts on this subject based on the ideXlab platform.
-
A novel Huffman coding based approach to reduce the size of large data Array
2016 International Conference on Circuit Power and Computing Technologies (ICCPCT), 2016Co-Authors: Subhra J. Sarkar, Nabendu Kr. Sarkar, Antra BanerjeeAbstract:While dealing with large data Array required in various applications, the memory required for the data storage and data transfer of that bulk data becomes difficult. If the Array size can be reduced without losing the data, the problem of storage and data transfer can be avoided. In this paper, a Huffman Coding based data compression algorithm is proposed and tested in MATLAB environment which will significantly reduce the size of one dimensional data Array. Though the algorithm is tested with number Array only, the algorithm can be extended to be applied with Character Array with slight modification.
Subhra J. Sarkar - One of the best experts on this subject based on the ideXlab platform.
-
A novel Huffman coding based approach to reduce the size of large data Array
2016 International Conference on Circuit Power and Computing Technologies (ICCPCT), 2016Co-Authors: Subhra J. Sarkar, Nabendu Kr. Sarkar, Antra BanerjeeAbstract:While dealing with large data Array required in various applications, the memory required for the data storage and data transfer of that bulk data becomes difficult. If the Array size can be reduced without losing the data, the problem of storage and data transfer can be avoided. In this paper, a Huffman Coding based data compression algorithm is proposed and tested in MATLAB environment which will significantly reduce the size of one dimensional data Array. Though the algorithm is tested with number Array only, the algorithm can be extended to be applied with Character Array with slight modification.
Nabendu Kr. Sarkar - One of the best experts on this subject based on the ideXlab platform.
-
A novel Huffman coding based approach to reduce the size of large data Array
2016 International Conference on Circuit Power and Computing Technologies (ICCPCT), 2016Co-Authors: Subhra J. Sarkar, Nabendu Kr. Sarkar, Antra BanerjeeAbstract:While dealing with large data Array required in various applications, the memory required for the data storage and data transfer of that bulk data becomes difficult. If the Array size can be reduced without losing the data, the problem of storage and data transfer can be avoided. In this paper, a Huffman Coding based data compression algorithm is proposed and tested in MATLAB environment which will significantly reduce the size of one dimensional data Array. Though the algorithm is tested with number Array only, the algorithm can be extended to be applied with Character Array with slight modification.
Cameron Mura - One of the best experts on this subject based on the ideXlab platform.
-
Strings in Python: anatomy and basic behavior.
2016Co-Authors: Berk Ekmekci, Charles E. Mcanany, Cameron MuraAbstract:The anatomy and basic behavior of Python strings are shown, as samples of actual code (left panel) and corresponding conceptual diagrams (right panel). The Python interpreter prompts for user input on lines beginning with >>> (leftmost edge), while a starting … denotes a continuation of the previous line; output lines are not prefixed by an initial Character (e.g., the fourth line in this example). Strings are simply Character Array objects (of type str), and a sample string-specific method (replace) is shown on line 3. As with ordinary lists, strings can be ‘sliced’ using the syntax shown here: the first list element to be included in the slice is indexed by start, and the last included element is at stop-1, with an optional stride of size step (defaults to one). Concatenation, via the + operator, is the joining of whole strings or subsets of strings that are generated via slicing (as in this case). For clarity, the integer indices of the string positions are shown only in the forward (left to right) direction for mySnake1 and in the reverse direction for mySnake2. These two strings are sliced and concatenated to yield the object newSnake; note that slicing mySnake1 as [0:7] and not [0:6] means that a whitespace char is included between the two words in the resultant newSnake, thus obviating the need for further manipulations to insert whitespace (e.g., concatenations of the form word1+' '+word2).
Berk Ekmekci - One of the best experts on this subject based on the ideXlab platform.
-
Strings in Python: anatomy and basic behavior.
2016Co-Authors: Berk Ekmekci, Charles E. Mcanany, Cameron MuraAbstract:The anatomy and basic behavior of Python strings are shown, as samples of actual code (left panel) and corresponding conceptual diagrams (right panel). The Python interpreter prompts for user input on lines beginning with >>> (leftmost edge), while a starting … denotes a continuation of the previous line; output lines are not prefixed by an initial Character (e.g., the fourth line in this example). Strings are simply Character Array objects (of type str), and a sample string-specific method (replace) is shown on line 3. As with ordinary lists, strings can be ‘sliced’ using the syntax shown here: the first list element to be included in the slice is indexed by start, and the last included element is at stop-1, with an optional stride of size step (defaults to one). Concatenation, via the + operator, is the joining of whole strings or subsets of strings that are generated via slicing (as in this case). For clarity, the integer indices of the string positions are shown only in the forward (left to right) direction for mySnake1 and in the reverse direction for mySnake2. These two strings are sliced and concatenated to yield the object newSnake; note that slicing mySnake1 as [0:7] and not [0:6] means that a whitespace char is included between the two words in the resultant newSnake, thus obviating the need for further manipulations to insert whitespace (e.g., concatenations of the form word1+' '+word2).