Search

Copyright of Chinese Journal of Network & Information Security is the property of Beijing Xintong Media Co., Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Efficient algorithms for online string pattern matching have been deemed crucial for cloud database retrieval. However, the potential leaking of search content has been recognized as a threat to users' privacy. Existing string pattern matching algorithms have not been designed to consider the protection of users' search content. Although searchable encryption schemes can protect users' search content, they have been associated with high index construction costs and inefficient retrieval. Two pattern matching algorithms were proposed to protect users' search content: PMDPF (pattern matching based on distributed point function) and JPMDPF (jumping pattern matching based on distributed point function). In the PMDPF algorithm, a pattern string was provided to protect the search content, and a distributed point function combined with a fingerprint function was utilized to construct true value tables, which were then sent to two independent servers. Character comparison operations were transformed into table lookup operations to conceal the characters that needed to be checked. To enhance search efficiency, a jump pattern matching algorithm (JPMDPF) was proposed, based on the distributed point function. In this approach, character skipping was employed to induce the JPMDPF algorithm, which achieved a significant improvement in search efficiency over the PMDPF algorithm, albeit with the trade-off of revealing more information. On average, the search efficiency of JPMDPF was increased by approximately m-fold, where m represented the length of the pattern string. Concurrently, there was a significant reduction in the probability of misjudgments due to collisions within the fingerprinting function. The experimental results demonstrate that the search efficiency of the PMDPF algorithm is approximately 5% higher than that of the classical algorithm based on the fingerprint function. It outperforms existing searchable encryption schemes. The search time of the PMDPF algorithm is found to be 4.2 times that of JPMDPF when the length of the search content is 4.

In order to solve the problem of difficult color matching and low efficiency in spinning, dyeing and finishing and other fields, based on the actual industrial situation, the three primary colors mixing mode was used to build a full-color gamut color matching stereo with three-dimensional changes in hue, chroma and lightness. The intermediate gray was defined as the basis for constructing the color balance of the three primary colors of gray plane. The color of grid points on each gray plane was prepared by mixing the three primary colors. Based on the color matching stereo of the full-color gamut, nylon color card proofing was carried out for 14 grid points on the gray plane, and surface fitting method was used to correlate the coordinates of the color stereo, the color value of the real sample and the dye formula, so hat the dye formula corresponding to the color value of the grid points under any precision of the color stereo can be obtained. A case was used to test the good formula prediction effect of full-color gamut color matching stereo. The research results lay a foundation for customized digital color matching model, and provide a feasible innovative idea to break through the bottleneck of computer color matching at this stage. [ABSTRACT FROM AUTHOR]

Copyright of Wool Textile Journal is the property of National Wool Textile Science & Technology Information Center and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Mechanical Engineering is the property of Editorial Board of China Mechanical Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Objectives: Aiming at the matching problem of unmanned aerial vehicle（UAV） thermal infrared images and optical satellite images, a deep local feature matching method based on heterogeneous landmark dataset for learning is proposed. Methods: Firstly, the gray distribution law of thermal infrared images and visible images is learned by the generative adversarial network, and the landmark dataset consisting of thermal infrared images for feature extraction model training is synthesized. Secondly, the deep invariant features are learned from the multi-modal landmark dataset by the residual network and attention mechanism. Finally, correct matching points of image pairs are obtained by matching and purifying the invariant features. Results: The performance of this method was tested experimentally and compared with KAZE, detect- and-describe network and deep local features. The results show that the adaptability of this method to the grayscale, texture, overlap rate and geometric variations is stronger, and the matching efficiency of this method is higher. Conclusions: The effectiveness of this method is proved through multiple sets of experiments. Therefore, the UAV visual navigation is provided support for. [ABSTRACT FROM AUTHOR]

Copyright of Forensic Science & Technology is the property of Institute of Forensic Science, Ministry of Public Security and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to accurately analyze the stress of CO2 flooding injection string, it is necessary to consider the phase distribution of CO2 fluid in the injection string, and reasonably predict the temperature field and pressure field distribution of CO2 flooding injection string. Firstly, the coupling differential equations of temperature, pressure and physical parameters of CO2 flooding injection string were established by three conservation laws. Then, according to the calculation steps of fourth-order Runge Kutta algorithm, MATLAB program was compiled to analyze the temperature field and pressure field of four CO2 flooding injection strings in an oilfield. Finally, the sensitivity factors of temperature field and pressure field distribution of CO2 flooding injection string were analyzed. The results indicate that in the process of CO2 flooding injection, the temperature and pressure of CO2 flooding injection string increase approximately linearly with the increase of formation depth. The fluid temperature exceeds the critical temperature by 31.1 °C after 1-100 m of the string, and the phase state of CO2 fluid changes to supercritical state. The temperature field distribution of injection string is most significantly affected by the injection rate of CO2 fluid, and its sensitivity coefficient reaches 3.10. The pressure field distribution of injection string is most significantly affected by the injection pressure of CO2 fluid, and its sensitivity coefficient reaches 6.00. [ABSTRACT FROM AUTHOR]

Copyright of China Mechanical Engineering is the property of Editorial Board of China Mechanical Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Ordnance Industry Automation is the property of Editorial Board for Ordnance Industry Automation and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Complex event processing is a technology for analyzing the event streams in a dynamic environment. Complex event processing technology is usually implemented based on finite state automaton. During the matching process, a large number of overlapping partial matches will be generated by the event stream. The finite state automaton needs to maintain a large number of repeated matching states, which leads to the problem of redundant calculation in the methods based on this technology. In order to improve the matching efficiency of complex event processing, this paper proposes a method of using complex event instance coverage technology to realize complex event processing. By designing a temporary matching chain partition storage structure and matching algorithms based on this structure, redundant calculations can be reduced using complex event instance coverage, thereby achieving an improvement in matching efficiency. Experiments are performed on simulated and real datasets, and compared with two commonly used complex event processing technologies. The experimental results show that the proposed method can effectively reduce the redundant computation in the matching process while ensuring the correctness of the matching, and improve the overall matching efficiency. [ABSTRACT FROM AUTHOR]

Copyright of Petroleum Geology & Recovery Efficiency is the property of Petroleum Geology & Recovery Efficiency and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Railway Investigation & Surveying is the property of Railway Investigation & Surveying Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Dynamic time warping distance can measure unequal time series and has high matching accuracy, so time series pattern matching can use it. However, its high computational complexity restricts its application in large-scale data sets. Inorder to balance the measurement results and computational complexity of time series pattern matching, this paper pointed out a time series pattern matching method based on feature point landmark filtering. Firstly, it proposed a feature extraction method for feature point landmark filtering, which retained the main features of the time series and compressed the time dimension. Then, feature sequence used dynamic time warping distance for similarity measurement. Finally, the method was validated on the application data set. Experimental results show that the method can effectively reduce the computational complexity while ensuring high accuracy. [ABSTRACT FROM AUTHOR]

Traditional cache algorithms have problems such as low hit rate and high exchange rate. And the existing caching algorithm is not applicable in the distributed big data storage system. This paper proposed an adaptive caching strategy based on frequent sequence mining. This method used a data mining algorithm to mine the frequent sequences in the historical access window, and merged the frequent sequences to construct a set of matching patterns for query. When a new access coming, matched the subsequence within the fixed access length with the matching pattern set, and then prefetched the data according to the matching result, and combined with the modified S4 LRU (4-segmented least recently used) data structure for cache data exchange out. This paper conducted simulation experiments on the public big data processing trace set. The experimental results show that, under different cache sizes, compared with the existing typical cache algorithms, the proposed algorithm increases the average hit rate by 0.327 times and the average exchange rate reduces by 0.33 times, at the same time has the characteristics of low overhead and high time efficiency. This result shows that the proposed method is a more effective caching strategy than the traditional replacement algorithm. [ABSTRACT FROM AUTHOR]

Copyright of China Textile Leader is the property of China Textile Information Center and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Existing research on dynamic subgraph matching ignores the time information in the pattern graph, which makes it difficult for users to obtain the real results they want to query. In response to this situation, this paper designed a simple intermediate result storage format, and stored the matching results directly in the data graph as a graph. Then it improved the edge transition model, quickly and incrementally maintained intermediate result when the data graph had edges inserted/ deleted and reported the results. Finally, it designed a time-respecting graph pattern matching algorithm by the edge transition model, which improved the efficiency of matching search. Experimental evaluation on real network traffic data and comprehensive social flow data show that the algorithm can effectively reduce the execution time and space cost of graph pattern matching. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Jilin University (Science Edition) / Jilin Daxue Xuebao (Lixue Ban) is the property of Zhongguo Xue shu qi Kan (Guang Pan Ban) Dian zi Za zhi She and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The Dong brocade pattern is an important part of the national brocade in Dong people, it was the direct embodiment of the cultural connotation of the Dong nationality. In order to inherit Dong brocade better in the process of modernization and humanism, endow the Dong nationality culture with new vitality, in this paper, the Dong brocade was selected as the object of study, and the artistic characteristics of the Dong brocade pattern were analyzed from the decorative art, plastic arts, composition art, color matching art, which was applied with modern technology such as 3D printing, laser engraving technology, modern Batik process. The application form and innovative design method of Dong brocade pattern in clothing were explored, which endow new thinking for the inheritance and application of the art of Dong brocade pattern. [ABSTRACT FROM AUTHOR]

Copyright of China Textile Leader is the property of China Textile Information Center and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Pattern matching under the nonoverlapping condition is one of many pattern matching algorithms for gap constraint problems. Although it is proved that pattern matching under the nonoverlapping condition is a polynomial time complexity problem and an effective solving algorithm is proposed, the current solving algorithm adopts offline calculation, which has the disadvantage of high spatial complexity. In order to solve this problem, this paper designs an online solving algorithm. The algorithm reads the sequence string and finds the root-leaf path in the flow net tree that meets the constraint conditions, which realizes fast pruning of useless nodes and thus speeds up the matching speed. Compared with the spatial complexity of the offline algorithm, the spatial complexity of the online algorithm is O(m×maxlen×W), where m, maxlen, and W represent the pattern string length, the maximum pattern length constraint and the maximum gap constraint, respectively. Experimental results not only verify the completeness of our proposed algorithm, but also demonstrate that it consumes less memory than the existing algorithm. [ABSTRACT FROM AUTHOR]

The traditional mobile user location prediction method has a problem of low prediction accuracy due to unreasonable calculation of support. To overcome these challenges, this paper presented a method called mining user mobile rule based on pattern matching degree and location prediction. It can predict location with the base coverage mesh as the unit for mobile users in mobile communication systems. The detailed procedure contained three phases: a) mining user mobile patterns from graph traversal; b) generating user mobile rules from user mobile patterns; c) predicting based on user mobile rules. Finally, the conducted experiments on 10 batches of trajectory data demonstrate that this method has the characteristics of fewer rules, higher support, and higher confidence than traditional methods, and highly predict accuracy. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Harbin Institute of Technology. Social Sciences Edition / Haerbin Gongye Daxue Xuebao. Shehui Kexue Ban is the property of Harbin Institute of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal on Communication / Tongxin Xuebao is the property of Journal on Communications Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Natural Gas Industry is the property of Natural Gas Industry Journal Agency and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

For the integral prefabricated steel-concrete composite girder bridge, an optimized design model for the section parameters of the steel box girder is established based on the combination of area matching and full stress method. By using MATLAB to optimize the steel box girder of the composite continuous girder bridge, a preliminary optimization value corresponding to the cross-section design parameters of different span steel box girder is proposed. The results show that this algorithm uses discrete steel box girder cross section dimensional variables to generate an area database. The embedding the area matching process in the iterative process can effectively improve the calculation efficiency, and the convergence speed is faster. [ABSTRACT FROM AUTHOR]

In order to solve the problem that the histogram matching time is long and the engineering application is poor, this paper proposed a method that using EMD-L1 to measure the distance between two feature histograms. EMD-L1 fusioned the L1 norm based on the original EMD and replace the calculation of the ground distance to reduce the number of unknown variables. It achieves shape matching quickly and has a good retrieval performance. With a great deal of experiments in several shape databases, the results show that the performance of novel method is superior to original algorithm. And the matching speed is better than other algorithms under the MNIST data set. [ABSTRACT FROM AUTHOR]

Most previous studies have focused on the matching pattern of actual arable land and water resources in China. However, due to the lack of valid data about potential arable land resources, the matching pattern of potential arable land and water resources has seldom been investigated. In this paper, based on the potential arable land resources retrieved from remote sensing data, the matching degree of potential arable land resources with water resources in China was evaluated by using two indexes, i.e., water resource per unit area and Gini coefficient. First of all, according to the filter conditions suitable for crop cultivation, the spatial distribution of potential arable land area in China was retrieved from three indexes including DEM, slope and soil type. Then, the water resource per unit area of potential arable land in China were calculated, and the spatial matching degree of the raw water and soil resources in China was evaluated. Finally, we drew the Lorenz curve of water and land resources, calculated the Gini coefficient, and evaluated the overall matching pattern of water resource with potential arable land resource in China. The results showed that: 1) The potential arable land varied greatly in China that the area of potential arable land in northern China was much larger than that in southwestern China and east coastal regions. This indicated that in the future the potential arable land would be mainly located in the northern region. 2) There was a serious mismatching between the water resource and potential arable land resource in China. 3) The matching degree of water resource with potential arable land resource was extremely poor. About 80% of water resource served less than 23% of potential arable land in China. The Gini coefficient of water resource with arable land resource which was 0.712 in the whole country, was much higher than that of agricultural water use with farmland resources, which was 0.566. The matching degree of agricultural water and farmland resource was better than that of potential arable land and water resource, which was the result of human activities. This indicated that the Gini coefficient, calculated by the potential arable land without considering the water resource restriction, was much more suitable for expressing the matching degree of water and land resources. This study can provide scientific basis for us to take effective measures to adapt to the background matching pattern. [ABSTRACT FROM AUTHOR]

Copyright of China Textile Leader is the property of China Textile Information Center and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Aiming at frequently appear data redundancy and data reusable inefficiency problems, this paper combined the column-storage mechanism with parallel processing to optimize data reuse strategy. It built a parallel processing model based on MapReduce of data reuse, and used the improved pattern matching algorithm CSM combine the data screening algorithm to propose parallel data reuse algorithm. This algorithm used the pattern matching algorithm to determine the correspondence between the attribute columns, and through data detected method verifies the feasibility of reusing data attribute columns, thereby filtered the data columns and realized the parallel data reuse strategy. Under the big data, it used the data tables of large scale data sets SSB and TPCH in data warehouse to experiment. The results of storage and treatment time are decreased by 17% and 35% , and verified parallel data reuse strategy has more optimized than the general strategy in data storage and data processing time. [ABSTRACT FROM AUTHOR]

Data order-preserving matching is a key problem in big data applications. Data matching can be transformed into character or number matching through abstraction or reduction. We present a novel data order-preserving matching algorithm based on similarity filtration which includes three steps: data transformation, data reduction and similarity computation. Firstly, to reflect the relation of convex growth (descent) or concave growth (descent), the data is transformed into a binary string according to the relationship among the three neighbor numbers. Secondly, to compute the similarity more accurate­ly, the data array and pattern array are both reduced into stable interval [0,1]. Finally, according to the variety range of the relevant nodes between data array and pattern array, the similarity can be computed and sorted. Theory analysis shows that the time complex is O(n), which is lower than the algorithm presented by Cho et al. Furthermore, our algorithm can overcome the deficiencies of the algorithm pres­ented by Cho et al. including the incontrollable min-max values and the subsection inconsistency. Based on the similarity computation, all the sub-strings can he sorted for data retrieval or searching in big data applications. [ABSTRACT FROM AUTHOR]

The problem of pattern matching with flexible wildcards and One-Off condition (PMWOC) is of great importance for both theory and practice. Giving a pattern with flexible wildcards and a text, it focused on finding the number of occurrences of a pattern in a text and each occurrence’s position online. Here, any two occurrences cannot share the same position of the text, namely the One-Off condition. This paper proposed a search algorithm based on bit-parallelism, which adopted nondeterministic finite automatons (NFA) to stimulate the search process. Compared to the previous peers, theoretical analysis and experimental results show that it can get better performances on both time and space. Moreover, it also has better stability with the increasing of the pattern length or the maximum wildcard constraints. [ABSTRACT FROM AUTHOR]

Copyright of Transactions of Beijing Institute of Technology is the property of Beijing University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper introduced the problems that complex event couldn’ t be dectected timely and take up too much memory in multi-source dynamic mass data complex event detection, and proposed a method of complex event detection of hash structure based on priority. By defining the priority of each atomic events and using priority scheduling policy,the method made event pattern matching and detection to be executed timely, while reducing memory consumption and improving event detection throughtput. Simulation experiment results verify the feasibility and high efficiency of this method. [ABSTRACT FROM AUTHOR]

In order to achieve automatic analysis of discourse coherence, this paper studied the Chinese discourse thematic progression automatic identification method based on the condition that theme and rheme of each sentence must contact each other. This method primarily used LTP to performed parsing and then performed thematic segmentation and finished the patterns matching of theme and rheme by word similarity calculation method. Experimental results show that this method can to some extent analyze the progression patterns between sentences automatically and then promote Chinese discourse coherence research. [ABSTRACT FROM AUTHOR]

As the existing location methods based on TDOA can't adapt to absolutely asynchronous arrival location problem of emitter signals, a new absolutely asynchronous radiation emitter location algorithm is proposed in this paper. Firstly every observing platform self-extracts the pulse pattern and its starting time of the emitter from the received pulse sequence respectively, and then the vice platforms transform the extracted pulse patterns and their starting times to the main platform. Finally, the main platform calculates the TDOA sequence (TDOAs) through the pulse pattern matching and extrapolating technique. This processing method solves the TDOA calculating difficulty problem brought by absolutely asynchronous radiation. The emitter position is estimated through the Newton iterative algorithm. The initial value of the Newton iterative algorithm is approximately obtained through calculating the intersection of two hyperbolas' asymptotes formed by the average TDOA of the TDOAs. Simulation results verify the effectiveness and correctness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

People have different understanding about domain knowledge and system goals, and expressed demand for software is not standardized, so that the domain requiremented are often inconsistent and have to be changed frequently. This paper presented a method of domain requirements description based on limited language, by designing the restricted language requirement template to descript domain application needs. Then it checked the legality of vocabulary and matching the sentence patterns to verify the correctness of domain requirement description. And it saved the domain requirement in XML files. Finally it built instances to verify the effectiveness. [ABSTRACT FROM AUTHOR]

In order to improve the efficiency of Sunday pattern matching algorithm, this paper studies an improved Sunday (I_Sunday) algorithm. According to the thought of jumping, when encountering bad characters, the I_Sunday algorithm not only considers the next character of the current matching window, but the character whose length equals the pattern strings, after the next character of the current matching window. All these decide that I_Sunday algorithm can jump a greater distance. In addition, when matching the I_Sunday algorithm, we use the mode of bidirectional parallel matching. In order to verify the performance of the I_Sunday algorithm, in the same condition, some experiments are done from two aspects which are matching times and compared characters, numbers. The experimental results show that the I_Sunday algorithm is more efficient than the Sunday algorithm because it can jump over a large number of bad character and greatly reduce the match number times and the character comparison so as to shorten the matching time. The I_Sunday algorithm effectively improves the speed of pattern matching. [ABSTRACT FROM AUTHOR]

In order to improve the applicability of overall performance of thermal imager and reduce the uncertainty introduced by human observation, TOD test method and its machine vision implementation were studied. As for the limitation of MRTD method for overall performance of staring array thermal imager, the adaptability of TOD method was analyzed under dynamic scene, dynamic non-uniformity correction and so on. By using human visual transfer function and psychological model to replace subjective observing procedure, using blur function and down sampling to simulate the signal transfer procedure, using geometric template matching to replace human perceptive processes, the objective measurement of TOD method was achieved. The measurement uncertainty of overall performance for staring array imager using TOD can be improved from ± 20% to 8%, which can be improved further by using the geometric template matching in machine interpretation procedure. The applicability and consistency of the overall performance of thermal imager can be improved effectively with the TOD method and its machine vision implementation. [ABSTRACT FROM AUTHOR]