Smart infrastructures often intend to provide personalized context-aware services for their residents. These context-aware services, in turn, often rely on sophisticated machine learning algorithms which need vast vol...
Smart infrastructures often intend to provide personalized context-aware services for their residents. These context-aware services, in turn, often rely on sophisticated machine learning algorithms which need vast volumes of costly annotated sensor data. State-of-the-art automated annotation frameworks try to solve this problem by generating annotated sensor data obtained from personal wearables. However, most of these approaches - (a) either need visual data from the environment or (b) can only work for environments with a single resident. This paper discusses the design of a first-of-its-kind framework Acconotate which can automatically generate annotated data from dual resident smart environments without requiring any visual information. Acconotate achieves this by exploiting the typical transitions present in complex human activities first to solve the critical problem of the user-to-activity association and then use that to annotate the sensor stream available from both the users. Rigorous evaluation with two real-life datasets collected in two diverse scenarios shows that Acconotate can successfully generate annotated sensor data over the edge without human intervention.
Existing engineering practices show that it is a complex task to require automatic detection and matching of corresponding features, usually without any prior knowledge of the scene and image. As the detailed applicat...
Existing engineering practices show that it is a complex task to require automatic detection and matching of corresponding features, usually without any prior knowledge of the scene and image. As the detailed application, this research study considered the scheme of automatic scoring system for Wushu movements based on real-time action image recognition and matching algorithm. Starting from the review of the state-of-the-art study results, the questions for the efficient image recognition is firstly presented. Then, efficient effective moment invariants are designed to serve as the pre-processing of the images and the quadtree method is used for the modelling. The new roles and methods are designed to conduct the task of the efficient image recognition. Furthermore, the SIFT based matching algorithm is designed. Combining these 2 algorithms, the efficient scoring system is implemented and comparison experiment is conducted. After testing, it is reflected that the proposed model has the better recognition accuracy and the scoring performance is good.
With the advancements in technology, various kinds of physical actions may now be digitally operated with the click of a button. This has given rise to the concept of IoT to strengthen the MANET-WSN (M-WSN) in a creat...
With the advancements in technology, various kinds of physical actions may now be digitally operated with the click of a button. This has given rise to the concept of IoT to strengthen the MANET-WSN (M-WSN) in a creative perspective. To find the appropriate path, several routing methods transmit control packets and transmitting unwanted network information consume the battery and raise the issue of packet overhead which reduces then network lifespan. Among various issues, high latency, energy consumption, packet drop, network lifetime and insecure data delivery were to name a few. Moreover, a highly reliable, and adaptive routing is lacking that could provide efficient data transmission in mobile node environment. Therefore, in this research, important protocols for routing supported by M-WSN and game theory methodology, with various route discovery algorithms and secure data transmission from source to destination are discussed. This systematic review considers the last 15 years' studies which were found from highly credible sources. This paper presents a comprehensive study of routing algorithms in mobile and static WSN architectures with an emphasis on using game theory as a decision-making tool. The paper begins with a summary of the modern facilities in routing algorithms and then delves into the many game theory-based strategies that have been put forth for this field. The paper concludes with a discussion of the advantages and challenges of using game theory in the context of routing algorithms, and provides recommendations for future research directions. The idea is expanded to include the performance metrics, security measures, and privacy considerations that surround the secure transmission of data packets between different nodes. The comprehensive analysis provides potential solutions proposed by different researchers that can help for future studies aimed at enhancing network information sharing. A number of routing designs were studied from an analytica
Convolutional neural networks (CNN) due to their excellent accuracy, have emerged as the leading machine learning method. However, it becomes difficult to deploy CNN algorithms on hardware platforms because of their h...
详细信息
Convolutional neural networks (CNN) due to their excellent accuracy, have emerged as the leading machine learning method. However, it becomes difficult to deploy CNN algorithms on hardware platforms because of their high memory bandwidth, computational complexity, and power consumption. Hardware accelerators such as Field Programmable Gate Arrays (FPGA), Graphics processing Unit (GPU), etc. are excellent platforms for modelling CNN algorithms. The purpose of the paper is to run a standard software process in hardware and exploit natural parallelism in hardware to speed up neural network prediction. The paper presents a rule-based synthesizable Advanced Microcontroller Bus Architecture (AMBA) Advanced eXtensible Interface (AXI) protocol for high-speed data transmission. The paper develops a computer vision system on an FPGA that could recognize the numbers 0 through 9 written by hand for the capstone design project. The findings show that 91% accuracy is achieved through Rectified linear activation unit (ReLU) which can be increased to 98% by implementing the Sigmoid activation function with a depth of 10 bits. The method provides good accuracy and clock performance while using few resources.
In this paper, we propose a restoration method of time-varying graph signals, i.e., signals on a graph whose signal values change over time, using deep algorithm unrolling. Deep algorithm unrolling is a method that le...
详细信息
In this paper, we propose a restoration method of time-varying graph signals, i.e., signals on a graph whose signal values change over time, using deep algorithm unrolling. Deep algorithm unrolling is a method that learns parameters in an iterative optimization algorithm with deep learning techniques. It is expected to improve convergence speed and accuracy while the iterative steps are still interpretable. In the proposed method, the minimization problem is formulated so that the time-varying graph signal is smooth both in time and spatial domains. The internal parameters, i.e., time domain FIR filters and regularization parameters, are learned from training data. Experimental results using synthetic data and real sea surface temperature data show that the proposed method improves signal reconstruction accuracy compared to several existing time-varying graph signal re- construction methods.
In large-scale distributed systems, computational nodes often experience random slowdown which can degrade the performance of timely computation tasks significantly. Recently, coded computing has emerged as a promisin...
In large-scale distributed systems, computational nodes often experience random slowdown which can degrade the performance of timely computation tasks significantly. Recently, coded computing has emerged as a promising approach where coded subtasks are generated for parallel execution over different nodes. In this paper, we focus on exploring the tradeoff between the performance of coding-based timely computation tasks and the computation cost in distributed systems with heterogeneous nodes. We introduce a node selection problem (NSP), which aims at minimizing the task failure probability by selecting proper participating nodes under a total cost constraint. We show that NSP is NP-hard due to the total cost constraint, and is more challenging since the task failure probability is a complicated multivariate polynomial. By approximating the task failure probability using central limit theorem and establishing relationships with certain integer linear programming problems, we then propose a linear programming relaxation based algorithm with performance guarantee, as well as an efficient Lagrangian relaxation inspired heuristic algorithm. The effectiveness of the proposed node selection algorithms is further demonstrated via both trace-driven and model-driven simulations.
One of the focuses of smart manufacturing technology is data management and processing. However, there are issues which is difficult to integrate the data within the enterprise, share industry chain data and obtain op...
One of the focuses of smart manufacturing technology is data management and processing. However, there are issues which is difficult to integrate the data within the enterprise, share industry chain data and obtain open data in the management and processing of existing industrial data. To address this challenge, this paper proposes a construction method of industrial data decentralized distributed symbiotic sharing space (iDS3) based on tensor. The proposed method consists of three core steps. First, metadata is extracted from multi-source heterogeneous raw data; Second, a knowledge graph is constructed using industrial mechanism to enrich the metadata; Finally, tensors are used to store metadata and its corresponding unique identifier ID. A metadata encoding rule based on industrial mechanisms is adopted in this work, which can support tensor queries in different application scenarios, thereby achieving ubiquitous storage of data by solving the distributed symbiotic sharing of multi-source heterogeneous raw data. At present, the industrial data governance platform (iDGP) developed based on iDS3 has been applied to the data integration of industrial enterprises such as ships, integrated circuits and new energy vehicles, the integration development with various the third-party dataprocessing tools, and application services of industry dataspaces and so on, which shows that iDS3 has been a successful solution for the development of technology-driven Industry 4.0 to value-driven Industry 5.0.
Recently, recommendation systems, especially interpretable ones, have become increasingly popular. The recommendation system provides personalized recommendations to users based on their previous behaviour data. Exist...
Recently, recommendation systems, especially interpretable ones, have become increasingly popular. The recommendation system provides personalized recommendations to users based on their previous behaviour data. Existing approaches often transfer methods in disentangle learning, especially Variational Auto-Encoder (VAE) framework, into the recommendation system. However, VAE is proved sub-optimal due to the independence factor assumption. Unfortunately, few research focuses on the VAE framework without an independent assumption for recommendation system. To escape from sub-optimality from independence assumption and provide more interpretability, in this paper, we propose a new method for top-n recommendation tasks called Item Concept Causal Variational Auto-Encoder (ICCVAE), enabling to build up causal structure for factors, i.e., item concepts in recommendation system. We conduct experiments to prove superiority for ICCVAE. Our framework can reach up to 5.3%, 3.4%, and 6.1% definite improvement over baselines in terms of Recall@20, Recall@50 and NDCG@100.
Wireless Rechargeable Sensor Nodes (WRSNs) are widely used to sense, collect, and process data or signals transmitted among people, the environment, and computer systems. However, it faces severe threats such as conge...
Wireless Rechargeable Sensor Nodes (WRSNs) are widely used to sense, collect, and process data or signals transmitted among people, the environment, and computer systems. However, it faces severe threats such as congestion, resource deprivation, security risk, limited communication speed, high cost, limited bandwidth, and so on. To address some of these issues and to improve the QoS, this paper proposes an Adaptive Rate Determined Congestion Management (ARDCM) approach. It adopts a feedback-based system in which the incoming data rate is managed to increase when congestion is low and decrease when congestion is high. It guarantees congestion free data flow between upstream and downstream in data communication by controlling the data rate and buffer occupancy. The proposed approach is simulated on NS2 with varying numbers of active nodes in a simulated environment. The proposed model’s performance is evaluated by comparing the Packet Delivery Ratio(PDR), Packet Loss Ratio(PLR), delay, and throughput to the existing algorithms.
A content-based image Retrieval (CBIR) has become an essential tool for managing and searching large-scale images. However, the accuracy and performance of CBIR systems can be improved by combining data mining techniq...
详细信息
暂无评论