Search

Operational amplifiers (Op-Amps) are critical to sensor systems because they enable precise, reliable, and flexible signal processing. Current automated Op-Amp generation methods suffer from extremely low efficiency because the time-consuming SPICE-in-the-loop sizing is normally involved as its inner loop. In this paper, we propose an efficiently automated Op-Amp generation tool using a hybrid sizing method, which combines the merits together from a deterministic optimization algorithm and differential evolution algorithm. Thus, it can not only quickly find a decent local optimum, but also eventually converge to a global optimum. This feature is well fit to be serving as an acute filter in the circuit structure evaluation flow to efficiently eliminate any undesirable circuit structures in advance of detailed sizing. Our experimental results demonstrate its superiority over traditional sizing approaches and show its efficacy in highly boosting the efficiency of automated Op-Amp structure generation. [ABSTRACT FROM AUTHOR]

This paper addresses the critical need for advanced real-time vehicle detection methodologies in Vehicle Intelligence Systems (VIS), especially in the context of using Unmanned Aerial Vehicles (UAVs) for data acquisition in severe weather conditions, such as heavy snowfall typical of the Nordic region. Traditional vehicle detection techniques, which often rely on custom-engineered features and deterministic algorithms, fall short in adapting to diverse environmental challenges, leading to a demand for more precise and sophisticated methods. The limitations of current architectures, particularly when deployed in real-time on edge devices with restricted computational capabilities, are highlighted as significant hurdles in the development of efficient vehicle detection systems. To bridge this gap, our research focuses on the formulation of an innovative approach that combines the fractional B-spline wavelet transform with a tailored U-Net architecture, operational on a Raspberry Pi 4. This method aims to enhance vehicle detection and localization by leveraging the unique attributes of the NVD dataset, which comprises drone-captured imagery under the harsh winter conditions of northern Sweden. The dataset, featuring 8450 annotated frames with 26,313 vehicles, serves as the foundation for evaluating the proposed technique. The comparative analysis of the proposed method against state-of-the-art detectors, such as YOLO and Faster RCNN, in both accuracy and efficiency on constrained devices, emphasizes the capability of our method to balance the trade-off between speed and accuracy, thereby broadening its utility across various domains. [ABSTRACT FROM AUTHOR]

The inspection of nuclear power plants is an essential process that occurs during plant outages. During this process, various systems are inspected, including the reactor's fuel channels to ensure that they are safe and reliable for the plant's operation. The inspection of Canada Deuterium Uranium (CANDU®) reactor pressure tubes, which are the core component of the fuel channels and house the reactor fuel bundles, is performed using Ultrasonic Testing (UT). Based on the current process that is followed by Canadian nuclear operators, the UT scans are manually examined by analysts to locate, measure, and characterize pressure tube flaws. This paper proposes solutions for the auto-detection and sizing of pressure tube flaws using two deterministic algorithms, the first uses segmented linear regression, while the second uses the average time of flight (ToF) within ±σ of µ. When compared against a manual analysis stream, the linear regression algorithm and the average ToF achieved an average depth difference of 0.0180 mm and 0.0206 mm, respectively. These results are very close to the depth difference of 0.0156 mm when comparing two manual streams. Therefore, the proposed algorithms can be adopted in production, which can lead to significant cost savings in terms of time and labor. [ABSTRACT FROM AUTHOR]

Process algebra can be considered one of the most practical formal methods for modeling Smart IoT Systems in Digital Twin, since each IoT device in the systems can be considered as a process. Further, some of the algebras are applied to predict the behavior of the systems. For example, PALOMA (Process Algebra for Located Markovian Agents) and PACSR (Probabilistic Algebra of Communicating Shared Resources) process algebras are designed to predict the behavior of IoT Systems with probability on choice operations. However, there is a lack of analytical methods in the algebras to predict the nondeterministic behavior of the systems. Further, there is no control mechanism to handle undesirable nondeterministic behavior of the systems. In order to overcome these limitations, this paper proposes a new process algebra, called dTP-Calculus, which can be used (1) to specify the nondeterministic behavior of the systems with static probability, (2) verify the safety and security requirements of the nondeterministic behavior with probability requirements, and (3) control undesirable nondeterministic behavior with dynamic probability. To demonstrate the feasibility and practicality of the approach, the SAVE (Specification, Analysis, Verification, Evaluation) tool has been developed on the ADOxx Meta-Modeling Platform and applied to a SEMS (Smart Emergency Medical Service) example. In addition, a miniature digital twin system for the SEMS example was constructed and applied to the SAVE tool as a proof of concept for Digital Twin. It shows that the approach with dTP-Calculus on the tool can be very efficient and effective for Smart IoT Systems in Digital Twin. [ABSTRACT FROM AUTHOR]

The existing expectation maximization (EM) and space-alternating generalized EM (SAGE) algorithms are only applied to direction of arrival (DOA) estimation in known noise. In this paper, the two algorithms are designed for DOA estimation in unknown uniform noise. Both the deterministic and random signal models are considered. In addition, a new modified EM (MEM) algorithm applicable to the noise assumption is also proposed. Next, these EM-type algorithms are improved to ensure the stability when the powers of sources are not equal. After being improved, simulation results illustrate that the EM algorithm has similar convergence with the MEM algorithm, the SAGE algorithm outperforms the EM and MEM algorithms for the deterministic signal model, and the SAGE algorithm cannot always outperform the EM and MEM algorithms for the random signal model. Furthermore, simulation results show that processing the same snapshots from the random signal model, the SAGE algorithm for the deterministic signal model can require the fewest computations. [ABSTRACT FROM AUTHOR]

Multi-robot exploration means constructing a finite map using a group of robots in an obstacle chaotic space. Uncertainties are reduced by distributing search tasks to robots and computing the best action in real time. Many previous methods are based on deterministic or meta-heuristic algorithms, but limited work has combined both techniques to consolidate both classes' benefits and alleviate their drawbacks. This paper proposes a new hybrid method based on deterministic coordinated multi-robot exploration (CME) and the meta-heuristic salp swarm algorithm (SSA) to perform the search of a space. The precedence of adjacent cells around a robot is determined by deterministic CME using cost and utility. Then, the optimization process of the search space, improving the overall solution, is achieved utilizing the SSA. Three performance measures are considered to evaluate the performance of the proposed method: run time, percentage of the explored area, and the number of times when a method failed to continue a complete run. Experimental results compared four different methods, CME-GWO, CME-GWOSSA, CME-SCA, and CME, over seven maps with extra complexity varying from simple to complex. The results demonstrate how the proposed CME-SSA can outperform the four other methods. Moreover, the simulation results demonstrate that the proposed CME-SSA effectively distributes the robots over the search space to run successfully and obtain the highest exploration rate in less time. [ABSTRACT FROM AUTHOR]

In this paper, we compare six known linear distributed average consensus algorithms on a sensor network in terms of convergence time (and therefore, in terms of the number of transmissions required). The selected network topologies for the analysis (comparison) are the cycle and the path. Specifically, in the present paper, we compute closed-form expressions for the convergence time of four known deterministic algorithms and closed-form bounds for the convergence time of two known randomized algorithms on cycles and paths. Moreover, we also compute a closed-form expression for the convergence time of the fastest deterministic algorithm considered on grids. [ABSTRACT FROM AUTHOR]

With the quick development of Internet of Things (IoT), one of its important supporting technologies, i.e., wireless sensor networks (WSNs), gets much more attention. Neighbor discovery is an indispensable procedure in WSNs. The existing deterministic neighbor discovery algorithms in WSNs ensure that successful discovery can be obtained within a given period of time, but the average discovery delay is long. It is difficult to meet the need for rapid discovery in mobile low duty cycle environments. In addition, with the rapid development of IoT, the node densities of many WSNs greatly increase. In such scenarios, existing neighbor discovery methods fail to satisfy the requirement in terms of discovery latency under the condition of the same energy consumption. This paper proposes a group-based fast neighbor discovery algorithm (GBFA) to address the issues. By carrying neighbor information in beacon packet, the node knows in advance some potential neighbors. It selects more energy efficient potential neighbors and proactively makes nodes wake up to verify whether these potential neighbors are true neighbors, thereby speeding up neighbor discovery, improving energy utilization efficiency and decreasing network communication load. The evaluation results indicate that, compared with other methods, GBFA decreases the average discovery latency up to 10.58 % at the same energy budget. [ABSTRACT FROM AUTHOR]

This paper presents and explores a novel methodology for solving the problem of a water distribution network contamination event, which includes determining the exact source of contamination, the contamination start and end times and the injected contaminant concentration. The methodology is based on coupling a machine learning algorithm for predicting the most probable contamination sources in a water distribution network with an optimization algorithm for determining the values of contamination start time, end time and injected contaminant concentration for each predicted node separately. Two slightly different algorithmic frameworks were constructed which are based on the mentioned methodology. Both algorithmic frameworks utilize the Random Forest algorithm for classification of top source contamination node candidates, with one of the frameworks directly using the stochastic fireworks optimization algorithm to determine the contamination start time, end time and injected contaminant concentration for each predicted node separately. The second framework uses the Random Forest algorithm for an additional regression prediction of each top node's start time, end time and contaminant concentration and is then coupled with the deterministic global search optimization algorithm MADS. Both a small sized (92 potential sources) network with perfect sensor measurements and a medium sized (865 potential sources) benchmark network with fuzzy sensor measurements were used to explore the proposed frameworks. Both algorithmic frameworks perform well and show robustness in determining the true source node, start and end times and contaminant concentration, with the second framework being extremely efficient on the fuzzy sensor measurement benchmark network. [ABSTRACT FROM AUTHOR]

A promising but still scarcely explored strategy for the estimation of gait parameters based on inertial sensors involves the adoption of machine learning techniques. However, existing approaches are reliable only for specific conditions, inertial measurements unit (IMU) placement on the body, protocols, or when combined with additional devices. In this paper, we tested an alternative gait-events estimation approach which is fully data-driven and does not rely on a priori models or assumptions. High-frequency (512 Hz) data from a commercial inertial unit were recorded during 500 steps performed by 40 healthy participants. Sensors' readings were synchronized with a reference ground reaction force system to determine initial/terminal contacts. Then, we extracted a set of features from windowed data labeled according to the reference. Two gray-box approaches were evaluated: (1) classifiers (decision trees) returning the presence of a gait event in each time window and (2) a classifier discriminating between stance and swing phases. Both outputs were submitted to a deterministic algorithm correcting spurious clusters of predictions. The stance vs. swing approach estimated the stride time duration with an average error lower than 20 ms and confidence bounds between ±50 ms. These figures are suitable to detect clinically meaningful differences across different populations. [ABSTRACT FROM AUTHOR]

This paper presents a new non-invasive deterministic algorithm of extracting the fetal Electrocardiogram (FECG) signal based on a new null space idempotent transformation matrix (NSITM). The mixture matrix is used to compute the ITM. Then, the fetal ECG (FECG) and maternal ECG (MECG) signals are extracted from the null space of the ITM. Next, MECG and FECG peaks detection, control logic, and adaptive comb filter are used to remove the unwanted MECG component from the raw FECG signal, thus extracting a clean FECG signal. The visual results from Daisy and Physionet real databases indicate that the proposed algorithm is effective in extracting the FECG signal, which can be compared with principal component analysis (PCA), fast independent component analysis (FastICA), and parallel linear predictor (PLP) filter algorithms. Results from Physionet synthesized ECG data show considerable improvement in extraction performances over other algorithms used in this work, considering different additive signal-to-noise ratio (SNR) increasing from 0 dB to 12 dB, and considering different fetal-to-maternal SNR increasing from −30 dB to 0 dB. The FECG detection of the NSITM is evaluated using statistical measures and results show considerable improvement in the sensitivity (SE), the accuracy (ACC), and the positive predictive value (PPV), as compared with other algorithms. The study demonstrated that the NSITM is a feasible algorithm for FECG extraction. [ABSTRACT FROM AUTHOR]

Controlling nonlinear dynamics arises in various engineering fields. We present efforts to model the forced van der Pol system control using physics-informed neural networks (PINN) compared to benchmark methods, including idealized nonlinear feedforward (FF) control, linearized feedback control (FB), and feedforward-plus-feedback combined (C). The aim is to implement circular trajectories in the state space of the van der Pol system. A designed benchmark problem is used for testing the behavioral differences of the disparate controllers and then investigating controlled schemes and systems of various extents of nonlinearities. All methods exhibit a short initialization accompanying arbitrary initialization points. The feedforward control successfully converges to the desired trajectory, and PINN executes good controls with higher stochasticity observed for higher-order terms based on the phase portraits. In contrast, linearized feedback control and combined feed-forward plus feedback failed. Varying trajectory amplitudes revealed that feed-forward, linearized feedback control, and combined feed-forward plus feedback control all fail for unity nonlinear damping gain. Traditional control methods display a robust fluctuation for higher-order terms. For some various nonlinearities, PINN failed to implement the desired trajectory instead of becoming "trapped" in the phase of small radius, yet idealized nonlinear feedforward successfully implemented controls. PINN generally exhibits lower relative errors for varying targeted trajectories. However, PINN also shows evidently higher computational burden compared with traditional control theory methods, with at least more than 30 times longer control time compared with benchmark idealized nonlinear feed-forward control. This manuscript proposes a comprehensive comparative study for future controller employment considering deterministic and machine learning approaches. [ABSTRACT FROM AUTHOR]

We formulate and analyze a generic coverage optimization problem arising in wireless sensor networks with sensors of limited mobility. Given a set of targets to be covered and a set of mobile sensors, we seek a sensor dispatch algorithm maximizing the covered targets under the constraint that the maximal moving distance for each sensor is upper-bounded by a given threshold. We prove that the problem is NP-hard. Given its hardness, we devise four algorithms to solve it heuristically or approximately. Among the approximate algorithms, we first develop randomized (1 − 1 / e) -optimal algorithm. We then employ a derandomization technique to devise a deterministic (1 − 1 / e) -approximation algorithm. We also design a deterministic approximation algorithm with nearly ▵ − 1 approximation ratio by using a colouring technique, where ▵ denotes the maximal number of subsets covering the same target. Experiments are also conducted to validate the effectiveness of the algorithms in a variety of parameter settings. [ABSTRACT FROM AUTHOR]

Changing lanes while driving requires coordinating the lateral and longitudinal controls of a vehicle, considering its running state and the surrounding environment. Although the existing rule-based automated lane-changing method is simple, it is unsuitable for unpredictable scenarios encountered in practice. Therefore, using a deep deterministic policy gradient (DDPG) algorithm, we propose an end-to-end method for automated lane changing based on lidar data. The distance state information of the lane boundary and the surrounding vehicles obtained by the agent in a simulation environment is denoted as the state space for an automated lane-change problem based on reinforcement learning. The steering wheel angle and longitudinal acceleration are used as the action space, and both the state and action spaces are continuous. In terms of the reward function, avoiding collision and setting different expected lane-changing distances that represent different driving styles are considered for security, and the angular velocity of the steering wheel and jerk are considered for comfort. The minimum speed limit for lane changing and the control of the agent for a quick lane change are considered for efficiency. For a one-way two-lane road, a visual simulation environment scene is constructed using Pyglet. By comparing the lane-changing process tracks of two driving styles in a simplified traffic flow scene, we study the influence of driving style on the lane-changing process and lane-changing time. Through the training and adjustment of the combined lateral and longitudinal control of autonomous vehicles with different driving styles in complex traffic scenes, the vehicles could complete a series of driving tasks while considering driving-style differences. The experimental results show that autonomous vehicles can reflect the differences in the driving styles at the time of lane change at the same speed. Under the combined lateral and longitudinal control, the autonomous vehicles exhibit good robustness to different speeds and traffic density in different road sections. Thus, autonomous vehicles trained using the proposed method can learn an automated lane-changing policy while considering safety, comfort, and efficiency. [ABSTRACT FROM AUTHOR]

WiFi fingerprint positioning has been widely used in the indoor positioning field. The weighed K-nearest neighbor (WKNN) algorithm is one of the most widely used deterministic algorithms. The traditional WKNN algorithm uses Euclidean distance or Manhattan distance between the received signal strengths (RSS) as the distance measure to judge the physical distance between points. However, the relationship between the RSS and the physical distance is nonlinear, using the traditional Euclidean distance or Manhattan distance to measure the physical distance will lead to errors in positioning. In addition, the traditional RSS-based clustering algorithm only takes the signal distance between the RSS as the clustering criterion without considering the position distribution of reference points (RPs). Therefore, to improve the positioning accuracy, we propose an improved WiFi positioning method based on fingerprint clustering and signal weighted Euclidean distance (SWED). The proposed algorithm is tested by experiments conducted in two experimental fields. The results indicate that compared with the traditional methods, the proposed position label-assisted (PL-assisted) clustering result can reflect the position distribution of RPs and the proposed SWED-based WKNN (SWED-WKNN) algorithm can significantly improve the positioning accuracy. [ABSTRACT FROM AUTHOR]