Code String Research Articles

Geometrical Fusion Based on Chain Code Representation

In this paper, a new geometrical image fusion method introduced by using the representation of chain code for the image objects that been matched among the images to be fused. The input images are separated into number of objects. A matching method is applied to extract the matching objects from the overall objects that included in the origin images. Then the chain code string is calculated for each one. The run length encoding is applied on that code strings to reduce the space that required. The image resulted from the geometrical fusion is more informative which contain the more important features those included in the origin images.

A Novel Content Based Image Retrieval Based on a New Approach of Color String Coding and Meta-Heuristic Algorithms

A Novel Content Based Image Retrieval Based on a New Approach of Color String Coding and Meta-Heuristic Algorithms

Remote Sensing Image Registration Based on Improved KAZE and BRIEF Descriptor

Remote sensing image registration is still a challenging task owing to the significant influence of nonlinear differences between remote sensing images. To solve this problem, this paper proposes a novel approach with regard to feature-based remote sensing image registration. There are two key contributions: 1) we bring forward an improved strategy of composite nonlinear diffusion filtering according to the scale factors in multi-scale space and 2) we design a gradually decreasing resolution of multi-scale pyramid space. And a binary code string is served as feature descriptors to improve matching efficiency. Extensive experiments of different categories of remote image datasets on feature extraction and feature registration are performed. The experimental results demonstrate the superiority of our proposed scheme compared with other classical algorithms in terms of correct matching ratio, accuracy and computation efficiency.

User Preference Adaptive Fitness of Interactive Genetic Algorithm Based Ceramic Disk Pattern Generation Method

Pattern design in real life is a complex optimization challenge that objective function can not express explicitly, and can be classified as an implicit target optimization problem. Owing to the fact that the objective function in implicit target optimization problem can not be completely structured, the traditional intelligent decision optimization method is inapplicable. This paper proposes an interactive genetic algorithm based on user preference adaptive fitness, in which users actively participate in optimization and take their subjective evaluation value as the adaptive fitness of evolutionary individuals. On the basis of adjusting the tone coordination degree of ceramic disc pattern, the improved method gives the calculation of user interest degree and style similarity, and completes the establishment of user preference model. The individual similarity calculation of the algorithm integrates the user preference information, making the calculation result more objective. In the experiment, the grain genes of ceramic disc pattern can be divided into two types: main body and border, both of which can be encoded by 16-bit binary code strings. And the weight values of style, tone collocation and structure were set respectively, and the ceramic disc patterns of modern fashion and fresh styles were obtained. In addition, the algorithm performance comparison is also completed. The experimental results show that with the progress of evolution, the midpoint and average width of the fitness of the population decrease, and the population quality is improved. Our algorithm can generate ceramic disc patterns of different styles, and the algorithm can obtain more satisfactory solutions in less evolutionary generations, which speeds up the algorithm's convergence speed and shows better evolutionary optimization ability.

M-ABRC (Adaptive Binary Range Coder) using Virtual Sliding Window technique and its VLSI implementation

Arithmetic coding is the data compression techniques, which encodes the data by generating the code string that represents a functional value between 0 and 1. In this paper, we propose a modified-Adaptive Binary-RC (Range Coder) or M-ABRC. Our algorithm minimizes the multiplication bit capacity through introducing the VLSI architecture, proposed algorithm uses the LUP (Look UP Table)-VSW (Virtual Sliding Window) for the probability estimation. In order to achieve the higher compression rate, our method M-ABRC has been implemented, this in terms provides the better adoption probability in encoding phase and also gives the absolute estimation of low-EBS(entropy binary sources). Moreover In order to evaluate the algorithm we have compared with the several existing technique, comparison takes place based on the two parameter i.e. device utilization and the power dissipation (static and dynamic).

Comparison study of Fibonacci code algorithm and Even-Rodeh algorithm for data compression

The need for greater storage capacity is the cause of various compression techniques. By compressing, large data will be reduced in size to save storage capacity. This research will use Even-Rodeh code algorithm and Fibonacci code algorithm to compress the data. The performance of algorithms will be measured by Bitrate, Compression Ratio, Space Saving, and Compression Time (millisecond) and Time Decompression (millisecond). Compression is done by reading String in the text file, then Even-Rodeh Code algorithm and Fibonacci code algorithm create String code and perform compression process. The result of compression is the file with extension *. C and *. Fib which contains character information and String Bit. The results of compression can be decompressed to the original text file. The system test used a sample of Strings consisting of one type of character (Homogen String) and String comprising more than one kind of character (Heterogenous String) is stored in the text file by extension * .doc, * .docx, * .pdf. From the compression process on the homogenous String, the Fibonacci code algorithm is more efficient about the compression ratio of 0.25 and decompression time is 0.011 milliseconds compared with the Even-Rodeh code algorithm. While in the compression process on heterogeneous String Fibonacci Code algorithm is better than the Even-Rodeh code algorithm with an average Compression Ratio of 0.65 and decompression time faster with an average of 0.293 milliseconds.

Sets of Pictures Avoiding Overlaps

A string set avoids overlaps if it has the property that the prefix of each string in the set does not coincide with the suffix of any string in the set. The problem of avoiding overlaps in strings is extensively investigated since it plays an important role in the context of string matching and coding. The notion of overlap can be extended naturally to two dimensions; two pictures [Formula: see text] and [Formula: see text] have an overlap if one can put one corner of [Formula: see text] on some position in [Formula: see text] in such a way that all symbols in the common positions coincide. A picture with no self-overlaps is called unbordered and it is a generalization in two dimensions of an unbordered (or bifix-free) string.We first investigate the problem of generating all unbordered pictures of fixed size. Then, we study particular sets of unbordered pictures that are non-overlapping each others. We show that the frame of the pictures has a special role in defining these sets. In particular, we prove that there exist kinds of synchronization frames that can be put around the pictures of any set to make it non-overlapping. Finally, we present a construction of non-expandable non-overlapping sets of pictures which starts from some property of frame-completeness.

Intensification of Lempel-ZIV-Welch Algorithm

There is a necessity to reduce the consumption of exclusive resources. This is achieved using data compression. The data compression is one well known technique which can reduce the file size. A plethora of data compression algorithms are available which provides compression in various ratios. LZW is one of the powerful widely used algorithms. This paper attempts to propose and apply some enhancements to LZW, hence comes out with an efficient lossless text compression scheme that can compress a given file at better compression ratio. The paper proposes three approaches which practically enhances the original algorithm. These approaches try to gain better compression ratio. In approach1, it exploits the notion of using existing string code with odd code for a newly encounter string which is reverse of existing. In approach2 it uses a choice of code length for the current compression, so avoiding the problem of dictionary overflow. In approach3 it appends some selective set of frequently encountered string patterns. So the intensified LZW method provides better compression ratio with the inclusion of the above features.

Chinese Syntax Parsing Based on Sliding Match of Semantic String

Different from the current syntax parsing based on deep learning, we present a novel Chinese parsing method, which is based on Sliding Match of Semantic String (SMOSS). (1) Training stage: In a treebank, headwords of tree nodes are represented by semantic codes given in the Synonym Dictionary (Tongyici Cilin). N-gram semantic templates are extracted from every layer of a syntax tree by means of sliding window to establish one N-gram semantic template library. (2) Parsing stage: Words of a sentence, including headwords of chunks, are represented by the semantic codes from Tongyici Cilin. With the sliding window method, N-gram semantic code strings are extracted to match with the templates in the N-gram semantic template library; subsequently, the mapping information of the matched templates is employed to guide the chunking of semantic code strings. The Chinese syntax parsing is completed through continuous matching and chunking. On the same training scale, N-gram semantic template can create favorable conditions for flexible matching and improve the syntax parsing performance. With train and test sets from the Tsinghua Chinese Treebank (TCT), the results are F1-score 99.71% (closed test) and F1-score 70.43% (open test), respectively.

Source code properties of defective infrastructure as code scripts

Context: In continuous deployment, software and services are rapidly deployed to end-users using an automated deployment pipeline. Defects in infrastructure as code (IaC) scripts can hinder the reliability of the automated deployment pipeline. We hypothesize that certain properties of IaC source code such as lines of code and hard-coded strings used as configuration values, show correlation with defective IaC scripts. Objective: The objective of this paper is to help practitioners in increasing the quality of infrastructure as code (IaC) scripts through an empirical study that identifies source code properties of defective IaC scripts. Methodology: We apply qualitative analysis on defect-related commits mined from open source software repositories to identify source code properties that correlate with defective IaC scripts. Next, we survey practitioners to assess the practitioner's agreement level with the identified properties. We also construct defect prediction models using the identified properties for 2,439 scripts collected from four datasets. Results: We identify 10 source code properties that correlate with defective IaC scripts. Of the identified 10 properties we observe lines of code and hard-coded string to show the strongest correlation with defective IaC scripts. Hard-coded string is the property of specifying configuration value as hard-coded string. According to our survey analysis, majority of the practitioners show agreement for two properties: include, the property of executing external modules or scripts, and hard-coded string. Using the identified properties, our constructed defect prediction models show a precision of 0.70~0.78, and a recall of 0.54~0.67.

A binary method of multisensor image registration based on angle traversal

Registration is a key step in image preprocessing. Absorbing the binary idea of BRIEF, we took all the feature points as a whole and generated a new binary descriptor that was irrelevant to the gray of the neighborhood of a feature point in the registration of visible light with infrared images. For each selected feature point, we constructed a circular area centered on it and divided the circumference equally as the sampling interval of the feature points. We then traversed all the intervals and built a binary code string as a descriptor for the feature point according to the relative position of the feature point. During the process of angle traversal, the Hamming distance was applied to identify the most similar descriptor pair. We then adopted an improved clustering algorithm to eliminate mismatched pairs. Experiments have demonstrated that this kind of descriptor has high accuracy and robustness for multisensor remote-sensing images. In particular, when dealing with the combination of visible and far-infrared images with local grayscale inversion, registration can also be accomplished well.

Assessing lexical similarity between short sentences of source code based on granularity

Detecting similarity between two source code bases or inside one code base has many applications in the area of plagiarism detection and reused code which is manageable for refactoring. In this paper, State of the art techniques: Levenshtein Distance, Cosine Similarity, Hamming Distance and ASCII based hashing and Rabin–Karp rolling hashing have been investigated on source code strings, which is an extended work to already published research work. From experimentation, it has been observed that Rabin–Karp hashing performs better than other techniques in terms of running time, accuracy and type-of-clones. All techniques face one issue of increase in similarity searching time linearly with database size, whereas Rabin–Karp hashing handled this issue efficiently. Moreover, Rabin–Karp rolling hash method reported minimum false positives and it is also able to manage multiple patterns at a time.

FPGA-based redundancy bits reduction algorithm using the enhanced error detection correction code

To ensure an error-free transmission in packet switching, additional check bits (either header or a payload) are typically appended to the input data of a message for error detection especially in a string of binary code. Normally, it comes from the input message and as a result of a deterministic algorithm after these data have been processed. The receiver system implements the said algorithm, while the transmitter used it to match the reliability of the sent information and detects whether an error bit has occurred or not. The corrupted bits will be corrected, recovered, and matched with the original message. To further improve the detection and correction of the corrupted transmitted bits, an enhanced error detection correction code implementation was proposed and developed in this paper. This will improve the limitations of using cyclic redundancy checking (CRC) code and Hamming code, by reducing the number of the redundancy bits ‘r’ in CRC due to the needed polynomial generator, and the overhead of interspersing of the r in conventional Hamming code, respectively. Xilinx Spartan 6 (XC7Z020-2CLG4841) FPGA was used to synthesize the proposed enhanced error detection code (EEDC) method. Based on the results, the transmission rate is faster, and an increase in detection of random errors compared with using CRC and Hamming codes.

A Mathematical Theory of Language

Modern linguistics cannot define and identify the best or standard pronunciations, writing and grammar. The choice and decision of sole human unified standard official or common language cannot be solved by modern linguistics generally. The current linguistics is no longer met the human developments because it can’t answer what the best language is. The sole unified standard official global English cannot appear because of English linguistic level and shortcoming mainly. English linguistics comes to predominate in the contemporary era. Negating and improving the current linguistics must be negated and improved English linguistics first. The finite numerals are expressed infinite quantities in the mathematics. The finite sounds are represented the infinite meanings in the language. The theory and method are almost same in the mathematics and linguistics generally. The linguistics is a branch or concrete application of information theory (IT). IT is based on the probability theory and statistics generally. A meaning is often certain code, string of codes or mathematical value in the language. Defining or explaining certain meaning of language is measured and calculated a mathematical value actually. A subsystem or subtopic such as language teaching is often based on the general linguistics.

British Society for Gene and Cell Therapy Annual Conference and Joint UK Regenerative Medicine Platform Meeting Royal Welsh College of Music & Drama Cardiff, Wales, United Kingdom Wednesday April 19-Friday April 21, 2017 Conference Abstracts.

British Society for Gene and Cell Therapy Annual Conference and Joint UK Regenerative Medicine Platform Meeting Royal Welsh College of Music & Drama Cardiff, Wales, United Kingdom Wednesday April 19-Friday April 21, 2017 Conference Abstracts.

Stochastic Multiview Hashing for Large-Scale Near-Duplicate Video Retrieval

Near-duplicate video retrieval (NDVR) has been a significant research task in multimedia given its high impact in applications, such as video search, recommendation, and copyright protection. In addition to accurate retrieval performance, the exponential growth of online videos has imposed heavy demands on the efficiency and scalability of the existing systems. Aiming at improving both the retrieval accuracy and speed, we propose a novel stochastic multiview hashing algorithm to facilitate the construction of a large-scale NDVR system. Reliable mapping functions, which convert multiple types of keyframe features, enhanced by auxiliary information such as video-keyframe association and ground truth relevance to binary hash code strings, are learned by maximizing a mixture of the generalized retrieval precision and recall scores. A composite Kullback-Leibler divergence measure is used to approximate the retrieval scores, which aligns stochastically the neighborhood structures between the original feature and the relaxed hash code spaces. The efficiency and effectiveness of the proposed method are examined using two public near-duplicate video collections and are compared against various classical and state-of-the-art NDVR systems.

Resolution enhancement of digital laser scanning fluorescence microscopy with a dual-lens optical pickup head

The resolution of the cell fluorescence image captured by a digital laser scanning microscopy with a modified dual-lens BD-ROM optical pickup head is enhanced by image registration and double sample frequency. A dual objective lens of red (655 nm) and blue (405 or 488 nm) laser sources with numerical apertures of 0.6 and 0.85 is used for sample focusing and position tracking and cell fluorescence image capturing, respectively. The image registration and capturing frequency are based on the address-coded patterns of a sample slide. The address-coded patterns are designed as a string of binary code, which comprises a plurality of base-straight lands and grooves and data-straight grooves. The widths of the base-straight lands, base-straight grooves, and data-straight grooves are 0.38, 0.38, and 0.76 μm, respectively. The numbers of sample signals in the x-direction are measured at every intersection point by intersecting the base intensity of the push–pull signal of the address-coded patterns, which has a minimum spacing of 0.38 μm. After taking a double sample frequency, the resolution of the measured cell fluorescence image is enhanced from 0.38 μm to the diffraction limit of the objective lens.

Picture codes and deciphering delay

A set X of pictures over an alphabet Σ is a code if any picture over Σ is tilable in at most one way with pictures in X. The codicity problem is in general undecidable. Recently, the prefix picture codes were introduced as a decidable subclass of codes that generalize the prefix string codes. In the string theory, the finite deciphering delay sets are some interesting codes which coincide with the prefix codes when the delay is equal to 0. An analogous notion is introduced for the picture codes and it is proved that the codes with deciphering delay k form a decidable class of picture codes which includes interesting examples and special cases.

New insights into the neural network mediating reading processes provided by cortico-subcortical electrical mapping.

To ascertain the neural network mediating reading using intraoperative electrostimulation. A cortical and axonal intraoperative electrical mapping of reading processes was achieved in seven patients who underwent awake surgery for a left occipitotemporal glioma. We performed resection cavity overlapping and superimposition with a diffusion tensor imaging-based white matter atlas. We assessed the relationship between the location of resection cavities and the occurrence of reading impairments of regular, irregular, and pseudowords. Intraoperative stimulation of the left posterior inferior temporal cortex (ITCp) elicited reading disturbances. Subcortical stimulation at the anterior portion of the visual word form area (VWFA) induced addressed phonology (irregular words reading) disturbances. Subcortical stimulation of the connection between VWFA and the posterior segment of the arcuate fascicle (AFp) induced both addressed and assembled phonology (irregular and pseudowords reading) disturbances. Postoperative assessment showed that resection of the posterior portion of the inferior longitudinal fascicle (ILFp), connecting the visual cortex to VWFA, induced long-term and global reading impairment. Resection of the terminations of left AFp in the ITCp-induced irregular and pseudowords reading disturbances with no impairment of regular words reading. Resection of the anterior portion of ILF did not induce reading impairment. Our data support an inner posterior-to-anterior hierarchical coding of letter strings in the VWFA and a crucial role of the left ILFp to provide visual inputs to the VWFA. Furthermore, we suggest that the AFp is involved in an interactive feedback system between visual and nonvisual information, recruited when reading irregular and pseudowords.

Content Based Image Retrieval Using Colour Strings Comparison

Content Based Image Retrieval (CBIR) is a technique that enables a user to extract an image based on a query, from a database containing a large amount of images. A very fundamental issue in designing a content based image retrieval system is to select the image features that best represent the image contents in a database. In this paper, our proposed method mainly concentrated on database classification and efficient image representation. We present a method for content based image retrieval based on support vector machine classifier. In this method the feature extraction was done based on the colour string coding and string comparison. We succeed in transferring the images retrieval problem to strings comparison. Thus the computational complexity is decreases obviously. The image database used in our experiment contains 1800 colour images from Corel photo galleries. This CBIR approach has significantly increased the accuracy in obtaining results for image retrieval.