Reviewerly/exHarmony huggingface dataset:
Orbit Determination and Thrust Estimation for Noncooperative Target Using Angle-Only Measurement

The classical interactive multimodel (IMM) algorithm has some disadvantages in tracking a noncooperative continuous thrust maneuvering spacecraft, such as poor steady-state accuracy, difficult selection of subfilter parameters, and mismatched model jump. To address the abovementioned problems, a variable-dimensional adaptive IMM strong tracking filtering algorithm (VAIMM-STEKF) is proposed to estimate the spacecraft’s position, velocity, and maneuvering acceleration state. VAIMM-STEKF contains 2 models, model 1 and model 2, which correspond to the tracking of the spacecraft in maneuvering and nonmaneuvering situations. Model 1 estimates the position and velocity of the spacecraft to ensure tracking accuracy when no maneuver occurs. Model 2 is a strong tracking filter with an augmented state. The adaptive IMM algorithm adjusts the fixed Markov transfer matrix in real time according to the model output probability. According to the different states of the spacecraft, the corresponding model interactive fusion method, together with the strong tracking filter, is adopted to ensure fast tracking when the spacecraft state changes. This method can also adapt to continuous thrust maneuvering spacecraft with different orders of magnitude. Simulation results show that the position accuracy of VAIMM-STEKF can be improved by approximately 27% and the speed accuracy can be enhanced by approximately 17% under different levels of maneuvering acceleration compared with those of the IMM algorithm. The convergence speed of VAIMM-STEKF is also better than the IMM algorithm.
Analysis of Machine Learning Based Imputation of Missing Data

Data analysis and classification can be affected by the availability of missing data in datasets. To deal with missing data, either deletion- or imputation-based methods are used that result in the reduction of data records or imputation of incorrect predicted value. Quality of imputed data can be significantly improved if missing values are generated accurately using machine learning algorithms. In this work, an analysis of machine learning-based algorithms for missing data imputation is performed. The K-nearest neighbors (KNN) and Sequential KNN (SKNN) algorithms are used to impute missing values in datasets using machine learning. Missing values handled using a statistical deletion approach (List-wise Deletion (LD)) and ML-based imputation methods (KNN and SKNN) are then tested and compared using different ML classifiers (Support Vector Machine and Decision Tree) to evaluate the effectiveness of imputed data. The used algorithms are compared in terms of accuracy, and results yielded that the ML-based imputation method (SKNN) outperforms the LD-based approach and KNN method in terms of the effectiveness of handling missing data in almost every dataset with both classification algorithms (SVM and DT).
Specialized Job Market Management to Help Graduates

This study aims to find out and identify: (1) Implementation of the Special Job Fair (BKK) at SMK Negeri 1 Gelumbang; Obstacles faced at BKK SMK Negeri 1 Gelumbang. This study is descriptive qualitative research. The subjects were the Head of BKK, BKK staff, Principal of SMK N 1 Gelumbang, and alumni at SMK Negeri 1 Gelumbang. Data collection techniques were interviews, observations, and documentation studies. Data analysis technique was carried out in four stages: (1) data collection, (2) data reduction, (3) data presentation, (4) data withdrawal. The results of the research showed (1) Implementation of BKK SMK Negeri 1 Gelumbang Activities is carried out through Planning, Implementation, Supervision; (2) Obstacles in implementing BKK SMK Negeri 1 Gelumbang activities are internal and external obstacles.
Access and Uses of ICTs: Can Virtual Learning Be an Alternative Mode of Education in India?

This study analyses household access and persons’ uses of information and communication technologies (ICTs) in India by using the latest National Sample Survey Organization’s (NSSO) Education survey (2017–2018) datasets. Accordingly, an ICT Index is computed, and a logistic model is applied to examine the pattern and likelihood of digital technology usage and access. The result shows that access to ICTs is lower in rural areas and access increases with the level of education. The study also observes that factors like education, income and regional variations are significant aspects of the disproportionate uses and access of ICTs at the household and individual levels. This study also observed that the low level of access to ICTs will be a huge challenge for the Government to ensure alternate online or virtual modes of education.
CIM: A Novel Clustering-based Energy-Efficient Data Imputation Method for Human Activity Recognition

Human activity recognition (HAR) is an important component in a number of health applications, including rehabilitation, Parkinson’s disease, daily activity monitoring, and fitness monitoring. State-of-the-art HAR approaches use multiple sensors on the body to accurately identify activities at runtime. These approaches typically assume that data from all sensors are available for runtime activity recognition. However, data from one or more sensors may be unavailable due to malfunction, energy constraints, or communication challenges between the sensors. Missing data can lead to significant degradation in the accuracy, thus affecting quality of service to users. A common approach for handling missing data is to train classifiers or sensor data recovery algorithms for each combination of missing sensors. However, this results in significant memory and energy overhead on resource-constrained wearable devices. In strong contrast to prior approaches, this paper presents a clustering-based approach (CIM) to impute missing data at runtime. We first define a set of possible clusters and representative data patterns for each sensor in HAR. Then, we create and store a mapping between clusters across sensors. At runtime, when data from a sensor are missing, we utilize the stored mapping table to obtain most likely cluster for the missing sensor. The representative window for the identified cluster is then used as imputation to perform activity classification. We also provide a method to obtain imputation-aware activity prediction sets to handle uncertainty in data when using imputation. Experiments on three HAR datasets show that CIM achieves accuracy within 10% of a baseline without missing data for one missing sensor when providing single activity labels. The accuracy gap drops to less than 1% with imputation-aware classification. Measurements on a low-power processor show that CIM achieves close to 100% energy savings compared to state-of-the-art generative approaches.
MaGNAS: A Mapping-Aware Graph Neural Architecture Search Framework for Heterogeneous MPSoC Deployment

Graph Neural Networks (GNNs) are becoming increasingly popular for vision-based applications due to their intrinsic capacity in modeling structural and contextual relations between various parts of an image frame. On another front, the rising popularity of deep vision-based applications at the edge has been facilitated by the recent advancements in heterogeneous multi-processor Systems on Chips (MPSoCs) that enable inference under real-time, stringent execution requirements. By extension, GNNs employed for vision-based applications must adhere to the same execution requirements. Yet contrary to typical deep neural networks, the irregular flow of graph learning operations poses a challenge to running GNNs on such heterogeneous MPSoC platforms. In this paper, we propose a novel unified design-mapping approach for efficient processing of vision GNN workloads on heterogeneous MPSoC platforms. Particularly, we develop MaGNAS, a mapping-aware Graph Neural Architecture Search framework. MaGNAS proposes a GNN architectural design space coupled with prospective mapping options on a heterogeneous SoC to identify model architectures that maximize on-device resource efficiency. To achieve this, MaGNAS employs a two-tier evolutionary search to identify optimal GNNs and mapping pairings that yield the best performance trade-offs. Through designing a supernet derived from the recent Vision GNN (ViG) architecture, we conducted experiments on four (04) state-of-the-art vision datasets using both ( i ) a real hardware SoC platform (NVIDIA Xavier AGX) and ( ii ) a performance/cost model simulator for DNN accelerators. Our experimental results demonstrate that MaGNAS is able to provide 1.57 × latency speedup and is 3.38 × more energy-efficient for several vision datasets executed on the Xavier MPSoC vs. the GPU-only deployment while sustaining an average 0.11% accuracy reduction from the baseline.
Talks and Transformation

This introduction to the 2023 Forum for Information Professionals (FIP) Conference Extended Abstracts discusses this year’s theme of climate change and the LIS field in the context of the changes and transitions the academic, student-organized conference continues to take.
Multi-patch integrated learning dehazing network for small-scale dataset

To further improve the feature representation ability of haze removal model on small-scale datasets, we propose a three-hierarchical encoder–decoder integrating learning architecture. Unlike increasing the depth of network to improve the performance, we use three sets of transfer learning encoders to aggregate features on multiple patches. This strategy makes full use of deep and shallow features from different spatial parts of original hazy images. These different spatial parts are used to jointly optimize non-homogeneous hazy images with different scene depths and degradation degrees. We propose an integrated learning decoder, in which the internal integrated learning module decodes by gradually infusing the deep and shallow features of the identical patch. We fuse all encoded features at each stage for original resolution decoder. We report the quantitative and visual results of eight advanced haze removal methods (2019 to 2021). We compare these methods on five real-world and synthetic hazy datasets, including homogeneous and non-homogeneous degraded datasets. We present the results of the ablation study for key components. The generalization of our method is significantly better than other methods on real hazy scenes. We report improvements in semantic segmentation performance. This result could be used for autonomous driving, automated guided vehicle scheduling in closed factory area, etc.
Sports Buddy Application

The Sports Buddy application allows distributors to post details of various sports information, such as location and time, for events conducted near their location. With millions of matches, Sports Buddy has become the world's largest sports matching platform. Powered by cutting-edge Android technology, Sports Buddy enables you to expand your network, meet new friends, connect with locals while travelling, and find your buddy in over N sports. It provides an app that allows users to foster real and meaningful connections, going beyond just social interactions. Connecting on Sports Buddy is easy and fun; simply select the sports you are interested in, set your skill level, and let the matching begin! Sports Buddy also offers a range of features to help users manage their bookings and stay up-to-date on upcoming events. Users can create an account to store their preferences and booking history, as well as receive alerts and notifications about new events and changes to existing bookings. The system also includes a payment gateway for secure and efficient payment processing, along with tools for event organizers and distributors to manage their listings and track ticket sales. We can also buy sports related accessories here and its payment goes to distributor
BitSET: Bit-Serial Early Termination for Computation Reduction in Convolutional Neural Networks

Convolutional Neural Networks (CNNs) have demonstrated remarkable performance across a wide range of machine learning tasks. However, the high accuracy usually comes at the cost of substantial computation and energy consumption, making it difficult to be deployed on mobile and embedded devices. In CNNs, the compute-intensive convolutional layers are usually followed by a ReLU activation layer, which clamps negative outputs to zeros, resulting in large activation sparsity. By exploiting such sparsity in CNN models, we propose a software-hardware co-design BitSET, that aggressively saves energy during CNN inference. The bit-serial BitSET accelerator adopts a prediction-based bit-level early termination technique that terminates the ineffectual computation of negative outputs early. To assist the algorithm, we propose a novel weight encoding that allows more accurate predictions with fewer bits. BitSET leverages the bit-level computation reduction both in the predictive early termination algorithm and in the non-predictive, energy-efficient bit-serial architecture. Compared to UNPU, an energy-efficient bit-serial CNN accelerator, BitSET yields an average 1.5× speedup and 1.4× energy efficiency improvement with no accuracy loss due to a 48% reduction in bit-level computations. Relaxing the allowed accuracy loss to 1% increases the gains to an average of 1.6× speedup and 1.4× energy efficiency improvement.
Formal Synthesis of Neural Barrier Certificates for Continuous Systems via Counterexample Guided Learning

This paper presents a novel approach to safety verification based on neural barrier certificates synthesis for continuous dynamical systems. We construct the synthesis framework as an inductive loop between a Learner and a Verifier based on barrier certificate learning and counterexample guidance. Compared with the counterexample-guided verification method based on the SMT solver, we design and learn neural barrier functions with special structure, and use the special form to convert the counterexample generation into a polynomial optimization problem for obtaining the optimal counterexample. In the verification phase, the task of identifying the real barrier certificate can be tackled by solving the Linear Matrix Inequalities (LMI) feasibility problem, which is efficient and makes the proposed method formally sound. The experimental results demonstrate that our approach is more effective and practical than the traditional SOS-based barrier certificates synthesis and the state-of-the-art neural barrier certificates learning approach.
STADIA: Photonic Stochastic Gradient Descent for Neural Network Accelerators

Deep Neural Networks (DNNs) have demonstrated great success in many fields such as image recognition and text analysis. However, the ever-increasing sizes of both DNN models and training datasets make deep leaning extremely computation- and memory-intensive. Recently, photonic computing has emerged as a promising technology for accelerating DNNs. While the design of photonic accelerators for DNN inference and forward propagation of DNN training has been widely investigated, the architectural acceleration for equally important backpropagation of DNN training has not been well studied. In this paper, we propose a novel silicon photonic-based backpropagation accelerator for high performance DNN training. Specifically, a general-purpose photonic gradient descent unit named STADIA is designed to implement the multiplication, accumulation, and subtraction operations required for computing gradients using mature optical devices including Mach-Zehnder Interferometer (MZI) and Mircoring Resonator (MRR), which can significantly reduce the training latency and improve the energy efficiency of backpropagation. To demonstrate efficient parallel computing, we propose a STADIA-based backpropagation acceleration architecture and design a dataflow by using wavelength-division multiplexing (WDM). We analyze the precision of STADIA by quantifying the precision limitations imposed by losses and noises. Furthermore, we evaluate STADIA with different element sizes by analyzing the power, area and time delay for photonic accelerators based on DNN models such as AlexNet, VGG19 and ResNet. Simulation results show that the proposed architecture STADIA can achieve significant improvement by 9.7× in time efficiency and 147.2× in energy efficiency, compared with the most advanced optical-memristor based backpropagation accelerator.
GHOST: A Graph Neural Network Accelerator using Silicon Photonics

Graph neural networks (GNNs) have emerged as a powerful approach for modelling and learning from graph-structured data. Multiple fields have since benefitted enormously from the capabilities of GNNs, such as recommendation systems, social network analysis, drug discovery, and robotics. However, accelerating and efficiently processing GNNs require a unique approach that goes beyond conventional artificial neural network accelerators, due to the substantial computational and memory requirements of GNNs. The slowdown of scaling in CMOS platforms also motivates a search for alternative implementation substrates. In this paper, we present GHOST , the first silicon-photonic hardware accelerator for GNNs. GHOST efficiently alleviates the costs associated with both vertex-centric and edge-centric operations. It implements separately the three main stages involved in running GNNs in the optical domain, allowing it to be used for the inference of various widely used GNN models and architectures, such as graph convolution networks and graph attention networks. Our simulation studies indicate that GHOST exhibits at least 10.2 × better throughput and 3.8 × better energy efficiency when compared to GPU, TPU, CPU and multiple state-of-the-art GNN hardware accelerators.
Energy-efficient Personalized Federated Search with Graph for Edge Computing

Federated Learning (FL) is a popular method for privacy-preserving machine learning on edge devices. However, the heterogeneity of edge devices, including differences in system architecture, data, and co-running applications, can significantly impact the energy efficiency of FL. To address these issues, we propose an energy-efficient personalized federated search framework. This framework has three key components. Firstly, we search for partial models with high inference efficiency to reduce training energy consumption and the occurrence of stragglers in each round. Secondly, we build lightweight search controllers that control the model sampling and respond to runtime variances, mitigating new straggler issues caused by co-running applications. Finally, we design an adaptive search update strategy based on graph aggregation to improve personalized training convergence. Our framework reduces the energy consumption of the training process by lowering the training overhead of each round and speeding up the training convergence rate. Experimental results show that our approach achieves up to 5.02% accuracy and 3.45× energy efficiency improvements.
Mapping the Research on Blockchain in Education: A Systematic Review and Bibliometric Analysis

Blockchain technology was once only associated with the financial industry, but it is now being used in a variety of industries, including education. Researchers all over the world take a keen interest in studying the various applications of blockchain technology for the last 4–5 years. The current study is a review of previously published studies on blockchain technology’s applicability in the sector of education. The systematic review was used to conduct the qualitative analysis using the PRISMA Framework (Preferred Reporting Items for Systematic Review and Meta-Analysis). For this comprehensive literature review analysis, 99 publications were chosen in the final stage of selection. Bibliometric analysis is employed to analyse the collected data. Authorship analysis, co-authorship analysis, keyword co-occurrences, and important applications of blockchain in education are the primary parts in which the literature’s findings are organised. Important directions are given for researchers and academicians involved in blockchain-related research who may use the bibliometric analysis of the present study as a reference.
<scp>Hephaestus</scp> : Codesigning and Automating 3D Image Registration on Reconfigurable Architectures

Healthcare is a pivotal research field, and medical imaging is crucial in many applications. Therefore finding new architectural and algorithmic solutions would benefit highly repetitive image processing procedures. One of the most complex tasks in this sense is image registration, which finds the optimal geometric alignment among 3D image stacks and is widely employed in healthcare and robotics. Given the high computational demand of such a procedure, hardware accelerators are promising real-time and energy-efficient solutions, but they are complex to design and integrate within software pipelines. Therefore, this work presents an automation framework called Hephaestus that generates efficient 3D image registration pipelines combined with reconfigurable accelerators. Moreover, to alleviate the burden from the software, we codesign software-programmable accelerators that can adapt at run-time to the image volume dimensions. Hephaestus features a cross-platform abstraction layer that enables transparently high-performance and embedded systems deployment. However, given the computational complexity of 3D image registration, the embedded devices become a relevant and complex setting being constrained in memory; thus, they require further attention and tailoring of the accelerators and registration application to reach satisfactory results. Therefore, with Hephaestus , we also propose an approximation mechanism that enables such devices to perform the 3D image registration and even achieve, in some cases, the accuracy of the high-performance ones. Overall, Hephaestus demonstrates 1.85× of maximum speedup, 2.35× of efficiency improvement with respect to the State of the Art, a maximum speedup of 2.51× and 2.76× efficiency improvements against our software, while attaining state-of-the-art accuracy on 3D registrations.
Probabilistic Black-Box Checking via Active MDP Learning

We introduce a novel methodology for testing stochastic black-box systems, frequently encountered in embedded systems. Our approach enhances the established black-box checking (BBC) technique to address stochastic behavior. Traditional BBC primarily involves iteratively identifying an input that breaches the system’s specifications by executing the following three phases: the learning phase to construct an automaton approximating the black box’s behavior, the synthesis phase to identify a candidate counterexample from the learned automaton, and the validation phase to validate the obtained candidate counterexample and the learned automaton against the original black-box system. Our method, ProbBBC, refines the conventional BBC approach by (1) employing an active Markov Decision Process (MDP) learning method during the learning phase, (2) incorporating probabilistic model checking in the synthesis phase, and (3) applying statistical hypothesis testing in the validation phase. ProbBBC uniquely integrates these techniques rather than merely substituting each method in the traditional BBC; for instance, the statistical hypothesis testing and the MDP learning procedure exchange information regarding the black-box system’s observation with one another. The experiment results suggest that ProbBBC outperforms an existing method, especially for systems with limited observation.