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

IEEE Annual Conference on Decision and Control

作者： Jiahu Qin Qichao Ma Wei Xing Zheng Huijun Gao Department of Automation University of Science and Technology of China Hefei 230027 China School of Computing Engineering and Mathematics Western Sydney University Sydney NSW 2751 Australia Research Institute of Intelligent Control and Systems Harbin Institute of Technology Harbin 150001 China

ISBN: (纸本)9781479978878

In this paper, the problem of H_∞ group consensus is addressed for networks of agents modeled by single-integrator with model uncertainty and external disturbance. The first part of the work is to show that the group consensus with desired H_∞ performance can be achieved under some sufficient conditions that are established in terms of the structure and strength of the couplings among agents. Then given the observation that the theoretical values of the coupling strengths are usually much larger than expected in practical situations, the second part of the work is concerned with developing an adaptation law to tackle such coupling strength problem.

关键词： model uncertainty external disturbance Agents theoretical value Couplings Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

Design and Comparison of Collaborative Filtering Technology for Product Suggestions in E-Commerce 1

Design and Comparison of Collaborative Filtering Technology ...

引用

1st IEEE International Conference on Automation, computing and Renewable systems, ICACRS 2022

作者： Rajasekar, P. Mohanraj, B. Padhi, S.N. Sivakumar, N. Lavanya, J. Charles Prabu, V. Department of Data Science and Business Systems School of Computing SRM Institute of Science and Technology Tamil Nadu Chennai603203 India Department of Information Technology Karpagam College of Engineering Tamil Nadu Coimbatore641032 India Department of Mechanical Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vaddeswaram522302 India Department of Computer Science and Engineering Panimalar Engineering College Chennai City Campus Tamil Nadu Chennai600029 India Department of Fashion Designing SRM Institute of Science and Technology CSH Kattankulathur campus Tamil Nadu Chennai603203 India Department of Computer Science Engineering Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Tamil Nadu Chennai600 062 India

ISBN: (纸本)9781665460842

E-commerce websites and internet purchasing have never been more necessary. Product recommendations are a key tactic employed by online buying platforms. This study compares two different filtering algorithms that are used in product recommendationson websites like Amazon and Flipkart. Reviews of electrical devices, user data, and timestamps were all gathered from Kaggle and put into a dataset. These specifics then undergo several preprocessing steps. The steps are data visualization, duplicate value analysis, missing value analysis, and datatype analysis. The exhibited data is then used to train and test the machine learning models. For this purpose, two machine learning models are developed using two different algorithms. The algorithms K-Nearest Neighbor(KNN) and Support Vector Decomposition (SVD) are employed. The models are then trained to acquire used in the prediction procedure after that. The best models for the prediction process are then determined by scrutinizing the results of both models. The Root Mean Square Error (RMSE), Mean Square Error (MSE), and Mean Absolute Error (MAE) values are located and compared because the findings of the analysis weren't *** erroneous data are plotted into a graph and evaluated to further demonstrate the point. As the SVD method is discovered to be the best of the group, the algorithm's greatest and worst predictions are discovered and examined. Even the poorest model constructed for the study's predictions turned out to be superior to several other prediction algorithms used for product suggestions. This algorithm can be deployed into the backend of any e-commerce website making it more effective. © 2022 IEEE

关键词： Value engineering

来源：评论

学校读者我要写书评

暂无评论

On the scalability of particle swarm optimisation

On the scalability of particle swarm optimisation

引用

Congress on Evolutionary Computation

作者： Sebastien Piccand Michael O'Neill Jacqueline Walker Department of Computer Science ' Information Systems University of Limerick Limerick Ireland Natural Computing Research ' Applications group School of Computer Science ' Informatics University College Dublin Dublin Ireland Department of Electronic and Computer Engineering University of Limerick Limerick Ireland

Particle swarm has proven to be competitive to other evolutionary algorithms in the field of optimization, and in many cases enables a faster convergence to the ideal solution. However, like any optimization algorithm it seems to have difficulties handling optimization problems of high dimension. Here we first show that dimensionality is really a problem for the classical particle swarm algorithms. We then show that increasing the swarm size can be necessary to handle problem of high dimensions but is not enough. We also show that the issue of scalability occurs more quickly on some functions.

关键词： Benchmark testing Topology Particle swarm optimization Scalability Evolutionary computation Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

On the ideal interpolation operator in algebraic multigrid methods

arXiv

引用

arXiv 2017年

作者： Xu, Xuefeng Zhang, Chen-Song LSEC Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China LSEC & NCMIS Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

Various algebraic multigrid algorithms have been developed for solving problems in scientific and engineering computation over the past decades. They have been shown to be well-suited for solving discretized partial differential equations on unstructured girds in practice. One key ingredient of algebraic multigrid algorithms is a strategy for constructing an effective prolongation operator. Among many questions on constructing a prolongation, an important question is how to evaluate its quality. In this paper, we establish new characterizations (including sufficient condition, necessary condition, and equivalent condition) of the so-called ideal interpolation operator. Our result suggests that, compared with common wisdom, one has more room to construct an ideal interpolation, which can provide new insights for designing algebraic multigrid algorithms. Moreover, we derive a new expression for a class of ideal interpolation operators.65F10, 65F15, 65N55 Copyright © 2017, The Authors. All rights reserved.

关键词： Coarsening

来源：评论

学校读者我要写书评

暂无评论

Cyber-Physical -Social systems for Smart Cities: An Overview

Cyber-Physical -Social Systems for Smart Cities: An Overview

引用

Digital Twins and Parallel Intelligence (DTPI), IEEE International Conference on

作者： Noreen Anwar Gang Xiong Wanze Lu Peijun Ye Hongxia Zhao Qinglai Wei The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China The Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation and with The Cloud Computing Center Chinese Academy of Sciences China School of Artificial Intelligence and Automation Beijing University of Technology Beijing China

Cyber-physical social systems (CPSS) include cyberspace, physical space, and social space. Since the introduction of CPSS, human relationships with machinery and the physical world have altered as a new paradigm. Recent estimates indicate that approximately 60 percent of the world's population will live in cities by 2030. Large, dense cities can be highly productive, innovative, and very green per capita, hence ideal for our future. However, the huge influx of new people poses enormous challenges to their administrations. Smart cities are becoming a reality, therefore, to achieve higher efficiency, optimum use of resources, management and to strengthen several features of modern towns, several elements of modern cities are automated and integrated into Information and Communications Technology (ICT). Cities and infrastructure are growing all over the world, in providing end-users with increased performance, comfort, visibility and convenience, the Smart Cities concept is critical. This paper will discuss smart cities and the CPSS concept intensively with some of its key technologies, challenges, and further development by using CPSS.

关键词： Smart cities Digital twin Sociology Information and communication technology Security Resource management Statistics

来源：评论

学校读者我要写书评

暂无评论

Universality, criticality and complexity of information propagation in social media

arXiv

引用

arXiv 2021年

作者： Notarmuzi, Daniele Castellano, Claudio Flammini, Alessandro Mazzilli, Dario Radicchi, Filippo Center for Complex Networks and Systems Research Luddy School of Informatics Computing and Engineering Indiana University BloomingtonIN47408 United States Via dei Taurini 19 RomaI-00185 Italy Centro Fermi Via Panisperna 89 A Roma Italy

Information avalanches in social media are typically studied in a similar fashion as avalanches of neuronal activity in the brain. Whereas a large body of literature reveals substantial agreement about the existence of a unique process characterizing neuronal activity across organisms, the dynamics of information in online social media is far less understood. Statistical laws of information avalanches are found in previous studies to be not robust across systems, and radically different processes are used to represent plausible driving mechanisms for information propagation. Here, we analyze almost 1 billion time-stamped events collected from a multitude of online platforms – including Telegram, Twitter and Weibo – over observation windows longer than 10 years to show that the propagation of information in social media is a universal and critical process. Universality arises from the observation of identical macroscopic patterns across platforms, irrespective of the details of the specific system at hand. Critical behavior is deduced from the power-law distributions, and corresponding hyperscaling relations, characterizing size and duration of avalanches of information. Neuronal activity may be modeled as a simple contagion process, where only a single exposure to activity may be sufficient for its diffusion. On the contrary, statistical testing on our data indicates that a mixture of simple and complex contagion, where involvement of an individual requires exposure from multiple acquaintances, characterizes the propagation of information in social media. We show that the complexity of the process is correlated with the semantic content of the information that is propagated. Conversational topics about music, movies and TV shows tend to propagate as simple contagion processes, whereas controversial discussions on political/societal themes obey the rules of complex contagion. © 2021, CC BY.

关键词： Information dissemination

来源：评论

学校读者我要写书评

暂无评论

Style Factorization: Explore Diverse Style Variation for Domain Generalization

Style Factorization: Explore Diverse Style Variation for Dom...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Ting Peng Yizhi Luo Yuqi Li Chuanguang Yang Ajian Liu Ziqiao Weng School of Digital Technology and Engineering Ningbo University of Finance and Economic China Institute of Computing Technology Chinese Academy of Sciences China The State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China The University of Sydney

Deep neural networks (DNNs) exhibit noticeable performance degradation when exposed to out-of-distribution samples during testing. This degradation occurs due to the fact that the statistical characteristics (mean and standard deviation) of the features reflect the domain-specific properties of the training data, causing DNNs to be biased towards unseen distributions. One prominent approach to mitigate this bias is training networks with style augmented data, which helps alleviate the reliance on specific style distributions. However, existing methods either have limitations in terms of the number of styles they can handle or rely on intricate pipelines. In this paper, we propose a novel and simple approach called Style Factorization (StylF) to generate novel styles by identifying the directions that exhibit the most significant variations in style. We formulate this problem as a constrained optimization task and decompose the feature statistics matrix of the training data to generate meaningful and diverse novel styles. Through extensive experiments conducted on three publicly available domain generalization benchmarks (PACS, OfficeHome, DomainNet), we demonstrate that our proposed method achieves SOTA performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A SLA-Oriented Management of Containers for Hosting Stateful Web Services

A SLA-Oriented Management of Containers for Hosting Stateful...

引用

IEEE International Conference on e-Science and Grid computing

作者： Christoph Reich Kris Bubendorfer Matthias Banholzer Rajkumar Buyya Department of Computer Science Hochschule Furtwangen University Germany School of Mathematics Statistics and Computer Science Victoria University of Wellington New Zealand Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Service-oriented architectures provide integration of interoperability for independent and loosely coupled services. Web services and the associated new standards such as WSRF are frequently used to realise such service-oriented architectures. In such systems, autonomic principles of self-configuration, self-optimisation, self-healing and self- adapting are desirable to ease management and improve robustness. In this paper we focus on the extension of the self management and autonomic behaviour of a WSRF container connected by a structured P2P overlay network to monitor and rectify its QoS to satisfy its SIAs. The SLA plays an important role during two distinct phases in the life-cycle of a WSRF container. Firstly during service deployment when services are assigned to containers in such a way as to minimise the threat of SLA violations, and secondly during maintenance when violations are detected and services are migrated to other containers to preserve QoS. In addition, as the architecture has been designed and built using standardised modern technologies and with high levels of transparency, conventional Web services can be deployed with the addition of a SLA specification.

关键词： Containers Web services Service oriented architecture Quality of service Computer science Monitoring Grid computing Conference management engineering management Mathematics

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Mapping network states using connectivity queries

arXiv

引用

arXiv 2020年

作者： Rodríguez, Alexander Adhikari, Bijaya González, Andrés D. Nicholson, Charles Vullikanti, Anil Aditya Prakash, B. College of Computing Georgia Institute of Technology United States Department of Computer Science University of Iowa United States School of Industrial and Systems Engineering University of Oklahoma United States Biocomplexity Institute Department of Computer Science University of Virginia United States

Can we infer all the failed components of an infrastructure network, given a sample of reachable nodes from supply nodes? One of the most critical post-disruption processes after a natural disaster is to quickly determine the damage or failure states of critical infrastructure components. However, this is nontrivial, considering that often only a fraction of components may be accessible or observable after a disruptive event. Past work has looked into inferring failed components given point probes, i.e. with a direct sample of failed components. In contrast, we study the harder problem of inferring failed components given partial information of some ‘serviceable’ reachable nodes and a small sample of point probes, being the first often more practical to obtain. We formulate this novel problem using the Minimum Description Length (MDL) principle, and then present a greedy algorithm that minimizes MDL cost effectively. We evaluate our algorithm on domain-expert simulations of real networks in the aftermath of an earthquake. Our algorithm successfully identifies failed components, especially the critical ones affecting the overall system performance. Copyright © 2020, The Authors. All rights reserved.

关键词： Probes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：