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

IoT network slicing on virtual layers of homogeneous data for improved algorithm operation in smart buildings

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2020年 102卷 965-977页

作者： Casado-Vara, Roberto Martin-del Rey, Angel Affes, Soffiene Prieto, Javier Corchado, Juan M. Univ Salamanca BISITE Res Grp Calle Espejo 2 Salamanca 37007 Spain IoT Digital Innovat Hub Spain Air Inst Calle Segunda 4 Salamanca 37188 Spain Osaka Inst Technol Dept Elect Informat & Commun Fac Engn Osaka 5358585 Japan Univ Malaysia Kelantan Pusat Komputeran Informat Karung Berkunci 36 Kota Baharu 16100 Kelantan Malaysia Univ Salamanca Dept Appl Math Calle Parque 2 E-37008 Salamanca Spain Univ Salamanca Inst Fundamental Phys & Math Dept Appl Math Calle Parque 2 E-37008 Salamanca Spain INRS EMT 800 Gauchetiere OuestBur 6900 Montreal PQ H5A 1K6 Canada

With its strong coverage, low energy consumption, low cost and great connectivity, the Internet of Things technology has become the key technology in smart cities. However, faced with a large number of terminals, the rational allocation of limited resources, the topology and non-uniformity of smart buildings, the fusion of heterogeneous data become important trends in Internet of Things research. As a result, this paper proposes a novel technique for processing heterogeneous temperature data collected by an IoT network in a smart building and transforms them into homogeneous data that can be used as an input for monitoring and control algorithms in smart buildings, optimizing their performance. The proposed technique, called IoT slicing, combines complex networks and clusters in order to reduce algorithm input errors and improve the monitoring and control of a smart building. For validating the efficiency of the algorithm, it is proposed as a case study using the IoT slicing technique to improve the operation of an algorithm to self-correct outliers in data collected by IoT networks. The results of the case study confirm, irrefutably, the effectiveness of the proposed method. (C) 2019 Elsevier B.V. All rights reserved.

关键词： IoT Complex networks Clustering Layer slicing algorithm design Data quality

来源：评论

学校读者我要写书评

暂无评论

Tracing Truth and Rumor Diffusions Over Mobile Social Networks: Who are the Initiators?

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2023年第4期22卷 2473-2490页

作者： Qu, Shan Xu, Hui Fu, Luoyi Long, Huan Wang, Xinbing Chen, Guihai Zhou, Chenghu Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Dept Comp Sci Shanghai 200240 Peoples R China Chinese Acad Sci Inst Geog Sci & Nat Resources Res Beijing 100101 Peoples R China

With the increasing popularity of mobile devices, each user is able to conveniently acquire messages from others, and share diverse forms of information, like texts, images, or videos through online mobile apps. The full freedom of speech makes a great amount of truth (i.e., true information) and rumor (i.e., false information) propagate rapidly in a hybrid way through mobile platforms. As a huge variety of information floods pouring over us each day, identifying the authenticity of massive events becomes a necessary task to maintain the stability of Mobile Social Networks (MSNs). An important way to realize it is to trace their diffusions and make judgements according to the reliability of sources. With this regard, this paper proposes a diffusion model that characterizes the simultaneous diffusion of both truth and rumor in realistic MSNs, and makes the first attempt to figure out their respective sources. The problem of interest can be stated as: Given an outcome of cascade of both truth and rumor in MSNs, i.e., a set of nodes that might be the ignorant, the spreader of truth or rumor, or simply the silent receiver, how can we infer both truth sources and rumor sources? Different from previous sources detection works considering single type of nodes, the interplay between truth diffusions and rumor diffusions makes the conventional methods not work. To answer this question, we aim to maximize the similarity index, i.e., the number of nodes possessing the same states between the resulting network triggered by our estimated sources with the proposed diffusion model and the given observation network. Compared with existing techniques to trace diffusions of truth or rumor, it is much harder to find two kinds of sets at the same time, including truth sources and rumor sources, due to two primary reasons: (i) our biset optimization makes the submodularity techniques fail;(ii) our objective function is proven to be non-bisubmodular. To overcome above limitations, we fir

关键词： Social networking (online) Optimization Indexes Blogs Diffusion processes Approximation algorithms Integrated circuit modeling Sources detection simultaneous diffusions of truth and rumor mobile social network algorithm design

来源：评论

学校读者我要写书评

暂无评论

Distributed construction and maintenance of bandwidth and energy efficient bluetooth scatternets

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2006年第9期17卷 963-974页

作者： Tekkalmaz, Metin Sozer, Hasan Korpeoglu, Ibrahim ASELSAN AS MST YMM REH Ankara Turkey Univ Twente Fac Elect Engn Math & Informat Software Engn Res Grp NL-7500 AE Enschede Netherlands Bilkent Univ Dept Comp Engn TR-06800 Ankara Turkey

Bluetooth networks can be constructed as piconets or scatternets depending on the number of nodes in the network. Although piconet construction is a well-defined process specified in Bluetooth standards, scatternet formation policies and algorithms are not well specified. Among many solution proposals for this problem, only a few of them focus on efficient usage of bandwidth in the resulting scatternets. In this paper, we propose a distributed algorithm for the scatternet formation problem that dynamically constructs and maintains a scatternet based on estimated traffic flow rates between nodes. The algorithm is adaptive to changes and maintains a constructed scatternet for bandwidth-efficiency when nodes come and go or when traffic flow rates change. Based on simulations, the paper also presents the improvements in bandwidth-efficiency and reduction in energy consumption provided by the proposed algorithm.

关键词： bluetooth scatternet formation ad hoc networks network topology algorithm design distributed computing

来源：评论

学校读者我要写书评

暂无评论

QUANTUM ANT COLONY OPTIMIZATION algorithm BASED ON BLOCH SPHERICAL SEARCH

引用

NEURAL NETWORK WORLD 2012年第4期22卷 325-341页

作者： Li, Panchi Wang, Haiying Daqing Petr Inst Sch Comp & Informat Technol Daqing 163318 Peoples R China

In the existing quantum-behaved optimization algorithms, almost all of the individuals are encoded by qubits described on plane unit circle. As qttbits contain only a variable parameter, quantum properties have not been fully embodied, which limits the optimization ability rise further. In order to solve this problem, this paper proposes a quantum ant colony optimization algorithm based on Bloch sphere search. In the proposed algorithm, the positions of ants are encoded by qubits described on Bloch sphere. First, the destination to move is determined according to the select probability constructed by the pheromone and heuristic information, then, the rotation axis is established with Pauli matrixes, and the evolution search is realized with the rotation of qubits on Bloch sphere. In order to avoid premature convergence, the mutation is performed with Hadamard gates. Finally, the pheromone and the heuristic information are updated in the new positions of ants. As the optimization process is performed in n-dimensional hypercube space [-1, 1](n), which has nothing to do with the specific issues, hence, the proposed method has good adaptability for a variety of optimization problems. The simulation results show that the proposed algorithm is superior to other quantum-behaved optimization algorithms in both search ability and optimization efficiency.

关键词： Ant colony optimization quantum ant colony optimization Bloch sphere algorithm design

来源：评论

学校读者我要写书评

暂无评论

An Improved Count-Based Classifier for Categorical Data

引用

IEEE ACCESS 2024年 12卷 125427-125445页

作者： Singh, Sanskriti Sanjay Kumar Chauhan, Alok Vellore Inst Technol Sch Comp Sci & Engn Chennai 600127 India

The classification of categorical data is a fundamental task in machine learning, with numerous algorithms and techniques available. However, existing approaches often face challenges related to interpretability, scalability, and handling sparse or imbalanced datasets. This study presents an optimized version of the Count-Based Classifier, a novel approach that leverages the simplicity of counting occurrences to perform classification on categorical data. The optimized algorithm addresses the limitations of the original Count-Based Classifier, improving its computational efficiency, robustness, and overall performance. Through a comprehensive evaluation across 21 diverse categorical datasets, the Optimized Count-Based Classifier demonstrates competitive performance, consistently matching or surpassing established classifiers such as Decision Trees, Support Vector Machines, etc. The classifier's inherent interpretability, stemming from its reliance on counting operations, is a valuable asset, particularly in domains where transparency and explainability are crucial. Furthermore, the study explores the classifier's characteristics, including its tendency for overfitting, result consistency, and robustness against label errors. Experimental analyses reveal a low propensity for overfitting, high result consistency, and remarkable resilience to mislabeled data, further solidifying the classifier's practical applicability. The Optimized Count-Based Classifier has been implemented in Python and deployed as a user-friendly package, fostering accessibility and adoption within the machine learning community. By addressing the limitations of traditional approaches and offering a simple yet effective solution, this work contributes to the advancement of count-based classification techniques and their application in real-world scenarios.

关键词： Classification algorithms Training Boosting Support vector machines Prediction algorithms Noise measurement Scalability algorithm design and theory Machine learning Supervised learning algorithm design classification algorithm count-based classifier machine learning supervised learning

来源：评论

学校读者我要写书评

暂无评论

A concurrent red-black tree

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2013年第4期73卷 434-449页

作者： Besa, Juan Eterovic, Yadran Pontificia Univ Catolica Chile Dept Comp Sci Santiago Chile

With the proliferation of multiprocessor computers, data structures capable of supporting several processes are a growing need. Concurrent data structures seek to provide similar performance to sequential data structures while being accessible concurrently by several processes and providing synchronization mechanisms transparently to those processes. Red-black trees are an important data structure used in many systems. Unfortunately, it is difficult to implement an efficient concurrent red-black tree for shared memory processes;so most research efforts have been directed towards other dictionary data structures, mainly skip-lists and AVL trees. In this paper we present a new type of concurrent red-black tree that uses optimistic concurrency techniques and new balancing operations to scale well and support contention. Our tree performs favorably compared to other similar dictionaries;in particular, in high contention scenarios it performs up to 14% better than the best-known concurrent dictionary solutions. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Concurrent data structure Red-black tree algorithm design

来源：评论

学校读者我要写书评

暂无评论

A family of truthful mechanisms for resource allocation with multi-attribute demand in mobile edge computing

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2024年第8期27卷 11595-11610页

作者： Liu, Xi Liu, Jun Wu, Hong Dong, Jing Qujing Normal Univ Sch Informat Engn Key Lab Intelligent Sensor & Syst Design Sanjiang Ave Qujing 655000 Yunnan Peoples R China Yunnan Coll Business Management Sch Educ Kunming 650000 Yunnan Peoples R China

We address the problem of resource allocation with multi-attribute demand considering heterogeneous servers in mobile edge computing (MEC). A mobile device (MD) may be within the coverage area of multiple access points and can get resources from any server that can establish direct communication. However, the configurations of heterogeneous servers are different, so the demand for each MEC server is different. We tackle this problem and consider multi-attribute demand, where each MD is assigned exactly one of multiple demands. We formulate the allocation problem in an auction-based setting to provide server scalability. We propose a family of greedy mechanisms to solve the resource allocation problem. However, each MD is self-interested and may try to manipulate the system to maximize its utility. We show our mechanisms are truthful, and they drive the system into an equilibrium where no MD can declare an untrue value to obtain higher utility. We also analyze the approximation ratios of our greedy mechanisms. Experimental results demonstrate that the greedy mechanisms obtain the near-optimal allocation in a short period while benefiting MDs and edge cloud providers.

关键词： Mobile edge computing Truthfulness Resource allocation algorithm design

来源：评论

学校读者我要写书评

暂无评论

Hybrid evolutionary programming using adaptive Levy mutation and modified Nelder-Mead method

引用

SOFT COMPUTING 2019年第17期23卷 7913-7939页

作者： Pang, Jinwei He, Jun Dong, Hongbin Harbin Engn Univ Dept Comp Sci & Technol Harbin Heilongjiang Peoples R China Nottingham Trent Univ Sch Sci & Technol Clifton Campus Nottingham NG11 8NS England

Evolutionary programming has been widely applied to solve global optimization problems. Its performance is related to both mutation operators and fitness landscapes. In order to make evolutionary programming more efficient, its mutation operator should adapt to fitness landscapes. The paper presents novel hybrid evolutionary programming with adaptive Levy mutation, in which the shape parameter of Levy probability distribution adapts to the roughness of local fitness landscapes. Furthermore, a modified Nelder-Mead method is added to evolutionary programming for enhancing its exploitation ability. The proposed algorithm is tested on 39 selected benchmark functions and also benchmark functions in CEC2005 and CEC2017. The experimental results demonstrate that the overall performance of the proposed algorithm is better than other algorithms in terms of the solution accuracy.

关键词： Global optimization Evolutionary programming Fitness landscape Levy distribution Nelder-Mead method algorithm design

来源：评论

学校读者我要写书评

暂无评论

Demand-driven publish/subscribe in mobile environments

引用

WIRELESS NETWORKS 2010年第8期16卷 2237-2261页

作者： Ouksel, Aris M. Lundquist, Doug Univ Illinois Dept Informat & Decis Sci Chicago IL 60680 USA

We propose a novel routing protocol, Self-Balancing Supply/Demand (SBSD), for Publish/Subscribe in mobile ad hoc environments. SBSD is a controlled flooding that reduces network congestion by constraining how far subscriptions replicate and how many times nodes broadcast them. SBSD ranks subscriptions by a utility function. This function matches the supply of publications with the recent demand for them;more popular subscriptions are replicated farther and their replicas are retained longer. SBSD is therefore demand-driven, as more popular subscriptions are more likely to receive their matching publications and receive them sooner. We show that SBSD is scalable;routing distance is independent of network size. SBSD's performance is examined under random mobility, under challenging conditions including high node mobility and broadcast failure rates.

关键词： algorithm design Mobile computing Routing protocols Simulation

来源：评论

学校读者我要写书评

暂无评论

KIDS - A SEMIAUTOMATIC PROGRAM-DEVELOPMENT SYSTEM

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1990年第9期16卷 1024-1043页

作者： SMITH, DR Kestrel Institute 3260 Hillview Avenue Palo Alto CA 94304

The Kestrel Interactive Development System (KIDS), which provides automated support for the development of correct and efficient programs from formal specifications, is described. The system has components for performing algorithm design, deductive inference, program simplification, partial evaluation, finite differencing optimizations, data type refinement, compilation, and other development operations. Although their application is interactive, all of the KIDS operations are automatic except the algorithm design tactics, which require some interaction at present. Dozens of programs have been derived using the system, and it is believed that KIDS could be developed to the point where it becomes economical to use for routine programming. To illustrate the use of KIDS, the author traces the derivation of an algorithm for enumerating solutions to the k-queens problem. The initial algorithm that KIDS designed takes about 60 minutes on a SUN-4/110 to find all 92 solutions to the 8-queens problem instance. The final optimized version finds the same solutions in under one second.

关键词： algorithm design Systems development development engineering Surgery algorithms AUTOMATIC data types Program simplification deductive inference Interactive Formal specifications derivation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：