It is a great challenge for information technology that how to organize and manage large amount of document data, and find users' interested information quickly and exactly. Text classification can achieve the goa...
详细信息
In this paper, we demonstrate 253% improvement in the off-state breakdown voltage (BV) of the lattice-matched In 0.17 Al 0.83 N/GaN high-electron-mobility transistors (HEMTs) by using a new Schottky-Source technology....
详细信息
In this paper, we demonstrate 253% improvement in the off-state breakdown voltage (BV) of the lattice-matched In 0.17 Al 0.83 N/GaN high-electron-mobility transistors (HEMTs) by using a new Schottky-Source technology. Based on this concept, the Schottky-Source (SS) InAlN/GaN HEMTs are proposed. The SS HEMTs with a L GD of 15 μm showed a three-terminal BV of 650 V, while conventional InAlN/GaN HEMTs of the same geometry showed a maximum BV of 184 V. Without using any field-plate the result measured in the proposed device is the highest BV ever achieved on InAlN/GaN HEMTs. The corresponding specific on-resistance (R sp, on ) is as low as 3.4 mΩ·cm 2 . A BV of 118 V was also obtained in an SS InAlN/GaN HEMTs with L GD =1 μm, which is the highest BV in GaN-based HEMTs featuring such a short L GD with GaN buffer.
Exact single pattern string matching is a fundamental problem in computer science. To date, the performance of existing string matching algorithms for very short patterns is poor. In this article, based on the most ba...
详细信息
ISBN:
(纸本)9781849196413
Exact single pattern string matching is a fundamental problem in computer science. To date, the performance of existing string matching algorithms for very short patterns is poor. In this article, based on the most basic exact single pattern string matching algorithm-BF, we presented a serial improved algorithms named HBF by introducing the q-grams method, the loop unrolling method, and modifying the smallest processing unit from byte to integer. Experimental results indicated that HBF is obviously faster than known algorithms for very short patterns on our platform. Meanwhile, the pre-processing phase of HBF just need constant time and space, the worst and the best time complexity are linear and 0(n/w), separately, which w is the number of characters involved in an integer.
In this paper, we developed an extensible HL7 middleware to exchange the heterogeneous healthcare information. A semantic structure mapping, which can be configured dynamically, is presented to guide the data conversi...
详细信息
String matching is a basic problem of computer science and it has been widely used in many important application fields. To date, QF is one of the fastest exact single pattern string matching algorithms for long patte...
详细信息
ISBN:
(纸本)9781849196413
String matching is a basic problem of computer science and it has been widely used in many important application fields. To date, QF is one of the fastest exact single pattern string matching algorithms for long patterns. In this paper, we improved the QF algorithm by introducing the greedy jump method and gained a serial of exact single pattern string matching algorithms named Greedy QF. Experimental results indicated that Greedy QF is faster than QF in most of case and Greedy QF is faster than other known algorithms in many cases for long patterns on our platform.
String matching is a fundamental problem in computer science. It has been widely used in many important fields. In this article, we presented an integer comparison method to improve the branch performance, and we impr...
详细信息
ISBN:
(纸本)9781849196413
String matching is a fundamental problem in computer science. It has been widely used in many important fields. In this article, we presented an integer comparison method to improve the branch performance, and we improved an exact single pattern string matching algorithm-TSW by introducing the multi-window method and the integer comparison method. Therefore, we presented a new serial of algorithms named kSWXC (k Sliding Windows with X Comparison, X is the data type for comparison). Experiment results indicated that kSWXC is faster than other known algorithms for short patterns on our platform.
Considering the important reference value of weather radar data in the process of weather modification and based on the analysis of historical weather modification data of Yunnan province, china, and the study of vari...
详细信息
For the vast amounts of data on the Web, this paper presents an extraction method of semantic label of entity relation in the tourism domain based on the conditional random fields and rules. In this method, firstly ma...
详细信息
The sparse representation-based classifier (SRC) has been developed and shows great potential for pattern classification. This paper aims to gain a discriminative projection such that SRC achieves the optimum performa...
详细信息
Image cropping is a technique to help people improve their taken photos' quality by discarding unnecessary parts of a photo. In this paper, we propose a new approach to crop the photo for better composition throug...
详细信息
暂无评论