课程文献中心 更多>>

关键词： 网络学术期刊   传播能力   互联网思维   新媒体技术   标识符   语义出版  

摘要： 为提升网络学术期刊的传播能力,提高网络学术期刊的发行质量,针对网络学术期刊的特点,围绕其发行与传播环境,并结合对2015年我国SCI收录期刊的实证分析,提出提升网络学术期刊传播能力的对策。网络学术期刊传播能力的提升,需要编辑树立互联网思维,需要建立健全多渠道的发行途径,重视标识符的使用以及重视挖掘语义出版等新出版模式。学术期刊的发展应顺应时代潮流,新元素和新出版模式的使用将成为网络学术期刊发展的必然趋势。

关键词： 数字信息   标注   object   出版物   国际标准   条形码   互联网  

摘要： 数字对象唯一标识符（digital object identifier,DOI）是对包括互联网信息在内的数字信息进行标识的一种工具。在传统的出版物中,书刊、磁带、光盘都有国际标准编号（ISBN、ISSN、ISCN）及其条形码,作为出版物的唯一标识。这些标识使出版物得到有效的管理,便于读者查找和利用。而网上的文档一旦变更了网址便无从追索。数字信息标注DOI如同出版物的条形码,是一个永久和唯一的标识号。

关键词： 频谱水印   相关标识符   小波分解   频谱水印嵌入   频谱水印提取  

摘要： 为有效标识无线电设备身份信息,快速确定无线电干扰,提出了一种基于相关标识符的频谱水印嵌入与提取方法.该方法中发射端在标识符嵌入控制模块的控制下将频谱水印嵌入位置标识符嵌入到通信信号中,然后通过对含有频谱水印嵌入位置标识符的通信信号小波分解低频系数进行量化来嵌入频谱水印;接收端通过分析相关标识符的自相关和互相关特性来检测频谱水印,对接收到的中频信号小波分解低频系数实施量化处理来提取频谱水印.理论分析与仿真结果表明:提出的方法能够在不对原始信号正常解调产生有害干扰的条件下,可有效提取频谱水印,不需解调原始信号,可有效减少频谱水印提取的复杂度,为有效标识和识别无线电设备身份提供了技术手段.

关键词： 数字信息   管理学   发表论文   杂志   健康   中华   object   管理系统  

摘要： 数字对象标识符（digital object identifier，DOI）是对包括互联网信息在内的数字信息进行标识的一种工具，是一个可供全球期刊快速链接的管理系统，整个系统由国际DOI基金会（IDF）进行全球分布式管理。

关键词： 传感器网络   标识符   注册管理  

摘要： 目前,国家标准《传感节点标识符编制规则》正式实施。然而,目前还没有相应的传感器网络传感节点标识符注册管理,影响了传感节点标识符大规模应用推广。本文设计了传感网络传感节点标识符注册管理,对标识符的注册过程和标识符注册内容进行管理,对推广传感节点标识符的大规模应用具有重要意义。

关键词： 数字信息   参考文献   标注   杂志   医史   中华   object   管理系统  

摘要： 数字对象惟一标识符（digital object identifier，DOI）是对包括互联网信息在内的数字信息进行标识的一种工具。数字信息标注DOI如同出版物的条形码，是一个永久和惟一的标识号。DOI是一个可供全球期刊快速链接的管理系统，整个系统由国际DOI基金会（IDF）进行全球分布式管理。随着DOI的普及，可以借助其进行相关的科研评价，分析高被引频次作者、单位和论文等相关信息，了解各个领域学术研究的热点、影响和趋势，以及研究者在某一研究领域的影响力及最新研究成果。

关键词： DOI   Web of Science Core Collection   Scopus   Citation databases   Visibility   Altmetrics  

摘要： This study aims to shed light on the implementation of the digital object identifier (DOI) in the two most important multidisciplinary databases, namely Web of Science Core Collection and Scopus, within the last decade (2005-2014). The results show a generally increased percentage of items with DOI in all the disciplines in both databases, which provide very similar numbers and trends. While the percentage of citable items with a DOI has already reached 90% in the Sciences and the Social Sciences in 2014, it has remained much lower in the Arts & Humanities, exceeding 50% only since 2013. The observed values for Books and Proceedings are even lower despite the importance of these document types, particularly for the Social Sciences and the Arts & Humanities. The fact that there are still journals with a large number of items still lacking DOIs in 2014 should be alarming for the corresponding editors and should give them reason to enhance the formal quality and visibility of their journals. Finally, scientists are also encouraged to review their publication strategies and to favour publication channels with established DOI assignments. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Complex-valued systems   Non-parametric modeling   Recurrent neural networks   Lyapunov control functions  

摘要： Recently, the study of dynamic systems and signals in the frequency domain motivates the emergence of new tools. In particular, electrophysiological and communications signals in the complex domain can be analyzed but hardly, they can be modeled. This problem promotes an attractive field of researching in system theory. As a consequence, adaptive algorithms like neural networks are interesting tools to deal with the identification problem of this kind of systems. In this study, a new learning process for recurrent neural network applied on complex-valued discrete-time nonlinear systems is proposed. The Lyapunov stability framework is applied to obtain the corresponding learning laws by means of the so-called Lyapunov control functions. The region where the identification error converges is defined by the power of uncertainties and perturbations that affects the nonlinear discrete-time complex system. This zone is obtained as an alternative result of the same Lyapunov analysis. An off-line training algorithm is derived in order to reduce the size of the convergence zone. The training is executed using a set of some off-line measurements coming from the uncertain system. Numerical results are developed to prove the efficiency of the methodology proposed in this study. A first example is oriented to identify the dynamics of a nonlinear discrete time complex-valued system and the second one to model the dynamics of an electrophysiological signal separated in magnitude and phase.

关键词： file linking   multiple imputation   eUCI   mixture models  

摘要： Incarceration provides an opportunity to test for HIV, provide treatment such as highly active anti-retroviral therapy, as well as link infected persons to comprehensive HIV care upon their release. A key factor in assessing the success of a program that links released individuals to care is the time from release to receiving care in the community (linkage time). To estimate the linkage time, records from correction systems are linked to Ryan White Clinic data using encrypted Unique Client Identifier (eUCI). Most of the records that were linked using eUCI belong to the same individual;however, in some cases, it may link records incorrectly, or not identify records that should have been linked. We propose a Bayesian procedure that relies on the relationships between variables that appear in either of the data sources, as well as variables that exists in both to identify correctly linked records among all linked records. The procedure generates K datasets in which each pair of linked records is identified as a true link or a false link. The K datasets are analyzed independently, and the results are combined using Rubin's multiple imputation rules. A small validation dataset is used to examine different statistical models and to inform the prior distributions of the parameters. In comparison with previously proposed methods, the proposed method utilizes all of the available data and is both flexible and computationally efficient. In addition, this approach can be applied in other file linking applications. Copyright (C) 2015 John Wiley & Sons, Ltd.

关键词： Distributed algorithms   Fractional domatic partition   Fractional graph colouring   Local algorithms   Unique identifiers  

摘要： In the fractional graph colouring problem, the task is to schedule the activities of the nodes so that each node is active for 1 time unit in total, and at each point of time the set of active nodes forms an independent set. We show that for any alpha > 1 there exists a deterministic distributed algorithm that finds a fractional graph colouring of length at most alpha(Delta + 1) in any graph in one synchronous communication round;here 4 is the maximum degree of the graph. The result is near-tight, as there are graphs in which the optimal solution has length Delta + 1. The result is, of course, too good to be true. The usual definitions of scheduling problems (fractional graph colouring, fractional domatic partition, etc.) in a distributed setting leave a loophole that can be exploited in the design of distributed algorithms: the size of the local output is not bounded. Our algorithm produces an output that seems to be perfectly good by the usual standards but it is impractical, as the schedule of each node consists of a very large number of short periods of activity. More generally, the algorithm demonstrates that when we study distributed algorithms for scheduling problems, we can choose virtually any trade-off between the following three parameters: T, the running time of the algorithm, l, the length of the schedule, and K, the maximum number of periods of activity for any single node. Here l is the objective function of the optimisation problem, while K captures the "subjective" quality of the solution. If we study, for example, bounded-degree graphs, we can trivially keep T and K constant, at the cost of a large l, or we can keep K and l constant, at the cost of a large T. Our algorithm shows that yet another trade-off is possible: we can keep T and l constant at the cost of a large K. (C) 2014 Elsevier B.V. All rights reserved.