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

2nd International Conference on Advanced Data and Information engineering, DaEng 2015

作者： Noraziah, Ahmad Fauzi, Ainul Azila Che Mohd, Wan Maseri Wan Herawan, Tutut Abdullah, Zailani Faculty of Computer Systems & Software Engineering University of Malaysia Pahang Gambang KuantanPahang26300 Malaysia Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia School of Informatics & Applied Mathematics Universiti Malaysia Terengganu Terengganu Malaysia

ISBN: (纸本)9789811317972

Replication is one of the mechanisms managing data since it improves data access and reliability. However, in recent years, with widely available, low-cost technology, the amount of various data grows rapidly. The problem is although we are packed with data, but we have lacked of knowledge. Nevertheless, if the impractical data is used in database replication, this will cause waste of data storage and the time taken for a replication process will be delayed. This paper propose a new algorithm namely Binary Vote Assignment on Grid Quorum with Association Rule (BVAGQ-AR) in order to handle fragmented database replication. BVAGQ-AR algorithm is capable of partitioning the database into disjoint fragments. Fragmentation in distributed database is very useful in terms of usage, reliability and efficiency. Handling fragmented database replication becomes challenging issue to administrator since the distributed database is scattered into split replica partitions or fragments. We address how to build reliable system by using the proposed BVAGQ-AR algorithm for distributed database fragmentation by using Malaysian Greater Research Network (MyGRANTS) data as a case study. The result shows that managing fragmented database replication through proposed BVAGQ-AR algorithm able to preserve MyGRANTS data consistency. © Springer Nature Singapore Pte Ltd. 2019.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Using measurement and simulation for understanding distributed development processes in the cloud 17

Using measurement and simulation for understanding distribut...

引用

27th International Workshop on software Measurement and 12th International Conference on software Process and Product Measurement, IWSM Mensura 2017

作者： Lunesu, Ilaria Marchesi, Michele Münch, Jürgen Kuhrmann, Marco University of Cagliari Department of Electrical and Electronic Engineering Italy University of Cagliari Department of Mathematics and Computer Science Italy Reutlingen University Business Informatics and Herman Hollerith Center Germany Clausthal University of Technology Institute for Applied Software Systems Engineering Germany

ISBN: (纸本)9781450348539

Organizations increasingly develop software in a distributed manner. The Cloud provides an environment to create and maintain software-based products and services. Currently, it is widely unknown which software processes are suited for Cloud-based development and what their effects in specific contexts are. This paper presents a process simulation to study distributed development in the Cloud. We contribute a simulation model, which helps analyzing different project parameters and their impact on projects carried out in the Cloud. The simulator helps reproducing activities, developers, issues and events in the project, and it generates statistics, e.g., on throughput, total time, and lead and cycle time. The aim of this simulation model is thus to analyze the tradeoffs regarding throughput, total time, project size, and team size. Furthermore, the modified simulation model aims to help project managers select the most suitable planning alternative. Based on observed projects in Finland and Spain, we simulated a distributed project using artificial and real data. Particularly, we studied the variables project size, team size, throughput, and total project duration. A comparison of the real project data with the results obtained from the simulation shows the simulation producing results close to the real data, and we could successfully replicate a distributed software project. By improving the understanding of distributed development processes, our simulation model thus supports project managers in their decision-making. © 2017 Association for Computing Machinery.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

Asymptotic behavior of least squares estimators for nonlinear autoregressive models

引用

science China(Information sciences) 2023年第6期66卷 299-300页

作者： Zhaobo LIU Chanying LI College of Computer Science and Software Engineering Shenzhen University Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences

Dear editor,Estimations of nonlinear autoregressive(AR) models in the literature typically involve ergodic series. Based on this assumption,the asymptotic theory has been established accordingly(see [1–3]). However,t...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reasoning like human: Hierarchical reinforcement learning for knowledge graph reasoning 29

Reasoning like human: Hierarchical reinforcement learning fo...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Wan, Guojia Pan, Shirui Gong, Chen Zhou, Chuan Haffari, Gholamreza School of Computer Science Institute of Artificial Intelligence National Engineering Research Center for Multimedia Software Wuhan University China Faculty of Information Technology Monash University Australia School of Computer Science and Engineering Nanjing University of Science and Technology China Department of Computing Hong Kong Polytechnic University Hong Kong Academy of Mathematics and Systems Science Chinese Academy of Sciences China

ISBN: (纸本)9780999241165

Knowledge Graphs typically suffer from incompleteness. A popular approach to knowledge graph completion is to infer missing knowledge by multi-hop reasoning over the information found along other paths connecting a pair of entities. However, multi-hop reasoning is still challenging because the reasoning process usually experiences multiple semantic issue that a relation or an entity has multiple meanings. In order to deal with the situation, we propose a novel Hierarchical Reinforcement Learning framework to learn chains of reasoning from a Knowledge Graph automatically. Our framework is inspired by the hierarchical structure through which a human being handles cognitionally ambiguous cases. The whole reasoning process is decomposed into a hierarchy of two-level Reinforcement Learning policies for encoding historical information and learning structured action space. As a consequence, it is more feasible and natural for dealing with the multiple semantic issue. Experimental results show that our proposed model achieves substantial improvements in ambiguous relation tasks. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2013: Theory and Practice of computer science 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Peter Emde Boas Frans C. A. Groen Giuseppe F. Italiano Jerzy Nawrocki Harald Sack

ISBN: (数字)9783642358432

ISBN: (纸本)9783642358425

This book constitutes the refereed proceedings of the 39th International Conference on Current Trends in Theory and Practice of computer science, SOFSEM 2013, held in Špindlerův Mlýn, Czech Republic, in January 2013. The 37 revised full papers presented in this volume were carefully reviewed and selected from 98 submissions. The book also contains 10 invited talks, 5 of which are in full-paper length. The contributions are organized in topical sections named: foundations of computer science; software and Web engineering; data, information, and knowledge engineering; and social computing and human factors.

关键词： Discrete mathematics in computer science Algorithm Analysis and Problem Complexity Information Storage and Retrieval software engineering Artificial Intelligence Data Structures

来源：评论

学校读者我要写书评

暂无评论

Adaptive and impulsive cluster synchronization of a general complex dynamical network

Adaptive and impulsive cluster synchronization of a general ...

引用

2010 International Conference on Networking, Sensing and Control, ICNSC 2010

作者： Shi, Bingxiong Lu, Junan Lü, Jinhu Yu, Xinghuo College of Mathematics and Statistics State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China Key Laboratory of Systems and Control Institute of Systems Science Chinese Academy of Sciences Beijing 100190 China School of Electrical and Computer Engineering RMIT University Melbourne 3000 Australia School of Electrical and Computer Engineering RMIT University Melbourne VIC 3001 Australia

ISBN: (纸本)9781424464531

Recently, cluster synchronization has attracted an increasing interest in various disciplines, includingmathematics, physics, and engineering sciences. This paper further investigates the cluster synchronization of a complex dynamical network by using adaptive and impulsive control techniques, respectively. Based on a complex dynamical network with two different clusters, several adaptive and impulsive cluster synchronization criteria are then proposed. It should be especially pointed out that the dynamics and its dimensions of the individual dynamical systems are different in the two different clusters. Also, some numerical simulations are given to verify the effectiveness of the above theoretical results. ©2010 IEEE.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance Impact on Near Field Communication for Data Storage of Mobile Commerce Technology in Cloud Computing 2nd

Fault Tolerance Impact on Near Field Communication for Data ...

引用

2nd International Conference on Advanced Data and Information engineering, DaEng 2015

作者： Noraziah, Ahmad Herawan, Tutut Rahman, Mohd Tarmizi Abd Abdullah, Zailani Mustafa, Balsam A. Fakharaldien, Mohammed Adam Ibrahim Faculty of Computer Systems and Software Engineering University Malaysia Pahang GambangPahang26300 Malaysia Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur50603 Malaysia School of Informatics & Applied Mathematics University Malaysia Terengganu Kuala Terengganu21030 Malaysia

ISBN: (纸本)9789811317972

Fault tolerance is a major concern to guarantee availability and reliability of critical services as well as application execution. Recently, due to rapid expansion of smart phone market and wireless communication environment, mobile devices are considered as resource for large scale distributed processing but there are several drawbacks, such as unstable wireless connection, limitation of data storage capacity, low communication bandwidth and frequent location changes. Cloud systems differ from these previous frameworks in that they are designed to support large numbers of customer-oriented applications, each with different quality of service (QoS) requirements and resource consumption characteristics. As resource providers, mobile devices can join and leave the distributed computing environment unpredictably. This interrupts the undergoing operation, and the delay or failure of completing the operation may cause a system failure. In this paper, we propose a monitoring technique based on Load Balancing. © Springer Nature Singapore Pte Ltd. 2019.

关键词： Mean time between failures

来源：评论

学校读者我要写书评

暂无评论

Constraint programming for path planning with uncertainty: Solving the optimal search path problem

Constraint programming for path planning with uncertainty: S...

引用

18th International Conference on Principles and Practice of Constraint Programming, CP 2012

作者： Morin, Michael Papillon, Anika-Pascale Abi-Zeid, Irène Laviolette, François Quimper, Claude-Guy Department of Computer Science and Software Engineering Université Laval Québec QC Canada Department of Mathematics and Statistics Université Laval Québec QC Canada Department of Operations and Decision Systems Université Laval Québec QC Canada

ISBN: (纸本)9783642335570

The optimal search path (OSP) problem is a single-sided detection search problem where the location and the detectability of a moving object are uncertain. A solution to this -hard problem is a path on a graph that maximizes the probability of finding an object that moves according to a known motion model. We developed constraint programming models to solve this probabilistic path planning problem for a single indivisible searcher. These models include a simple but powerful branching heuristic as well as strong filtering constraints. We present our experimentation and compare our results with existing results in the literature. The OSP problem is particularly interesting in that it generalizes to various probabilistic search problems such as intruder detection, malicious code identification, search and rescue, and surveillance. © 2012 Springer-Verlag.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Data Mining: How Research Meets Practical Development?

引用

Knowledge and Information systems 2003年第2期5卷 248-261页

作者： Wu, Xindong Yu, Philip S. Piatetsky-Shapiro, Gregory Cercone, Nick Lin, T.Y. Kotagiri, Ramamohanarao Wah, Benjamin W. Department of Computer Science University of Vermont BurlingtonVT United States IBM T. J. Watson Research Center HawthorneNY United States KDnuggets BrooklineMA United States School of Computer Science University of Waterloo WaterlooON Canada Department of Mathematics and Computer Science San Jose State University San JoseCA United States Department of Computer Science and Software Engineering University of Melbourne ParkvilleVIC Australia Computer Systems Research Laboratory University of Illinois Urbana-Champaign UrbanaIL United States Department of Computer Science Universityof Vermont BurlingtonVT05405 United States

At the 2001 IEEE International Conference on Data Mining in San Jose, California,on November 29 to December 2, 2001, there was a panel discussion on how datamining research meets practical development. One of the motivations for organizing thepanel discussion was to provide useful advice for industrial people to explore their directionsin data mining development. Based on the panel discussion, this paper presentsthe views and arguments from the panel members, the Conference Chair and the ProgramCommittee Co-Chairs. These people as a group have both academic and industrialexperiences in different data mining related areas such as databases, machine learning,and neural networks. We will answer questions such as (1) how far data mining is frompractical development, (2) how data mining research differs from practical development,and (3) what are the most promising areas in data mining for practical development. © 2003, Springer-Verlag London Limited.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Enhancing Secure Development in Globally Distributed software Product Lines: A Machine Learning-Powered Framework for Cyber-Resilient Ecosystems

引用

computers, Materials & Continua 2024年第6期79卷 5031-5049页

作者： Marya Iqbal Yaser Hafeez Nabil Almashfi Amjad Alsirhani Faeiz Alserhani Sadia Ali Mamoona Humayun Muhammad Jamal University Institute of Information Technology PMAS-Arid Agriculture UniversityRawalpindiPakistan Department of Software Engineering College of Computer and Information SciencesJouf UniversityAl Jouf72388Saudi Arabia Department of Computer Science College of Computer and Information SciencesJouf UniversityAl Jouf72388Saudi Arabia Department of Computer Engineering&Networks College of Computer and Information SciencesJouf UniversityAl Jouf72388Saudi Arabia Department of Information Systems College of Computer and Information SciencesJouf UniversitySakakaAl Jouf72388Saudi Arabia Department of Mathematics Pir Mehr Ali Shah Arid Agriculture UniversityRawalpindiPakistan

Embracing software product lines(SPLs)is pivotal in the dynamic landscape of contemporary software ***,the flexibility and global distribution inherent in modern systems pose significant challenges to managing SPL variability,underscoring the critical importance of robust cybersecurity *** paper advocates for leveraging machine learning(ML)to address variability management issues and fortify the security of *** the context of the broader special issue theme on innovative cybersecurity approaches,our proposed ML-based framework offers an interdisciplinary perspective,blending insights from computing,social sciences,and ***,it employs ML for demand analysis,dynamic feature extraction,and enhanced feature selection in distributed settings,contributing to cyber-resilient *** experiments demonstrate the framework’s superiority,emphasizing its potential to boost productivity and security in *** digital threats evolve,this research catalyzes interdisciplinary collaborations,aligning with the special issue’s goal of breaking down academic barriers to strengthen digital ecosystems against sophisticated attacks while upholding ethics,privacy,and human values.

关键词： Machine Learning variability management cybersecurity digital ecosystems cyber-resilience

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：