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

作者： Yu, Insu Cox, Andrew Kim, Min H. Ritschel, Tobias Grosch, Thorsten Dachsbacher, Carsten Kautz, Jan Department of Computer Science University College London Gower Street London WC1E 6BT United Kingdom Department of Computer Graphics MPI Informatik Campus E14 66123 Saarbrücken Germany Visual Computing Group Universität Stuttgart Germany

In this article we evaluate the use of approximate visibility for efficient global illumination. Traditionally, accurate visibility is used in light transport. However, the indirect illumination we perceive on a daily basis is rarely of high-frequency nature, as the most significant aspect of light transport in real-world scenes is diffuse, and thus displays a smooth gradation. This raises the question of whether accurate visibility is perceptually necessary in this case. To answer this question, we conduct a psychophysical study on the perceptual influence of approximate visibility on indirect illumination. This study reveals that accurate visibility is not required and that certain approximations may be introduced. © 2009 ACM.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

Critical perspectives on large-scale distributed applications and production grids

Critical perspectives on large-scale distributed application...

引用

2009 10th IEEE/ACM International Conference on Grid computing, Grid 2009

作者： Jha, Shantenu Katz, Daniel S. Parashar, Manish Rana, Omer Weissman, Jon Center for Computation and Technology Louisiana State University United States Department of Computer Science Louisiana State University United States e-Science Institute University of Edinburgh United Kingdom Computation Institute University of Chicago United States Department of Electrical and Computer Engineering Louisiana State University United States NSF Center for Autonomic Computing Rutgers University United States Department of Electrical and Computer Engineering Rutgers University United States Department of Computer Science Cardiff University United States Department of Computer Science University of Minnesota United States

ISBN: (纸本)9781424451494

It is generally accepted that the ability to develop large-scale distributed applications that are extensible and independent of infrastructure details has lagged seriously behind other developments in cyberinfrastructure. As the sophistication and scale of distributed infrastructure increases, the complexity of successfully developing and deploying distributed applications increases both quantitatively and in qualitatively newer ways. In this paper we trace the evolution of a representative set of "state-of-the-art" distributed applications and production infrastructure;in doing so we aim to provide insight into the evolving sophistication of distributed applications - from simple generalizations of legacy static high-performance to applications composed of multiple loosely-coupled and dynamic components. The ultimate aim of this work is to highlight that even accounting for the fact that developing applications for distributed infrastructure is a difficult undertaking, there are suspiciously few novel and interesting distributed applications that utilize production Grid infrastructure. Along the way, we aim to provide an appreciation for the fact that developing distributed applications and the theory and practise of production Grid infrastructure have often not progressed in phase. Progress in the next phase and generation of distributed applications will require stronger coupling between the design and implementation of production infrastructure and the theory of distributed applications, including but not limited to explicit support for distributed application usage modes and advances that enable distributed applications to scale-out. © 2009 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Public Infrastructure for Monte Carlo Simulation : publicMC@BATAN

引用

AIP Conference Proceedings 2010年第1期1244卷 190-195页

作者： A. A. Waskita N. A. Prasetyo Z. Akbar L. T. Handoko aCenter for Development of Nuclear Informatics3 National Nuclear Energy Agency Kompleks Puspiptek Serpong Tangerang 15310 Indonesia bCenter for Applied Aerospace Technology National Space and Aviation Agency4 Jl. Raya LAPAN‐Rumpin Tromol Pos 7 Serpong Tangerang 15310 Indonesia cFaculty of Computing Science5 University of Indonesia Kampus UI Depok Depok 16424 Indonesia dGroup for Theoretical and Computational Physics Research Center for Physics6 Indonesian Institute of Sciences Kompleks Puspiptek Serpong Tangerang 15310 Indonesia eGroup for Bioinformatics and Information Mining7 Department of Computer and Information Science University of Konstanz Box D188 D‐78457 Konstanz Germany fDepartment of Physics8 University of Indonesia Kampus UI Depok Depok 16424 Indonesia

The first cluster‐based public computing for Monte Carlo simulation in Indonesia is introduced. The system has been developed to enable public to perform Monte Carlo simulation on a parallel computer through an integrated and user friendly dynamic web interface. The beta version, so called publicMC@BATAN, has been released and implemented for internal users at the National Nuclear Energy Agency (BATAN). In this paper the concept and architecture of publicMC@BATAN are presented.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Steganalysis of synonym-substitution based natural language watermarking

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous Engineering 2009年第2期4卷 21-34页

作者： Yu, Zhenshan Huang, Liusheng Chen, Zhili Li, Lingjun Zhao, Xinxin Zhu, Youwen National High Performance Computing Center Hefei Department of Computer Science and Technology USTC Hefei China

Natural language watermarking (NLW) is a kind of digital rights management (DRM) techniques specially designed for natural language documents. Watermarking algorithms based on synonym substitution are the most popular kind, they embeds watermark into documents in linguistic meaning-preserving ways. A lot of work has been done on embedding, but only a little on steganalysis such as detecting, destroying, and extracting the watermark. In this paper, we try to distinguish between watermarked articles and unwatermarked articles using context information. We evaluate the suitability of words for their context, and then the suitability sequence of words leads to the final judgment made by a SVM (support vector machine) classifier. IDF (inverse document frequency) is used to weight words' suitability in order to balance common words and rare ones. This scheme is evaluated on internet instead of in a specific corpus, with the help of Google. Experimental results show that classification accuracy achieves 90.0%. And further analysis of several influencing factors affecting detection effects is also presented.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Specularity and shadow interpolation via robust polynomial texture maps

Specularity and shadow interpolation via robust polynomial t...

引用

2009 20th British Machine Vision Conference, BMVC 2009

作者： Drew, Mark S. Hajari, Nasim Hel-Or, Yacov Malzbender, Tom School of Computing Science Simon Fraser University Vancouver BC Canada Department of Computer Science Interdisciplinary Center Herzliya Israel Media and Mobile Systems Lab. Hewlett-Packard Laboratories Palo Alto CA United States

ISBN: (纸本)1901725391

Polynomial Texture Maps (PTM) [SIGGRAPH 2001] form an alternative method for apprehending surface colour and albedo that extends a simple model of image formation from the Lambertian variant of Photometric Stereo (PST) to more general reflectances. Here we consider solving such a model in a robust version, not to date attempted for PTM. But the main upshot of utilizing robust regression is in the identification of both shadows and specularities automatically, without the need for any thresholds, in a tripartite set of weights for pixels that are labelled as matte, shadow, or specularity. Original images are captured using a hemispherical set of lights, and pixel values across the lighting directions are then labelled as inliers, or outliers of two types. A per-pixel robust regression on luminance is carried out using Least Median of Squares, and automatically-identified outlier pixels are labelled as shadows if they are darker than matte and correspondingly, specular outliers are too bright. Inlier identification generates correct values for chromaticity and for surface albedo and thus matte luminance and colour. Then a robust version of PST, using only PTM inliers, improves estimates of normal vectors and albedo recovered. With specular pixel values over the lights in hand we model specularity using a radial basis function (RBF) regression, and non-specular pixel departures from matte using a second RBF set. Then for a new lighting direction, we can readily interpolate both specular content as well as shadows. © 2009. The copyright of this document resides with its authors.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Linguistic Steganography Detection Algorithm Using Statistical Language Model

Linguistic Steganography Detection Algorithm Using Statistic...

引用

International Conference on Information Technology and computer science, ITCS

作者： Peng Meng Liusheng Hang Wei Yang Zhili Chen Hu Zheng Department of Computer Science and Technology National High Performance Computing Center Hefei Hefei China Department of Computer Science and Technology National High Performance Computing Center Hefei Xiaoxian Anhui China

Steganography is a technique for embedding secret messages into carriers. Linguistic steganography is a branch of text steganography. Research on attacking methods against linguistic steganography plays an important role in information security (IS) area. In this paper, a linguistic steganography detecting algorithm using statistical language model (SLM) is presented. An experiment to detect text segments generated by linguistic steganography systems NICETEXT, TEXTO and Markov-chain-based is carried out. The result of our experiment shows when the text segment size is 2K and 5K, the detecting accuracies are found to be 93.9% and 96.3% respectively.

关键词： Steganography Detection algorithms Testing Natural languages Training data Cryptography computer science Information security Information technology High performance computing

来源：评论

学校读者我要写书评

暂无评论

Applying feature extraction of speech recognition on VoIP auditing

Applying feature extraction of speech recognition on VoIP au...

引用

作者： Wang, Xuan Lin, Jiancheng Sun, Yong Gan, Haibo Yao, Lin Intelligence Computing Research Center Department of Computer Science Harbin Institute of Technology Shenzhen Graduate School Shenzhen 518055 China School of Electronics and Information Engineering Shenzhen Polytechnic Shenzhen 518055 China

This paper presents an approach that combines both VoIP auditing and speech recognition, and an application of using speech recognition on VoIP voice data is described. It also deals with how to obtain VoIP voice data during audio communication: signaling protocol analysis and voice data traffic analysis. Feature extraction is a very important step in speech recognition, and the result derived from this research shows that the differences between the features extracted from voice recorded directly and voice captured through VoIP are very small and that applying speech recognition on VoIP auditing is applicable. © 2009 ICIC International.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Trouble Dashboard: A distributed failure monitoring system for high-end computing

Trouble Dashboard: A distributed failure monitoring system f...

引用

2009 IEEE-RIVF International Conference on computing and Communication Technologies: Research, Innovation and Vision for the Future, RIVF 2009

作者： Do, Thanh Nguyen, Thuy Nguyen, Dung T. Nguyen, Hiep C. Shi, Weisong Department of Information Systems Hanoi University of Technology Hanoi Viet Nam High Performance Computing Center Hanoi University of Technology Hanoi Viet Nam Department of Computer Science Wayne State University Detroit United States

ISBN: (纸本)9781424445684

Failure management is crucial for high performance computing systems, especially when the complexity of applications and underlying infrastructure has grown sharply in recent years. In this paper, we present the design, implementation and experiment of Trouble Dashboard (TD), an adaptive, flexible, and low overhead failure monitoring system. Our goal is to provide a lightweight, scalable failure-monitoring tool for both application scientists and system managers. In TD, a set of APIs is provided for application scientists to control the behavior of their applications with flexibility when failures happen. System managers can use the tool to monitor the status of not only computing nodes and running tasks but also failures when they occur. Experiments show that TD incurs low overhead, and remains accurate and flexible enough to adapt to various applications. © 2009 IEEE.

关键词： Managers

来源：评论

学校读者我要写书评

暂无评论

The Mastermind Attack on Genomic Data

The Mastermind Attack on Genomic Data

引用

IEEE Symposium on Security and Privacy

作者： Michael T. Goodrich Department of Computer Science Secure Computing and Networking Center University of California Irvine USA

In this paper, we study the degree to which a genomic string, Q, leaks details about itself any time it engages in comparison protocols with a genomic querier, Bob, even if those protocols are cryptographically guaranteed to produce no additional information other than the scores that assess the degree to which Q matches strings offered by Bob. We show that such scenarios allow Bob to play variants of the game of mastermind with Q so as to learn the complete identity of Q. We show that there are a number of efficient implementations for Bob to employ in these mastermind attacks, depending on knowledge he has about the structure of Q, which show how quickly he can determine Q. Indeed, we show that Bob can discover Q using a number of rounds of test comparisons that is much smaller than the length of Q, under various assumptions regarding the types of scores that are returned by the cryptographic protocols and whether he can use knowledge about the distribution that Q comes from, e.g., using public knowledge about the properties of human DNA. We also provide the results of an experimental study we performed on a database of mitochondrial DNA, showing the vulnerability of existing real-world DNA data to the mastermind attack.

关键词： Genomics Bioinformatics Sequences Humans DNA Data privacy Cryptographic protocols Cryptography Databases Genetic mutations

来源：评论

学校读者我要写书评

暂无评论

Towards complete node enumeration in a peer-to-peer botnet 09

Towards complete node enumeration in a peer-to-peer botnet

引用

4th International Symposium on ACM Symposium on Information, computer and Communications Security, ASIACCS'09

作者： Kang, Brent Byunghoon Chan-Tin, Eric Lee, Christopher P. Tyra, James Kang, Hun Jeong Nunnery, Chris Wadler, Zachariah Sinclair, Greg Hopper, Nicholas Dagon, David Kim, Yongdae College of Computing and Informatics University of North Carolina Charlotte United States Computer Science Department University of Minnesota United States Georgia Tech Information Security Center Georgia Institute of Technology United States

ISBN: (纸本)9781605583945

Modern advanced botnets may employ a decentralized peer-to-peer overlay network to bootstrap and maintain their command and control channels, making them more resilient to traditional mitigation efforts such as server incapacitation. As an alternative strategy, the malware defense community has been trying to identify the bot-infected hosts and enumerate the IP addresses of the participating nodes so that the list can be used by system administrators to identify local infections, block spam emails sent from bots, and configure firewalls to protect local users. Enumerating the infected hosts, however, has presented challenges. One cannot identify infected hosts behind firewalls or NAT devices by employing crawlers, a commonly used enumeration technique where recursive get-peerlist lookup requests are sent newly discovered IP addresses of infected hosts. As many bot-infected machines in homes or offices are behind firewall or NAT devices, these crawler-based enumeration methods would miss a large portions of botnet infections. In this paper, we present the Passive P2P Monitor (PPM), which can enumerate the infected hosts regardless whether or not they are behind a firewall or NAT. As an empirical study, we examined the Storm botnet and enumerated its infected hosts using the PPM. We also improve our PPM design by incorporating a FireWall Checker (FWC) to identify nodes behind a firewall. Our experiment with the peer-to-peer Storm botnet shows that more than 40% of bots that contact the PPM are behind firewall or NAT devices, implying that crawler-based enumeration techniques would miss out a significant portion of the botnet population. Finally, we show that the PPM's coverage is based on a probability-based coverage model that we derived from the empirical observation of the Storm botnet. Copyright 2009 ACM.

关键词： Storms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：