Objective: Chief complaint (CC) is among the earliest health information recorded at the beginning of a patient's visit to an emergency department (ED). We propose a heuristic methodology for automatically mapping...
详细信息
Objective: Chief complaint (CC) is among the earliest health information recorded at the beginning of a patient's visit to an emergency department (ED). We propose a heuristic methodology for automatically mapping the free-text data into a structured list of CCs. Methods: A comprehensive structured list categorizing CCs was developed by experienced Emergency Medicine (EM) physicians. Using this list, we developed a natural language processing-based algorithm, referred to as Chief Complaint Mapper (CCMapper), for automatically mapping a CC into the most appropriate category (ies). We trained and validated CCMapper using free-text CC data from the Mayo Clinic ED in Rochester, MN. We developed a consensus-based validation approach to handle both indifferences and disagreements between the two EM physicians who manually mapped a random sample of free-text CCs into categories within the structured list. Results: The kappa statistic demonstrated a high level of agreement (kappa = 0.958) between the two physicians with less than 2% human error. CCMapper achieved a total sensitivity of 94.2% with a specificity of 99.8% and F-score of 94.7% on the validation set. The sensitivity of CCMapper when mapping free-text data with multiple CCs was 82.3% with a specificity of 99.1% and total F-score of 82.3%. Conclusion: Due to its simplicity, high performance, and capability of incorporating new free-text CC data, CCMapper can be readily adopted by other EDs to support clinical decision making. CCMapper can facilitate the development of predictive models for the type and timing of important events in ED (e.g., ICU admission).
Agroforestry crops such as apples, peaches and pears are horticultural crops, which are an important part of modern agriculture and are of great economic and social importance. Accurate crop data at large scales (e.g....
详细信息
Agroforestry crops such as apples, peaches and pears are horticultural crops, which are an important part of modern agriculture and are of great economic and social importance. Accurate crop data at large scales (e.g., regional) are critical for effective agricultural management and resource regulation. However, existing orchard statistics, survey data, and expert knowledge are often lagging and of low confidence, lacking detailed data on the spatial distribution of orchards. The sparse distribution and indefinite characteristics of orchards compared to field crops, as well as the large intra-class variance of fruit tree spectra, make large-scale mapping of orchards a major limitation and huge challenge. To address these challenges, we developed an orchard mapping index (OMI) based on the phenology and green-holding characteristics of fruit trees, and automated orchard mapping algorithm using sentinel-2 time-series imagery and the Google Earth Engine platform (GEE). Fruit trees have unique phenological and greening characteristics: fruit tree canopies turn green earlier, turn yellow later, and have a long greenness saturation time in annual growth cycles. The proposed OMI index significantly captures the difference in green-holding between orchards and non-orchards [1.5*Interquartile Range (IQR): 0.72-39.5 for orchards, 0.10-3.36 for non-orchards]. The mapping algorithm successfully mapped 10 m-resolution orchard maps in the Loess Plateau region of China from 2020 to 2022, with an overall accuracy of 89.95-93.51 % and a kappa of 0.80-0.87. We have additionally identified that the implementation of a fine-grained agricultural plantation zoning mapping strategy exhibits the potential to enhance the performance of orchard mapping. Our study demonstrated the potential of a phenology-based approach, sentinel image data, and the GEE platform for orchard mapping, and for the first time developed a large-scale map of orchards in the Loess Plateau region of China. This study
To get a general mapping algorithm for any BPD(Business Process Diagram),depth-first traversal algorithm based component is designed to deal with any BPMN(Business Process Modelling Notation) model which is composed o...
详细信息
ISBN:
(纸本)9781510806450
To get a general mapping algorithm for any BPD(Business Process Diagram),depth-first traversal algorithm based component is designed to deal with any BPMN(Business Process Modelling Notation) model which is composed of the tasks, events, parallel join gateway, parallel fork gateway, databased XOR decision gateway and XOR merge gateway mapping BPEL. The generated BPEL code has good maintainability and extensibility. The algorithm is implemented in the SWF system developed by Python and its validity and usability has also been proved in practical application.
The key issue preventing RGBW LCDs from wide application in the display market was probably the absence of a proper RGB-to-RGBW mapping algorithm with no color-distortion. In this paper, a new RGBW mapping algorithm w...
详细信息
The key issue preventing RGBW LCDs from wide application in the display market was probably the absence of a proper RGB-to-RGBW mapping algorithm with no color-distortion. In this paper, a new RGBW mapping algorithm was designed so that the hue and saturation remain unchanged from the original color. Perception experiment for new algorithm based on our intellectual energy-saving technology (IEST) product indicated that it has superior performance upon conventional RGBW and almost indiscernible to common RGB.
Taylor expansion, a mature method for function evaluations used in Artificial Intelligence (AI) applications, approximates functions with polynomials. In addition to the function evaluations, AI applications require m...
详细信息
Taylor expansion, a mature method for function evaluations used in Artificial Intelligence (AI) applications, approximates functions with polynomials. In addition to the function evaluations, AI applications require massive matrix multiplications, inspiring manufacturers to propose AI processors with matrix multiplier-accumulators (MACs). However, compared with the powerful Matrix MACs, the vectorized units of the AI processors cannot efficiently carry the existing Taylor expansion implementation of Single Instruction Multiple Data (SIMD) parallelism. Leveraging the Matrix MACs for Taylor expansion becomes an ideal direction. In previous studies, migrating optimized algorithms to the Matrix MACs requires matrix generation during the runtime. The generation is expensive and even cancels the accelerations brought by the Matrix MACs on the AI processors, which Taylor expansion also suffers. This article presents Cube-fx, a mapping algorithm of Taylor expansion for multiple functions onto Matrix MACs. Cube-fx expresses the building and computation in matrix multiplications without inefficient dynamic matrix generation. On Huawei Ascend processors, Cube-fx averagely achieves 1.64x speedups compared with vectorized Horner's Method with 56.38$\%$% vectorized operations reduced.
Submerged floating tunnels (SFTs) are vital future maritime infrastructure. Existing studies predominantly use simplified beam models, which fail to accurately capture the local structural stresses. To overcome this l...
详细信息
Submerged floating tunnels (SFTs) are vital future maritime infrastructure. Existing studies predominantly use simplified beam models, which fail to accurately capture the local structural stresses. To overcome this limitation, this study proposes a three-dimensional (3D) stress analysis framework to obtain detailed stress distribution of SFTs. Using the framework, this study investigates stress variations under different wave parameters, including wave heights, periods, and incident angles. The results indicate that, among the axial, circumferential, and shear stresses of the SFT shell elements, axial stress is the most sensitive to changes in the wave parameters. Wave height has the most significant influence on stress variations among the three wave parameters. When the wave height reaches 7 meters, the tensile stress in the main girder and roadbed of the SFT exceeds allowable limits, highlighting the need to enhance the tensile strength in the design.
Several studies employ mapping algorithms to infer index positions in Wfl crude oil futures from positions in agricultural futures and report an economically large and statistically significant impact of index positio...
详细信息
Several studies employ mapping algorithms to infer index positions in Wfl crude oil futures from positions in agricultural futures and report an economically large and statistically significant impact of index positions on crude oil futures prices. In this article, we provide direct evidence that the apparent impact of index investment based on mapping algorithms is spurious. Specifically, an idiosyncratic spike in agricultural index positions during 2007-08, coupled with the spike in oil prices, causes the spurious impact of index investment on crude oil futures prices found in these earlier studies. (C) 2018 Elsevier B.V. All rights reserved.
Network on Chip (NoC) is proposed as a new intra-chip communication infrastructure. In current NoC design, one related problem is mapping IP cores onto NoC architectures. In this paper, we propose a performance-aware ...
详细信息
Network on Chip (NoC) is proposed as a new intra-chip communication infrastructure. In current NoC design, one related problem is mapping IP cores onto NoC architectures. In this paper, we propose a performance-aware hybrid algorithm (PHA) for mesh-based NoC to optimize performance indexes such as latency, energy consumption and maximal link bandwidth. The PHA is a hybrid algorithm, which integrates the advantages of Greedy algorithm, Genetic algorithm and Simulated Annealing algorithm. In the PHA, there are three features. First, it generates a fine initial population efficiently in a greedy swap way. Second, effective global parallel search is implemented by genetic operations such as crossover and mutation, which are implemented with adaptive probabilities according to the diversity of population. Third, probabilistic acceptance of a worse solution using simulated annealing method greatly improves the performance of local search. Compared with several previous mapping algorithms such as MOGA and TGA, simulation results show that our algorithm enhances the performance by 30.7%, 23.1% and 25.2% in energy consumption, latency and maximal link bandwidth respectively. Moreover, simulation results demonstrate that our PHA approach has the highest convergence speed among the three algorithms. These results show that our proposed mapping algorithm is more effective and efficient.
Optical network virtualization enables multiple virtual optical networks constructed for different infrastructure users(renters) or applications to coexist over a physical infrastructure. Virtual optical network(VON) ...
详细信息
Optical network virtualization enables multiple virtual optical networks constructed for different infrastructure users(renters) or applications to coexist over a physical infrastructure. Virtual optical network(VON) mapping algorithm is used to allocate necessary resources in the physical infrastructure to the VON requests(VRs). In this paper, we investigate the opaque VON mapping problems in elastic optical networks(EONs). Based on the concept of available spectrum adjacency(AvS A) on links or paths, we consider both node resource and AvS A on links for node mapping, and present a link mapping method which chooses the routing and spectrum plan whose AvS A on paths is the largest among all the candidates. Finally, the overall VON mapping algorithm(i.e., AvS A-opaque VON mapping, AvS A-OVONM) coordinated node and link mapping is proposed. Extensive simulations are conducted and the results show that AvS A-OVONM has better performance of blocking probability and revenue-to-cost ratio than current algorithms.
With the advancement in technology, it is now possible to integrate hundreds of cores onto single silicon semiconductor chip or silicon die. In order to provide communication between these cores, large number of resou...
详细信息
With the advancement in technology, it is now possible to integrate hundreds of cores onto single silicon semiconductor chip or silicon die. In order to provide communication between these cores, large number of resources are required and it leads to the communication problem in System-on- Chip (SoC), which is solved by introduction of Networks-on-Chip (NoC). NoC proves to be most efficient in terms of flexibility, scalability and parallelism. In this paper, the proposed mapping algorithms, Horological mapping (HorMAP), Rotational mapping (RtMAP) and Divide and Conquer mapping (DACMAP) for mapping of tasks onto cores, basically concentrate on the optimization of latency, queuing time, service time and energy consumption of topology at constant bandwidth required. The experimental results discussed in this paper shows the comparison of proposed algorithms with traditional random mapping algorithm. In this paper, 2D mesh topology with XY routing is considered for the simulation of proposed algorithms.
暂无评论