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

International Conference on Information Fusion

作者： Joachim Biermann Pontus Horling Lauro Snidaro Dept. for Sensor Data and Information Fusion Dept. for Information Systems Swedish Defence Research Agency (FOI) Dept. for Mathematics and Computer Science University of Udine

ISBN: (纸本)9780982443804

This paper presents some findings of the NATO RTO Task Group on Information Fusion in Asymmetric Operations. It briefly describes the functional processing steps in military intelligence presenting the underlying aspects of information processing and fusion and revealing main challenges for automatic support of the required functionalities. The extraction and structuring of relevant information from unstructured text documents is shown to be one of the fundamental features where human operators need assistance. As an example of the state of the art the interactive tools PARANOID and CoALA are presented. They provide the basic information and knowledge structure for all subsequent information processing like Link Analysis and Social Network Analysis. The use and benefit of CoALA will be illustrated by results from a military experiment. Finally, with respect to further research, open questions and new approaches for the support of intelligence production are discussed concerning automatic information structuring and discovery as well as pattern and behaviour based threat assessment.

关键词： Information extraction Collation Intelligence Modelling Reasoning Link-analysis Social networks Structure discovery Indicator Risk

来源：评论

学校读者我要写书评

暂无评论

Learning invariances with stationary subspace analysis

Learning invariances with stationary subspace analysis

引用

2009 IEEE 12th International Conference on computer Vision Workshops, ICCV Workshops 2009

作者： Meinecke, Frank C. Von Bünau, Paul Kawanabe, Motoaki Müller, Klaus-R. Machine Learning Group Dept. Computer Science TU Berlin Franklinstr. 28/29 10587 Berlin Germany Intelligent Data Analysis Group Fraunhofer FIRST.IDA Kekuléstr. 7 12489 Berlin Germany

ISBN: (纸本)9781424444427

Recently, a novel subspace decomposition method, termed 'Stationary Subspace Analysis' (SSA), has been proposed by Bünau et al. [10]. SSA aims to find a linear projection to a lower dimensional subspace such that the distribution of the projected data does not change over successive epochs or sub-datasets. We show that by modifying the loss function and the optimization procedure we can obtain an algorithm that is both faster and more accurate. We discuss the problem of indeterminacies and provide a lower bound on the number of epochs that is needed. Finally, we show in an experiment with simulated image patches, that SSA can be used favourably in invariance learning. ©2009 IEEE.

关键词： Invariance

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach to Watermark Text Documents Based on Eigen Values

A Novel Approach to Watermark Text Documents Based on Eigen ...

引用

International Conference on Network and Service Security, N2S

作者： Rethika TamilSelvan Ivy Prathap Anitha Ramalingam Serugudi Raghavan PSG College of Technology Coimbatore Tamil Nadu IN Dept. of Mathematics and Computer Applications PSG College of Technology Coimbatore India Dept. of Computer Science and Engineering Indian Institute of Technology Madras Chennai India

This paper provides a new secured, invisible approach to watermark text documents. For integrity verification of text documents, the watermark has to depend on a secret key and on the original document. It is important that the dependence on the key should be sensitive. In this paper, a novel watermarking technique is proposed for content authentication and integrity of text documents. The proposed method makes use of the concept of eigen values by constructing a Line-Document matrix for the whole text document to be watermarked. These eigen values are used to form a secret key for generating the watermark. Embedding is done in the bit plane of the document image which will be imperceptible. Comparison of embedded and extracted secret keys detects any small alterations done to the document. This technique is fragile and hence tamper detection is high.

关键词： Watermarking Robustness Authentication data mining Protection Mathematics computer applications Educational institutions computer science Paper technology

来源：评论

学校读者我要写书评

暂无评论

High-Performance Reverse Time Migration on GPU

High-Performance Reverse Time Migration on GPU

引用

computer science Society (SCCC) International Conference Chilean FLAGGED

作者： Javier Cabezas Mauricio Araya-Polo Isaac Gelado Nacho Navarro Enric Morancho José M. Cela Computer Sciences - Programming Models Barcelona Supercomputing Center (BSC) Barcelona Spain Computer Applications in Science and Engineering dept. Barcelona Supercomputing Center (BSC) Barcelona Spain Department of Computer Architecture Universitat Politècnica de Catalunya Spain Computer Applications in Science and Engineering Department Barcelona Supercomputing Center Barcelona Spain

Partial Differential Equations (PDE) are the heart of most simulations in many scientific fields, from Fluid Mechanics to Astrophysics. One the most popular mathematical schemes to solve a PDE is Finite Difference (FD). In this work we map a PDE-FD algorithm called Reverse Time Migration to a GPU using CUDA. This seismic imaging (Geophysics) algorithm is widely used in the oil industry. GPUs are natural contenders in the aftermath of the clock race, in particular for High-performance Computing (HPC). Due to GPU characteristics, the parallelism paradigm shifts from the classical threads plus SIMD to Single Program Multiple data (SPMD). The NVIDIA GTX 280 implementation outperforms homogeneous CPUs up to 9x (Intel Harpertown E5420) and up to 14x (IBM PPC 970). These preliminary results confirm that GPUs are a real option for HPC, from performance to programmability.

关键词： Finite difference methods Geophysics computing computer architecture Parallel processing Graphics processing unit Clocks Hardware Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Security concern over earth viewer software using satellite photo service 1

引用

作者： Hanumanthappa, M. Kumar, Manish Reddy, Bhavanam Lakshma Dept. of Computer Science and Applications Central College Campus Bangalore University Bangalore-560 001 Karnataka India MCA Department M. S. Ramaiah Institute of Technology MSR Nagar Bangalore-560054 Karnataka India MCA Garden City College 16th KM Virgo Nagar Old Madras Road Bangalore 49 India

ISBN: (数字)9783642040627

ISBN: (纸本)9783642040610

Earth Viewer Software that enables users to view detailed satellite images of buildings or street-level panoramas of major roads and neighborhoods, have recently engendered controversy. Users can view and print high-resolution images (with up to 10 kilometers of zoom) of almost all parts of the world. So one can not only locate the route to any place on earth but also have a look at how it actually appears from above. The fact that terrorists or rival nations could get their hands on detailed high-resolution images of military bases, nuclear facilities and other restricted areas seems to be the biggest fear. In this paper we are proposing one Global Access Policy which can pose some restriction on this type of Earth Viewer Software and privacy of the secrets places can be preserved. © 2009 Springer Berlin Heidelberg.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Acquisition, analysis and distribution of real-time multi-sensor satellite data, in a high performance computing environment, for disaster mitigation applications: Case studies from the NATO science for peace funded kamal ewida earth observatory in Egypt, the electronic Geophysical Year (eGY)-Africa and the US Geological Survey supported AmericaView

Acquisition, analysis and distribution of real-time multi-se...

引用

IEEE Sensors 2009 Conference - SENSORS 2009

作者： Rochon, Gilbert L. Araya, Bereket Biehl, Larry L. Grant, Darion Ersoy, Okan Quansah, Joseph Altay, Gülay Wahab, M. Magdy Abdel El Afandi, Gamal Salah El Ghazawi, Tarek Mohamed, Mohamed A. Shokr, Mohammed Sithole, Happy Purdue Terrestrial Observatory Purdue University ITaP/RCAC West Lafayette IN United States School of Electrical and Computer Engineering Purdue University West Lafayette IN United States Department of Agricultural and Biological Engineering Purdue University W. Lafayette IN United States Kandilli Observatory and Earthquake Research Institute Boǧaziçi University Istanbul Turkey Dept. of Meteorology and Astronomy Faculty of Science Cairo University Giza Cairo Egypt Dept. of Astronomy and Meteorology Faculty of Science Al Azhar University Nasr City Cairo Egypt Dept. of Electrical and Computer Engineering George Washington University Washington DC United States N'Djamena Chad Environment Canada Data Assimilation and Satellite Meteorology Research Toronto ON Canada Rosebank Cape Town South Africa

ISBN: (纸本)9781424445486

The paper presents an implementation of the current state-of-the-art, with respect to acquisition, analysis and distribution of real-time remotely sensed data from multiple polar orbiting and geostationary earth observing satellite sensors, deploying high performance computing for time-critical disaster mitigation applications. The authors also describe the prototype Kamal Ewida Earth Observatory (KEEO), now under development at Cairo University & at Al Azhar University in Egypt, as a technological exemplar of indigenous expertise, real-time remote sensing, near-real-time spatial data products, supercomputer access from Egypt's space agency-NARSS, partnerships with multi-lateral agencies (e.g. UN WHO, Electronic Geophysical Year (eGY)-Africa), sensor data archives from the United States Geological Survey (USGS)-supported AmericaView, funding from NATO's science for Peace Program and collaborative research with Boǧaziçi University's Kandilli Observatory and Earthquake Research Institute (KOERI) in Istanbul, Turkey and with Purdue University's Rosen Center for Advanced Computing's Purdue Terrestrial Observatory (PTO) in West Lafayette, Indiana, USA. ©2009 IEEE.

关键词： Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of digital signal processors using SMV Benchmark

引用

World Academy of science, Engineering and Technology 2009年 35卷 825-832页

作者： Hu, Erh-Wen Ku, Cyril S. Russo, Andrew T. Su, Bogong Wang, Jian Dept. of Computer Science William Paterson University Wayne NJ 07470 United States Wireless Speech and Data Processing Nortel Networks 2351 Blvd. Alfred-Nobel St. Laurent QC H4S 2A9 Canada

Unlike general-purpose processors, digital signal processors (DSP processors) are strongly application-dependent. To meet the needs for diverse applications, a wide variety of DSP processors based on different architectures ranging from the traditional to VLIW have been introduced to the market over the years. The functionality, performance, and cost of these processors vary over a wide range. In order to select a processor that meets the design criteria for an application, processor performance is usually the major concern for digital signal processing (DSP) application developers. Performance data are also essential for the designers of DSP processors to improve their design. Consequently, several DSP performance benchmarks have been proposed over the past decade or so. However, none of these benchmarks seem to have included recent new DSP applications. In this paper, we use a new benchmark that we recently developed to compare the performance of popular DSP processors from Texas Instruments and StarCore. The new benchmark is based on the Selectable Mode Vocoder (SMV), a speech-coding program from the recent third generation (3G) wireless voice applications. All benchmark kernels are compiled by the compilers of the respective DSP processors and run on their simulators. Weighted arithmetic mean of clock cycles and arithmetic mean of code size are used to compare the performance of five DSP processors. In addition, we studied how the performance of a processor is affected by code structure, features of processor architecture and optimization of compiler. The extensive experimental data gathered, analyzed, and presented in this paper should be helpful for DSP processor and compiler designers to meet their specific design goals.

关键词： Digital signal processing

来源：评论

学校读者我要写书评

暂无评论

Adaptive Disturbance Rejection in the Presence of Uncertain Resonance Mode in Hard Disk Drives

Adaptive Disturbance Rejection in the Presence of Uncertain ...

引用

2009 American Control Conference (ACC 2009)

作者： Fan Hong Chunling Du Keng Peng Tee S. S. Ge Data Storage Institute Agency for Science Technology and Research (A*STAR) DSI Building 5 Engineering Drive 1 Singapore 117608 Institute for Infocomm Research A*STAR Singapore 138632 Dept. of Electrical & Computer Engineering National University of Singapore Singapore 117605

ISBN: (纸本)9781424445233

An adaptive on-line scheme is designed to identify the uncertain and time-varying resonance modes in hard disk drive servo systems. Based on the identified results, the uncertain resonance mode is extracted and a peak filter is designed accordingly to provide stronger capability of disturbance suppression. The scheme does not require any extra excitation signal nor additional signal processing for the parameter identification. Compared to conventional method, the rates of learning and error convergence are greatly increased. The scheme can provide good stability margin at high frequency subject to the variation of the resonance frequency and the peak gain. Simulation results show the validity and effectiveness of the proposed scheme.

关键词： Disturbance rejection adaptive control peak filter hard disk drive

来源：评论

学校读者我要写书评

暂无评论

On the SD-tree construction for optimal signature operations 08

On the SD-tree construction for optimal signature operations

引用

1st ACM Bangalore Annual Conference, COMPUTE 2008

作者： Shanthi, I. Elizabeth Izaaz, Y. Nadarajan, R. Dept. of Computer Science Avinashilingam University for Women Coimbatore India Dept. of Mathematics and Computer Applications PSG College of Technology Coimbatore India

ISBN: (纸本)9781595939500

Signature file based access methods initially applied on text have now been used to handle set-oriented queries in Object-Oriented data Bases (OODB). All the proposed methods use either efficient search method or tree based intermediate data structure to filter data objects matching the query. Use of search techniques retrieves the objects by sequentially comparing the positions of 1s in it. Such methods take longer retrieval time. On the other hand tree based structures traverse multiple paths making comparison process tedious. In this paper we describe a new indexing technique for OODB using the dynamic balancing of B+ tree called SD (Signature Declustering) tree. In this work the positions of 1s in the signatures are distributed over a set of leaf nodes. Using this for a given query signature all the matching signatures can be retrieved cumulatively in a single node. Also for signature insertion and query searching an optimal search path is calculated so that the entire process is speeded up. Experiments have been conducted to analyze the time and space overhead of the SD-tree by varying the signature length and the distribution of signature weight. The study clearly indicates the advantage of fast retrieval time in a way quite different from the other methods suggested in the past. © 2008 ACM.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

A Galois Lattice framework to handle updates in the mining of closed itemsets in dynamic databases 08

A Galois Lattice framework to handle updates in the mining o...

引用

1st ACM Bangalore Annual Conference, COMPUTE 2008

作者： Kalpana, B. Nadarajan, R. Babu, J. Senthil Dept. of Computer Science Avinashilingam University for Women Coimbatore-641043 India Dept. of Mathematics and Computer Applications PSG College of Technology Coimbatore India MCA PSG College of Technology Coimbatore India

ISBN: (纸本)9781595939500

Incrementality is a major challenge in the mining of dynamic databases. In such databases, the maintenance of association rules can be directly mapped into the problem of maintaining closed frequent itemsets. A number of incremental strategies have been proposed earlier with several limitations. A serious limitation is the need to examine the entire family of closed itemsets, whenever there are insertions or deletions in the database. The proposed strategy relies on an efficient and selective update of the closed itemsets using an indexed trie structure. The framework emphasizes on certain fundamental and structural properties of Galois Lattice theory to overcome the limitations of the earlier approaches. Apart from facilitating a selective update, the indexed structure removes the necessity of working with a wholly memory resident trie. Copyright 2008 ACM.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：