1 |
Self-Training Sampling with Monolingual Data Uncertainty for Neural Machine Translation ...
|
|
|
|
BASE
|
|
Show details
|
|
2 |
Self-Training Sampling with Monolingual Data Uncertainty for Neural Machine Translation ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
Anatomical Study on the Safety of Anterior Cervical Craniovertebral Fusion with Clival Screw Placement in Children Aged 1–6 Years
|
|
|
|
In: Int J Gen Med (2021)
|
|
BASE
|
|
Show details
|
|
4 |
Multi-Task Learning with Shared Encoder for Non-Autoregressive Machine Translation ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
Assessing the Bilingual Knowledge Learned by Neural Machine Translation Models ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Information Aggregation for Multi-Head Attention with Routing-by-Agreement ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Neuron Interaction Based Representation Composition for Neural Machine Translation ...
|
|
|
|
BASE
|
|
Show details
|
|
8 |
Multi-Granularity Self-Attention for Neural Machine Translation ...
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Towards Understanding Neural Machine Translation with Word Importance ...
|
|
|
|
BASE
|
|
Show details
|
|
10 |
Towards Better Modeling Hierarchical Structure for Self-Attention with Ordered Neurons ...
|
|
|
|
BASE
|
|
Show details
|
|
11 |
Exploiting Deep Representations for Neural Machine Translation ...
|
|
|
|
BASE
|
|
Show details
|
|
13 |
Hardware string matching engine for large and dynamic pattern set ; Da xing dong tai zi fu chuan ji de ying jian pi pei ji ; 大型動態字符串集的硬件匹配機
|
|
Wang, Xing (王興). - : City University of Hong Kong, 2014
|
|
BASE
|
|
Show details
|
|
14 |
Multi-Stride String Searching for High-Speed Content Inspection
|
|
|
|
BASE
|
|
Show details
|
|
15 |
Multi-String Searching for High-Speed Content Inspection
|
|
|
|
Abstract:
Design of hardware-assisted high-speed string-matching engine for content inspection has been an active research topic. Scalability, flexibility and speed are the three major challenges. In this paper, we shall present a high-speed string matching engine for virus scanning that can process 3 bytes of input data per cycle. Our design uses a memory-based architecture. The hardware circuits need not be reconfigured when the pattern set is updated. We evaluate our design using the ClamAV virus database with over 82K patterns, and the memory cost of our method is about 2.4 MB. The proposed method is an improved version of our previously published method called quick sampling with on demand verification. The previous design has a memory cost of 1.4 MB and a throughput of 1 byte per cycle. Two novel architectural features are incorporated into the new design, namely a new technique to construct near-minimal dynamic perfect hash tables using the bit-shuffle approach, and the introduction of a new concept called byte-shift invariant code (BSIC). With the BSIC, a suffix verification unit can be shared by multiple prefix sampling units. Hence, the processing rate of the new design can be speeded up to three times the processing rate of the old design, while the memory cost is only increased by 72%.
|
|
Keyword:
Section D: Security in Computer Systems and Networks
|
|
URL: http://comjnl.oxfordjournals.org/cgi/content/short/bxs093v1 https://doi.org/10.1093/comjnl/bxs093
|
|
BASE
|
|
Hide details
|
|
16 |
Multi-Stride String Searching for High-Speed Content Inspection
|
|
|
|
BASE
|
|
Show details
|
|
|
|