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

A method of detecting phishing web pages based on feature vectors matching

Journal of Information and Computational Science 2012年第15期9卷 4229-4235页

作者： Wang, Huaibin Zhu, Bailu Wang, Chundong Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education Tianjin 300384 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Ministry of Education Tianjin 300384 China

Phishing is a web-based attack which end users are lured to visit fraudulent websites and give away personal information unconsciously. Typically, the captured information is used to get an illegal economic profit. Although the method is simple, because of their tremendous impact, phishing attacks still caused widespread concern. The key problem for checking the phishing pages is timely and efficiently calculating. There is still remaining a large space for phishing detection methods. In this paper, we attempt to check phishing pages using vector features which determine the fundamental structure of a web page. Then, these features are used to measure the similarity by similarity algorithm. © 2012 by Binary Information Press.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Anomalistic sequence detection

引用

International Journal of Intelligent Information and Database systems 2012年第3期6卷 201-219页

作者： Teng, Mingyan Xiao, Ying-Yuan Department of Mathematics Bohai University Jinzhou Liaoning 121000 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Key Laboratory of Computer Vision and System Tianjin University of Technology Tianjin 300191 China

Given a set of training instances of sequences (time series), the problem of anomalistic sequence detection is to predict whether a newly observed time series novel or normal. Anomalistic sequence detection is very useful in many monitoring applications such as video surveillance and signal recognition. In this paper, we extend existing distance-based outlier detection algorithms to address the anomaly detection problem, and propose an instance-based anomaly detection algorithm. We study the effectiveness of these algorithms on some commonly used distance measures of time series. Experiments show that the instance-based algorithm under warping distances such as DTW and EDR achieves much better accuracy than the other combination. We observe that the actual distance calculation of warping distances contributes the main bulk of computational cost of anomaly detection. To improve the efficiency, we propose a local instance summarisation approach, called VarSpace, which reduces distance calculation by summarising similar training instances. Experiments show that the VarSpace approach can improve the efficiency of instance-based anomaly detection significantly. Copyright © 2012 Inderscience Enterprises Ltd.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Research on XML-based Exchanging system between Databases

Research on XML-based Exchanging System between Databases

引用

2012 International Conference on Engineering Materials (ICEM 2012)

作者： Wenjie Li Si Liu Yu Hu Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Key Laboratory of Computer Vision and System Ministry of EducationTianjin University of Technology School of Computer Science and Technology Tianjin University

In homogeneous or heterogeneous databases, the main direction of research on XML-based information interaction between databases is taking XML as middleware to realize the information exchange between data in the environment of small and medium-sized databases. Considering the insufficiency of the traditional text file-based information interaction method, the paper puts forward an XML-based method of information exchanging between databases, and the corresponding database exchanging system is developed. The utmost feature and advantage of the system is taking hibernate XML mapping table file for converting middleware to realize information interaction between databases. The experiment result shows that the system provides a certain reference value for data mining and data warehouse.

关键词： Information Exchanging Mapping table XML Middleware

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable Data Aggregation Scheme in Wireless Sensor Networks

引用

IEEE Transactions on Parallel and Distributed systems 2012年第10期23卷 1958-1969页

作者： Cheng Wang Changjun Jiang Shaojie Tang Xiang-Yang Li Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Computer Science and Engineering Tsinghua National Laboratory for Information Science and Technology (TNLIST) University of Tongji China

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density \lambda \in [1,n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SHL) scheme and multiple-hop-length (MHL) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MHL scheme, for a practically important set of symmetric functions called divisible perfectly compressible (DPC) functions, including the mean, max, and various kinds of indicator functions, etc., the data from \Theta (n) sensors can be aggregated to the sink at the throughput of a constant order \Theta (1), implying that, our MHL scheme is indeed scalable.

关键词： Throughput Wireless sensor networks Temperature measurement Protocols Lattices Temperature sensors

来源：评论

学校读者我要写书评

暂无评论

Revisiting Multiple Pattern Matching Algorithms for Multi-Core Architecture

引用

Journal of Computer Science & technology 2011年第5期26卷 866-874页

作者：谭光明刘萍卜东波刘燕兵 Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences Key Laboratory of Network Technology Institute of Computing TechnologyChinese Academy of Sciences

Due to the huge size of patterns to be searched,multiple pattern searching remains a challenge to several newly-arising applications like network intrusion *** this paper,we present an attempt to design efficient multiple pattern searching algorithms on multi-core *** observe an important feature which indicates that the multiple pattern matching time mainly depends on the number and minimal length of *** multi-core algorithm proposed in this paper leverages this feature to decompose pattern set so that the parallel execution time is *** formulate the problem as an optimal decomposition and scheduling of a pattern set,then propose a heuristic algorithm,which takes advantage of dynamic programming and greedy algorithmic techniques,to solve the optimization *** results suggest that our decomposition approach can increase the searching speed by more than 200% on a 4-core AMD Barcelona system.

关键词： parallel algorithm multi-core multiple pattern matching

来源：评论

学校读者我要写书评

暂无评论

The research of improved moving objects detection algorithm based on Gaussian mixture model

引用

Journal of Computational Information systems 2012年第17期8卷 7011-7019页

作者： Yang, Shuying Wang, Guangbiao Deng, Fei Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education Tianjin 300384 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300384 China Florida International University Miami 33174 United States

In order to improve the reliability of moving objects detection, this paper presented a moving objects detection algorithm based on improved Gaussian mixture model background modeling. The algorithm introduced blocking model, established Gaussian mixture background model which could adjust the number of distribution automatically and detected moving objects by three-frame differencing. To increase the convergence speed, the model is updated by using adaptive learning rate. The experimental results indicate that the proposed method can fast and efficiently detect moving objects, and has better stability and robustness. © 2012 Binary Information Press.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

High efficient memory race recording scheme for parallel program deterministic replay under multi-core architecture

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2012年第1期49卷 64-75页

作者： Liu, Lei Huang, He Tang, Zhimin Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of Chinese Academy of Sciences Beijing 100049 China MIPS Technologies Shanghai 210021 China

Current shared memory multi-core and multiprocessor systems are nondeterministic. When these systems execute a multithreaded application, even if supplied with the same input, they could produce a different output each time. It frustrates debugging and limits the ability to properly test multithreaded code, and is becoming a major stumbling block to the much-needed widespread adoption of parallel programming. The support for deterministic replay of multithreaded execution is greatly helpful in finding concurrency bugs. A memory race recording scheme, named Rainbow, is proposed. Its core idea is to make inter-thread communications fully deterministic. The unique feature of Rainbow is that it precisely sets up happens-before relationships between conflicting memory operations among different threads. By using effective, bloom-filter based, coherence history queue, Rainbow removes redundant happens-before relations implied in the already generated log and enables a compact log. Rainbow adds the modest hardware to the base multi-core processors, and the coherence protocol is unmodified. The analysis results show that Rainbow reduces the log size by 17% of a state-of-the-art scheme, and the records execution speed is similar to that of release consistency (RC) execution and replays at about 93% of its speed. The determinism can be provided with little performance cost using our architecture proposals on the state-of-the-art hardware, and the software-only approaches can be utilized on existing systems without problem.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Human action recognition based on sparse representation induced by L1/L2 regulations

Human action recognition based on sparse representation indu...

引用

International Conference on Pattern Recognition

作者： Zan Gao An-an Liu Hua Zhang Guang-ping Xu Yan-bing Xue Key Laboratory of Computer Vision and System Ministry of Education Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China Department of Electronic Information Engineering Tianjin University Tianjin China

ISBN: (纸本)9781467322164

Sparse representation based classification (SRC) has been widely used for face recognition (FR). Although SRC algorithm is also adopted in human action recognition, the evaluations of different regular terms have not been given. In this paper, we will discuss and evaluate the role of different regular terms of SRC in human action recognition, after that, we propose human action recognition algorithm based on sparse representation induced by L 1 and L 2 regulations - called SR-L12. Experiments on well known KTH action dataset show that SR-L12 is much better than that of nearest neighbor (NN), nearest subspace (NS), full-space (NF), SRC and collaborative representation classification (CRC). Moreover, the proposed method is comparable to most of state-of-the-art algorithms for human action recognition.

关键词： Humans Accuracy Noise measurement Testing Training Classification algorithms Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Real-time rendering techniques of lunar massive terrain data based on wavelet

引用

Journal of Computational Information systems 2012年第14期8卷 6079-6085页

作者： Feng, Yinghao Wang, Riwei Zhang, Hua Wen, Xianbin Hou, Huaiyu Jiang, Mingyan Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China Shanghai Aviation Precision Machinery Research Institute Shanghai 201600 China

A terrain data organization method was proposed in this article in order to solve large scale data realtime rendering problem, which combines wavelet transform and quadtree to organize the terrain data, to further build a multi-resolution lunar terrain model. The experiment result shows that this method can achieve real-time visualization and interaction of massive terrain data of the whole surface of lunar. © 2011 by Binary Information Press.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

A Tree Pruning Algorithm For MIMO Sphere Decoding Based On Path Metric

A Tree Pruning Algorithm For MIMO Sphere Decoding Based On P...

引用

IEEE Vehicular technology Conference

作者： Shiliang Wang Xiaolong Guo Songlin Sun Tiehong Tian Shizhen Sun Xiaojun Jing Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing University of Posts and Telecommunications Beijing China 100876 China Unicom System Integration Limited Corporation

ISBN: (纸本)9781467309899

Tree pruning can significantly reduce the complexity of sphere decoding (SD). How to determine the pruning rule is an open problem of tree pruning. In this paper, we propose a pruning strategy for SD based on path metric. Because only the nearest lattice point is concerned, if the ratio of the metric to the minimum metric is larger than a threshold, the path whose metric is large enough can be pruned. We analyze the influence of the choice of the thresholds on the performance and the complexity. Through analysis and the simulations, we can show that the complexity reduction is significant while maintaining the negligible performance degradation when proper thresholds are chosen. Besides, tradeoff between complexity and performance can be easily achieved by adjusting the thresholds.

关键词： significantly reduce easily achieved adjusting the threshold tree pruning degradation of performance Metric Metronidazole Spheres Complexity DECODING tradeoffs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：