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

IEEE Symposium on computers and Communications (ISCC)

作者： C.K. Nguyen A. Kumar Mobile Information Networks & Distributed Systems (MINDS) Laboratory Department of Computer Engineering & Computer Science (CECS) University of Louisville Louisville KY USA

The paper proposes an energy-aware contention-based protocol for the medium access control (MAC) sub-layer for wireless sensor networks. The innovative approach with frequent sleeps proactively and aggressively reduces the wasted energy while increasing the throughput and decreasing the latency. The proposed MAC protocol solves the energy inefficiency caused by idle listening, control-packet overhead, and overhearing. Simulation experiments have been performed to demonstrate the effectiveness of the proposed approach, especially compared to the S-MAC and T-MAC protocols.

关键词： Wireless application protocol Wireless sensor networks Media Access Protocol Throughput Access protocols Delay Energy consumption Communication system control Communication channels

来源：评论

学校读者我要写书评

暂无评论

Spanning tree routing strategies for divisible load scheduling on arbitrary graphs — A comparative performance analysis

Spanning tree routing strategies for divisible load scheduli...

引用

International Conference on High Performance Computing

作者： Sivakumar Viswanathan Bharadwaj Veeravalli Jia Jingxi Communication Systems Department Institute for Infocomm Research Singapore Computer Networks and Distributed Systems (CNDS) Laboratory Department of Electrical and Computer Engineering National University of Singapore Singapore

ISBN: (纸本)9781424449224;9781424449217

In this paper, we evaluate and compare the performance of several spanning tree routing strategies for divisible load scheduling on arbitrary graphs and derive recommendations as to which routing strategy provides a better trade-off between complexity and time performance. We consider a network comprising heterogeneous processors interconnected by heterogeneous links in an arbitrary manner. We evaluate the performance over a wide range of arbitrary dense graphs with varying connectivity and processor densities and study the effect of network scalability. In addition, we introduce a novel spanning tree routing strategy, which is referred to as minimum equivalent network spanning tree (EST), and analyze its performance. We apply the resource-aware optimal load distribution with optimal sequencing (RAOLD-OS) scheduling algorithm presented in the literature for obtaining an optimal solution. This study attempts to pool all known and applicable divisible load scheduling algorithms for arbitrary networks and presents a collective and comparative view of their performance.

关键词： Tree graphs Routing Performance analysis Processor scheduling computer networks Large-scale systems Scheduling algorithm Biology computing Distribution strategy Databases

来源：评论

学校读者我要写书评

暂无评论

Message authentication with one-way hash functions

Message authentication with one-way hash functions

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： G. Tsudik IBM Zurich Research Laboratory GmbH RUschlikon Switzerland Computer Networks and Distributed Systems Laboratory University of Southern California Los Angeles CA USA

The authors introduce encryption-free message authentication based entirely on the use of one-way hash functions. It is shown that fast one-way hash functions such as MD4 can be used as a foundation for some relatively novel implementations of security services. In particular, simple and inexpensive secret prefix and secret suffix methods provide protection against message substitution attacks when used in conjunction with a strong one-way hash function (which itself protects against message modification).< >

关键词： Message authentication Hardware Protocols Costs Laboratories Protection Public key cryptography computer networks High-speed networks Bandwidth

来源：评论

学校读者我要写书评

暂无评论

A comparison of Wireless Fidelity (Wi-Fi) fingerprinting techniques

A comparison of Wireless Fidelity (Wi-Fi) fingerprinting tec...

引用

International Conference on Information and Communication Technology Convergence (ICTC)

作者： Lersan B. Del Mundo Rafael Lean D. Ansay Cedric Angelo M. Festin Roel M. Ocampo Networks and Distributed Systems Laboratory Department of Computer Science University of the Philippines Diliman Quezon Philippines Computer Networks Lab Electrical and Electronics Engineering Institute University of the Philippines Diliman Quezon Philippines

Among several techniques proposed for indoor positioning using IEEE 802.11 Wireless Fidelity (Wi-Fi) based networks, those that rely on fingerprinting have been demonstrated to outperform those based on lateration, angulation, and cell of origin in terms of accuracy. We compare and evaluate three Wi-Fi fingerprinting techniques that use the K-Nearest Neighbor (k-NN), Naive Bayes Classifier (NBC) and Support Vector Machine (SVM) algorithms. Our experiments show that SVM-based fingerprinting outperformed both k-NN and NBC-based fingerprinting, achieving accuracies of 2 meters or better within our testbed.

关键词： Accuracy Support vector machines IEEE 802.11 Standards Vectors Databases Fingerprint recognition Kernel

来源：评论

学校读者我要写书评

暂无评论

A proposed architecture for choice of switching paradigm in hybrid optical networks (OCS/OBS)

A proposed architecture for choice of switching paradigm in ...

引用

Conferencia Latinoamericana En Informatica (CLEI)

作者： Nathan Saraiva Túlio Falcão André Macêdo André Soares Distributed Systems and Computer Networks Laboratory Universidade Federal do Piauí Teresina Brasil Universidade Federal do Piaui Teresina PiauÃ BR

This paper proposes an architecture to classify traffic flows of IP access networks, and signalize to hybrid optical network the most appropriate paradigm, Optical Circuit Switching (OCS) and Optical Burst Switching (OBS), to be used. The concept of software defined networks, more specifically the OpenFlow technology, was used to enable the architecture. Furthermore, a performance evaluation and feasibility of the proposed architecture are presented through experiments.

关键词： IP networks Optical fiber networks computer architecture Optical switches Quality of service Switching circuits

来源：评论

学校读者我要写书评

暂无评论

A scalable membership service for group communications in WANs

A scalable membership service for group communications in WA...

引用

Pacific Rim International Symposium on Dependable Computing

作者： Heejeong Kim Dongman Lee Hee Yong Youn Collaborative Distributed Systems & Networks Laboratory Information and Communications University South Korea School of Electrical & Computer Engineering Sungkyunkwan University South Korea

Group Communication System (GCS) is an important building block for reliable, fault-tolerant distributed applications. Due to highly variable and unpredictable latency in WANs, GCS needs to cope with frequent membership changes. It results in diminishing the scalability of GCS. In this paper we propose a new scheme that improves the scalability of group membership service for WANs by exploiting dedicated membership servers configured into multiple layers and reaching global agreement on the view through layered servers. It improves the scalability of a process group of N member processes from O(N/sup 2/) to O(N/sup 3/) with three layers, where N is the number of processes in the group. computer simulation verifies that the proposed scheme requires much smaller number of message exchanges for reaching an agreement on a next view and does that much quicker. In addition, the proposed scheme prevents applications from being blocked until reaching the final view agreement if the applications permit temporary inconsistency.

关键词： Wide area networks Scalability Delay Application software Web server computer networks Maintenance Intelligent networks Collaboration Laboratories

来源：评论

学校读者我要写书评

暂无评论

Checkpointing distributed application running on mobile ad hoc networks

Checkpointing distributed application running on mobile ad h...

引用

International Journal of High Performance Computing and Networking

作者： Mansouri, Houssem Badache, Nadjib Aliouat, Makhlouf Pathan, Al-Sakib Khan Department of Computer Science Faculty of Exact Sciences University of Bejaia Bejaia06000 Algeria Research Center on Scientific and Technical Information CERIST Ben-Aknoun Algiers16000 Algeria Laboratory of Networks and Distributed Systems Computer Science Department University of Ferhat Abbas S?tif1 S?tif19000 Algeria Faculty of Computer and Information Systems Islamic University in Madinah Madinah al-Munawwarah Saudi Arabia CSE Department University of Asia Pacific Bangladesh

Mobile ad hoc network (MANET) is a type of wireless network consisting of a set of self-configured mobile hosts that can communicate with each other using wireless links without the assistance of any fixed infrastructure. This has made it possible for us to create distributed mobile computing applications and has also brought several new challenges in the field of distributed algorithm design. Checkpointing is a well explored fault tolerance technique for the wired and cellular mobile networks. However, it is not directly applicable to MANET owing to its dynamic topology, limited availability of stable storage, partitioning and the absence of fixed infrastructure. In this paper, we propose an adaptive, coordinated and non-blocking checkpointing algorithm to provide fault tolerance in cluster-based MANET, where only a minimum number of mobile hosts in the cluster should take checkpoints. The performance analysis and simulation results show that the proposed scheme requires less coordinating-message cost and performs well compared to the related previous works. Copyright ? 2018 Inderscience Enterprises Ltd.

关键词： Mobile ad hoc networks distributed computer systems Fault tolerance Mobile computing Cellular mobile networks Check pointing Clustering distributed mobile computing Fault tolerance techniques MANET Non blocking checkpointing Performance analysis and simulation

来源：评论

学校读者我要写书评

暂无评论

Spotlights on network operations and management research in Latin America - A report on LANOMS 2005

Spotlights on network operations and management research in ...

引用

作者： Granville, Lisandro Zambenedetti Gaspary, Luciano Paschoal Schulze, Bruno De Souza, José Neuman Brazil Special Interest Group on Computer Networks and Distributed Systems Brazilian Computer Society Brazil Brazilian Laboratory on Computer Networks Brazil IFIP/IEEE im Brazil Graduate Program on Applied Computing Universidade do Vale do Rio dos Sinos Brazil IEEE Communications Society Japan National Lab. for Scientific Computing - LNCC Brazil Brazilian National Research Council CNPq Brazil ACM Brazil IEEE Brazil Brazilian Computing Society Brazil Federal University of Ceará Brazil

来源：评论

学校读者我要写书评

暂无评论

A non-blocking coordinated checkpointing algorithm for message-passing systems 15

A non-blocking coordinated checkpointing algorithm for messa...

引用

International Conference on Intelligent Information Processing, Security and Advanced Communication, IPAC 2015

作者： Mansouri, Houssem Aliouat, Makhlouf Badache, Nadjib Khan, Al-Sakib Pathan Department of Computer Science Faculty of Exact Sciences University of Bejaia Bejaia06000 Algeria Laboratory of Networks and Distributed Systems Computer Science Department University of Ferhat Abbas Sétif1 Setif19000 Algeria Research Center on Scientific and Technical Information CERIST Ben-Aknoun Algiers16000 Algeria Department of Computer Science International Islamic University Malaysia Kuala Lumpur53100 Malaysia

ISBN: (纸本)9781450334587

This paper proposes an efficient non-blocking coordinated checkpointing algorithm for distributed message passing system which uses transitive dependency information. The processes synchronize their checkpointing activities so that a globally consistent set of checkpoints is always maintained in the system. These algorithms do not require channels to be FIFO (First-In, First-Out) and ensure that each checkpoint taken is part of a consistent global checkpoint. Our scheme also records a minimum number of checkpoints by making sure that only few processes are required to take checkpoints in any execution - it uses very less control-message cost when compared to other related works. © 2015 ACM.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Hybrid-MELAu: A Hybrid Mixing Engineered Linguistic Features Framework Based on Autoencoder for Social Bot Detection

Informatica (Slovenia)

引用

Informatica (Slovenia) 2022年第6期46卷 143-158页

作者： Hamida, Zineb Ferhat Refoufi, Allaoua Drif, Ahlem Giordano, Silvia Networks and Distributed Systems Laboratory Department of Computer Science University of Sétif 1 Sétif Algeria Networking Lab SUPSI University of Applied Sciences of Southern Switzerland Lugano Switzerland

Social bots are defined as computer algorithms that generate massive amounts of obnoxious or meaningful information. Most bot detection methods leverage multitudinous characteristics, from network features, temporal dynamics features, activities features, and sentiment features. However, there has been fairly lower work exploring lexicon measurement and linguistic indicators to detect bots. The main purpose of this research is to recognize the social bots through their writing style. Thus, we carried out an exploratory study on the effectiveness of only a set of linguistic features (17 features) exploitable for bot detection, without the need to resort to other types of features. And we develop a novel framework in a hybrid fashion of Mixing Engineered Linguistic features based on Autoencoders (Hybrid-MELAu). The semi-supervised Hybrid-MELAu framework is composed of two essential constituents: the features learner and the predictors. We establish the features learner innovated on two powerful structures: a) the first is a Deep dense Autoencoder fed by the Lexical and the Syntactic content (DALS) that represents the high order lexical and syntactic features in latent space, b) the second one is a Glove-BiLSTM autoencoder, which sculpts the semantic features;subsequently, we generate elite elements from the pre-trained encoder part from each latent space with transfer learning. We consider a sample of 1 Million from Cresci datasets to conduct our linguistic analysis comparison between the writing style of humans and bots. With this dataset, we observe that the bot's textual lexical diversity median is greater than the human one and the syntactic analysis based on speech-tagging shows a creative behavior in human writing style. Finally, we test the model's robustness on several public dataset (celebrity, pronbots-2019, and political bots). The proposed framework achieves a good accuracy of 92.22%. Overall, the results shown in this paper, and the related discussion, ar

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：