Search

Contribution: This article features a systematic literature review with the objective of presenting a study that reflects the current scenario of research on the cognitive load theory (CLT) in the domain of teaching and learning computer programming. Background: Computer programming is a highly cognitive skill, requiring mastering multiple competencies, and recognized as being difficult to learn, for this reason, the cognitive load (CL) in the learner’s working memory emerged as an influential concept, making CLT one of the most common theories in computing education research. Research Questions: What are the approaches that relate CLT to teaching and learning computer programming? What CLT-related concepts are covered? What evidence is reported with respect to this context? Methodology: Following a formal protocol, a survey was performed for papers linking CLT to teaching and learning programming published between 2010 and 2020. The selection of papers was based on a set of criteria established to drive the selection process, including alignment with the research questions and paper quality assessment. Findings: The approaches applied in the papers are based on measuring the CL; through instructional design based on the development or use of resources or tools, a range of different pedagogy strategies and the CLT concepts. With respect to the concepts, the subjective measurement technique and worked example effect are the most commonly deployed. As far as the evidence reported, the better part is related to the worked example effect and measuring CLs. [ABSTRACT FROM AUTHOR]

Delay tolerant networks (DTNs) is a network evolved from mobile networks. Differing from the traditional network, which has a stable end‐to‐end transmission path, DTNs are sparse and intermittently connected mobile ad hoc network, which are widely used in harsh environments, such as battlefields, seabed, space communication networks, and so on. In DTNs, intermittent connectivity, partitioned network, long delays and node mobility characteristics make the network fail to communicate frequently, therefore, how to successfully forward the message is of extreme importance. Up to now, almost all the traditional models in DTNs use the store‐carry‐forward method. This paper proposes a novel clustered DTN routing model based on sensing node relationship strength. The routing mechanism takes advantage of the number of other nodes encountered by the nodes in the process of movement and the changes in the number of nodes to calculate the strength of the relationship between nodes, and clusters DTN routing according to the strength of the relationship between nodes. Moreover, the relationship between nodes in a cluster and other clusters is used to transmit messages between clusters, and messages are transmitted within clusters according to the strength of the relationship between nodes. Simulation results show that the routing mechanism not only increases the success rate of message transmission, but also reduces the transmission delay of messages and improves network performance. [ABSTRACT FROM AUTHOR]

Many States in Africa, the Americas, and Europe have accepted binding regional human rights obligations and international monitoring in addition to the United Nations Charter-Based system of human rights protection, which is applicable to all States, and the United Nations Treaty-Based system, which is only applicable to States parties. In the context of this paper, regional human rights regimes are seen as nested sub-regimes of international human rights practice that are comparatively coherent on their own. The European Convention on Human Rights and Fundamental Freedoms (1950), the Inter-American Convention on Human Rights (1969), and the African Charter on Human and Peoples' Rights (1981) are the three regional human rights documents that are examined. This paper scrutinizes the circumstances leading to the establishment of the regional human rights enforcement mechanisms, the nature and scope of rights and guarantees, and safeguarding procedures under these instruments. It, in fact, examines whether the enforcement mechanisms are, consistent with State sovereignty, and whether they are gradually enhancing the promotion of fundamental human rights and freedoms. [ABSTRACT FROM AUTHOR]

This paper investigates a futuristic spectrum sharing paradigm for heterogeneous wireless networks with imperfect channels. In the heterogeneous networks, multiple wireless networks adopt different medium access control (MAC) protocols to share a common wireless spectrum and each network is unaware of the MACs of others. This paper aims to design a distributed deep reinforcement learning (DRL) based MAC protocol for a particular network, and the objective of this network is to achieve a global $\alpha$ α -fairness objective. In the conventional DRL framework, feedback/reward given to the agent is always correctly received, so that the agent can optimize its strategy based on the received reward. In our wireless application where the channels are noisy, the feedback/reward (i.e., the ACK packet) may be lost due to channel noise and interference. Without correct feedback, the agent (i.e., the network user) may fail to find a good solution. Moreover, in the distributed protocol, each agent makes decisions on its own. It is a challenge to guarantee that the multiple agents will make coherent decisions and work together to achieve the same objective, particularly in the face of imperfect feedback channels. To tackle the challenge, we put forth (i) a feedback recovery mechanism to recover missing feedback information, and (ii) a two-stage action selection mechanism to aid coherent decision making to reduce transmission collisions among the agents. Extensive simulation results demonstrate the effectiveness of these two mechanisms. Last but not least, we believe that the feedback recovery mechanism and the two-stage action selection mechanism can also be used in general distributed multi-agent reinforcement learning problems in which feedback information on rewards can be corrupted. [ABSTRACT FROM AUTHOR]

This paper highlights the crucial role of wireless sensor networks (WSNs) in the surveillance and administration of critical infrastructures (CIs), contributing to their reliability, security, and operational efficiency. It starts by detailing the international significance and structural aspects of these infrastructures, mentions the market tension in recent years in the gradual development of wireless networks for industrial applications, and proceeds to categorize WSNs and examine the protocols and standards of WSNs in demanding environments like critical infrastructures, drawing on the recent literature. This review concentrates on the protocols and standards utilized in WSNs for critical infrastructures, and it concludes by identifying a notable gap in the literature concerning quality standards for equipment used in such infrastructures. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a growing technology that remotely connects multiple devices (ranging across many fields and applications) over the Internet. The scalability of an IoT network mandates a reliable transport infrastructure. Traditional transport control protocol (TCP) control protocol is unsuitable for such domain, mainly due to energy and power consumption reasons. A lighter version of TCP, light weight IP (lwIP) provides a promising solution for current and projected future scalable IoT infrastructures. However, the original lwIP is just a simple mapping of the protocol, without insight into the IoT specific requirements. This paper examines the lwIP congestion control mechanism and addresses its shortcomings. In particular, a detailed examination is devoted to the various metrics such as retransmission time‐outs and its back‐off epochs, the congestion window behaviour and progress in the absence (and presence) of congestion. In particular, we propose a set of novel algorithms to address both the IoT constraints nature (light‐weight) as well as keeping up with scalability in IoT network size and performance. A detailed simulation study has been conducted to endorse the viability of our proposed set of algorithms for next‐generation IoT networks. [ABSTRACT FROM AUTHOR]

"Industry 5.0" is the latest industrial revolution. A variety of cutting-edge technologies, including artificial intelligence, the Internet of Things (IoT), and others, come together to form it. Billions of devices are connected for high-speed data transfer, especially in a 5G-enabled industrial environment for information collection and processing. Most of the issues, such as access control mechanism, time to fetch the data from different devices, and protocols used, may not be applicable in the future as these protocols are based upon a centralized mechanism. This centralized mechanism may have a single point of failure along with the computational overhead. Thus, there is a need for an efficient decentralized access control mechanism for device-to-device (D2D) communication in various industrial sectors, for example, sensors in different regions may collect and process the data for making intelligent decisions. In such an environment, reliability, security, and privacy are major concerns as most of the solutions are based upon a centralized control mechanism. To mitigate the aforementioned issues, this paper provides the opportunities for and highlights some of the most impressive initiatives that help to curve the future. This new era will bring about significant changes in the way businesses operate, allowing them to become more cost-effective, more efficient, and produce higher-quality goods and services. As sensors are getting more accurate, cheaper, and have lower time responses, 5G networks are being integrated, and more industrial equipment and machinery are becoming available; hence, various sectors, including the manufacturing sector, are going through a significant period of transition right now. Additionally, the emergence of the cloud enables modern production models that use the cloud (both internal and external services), networks, and systems to leverage the cloud's low cost, scalability, increased computational power, real-time communication, and data transfer capabilities to create much smarter and more autonomous systems. We discuss the ways in which decentralized networks that make use of protocols help to achieve decentralization and how network meshes can grow to make things more secure, reliable, and cohere with these technologies, which are not going away anytime soon. We emphasize the significance of new design in regard to cybersecurity, data integrity, and storage by using straightforward examples that have the potential to lead to the excellence of distributed systems. This groundbreaking paper delves deep into the world of industrial automation and explores the possibilities to adopt blockchain for developing solutions for smart cities, smart homes, healthcare, smart agriculture, autonomous vehicles, and supply chain management within Industry 5.0. With an in-depth examination of various consensus mechanisms, readers gain a comprehensive understanding of the latest developments in this field. The paper also explores the current issues and challenges associated with blockchain adaptation for industrial automation and provides a thorough comparison of the available consensus, enabling end customers to select the most suitable one based on its unique advantages. Case studies highlight how to enable the adoption of blockchain in Industry 5.0 solutions effectively and efficiently, offering valuable insights into the potential challenges that lie ahead, particularly for smart industrial applications. [ABSTRACT FROM AUTHOR]

In 2014, an Irish parliament white paper called for greater addressing of sport-related concussions (SRCs) in Ireland, requesting the adoption of the Concussion in Sport Group's (CISGs) guidelines and greater consistency in SRC return to play (RTP) management. Ten years later, it is unclear how these requests have been addressed. Recently, the United Kingdom's government centralised guidelines to one SRC document for all grassroots sports. This study aimed to investigate all publicly available SRC guidance in Irish sports and national governing bodies (NGBs) to determine if centralised guidelines are warranted. Sport Ireland and the Irish Federation of Sports were searched for all recognised NGBs and sports in Ireland. Websites were searched for any information pertaining to SRCs and data were extracted and collated in Microsoft Excel. In total, 15 of 83 sports and/or NGBs included SRC guidance, nine of which provided RTP protocols. Various iterations of the CISGs guidance and tools were implemented. Several sports with a documented SRC risk had no guidelines present. The findings indicate disjointed and outdated guidance across Irish sport. Additionally, there are sports with a documented concussion risk that have no SRC guidance available. This study provides support for centralised guidelines to be adopted in Irish grassroots sports. [ABSTRACT FROM AUTHOR]

This paper considers the problem of communication protocols between leaders and its followers for motion planning in an initially partially known environment. In this setting, the leader observes the environment information to satisfy its own local objective and and the follower completes its own local objective by estimating the states of the leader and communicating with the leader to update its knowledge about the environment when it is necessary, where the local objectives can be expressed in temporal logic. A verifier construction is built first to contain all possible communication protocols between the leaders and the followers. Then, a two‐step synthesis procedure is proposed to capture all feasible communication protocol that satisfy the local objectives for the leader and follower, respectively. In the first step, a sub‐verifier is synthesized to satisfy the objective of the follower. In the second step, based on the obtained sub‐verifier, an iterative algorithm is proposed to extract communication protocols such that the objectives of the leader and follower are satisfied, respectively. A running example is provided to illustrate the proposed procedures. [ABSTRACT FROM AUTHOR]

Although several years have passed since its first introduction, the significance of Delay-Tolerant Networking (DTN) remains evident, particularly in challenging environments where traditional networks face operational limitations such as disrupted communication or high latency. This survey paper aims to explore the diverse array of applications where DTN technologies have proven successful, with a focus on emerging and novel application paradigms. In particular, we focus on the contributions of DTN in the Future Internet, including its contribution to space applications, smart cities and the Internet of Things, but also to underwater communications. We also discuss its potential to be used jointly with information-centric networks to change the internet communication paradigm in the future. [ABSTRACT FROM AUTHOR]

The rapid development of the blockchain leads to a blowout of on-chain transactions, contracts, and currencies, which will further accelerate the increase of data. The existing blockchain systems typically support exact transaction queries, which, however, cannot satisfy the QoS requirements with intelligent adjustment in the blockchain systems. To this end, this paper takes the first step to define and address the practically important problem of transaction cardinality estimation for QoS-adjustable intelligent blockchain systems. We first establish a mathematical relationship between the bit string and transaction cardinality. Thus, we can leverage the number of leading 1s of the obtained bit string to estimate the transaction cardinality. We then improve the block header and body with a corresponding search algorithm to access bit strings in blocks. We also propose an estimation protocol with intelligent adjustable QoS to support accuracy-guaranteed and efficiency-optimized estimation. Finally, we design an authentication scheme and guarantee the reliability of our protocol through rigorous theoretical derivation. When achieving the transaction cardinality estimation in blockchain, two technical challenges need to be addressed. (i) To ensure efficient, verifiable, and overhead-saving bit string accessing mechanism in blockchain, we propose the Merkle Cardinality Tree (MCT) and target block filtering mechanism based on Bloom Filter (BF) in off-chain and improve on-chain block header by joining the abstract of MCT and BF. (ii) To improve estimation efficiency while guaranteeing accuracy requirements in hybrid blockchain scheme, we propose a Dynamic One-round Sampling-based cardinality Estimation (DOSE) protocol and integrate BF-DOSE to intelligently accelerate estimation. We build MCT in Ethereum and store the MCT Root in the block header for estimation authentication. Extensive experiments reveal that our BF-DOSE protocol can well satisfy various accuracy and efficiency requirements of QoS-adjustable intelligent blockchain systems, and is one to two orders of magnitude faster compared with benchmark schemes. [ABSTRACT FROM AUTHOR]

To obtain reliable results from conflicting data in mobile crowdsensing, numerous truth discovery protocols have been proposed in the past decade. However, most of them do not consider the data privacy of entities involved (e.g., workers and servers), and several existing privacy-preserving truth discovery protocols either provide limited privacy protection or have heavy computation and communication overheads due to iterative computation and transmission over large ciphertexts. In this paper, we aim to propose privacy-preserving and lightweight truth discovery protocols to tackle the above problems. Specifically, we carefully design an anonymization protocol named AnonymTD to delink workers from their data, where workers’ data are computed and transmitted without complicated encryption. To further reduce each worker's overheads in the scenarios where workers are willing to share their weights, we resort to the perturbation technology to propose a more lightweight truth discovery protocol named PerturbTD. Based on workers’ perturbed data, two cloud servers in PerturbTD complete most of the workload of truth discovery together, which avoids the frequent involvement of workers. The theoretical analysis and the comparative experiments in this paper demonstrate that our two protocols can achieve our security goals with low computation and communication overheads. [ABSTRACT FROM AUTHOR]

This paper considers distributed estimation methods to enable the formation of Unmanned-Aerial-Vehicles (UAVs) that track a moving target. The UAVs (or agents) are equipped with communication devices to receive a beacon signal from the target and share information with neighboring UAVs. The shared information includes the time-of-arrival (TOA) of the beacon signal from the target and estimates on the target’s location. Every UAV processes the received information from the neighbors using a single-time-scale distributed estimation protocol. This differs from multi-time-scale protocols that require (i) many consensus iterations on a-priori estimates, (ii) fast communication among agents (in general, much faster than the sampling rate of the target dynamics), and thus, more-costly communication equipment and processing units. Further, our approach outperforms most single-time-scale methods in terms of observability assumption as these methods assume that the target is observable via the measurement data received from neighboring UAVs (referred to as local-observability). This requires more communications among the sensors. In contrast, our approach is only based on global-observability assumption, and thus, requires less networking (only strong-connectivity) and communication traffic along with less computational load by data-processing once at the same time-scale of sampling target dynamics. We consider modified time-difference-of-arrival (TDOA) measurements with a constant output matrix for the linearized model. UAVs make a pre-specified formation, and by estimating the target’s location via these measurements, move along with the target. Note to Practitioners—Inspired by recent development in industrial UAVs along with emerging progress in low-cost processing units, fog computing systems, and wireless communications, this paper considers mobile tracking of a moving target via a group of wireless-connected autonomous drones. In the classical tracking methods, which are prone to single-point-of-failure, all the sensors need to send their information to a ground central station over a long-range and costly data-transmission channel. In contrast, by collaborative tracking the processing and decision-making are distributed among a swarm of drones equipped with onboard miniaturized electronic parts such as sensors, microcontrollers, microprocessors, and communication units. This article provides an efficient algorithm to enable such drones to autonomously track the moving target in real-time. Note that the cost and tracking ability of the UAV swarm are directly determined by the computational efficiency and communication burden of the estimation algorithm. In this regard, most available estimation algorithms are over budget and even infeasible due to the need for fast data-transmission channels, fast CPUs, and high network traffic. Our proposed estimation technique outperforms similar algorithms in terms of required communication bandwidth, data-transmission rate, and computational resources, which considerably reduces the hardware cost and improves tracking efficiency in real-time large-scale applications. We show the feasibility and efficiency of our distributed tracking method by simulation. [ABSTRACT FROM AUTHOR]

Copyright of Knowledge: International Journal is the property of Institute for Knowledge Management and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Over recent years, we have seen a significant rise in electric mobility to overcome the anthropogenic emissions by conventional gasoline vehicles. However, the prerequisite of smoothening of peaks and imbalances through bidirectional charging is concatenated with the undesired impacts on reliability and security of power system operation when there are probable intrusions in the eXtreme Fast Charging (XFC) station, hence destabilizing the charging networks. So this paper applies STRIDE based threat modeling to analyze and identify multiple potential threats endured by the cyber-physical system (CPS) of XFC station by using weighted attack defense tree. Potential mitigation strategies are then suggested for the identified severe threats. In addition, this paper also develops a stochastic probabilistic tool, the Hidden Markov Model (HMM) for modeling the security attacks for a given range of identified attack vectors and hence employing an appropriate defense strategy against the malicious hacker. Also, a weighted attack defense tree has been developed to generate various attack scenarios. In the end, the results of the proposed work are substantiated and validated if it is able to considerably improve overall charging efficiency and cyber-physical security of the charging station network. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) is a newly emerged technology that can increase the energy and spectral efficiency of wireless communication systems. This paper considers an IRS-aided multi-user multiple-input single-output (MISO) communication system, and presents a detailed analysis and optimization framework for the weighted sum-rate (WSR) of the downlink transmission over Rician fading channels. Unlike most of the prior works where the active beamformer at the base station (BS) and passive beamformer at the IRS are jointly designed based on the instantaneous channel state information (CSI), this paper proposes a low-complexity transmission protocol where the IRS passive beamforming and BS power allocation coefficient vector are optimized in the large timescale based on the statistical CSI, and the BS transmit beamforming is designed in the small timescale based on only the instantaneous CSI of the effective BS-user channels. Therefore, the channel training overhead in each channel coherence interval under our proposed protocol is independent of the number of IRS reflecting elements, which is in sharp contrast to most of the prior works. By considering maximum-ratio transmit beamforming at the BS, we derive a lower bound of the ergodic WSR in closed-form. Then, we propose an efficient algorithm to jointly optimize the IRS passive beamforming and BS power allocation coefficient vector for maximizing the ergodic WSR lower bound. Numerical results validate the tightness of our derived WSR bound and show that the proposed scheme outperforms various existing schemes in terms of complexity or capacity performance. [ABSTRACT FROM AUTHOR]

As the general development trend of the automotive industry, connected and autonomous vehicles (CAVs) can be used to increase transportation safety, promote mobility choices, reduce user costs, and create new job opportunities. However, with the increasing level of connectivity and automation, malicious users are able to easily implement different kinds of attacks, which threaten the security of CAVs. Hence, this paper provides a comprehensive survey on the cyber-security in the environment of CAVs with the aim of highlighting security problems and challenges. Firstly, based on the types of communication networks and attack objects, it classifies various cyber-security risks and vulnerabilities in the environment of CAVs into in-vehicle network attacks, vehicle to everything network attacks, and other attacks. Next, it regards cyber-risk as another type of attacks in the environment of CAVs. Then, it describes and analyzes up-to-date corresponding defense strategies for securing CAVs. In addition, it concludes several available cyber-security and safety standards of CAVs, which is helpful for the practical application of CAVs. Finally, several challenges and open problems are discussed for the future research. [ABSTRACT FROM AUTHOR]

The multi-hop protocols are proved effective in the railway disaster wireless monitoring system. However, farther transmission distance with the larger data will decline the valid lifetime and reliability of the system. Most existing studies focused primarily on the communication protocols optimization, and some works tried to utilize the limited computation ability at the network-level or node-level, which are insufficient for the stiff disaster information monitoring demands. This paper presents an adaptive hybrid computation and communication strategy to fully taking advantage of the sensor processing ability, and improve the energy efficiency at the link-level. Furthermore, an adaptive optimization model is designed to meet the different monitoring demands of the system, and the valid lifetime is improved accordingly. Numerical examples with various operational scenarios are developed to demonstrate the superiority and practicality of the proposed protocol in the lifetime improvement, energy consumption minimization and equalization compared with other outstanding protocols. [ABSTRACT FROM AUTHOR]

IOT is known as one of the most emerging technology in the world nowadays. Mostly MNC and even the startups are working on IOT. IOT is a technology where devices (like sensor, embedded system boards and others) are connected with the network for exchanging the information remotely among each other and even in the surroundings. The main elements of IOT includes the GPS (global positioning system), RFID (radio frequency identification) and WSN (wireless sensor network) which are widely used in the aqua farms, farmland, monitoring of environment, cold chain management, in tracking and also in tracing the things. IOT finds its application almost in every sector some of which are agriculture, home automation, environment management, military and others. Through this paper you will learn about IOT, it’s application in various fields and also about the recent and past researches done in the field of IOT and also about the challenges which one face during the use of IOT. [ABSTRACT FROM AUTHOR]

By means of a close reading of Edgar Allan Poe's The Man of the Crowd and The Murders of the Rue Morgue, this paper reconstructs the figure of the detective, showing his centrality within the following sociological problems: (a) the relationship between metropolis and identity, an identity caught in its fragmentation and disintegration; (b) the implications of nervous life, a state which is associated with both the advent of technologies and the modern oscillations between sensitivity and insensitivity; (c) the functions and value assumed by the media, now understood as instruments of survival and as places of social bonding; d) the conflicts between talent and habituation, as well as between creativity and protocols, in a founding dialectic between distinction and uniformity; e) the methods and procedures of media knowledge, suspended between the dispersion of minutiae and the affirmation of successive states of consciousness. [ABSTRACT FROM AUTHOR]

Covert communication is an method that plays an important role in secure data transmission. The technology embeds covert information into data and propagates it through covert channels. The communication quality depends on the choice of channel and data embedding techniques. Recently, blockchain has emerged to become the preferred channel to carry out covert communication for its decentralization and anonymity features. Existing covert transaction methods are constructed transaction-by-transaction, which makes them immune to text analysis-based detection methods. However, it is easy to expose their features on the transaction graph level. Unfortunately, there is yet no method to detect covert transactions by the features of transaction graph. In this paper, we propose a covert transaction detection method based on graph structure. By analyzing the statistical features of graph structure for addresses, we can infer whether they are the participants of covert transactions. Furthermore, we design a protection method of covert transactions based on graph generation networks. By adjusting the structural features between different addresses, our method enhances the security of multiple interrelated covert transactions. Experimental analysis on the Bitcoin Testnet verifies the security and the efficiency of the proposed methods. [ABSTRACT FROM AUTHOR]

With the growing use of mobile devices, location-based services (LBS) are becoming increasingly popular. BLS deliver accurate services to individuals according to their geographical locations, but privacy issues have been the primary concerns of users. Privacy-preserving LBS (PPLBS) were proposed to protect location privacy, but there are still some problems: 1) a semi-trusted third party (STTP) is required to blur users’ locations; 2) both the computation and communication costs of generating a query are linear with the size of queried areas; 3) the schemes were not formally treated, in terms of definition, security model, security proof, etc. In this paper, to protect location privacy and improve query efficiency, an oblivious location-based services (OLBS) scheme is proposed. Our scheme captures the following features: 1) an STTP is not required; 2) users can query services without revealing their exact location information; 3) the service provider only knows the size of queried areas and nothing else; and 4) both the computation and communication costs of generating a query is constant, instead of linear with the size of queried areas. We formalise both the definition and security model of our OLBS scheme, and propose a concrete construction. Furthermore, the implementation is conducted to show its efficiency. The security of our scheme is reduced to well-known complexity assumptions. The novelty is to reduce the computation and communication costs of generating a query and enable the service provider to obliviously generate decrypt keys for queried services. This contributes to the growing work of formalising PPLBS schemes and improving query efficiency. [ABSTRACT FROM AUTHOR]

For high-speed quantum key distribution (QKD) post processing, information reconciliation is the most computational step, which usually acts as the system speed bottleneck. Reconciliation efficiency and operation throughput are the two most important performance parameters, but they are often compromised to each other in actual realization due to the available hardware resources. Another characteristic of the information reconciliation is that its channel is time-varying, and in order to guarantee high efficiency, some rate-compatible error correction scheme should be adopted. To cope with the above problems, this paper proposes a rate-compatible high-efficiency reconciliation algorithm based on quasi-cyclic (QC) low-density parity-check (LDPC) codes and puncturing algorithms. On the other hand, in order to obtain high throughput while maintaining low implementation complexity, the normalized min-sum algorithm (NMSA) is realized and optimized by using the fast prototyping tool of high-level synthesis (HLS). The proposed information reconciliation module was implemented on the Xilinx Zynq Ultrascale+ ZCU102 development board. Experimental results show that the maximum throughput rate of the implemented reconciliation module in this paper can reach 136 Mbps, while the efficiency factor is kept lower than 1.32 across the error rate range of 1.7%∼10.6% under the remaining frame error rate level of 10−3. The comprehensive good performance obtained by our design can strongly support the development of modern high-speed QKD systems. [ABSTRACT FROM AUTHOR]

The longest-chain and Greedy Heaviest Observed Subtree (GHOST) protocols are the two most famous chain-selection protocols to address forking in Proof-of-Work (PoW) blockchain systems. Inclusive protocol was proposed to lower the loss of miners who produce stale blocks and increase the blockchain throughput. This paper aims to make an analytical-model-based quantitative comparison of their capabilities against selfish mining attack. Analytical models have been developed for the longest-chain protocol but less to the GHOST protocol. However, the blockchain dynamics and evolution are different when adopting different chain-selection protocols. Therefore, the corresponding analytical models and/or the formulas of calculating metrics (such as miner profitability and system throughput) may be different. To address these challenges, this paper first develops a novel Markov model and the formulas of evaluation metrics, in order to analyze a GHOST-based blockchain system under selfish mining attack. Then extensive experiments are conducted for comparison and we observe that: (i) The GHOST protocol is more resistant to selfish mining attack than the longest-chain protocol from the aspect of relative revenue of selfish miners. (ii) Inclusive protocol can promote the security (evaluated in terms of miner profitability) improvement of the system which has little total computational power or a high forking probability. Additionally, the longest-chain protocol is more sensitive to inclusive protocol than GHOST protocol. (iii) It is hard for each of the two common-used difficulty adjustment algorithms to achieve higher system throughput and security. [ABSTRACT FROM AUTHOR]

This paper presents a method for controlling the voltage of inverter-based Microgrids by proposing a new scale-free distributed cooperative controller. The main contribution of this paper is that the proposed distributed cooperative controller is scale-free where is independent of any information about the communication system and the number of distributed generators, as such it works for any Microgrids with any size. Moreover, the communication network is modeled by a general time-varying graph which enhances the resilience of the proposed protocol against communication link failure, data packet loss, and arbitrarily fast plug and play operation in the presence of arbitrarily finite communication delays as the protocol does not require the knowledge of the upper bound on the delay. The stability analysis of the proposed protocol is provided. The proposed method is simulated on the CIGRE medium voltage Microgrid test system. The simulation results demonstrate the feasibility of the proposed scale-free distributed nonlinear protocol for regulating voltage of Microgrids in the presence of communication failures, data packet loss, noise, and degradation. [ABSTRACT FROM AUTHOR]

This paper considers from the perspective of MAC layer, a throughput maximization problem of NOMA-ALOHA, ALOHA implemented over NOMA (non-orthogonal multiple access), that can decode simultaneously transmitted multiple packets via successive interference cancellation (SIC) if each of the multiple packets has a different power level from those of others. We start with a throughput optimization problem for two power levels and extend it to a problem for a general number of power levels. For the case of two power levels, we find upper and lower bounds of the maximum throughput and suggest a practical sub-optimal transmission probability whose throughput is close to the maximum. The maximum throughput of NOMA-ALOHA is at least 1.774 times higher than that of traditional slotted ALOHA in our numerical example. We extend the optimization problem into a general one with arbitrary number of power levels. We numerically analyze the performance through a relaxed problem of the original one with high complexity. Our numerical analysis shows that the maximum throughput of NOMA-ALOHA with three power levels is 2.33 times higher than simple ALOHA’s maximum throughput and that adding one power level to NOMA-ALOHA with two power levels enhances throughput at least by more than 28 percent. [ABSTRACT FROM AUTHOR]

The Internet of Things is a rapidly evolving technology in which interconnected computing devices and sensors share data over the network to decipher different problems and deliver new services. For example, IoT is the key enabling technology for smart homes. Smart home technology provides many facilities to users like temperature monitoring, smoke detection, automatic light control, smart locks, etc. However, it also opens the door to new set of security and privacy issues, for example, the private data of users can be accessed by taking control over surveillance devices or activating false fire alarms, etc. These challenges make smart homes feeble to various types of security attacks and people are reluctant to adopt this technology due to the security issues. In this survey paper, we throw light on IoT, how IoT is growing, objects and their specifications, the layered structure of the IoT environment, and various security challenges for each layer that occur in the smart home. This paper not only presents the challenges and issues that emerge in IoT-based smart homes but also presents some solutions that would help to overcome these security challenges. [ABSTRACT FROM AUTHOR]

Recently, several methods for SARS-CoV-2 detection have been developed to obtain rapid, portable, cheap, and easy-to-use diagnostic tools. This review paper summarizes and discusses studies on the development of point-of-care devices for SARS-CoV-2 diagnosis with comparisons between them from several aspects. Various detection methods of the recently developed portable COVID-19 biosensor will be presented in this review. The discussion is divided into four major classifications based on the target biomarkers of SARS-CoV-2, such as antibodies, nucleic acids, antigens, and metabolic products. An overview of the potential development for future study is also provided. Moreover, basic knowledge of biosensors is also explained for tutoring the implementation of theory into the research of COVID-19 biosensors. This review paper is aimed to provide a tutorial by collecting the information on the development of a point-of-care device for SARS-CoV-2 detection to provide information for further research and propose the new COVID-19 portable diagnostic tool. [ABSTRACT FROM AUTHOR]

Co-simulation of heterogeneous systems allows for in-depth analysis of various aspects of power systems’ operation while staying within the environments of the simulation tools that are best fit to represent their respective domains. Equipped with a proprietary co-simulation platform, the paper focuses on the issue of power-conjugate coupling between parts of power grids modeled in transient stability and electromagnetic transient simulation tools. The problems of co-simulation stability and precision in presence of delays are tackled by means of designing a proper coupling interface. It is shown that two established interface methods – the V-I method and the Transmission Line Interface – are special cases of a generalized interface framework proposed in the paper. Moreover, a new interface algorithm is described by parametrizing the generalized framework. Analytical tools are also formulated to aid in the analysis of interface stability and precision via the concepts of passivity and transparency. Simulation results of benchmark systems of various complexity demonstrate the application of the developed power coupling interface. [ABSTRACT FROM AUTHOR]

Parasites are responsible for the most neglected tropical diseases, affecting over a billion people worldwide (WHO, 2015) and accounting for billions of cases a year and responsible for several millions of deaths. Research on extracellular vesicles (EVs) has increased in recent years and demonstrated that EVs shed by pathogenic parasites interact with host cells playing an important role in the parasite's survival, such as facilitation of infection, immunomodulation, parasite adaptation to the host environment and the transfer of drug resistance factors. Thus, EVs released by parasites mediate parasite‐parasite and parasite‐host intercellular communication. In addition, they are being explored as biomarkers of asymptomatic infections and disease prognosis after drug treatment. However, most current protocols used for the isolation, size determination, quantification and characterization of molecular cargo of EVs lack greater rigor, standardization, and adequate quality controls to certify the enrichment or purity of the ensuing bioproducts. We are now initiating major guidelines based on the evolution of collective knowledge in recent years. The main points covered in this position paper are methods for the isolation and molecular characterization of EVs obtained from parasite‐infected cell cultures, experimental animals, and patients. The guideline also includes a discussion of suggested protocols and functional assays in host cells [ABSTRACT FROM AUTHOR]

It is widely acknowledged that the success of deep learning is built upon large-scale training data and tremendous computing power. However, the data and computing power are not always available for many real-world applications. In this paper, we address the machine learning problem where it lacks training data and limits computing power. Specifically, we investigate domain adaptation which is able to transfer knowledge from one labeled source domain to an unlabeled target domain, so that we do not need much training data from the target domain. At the same time, we consider the situation that the running environment is confined, e.g., in edge computing the end device has very limited running resources. Technically, we present the Faster Domain Adaptation (FDA) protocol and further report two paradigms of FDA: early stopping and amid skipping. The former accelerates domain adaptation by multiple early exit points. The latter speeds up the adaptation by wisely skip several amid neural network blocks. Extensive experiments on standard benchmarks verify that our method is able to achieve the comparable and even better accuracy but employ much less computing resources. To the best of our knowledge, there are very few works which investigated accelerating knowledge adaptation in the community. This work is expected to inspire the topic for more discussion. [ABSTRACT FROM AUTHOR]

As the demand for wireless capacity continues to grow, highly directional wireless communication technologies have the potential to provide massive gains in area spectral efficiency. However, novel challenges arise when considering bidirectional connectivity and multi-cell/multi-user systems with highly directional links. Some of these challenges can be alleviated with the introduction of asymmetric connectivity where the highly directional links are used solely for downlink transmission. As an example, we consider asymmetric links with an optical wireless communication (OWC) downlink and sub-6 GHz RF uplink. More specifically, we consider visible light communication as an instance of OWC, although the presented analysis and validation are applicable to alternative OWC technologies and other simplex downlink transmission technologies. While asymmetric connectivity has been previously demonstrated in scenarios like this, the impact of control-plane asymmetry has not been explored, to our knowledge. In this paper, we first introduce the novel challenges related to local handshaking in wireless networks with control-plane asymmetry. We then develop a theoretical framework for throughput analysis in a network where the sub-6 GHz RF channel is shared between a conventional RF link and an asymmetric RF/OWC link. This analysis is validated via simulation and verified in a testbed system using Mango WARP3 software defined radios and a commercially available RF access point. Finally, we use the derived throughput equations to analyze the impact of various protocol parameters and demonstrate one potential use of the derived equations to evaluate sum throughput in the presence of an unreliable OWC link. [ABSTRACT FROM AUTHOR]

In RFID systems, the privacy problem has attracted increasing attention as the tags have extremely limited on-chip resources and may blindly respond to unauthorized readers. To protect the privacy, one widely used solution is to deploy one or more blocker tags to collide the RF signal sent from protected tags all the time. In this paper, we investigate the problem of tag identification in privacy-sensitive RFID systems when we have the authorized reader(s). Due to the presence of blocker tags, the tag identification becomes more challenging since the protected tags and blocker tags will always respond concurrently, leading to unreconciled collisions. To overcome this challenge, we in this paper propose three efficient tag identification protocols IIP, SIP, and SUIP, which meet three application requirements: privacy, accuracy, and efficiency. IIP iteratively deactivates blocking tags as well as labeling genuine tags, and finally identifies tags by avoiding all the unreconciled collisions. On top of IIP, SIP further avoids the slot waste by carrying out a filter to separate genuine tags from others in advance. Furthermore, SUIP can identify the incremental unknown tags in an efficient way. It separates the incremental unknown tags from others by using a filter with improved performance and puts forward a collision reconciliation technique to accelerate the identification process. Simulation results demonstrate that our protocols are able to guarantee any identification accuracy in a privacy-protected way. [ABSTRACT FROM AUTHOR]

Capturing the dynamics in user preference is crucial to better predict user future behaviors because user preferences often drift over time. Many existing recommendation algorithms – including both shallow and deep ones – often model such dynamics independently, i.e., user static and dynamic preferences are not modeled under the same latent space, which makes it difficult to fuse them for recommendation. This paper considers the problem of embedding a user's sequential behavior into the latent space of user preferences, namely translating sequence to preference. To this end, we formulate the sequential recommendation task as a dictionary learning problem, which learns: 1) a shared dictionary matrix, each row of which represents a partial signal of user dynamic preferences shared across users; and 2) a posterior distribution estimator using a deep autoregressive model integrated with Gated Recurrent Unit (GRU), which can select related rows of the dictionary to represent a user's dynamic preferences conditioned on his/her past behaviors. Qualitative studies on the Netflix dataset demonstrate that the proposed method can capture the user preference drifts over time and quantitative studies on multiple real-world datasets demonstrate that the proposed method can achieve higher accuracy compared with state-of-the-art factorization and neural sequential recommendation methods. [ABSTRACT FROM AUTHOR]

Weight sharing promises to make neural architecture search (NAS) tractable even on commodity hardware. Existing methods in this space rely on a diverse set of heuristics to design and train the shared-weight backbone network, a.k.a. the super-net. Since heuristics substantially vary across different methods and have not been carefully studied, it is unclear to which extent they impact super-net training and hence the weight-sharing NAS algorithms. In this paper, we disentangle super-net training from the search algorithm, isolate 14 frequently-used training heuristics, and evaluate them over three benchmark search spaces. Our analysis uncovers that several commonly-used heuristics negatively impact the correlation between super-net and stand-alone performance, whereas simple, but often overlooked factors, such as proper hyper-parameter settings, are key to achieve strong performance. Equipped with this knowledge, we show that simple random search achieves competitive performance to complex state-of-the-art NAS algorithms when the super-net is properly trained. [ABSTRACT FROM AUTHOR]

Autonomous driving of multi-lane vehicle platoons have attracted significant attention in recent years due to their potential to enhance the traffic-carrying capacity of the roads and produce better safety for drivers and passengers. This paper proposes a distributed motion planning algorithm to ensure safe overtaking of autonomous vehicles in a dynamic environment using the Artificial Potential Field method. Unlike the conventional overtaking techniques, autonomous driving strategies can be used to implement safe overtaking via formation control of unmanned vehicles in a complex vehicle platoon in the presence of human-operated vehicles. Firstly, we formulate the overtaking problem of a group of autonomous vehicles into a multi-target tracking problem, where the targets are dynamic. To model a multi-vehicle system consisting of both autonomous and human-operated vehicles, we introduce the notion of velocity difference potential field and acceleration difference potential field. We then analyze the stability of the multi-lane vehicle platoon and propose an optimization-based algorithm for solving the overtaking problem by placing a dynamic target in the traditional artificial potential field. A simulation case study has been performed to verify the feasibility and effectiveness of the proposed distributed motion control strategy for safe overtaking in a multi-lane vehicle platoon. [ABSTRACT FROM AUTHOR]

Accurate location data of ground vehicles is very important for various intelligent transportation applications. As one of the most commonly-used navigation solutions at present, the GNSS/INS integrated navigation still cannot meet the accuracy and stability command of current applications. This paper presents a National Marine Electronics Association (NMEA) protocol data-assisted high-accuracy navigation algorithm based on GNSS position error estimation using multi-task learning (MT-e&R), which can accurately estimate the GNSS position error and GNSS measurement noise covariance matrix with the assistance of protocol data and a multi-task learning model. Extensive experimental results on practical navigation data collected in various urban environments of Beijing demonstrate that our proposed approach can improve the performance of integrated navigation system. The positioning errors of integrated navigation equipped with single-frequency receiver are reduced by 36.17% and 39.58% for double-frequency receiver, which confirms the reasonable environmental adaptability of our proposed MT-e&R algorithm. [ABSTRACT FROM AUTHOR]

The expansion of the Internet of Things (IoT) paradigm has brought with it the challenge of promptly detecting and evaluating attacks against the systems coexisting in it. One of the most recurrent methods used by cybercriminals is to exploit the vulnerabilities found in communication protocols, which can lead to them accessing, altering, and making data inaccessible and even bringing down a device or whole infrastructure. In the case of the IoT, the Message Queuing Telemetry Transport (MQTT) protocol is one of the most-used ones due to its lightness, allowing resource-constrained devices to communicate with each other. Improving its effectiveness, a lighter version of this protocol, namely MQTT for Sensor Networks (MQTT-SN), was especially designed for embedded devices on non-TCP/IP networks. Taking into account the importance of these protocols, together with the significance that security has when it comes to protecting the high-sensitivity data exchanged in IoT networks, this paper presents an exhaustive assessment of the MQTT-SN protocol and describes its shortcomings. In order to do so, seven different highly heterogeneous attacks were designed and tested, evaluating the different security impacts that they can have on a real MQTT-SN network and its performance. Each one of them was compared with a non-attacked implemented reference scenario, which allowed the comparison of an attacked system with that of a system without attacks. Finally, using the knowledge extracted from this evaluation, a threat detector is proposed that can be deployed in an IoT environment and detect previously unmodeled attacks. [ABSTRACT FROM AUTHOR]

XOR-AND Graphs (XAGs) are an enrichment of the classical AND-Inverter Graphs (AIGs) with XOR nodes. In particular, XAGs are networks composed by ANDs, XORs, and inverters. Besides several emerging technologies applications, XAGs are often exploited in cryptography-related applications based on the multiplicative complexity of a Boolean function. The multiplicative complexity of a function is the minimum number of AND gates (i.e., multiplications) that are sufficient to represent the function over the basis {AND, XOR, NOT}. In fact, the minimization of the number of AND gates is important for high-level cryptography protocols such as secure multiparty computation, where processing AND gates is more expensive than processing XOR gates. Moreover, it is an indicator of the degree of vulnerability of the circuit, as a small number of AND gates corresponds to a high vulnerability to algebraic attacks. In this paper we study the multiplicative complexity of Boolean functions characterized by two particular regularities, called autosymmetry and D-reducibility. Moreover, we exploit these regularities for decreasing the number of AND nodes in XAGs. The experimental results validate the proposed approaches. [ABSTRACT FROM AUTHOR]

Intelligent transportation systems (ITS) provides a safe and reliable means of transferring data between vehicles. The document describes the transmission systems, protocols, networks, taxonomy, and applications of Intelligent Systems. Detailed analysis of the existing transmission flow systems is required, including classification, standards, coverage, applications, as well as their advantages and disadvantages. The adaptability of transmission networks, such as ad hoc, hybrid, mobile ad hoc networks (MANET), and Vehicular ad hoc networks (VANETs), has a significant advantage. Described protocols for a variety of communication types, including routing techniques, platforms, structures, and the use of information areas as well. The use of intelligent technology can determine reliable, comfortable, safe, and trustworthy vehicular communication. This paper analyzes the current vehicular communication (VC) research flow and their deployments with indicated areas where further development is necessary. This paper examines how emerging technologies in the upcoming markets will enable the development of high-featured VC technologies. The challenges of improving upon existing VC systems in the development of future systems are discussed in this paper, including medium selection, link and service quality, security, channel characteristics, and mobility. The purpose of this study is to identify the need for the development of improved VC technologies, networks, and protocols for a wide range of applications in the future. [ABSTRACT FROM AUTHOR]

In this paper, we propose a pose grammar to tackle the problem of 3D human pose estimation from a monocular RGB image. Our model takes estimated 2D pose as the input and learns a generalized 2D-3D mapping function to leverage into 3D pose. The proposed model consists of a base network which efficiently captures pose-aligned features and a hierarchy of Bi-directional RNNs (BRNNs) on the top to explicitly incorporate a set of knowledge regarding human body configuration (i.e., kinematics, symmetry, motor coordination). The proposed model thus enforces high-level constraints over human poses. In learning, we develop a data augmentation algorithm to further improve model robustness against appearance variations and cross-view generalization ability. We validate our method on public 3D human pose benchmarks and propose a new evaluation protocol working on cross-view setting to verify the generalization capability of different methods. We empirically observe that most state-of-the-art methods encounter difficulty under such setting while our method can well handle such challenges. [ABSTRACT FROM AUTHOR]

This paper presents a novel embedding protocol that allows for safe and efficient operation of the Hybrid Autonomous Intersection Management (H-AIM) protocol concurrently with actuated and adaptive signal controllers. The proposed protocol extends H-AIM to allow it to cope with some operational uncertainty that is common in actuated signal controllers. A novel approach for computing safety bounds on signal timing is presented as a way of insuring safety in the face of demand uncertainty. Experimental results show the feasibility and effectiveness of combining H-AIM with actuated controllers for various levels of connected and autonomous vehicle (CAV) market penetration and different combinations of common signal control schemes, namely, adaptive signal timing, fixed signal timing, and signal actuation. The benefits are presented in terms of delay improvement when common actuation protocols are used in conjunction with the H-AIM protocol. In contrast to previous reports, the results presented in this paper suggest that mixtures of turning movement assignments that are more permissive for CAVs and less permissive for human operated vehicles are often detrimental in terms of traffic delay. Nonetheless, when implemented on top of an actuated and adaptive controller, the extended H-AIM protocol is shown to never be detrimental while presenting statistically significant reductions in total delay when more than 15% of the traffic is composed of CAVs. [ABSTRACT FROM AUTHOR]