Search

Deep cascaded networks have been extensively studied and applied to accelerate Magnetic Resonance Imaging (MRI) and have shown promising results. Most existing works employ a large cascading number for the sake of superior performances. However, due to the lack of proper guidance, the reconstruction performance can easily reach a plateau and even face degradation if simply increasing the cascading number. In this paper, we aim to boost the reconstruction performance from a novel perspective by proposing a parallel architecture called DIRECTION that fully exploits the guiding value of the reconstruction residual of each subnetwork. Specifically, we introduce a novel Reconstruction Residual-Based Feature Modulation Mechanism (RRFMM) which utilizes the reconstruction residual of the previous subnetwork to guide the next subnetwork at the feature level. To achieve this, a Residual Attention Modulation Block (RAMB) is proposed to generate attention maps using multi-scale residual features to modulate the image features of the corresponding scales. Equipped with this strategy, each subnetwork within the cascaded network possesses its unique optimization objective and emphasis rather than blindly updating its parameters. To further boost the performance, we introduce the Cross-Stage Feature Reuse Connection (CSFRC) and the Reconstruction Dense Connection (RDC), which can reduce information loss and enhance representative ability. We conduct sufficient experiments and evaluate our method on the fastMRI knee dataset using multiple subsampling masks. Comprehensive experimental results show that our method can markedly boost the performance of cascaded networks and significantly outperforms other compared state-of-the-art methods quantitatively and qualitatively., (Copyright © 2024. Published by Elsevier Inc.)

Olfaction feedback systems could be utilized to stimulate human emotion, increase alertness, provide clinical therapy, and establish immersive virtual environments. Currently, the reported olfaction feedback technologies still face a host of formidable challenges, including human perceivable delay in odor manipulation, unwieldy dimensions, and limited number of odor supplies. Herein, we report a general strategy to solve these problems, which associates with a wearable, high-performance olfactory interface based on miniaturized odor generators (OGs) with advanced artificial intelligence (AI) algorithms. The OGs serve as the core technology of the intelligent olfactory interface, which exhibit milestone advances in millisecond-level response time, milliwatt-scale power consumption, and the miniaturized size. Empowered by robust AI algorithms, the olfactory interface shows its great potentials in latency-free mixed reality (MR) and fast olfaction enhancement, thereby establishing a bridge between electronics and users for broad applications ranging from entertainment, to education, to medical treatment, and to human machine interfaces., (© 2024. The Author(s).)

Although robust PCA has been increasingly adopted to extract vessels from X-ray coronary angiography (XCA) images, challenging problems such as inefficient vessel-sparsity modelling, noisy and dynamic background artefacts, and high computational cost still remain unsolved. Therefore, we propose a novel robust PCA unrolling network with sparse feature selection for super-resolution XCA vessel imaging. Being embedded within a patch-wise spatiotemporal super-resolution framework that is built upon a pooling layer and a convolutional long short-term memory network, the proposed network can not only gradually prune complex vessel-like artefacts and noisy backgrounds in XCA during network training but also iteratively learn and select the high-level spatiotemporal semantic information of moving contrast agents flowing in the XCA-imaged vessels. The experimental results show that the proposed method significantly outperforms state-of-the-art methods, especially in the imaging of the vessel network and its distal vessels, by restoring the intensity and geometry profiles of heterogeneous vessels against complex and dynamic backgrounds. The source code is available at https://github.com/Binjie-Qin/RPCA-UNet.

In recent years, many approaches have been suggested for Internet and web streaming detection. In this paper, we propose an approach to signal waveform detection for Internet and web streaming, with novel statistical automatons. The system records network connections over a period of time to form a signal waveform and compute suspicious characteristics of the waveform. Network streaming according to these selected waveform features by our newly designed Aho-Corasick (AC) automatons can be classified. We developed two versions, that is, basic AC and advanced AC-histogram waveform automata, and conducted comprehensive experimentation. The results confirm that our approach is feasible and suitable for deployment.

The current popular approach to the extraction of document-level relations is mainly based on either a graph structure or serialization model method for the inference, but the graph structure method makes the model complicated, while the serialization model method decreases the extraction accuracy as the text length increases. To address such problems, the goal of this paper is to develop a new approach for document-level relationship extraction by applying a new idea through the consideration of so-called "Local Relationship and Global Inference" (in short, LRGI), which means that we first encode the text using the BERT pre-training model to obtain a local relationship vector first by considering a local context pooling and bilinear group algorithm and then establishing a global inference mechanism based on Floyd's algorithm to achieve multi-path multi-hop inference and obtain the global inference vector, which allow us to extract multi-classified relationships with adaptive thresholding criteria. Taking the DocRED dataset as a testing set, the numerical results show that our proposed new approach (LRGI) in this paper achieves an accuracy of 0.73, and the value of F1 is 62.11, corresponding to 28% and 2% improvements by comparing with the classical document-level relationship extraction model (ATLOP), respectively. [ABSTRACT FROM AUTHOR]

With the rapid development of information society, a large amount of vague or uncertain English interpretation information appears in daily life. Uncertain information processing is an important research content in the field of artificial intelligence. In this paper, we combine the three-branch concept lattice and linguistic values with the digital elevation model and propose the three-branch fuzzy linguistic concept lattice as well as the attribute approximation method. In this paper, an improved serial algorithm for sink accumulation is proposed. The improved algorithm changes the order of cell calculation; after the cumulative amount of a "sub-basin" is calculated, all cells of the next "sub-basin" are calculated until all cells are calculated. The improved algorithm reduces the overhead space in the calculation process, reduces the pressure of cells entering and leaving the queue, and improves the calculation efficiency. The improved cumulant algorithm is compared with the commonly used recursive cumulant algorithm and the nonrecursive cumulant algorithm, and the improved algorithm improves by about 17% compared with the nonrecursive algorithm at 106 cell level, and the computation time of the recursive algorithm is about 3 times of the improved algorithm. Because the sink accumulation serial algorithm is an important part of the parallel calculation of sink accumulation, and the execution time is shorter by using the improved algorithm, this paper applies the proposed improved accumulation serial algorithm to the process of parallel calculation of accumulation. [ABSTRACT FROM AUTHOR]

In massive multiple-input multiple-output (MIMO), it is much challenging to obtain accurate channel state information (CSI) after radio frequency (RF) chain reduction due to the high dimensions. With the fast development of machine learning(ML), it is widely acknowledged that ML is an effective method to deal with channel models which are typically unknown and hard to approximate. In this paper, we use the low complexity vector approximate messaging passing (VAMP) algorithm for channel estimation, combined with a deep learning framework for soft threshold shrinkage function training. Furthermore, in order to improve the estimation accuracy of the algorithm for massive MIMO channels, an optimized threshold function is proposed. This function is based on Gaussian mixture (GM) distribution modeling, and the expectation maximum Algorithm (EM Algorithm) is used to recover the channel information in beamspace. This contraction function and deep neural network are improved on the vector approximate messaging algorithm to form a high-precision channel estimation algorithm. Simulation results validate the effectiveness of the proposed network. [ABSTRACT FROM AUTHOR]

An extended peridynamic approach for crack propagation analysis in concrete structures was proposed. In the peridynamic constitutive model, concrete material was described as a series of interacting particles, and the short-range repulsive force and anisotropic behavior of concrete were taken into account in the expression of the interactive bonding force, which was given in terms of classical elastic constants and peridynamic horizon. The damage of material was defined locally at the level of pairwise bond, and the critical stretch of material bond was described as a function of fracture strength in the classical concrete failure theory. The efficiency and accuracy of the proposed model and algorithms were validated by simulating the propagation of mode I and I-II mixed mode cracks in concrete slabs. Furthermore, crack propagation in a double-edge notched concrete beam subjected to four-point load was simulated, in which the experimental observations are captured naturally as a consequence of the solution. [ABSTRACT FROM AUTHOR]

Broadcasting is a key function in mobile ad hoc networks. Topology-dependent scheduling algorithms depend on the detailed network connectivity information and cannot adapt to dynamic topological changes in mobile networks. To overcome this limitation, topology-transparent broadcast scheduling algorithms have been proposed. Due to the large overhead of implementing the acknowledgement mechanism in broadcast communications and to guarantee that there is at least one collision-free transmission in each frame, most existing topology-transparent broadcast scheduling algorithms require a node to transmit the same packet repeatedly at multiple slots during one frame. This is very inefficient. In this paper, we propose an efficient topology-transparent broadcast scheduling algorithm. First, instead of transmitting the same packet repeatedly during one frame, each node collects transmission codes of its two-hop neighbors and transmits several different packets during one frame. Second, noting that many unassigned slots are not utilized, we propose several methods to utilize the unassigned slots efficiently in a collision-free and traffic-adaptive manner. Thus, our algorithm provides a guaranteed throughput and achieves a much better average throughput. The analytical and simulation results show that our proposed algorithm outperforms other existing topology-transparent broadcast algorithms dramatically. [ABSTRACT FROM AUTHOR]

Methods to undo the effects of motion blur are the subject of intense research, but evaluating and tuning these algorithms has traditionally required either user input or the availability of ground-truth images. We instead develop a metric for automatically predicting the perceptual quality of images produced by state-of-the-art deblurring algorithms. The metric is learned based on a massive user study, incorporates features that capture common deblurring artifacts, and does not require access to the original images (i.e., is "noreference"). We show that it better matches user-supplied rankings than previous approaches to measuring quality, and that in most cases it outperforms conventional full-reference image-similarity measures. We demonstrate applications of this metric to automatic selection of optimal algorithms and parameters, and to generation of fused images that combine multiple deblurring results. [ABSTRACT FROM AUTHOR]

Agricultural greenhouse (AG), one of the fastest-growing technology-based approaches worldwide in terms of controlling the environmental conditions of crops, plays an essential role in food production, resource conservation and the rural economy, but has also caused environmental and socio-economic problems due to policy promotion and market demand. Therefore, long-term monitoring of AG is of utmost importance for the sustainable management of protected agriculture, and previous efforts have verified the effectiveness of remote sensing-based techniques for mono-temporal AG mapping in a relatively small area. However, currently, a continuous annual AG remote sensing-based dataset at large-scale is generally unavailable. In this study, an annual AG mapping method oriented to the provincial area and long-term period was developed to produce the first Landsat-derived annual AG dataset in Shandong province, China from 1989 to 2018 on the Google Earth Engine (GEE) platform. The mapping window for each year was selected based on the vegetation growth and the phenological information, which was critical in distinguishing AG from other misclassified categories. Classification for each year was carried out initially based on the random forest classifier after the feature optimization. A temporal consistency correction algorithm based on classification probability was then proposed to the classified AG maps for further improvement. Finally, the average User's Accuracy, Producer's Accuracy and F1-score of AG based on visually-interpreted samples over 30 years reached 96.56%, 86.64% and 0.911, respectively. Furthermore, we also found that the ranked features via calculating the importance of each tested feature resulted in the highest accuracy and the strongest stability in the initial classification stage, and the proposed temporal consistency correction algorithm improved the final products by approximately five percent on average. In general, the resultant AG sequence dataset from our study has revealed the expansion of this typical object of "Human–Nature" interaction in agriculture and has a potential application in use of greenhouse-related technology and the scientific planning of protected agriculture. [ABSTRACT FROM AUTHOR]

To offset the effects of the transmission delay of air-fuel ratio (AFR) signal on the accuracy of AFR control, an AFR control strategy based on generalized predictive control (GPC) is devised. A model for GPC algorithm is built with Matlab/Simulink and implemented on dSPACE-MicroAutoBox plateform to concudt a test on NQ150N CNG engine. The results show that compared with PID control algorithm, the GPC-based algorithm has better steady-state performance, enabling better control effects of AFR under transient conditions. [ABSTRACT FROM AUTHOR]

Abstract: Numerical simulation of heterojunction solar cells is a useful approach to investigate the inner physics of the devices, and can be implemented by simulation tools today. An intra-band tunneling model has been described previously and applied to some heterojunction devices. However, the commonly used algorithm for solving the associated equations, the Gummel method, fails in the case of high recombination rates such as in amorphous Si solar cells. In this work, we present an improved algorithm that enhances convermicmgence when solving for intra-band tunneling in heterojunction solar cells with high defect state densities. The algorithm uses a sequential application of the Gummel and Newton methods tailored for optimal stability and convergence. As an example, simulation results for a heterojunction with intrinsic thin layer solar cell are discussed. The improved algorithm and related simulations in this work are implemented through a program we have developed, wxAMPS. [Copyright &y& Elsevier]

Abstract: The wxAMPS program is an update of the popular solar cell simulation tool AMPS (Analysis of Microelectronic and Photonic Structures). The user interface of wxAMPS uses a cross-platform library and provides quick data entry and improved visualization. Beyond the original AMPS kernel, wxAMPS incorporates two tunneling models and a new algorithm combining the Newton and Gummel methods. The incorporation of a trap-assisted tunneling model makes more precise simulation of multi-junction solar cells possible. The combined Newton and Gummel method solutions improve stability of the code and permit both tunneling models to function well within the algorithm. Based on the option for an unlimited number of layers in the simulation, modeling graded solar cells can be implemented easily in wxAMPS. [Copyright &y& Elsevier]

Social influence analysis is a very popular research direction. This article analyzes the social network of musicians and the many influencing factors when musicians create music to rank the influence of musicians. In order to achieve the practical purpose of the model making accurate predictions in the broad music market, the algorithm adopts a macromodel and considers the social network topology network. The article adds the time decay function and the weight of genre influence to the traditional PageRank algorithm, and thus, the MRGT (Musician Ranking based on Genre and Time) algorithm appears. Considering the timeliness of social networks and the continuous development of music, we realized the importance of evolving MRGT into a dynamic social network. Therefore, we adopted audio data analysis technology and used Gaussian distance to classify and study the evolution of music properties at different times and different genres and finally formed the dynamic influence ranking algorithm based on musicians' social and personal information networks. As a macromodel heuristic algorithm, our model is explanatory, can handle batch data and can avoid unfavorable factors, so as to provide fast speed and improved accuracy. The network can obtain an era indicator DMI (Dynamic Music Influence) that measures the degree of music revolution. DMI is the indicator we provide for music companies to invest in musicians. [ABSTRACT FROM AUTHOR]