检索结果-内蒙古大学图书馆

3rd International Conference on Computing, Electronics and Communications Engineering (iCCECE)

作者： Hada, Takuro Sei, Yuichi Tahara, Yasuyuki Ohsuga, Akihiko Univ Electrocommun Grad Sch Informat & Engn Tokyo Japan

ISBN: (纸本)9781728163307

In recent years, drug trafficking using microblogs has risen and become a social problem. A common method of cyber patrols for cracking down on crimes, such as drug trafficking, involves searching for crime-related keywords. However, criminals who post crime-inducing messages make maximum use of "codewords" rather than keywords, such as enjo kosai, marijuana, and methamphetamine, to camouflage their criminal intentions. Research suggests that these codewords change once they become popular;therefore, searching for a specific word requires significant effort to keep track of the latest codewords. In this study, we focused on the appearance of codewords and those likely to be included in incriminating posts with aim to detect codewords with the high likelihood of inclusion in incriminating posts. We proposed new methods for detecting codewords based on differences in word usage and conducted experiments on concealed-word detection in order to evaluate method effectiveness. The results showed that the proposed method was capable of detecting concealed words other than those in the initial list and to better degree relative to baseline methods. These findings demonstrated the ability of the proposed method to rapidly and automatically detect codewords that change over time and blog posts that induce crimes, thereby potentially reducing the burden of continuous monitoring of codewords.

关键词： codewords detect microblog Twitter word embedding

来源：评论

学校读者我要写书评

暂无评论

Small weight codewords in the codes arising from Desarguesian projective planes

引用

DESIGNS CODES AND CRYPTOGRAPHY 2008年第1期46卷 25-43页

作者： Fack, Veerle Fancsali, Szabolcs L. Storme, Leo Van de Voorde, Geertrui Winne, Joost Univ Ghent Dept Pure Math & Comp Algebra B-9000 Ghent Belgium Univ Ghent Dept Appl Math & Comp Sci Res Grp Combinatorial Algorithms & Algorithm Grap B-9000 Ghent Belgium Eotvos Lorand Univ Dept Comp Sci H-1117 Budapest Hungary

We study codewords of small weight in the codes arising from Desarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in the codes arising from PG( 2, p), p prime. Chouinard characterized all the codewords up to weight 2p in these codes. Using a particular basis for this code, described by Moorhouse, we characterize all the codewords of weight up to 2p + (p- 1)/2 if p >= 11. We then study the codes arising from PG( 2, q = q(0)(3)). In particular, for q(0) = p prime, p >= 7, we prove that the codes have no codewords with weight in the interval [q + 2, 2q - 1]. Finally, for the codes of PG(2, q), q = p(h), p prime, h >= 4, we present a discrete spectrum for the weights of codewords with weights in the interval [q + 2, 2q - 1]. In particular, we exclude all weights in the interval [3q/ 2, 2q - 1].

关键词： linear codes projective planes codewords blocking sets

来源：评论

学校读者我要写书评

暂无评论

A study of intersections of quadrics having applications on the small weight codewords of the functional codes C₂ (Q), Q a non-singular quadric

引用

JOURNAL OF PURE AND APPLIED ALGEBRA 2010年第10期214卷 1729-1739页

作者： Edoukou, F. A. B. Hallez, A. Rodier, F. Storme, L. CNRS Inst Math Luminy F-13288 Marseille 9 France Nanyang Technol Univ Sch Phys & Math Sci Div Math Sci Singapore 637371 Singapore Univ Ghent Dept Pure Math & Comp Algebra B-9000 Ghent Belgium

We study the small weight codewords of the functional code C-2(Q), with Q a non-singular quadric in PG(N, q). We prove that the small weight codewords correspond to the intersections of Q with the singular quadrics of PG(N, q) consisting of two hyperplanes. We also calculate the number of codewords having these small weights. (C) 2009 Elsevier B.V. All rights reserved.

关键词： intersections codewords applications codeword Codes SPG7 gene Quadric

来源：评论

学校读者我要写书评

暂无评论

On the Ice-Wine Problem: Recovering Linear Combination of codewords over the Gaussian Multiple Access Channel

On the Ice-Wine Problem: Recovering Linear Combination of Co...

引用

IEEE Information Theory Workshop (ITW)

作者： Ghasemi-Goojani, Shahab Behroozi, Hamid Sharif Univ Technol ISSL Dept Elect Engn Tehran Iran

ISBN: (纸本)9781479959990

In this paper, we consider the Ice-Wine problem: Two transmitters send their messages over the Gaussian Multiple-Access Channel (MAC) and a receiver aims to recover a linear combination of codewords. The best known achievable rate-region for this problem is due to [1], [2] as R-i <= 1/2 log (1/2 + SNR) (i = 1,2) In this paper, we design anovel scheme using lattice codes and show that the rate region of this problem can be improved. The main difference between our proposed scheme with known schemes in [1], [2] is that instead of recovering the sum of codewords at the decoder, a non-integer linear combination of codewords is recovered. Comparing the achievable rate-region with the outer bound R-i <= 1/2 log (1/2 + SNR) (i = 1,2), we observe that the achievable rate for each user is partially tight. Finally, by applying our proposed scheme to the Gaussian Two Way Relay Channel (GTWRC), we show that the best rate region for this problem can be improved.

关键词： Gaussian channels channel coding decoding linear codes multi-access systems relay networks (telecommunication) GTWRC Gaussian multiple access channel Gaussian two way relay channel MAC SNR codewords decoder ice-wine problem lattice codes noninteger linear combination rate-region receiver transmitters Decoding Encoding Lattices Relay networks (telecommunications) Signal to noise ratio Multiple Access Channel DECODING codeword crystal lattices decoders Media Access Protocol Channel coding Supernova remnants MAXIMUM ACCEPTABLE CONTAMINATION Transmitters Multi access systems linear codes Gaussian channels Linear Combination signal to noise ratios

来源：评论

学校读者我要写书评

暂无评论

Action Recognition based on Correlated codewords of Body Movements

Action Recognition based on Correlated Codewords of Body Mov...

引用

International Conference on Digital Image Computing - Techniques and Applications (DICTA)

作者： Kusakunniran, Worapan Wu, Qiang Zhang, Jian Mahidol Univ Fac Informat & Commun Technol Nakhon Pathom Thailand Univ Technol Sydney Fac Engn & Informat Technol Sch Comp & Commun Sydney NSW Australia

ISBN: (纸本)9781538628393

Using spatio-temporal features is popular for action recognition. However, existing methods embed these local features into a global representation. Orders and correlations among local motions of each action are missing. This can make it difficult to distinguish closely related actions. This paper proposes a solution to address this challenge by encoding correlations of movements. Space-time interest points are detected in each action video. Then, feature descriptors are extracted from these key points and clustered into different codewords implicitly representing different characteristics of motions. The final representation of each action video is a combination of a bag of words and correlations between codewords. Then, the support vector machine is used as a classification tool. Based on the experimental results, the proposed method achieves a very promising performance and particularly outperforms the other existing methods that rely on spatio-temporal features.

关键词： Action Recognition Spatio-Temporal Features Bag of Words codewords Correlation

来源：评论

学校读者我要写书评

暂无评论

Automatic Acquisition of Appropriate codewords Number in BoVW Model and the Corresponding Scene Classification Performance 37

Automatic Acquisition of Appropriate Codewords Number in BoV...

引用

37th Chinese Control Conference (CCC)

作者： Li, Fang Guangdong Univ Finance & Econ Informat Sch Guangzhou 510320 Guangdong Peoples R China

ISBN: (纸本)9789881563958

Scene classification has received significant attention in past few years, particularly in the scene semantic comprehension. The Bag of Visual Words (BoVW) is one of the most widely used models in current scene classification research. Acquisition of appropriate codewords number in BoVW Model is a key step in BoVW model. The classical framework to acquire the appropriate number of codewords needs to cluster the codewords by K-Means for many iterations, rendering its high computation cost. In the current study, an improved framework was proposed to acquire the appropriate number of codewords automatically, and con-esponding scene classification performance with Latent Dirichlet Allocation (LDA) topic model was investigated. The experimental results demonstrate the core capability of proposed framework. The computation cost of scene semantic comprehension can be reduced geatly by means of the proposed framework, particularly in amount sequence image processing such as CT, MRI and other medical image analysis.

关键词： Bag of Visual Words (BoVW) codewords Latent Dirichlet Allocation (LDA) Heuristic clustering

来源：评论

学校读者我要写书评

暂无评论

Design of the codewords for Performing the Pattern Recognitions via a Set of Perceptrons with the Domains of These Activation Functions Have More Than Two Pieces 4

Design of the Codewords for Performing the Pattern Recogniti...

引用

4th IEEE International Conference on Signal and Image Processing (ICSIP)

作者： Huang, Ziyin Ling, Wing-Kuen Guangdong Univ Technol Guangzhou Higher Educ Mega Ctr 100 Waihuan Xi Rd Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781728136608

This paper proposes a method for designing the codewords for performing the pattern recognitions via a set of perceptrons with the domains of these activation functions have more than two pieces. First, perform a clustering algorithm on a set of input feature vectors. Second, initialize the total number of the perceptrons as the dimensions of the input feature vectors. Third, for each perceptron and each cluster obtained in the above, estimate the weight vector as well as both the upper and the lower projection boundaries for all the input feature vectors in this particular cluster via an optimization approach. Fourth, determine the total number of the regions generated by the activation functions such that it is larger than or equal to the total number of the dusters. Fifth, for each perceptron, perform a clustering algorithm on the sets of both the upper and the lower projection boundaries obtained in the above. Sixth, for each perceptron and each piece of the activation function, find the weight vector and both the upper and the lower projection boundaries for all the input feature vectors in this piece of the activation function via a linear programming approach. Seventh, assign the codewords to the regions generated by the perceptrons. Eighth, if any two different regions generated by the perceptrons with the same codewords correspond to different classes of objects, then increment the total number of the perceptrons. Repeat these procedures until any two different regions generated by the perceptrons with the same codewords correspond to the same classes of objects. Finally, employ these perceptrons for performing the pattern recognitions.

关键词： Perceptrons activation function with the domain having more than two pieces pattern recognitions codewords optimization

来源：评论

学校读者我要写书评

暂无评论

Decompartmentation of codewords

引用

2017年

Decompartmentation of codewords by Central Intelligence Agency; Central Intelligence Agency; published by

关键词： central intelligence agency cia codewords crest decompartmentation general cia records mf rippub

来源：评论

学校读者我要写书评

暂无评论

Classification Guidance for Program Designators and codewords (Sanitized)

引用

2017年

Classification Guidance for Program Designators and codewords (Sanitized) by Central Intelligence Agency; Central Intelligence Agency; published by

关键词： (sanitized) central intelligence agency cia classification codewords crest designators general cia records guidance mf rippub

来源：评论

学校读者我要写书评

暂无评论

Automatic Acquisition of Appropriate codewords Number in BoVW Model and the Corresponding Scene Classification Performance

Automatic Acquisition of Appropriate Codewords Number in BoV...

引用

第37届中国控制会议

作者： Fang Li Information School Guangdong University of Finance&Economic

Scene classification has received significant attention in past few years, particularly in the scene semantic comprehension. The Bag of Visual Words(BoVW) is one of the most widely used models in current scene classification research. Acquisition of appropriate codewords number in BoVW Model is a key step in BoVW model. The classical framework to acquire the appropriate number of codewords needs to cluster the codewords by K-Means for many iterations, rendering its high computation cost. In the current study, an improved framework was proposed to acquire the appropriate number of codewords automatically, and corresponding scene classification performance with Latent Dirichlet Allocation(LDA) topic model was investigated. The experimental results demonstrate the core capability of proposed framework. The computation cost of scene semantic comprehension can be reduced greatly by means of the proposed framework, particularly in amount sequence image processing such as CT, MRI and other medical image analysis.

关键词： Bag of Visual Words(BoVW) codewords Latent Dirichlet Allocation(LDA) Heuristic clustering

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：