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

10th IASTED International Conference on Biomedical Engineering, BioMed 2013

作者： Atupelage, Chamidu Nagahashi, Hiroshi Yamaguchi, Masahiro Kimura, Fumikazu Abe, Tokiya Hashiguchi, Akinori Sakamoto, Michiie Department of Computational Intelligence and Systems Science Tokyo Institute of Technology Japan Imaging Science and Engineering Laboratory Tokyo Institute of Technology Japan Global Scientific Information and Computing Center Tokyo Institute of Technology Japan Department of Pathology School of Medicine Keio University Japan

ISBN: (纸本)9780889869530

Hepatocellular carcinoma (HCC) is graded mainly based on the characteristics of liver cell nuclei. This paper proposes a textural feature descriptor and a novel computational method for classifying liver cell nuclei and grading the HCC histological images. The proposed textural feature descriptor observes local and spatial characteristics of the texture patterns by using multifractal computation. The textural features are utilized for nuclear segmentation, fiber region detection, and liver cell nuclei classification. Four categories of nuclear features are computed such as texture, geometry, spatial distribution, and surrounding texture, for HCC classification. Significance of liver cell nuclei classification method is evaluated by classifying non-neoplastic and tumor tissues. Furthermore, characteristics of the liver cell nuclei were utilized for grading a set of HCC images into four classes and obtained 97.77% classification accuracy.

关键词： Grading

来源：评论

学校读者我要写书评

暂无评论

A MapReduce-based distributed SVM ensemble for scalable image classification and annotation

A MapReduce-based distributed SVM ensemble for scalable imag...

引用

作者： Alham, Nasullah Khalid Li, Maozhen Liu, Yang Qi, Man Nuffield Division of Clinical Laboratory Sciences Radcliffe Department of Medicine University of Oxford OX3 9DU United Kingdom School of Engineering and Design Brunel University Uxbridge Middlesex UB8 3PH United Kingdom Key Laboratory of Embedded Systems and Service Computing Ministry of Education Tongji University China School of Electrical Engineering and Information Systems Sichuan University Chengdu 610065 China Department of Computing Canterbury Christ Church University Canterbury Kent CT1 1QU United Kingdom

A combination of classifiers leads to a substantial reduction of classification errors in a wide range of applications. Among them, support vector machine (SVM) ensembles with bagging have shown better performance in classification than a single SVM. However, the training process of SVM ensembles is notably computationally intensive, especially when the number of replicated training datasets is large. This paper presents MRESVM, a MapReduce-based distributed SVM ensemble algorithm for scalable image annotation which re-samples the training dataset based on bootstrapping and trains an SVM on each dataset in parallel using a cluster of computers. A balanced sampling strategy for bootstrapping is introduced to increase the classification accuracy. MRESVM is evaluated in both experimental and simulation environments, and the results show that the MRESVM algorithm reduces the training time significantly while achieving a high level of accuracy in classifications. © 2013 Elsevier Ltd. All rights reserved.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

Migrating into the cloud: Identifying the major security and privacy concerns

Migrating into the Cloud: Identifying the major security and...

引用

12th IFIP WG 6.11 Conference on e-Business, e-Services, and e-Society, I3E 2013

作者： Kalloniatis, Christos Manousakis, Vassilis Mouratidis, Haralambos Gritzalis, Stefanos Department of Cultural Technology and Communication University of the Aegean University Hill GR 81100 Mytilene Greece School of Architecture Computing and Engineering University of East London Docklands Campus 4-6 University Way E16 2RD London United Kingdom Information and Communication Systems Security Laboratory Department of Information and Communications Systems Engineering University of the Aegean GR 83200 Samos Greece

ISBN: (纸本)9783642374364

cloud computing is without a doubt one of the most significant innovations presented in the global technological map. The number of potential users enrolling and using cloud services increases exponentially on a daily bases. The great demand from online users for cloud services along with the reduced operational costs that the latter offers has motivated many organisations and companies to consider migrating organizational services, data and applications on the cloud. However, despite the various positive characteristics of all cloud service models like reduced costs, better availability insurance, on demand data storage and computation power, cloud migration may hinder various security and privacy issues that need to be considered before an organization or company decides to move on to the cloud. This paper aims to reveal the major security and privacy concepts for all three cloud service models and through a systematic analysis to guide the organization's stakeholders in deciding which service model best fits their needs based on their security and privacy requirements. © IFIP International Federation for information Processing 2013.

关键词： Cost reduction

来源：评论

学校读者我要写书评

暂无评论

Effect on generalization of using relational information in list-wise algorithms

Effect on generalization of using relational information in ...

引用

Joint International Conference on Pervasive computing and the Networked World, ICPCA/SWS 2012

作者： Chen, Guohua Tang, Yong Tang, Feiyi Ding, Shijin He, Chaobo School of Mathematical Sciences Souch China Normal University Guangzhou 510631 Guangdong China Shenzhen Engineering Laboratory for Mobile Internet Application Middleware Technology Shenzhen 518060 Guangdong China School of Computer Science Souch China Normal University Guangzhou 510631 Guangdong China School of Computing and Information Systems Univerisity of Melbourne VIC 3010 Australia

ISBN: (纸本)9783642370144

Learning to rank became a hot research topic in recent years and utilizing relational information in list-wise algorithms was discovered to be valuable and was widely adopted in various algorithms. These algorithms' empirical performances were usually given, but few of them conduct theoretical analysis on the generalization bound. Based on the theory of Rademacher Average, we derive the generalization bound of ranking relational objects algorithms and discuss the effect on the generalization bound of using this method. Especially, an interesting property of ranking relational objects algorithms for Topic Distillation was discovered: the generalization bound does not depend on the size of documents in each query in training set. Experiments are conducted to verify this property. © 2013 Springer-Verlag.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

An empirical analysis of social interaction on tobacco-oriented social networks

An empirical analysis of social interaction on tobacco-orien...

引用

2013 International Conference for Smart Health, ICSH 2013

作者： Liang, Yunji Zheng, Xiaolong Zeng, Daniel Dajun Zhou, Xingshe Leischow, Scott School of Computer Science Northwestern Polytechnical University Xi'an China Department of Management Information System University of Arizona Tucson AZ United States State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Dongguan Research Institute of CASIA Cloud Computing Center Chinese Academy of Sciences Songshan Lake Dongguan China Mayo Clinic in Arizona Phoenix AZ United States

ISBN: (纸本)9783642398438

Social media is widely utilized in the tobacco control campaigns. It is a great challenge to evaluate the efficiency of tobacco control policies on social network sites and find gaps among tobacco-oriented social networks. In this paper, we construct three tobacco-oriented social networks according to user interaction on Facebook tobacco-related fan pages. We further investigate the interaction patterns including temporal distribution and interaction patterns to reveal the differences of tobacco-oriented social networks. Our empirical analysis demonstrates that: 1) the user interaction on the pro-tobacco fan pages is more active. Fan pages for tobacco promotion are more successful in obtaining more user attention. 2) The gap between tobacco promotion and tobacco control is widening. These empirical results can provide us significant insights into understanding the evolutionary patterns of social interaction in tobacco-oriented social networks and further help the government departments of tobacco control to make reasonable decisions. © 2013 Springer-Verlag.

关键词： Tobacco

来源：评论

学校读者我要写书评

暂无评论

The role of trust in the development and adoption of cultural internet-based systems 10

The role of trust in the development and adoption of cultura...

引用

10th European, Mediterranean and Middle Eastern Conference on information systems - Transforming Societies: Managing the Change!, EMCIS 2013

作者： Pavlidis, Michalis Kavakli, Evangelia Bantimaroudis, Philemon Mouratidis, Haralambos Kalloniatis, Christos Gritzalis, Stefanos School of Architecture Computing and Engineering University of East London Docklands Campus 4-6 University Way LondonE16 2RD United Kingdom Cultural Informatics Laboratory Department of Cultural Technology and Communication University of the Aegean University Hill MytileneGR 81100 Greece Department of Cultural Technology and Communication University of the Aegean University Hill MytileneGR 81100 Greece School of Architecture Computing and Engineering University of East London Docklands Campus 4-6 University Way LondonE16 2RD United Kingdom Laboratory of Information and Communication Systems Security Department of Information and Communication Systems Engineering University of the Aegean Karlovassi SamosGR 83200 Greece

ISBN: (纸本)9781908549112

This paper examines the importance of trust factors in the development and adoption of internet based cultural information systems. The proposed trust model identifies the relationship between user communication goals and trust parameters from both technical and social perspectives. To this end, it combines uses and gratifications theory as well as the notion of organisational reputation in order to identify the system’s expected behaviour, i.e., what things the system needs to do in order to be trusted by the users, together with a trust modelling methodology in order to explicitly model and analyse trust assumptions. The approach is explained through an example demonstrating how reasoning about trust relationships affects the development of cultural internet-based systems. © 2013 European and Mediterranean Conference on information systems. All rights reserved.

关键词： information systems

来源：评论

学校读者我要写书评

暂无评论

Toward a Fully Automatic Learner Modeling Based on Web Usage Mining with Respect to Educational Preferences and Learning Styles

Toward a Fully Automatic Learner Modeling Based on Web Usage...

引用

International Conference on Advanced Learning Technologies (ICALT)

作者： Mohamed Koutheaïr Khribi Mohamed Jemni Olfa Nasraoui Sabine Graf Kinshuk Technologies of Information and Communication Laboratory Higher School of Sciences and Technologies of Tunis University of Tunis Tunisia Knowledge Discovery & Web Mining Laboratory Speed School of Engineering University of Louisville Louisville KY USA School of Computing and Information Systems Athabasca University Canada

ISBN: (纸本)9781479903733

In this paper, we describe a fully automatic learner modeling approach in learning management systems, taking into account learners' educational preferences including learning styles. We propose a learner model with three components: the learner's profile, learner's knowledge, and learner's educational preferences. The learner's profile represents the learner's general information such as identification data, the learner's knowledge implies the learner's interests on visited learning objects, and the learner's educational preferences are composed of the learner's preferences among visited learning objects and his/her learning style. In the proposed approach, all learner model components are automatically detected, without requiring explicit feedback. Indeed, all the basic learners' information is inferred from the learners' online activities and usage data, based on web usage mining techniques and a literature-based approach for the automatic detection of learning styles in learning management systems. Once learner models are built, we apply a hierarchical multi-level model based collaborative filtering approach, in order to gather learners with similar preferences and interests in the same groups.

关键词： Computational modeling Collaboration Frequency measurement Least squares approximations Vectors Filtering Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks

Efficient public key cryptosystem resilient to key leakage c...

引用

Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013

作者： Liu, Shengli Weng, Jian Zhao, Yunlei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Software School Fudan University Shanghai 201203 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (纸本)9783642360947

Leakage-resilient public key encryption (PKE) schemes are designed to resist "memory attacks", i.e., the adversary recovers the cryptographic key in the memory adaptively, but subject to constraint that the total amount of leaked information about the key is bounded by some parameter λ. Among all the IND-CCA2 leakage-resilient PKE proposals, the leakage-resilient version of the Cramer-Shoup cryptosystem (CS-PKE), referred to as the KL-CS-PKE scheme proposed by Naor and Segev in Crypto09, is the most practical one. But, the key leakage parameter λ and plaintext length m of KL-CS-PKE are subject to λ + m ≤ log q - ω(log κ), where κ is security parameter and q is the prime order of the group on which the scheme is based. Such a dependence between λ and m is undesirable. For example, when λ (resp., m) approaches to log q, m (resp., λ) approaches to 0. In this paper, we designed a new variant of CS-PKE that is resilient to key leakage chosen ciphertext attacks. Our proposal is λ ≤ log q - ω(log κ) leakage-resilient, and the leakage parameter λ is independent of the plaintext space that has the constant size q (exactly the same as that in CS-PKE). The performance of our proposal is almost as efficient as the original CS-PKE. As far as we know, this is the first leakage-resilient CS-type cryptosystem whose plaintext length is independent of the key leakage parameter, and is also the most efficient IND-CCA2 PKE scheme resilient to up to log q - ω(log κ) leakage. © 2013 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “A novel approach to collaborative testing in a crowdsourcing environment” in the Journal of systems and Software 86 (2013) 2143–2153

引用

Journal of systems and Software 2014年 87卷 137-137页

作者： Yuan-Hsin Tung Shian-Shyong Tseng Wei-Tek Tsai Department of Computer Science and Information Engineering National Chiao Tung University Taiwan ROC Telecommunication Laboratory Chunghwa Telecom Co. Ltd. Taiwan ROC Department of Applied Informatics and Multimedia Asia University Taiwan ROC School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA

来源：评论

学校读者我要写书评

暂无评论

An Extensible Digital Library Service to Support Network Science

引用

Procedia Computer Science 2013年 18卷 419-428页

作者： S.M. Shamimul Hasan Keith Bisset Edward A. Fox Kevin Hall Jonathan P. Leidig Madhav V. Marathe Department of Computer Science Virginia Tech Blacksburg VA 24061 USA Network Dynamics and Simulation Science Laboratory VBI Virginia Tech Blacksburg VA 24061 USA School of Computing & Information Systems Grand Valley State University Allendale MI 49401 USA

Network science research aims to understand the underlying properties of complex networks. Large-scale modeling and simulation is the core of network science research. Existing systems take a long time to run large network science experiments with high performance computing resources. Scientific data management systems currently lack the performance efficiency needed to support this type of computation and data-intensive research. Memoization provides the ability to index, archive, and reuse frequently requested and expensive to re-compute datasets. In this paper, a domain independent memoization service to increase the computational execution process performance within cyberinfrastructure-based systems is described. The service is formulated as an extensible memoization framework for the computational and simulation network science domains that is built on top of well-defined metadata objects. We present extensible concepts, discuss the proposed algorithm and framework architecture, and examine the flexible nature of the framework. The framework was utilized as a part of the CINET cyberinfrastructure-based digital library (DL). Our experimental results indicate an increase in the efficiency of the system and recommendation of the service's inclusion in scientific DLs.

关键词： Algorithm Cyberinfrastructure Memoization Network Science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：