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

International Conference on Machine Learning and Cybernetics

作者： Tong, Dong-Ling Software Systems Research Centre School of Design Engineering and Computing Bournemouth University Poole Dorset United Kingdom

ISBN: (纸本)9781424465262

Numerous feature selection methods have been developed to identify informative genes from a large pool of genes that are not involved in the array experiments. However, the integrity of the reported genes is still uncertain due to the applications of various pre-processing techniques to the microarray data by these methods and a lack of standard validation procedures to validate the significance of the genes. In this paper, we developed a feature extraction framework based on the hybrid genetic algorithm (GA) and neural network (ANN) to extract informative genes from the raw (unprocessed) microarray data. This approach has showed its efficacy in extracting informative genes for microarray data. © 2010 IEEE.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

From collective knowledge to intelligence: Pre-requirements analysis of large and complex systems

From collective knowledge to intelligence: Pre-requirements ...

引用

1st Workshop on Web 2.0 for software engineering at ICSE 2010, Web2SE 2010, in Conjunction with the 32nd ACM/IEEE International Conference on software engineering, ICSE 2010

作者： Liang, Peng Avgeriou, Paris He, Keqing Xu, Lai State Key Lab. of Software Engineering Wuhan University China Department of Computing Science University of Groningen Netherlands Software Systems Research Centre Bournemouth University United Kingdom

ISBN: (纸本)9781605589756

Requirements engineering is essentially a social collaborative activity in which involved stakeholders have to closely work together to communicate, elicit, negotiate, define, confirm, and finally come up with the requirements for the system to be implemented or upgraded. In the development of large and complex systems, with a huge number of uncertain stakeholders, the requirements engineering process becomes a challenging task due to overwhelming and dynamic social interactions, tradeoffs, and collective decisions made by above stakeholders. Traditional approaches and techniques are deficient in supporting this kind of social interactions in requirements-related activities, and managing the evolving requirements and their traceability caused by the social interactions. This paper proposes to address the challenges in the pre-requirements analysis of large and complex systems by employing the techniques from collective intelligence based on Web 2.0 tools and technologies, which is composed of three steps: first, obtain collective requirements knowledge through collaborative tagging by stakeholders;second, transform collaborative requirement tags into requirement ontologies;third, support collective requirement decision-making (i.e., collective intelligence) based on the requirement ontologies through requirements reasoning. © 2010 ACM.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

Extracting informative genes from unprocessed microarray data

Extracting informative genes from unprocessed microarray dat...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Dong-Ling Tong Software Systems Research Centre School of Design Engineering and Computing Bournemouth University Poole Dorset UK

关键词： Gallium nitride Artificial neural networks Biological cells Feature extraction Cancer Data mining

来源：评论

学校读者我要写书评

暂无评论

Clutter-Adaptive Visualization for Mobile Data Mining

Clutter-Adaptive Visualization for Mobile Data Mining

引用

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Brett Gillick Hasnain AlTaiar Shonali Krishnaswamy Jonathan Liono Nicholas Nicoloudis Abhijat Sinha Arkady Zaslavsky Mohamed Medhat Gaber Centre of Distributed Systems & Software Engineering Monash University Melbourne Australia School of Computing University of Portsmouth Portsmouth UK

There is an emerging focus on real-time data stream analysis on mobile devices. While many mobile data stream mining algorithms have been developed in recent times, generic and scalable visualization techniques have not been presented. This paper presents the demonstration of our innovative clutter-adaptive cluster visualization technique for mobile devices. We have fully implemented this technique on the Google Android platform and provide demonstrations for different datasets: location (both real and synthetic), and stock-market (real).

关键词： Data visualization Mobile communication Data mining Mobile handsets Clutter Clustering algorithms Real time systems

来源：评论

学校读者我要写书评

暂无评论

A Particle Swarm Optimization-Based Heuristic for Scheduling Workflow Applications in Cloud computing Environments

A Particle Swarm Optimization-Based Heuristic for Scheduling...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Suraj Pandey Linlin Wu Siddeswara Mayura Guru Rajkumar Buyya Cloud Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia CSIRO Tasmanian ICT Centre Hobart Australia

ISBN: (纸本)9781424466955;9780769540184

Cloud computing environments facilitate applications by providing virtualized resources that can be provisioned dynamically. However, users are charged on a pay-per-use basis. User applications may incur large data retrieval and execution costs when they are scheduled taking into account only the `execution time'. In addition to optimizing execution time, the cost arising from data transfers between resources as well as execution costs must also be taken into account. In this paper, we present a particle swarm optimization (PSO) based heuristic to schedule applications to cloud resources that takes into account both computation cost and data transmission cost. We experiment with a workflow application by varying its computation and communication costs. We compare the cost savings when using PSO and existing `Best Resource Selection' (BRS) algorithm. Our results show that PSO can achieve: (a) as much as 3 times cost savings as compared to BRS, and (b) good distribution of workload onto resources.

关键词： Particle swarm optimization Processor scheduling Cloud computing Application software Cost function Computational efficiency Dynamic scheduling Computer science software engineering Application virtualization

来源：评论

学校读者我要写书评

暂无评论

Adaptive Clutter-Aware Visualization for Mobile Data Stream Mining

Adaptive Clutter-Aware Visualization for Mobile Data Stream ...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Mohamed Medhat Gaber Shonali Krishnaswamy Brett Gillick Nicholas Nicoloudis Jonathan Liono Hasnain AlTaiar Arkady Zaslavsky School of Computing University of Portsmouth UK Centre for Distributed Systems and Software Engineering Monash University VIC Australia Lulea University of Technology Lulea Sweden

There is an emerging focus on real-time data stream analysis on mobile devices. A wide range of data stream processing applications are targeted to run on mobile handheld devices with limited computational capabilities such as patient monitoring, driver monitoring, providing real-time analysis and visualization for emergency and disaster management, real-time optimization for courier pick-up and delivery etc. There are many challenges in visualization of the analysis/data stream mining results on a mobile device. These include coping with the small screen real-estate and effective presentation of highly dynamic and real-time analysis. This paper proposes a generic theory for visualization on small screens that we term Adaptive Clutter Reduction ACR. Based on ACR, we have developed and experimentally validated a novel data stream clustering result visualization technique that we term Clutter-Aware Clustering Visualizer (CACV). Experimental results on both synthetic and real datasets using the Google Andriod platform are presented proving the effectiveness of the proposed techniques.

关键词： Data visualization Clutter Data mining Mobile communication Mobile handsets Real time systems Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-error-correcting amplitude damping codes

Multi-error-correcting amplitude damping codes

引用

IEEE International Symposium on Information Theory

作者： Runyao Duan Markus Grassl Zhengfeng Ji Bei Zeng State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW Australia Centre for Quantum Technologies National University of Singapore Singapore Perimeter Institute of Theoretical Physics Waterloo ONT Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy and Sciences Beijing China Institute for Quantum Computing and the Department of Combinatorics and Optimization University of Waterloo Waterloo ONT Canada

ISBN: (纸本)9781424478903

We construct new families of multi-error-correcting quantum codes for the amplitude damping channel. Our key observation is that, with proper encoding, two uses of the amplitude damping channel simulate a quantum erasure channel. This allows us to use concatenated codes with quantum erasure-correcting codes as outer codes for correcting multiple amplitude damping errors. Our new codes are degenerate stabilizer codes and have parameters which are better than the amplitude damping codes obtained by any previously known construction.

关键词： Damping Quantum mechanics Quantum computing Error correction codes Noise level Laboratories Phase noise Physics computing Intelligent systems Computer science

来源：评论

学校读者我要写书评

暂无评论

Quantum State Reduction for Universal Measurement Based Computation

引用

Physical Review Letters 2010年第2期105卷 020502-020502页

作者： Xie Chen Runyao Duan Zhengfeng Ji Bei Zeng Department of Physics Massachusetts Institute of Technology Cambridge Massachusetts USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW Australia Department of Computer Science and Technology Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Perimeter Institute for Theoretical Physics Waterloo Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Quantum Computing University of Waterloo Waterloo Ontario Canada Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada

Measurement based quantum computation, which requires only single particle measurements on a universal resource state to achieve the full power of quantum computing, has been recognized as one of the most promising models for the physical realization of quantum computers. Despite considerable progress in the past decade, it remains a great challenge to search for new universal resource states with naturally occurring Hamiltonians and to better understand the entanglement structure of these kinds of states. Here we show that most of the resource states currently known can be reduced to the cluster state, the first known universal resource state, via adaptive local measurements at a constant cost. This new quantum state reduction scheme provides simpler proofs of universality of resource states and opens up plenty of space to the search of new resource states.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Converging on the divergent: The history (and future) of the international joint workshops in computational creativity

Converging on the divergent: The history (and future) of the...

引用

作者： Cardoso, Amílcar Veale, Tony Wiggins, Geraint A. Department of Informatics Engineering University of Coimbra Portugal RandD Centre for Informatics and Systems Portugal School of Computer Science University College Dublin Ireland School of Software Engineering Fudan University Shanghai China Department of Computing Centre for Cognition Computation and Culture at Goldsmiths University of London United Kingdom

In this article, we survey the history of studies of computational creativity, following the development of the International Conference on Computational Creativity pom its beginnings, a decade ago, in two parallel workshop series. We give a brief outline of key issues and a summary of the various different approaches taken by participants in the research field. The outlook is optimistic: a lot has been achieved in 10 years. Copyright © 2009, Association for the Advancement of Artificial Intelligence. All rights.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A performance investigation of web caching architectures

A performance investigation of web caching architectures

引用

2008 C3S2E Conference, C3S2E'08

作者： Hurley, R.T. Li, B.Y. Department of Computing and Information Systems Trent University Peterborough ON Canada Software Tester Land Software Engineering Centre Ottawa ON Canada

ISBN: (纸本)9781605581019

Web caching has been recognized as an effective approach to improve performance by storing frequently-accessed documents from originating servers at storage sites "closer" to requesting clients in order to reduce the load on the network bandwidth which in turn can reduce user response time. In this paper, we examine the performance of various architectures for cache cooperation in a web environment. The architectures under consideration include: distributed, hierarchical, and a hybrid of the two. A hierarchical web caching architecture utilizes a series of caches placed at different levels of the network (i.e. client, institutional, regional, and national) and user requests are satisfied at the lowest level possible (the first one that stores the desired document). Distributed web caching incorporates multiple cooperating caches all at the same level. The hybrid approach chosen in this paper contains a hierarchy of distributed caches in the hopes of exploiting advantages from both distributed and hierarchical caching. Using simulation as the tool, we compare the performance (mean response time, overall cache hit rates) of these architectures under a variety of different scenarios in an attempt to identify the conditions under which each is beneficial. Copyright © 2008 ACM.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：