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

ICAPS 2006 - 16th International Conference on Automated Planning and Scheduling

作者： Bryce, Daniel Kambhampati, Subbarao Smith, David E. Department of Computer Science and Engineering Arizona State University 699 South Mill Avenue Tempe AZ 85281 NASA Ames Research Center Intelligent Systems Division MS 269-2 Moffett Field CA 94035-1000

The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan lengths, they often do not scale for large problems or plan lengths. As has been shown in classical planning, heuristic search outperforms CSP/SAT techniques (especially when a plan length is not given a priori). The problem with applying heuristic search in probabilistic planning is that effective heuristics are as yet lacking. In this work, we apply heuristic search to conformant probabilistic planning by adapting planning graph heuristics developed for non-deterministic planning. We evaluate a straight-forward application of these planning graph techniques, which amounts to exactly computing the distribution over reachable relaxed planning graph layers. Computing these distributions is costly, so we apply Sequential Monte Carlo to approximate them. We demonstrate on several domains how our approach enables our planner to far out-scale existing (optimal) probabilistic planners and still find reasonable quality solutions. Copyright © 2006, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

Using hidden Markov models to evaluate the risks of intrusions system architecture and model validation

Using hidden Markov models to evaluate the risks of intrusio...

引用

9th International Symposium on Recent Advances in Intrusion Detection, RAID 2006

作者： Årnes, André Valeur, Fredrik Vigna, Giovanni Kemmerer, Richard A. Centre for Quantifiable Quality of Service in Communication Systems Norwegian University of Science and Technology O.S. Bragstads plass 2E N-7491 Trondheim Norway Department of Computer Science University of California Santa Barbara Santa Barbara CA 93106-5110 United States

ISBN: (纸本)354039723X

Security-oriented risk assessment tools are used to determine the impact of certain events on the security status of a network. Most existing approaches are generally limited to manual risk evaluations that are not suitable for real-time use. In this paper, we introduce an approach to network risk assessment that is novel in a number of ways. First of all, the risk level of a network is determined as the composition of the risks of individual hosts, providing a more precise, fine-grained model. Second, we use Hidden Markov models to represent the likelihood of transitions between security states. Third, we tightly integrate our risk assessment tool with an existing framework for distributed, large-scale intrusion detection, and we apply the results of the risk assessment to prioritize the alerts produced by the intrusion detection sensors. We also evaluate our approach on both simulated and real-world data. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Digital forensic reconstruction and the virtual security testbed ViSe

Digital forensic reconstruction and the virtual security tes...

引用

3rd International Conference on Detection of Intrusions and Malware and Vulnerability Assessment, DIMVA 2006

作者： Årnes, André Haas, Paul Vigna, Giovanni Kemmerer, Richard A. Centre for Quantifiable Quality of Service in Communication Systems Norwegian University of Science and Technology O.S. Bragstads plass 2E N-7491 Trondheim Norway Department of Computer Science University of California Santa Barbara Santa Barbara CA 93106-5110 United States

ISBN: (纸本)354036014X

This paper presents ViSe, a virtual security testbed, and demonstrates how it can be used to efficiently study computer attacks and suspect tools as part of a computer crime reconstruction. Based on a hypothesis of the security incident in question, ViSe is configured with the appropriate operating systems, services, and exploits. Attacks are formulated as event chains and replayed on the testbed. The effects of each event are analyzed in order to support or refute the hypothesis. The purpose of the approach is to facilitate forensic testing of a digital crime using minimal resources. Although a reconstruction can neither prove a hypothesis with absolute certainty, nor exclude the correctness of other hypotheses, a standardized environment, such as ViSe, combined with event reconstruction and testing, can lend credibility to an investigation and can be a great asset in court. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Batch and online spam filter comparison

Batch and online spam filter comparison

引用

3rd Conference on Email and Anti-Spam, CEAS 2006

作者： Cormack, Gordon V. Bratko, Andrej David R. Cheriton School of Computer Science University of Waterloo Waterloo ON N2L 3G1 Canada Department of Intelligent Systems Jozef Stefan Institute Jamova 39 Ljubljana SI1000 Slovenia

In the TREC 2005 Spam Evaluation Track, a number of popular spam filters - all owing their heritage to Graham's A Plan for Spam - did quite well. Machine learning techniques reported elsewhere to perform well were hardly represented in the participating filters, and not represented at all in the better results. A non-traditional technique - Prediction by Partial Matching (PPM) - performed exceptionally well, at or near the top of every test. Are the TREC results an anomaly? Is PPM really the best method for spam filtering? How are these results to be reconciled with others showing that methods like Support Vector Machines (SVM) are superior? We address these issues by testing implementations of five different classification methods on the TREC public corpus using the online evaluation methodology introduced in TREC. These results are complemented with cross validation experiments, which facilitate a comparison of the methods considered in the study under different evaluation schemes, and also give insight into the nature and utility of the evaluation regimens themselves. For comparison with previously published results, we also conducted cross validation experiments on the Ling-Spam and PU1 datasets. These tests reveal substantial differences attributable to different test assumptions, in particular batch vs. on-line training and testing, the order of classification, and the method of tokenization. Notwithstanding these differences, the methods that perform well at TREC also perform well using established test methods and corpora. Two previously untested methods - one based on Dynamic Markov Compression and one using logistic regression - compare favorably with competing approaches.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving agent-based distributed data clustering

引用

Web Intelligence and Agent systems 2006年第2期4卷 221-238页

作者： Da Silva, Josenildo Costa Klusch, Matthias Lodi, Stefano Moro, Gianluca Deduction and Multiagent Systems German Research Center for Artificial Intelligence Stuhlsatzenhausweg 3 66123 Saarbrücken Germany Department of Electronics Computer Science and Systems University of Bologna Viale Risorgimento 2 40136 Bologna BO Italy Department of Electronics Computer Science and Systems University of Bologna Via Venezia 52 47023 Cesena FC Italy

A growing number of applications in distributed environment involve very large data sets that are inherently distributed among a large number of autonomous sources over a network. The demand to extend data mining technology to such distributed data sets has motivated the development of several approaches to distributed data mining and knowledge discovery, of which only a few make use of agents. We briefly review existing approaches and argue for the potential added value of using agent technology in the domain of knowledge discovery, discussing both issues and benefits. We also propose an approach to distributed data clustering, outline its agent-oriented implementation, and examine potential privacy violating attacks which agents may incur. © 2006 - IOS Press and the authors. All rights reserved.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

A robust image watermarking by embedding self-orthogonal finite-length sequences into wavelet domain

引用

WSEAS Transactions on Information science and Applications 2006年第6期3卷 1028-1035页

作者： Li, Shuhong Tanada, Yoshihiro Department of Computer Science Henan Institute of Finance and Economics No. 80 WenHua Road Zhengzhou Henan 450002 China Department of Computer Science and Systems Engineering Yamaguchi University 2-16-1 Tokiwadai Ube Yamaguchi 755-8611 Japan

Digital watermarking techniques have been considered as an effective solution to protect the copyright of multimedia data. In this paper, an image watermarking scheme based on discrete wavelet transform is proposed. The watermarks are two-dimension self-orthogonal finite-length sequences which are embedded in the middle frequency wavelet coefficients. Watermark detection is accomplished without the original image by computing the correlation between the watermarked coefficients and the watermarking signal. Experiment results show that the proposed watermarking scheme is perceptual invisible and robust against attacks such as JPEG compression, additive noise and filtering.

关键词： Digital watermarking

来源：评论

学校读者我要写书评

暂无评论

Two topics concerning three-dimensional synchronized alternating turing machines

引用

WSEAS Transactions on computers 2006年第10期5卷 2149-2155页

作者： Ito, Takao Sakamoto, Makoto Tomozoe, Naoko Iihoshi, Kouichi Furutani, Hiroshi Kono, Michio Tamaki, Tatsuhiro Inoue, Katsushi Department of Computer Science and Systems Engineering University of Miyazaki 1-1 Gakuen Kibanadai-Nishi Miyazaki 889-2192 Japan Department of Business Administration Ube National College of Technology 14-1 Tokiwadai 2-chome Ube 755-8555 Japan Department of Computer Science and Systems Engineering Yamaguchi University 6-1 Tokiwadai 2-chome Ube 755-8611 Japan

Blum and Hewitt first proposed two-dimensional automata as a computational model of two-dimensional pattern processing, and investigated their pattern recognition abilities in 1967. Since then, many researchers in this field have been investigating a lot of properties about automata on a two-dimensional tape. By the way, the question of whether processing three-dimensional digital patterns is much more difficult than two-dimensional ones is of great interest from the theoretical and practical standpoints. Moreover, the recent advances in motion image processing, robotics and so on prompted us to analyze computational complexity of three-dimensional pattern processing. Thus, the research of three-dimensional automata as a computational model of three-dimensional pattern processing has also been meaningful. From this viewpoint, we introduced a three-dimensional alternating Turing machine (3-ATM) operating in parallel. In this paper, we continue the investigations about 3-AT M's, introduce a three-dimensional synchronized alternating Turing machine (3-SAT M), and investigate some properties of 3-S AT M's whose input tapes are restricted to cubic ones. The main topics of this paper are: (1) hierarchies based on the number of processes of 3-S AT M's, and (2) recognizability of connected pictures by 3-S AT M's.

关键词： Turing machines

来源：评论

学校读者我要写书评

暂无评论

Eliminating execution overhead of disabled optional features in connectors 1

引用

3rd European Workshop on Software Architecture, EWSA 2006

作者： Bulej, LubomÍr Bure Š, TomÁš Distributed Systems Research Group Department of Software Engineering Charles University Malostranské nám. 25 Prague118 00 Czech Republic Institute of Computer Science Academy of Sciences of the Czech Republic Pod Vodárenskou věží 2 Prague182 07 Czech Republic

ISBN: (数字)9783540692720

ISBN: (纸本)9783540692713

Connectors are used to realize component interactions in component systems. Apart from their primary function, which is mediating the communication, their implementation can also support additional features that, while unrelated to the primary function, may benefit from their placement in connectors. Such features are often optional in the sense that they can be activated and deactivated at run-time. The problem is that even if they are disabled, their very presence in the connector incurs certain overhead. In this paper, we describe an approach to eliminate this overhead by reconfiguration of the connector implementation. Besides connectors, the approach is applicable to similar technologies such as reflective middleware and other architecture-based component systems and frameworks. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

From structural to functional models of complex systems

From structural to functional models of complex systems

引用

作者： Capiluppi, Marta Staroswiecki, Marcel Giuseppe Evangelisti Department of Electronic Computer Science and Systems University of Bologna Viale Risorgimento 2 40136 Bologna Italy SATIE UMR CNRS 8029 Ecole Normale Supérieure de Cachan 61 avenue du Président Wilson F-94235 Cachan cedex France

ISBN: (纸本)9783902661142

This paper addresses functional modelling of complex distributed systems via an objective and automatic procedure. The presented methodology uses the structural representation of the system and the notion of causality in structural graphs. The result of the procedure is a functional tree representing hierarchical relations among the system functionalities. Copyright © 2006 IFAC.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

Growth control of the eukaryote cell: A systems biology study in yeast

引用

Journal of Biology 2007年第2期6卷 4-4页

作者： Castrillo, Juan I. Zeef, Leo A. Hoyle, David C. Zhang, Nianshu Hayes, Andrew Gardner, David C.J. Cornell, Michael J. Petty, June Hakes, Luke Wardleworth, Leanne Rash, Bharat Brown, Marie Dunn, Warwick B. Broadhurst, David Hester, Svenja S. Dunkley, Tom P.J. Hart, Sarah R. Swainston, Neil Li, Peter Gaskell, Simon J. Paton, Norman W. Lilley, Kathryn S. Kell, Douglas B. Oliver, Stephen G. Faculty of Life Sciences Michael Smith Building University of Manchester Manchester M13 9PT Oxford Road United Kingdom Northwest Institute for Bio-Health Informatics (NIBHI) School of Medicine University of Manchester Manchester M13 9PT Oxford Road United Kingdom School of Computer Science Kilburn Building University of Manchester Manchester M13 9PL Oxford Road United Kingdom School of Chemistry Manchester Interdisciplinary Biocentre University of Manchester Manchester M1 7DN 131 Princess St United Kingdom Cambridge Centre for Proteomics Department of Biochemistry University of Cambridge Cambridge CB2 1QW United Kingdom Manchester Centre for Integrative Systems Biology Manchester Interdisciplinary Biocentre University of Manchester Manchester M1 7DN 131 Princess St United Kingdom

Background. Cell growth underlies many key cellular and developmental processes, yet a limited number of studies have been carried out on cell-growth regulation. Comprehensive studies at the transcriptional, proteomic and metabolic levels under defined controlled conditions are currently lacking. Results. Metabolic control analysis is being exploited in a systems biology study of the eukaryotic cell. Using chemostat culture, we have measured the impact of changes in flux (growth rate) on the transcriptome, proteome, endometabolome and exometabolome of the yeast Saccharomyces cerevisiae. Each functional genomic level shows clear growth-rate-associated trends and discriminates between carbon-sufficient and carbon-limited conditions. Genes consistently and significantly upregulated with increasing growth rate are frequently essential and encode evolutionarily conserved proteins of known function that participate in many protein-protein interactions. In contrast, more unknown, and fewer essential, genes are downregulated with increasing growth rate;their protein products rarely interact with one another. A large proportion of yeast genes under positive growth-rate control share orthologs with other eukaryotes, including humans. Significantly, transcription of genes encoding components of the TOR complex (a major controller of eukaryotic cell growth) is not subject to growth-rate regulation. Moreover, integrative studies reveal the extent and importance of post-transcriptional control, patterns of control of metabolic fluxes at the level of enzyme synthesis, and the relevance of specific enzymatic reactions in the control of metabolic fluxes during cell growth. Conclusion. This work constitutes a first comprehensive systems biology study on growth-rate control in the eukaryotic cell. The results have direct implications for advanced studies on cell growth, in vivo regulation of metabolic fluxes for comprehensive metabolic engineering, and for the design of genome-scale s

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：