The reconfigurability of fluid antenna systems (FASs) and reconfigurable intelligent surfaces (RISs) provides significant flexibility in optimizing channel conditions by jointly adjusting the positions of fluid antennas and the phase shifts of RISs. However, it is challenging to acquire the instantaneous channel state information (CSI) for both fluid antennas and RISs, while frequent adjustment of antenna positions and phase shifts will significantly increase the system complexity. To tackle this issue, this paper investigates the two-timescale design for FAS-RIS multi-user systems with linear precoding, where only the linear precoder design requires instantaneous CSI of the end-to-end channel, while the FAS and RIS optimization relies on statistical CSI. The main challenge comes from the complex structure of channel and inverse operations in linear precoding, such as regularized zero-forcing (RZF) and zero-forcing (ZF). Leveraging on random matrix theory (RMT), we first investigate the fundamental limits of FAS-RIS systems with RZF/ZF precoding by deriving the ergodic sum rate (ESR). This result is utilized to determine the minimum number of selected antennas to achieve a given ESR. Based on the evaluation result, we propose an algorithm to jointly optimize the antenna selection, regularization factor of RZF, and phase shifts at the RIS. Numerical results validate the accuracy of performance evaluation and demonstrate that the performance gain brought by joint FAS and RIS design is more pronounced with a larger number of users.

Pinching-antenna systems (PASS) have been recently proposed to improve the performance of wireless networks by reconfiguring both the large-scale and small-scale channel conditions. However, existing studies ignore the physical constraints of antenna placement and assume fixed antenna radiation power. To overcome this limitation, this paper investigates the design of PASS, taking into account the motion power consumption of pinching antennas (PAs) and the impact of adjustable antenna radiation power. To that end, we minimize the average power consumption for a given quality-of-service (QoS) requirement by jointly optimizing the antenna positions, antenna radiation power ratios, and transmit beamforming. To the best of the authors’ knowledge, this is the first work to consider radiation power optimization in PASS, which provides an additional degree of freedom (DoF) for system design. The cases with both continuous and discrete antenna placement are considered, where the main challenge lies in the fact that the antenna positions affect both the magnitude and phase of the channel coefficients of PASS, making system optimization very challenging. To tackle the resulting unique obstacles, an alternating direction method of multipliers (ADMM)-based framework is proposed to solve the problem for continuous antenna movement, while its discrete counterpart is formulated as a mixed integer nonlinear programming (MINLP) problem and solved by the block coordinate descent (BCD) method. Simulation results validate the performance enhancement achieved by incorporating PA movement power consumption and adjustable radiation power into the PASS design, while also demonstrating the efficiency of the proposed optimization framework. The benefits of PASS over conventional multiple-input multiple-output (MIMO) systems in mitigating the large-scale path loss and inter-user interference are also revealed.

Resource allocation is paramount to improve spectral efficiency in spectrum-sharing networks. However, numerous existing resource allocation schemes, especially those based on deep reinforcement learning techniques, overlook the impact of time-variant channel quality caused by high dynamics of wireless environment and heterogeneous action space due to discrete actions and continuous parameters, which may significantly degrade the desired system performance. To tackle these issues, in this paper, two intelligent resource allocation schemes that can jointly optimize channel allocation and transmit power in a dynamic spectrum-sharing network are proposed. In particular, an intelligent framework, enhanced by channel prediction, is first proposed to capitalize fully on the latent evolutionary characteristics of time-varying channels, facilitating efficient resource allocation design. Subsequently, a hybrid action representation-based intelligent framework is proposed to learn the latent dependence between channel allocation and transmit power for each secondary user. Simulation results demonstrate that our proposed schemes achieve superior performance compared with several benchmark schemes, highlighting that the sum rate can be improved by exploiting latent channel characteristics and latent hybrid actions dependence.

The reconfigurability of fluid antenna systems (FASs) and reconfigurable intelligent surfaces (RISs) can be jointly utilized to achieve unprecedented degrees of freedom for wireless communication systems. However, adjusting fluid antennas and RISs based on instantaneous channel state information (CSI) is highly challenging. To tackle this challenge, we propose a two-timescale approach for FAS-RIS-aided multi-user systems with regularized zero-forcing (RZF)/zero-forcing (ZF) precoding, where only statistical CSI is required for FAS and RIS optimization. To achieve this goal, we first obtain the closed-form evaluation for the ergodic sum rate (ESR) of FAS-RIS aided multi-user systems with RZF/ZF precoding by exploiting random matrix theory (RMT). Then, we propose an ESR maximization algorithm by jointly optimizing the port selection for FASs, phase shifts at the RIS, and regularization factor of RZF. Numerical results validate the approximation accuracy of the derived ESR evaluation and demonstrate that the performance enhancement benefiting from the joint design of FASs and RISs becomes more prominent when the number of users becomes larger.

The spiked covariance model, characterized by a population covariance matrix perturbed by a low-rank matrix, plays a crucial role in data analysis. In this context, the low-rank deformation typically signifies the underlying signal composition, while the extreme eigenvalues and eigenvectors of the sample covariance matrix contain valuable information about the signal. While the spiked covariance model has been extensively studied, its behavior under dimension reduction techniques, such as random projection, remains largely unexplored. These dimension reduction methods are commonly employed to manage the computational complexity associated with high-dimensional data. In this work, we study the behavior of the extreme eigenvalues and eigenvectors of the spiked covariance model with random projection. Specifically, we identify the exact critical threshold for the empirical eigenvalues to be out of the main bulk of the spectrum. Additionally, we determine the asymptotic positions of the isolated eigenvalues, as well as the projections of the isolated eigenvectors. It is quantitatively shown that the signal strength decreases under projection, and the isolated eigenvectors carry the information of the projected signal. Based on the above results, we propose a linear detection method for strong signals and analyze its performance limits. Simulation results validate the accuracy of the theoretical analysis.

Movable antennas (MAs) represent a promising paradigm to enhance the spatial degrees of freedom of conventional multi-antenna systems by dynamically adapting the positions of antenna elements within a designated transmit area. In particular, by employing electro-mechanical MA drivers such as stepper motors, the positions of the MA elements can be discretely adjusted to shape a favorable spatial correlation for improving system performance. Although preliminary research has explored beamforming designs for MA-enabled systems, the intricacies of the power consumption and the precise positioning of MA elements are not well understood, yet. Moreover, the assumption of perfect channel state information (CSI) adopted in the current literature is generally impractical due to the significant pilot overhead and the extensive time required for acquiring close-to-perfect CSI. To address these challenges, in this paper, we model the motion of MA elements through discrete steps and quantify the associated power consumption as a function of these movements. Furthermore, by leveraging the properties of the MA channel model, we introduce a novel CSI error model tailored for MA-enabled systems that facilitates robust resource allocation design. In particular, we jointly optimize the beamforming and the MA positions at the base station (BS) for minimization of the total BS power consumption, encompassing both radiated power and MA motion power, while guaranteeing a minimum required signal-to-interference-plus-noise ratio for each user. To this end, novel algorithms exploiting the branch and bound (BnB) method are developed to obtain the globally optimal solution for perfect and imperfect CSI, respectively. Moreover, to support practical real-time implementation, we propose low-complexity suboptimal algorithms with guaranteed convergence by leveraging successive convex approximation (SCA). Our numerical results validate the global optimality of the proposed BnB-based algorithms for both CSI scenarios. Furthermore, we unveil that both proposed SCA-based algorithms approach the optimal performance of the BnB-based algorithms within only a few iterations, thus highlighting their practical advantages. Additionally, we show that compared to the state-of-the-art approach, the proposed low-complexity SCA-based schemes achieve considerable performance gains, especially in high-load systems with a small number of antenna elements.

Reconfigurable intelligent surfaces (RISs) have been shown effective in strengthening the physical layer security of wireless systems, and the two-timescale design was proposed to tackle the challenges in channel estimation and phase-shift control. However, existing maximum ratio transmission (MRT) based precoding design is not efficient in mitigating information leakage. To this end, this paper considers the performance analysis and two-timescale design for RIS-aided multiple-input single-output (MISO) secure communications with regularized zero-forcing (RZF) and zero-forcing (ZF) precoding, which is not available in the literature. The major challenges come from the two-hop channel and the inverse structure in the precoding matrix. By utilizing random matrix theory, we first evaluate the fundamental limits of the considered system by deriving a closed-form expression for the ergodic secrecy sum rate (ESSR). Then, we determine the optimal regularization factor of the RZF precoder and evaluate the ESSR over independent and identically distributed (i.i.d.) channels in the high SNR regime. The results indicate that when the number of reconfigurable elements at the RIS is overwhelmingly larger than that of transmit antennas and users, the ESSR of the two-hop channel approaches that of the single-hop channel. Based on the performance analysis, we propose a two-timescale algorithm to maximize the ESSR by optimizing the regularization factor of RZF and the phase shifts of the RIS alternatively. Simulation results validate the accuracy of the theoretical analysis and the effectiveness of the proposed algorithm.

Multi-antenna relays and intelligent reflecting surfaces (IRSs) have been utilized to construct favorable channels to improve the performance of wireless systems. A common feature between relay systems and IRS-aided systems is the two-hop multiple-input multiple-output (MIMO) channel. As a result, the mutual information (MI) of two-hop MIMO channels has been widely investigated with very engaging results. However, a rigorous investigation on the fundamental limits of two-hop MIMO channels, i.e., the first and second-order analysis, is not yet available in the literature, due to the difficulties caused by the two-hop (product) channel and the noise introduced by the relay (active IRS). In this paper, we employ large random matrix theory, specifically Gaussian tools, to derive the closed-form deterministic approximation for the mean and variance of the MI. Additionally, we determine the convergence rate for the mean, variance and the characteristic function of the MI, and prove the asymptotic Gaussianity. Furthermore, we also investigate the analytical properties of the fundamental equations that describe the closed-form approximation and prove the existence and uniqueness of the solution. An iterative algorithm is then proposed to obtain the solutions for the fundamental equations. Numerical results validate the accuracy of the theoretical analysis.

Intelligent reflecting surfaces (IRSs) are a promising low-cost solution for achieving high spectral and energy efficiency in future communication systems by enabling the customization of wireless propagation environments. Despite the plethora of research on resource allocation design for IRS-assisted multiuser wireless communication systems, the optimal design and the corresponding performance upper bound are still not fully understood. To bridge this gap in knowledge, in this paper, we investigate the optimal resource allocation design for IRS-assisted multiuser multiple-input single-output (MISO) systems employing practical discrete IRS phase shifters. In particular, we jointly optimize the beamforming vector at the base station (BS) and the discrete IRS phase shifts to minimize the total transmit power for the cases of perfect and imperfect channel state information (CSI) knowledge. To this end, two novel algorithms based on the generalized Benders decomposition (GBD) method are developed to obtain the globally optimal solution for perfect and imperfect CSI, respectively. Moreover, to facilitate practical implementation, we propose two corresponding low-complexity suboptimal algorithms with guaranteed convergence by capitalizing on successive convex approximation (SCA). In particular, for imperfect CSI, we adopt a bounded error model to characterize the CSI uncertainty and propose a new transformation to convexify the robust quality-of-service (QoS) constraints. Our numerical results confirm the optimality of the proposed GBD-based algorithms for the considered system for both perfect and imperfect CSI. Furthermore, we unveil that both proposed SCA-based algorithms can attain a locally optimal solution within a few iterations. Moreover, compared with the state-of-the-art solution based on alternating optimization (AO), the proposed low-complexity SCA-based schemes achieve a significant performance gain, especially for moderate-to-large numbers of IRS elements.

Simultaneous wireless information and power transfer (SWIPT) has been proposed to offer communication services and transfer power to the energy harvesting receiver (EHR) concurrently. However, existing works mainly focused on static EHRs, without considering the location uncertainty caused by the movement of EHRs and location estimation errors. To tackle this issue, this paper considers the sensing-assisted SWIPT design in a networked integrated sensing and communication (ISAC) system in the presence of location uncertainty. A two-phase robust design is proposed to reduce the location uncertainty and improve the power transfer efficiency. In particular, each time frame is divided into two phases, i.e., sensing and WPT phases, via time-splitting. The sensing phase performs collaborative sensing to localize the EHR, whose results are then utilized in the WPT phase for efficient WPT. To minimize the power consumption with given communication and power transfer requirements, a two-layer optimization framework is proposed to jointly optimize the time-splitting ratio, coordinated beamforming policy, and sensing node selection. Simulation results validate the effectiveness of the proposed design and demonstrate the existence of an optimal time-splitting ratio for given location uncertainty.

The additional degree of freedom (DoF) in the distance domain of near-field communication offers new opportunities for physical layer security (PLS) design. However, existing works mainly consider static eavesdroppers, and the related study with mobile eavesdroppers is still in its infancy due to the difficulty in obtaining the channel state information (CSI) of the eavesdropper. To this end, we propose to leverage the sensing capability of integrated sensing and communication (ISAC) systems to assist PLS design. To comprehensively study the dynamic behaviors of the system, we propose a Pareto optimization framework, where a multi-objective optimization problem (MOOP) is formulated to simultaneously optimize three key performance metrics: power consumption, number of securely served users, and tracking performance, while guaranteeing the achievable rate of the users with a given leakage rate constraint. A globally optimal design based on the generalized Bender’s decomposition (GBD) method is proposed to achieve the Pareto optimal solutions. To reduce the computational complexity, we further design a low-complexity algorithm based on zero-forcing (ZF) beamforming and successive convex approximation (SCA). Simulation results validate the effectiveness of the proposed algorithms and reveal the intrinsic trade-offs between the three performance metrics. It is observed that near-field communication offers a favorable beam diffraction effect for PLS, where the energy of the information signal is nulled around the eavesdropper and focused on the users.

Sentence segmentation is a linguistic task and is widely used as a pre-processing step in many NLP applications.The need for sentence segmentation is particularly pronounced in clinical notes, where ungrammatical and fragmented texts are common.We propose a straightforward and effective sequence labeling classifier to predict sentence spans using a dynamic sliding window based on the prediction of each input sequence.This sliding window algorithm allows our approach to segment long text sequences on the fly.To evaluate our approach, we annotated 90 clinical notes from the MIMIC-III dataset.Additionally, we tested our approach on five other datasets to assess its generalizability and compared its performance against state-of-the-art systems on these datasets.Our approach outperformed all the systems, achieving an F1 score that is 15% higher than the next best-performing system on the clinical dataset.

The multiple-input and multiple-output (MIMO) technique is considered as a promising approach for improving the throughput and reliability of optical fiber communications. However, the finite blocklength (FBL) analysis of optical fiber MIMO systems is not available in the literature. Considering the Jacobi MIMO channel, which was proposed to model the nearly lossless propagation and the crosstalks in optical fiber channels, this paper studies the optimal average error probability (OAEP) of optical fiber multicore/multimode systems in the FBL regime. In particular, we consider the case where the coding rate is in the ${\mathcal{O}}\left({\frac{1}{{\sqrt {LM} }}}\right)$ proximity of the capacity, with M and L denoting the number of transmit channels and blocklength, respectively. To this end, a central limit theorem (CLT) for the information density is first established in the asymptotic regime where the blocklength and the number of transmit, receive, and available channels approach infinity with fixed ratios. With the aid of the CLT, the closed-form upper and lower bounds for the OAEP with the concerned rate are then derived. It is shown that the derived bounds could degenerate to those for Rayleigh MIMO channels if the number of available channels goes to infinity. Numerical simulations indicate that the derived bounds are closer to the performance of low-density parity check (LDPC) coding schemes than outage probability, thus providing a better characterization with the concerned the rate.

Intelligent reflecting surfaces (IRSs) have emerged as a promising technology to improve the efficiency of wireless communication systems. However, passive IRSs suffer from the “multiplicative fading” effect, where the transmit signal will go through two fading hops. With the ability to amplify and reflect signals, active IRSs offer a potential way to tackle this issue, where the amplification energy only experiences the second hop. However, the fundamental limit and system design for active IRSs have not been fully understood, especially for multiple-input multiple-output (MIMO) systems. In this paper, we consider the analysis and design for the large-scale active IRS-aided MIMO system assuming only statistical channel state information (CSI) at the transmitter and the IRS. The characterization of the fundamental limit, i.e., ergodic rate, turns out to be a very difficult problem. To this end, we leverage random matrix theory (RMT) to derive the deterministic approximation (DA) for the ergodic rate, and then design an algorithm to jointly optimize the transmit covariance matrix at the transmitter and the reflection matrix at the active IRS. Numerical results demonstrate the accuracy of the derived DA and the effectiveness of the proposed optimization algorithm. Interesting physical insights regarding the advantage of active IRSs over their passive counterparts and the optimal power allocation between the transmitter and IRS are unveiled.

OBJECTIVE: The aim of the Social Media Mining for Health Applications (#SMM4H) shared tasks is to take a community-driven approach to address the natural language processing and machine learning challenges inherent to utilizing social media data for health informatics. In this paper, we present the annotated corpora, a technical summary of participants' systems, and the performance results. METHODS: The eighth iteration of the #SMM4H shared tasks was hosted at the AMIA 2023 Annual Symposium and consisted of 5 tasks that represented various social media platforms (Twitter and Reddit), languages (English and Spanish), methods (binary classification, multi-class classification, extraction, and normalization), and topics (COVID-19, therapies, social anxiety disorder, and adverse drug events). RESULTS: In total, 29 teams registered, representing 17 countries. In general, the top-performing systems used deep neural network architectures based on pre-trained transformer models. In particular, the top-performing systems for the classification tasks were based on single models that were pre-trained on social media corpora. CONCLUSION: To facilitate future work, the datasets-a total of 61 353 posts-will remain available by request, and the CodaLab sites will remain active for a post-evaluation phase.

Wireless information and energy transfer (WIET) represents an emerging paradigm that employs controllable transmission of radio frequency signals for the dual purpose of data communication and wireless charging. As such, WIET is widely regarded as an enabler of envisioned sixth-generation (6G) use cases that rely on energy-sustainable Internet-of-Things (IoT) networks, such as smart cities and smart grids. Meeting the quality-of-service demands of WIET, in terms of both data transfer and power delivery, requires effective codesign of the information and energy signals. In this article, we present the main principles and design aspects of WIET, focusing on its integration in 6G networks. First, we discuss how conventional communication notions, such as resource allocation and waveform design, need to be revisited in the context of WIET. Next, we consider various candidate 6G technologies that can boost WIET efficiency, namely, holographic multiple-input multiple-output, near-field beamforming, terahertz communication, intelligent reflecting surfaces (IRSs), and reconfigurable (fluid) antenna arrays. We introduce respective WIET design methods, analyze the promising performance gains of these WIET systems, and discuss challenges, open issues, and future research directions. Finally, a near-field energy beamforming scheme and a power-based IRS beamforming algorithm are experimentally validated using a wireless energy transfer testbed. The vision of WIET in communication systems has been gaining momentum in recent years, with constant progress with respect to theoretical and also practical aspects. The comprehensive overview of the state of the art of WIET presented in this article highlights the potential of WIET systems and their overall benefits in 6G networks.

Multiple access is the cornerstone technology for each generation of wireless cellular networks, which fundamentally determines the method of radio resource sharing and significantly influences both the system performance and transceiver complexity. Meanwhile, resource allocation (RA) design plays a crucial role in multiple access, as it can manage both encompassing radio resources and interference, and it is critical for providing high-speed and reliable communication services to multiple users. Given that the RA design is intrinsically scenario-specific and the optimization tools for RA design are typically varied, in this article, we present a comprehensive tutorial overview for junior researchers in this field, aiming to offer a foundational guide for RA design in the context of next-generation multiple access (NGMA). Our discussion spans a broad range of fundamental topics: from typical system models, through intriguing problem formulation in RA design, to the exploration of various potential optimization solution methodologies. Initially, we identify three types of channels in future wireless cellular networks over which NGMA will be implemented, namely, natural channels, reconfigurable channels, and functional channels. Natural channels are traditional uplink and downlink communication channels; reconfigurable channels are defined as channels that can be proactively reshaped via emerging platforms or techniques, such as intelligent reflecting surface (IRS), unmanned aerial vehicle (UAV), and movable/fluid antenna (M/FA); and functional channels support not only communication but also other functionalities simultaneously, with typical examples, including integrated sensing and communication (ISAC) and joint computing and communication (JCAC) channels. Then, we introduce NGMA models applicable to these three types of channels that cover most of the practical communication scenarios of future wireless communications. Subsequently, we articulate the key optimization technical challenges inherent in the RA design for NGMA, categorizing them into rate-, power-, and reliability-oriented RA designs. The corresponding optimization approaches for solving the formulated RA design problems are then presented. Finally, the simulation results are presented and discussed to elucidate the practical implications and insights derived from RA designs in NGMA.

In this paper, we investigate the joint resource allocation and trajectory design for a multi-user, multi-target unmanned aerial vehicle (UAV)-enabled integrated sensing and communication (ISAC) system, where the link capacity between a ground base station (BS) and the UAV is limited. The UAV conducts target sensing and information transmission in orthogonal time slots to prevent interference. As is common in practical systems, sensing is performed while the UAV hovers, allowing the UAV to acquire high-quality sensing data. Subsequently, the acquired sensing data is offloaded to the ground BS for further processing. We jointly optimize the UAV trajectory, UAV velocity, beamforming for the communication users, power allocated to the sensing beam, and time of hovering for sensing to minimize the power consumption of the UAV while ensuring the communication quality of service (QoS) and successful sensing. Due to the prohibitively high complexity of the resulting non-convex mixed integer non-linear program (MINLP), we employ a series of transformations and optimization techniques, including semidefinite relaxation, big-M method, penalty approach, and successive convex approximation, to obtain a low-complexity suboptimal solution. Our simulation results reveal that 1) the proposed design achieves significant power savings compared to two baseline schemes; 2) stricter sensing requirements lead to longer sensing times, highlighting the challenge of efficiently managing both sensing accuracy and sensing time; 3) the optimized trajectory design ensures precise hovering directly above the targets during sensing, enhancing sensing quality and enabling the application of energy-focused beams; and 4) the proposed trajectory design balances the capacity of the backhaul link and the downlink rate of the communication users.

Active reconfigurable intelligent surfaces (RISs) have recently been proposed to compensate for the severe multiplicative fading effect of conventional passive RIS-aided systems. Each reflecting element of active RISs is assisted by an amplifier such that the incident signal can be reflected and amplified instead of only being reflected as in passive RIS-aided systems. This work addresses the practical challenge that, on the one hand, in active RIS-aided systems the perfect individual channel state information (CSI) of the RIS-aided channels cannot be acquired due to the lack of signal processing power at the active RISs, but, on the other hand, this CSI is required to calculate the expected system data rate and RIS transmit power needed for transceiver design. To address this issue, we first derive closed-form expressions for the average achievable rate and the average RIS transmit power based on partial CSI of the RIS-aided channels. Then, we formulate an average achievable rate maximization problem for jointly optimizing the active beamforming at both the base station (BS) and the RIS. This problem is then tackled using the majorization–minimization (MM) algorithm framework, and, in each iteration low-complexity solutions for the BS and RIS beamforming are found based on the Karush-Kuhn-Tucker (KKT) conditions. To ensure the quality of service (QoS) of each user, we further formulate a rate outage constrained beamforming problem, which is solved using the Bernstein-Type inequality (BTI) and semidefinite relaxation (SDR) techniques. Numerical results show that the proposed algorithms can efficiently overcome the challenges imposed by imperfect CSI in active RIS-aided wireless systems.

In this paper, we investigate joint resource allocation and trajectory design for multi-user multi-target unmanned aerial vehicle (UAV)-enabled integrated sensing and communication (ISAC). To be compatible with practical UAV-based sensing systems, sensing is carried out while the UAV hovers. In particular, we jointly optimize the two-dimensional trajectory, the velocity, and the downlink information and sensing beamformers of a fixed-altitude UAV for minimization of the average power consumption, while ensuring the quality of service of the communication users and the sensing tasks. To tackle the resulting non-convex mixed integer non-linear program (MINLP), we exploit semidefinite relaxation, the big-M method, and successive convex approximation to develop an alternating optimization-based algorithm. Our simulation results demonstrate the significant power savings enabled by the proposed scheme compared to two baseline schemes employing heuristic trajectories.

Movable antennas (MAs) are a promising paradigm to enhance the spatial degrees of freedom of conventional multi-antenna systems by flexibly adapting the positions of the antenna elements within a given transmit area. In this paper, we model the motion of the MA elements as discrete movements and study the corresponding resource allocation problem for MA-enabled multiuser multiple-input single-output (MISO) communication systems. Specifically, we jointly optimize the beamforming and the MA positions at the base station (BS) for the minimization of the total transmit power while guaranteeing the minimum required signal-to-interference-plus-noise ratio (SINR) of each individual user. To obtain the globally optimal solution to the formulated resource allocation problem, we develop an iterative algorithm capitalizing on the generalized Bender's decomposition with guaranteed convergence. Our numerical results demonstrate that the proposed MA-enabled communication system can significantly reduce the BS transmit power and the number of antenna elements needed to achieve a desired performance compared to state-of-the-art techniques, such as antenna selection. Furthermore, we observe that refining the step size of the MA motion driver improves performance at the expense of a higher computational complexity.

Different from conventional radar, the cellular network structure integrated sensing and communication (ISAC) systems enables collaborative sensing by multiple sensing nodes, e.g., base stations (BSs). However, existing works normally assume designated BSs as the sensing nodes, and thus can't fully exploit the macro-diversity gain. In the paper, we propose a joint BS selection, user association, and beamforming design to tackle this problem. In particular, we minimize the total transmit power by the above-mentioned joint design, while guaranteeing the communication and sensing performance measured by the signal-to-interference-plus-noise ratio (SINR) for the communication users and the Cramer-Rae lower bound (CRLB) for location estimation, respectively. An alternating optimization (AO)-based algorithm is developed to solve the non-convex problem. Simulation results validate the effectiveness of the proposed algorithm and unveil the benefits brought by collaborative sensing and BS selection.

The integration of sensing and communication enables wireless communication systems to serve environment-aware applications. In this paper, we propose to leverage sensing to enhance physical layer security (PLS) in multiuser communication systems in the presence of a suspicious target. To this end, we develop a two-phase framework to first estimate the location of the potential eavesdropper by sensing and then utilize the estimated information to enhance PLS for communication. In particular, in the first phase, a dual-functional radar and communication (DFRC) base station (BS) exploits a sensing signal to mitigate the sensing information uncertainty of the potential eavesdropper. Then, in the second phase, to facilitate joint sensing and secure communication, the DFRC BS employs beamforming and artificial noise to enhance secure communication. The design objective is to maximize the system sum rate while alleviating the information leakage by jointly optimizing the time allocation and beamforming policy. Capitalizing on monotonic optimization theory, we develop a two-layer globally optimal algorithm to reveal the performance upper bound of the considered system. Simulation results show that the proposed scheme achieves a significant sum rate gain over two baseline schemes that adopt existing techniques. Moreover, our results unveil that ISAC is a promising paradigm for enhancing secure communication in wireless networks.

Automatically summarizing patients’ main problems from daily progress notes using natural language processing methods helps to battle against information and cognitive overload in hospital settings and potentially assists providers with computerized diagnostic decision support. Problem list summarization requires a model to understand, abstract, and generate clinical documentation. In this work, we propose a new NLP task that aims to generate a list of problems in a patient’s daily care plan using input from the provider’s progress notes during hospitalization. We investigate the performance of T5 and BART, two state-of-the-art seq2seq transformer architectures, in solving this problem. We provide a corpus built on top of progress notes from publicly available electronic health record progress notes in the Medical Information Mart for Intensive Care (MIMIC)-III. T5 and BART are trained on general domain text, and we experiment with a data augmentation method and a domain adaptation pre-training method to increase exposure to medical vocabulary and knowledge. Evaluation methods include ROUGE, BERTScore, cosine similarity on sentence embedding, and F-score on medical concepts. Results show that T5 with domain adaptive pre-training achieves significant performance gains compared to a rule-based system and general domain pre-trained language models, indicating a promising direction for tackling the problem summarization task.

OBJECTIVE: To provide a scoping review of papers on clinical natural language processing (NLP) shared tasks that use publicly available electronic health record data from a cohort of patients. MATERIALS AND METHODS: We searched 6 databases, including biomedical research and computer science literature databases. A round of title/abstract screening and full-text screening were conducted by 2 reviewers. Our method followed the PRISMA-ScR guidelines. RESULTS: A total of 35 papers with 48 clinical NLP tasks met inclusion criteria between 2007 and 2021. We categorized the tasks by the type of NLP problems, including named entity recognition, summarization, and other NLP tasks. Some tasks were introduced as potential clinical decision support applications, such as substance abuse detection, and phenotyping. We summarized the tasks by publication venue and dataset type. DISCUSSION: The breadth of clinical NLP tasks continues to grow as the field of NLP evolves with advancements in language systems. However, gaps exist with divergent interests between the general domain NLP community and the clinical informatics community for task motivation and design, and in generalizability of the data sources. We also identified issues in data preparation. CONCLUSION: The existing clinical NLP tasks cover a wide range of topics and the field is expected to grow and attract more attention from both general domain NLP and clinical informatics community. We encourage future work to incorporate multidisciplinary collaboration, reporting transparency, and standardization in data preparation. We provide a listing of all the shared task papers and datasets from this review in a GitLab repository.

In this paper, we study the optimal resource allocation algorithm design for large intelligent reflecting surface (IRS)-assisted simultaneous wireless information and power transfer (SWIPT) systems. To facilitate efficient system design for large IRSs, instead of jointly optimizing all the IRS elements, we partition the IRS into several tiles and employ a scalable optimization framework comprising an offline design stage and an online optimization stage. In the offline stage, the IRS elements of each tile are jointly designed to support a set of different phase shift configurations, referred to as transmission modes, while the best transmission mode is selected from the set for each tile in the online stage. Given a transmission mode set, we aim to minimize the total base station (BS) transmit power by jointly optimizing the beamforming and the transmission mode selection policy taking into account the quality-of-service requirements of information decoding and non-linear energy harvesting receivers, respectively. Although the resource allocation algorithm design is formulated as a non-convex combinatorial optimization problem, we solve it optimally by applying the branch-and-bound (BnB) approach which entails a high computational complexity. To strike a balance between optimality and computational complexity, we also develop an efficient suboptimal algorithm capitalizing on the penalty method and successive convex approximation. Our simulation results show that the proposed designs enable considerable power savings compared to several baseline schemes. Moreover, our results reveal that by properly adjusting the numbers of tiles and transmission modes, the proposed scalable optimization framework indeed facilitates online design for large IRSs. Besides, our results confirm that the advocated physics-based model and scalable optimization framework enable a flexible trade-off between performance and complexity, which is vital for realizing the performance gains promised by large IRS-assisted communication systems in practice.

In this paper, we investigate the robust resource allocation design for secure communication in an integrated sensing and communication (ISAC) system. A multi-antenna dual-functional radar-communication (DFRC) base station (BS) serves multiple single-antenna legitimate users and senses for targets simultaneously, where already identified targets are treated as potential single-antenna eavesdroppers. The DFRC BS scans a sector with a sequence of dedicated beams, and the ISAC system takes a snapshot of the environment during the transmission of each beam. Based on the sensing information, the DFRC BS can acquire the channel state information (CSI) of the potential eavesdroppers. Different from existing works that focused on the resource allocation design for a single snapshot, in this paper, we propose a novel optimization framework that jointly optimizes the communication and sensing resources over a sequence of snapshots with adjustable durations. Besides, artificial noise (AN) is exploited by the BS for joint sensing and physical layer security provisioning. To this end, we jointly optimize the duration of each snapshot, the beamforming vector, and the covariance matrix of the AN for maximization of the system sum secrecy rate over a sequence of snapshots while guaranteeing a minimum required average achievable rate and a maximum information leakage constraint for each legitimate user. The resource allocation algorithm design is formulated as a non-convex optimization problem, where we account for the imperfect CSI of both the legitimate users and the potential eavesdroppers. To make the problem tractable, we derive a bound for the uncertainty region of the potential eavesdroppers’ small-scale fading based on a safe approximation, which facilitates the development of a block coordinate descent-based iterative algorithm for obtaining an efficient suboptimal solution. Simulation results illustrate that the proposed scheme can significantly enhance the physical layer security of ISAC systems compared to three baseline schemes. Moreover, compared to the conventional multi-stage approach for ISAC system design, the proposed approach based on variable-length snapshots not only facilitates a highly-directional offline sensing beam design but also allows us to flexibly prioritize communication or sensing depending on the application scenario.

Non-orthogonal multiple access (NOMA) assisted mobile edge computing (MEC) has recently attracted significant attention due to its superior capability to reduce the energy consumption and the latency of MEC offloading. In this paper, a general hybrid NOMA-MEC offloading strategy is proposed, which includes conventional orthogonal multiple access (OMA) and pure NOMA based offloading as special cases. A multi-objective optimization problem is formulated to minimize the energy consumption for MEC offloading, and a low-complexity resource allocation solution is derived and shown to be Pareto-optimal. Furthermore, by analyzing the properties of the obtained resource allocation solution, important insights regarding NOMA-MEC offloading are obtained. For example, it is proved that pure NOMA-MEC offloading cannot outperform hybrid NOMA-MEC. In addition, a precise condition under which NOMA-MEC outperforms OMA-MEC is established, and shown to match the one previously developed for the two-user special case. Furthermore, the developed analytical results also establish an interesting analogy between the proposed hybrid NOMA-MEC power allocation scheme and the well-known water-filling strategy.

In this paper, we investigate resource allocation algorithm design for large intelligent reflecting surface (IRS)assisted simultaneous wireless information and power transfer (SWIPT) systems. To this end, we adopt a physics-based IRS model that, unlike the conventional IRS model, takes into account the impact of the incident and reflection angles of the impinging electromagnetic wave on the reflected signal. To facilitate efficient resource allocation design for large IRSs, we employ a scalable optimization framework, where the IRS is partitioned into several tiles and the phase shift elements of each tile are jointly designed to realize different transmission modes. Then, the beamforming vectors at the base station (BS) and the transmission mode selection of the tiles of the IRS are jointly optimized for minimization of the BS transmit power taking into account the quality-of-service requirements of both non-linear energy harvesting receivers and information decoding receivers. For handling the resulting non-convex optimization problem, we apply a penalty-based method, successive convex approximation, and semidefinite relaxation to develop a computationally efficient algorithm which asymptotically converges to a locally optimal solution of the considered problem. Our simulation results show that the proposed scheme enables considerable power savings compared to two baseline schemes. Moreover, our results also illustrate that the advocated physics-based model and scalable optimization framework for large IRSs allows us to strike a balance between system performance and computational complexity, which is vital for realizing large IRS-assisted communication systems.

Maximum dorsiflexion (MDF) is an important gait event corresponding to the maximum ankle dorsiflexion angle in each gait cycle. MDF timing plays an important role in the control of robotic prosthesis. This article puts forward an on-board adaptive algorithm to detect MDF timing of robotic transtibial prosthesis in different walking conditions (at different speeds and on different ramps) and for different users. Based on the adaptive algorithm, we can get a time-variant detection model. The framework of the adaptive algorithm is composed of: 1) training data collecting and labeling; 2) model training and real-time detection; and 3) model updating according to the detection results. Based on the adaptive algorithm, we conducted speed and ramp experiments to detect MDF timings at slow, normal, and fast speeds, and on ramps with different inclination angles (10°, 5°, 0°, -5°, and -10°). Three transtibial amputee participated in the experiments. The model training/updating time ranges from 3.6 to 4.1 s and the detection time ranges from 0.95 to 1.17 ms for different speeds and ramps. In real-time detection, there is false detection (1.67%) at normal walking speed. In addition, all MDF timings are detected correctly (accuracy: 100%) based on the adaptive algorithm. The mean detection delays are 7.23, 18.27, and 7.5 ms corresponding to slow, normal and fast speeds and 10.60, 10.30, 18.27, 10.27, and 15.63 ms for ramps of different inclination angles (10°, 5°, 0°, -5°, and -10°). Compared with the proposed adaptive algorithm, both the nonadaptive and adaptive threshold decision methods cause more false detections. The results show that the proposed approach for MDF timing detection has adaptations to different walking conditions (speeds and ramps) and prosthesis users, which indicates that the adaptive algorithm is effective and shows the potential in robotic prosthesis control in the future. Note to Practitioners-This article proposes an on-board adaptive algorithm to detect the maximum dorsiflexion (MDF) timing based on inertial measurement unit (IMU) and ankle angle sensor for robotic transtibial prosthesis users in each gait cycle. IMU and angle sensor are integrated in the prosthesis, and the adaptive algorithm is embedded in the control circuit of prosthesis. The adaptive algorithm can realize the model updating continuously for real-time MDF timing detection with collected and labeled training data. The proposed adaptive algorithm shows satisfactory adaptation for MDF timing detection in different walking speed and ramp conditions. In addition, the adaptive algorithm also shows some generalizations for prosthesis users, which are useful to improve prosthesis control.

In this paper, we investigate resource allocation for IRS-assisted green multiuser multiple-input single-output (MISO) systems. To minimize the total transmit power, both the beamforming vectors at the access point (AP) and the phase shifts at multiple IRSs are jointly optimized, while taking into account the minimum required quality-of-service (QoS) of multiple users. First, two novel algorithms, namely a penalty-based alternating minimization (AltMin) algorithm and an inner approximation (IA) algorithm, are developed to tackle the non-convexity of the formulated optimization problem when perfect channel state information (CSI) is available. Existing designs employ semidefinite relaxation in AltMin-based algorithms, which, however, cannot ensure convergence. In contrast, the proposed penalty-based AltMin and IA algorithms are guaranteed to converge to a stationary point and a Karush-Kuhn-Tucker (KKT) solution of the design problem, respectively. Second, the impact of imperfect knowledge of the CSI of the channels between the AP and the users is investigated. To this end, a non-convex robust optimization problem is formulated and the penalty-based AltMin algorithm is extended to obtain a stationary solution. Simulation results reveal a key trade-off between the speed of convergence and the achievable total transmit power for the two proposed algorithms. In addition, we show that the proposed algorithms can significantly reduce the total transmit power at the AP compared to various baseline schemes and that the optimal numbers of transmit antennas and IRS reflecting elements, which maximize the system energy efficiency of the considered system, are finite.

Concept normalization, the task of linking textual mentions of concepts to concepts in an ontology, is challenging because ontologies are large.In most cases, annotated datasets cover only a small sample of the concepts, yet concept normalizers are expected to predict all concepts in the ontology.In this paper, we propose an architecture consisting of a candidate generator and a list-wise ranker based on BERT.The ranker considers pairings of concept mentions and candidate concepts, allowing it to make predictions for any concept, not just those seen during training.We further enhance this list-wise approach with a semantic type regularizer that allows the model to incorporate semantic type information from the ontology during training.Our proposed concept normalization framework achieves stateof-the-art performance on multiple datasets.

Intelligent reflecting surfaces (IRSs) are regarded as key enablers of next-generation wireless communications, due to their capability of customizing the wireless propagation environment. In this paper, we investigate power-efficient resource allocation for IRS-assisted multiuser multiple-input single-output (MISO) systems. To minimize the transmit power, both the beamforming vectors at the access point (AP) and phase shifts at the IRS are jointly optimized while taking into account the minimum required quality-of-service (QoS) of the users. To tackle the non-convexity of the formulated optimization problem, an inner approximation (IA) algorithm is developed. Unlike existing designs, which cannot guarantee local optimality, the proposed algorithm is guaranteed to converge to a Karush-Kuhn-Tucker (KKT) solution. Our simulation results show the effectiveness of the proposed algorithm compared to baseline schemes and reveal that deploying IRSs is more promising than leveraging multiple antennas at the AP in terms of energy efficiency.

Prior work has demonstrated that question classification (QC), recognizing the problem domain of a question, can help answer it more accurately. However, developing strong QC algorithms has been hindered by the limited size and complexity of annotated data available. To address this, we present the largest challenge dataset for QC, containing 7,787 science exam questions paired with detailed classification labels from a fine-grained hierarchical taxonomy of 406 problem domains. We then show that a BERT-based model trained on this dataset achieves a large (+0.12 MAP) gain compared with previous methods, while also achieving state-of-the-art performance on benchmark open-domain and biomedical QC datasets. Finally, we show that using this model’s predictions of question topic significantly improves the accuracy of a question answering system by +1.7% P@1, with substantial future gains possible as QC performance improves.

OBJECTIVE: Concept normalization, the task of linking phrases in text to concepts in an ontology, is useful for many downstream tasks including relation extraction, information retrieval, etc. We present a generate-and-rank concept normalization system based on our participation in the 2019 National NLP Clinical Challenges Shared Task Track 3 Concept Normalization. MATERIALS AND METHODS: The shared task provided 13 609 concept mentions drawn from 100 discharge summaries. We first design a sieve-based system that uses Lucene indices over the training data, Unified Medical Language System (UMLS) preferred terms, and UMLS synonyms to generate a list of possible concepts for each mention. We then design a listwise classifier based on the BERT (Bidirectional Encoder Representations from Transformers) neural network to rank the candidate concepts, integrating UMLS semantic types through a regularizer. RESULTS: Our generate-and-rank system was third of 33 in the competition, outperforming the candidate generator alone (81.66% vs 79.44%) and the previous state of the art (76.35%). During postevaluation, the model's accuracy was increased to 83.56% via improvements to how training data are generated from UMLS and incorporation of our UMLS semantic type regularizer. DISCUSSION: Analysis of the model shows that prioritizing UMLS preferred terms yields better performance, that the UMLS semantic type regularizer results in qualitatively better concept predictions, and that the model performs well even on concepts not seen during training. CONCLUSIONS: Our generate-and-rank framework for UMLS concept normalization integrates key UMLS features like preferred terms and semantic types with a neural network-based ranking model to accurately link phrases in text to UMLS concepts.

In this paper, intelligent reflecting surfaces (IRSs) are employed to enhance the physical layer security in a challenging radio environment. In particular, a multi-antenna access point (AP) has to serve multiple single-antenna legitimate users, which do not have line-of-sight communication links, in the presence of multiple multi-antenna potential eavesdroppers whose channel state information (CSI) is not perfectly known. Artificial noise (AN) is transmitted from the AP to deliberately impair the eavesdropping channels for security provisioning. We investigate the joint design of the beamformers and AN covariance matrix at the AP and the phase shifters at the IRSs for maximization of the system sum-rate while limiting the maximum information leakage to the potential eavesdroppers. To this end, we formulate a robust non-convex optimization problem taking into account the impact of the imperfect CSI of the eavesdropping channels. To address the non-convexity of the optimization problem, an efficient algorithm is developed by capitalizing on alternating optimization, a penalty-based approach, successive convex approximation, and semidefinite relaxation. Simulation results show that IRSs can significantly improve the system secrecy performance compared to conventional architectures without IRS. Furthermore, our results unveil that, for physical layer security, uniformly distributing the reflecting elements among multiple IRSs is preferable over deploying them at a single IRS.

In this paper, we investigate robust resource allocation algorithm design for multiuser downlink multiple-input single-output (MISO) unmanned aerial vehicle (UAV) communication systems, where we account for the various uncertainties that are unavoidable in such systems and, if left unattended, may severely degrade system performance. We jointly optimize the two-dimensional (2-D) trajectory and the transmit beamforming vector of the UAV for minimization of the total power consumption. The algorithm design is formulated as a non-convex optimization problem taking into account the imperfect knowledge of the angle of departure (AoD) caused by UAV jittering, user location uncertainty, wind speed uncertainty, and polygonal no-fly zones (NFZs). Despite the non-convexity of the optimization problem, we solve it optimally by employing monotonic optimization theory and semidefinite programming relaxation which yields the optimal 2-D trajectory and beamforming policy. Since the developed optimal resource allocation algorithm entails a high computational complexity, we also propose a suboptimal iterative low-complexity scheme based on successive convex approximation to strike a balance between optimality and computational complexity. Our simulation results reveal not only the significant power savings enabled by the proposed algorithms compared to two baseline schemes, but also confirm their robustness with respect to UAV jittering, wind speed uncertainty, and user location uncertainty. Moreover, our results unveil that the joint presence of wind speed uncertainty and NFZs has a considerable impact on the UAV trajectory. Nevertheless, by counteracting the wind speed uncertainty with the proposed robust design, we can simultaneously minimize the total UAV power consumption and ensure a secure trajectory that does not trespass any NFZ.

In this article, we investigate the resource allocation design for intelligent reflecting surface (IRS)-assisted full-duplex (FD) cognitive radio systems. In particular, a secondary network employs an FD base station (BS) for serving multiple half-duplex downlink (DL) and uplink (UL) users simultaneously. An IRS is deployed to enhance the performance of the secondary network while helping to mitigate the interference caused to the primary users (PUs). The DL transmit beamforming vectors and the UL receive beamforming vectors at the FD BS, the transmit power of the UL users, and the phase shift matrix at the IRS are jointly optimized for maximization of the total spectral efficiency of the secondary system. The design task is formulated as a non-convex optimization problem taking into account the imperfect knowledge of the PUs' channel state information (CSI) and their maximum interference tolerance. Since the maximum interference tolerance constraint is intractable, we apply a safe approximation to transform it into a convex constraint. To efficiently handle the resulting approximated optimization problem, which is still non-convex, we develop an iterative block coordinate descent (BCD)-based algorithm. This algorithm exploits semidefinite relaxation, a penalty method, and successive convex approximation and is guaranteed to converge to a stationary point of the approximated optimization problem. Our simulation results do not only reveal that the proposed scheme yields a substantially higher system spectral efficiency for the secondary system than several baseline schemes, but also confirm its robustness against CSI uncertainty. Besides, our results illustrate the tremendous potential of IRS for managing the various types of interference arising in FD cognitive radio networks.

In this paper, we propose to utilize intelligent reflecting surfaces (IRSs) for enhancing the physical layer security of wireless communications systems. In particular, an IRS-assisted secure wireless system is considered, where a multi-antenna transmitter communicates with a single-antenna receiver in the presence of an eavesdropper. To maximize the secrecy rate, both the beamformer at the transmitter and the IRS phase shifts are jointly optimized. Based on the block coordinate descent (BCD) and minorization maximization (MM) techniques, two efficient algorithms are developed to solve the resulting non-convex optimization problem for small- and large-scale IRSs, respectively. Simulation results show that IRSs can significantly improve physical layer security if the proposed algorithms are employed. Furthermore, we reveal that deploying large-scale IRSs is more efficient than enlarging the antenna array size of the transmitter for both boosting the secrecy rate and enhancing the energy efficiency.

Locomotion mode recognition based on the off-line trained model brings difficulties in integration and application to wearable robots. In this paper, we put forward an on-board training based on back propagation (BP) neural network and developed the real-time locomotion mode recognition research in robotic transtibial prosthesis. Three transtibial amputees participated in the study to finish the designed six experimental tasks (standing, level ground walking, stair ascending and descending, ramp ascending and descending) with robotic transtibial prostheses. Data of six locomotion modes were collected under normal speed condition as training data set to train model on board. Based on the on-board trained models, real-time recognition experiments were developed under three different speeds conditions. The total recognition accuracies were 91.54%, 96.72% and 95.35% corresponding to slow, normal and fast speeds, respectively. The results showed some adaptation of recognition for the six locomotion modes at different speeds. The on-board training strategy was feasible and effective with satisfactory performance.

In this paper, we investigate the resource allocation algorithm design for multicarrier solar-powered unmanned aerial vehicle (UAV) communication systems. In particular, the UAV is powered by the solar energy enabling sustainable communication services to multiple ground users. We study the joint design of the 3D aerial trajectory and the wireless resource allocation for maximization of the system sum throughput over a given time period. As a performance benchmark, we first consider an off-line resource allocation design assuming non-causal knowledge of the channel gains. The algorithm design is formulated as a mixed-integer non-convex optimization problem taking into account the aerodynamic power consumption, solar energy harvesting, a finite energy storage capacity, and the quality-of-service requirements of the users. Despite the non-convexity of the optimization problem, we solve it optimally by applying monotonic optimization to obtain the optimal 3D-trajectory and the optimal power and subcarrier allocation policy. Subsequently, we focus on the online algorithm design that only requires real-time and statistical knowledge of the channel gains. The optimal online resource allocation algorithm is motivated by the off-line scheme and entails a high computational complexity. Hence, we also propose a low-complexity iterative suboptimal online scheme based on the successive convex approximation. Our simulation results reveal that both the proposed online schemes closely approach the performance of the benchmark off-line scheme and substantially outperform two baseline schemes. Furthermore, our results unveil the tradeoff between solar energy harvesting and power-efficient communication. In particular, the solar-powered UAV first climbs up to a high altitude to harvest a sufficient amount of solar energy and then descends again to a lower altitude to reduce the path loss of the communication links to the users it serves.

Detecting depression is a key public health challenge, as almost 12% of all disabilities can be attributed to depression. Computational models for depression detection must prove not only that can they detect depression, but that they can do it early enough for an intervention to be plausible. However, current evaluations of depression detection are poor at measuring model latency. We identify several issues with the currently popular ERDE metric, and propose a latency-weighted F1 metric that addresses these concerns. We then apply this evaluation to several models from the recent eRisk 2017 shared task on depression detection, and show how our proposed measure can better capture system differences.

This paper presents the first model for time normalization trained on the SCATE corpus. In the SCATE schema, time expressions are annotated as a semantic composition of time entities. This novel schema favors machine learning approaches, as it can be viewed as a semantic parsing task. In this work, we propose a character level multi-output neural network that outperforms previous state-of-the-art built on the TimeML schema. To compare predictions of systems that follow both SCATE and TimeML, we present a new scoring metric for time intervals. We also apply this new metric to carry out a comparative analysis of the annotations of both schemes in the same corpus.

BACKGROUND: Taxonomic descriptions are traditionally composed in natural language and published in a format that cannot be directly used by computers. The Exploring Taxon Concepts (ETC) project has been developing a set of web-based software tools that convert morphological descriptions published in telegraphic style to character data that can be reused and repurposed. This paper introduces the first semi-automated pipeline, to our knowledge, that converts morphological descriptions into taxon-character matrices to support systematics and evolutionary biology research. We then demonstrate and evaluate the use of the ETC Input Creation - Text Capture - Matrix Generation pipeline to generate body part measurement matrices from a set of 188 spider morphological descriptions and report the findings. RESULTS: From the given set of spider taxonomic publications, two versions of input (original and normalized) were generated and used by the ETC Text Capture and ETC Matrix Generation tools. The tools produced two corresponding spider body part measurement matrices, and the matrix from the normalized input was found to be much more similar to a gold standard matrix hand-curated by the scientist co-authors. Special conventions utilized in the original descriptions (e.g., the omission of measurement units) were attributed to the lower performance of using the original input. The results show that simple normalization of the description text greatly increased the quality of the machine-generated matrix and reduced edit effort. The machine-generated matrix also helped identify issues in the gold standard matrix. CONCLUSIONS: ETC Text Capture and ETC Matrix Generation are low-barrier and effective tools for extracting measurement values from spider taxonomic descriptions and are more effective when the descriptions are self-contained. Special conventions that make the description text less self-contained challenge automated extraction of data from biodiversity descriptions and hinder the automated reuse of the published knowledge. The tools will be updated to support new requirements revealed in this case study.