科技论文表格优化实例

在作者日常的编辑校对工作中,经常会发现论文中表格繁杂、层次混乱、表达不清又占用大量版面等现象,根据表格的基本规范,结合作者编辑实践,通过几个实例,介绍了科技论文中表的行列调整、合并与拆分以及其与文字的转换等优化方式,以准确、简明、合理地表达数据信息,反映了编辑工作对表格的优化效果。     

关键词

关键词是科技论文的文献检索标识,是表达文献主题概念的自然语言词汇。科技论文的关键词是从其题名、层次标题和正文中选出来的,能反映论文主题概念的词或词组。学术界已约定利用主题概念词去检索最新发表的论文。作者发表论文不标注关键词或叙词,读者就检索不到,文献数据库就不会收     

《四川动物》1990—1992年论文的引文试析

科技论文的引文通常指文末的参考文献,系作者在撰写论文时列出的引用他人的文章、数据、材料和论点等的出处,既是尊重他人的成果,也是说明自己工作的依据,还便于读者了解有关研究领域的状况和进展,反映作者及其论文收集、利用科技信息的能力、水平等。《四川动物》杂志是四川省动物学会等主办的学术性期刊,在传递有关科技信息,促进本学科发展方面做出了一定成绩。笔者对该刊1990—1992年论文引文情况进行了统计和试析。     

关键词

关键词是科技论文的文献检索标识,是表达文献主题概念的自然语言词汇。科技论文的关键词是从其题名、层次标题和正文中选出来的,能反映论文主题概念的词或词组。学术界已约定利用主题概念词去检索最新发表的论文。作者发表论文不标注关键词或叙词,读者就检索不到,文献数据库就不会收录此类文章。关键词选用得是否恰当,关系到该文被检索的概率和该成果的利用率。     

关键词

关键词是科技论文的文献检索标识,是表达文献主题概念的自然语言词汇。科技论文的关键词是从其题名、层次标题和正文中选出来的,能反映论文主题概念的词或词组。学术界已约定利用主题概念词去检索最新发表的论文。作者发表论文不标注关键词或叙词,读者就检索不到,文献数据库就不会收录此类文章。关键词选用得是否恰当,关系到该文被检索的概率和该成果的利用率。     

关键词

关键词是科技论文的文献检索标识,是表达文献主题概念的自然语言词汇。科技论文的关键词是从其题名、层次标题和正文中选出来的,能反映论文主题概念的词或词组。学术界已约定利用主题概念词去检索最新发表的论文。作者发表论文不标注关键词或叙词,读者就检索不到,文献数据库就不会收录此类文章。关键词选用得是否恰当,关系到该文被检索的概率和该成果的利用率。     

关键词

关键词是科技论文的文献检索标识,是表达文献主题概念的自然语言词汇。科技论文的关键词是从其题名、层次标题和正文中选出来的,能反映论文主题概念的词或词组。学术界已约定利用主题概念词去检索最新发表的论文。作者发表论文不标注关键词或叙词,读者就检索不到,文献数据库就不会收录此类文章。关键词选用得是否恰当,关系到该文被检索的概率和该成果的利用率。     

关键词

关键词是科技论文的文献检索标识,是表达文献主题概念的自然语言词汇。科技论文的关键词是从其题名、层次标题和正文中选出来的,能反映论文主题概念的词或词组。学术界已约定利用主题概念词去检索最新发表的论文。作者发表论文不标注关键词或叙词,读者就检索不到,文献数据库就不会收录此类文章。关键词选用得是否恰当,关系到该文被检索的概率和该成果的利用率。     

关键词

关键词是科技论文的文献检索标识,是表达文献主题概念的自然语言词汇。科技论文的关键词是从其题名、层次标题和正文中选出来的,能反映论文主题概念的词或词组。学术界已约定利用主题概念词去检索最新发表的论文。作者发表论文不标注关键词或叙词,读者就检索不到,文献数据库就不会收录此类文章。关键词选用得是否恰当,关系到该文被检索的概率和该成果的利用率。     

关键词

关键词是科技论文的文献检索标识,是表达文献主题概念的自然语言词汇。科技论文的关键词是从其题名、层次标题和正文中选出来的,能反映论文主题概念的词或词组。学术界已约定利用主题概念词去检索最新发表的论文。作者发表论文不标注关键词或叙词,读者就检索不到,文献数据库就不会收录此类文章。关键词选用得是否恰当,关系到该文被检索的概率和该成果的利用率。     

Beyond Bar and Line Graphs: Time for a New Data Presentation Paradigm

Figures in scientific publications are critically important because they often show the data supporting key findings. Our systematic review of research articles published in top physiology journals (n = 703) suggests that, as scientists, we urgently need to change our practices for presenting continuous data in small sample size studies. Papers rarely included scatterplots, box plots, and histograms that allow readers to critically evaluate continuous data. Most papers presented continuous data in bar and line graphs. This is problematic, as many different data distributions can lead to the same bar or line graph. The full data may suggest different conclusions from the summary statistics. We recommend training investigators in data presentation, encouraging a more complete presentation of data, and changing journal editorial policies. Investigators can quickly make univariate scatterplots for small sample size studies using our Excel templates.     

Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular biology, e.g., genome sequencing; global alignment of multiple genomes; identifying siblings or discovery of dysregulated pathways. In almost all of these problems, there is the need for proving a hypothesis about certain property of an object that can be present if and only if it adopts some particular admissible structure (an NP-certificate) or be absent (no admissible structure), however, none of the standard approaches can discard the hypothesis when no solution can be found, since none can provide a proof that there is no admissible structure. This article presents an algorithm that introduces a novel type of solution method to “efficiently” solve the graph 3-coloring problem; an NP-complete problem. The proposed method provides certificates (proofs) in both cases: present or absent, so it is possible to accept or reject the hypothesis on the basis of a rigorous proof. It provides exact solutions and is polynomial-time (i.e., efficient) however parametric. The only requirement is sufficient computational power, which is controlled by the parameter . Nevertheless, here it is proved that the probability of requiring a value of to obtain a solution for a random graph decreases exponentially: , making tractable almost all problem instances. Thorough experimental analyses were performed. The algorithm was tested on random graphs, planar graphs and 4-regular planar graphs. The obtained experimental results are in accordance with the theoretical expected results.     

Statistical considerations for in vitro research: II — Data to presentation

Summary The paper is the second of two papers about statistical considerations that researchers should make while doing in vitro plant biology research. The first paper focused on aspects from developing a plan to do research through the collection of data. This paper continues with information about editing data, handling outliers, analyzing quantitative and qualitative data, comparing treatment means, preparing graphs and tables, and presenting results.     

ANDVisio: a new tool for graphic visualization and analysis of literature mined associative gene networks in the ANDSystem

The ANDVisio tool is designed to reconstruct and analyze associative gene networks in the earlier developed Associative Network Discovery System (ANDSystem) software package. The ANDSystem incorporates utilities for automated extraction of knowledge from Pubmed published scientific texts, analysis of factographic databases, also the ANDCell database containing information on molecular-genetic events retrieved from texts and databases. ANDVisio is a new user's interface to the ANDCell database stored in a remote server. ANDVisio provides graphic visualization, editing, search, also saving of associative gene networks in different formats resulting from user's request. The associative gene networks describe semantic relationships between molecular-genetic objects (proteins, genes, metabolites and others), biological processes, and diseases. ANDVisio is provided with various tools to support filtering by object types, relationships between objects and information sources; graph layout; search of the shortest pathway; cycles in graphs.     

Anatomy and physiology of a scientific paper

Writing and publishing a scientific paper in academic journals is a highly competitive, time-consuming stepwise process. The road to scientific writing and publication is rarely straightforward. Scientific writing has uniform format, which is perplexing for the novice science writers due to its inflexible anatomy (structure) and physiology (functions). Many obstacles are allied with the scientific writing path which can be minimized by applying some simple guidelines and practices. The scientific papers have an almost similar format but, original articles are divided into distinct sections and each segment contains a specific type of information. The basic anatomy of scientific papers is mainly comprised of the structure of the various components of a scientific paper, including title, abstract, introduction, methods, results, discussion, conclusion, acknowledgments and references. However, the physiology of a scientific paper is difficult to understand. Early career researchers and trainees may be less familiar with the various components of scientific papers. In this study, we applied an observational approach to describe the essential steps to facilitate the readers and writers to understand the basic characteristics, anatomy and physiology of writing the various sections of a scientific paper for an academic science journal.     

Graph theoretical methods for comparing phytosociological structures

This paper describes some methods that can be used to compare the phytosociological structure of plant communities using some graph theoretic properties of the directed graphs that represent them. In such a graph, the species are represented by points and the association of species A with species B is represented by a directed line segment going from B to A. Two communities can be compared using simple indices to measure the similarity of their species-lists (point similarity) and of the species associations in them (line similarity). A more sophisticated and informative measure of line similarity is the probability that, given the number of points shared by two graphs, they have at least as many lines in common as they are observed to have. A formula for calculating that probability is given here. The graphs of community structure can also be compared with respect to the homogeneity of the distribution of the lines among the points, a property related to the number of species that are important in determining the composition of the community. These techniques are illustrated using the graphs of the phytosociological structure of intertidal seaweed communities on the southeast coast of Nova Scotia.Nomenclature follows: South and Cardinal (1970)     

从编辑角度分析如何提高科技论文的质量

科技论文是科研成果交流和延续的载体,其质量是衡量个人、科研单位乃至国家学术水平的重要指标。文章根据科技论文的特点,结合多年从事科技期刊编辑工作的经验,从如何确保论文学术水平、选题方向和写作思路、杜绝学术不端、保护知识产权等方面进行了阐述,并就科技论文撰写过程中应该注意的几个问题：科技论文的层次结构、语言表达和写作水平、确保数据真实有效和可重复性、表格插图的规范使用、规范参考文献的著录格式,从编辑角度分析了如何提高科技论文的质量,以期为科技论文的撰写提供参考。     

Everything is connected: Graph neural networks

In many ways, graphs are the main modality of data we receive from nature. This is due to the fact that most of the patterns we see, both in natural and artificial systems, are elegantly representable using the language of graph structures. Prominent examples include molecules (represented as graphs of atoms and bonds), social networks and transportation networks. This potential has already been seen by key scientific and industrial groups, with already-impacted application areas including traffic forecasting, drug discovery, social network analysis and recommender systems. Further, some of the most successful domains of application for machine learning in previous years—images, text and speech processing—can be seen as special cases of graph representation learning, and consequently there has been significant exchange of information between these areas. The main aim of this short survey is to enable the reader to assimilate the key concepts in the area, and position graph representation learning in a proper context with related fields.     

Recent developments in quantitative graph theory: information inequalities for networks

In this article, we tackle a challenging problem in quantitative graph theory. We establish relations between graph entropy measures representing the structural information content of networks. In particular, we prove formal relations between quantitative network measures based on Shannon's entropy to study the relatedness of those measures. In order to establish such information inequalities for graphs, we focus on graph entropy measures based on information functionals. To prove such relations, we use known graph classes whose instances have been proven useful in various scientific areas. Our results extend the foregoing work on information inequalities for graphs.