互联网时代下的学校图书管理信息化建设

如何在互联网时代打造一个信息化的管理模式,已经成为广大学校图书管理发展过程中亟待处理的问题。文章就互联网时代下的高职图书管理信息化建设进行了详细探讨,以期能够给广大同仁提供一些借鉴参考,共同为图书管理工作的现代化改革和发展贡献力量。     

新媒体环境下智慧化阅读推广研究——以重庆第二师范学院为例

开展智慧化阅读推广,紧跟时代步伐,有效提升读者多重阅读体验和满意度,增强智慧化阅读推广的价值,促进智慧化阅读推广服务的有效化、规范化、科学化、常态化、长期化发展,已成为当前阅读推广研究中一个重要的切入点。文章基于智慧化阅读研究,结合"新媒体"高新技术环境,提出智慧化阅读推广的内容分析、具体实施、环境构建、推广评估与效果、推广改进等几个方面组成的以读者为中心的核心服务体系。本文分析了智慧化阅读基本方面,以我校图书馆实际运用推广效果,智慧化阅读存在的优、劣势及相应的对策。     

The International Society for the Study of Vascular Anomalies (ISSVA) ontology

The International Society for the Study of Vascular Anomalies (ISSVA) provides a classification for vascular anomalies that enables specialists to unambiguously classify diagnoses. This classification is only available in PDF format and is not machine-readable, nor does it provide unique identifiers that allow for structured registration. In this paper, we describe the process of transforming the ISSVA classification into an ontology. We also describe the structure of this ontology, as well as two applications of the ontology using examples from the domain of rare disease research. We used the expertise of an ontology expert and clinician during the development process. We semi-automatically added mappings to relevant external ontologies using automated ontology matching systems and manual assessment by experts. The ISSVA ontology should contribute to making data for vascular anomaly research more Findable, Accessible, Interoperable, and Reusable (FAIR). The ontology is available at https://bioportal.bioontology.org/ontologies/ISSVA.     

Benchmark experiment of large-angle scattering reaction cross section of iron at 14 MeV using two shadow bars – Comparison of experimental results with ENDF/B-VIII –

ABSTRACT

It is important to perform neutron transport simulations with accurate nuclear data in the neutronics design of a fusion reactor. However, absolute values of large-angle scattering cross sections vary among nuclear data libraries even for well-examined nuclide of iron. Benchmark experiments focusing on large-angle scattering cross sections were thus performed to confirm the correctness of nuclear data libraries. The series benchmark experiments were performed at a DT neutron source facility, OKTAVIAN of Osaka University, Japan, by the unique experimental system established by the authors’ group, which can extract only the contribution of large-angle scattering reactions. This system consists of two shadow bars, target plate (iron), and neutron detector (niobium). Two types of shadow bars were used and four irradiations were conducted for one experiment, so that contribution of room-return neutrons was effectively removed and only large-angle scattering neutrons were extracted from the measured four Nb reaction rates. The obtained experimental results were compared with calculations for five nuclear data libraries including JENDL-4.0, JEFF.-3.3, FENDL-3.1, ENDF/B- VII, and recently released ENDF/B-VIII. It was found from the comparison that ENDF/B-VIII showed the best result, though ENDF/B-VII showed overestimation and others are in large underestimation at 14 MeV.     

A Case Report of Germline Compound Heterozygous Mutations in the BRCA1 Gene of an Ovarian and Breast Cancer Patient

The germline carrier of the BRCA1 pathogenic mutation has been well proven to confer an increased risk of breast and ovarian cancer. Despite BRCA1 biallelic pathogenic mutations being extremely rare, they have been reported to be embryonically lethal or to cause Fanconi anemia (FA). Here we describe a patient who was a 48-year-old female identified with biallelic pathogenic mutations of the BRCA1 gene, with no or very subtle FA-features. She was diagnosed with ovarian cancer and breast cancer at the ages of 43 and 44 and had a strong family history of breast and gynecological cancers.     

Predicting Prostephanus truncatus (Horn) (Coleoptera: Bostrichidae) populations and associated grain damage in smallholder farmers’ maize stores: A machine learning approach

Prostephanus truncatus is a notorious pest of stored-maize grain and its spread throughout sub-Saharan Africa has led to increased levels of grain storage losses. The current study developed models to predict the level of P. truncatus infestation and associated damage of maize grain in smallholder farmer stores. Data were gathered from grain storage trials conducted in Hwedza and Mbire districts of Zimbabwe and correlated with weather data for each site. Insect counts of P. truncatus and other common stored grain insect pests had a strong correlation with time of year with highest recorded numbers from January to May. Correlation analysis showed insect-generated grain dust from boring and feeding activity to be the best indicator of P. truncatus presence in stores (r = 0.70), while a moderate correlation (r = 0.48) was found between P. truncatus numbers and storage insect parasitic wasps, and grain damage levels significantly correlated with the presence of Tribolium castaneum (r = 0.60). Models were developed for predicting P. truncatus infestation and grain damage using parameter selection algorithms and decision-tree machine learning algorithms with 10-fold cross-validation. The P. truncatus population size prediction model performance was weak (r = 0.43) due to the complicated sampling and detection of the pest and eight-week long period between sampling events. The grain damage prediction model had a stronger correlation coefficient (r = 0.93) and is a good estimator for in situ stored grain insect damage. The models were developed for use under southern African climatic conditions and can be improved with more input data to create more precise models for building decision-support tools for smallholder maize-based production systems.     

A self-adaptive synthetic over-sampling technique for imbalanced classification

Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50%-80%) is used for training and the rest—for validation. In many problems, however, the data are highly imbalanced in regard to different classes or does not have good coverage of the feasible data space which, in turn, creates problems in validation and usage phase. In this paper, we propose a technique for synthesizing feasible and likely data to help balance the classes as well as to boost the performance in terms of confusion matrix as well as overall. The idea, in a nutshell, is to synthesize data samples in close vicinity to the actual data samples specifically for the less represented (minority) classes. This has also implications to the so-called fairness of machine learning. In this paper, we propose a specific method for synthesizing data in a way to balance the classes and boost the performance, especially of the minority classes. It is generic and can be applied to different base algorithms, for example, support vector machines, k-nearest neighbour classifiers deep neural, rule-based classifiers, decision trees, and so forth. The results demonstrated that (a) a significantly more balanced (and fair) classification results can be achieved and (b) that the overall performance as well as the performance per class measured by confusion matrix can be boosted. In addition, this approach can be very valuable for the cases when the number of actual available labelled data is small which itself is one of the problems of the contemporary machine learning.     

中医学视角下城市物质空间的生命要素探析

通过借鉴中医学整体观和生命观的相关理论,从认识城市有机体的生命属性入手,发现并提炼能够产生和传递城市运营所需各种能量的生命要素:廊道和功能体。阐释了其多层级、多性质和多形态的特点,提出了功能体有动力、廊道成系统、敏感点有活力的疏通策略,旨在促进城市各种能量的有机循环,从而维护城市的健康与安全,提高城市生活的效率与质量。     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.