海量数据链表的并行listscan随机算法

本文提出了一种基于 PVM的海量数据链表并行 listscan算法实现的方法和策略 ,并对它在曙光 10 0 0 A上的执行效果进行了分析 .结果显示所提出的并行处理策略对 10 0 M数据大小链表的 listscan并行操作是可行的 ,算法复杂度为 O(n/ p+ p) .

National Lists of Scholarly Publication Channels: An Overview and Recommendations for Their Construction and Maintenance

Purpose: This paper presents an overview of different kinds of lists of scholarly publication channels and of experiences related to the construction and maintenance of national lists supporting performance-based research funding systems. It also contributes with a set of recommendations for the construction and maintenance of national lists of journals and book publishers.Design/methodology/approach: The study is based on analysis of previously published studies, policy papers, and reported experiences related to the construction and use of lists of scholarly publication channels. Findings: Several countries have systems for research funding and/or evaluation, that involve the use of national lists of scholarly publication channels(mainly journals and publishers). Typically, such lists are selective(do not include all scholarly or non-scholarly channels) and differentiated(distinguish between channels of different levels and quality). At the same time, most lists are embedded in a system that encompasses multiple or all disciplines. This raises the question how such lists can be organized and maintained to ensure that all relevant disciplines and all types of research are adequately represented. Research limitation: The conclusions and recommendations of the study are based on the authors' interpretation of a complex and sometimes controversial process with many different stakeholders involved.Practical implications: The recommendations and the related background information provided in this paper enable mutual learning that may feed into improvements in the construction and maintenance of national and other lists of scholarly publication channels in any geographical context. This may foster a development of responsible evaluation practices.Originality/value: This paper presents the first general overview and typology of different kinds of publication channel lists, provides insights on expert-based versus metrics-based evaluation, and formulates a set of recommendations for the responsible construction and maintenance of publication channel lists.

Membership Proof and Verification in Authenticated Skip Lists Based on Heap

How to keep cloud data intact and available to users is a problem to be solved. Authenticated skip list is an important data structure used in cloud data integrity verification. How to get the membership proof of the element in authenticated skip list efficiently is an important part of authentication. Kaouthar Blibech and Alban Gabillon proposed a head proof and a tail proof algorithms for the membership proof of elements in the authenticated skip list. However, the proposed algorithms are uncorrelated each other and need plateau function. We propose a new algorithm for computing the membership proof for elements in the authenticated skip list by using two stacks, one is for storing traversal chain of leaf node, the other is for storing authentication path for the leaf. The proposed algorithm is simple and effective without needing plateau function. It can also be applicable for other similar binary hash trees.

Research on China’s technology lists for addressing climate change

The compilation of technology lists addressing climate change has a guiding effect on promoting technological research and development,demonstration,and popularization.It is also crucial for China to strengthen ecological civilization construction,achieve the carbon emission peak and carbon neutrality target,and enhance global climate governance capabilities.This study first proposes the existing classification outline of the technology promotion lists,technology demand lists,and future technology lists.Then,different methodologies are integrated on the basis of the existing outline of four technology lists:China’s existing technological promotion list for addressing climate change,China’s demand list for climate change mitigation technology,China’s key technology list for addressing climate change,and China’s future technology list for addressing climate change.What’s more,core technologies are analyzed in the aspects of technology maturity,carbon reduction cost,carbon reduction potential,economic benefits,social influence,uncertainty,etc.The results show that:key industries and sectors in China already have relatively mature mitigation/adaptation technologies to support the achievement of climate change targets.The multi-sectoral system of promoting climate friendly technologies has been established,which has played an active role in tackling climate change.Currently,climate technology needs are concentrated in the traditional technology and equipment upgrading,renewable energy technology,and management decision-making support technology.The key technologies are concentrated in 3 major areas and 12 technological directions that urgently need a breakthrough.For carbon emmission peak and nentrality,carbon depth reduction and zero carbon emissions and geoengineering technology(CDR and SRM)have played an important role in forming the structure of global emissions and achieving carbon neutrality in the future.Thus,the uncertainty assessment for the comprehensive technology cost effectiveness,technology integration direction,technical maturity,ethics and ecological impacts is supportive to the national technology strategy.Finally,the presented study proposes several policy implications for medium-and long-term technology deployment,improving technology conversion rate,promoting the research and development of core technologies,and forming a technology list collaborative update and release mechanism.

SCORE LISTS IN(h,k)-BIPARTITE HYPERTOURNAMENTS

Given non-negative integers m,n,h and k with m≥ h 〉 1 and n ≥ k 〉 1, an （h, k）-bipartite hypertournament on m ＋ n vertices is a triple （U, V, A）, where U and V are two sets of vertices with ｜U｜ = m and ｜V｜ = n, and A is a set of （h ＋ k）-tuples of vertices,called arcs, with at most h vertices from U and at most k vertices from V, such that for any h＋k subsets U1 UV1 of UUV, A contains exactly one of the （h＋k）! （h＋k）-tuples whose entries belong to U1 ∪ V1. Necessary and sufficient conditions for a pair of non-decreasing sequences of non-negative integers to be the losing score lists or score lists of some（h, k）-bipartite hypertournament are obtained.

Reducing Paediatric Outpatient Waitlists—A Proposed Allied Health Multidisciplinary Approach

Extremely long Australian paediatric outpatient waiting lists have resulted in large numbers of children waiting to see a paediatrician. Analyses of the patient referrals suggest that a large proportion of children may benefit from allied health input, in addition to being seen by the paediatrician. This paper provides an organisational strategy that involves streamlining Allied Health clinical services in an effort to assist with bringing down a Paediatric Out-patient waitlist. The paper describes principles to guide the formation of a Paediatric Allied Health Multi-Disciplinary team that proposes assessment and brief interventions. The service would focus on supporting the paediatricians through the use of structured procedures, telephone intakes, multidisciplinary triage, shared and standardised assessments, collaborative formulations and reports, brief interventions, clinical-community linkages, and allied health student support. A variety of additional important organisational principles are proposed to facilitate patient flow from the perspective of streamlining administrative processes, having adequate administrative support, shared responsibilities, teamwork, flexibility, carrying out intake assessments, determining which referrals were appropriate for allied health, and working closely with medical staff.

Science Citation Index Expanded Journal Lists related to neurosciences & neuroimaging

SCIENCE CITATION INDEX EXPANDED-NEUROSCIENCES-JOURNAL LIST Total journals： 245 1. ACS CHEMICAL NEUROSCIENCE Monthly ISSN： 1948-7193 AMER CHEMICAL SOC, 1155 16TH ST, NW, WASHINGTON, USA, DC, 20036 · Science Citation Index Expanded · BIOSIS Previews

Projects Lists Relating to Post-disaster Reconstruction

Aba Prefecture Company Name:Sichuan Xintong New Materials Co.Ltd. Address:Shuimo,Wenchuan Nature of Business:Private Project Name:Processing and Sale of Tourism Products Details:Producing and processing of Natural crystal products,man-made gem and other

Improved Segmented Belief Propagation List Decoding for Polar Codes with Bit-Flipping

Belief propagation list(BPL) decoding for polar codes has attracted more attention due to its inherent parallel nature. However, a large gap still exists with CRC-aided SCL(CA-SCL) decoding.In this work, an improved segmented belief propagation list decoding based on bit flipping(SBPL-BF) is proposed. On the one hand, the proposed algorithm makes use of the cooperative characteristic in BPL decoding such that the codeword is decoded in different BP decoders. Based on this characteristic, the unreliable bits for flipping could be split into multiple subblocks and could be flipped in different decoders simultaneously. On the other hand, a more flexible and effective processing strategy for the priori information of the unfrozen bits that do not need to be flipped is designed to improve the decoding convergence. In addition, this is the first proposal in BPL decoding which jointly optimizes the bit flipping of the information bits and the code bits. In particular, for bit flipping of the code bits, a H-matrix aided bit-flipping algorithm is designed to enhance the accuracy in identifying erroneous code bits. The simulation results show that the proposed algorithm significantly improves the errorcorrection performance of BPL decoding for medium and long codes. It is more than 0.25 d B better than the state-of-the-art BPL decoding at a block error rate(BLER) of 10^(-5), and outperforms CA-SCL decoding in the low signal-to-noise(SNR) region for(1024, 0.5)polar codes.

Bawei Biotechnology Listed

On Mar.29th,2024,Bawei Biotechnology was listed at Beijing Stock Exchange.So far,Bawei Biotechnology has smoothly become“the first cosmetics OEM listed at Beijing Stock Exchange”,as well as the first A-share cosmetics enterprise listed in 2024.At the opening quotation,the stock price increase of Bawei Biotechnology exceeded 200%,and the total market value exceeded 1.4 billion yuan.Bawei Biotechnology mainly engages in the R&D,production,sales and detection of cosmetics,with the product category covering skin care product,facial mask,toiletry,and makeup.So far,it has served a total of 1,000 cosmetics brands,including Unilever,Renhe Ingenuity,HBN,SKINTIFIC,Marubi Biotechnology,PROF.

通用学术词表Academic Vocabulary List(AVL)修订述略

学术英语词汇是学术英语教学的重点和难点,不同时代和学科曾编写过各类学术词表。加德纳和戴维斯(2014)基于学术语料容量达1.2亿的COCA语料库推出学术词表Academic Vocabulary List(AVL),该词表在学术英语教学和研究中得到广泛应用。然而实践表明,AVL词表收录的3015个词元存在词汇重复、以词元为单位排列的词表和以词族为单位排列的词表不相吻合等问题。本研究尝试以科学性原则、适切性原则、时效性原则为指导,基于AVL词表原有的比率、分布、离散度、学科指数四条选词标准,增加最低频次和经验判断两条新标准对AVL词表予以完善和修订。完善修订后的AVL词表由先前的1991个词族、3015个词元缩减至709个词族1715个词元,较修订前更具简洁性和高效性。希望依据3项原则和6项标准所做的修订为学术英语教与学以及学术英语教材编写和选用带来新的参考。

Evolution and Governance of the Structure of Marine Economic Networks in China’s Coastal Areas: Based on Sea-related A-share Listed Companies

Data on discrete,isolated attributes of the marine economy are often used in traditional marine economic research.However,as the focus of urban research shifts from internal static attributes to external dynamic linkages,the importance of marine economic net-work research is beginning to emerge.The construction of the marine economic network in China’s coastal areas is necessary to change the flow of land and sea resources and optimize regional marine economic development.Employing data from headquarters and branches of sea-related A-share listed enterprises to construct the marine economic network in China,we use social network analysis(SNA)to discuss the characteristics of its evolution as of 2010,2015,and 2020 and its governance.The following results were obtained.1)In terms of topological characteristics,the scale of the marine economic network in China’s coastal areas has accelerated and expan-ded,and the connections have become increasingly close;thus,this development has complex network characteristics.2)In terms of spatial structure,the intensity of the connection fluctuates and does not form stable development support;the group structure gradually becomes clear,but the overall pattern is fragmented;there are spatial differences in marine economic agglomeration radiation;the radi-ation effect of the eastern marine economic circle is obvious;and the polarization effect of northern and southern marine economic circles is significant.On this basis,we construct a framework for the governance of a marine economic network with the market,the government,and industry as the three governing bodies.By clarifying the driving factors and building objectives of marine economic network construction,this study aims to foster the high-quality development of China’s marine economy.

Generating Tree-Lists by Fusing Individual Tree Detection and Nearest Neighbor Imputation Using Airborne LiDAR Data

Individual tree detection (ITD) and the area-based approach (ABA) are combined to generate tree-lists using airborne LiDAR data. ITD based on the Canopy Height Model (CHM) was applied for overstory trees, while ABA based on nearest neighbor (NN) imputation was applied for understory trees. Our approach is intended to compensate for the weakness of LiDAR data and ITD in estimating understory trees, keeping the strength of ITD in estimating overstory trees in tree-level. We investigated the effects of three parameters on the performance of our proposed approach: smoothing of CHM, resolution of CHM, and height cutoff (a specific height that classifies trees into overstory and understory). There was no single combination of those parameters that produced the best performance for estimating stems per ha, mean tree height, basal area, diameter distribution and height distribution. The trees in the lowest LiDAR height class yielded the largest relative bias and relative root mean squared error. Although ITD and ABA showed limited explanatory powers to estimate stems per hectare and basal area, there could be improvements from methods such as using LiDAR data with higher density, applying better algorithms for ITD and decreasing distortion of the structure of LiDAR data. Automating the procedure of finding optimal combinations of those parameters is essential to expedite forest management decisions across forest landscapes using remote sensing data.

导学互动整合式教学模式对重症监护室住培医师Check-list量表评分及满意度的影响

目的探讨导学互动整合式教学模式对重症监护室住院医师规范化培训(简称住培)医师Check-list量表评分及满意度的影响。方法选取2022年1月—2023年12月南京医科大学附属无锡人民医院重症监护室的60名住培医师为研究对象,根据不同的教学模式分为传统组(n=30,采用传统教学方式)和导学组(n=30,采用导学互动整合式教学方式)。比较两组住培医师的Check-list量表评分、考核成绩、教学满意度。结果出科时,导学组的Check-list量表(询问医学面谈技能、体格检查、人文/职业素养、整体临床能力)评分均高于传统组,理论考核、技能考核、病例分析成绩均高于传统组,差异有统计学意义(P均<0.05)。导学组的教学满意度为93.33%(28/30),高于传统组的73.33%(22/30),差异有统计学意义(χ^(2)=4.320,P<0.05)。结论导学互动整合式教学在重症监护室住培医师临床能力的教学培养中能明显提高医师的知识掌握程度,促进教学质量的提升和满意度的提高。

基于list-mode数据重建PET图像的研究进展

本文通过对基于list-mode和sinogram两种数据形式的PET图像EM重建算法的比较,从几个方面介绍了直接采用list-mode数据进行PET图像重建的优点,并对基于list-mode的PET图像重建算法的发展动态进行了评述。

一种改进的基于N-List的频繁项集挖掘算法

针对在海量数据中频繁项集挖掘耗时问题,近年来提出的N-List结构可有效提高挖掘效率。基于N-List提出一种新的频繁项集挖掘算法HNSFI(Hash table and subsume frequent itemsets mining based on N-List)。该算法利用PPC-tree生成N-List,引入哈希表存储N-List表示的项集,加快N-List相交操作运算时间;引入包含因子概念,利用其性质通过组合方法可以直接生成部分频繁项集,进一步提高算法时间性能。在三种不同的数据集上对该算法进行了测试和分析,实验结果表明在稠密数据集中该算法的时间性能是最优的。

基于SHEL模型的check list表管理在新型冠状病毒核酸标本采集不良事件防范管理中的应用

目的评价编制的check list表在新型冠状病毒核酸咽拭子标本采集不良事件防范管理中的应用效果。方法以SHEL模型为指导,通过专家函询,制定出核酸咽拭子标本采集过程中有潜在风险的不良事件防范check list表,采用跟班督查、现场提问、问卷星考核等方式逐条进行整改,评价整改前3个月和整改后3个月不良事件发生率、咽拭子标本采集合格率、核酸检验人员对护理工作满意度的差异。结果采用check list表进行核查、追踪、整改后,不良事件发生率从0.13%下降至0.02%,标本采集合格率从88.55%提高到93.37%,整改前后比较差异有统计学意义(P<0.001),检验科人员对护理工作的满意度有很大提高。结论以SHEL模型为指导的check list表制定,能为护理不良事件的防范管理提供全面的指导,有利于提高护理质量,值得推广应用。

An Incremental Algorithm for Non-Slicing Floorplan Based on Corner Block List Representation

We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation. The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning results. Based on the critical path and the accumulated slack distances we define,we choose the best position for insertion and do a series of operations incrementally, such as deleting modules, adding modules, and resizing modules quickly. This incremental floorplanning algorithm has a very high speed less than 1μm,which is one of the most important measures in this research. The algorithm preserves the original good performances on area and wire length. It can also supply other tools with good physical estimates for area, wire length, and other performance guidelines.

结合隐式元数据和List IO的并行文件系统

并行文件系统中的文件数据与元数据分离管理和分离存储使得系统复杂性上升,可靠性下降,采用将两种数据结合的隐式的元数据管理与存储则可以避免上述问题,而且可以获得元数据的并行服务能力,将Expand隐式元数据管理的简单可靠及元数据并发服务和PVFS高效的ListI/O非连续数据访问的能力相结合,可以同时获得两者的优点。

List流上的log熵函数

Ricci流的Perelman泛函的log熵函数与黎曼流形上的log Sobolev不等式密切相关.List流是比Ricci流更加广泛的一种几何流,由于它与广义相对论之间关系密切而成为了研究热点.主要定义了对应于List流的一种新的log熵函数,并计算了其关于时间t的第一变分公式,对其单调性也进行了讨论.