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

2011 1st International Conference on Network and Electronics engineering(ICNEE 2011）

作者： Hamid Mohammadzadeh.e.n Masood Mansoori Roza Honarbakhsh Faculty of computer Science & Technology University of Malaya Faculty of Computer Science and Software Engineering University of Canterbury Advanced Informatics School University Technology Malaysia

End users of computer networks are vulnerable to a growing number of threats posed by sophisticated online *** first step in mitigation and protection against online attacks is to understand the nature and tools of the *** provide a platform by which online attacks can be *** are versatile security tools designed on the principle of deception and deployed to perform a wide range of *** functionalities range from data collection and information gathering on attacks targeting server side services or client applications and browsers,to malware collection,attack diversion and SPAM *** on the type of attack,honeypots with different architectures and interaction levels have been *** components of honeypots have also been integrated to create hybrid honeypots to tackle drawbacks of each *** aim of this paper is to illustrate the different designs of honeypots,their components and provide a brief study of their security features.

关键词： Server Honeypot, Client Honeypot, Low Interaction, High Interaction, Hybrid Honeypot.

来源：评论

学校读者我要写书评

暂无评论

A parallel Ray Tracing architecture suitable for application-specific hardware and GPGPU implementations

A parallel Ray Tracing architecture suitable for application...

引用

2011 14th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2011

作者： Nery, Alexandre S. Nedjah, Nadia Franca, Felipe M.G. Jozwiak, Lech LAM - Computer Architecture and Microelectronics Laboratory Systems Engineering and Computer Science Program COPPE Universidade Federal Rio de Janeiro Brazil Department of Electronics Engineering and Telecommunications Faculty of Engineering Universidade do Estado Rio de Janeiro Brazil Department of Electrical Engineering - Electronic Systems Eindhoven University of Technology Netherlands

ISBN: (纸本)9780769544946

The Ray Tracing rendering algorithm can produce high-fidelity images of 3-D scenes, including shadow effects, as well as reflections and transparencies. This is currently done at a processing speed of at most 30 frames per second. Therefore, actual implementations of the algorithm are not yet suitable for interactive real-time rendering, which is required in games and virtual reality based applications. Fortunately, the algorithm allows for massive parallelization of its computations. In this paper, we present a parallel architecture for ray tracing based on a uniform spatial subdivision of the scene and exploiting an embedded computation of ray-triangle intersections. This approach allows for a significant acceleration of intersection computations, as well as, a reduction of the total number of the required intersections checks. Furthermore, it allows for these checks to be performed in parallel and in advance for each ray. In this paper we discuss and analyze an ASIP-based implementation using FPGAs and a GPGPU-based parallel implementation of the proposed architecture. The performance of both implementations are reported and compared." © 2011 IEEE.

关键词： Ray tracing

来源：评论

学校读者我要写书评

暂无评论

Matching organizational structure and social network extracted from email communication

Matching organizational structure and social network extract...

引用

作者： Michalski, Radoslaw Palus, Sebastian Kazienko, Przemyslaw Institute of Informatics Faculty of Computer Science and Management Wroclaw University of Technology Wybrzeze Wyspiańskiego 27 50-370 Wroclaw Poland Research and Engineering Center Strzegomska 46 B 53-611 Wroclaw Poland

ISBN: (纸本)9783642218293

The following paper presents the concept of matching social network and corporate hierarchy in organizations with stable corporate structure. The idea allows to confirm whether social position of an employee calculated on the basis of the social network differs significantly from the formal employee role in the company. The results of such analysis may lead to possible company management improvement enabling to gain a competitive edge. In order to perform this task the authors have made experiments with the use of two real-life datasets: Enron and mid-sized manufacturing companies showing which social network metrics may be suitable to match organizational structure and social network with good results. © 2011 Springer-Verlag.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

An Approach Using Parallel Architecture to Storage DICOM Images in Distributed File System

引用

Journal of Physics: Conference Series 2012年第1期341卷

作者： Tiago S Soares Thiago C Prado M A R Dantas Douglas D J de Macedo Michael A Bauer Informatics and Statistic Department Federal University of Santa Catarina Florianpolis Brazil Post-Graduate Program of Knowledge Engineering and Management Federal University of Santa Catarina Florianpolis Brazil Department of Computer Science University of Western Ontario UWO London Canada

Telemedicine is a very important area in medical field that is expanding daily motivated by many researchers interested in improving medical applications. In Brazil was started in 2005, in the State of Santa Catarina has a developed server called the CyclopsDCMServer, which the purpose to embrace the HDF for the manipulation of medical images (DICOM) using a distributed file system. Since then, many researches were initiated in order to seek better performance. Our approach for this server represents an additional parallel implementation in I/O operations since HDF version 5 has an essential feature for our work which supports parallel I/O, based upon the MPI paradigm. Early experiments using four parallel nodes, provide good performance when compare to the serial HDF implemented in the CyclopsDCMServer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

New advances in automated Urban modelling from airborne laser scanning data

引用

Recent Patents on engineering 2011年第3期5卷 196-208页

作者： Laefer, D.F. Hinks, T. Carr, H. Truong-Hong, L. Newstead G25 Belfield Dublin 4 Ireland School of Computer Science and Informatics University College Dublin Ireland School of Computing Faculty of Engineering University of Leeds E C Stoner Building 6.06 United Kingdom UMG SCSEE UCD Newstead G67 Belfield Dublin 4 Ireland

Traditionally, urban models in many applications such as urban planning, disaster management, and computer games only require visual accuracy. However, more recently, updating urban infrastructure combined with the rise of mega-cities (i.e. those with populations over ten million) has motivated researchers and users to utilize city-scale models for engineering purposes (e.g. tracking pollution monitoring, optimizing solar panel placement), which necessitates high geometric accuracy. Currently, a major bottleneck lies in the cost of generating accurate, geo-spatially referenced models. This paper presents the evolution of some of the efforts to automatically produce such models. Specifically, recent advances in airborne laser scanning can rapidly acquire accurate, spatial data for large geographic areas in hours, but due to the size of the data sets, coupled with difficulties of capturing and portraying complex structures, many post-processing issues have only recently been addressed to a level sufficient to begin to facilitate automation, especially of building surface reconstruction. Automation is a critical step for further processing and utilization of airborne laser scanned data for engineering-based, urban modeling. This paper presents recent development of the methods for building detection and extraction, with an emphasis on patents and other contributions related to automated processing of airborne laser scanning data. © 2011 Bentham science Publishers.

关键词： Three dimensional computer graphics

来源：评论

学校读者我要写书评

暂无评论

Discrete tomography on the triangular grid: a memetic approach

Discrete tomography on the triangular grid: a memetic approa...

引用

International Symposium on Image and Signal Processing and Analysis

作者： Elisa Moisi Benedek Nagy Department of Computer Science Faculty of Electrical Engineering and Information Technology University of Oradea Oradea Romania Department of Computer Science Faculty of Informatics University of Debrecen Debrecen Hungary

In this paper we present a memetic algorithm for the reconstruction of binary images represented on a triangular grid. We define the crossover and mutation evolutionary algorithm operators introduced on this grid. We propose a discrete tomography algorithm which uses a switch and compactness operators for the triangular grid to improve the quality of the image in each generation. The algorithm was tested on some images for its effectiveness.

关键词： Switches Image reconstruction Signal processing algorithms Memetics Geometry Evolutionary computation Tomography

来源：评论

学校读者我要写书评

暂无评论

Beyond connectivity - new metrics to evaluate robustness of networks

Beyond connectivity - new metrics to evaluate robustness of ...

引用

IEEE Workshop on High Performance Switching and Routing

作者： Sujogya Banerjee Shahrzad Shirazipourazad Pavel Ghosh Arunabha Sen Computer Science and Engineering Program School of Computing Informatics and Decision System Engineering Arizona State University Tempe AZ USA

Robustness or fault-tolerance capability of a network is an important design parameter in both wired and wireless networks. Connectivity of a network is traditionally considered to be the primary metric for evaluation of its fault-tolerance capability. However, connectivity κ(G) (for random faults) or region-based connectivity κ R (G) (for spatially correlated or region-based faults, where the faults are confined to a region R) of a network G, does not provide any information about the network state, (i.e., whether the network is connected or not) once the number of faults exceeds κ(G) or κ R (G). If the number of faults exceeds κ(G) or κ R (G), one would like to know, (i) the number of connected components into which G decomposes, (ii) the size of the largest connected component, (iii) the size of the smallest connected component. In this paper, we introduce a set of new metrics that computes these values. We focus on one particular metric called region-based component decomposition number (RBCDN), that measures the number of connected components in which the network decomposes once all the nodes of a region fail. We study the computational complexity of finding RBCDN of a network. In addition, we study the problem of least cost design of a network with a target value of RBCDN. We show that the optimal design problem is NP-complete and present an approximation algorithm with a performance bound of O(log K + 4log n), where n denotes the number of nodes in the graph and K denotes a target value of RBCDN. We evaluate the performance of our algorithm by comparing it with the performance of the optimal solution. Experimental results demonstrate that our algorithm produces near optimal solution in a fraction of time needed to find an optimal solution.

关键词： Measurement Layout Approximation algorithms Algorithm design and analysis Polynomials Robustness Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Adaptive spatial harmonic analysis of EEG data using Laplacian eigenspace

Adaptive spatial harmonic analysis of EEG data using Laplaci...

引用

Joint Meeting of the International Symposium on Noninvasive Functional Source Imaging of the Brain and Heart and the International Conference on Functional Biomedical Imaging (NFSI-ICFBI)

作者： Uwe Graichen Roland Eichardt Patrique Fiedler Daniel Strohmeier Jens Haueisen Institute of Biomedical Engineering and Informatics Faculty of Computer Science and Automation Ilmenau University of Technology Ilmenau Germany

Electroencephalography is an important diagnostic tool for functional investigations of the human brain. Recent EEG measurement technologies provide high numbers of electrodes and sampling rates, which results in a considerable quantity of data. For the analysis of this EEG data, efficient signal analysis and decomposition methods are essential. In this paper a new method for spatial harmonic analysis of EEG data using the Laplacian eigenspace of the meshed surface of electrode positions is presented. The resulting eigenspace enables the spatial harmonic analysis, filtering, denoising and decomposition of EEG data. For a proof of concept, the proposed approach is applied to an 128 channel EEG recording of visual evoked potentials. A set of harmonic spatial basis functions for the EEG electrode setup is estimated. The EEG data are spatially decomposed and low pass filtered using the harmonic spatial basis functions.

关键词： Electroencephalography Laplace equations Electrodes Harmonic analysis Eigenvalues and eigenfunctions Symmetric matrices Time frequency analysis

来源：评论

学校读者我要写书评

暂无评论

Telecommunication networks coverage area expansion in disaster area using autonomous mobile robots: Hardware and software implementation

Telecommunication networks coverage area expansion in disast...

引用

International Conference on Advanced computer science and Information System (ICACSIS)

作者： E. Budianto M.S. Alvissalim A. Hafidh A. Wibowo W. Jatmiko B. Hardian P. Mursanto A. Muis Faculty of Computer Science Universitas Indonesia Indonesia Department of Informatics Faculty of Mathematics and Natural Science Diponegoro University Indonesia Faculty of Engineering Universitas Indonesia Indonesia

Communication network expansion technology using autonomous robot covers three research fields which includes network expansion, network routing, and localization. On this research, we implement an efficient robot formation and network expansion algorithm on a simulator based on Open Dynamics Engine (ODE) library. We extended the robot formation algorithm to handle multiple sources implementation to keep communication linkage between communication towers. We also developed a network routing algorithm and implement the robot formation algorithm on real autonomous robots hardware. The result of simulation shows that our proposed communication network expansion technology is visible to be implemented. Therefore, we designed an autonomous robot meeting the requirement set in the simulation.

关键词： Routing protocols Heuristic algorithms Routing Mobile robots Robot kinematics Communication networks

来源：评论

学校读者我要写书评

暂无评论

Testing static single cell faults using static and dynamic data background

Testing static single cell faults using static and dynamic d...

引用

2011 IEEE Student Conference on Research and Development, SCOReD 2011

作者： Zakaria, Nor Azura Hasan, W.Z.W. Abdul Halin, Izhal Sidek, R.M. Wen, Xiaoqing Microelectronic Department PDSI Technology Park Malaysia Bukit Jalil Kuala Lumpur Malaysia Department of Electrical and Electronic Engineering Faculty Engineering University Putra Malaysia Serdang Selangor Malaysia Department of Creative Informatics Graduate School of Computer Science and System Engineering Kyushu Institute of Technology Iizuka Japan

ISBN: (纸本)9781467301022

This work proposes a bit-adjacent Data Background (DB) management scheme to improve fault coverage of March algorithms while simultaneously maintaining the shortest test cycle. Both static and dynamic DB transitions are used in order to detect Deceptive Read Destructive Faults (DRDFs) and Write Disturb Faults (WDFs) that are not detected by previous algorithms. A conventional March Test Algorithm can be modified by using the DB management scheme to form a new March Test Algorithm (referred to as Mod March Test Algorithm), e.g., MATS++(6N) becoming Mod MATS++(6N). This paper shows that Mod March SR (14N) and Mod March CL (12N) can detect DRDFs and WDFs while the corresponding conventional algorithms cannot. It is also shown that Mod March CL(12N) and Mod March SR(14N) with DB management can detect all Static Single Cell Faults based on the Bit-Oriented-Memories (BOM) test method. Comparisons on test cycle time for Mod March SR, March SR, and March SS in the context of memory Built-In-Self-Test (BIST) are also presented. From the simulation result, it shows that by including Data Backgrounds (DBs) management in Bit-Oriented Memories (BOM), the cycle test time is the same after a given multiple of DBs in the test algorithm. © 2011 IEEE.

关键词： Built-in self test

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：