An analysis of the most cited articles in software engineering journals—1999

Citations and related work are crucial in any research to position the work and to build on the work of others. A high citation count is an indication of the influence of specific articles. The importance of citations means that it is interesting to analyze which articles are cited the most. Such an analysis has been conducted using the ISI Web of Science to identify the most cited software engineering journal articles published in 1999. The objective of the analysis is to identify and list the articles that have influenced others the most as measured by citation count. An understanding of which research is viewed as most valuable to build upon may provide valuable insights into what research to focus on now and in the future. Based on the analysis, a list of the 20 most cited articles is presented here. The intention of the analysis is twofold. First, to actually show the most cited articles, and second, to invite the authors of the most cited articles in 1999 to contribute to a special issue of Information and Software Technology. Five invited authors have accepted the invitation and their articles are appearing in this special issue. Moreover, the research topics and methods of the most cited articles in 1999 are compared with those from the most cited articles in 1994 to provide a picture of similarities and differences between the years.     

An analysis of the most cited articles in software engineering journals - 2000

Citations and related work are crucial in any research to position the work and to build on the work of others. A high citation count is an indication of the influence of specific articles. The importance of citations means that it is interesting to analyze which articles are cited the most. Such an analysis has been conducted using the ISI Web of Science to identify the most cited software engineering journal articles published in 2000. The objective of the analysis is to identify and list the articles that have influenced others the most as measured by citation count. An understanding of which research is viewed by the research community as most valuable to build upon may provide valuable insights into what research to focus on now and in the future. Based on the analysis, a list of the 20 most cited articles is presented here. The intention of the analysis is twofold. First, to identify the most cited articles, and second, to invite the authors of the most cited articles in 2000 to contribute to a special issue of Information and Software Technology. Five authors have accepted the invitation and their articles appear in this special issue. Moreover, an analysis of the most cited software engineering journal articles in the last 20 years is presented. The presentation includes both the most cited articles in absolute numbers and the most cited articles when looking at the average number of citations per year. The article describing the SPIN model checker by G.J. Holzmann published in 1997 is first on both these lists.     

代码搜索与API推荐文献分析

代码搜索和API推荐算法能够帮助开发者有效实现编程任务。截至目前,研究者们发表了一系列相关文献。尽管一些学者对该研究领域的背景和研究现状进行了阐述,但是研究者对该领域中的一些基本领域知识还 缺乏了解,如最高产的作者、机构和国家,影响力较大的作者和文献,以及流行的热点研究等。借助经典的文献分析框架,在构建该研究领域文献数据仓库的基础上,首次对该领域的研究进行了基础文献分析和合作模式探索。 一方面,基础文献分析的结果表明,近几年越来越多的研究者开始关注该领域的研究,最高产的作者是Cristina Videira Lopes,University of California at Irvine是发表相关文献最多的机构,大部分文献来自美国,根据领域H因子计算得到的最有影响力的作者是Denys Poshyvanyk。另一方面,合作模式的分析结果显示,Tao Xie,Cristina Videira Lopes 和 Denys Poshyvany是该领域最活跃的三位作者,推荐算法性能的提升及其在软件工程任务中的应用是目前该领域最流行的研究主题。     

多媒体课件图像处理和图形加工技术

在多媒体课件创作中,准备多媒体素材是非常重要的环节。多媒体素材包括文字、图像、图形、动画、声音、影像等。在这几类素材中,图形图像是多媒体课件中应用最基本、最重要和最多的材料,其处理与加工也最为复杂,以下针对这一问题进行探讨。     

C#语言对城市最短路径搜索算法的优化

目前在GIS领域,对最短路径的研究和应用较多,其中运用最多的就是最短路径问题效率的研究。本文通过基于Dijkstra最短路径搜索,利用C#语言发挥该语言特点,MapInfo格式的地图文件为数据源,并在MapXtreme2004中实现,取得了较为满意的结果。同时也给出了相关的测试数据。     

C#语言对城市最短路径搜索算法的优化

目前在GIS领域，对最短路径的研究和应用较多，其中运用最多的就是最短路径问题效率的研究。本文通过基于Dijkstra最短路径搜索，利用C#语言发挥该语言特点，Maplnfo格式的地图文件为数据源，并在Map Xtreme2004中实现，取得了较为满意的结果。同时也给出了相关的测试数据。     

Graphs of linear clique-width at most 3

A graph has linear clique-width at most k if it has a clique-width expression using at most k labels such that every disjoint union operation has an operand which is a single vertex graph. We give the first characterisation of graphs of linear clique-width at most 3, and we give the first polynomial-time recognition algorithm for graphs of linear clique-width at most 3. In addition, we present new characterisations of graphs of linear clique-width at most 2. We also give a layout characterisation of graphs of bounded linear clique-width; a similar characterisation was independently shown by Gurski and by Lozin and Rautenbach.     

Multisim10在高频电子线路教学中的应用

高频电子线路是电子线路课程中最重要、最复杂的课程,也是最难教,最难学的课程。Multisim10是IIT公司最新的的电子线路仿真软件,可以根据电路结构和元器件参数对电路进行仿真分析,快速准确。利用multisim10对高频电路进行仿真分析,不但可以帮助学生更好的理解理论知识,而且有利于培养学生的分析能力和设计能力。     

An analysis of the most cited articles in software engineering journals – 2002

Citations and related work are crucial in any research to position the work and to build on the work of others. A high citation count is an indication of the influence of specific articles. The importance of citations means that it is interesting to analyze which articles are cited the most. Such an analysis has been conducted using the ISI Web of Science to identify the most cited software engineering journal articles published in 2002. The objective of the analysis is to identify and list the articles that have influenced others the most as measured by citation count. An understanding of which research is viewed by the research community as most valuable to build upon may provide valuable insights into what research to focus on now and in the future. Based on the analysis, a list of the 20 most cited articles is presented here. The intention of the analysis is twofold. First, to identify the most cited articles, and second, to invite the authors of the most cited articles in 2002 to contribute to a special section of Information and Software Technology. Six authors have accepted the invitation and their articles appear in this special section.     

Snort报文嗅探和报文解析实现的剖析

Snort是目前最受关注的一个代码开放网络入侵检测系统(NIDS)。报文嗅探是其最基本也是最重要的部分。该文分析了Snort报文嗅探器的工作方式和工作过程,对Snort报文嗅探和报文解析的实现进行了分析。     

基于相似性和新奇度从音乐中提取代表性摘录

提出了基于相似性和新奇度提取音乐代表性摘录的方法。最大化片段与整个作品的相似性来找到最相似的摘录，最大化片段的新奇度来找到意义最丰富的摘录，并把这两个参数结合起来寻找最具代表性的摘录，同时引入数学形态滤波对音频信号预处理，消除信号中的非主要分量。实验结果表明，该方法能够找到重要的最具代表性的摘录，并且对音乐源只作了很少的假设。     

计算机病毒的变迁

在网络飞速发展的今天,计算机病毒已成为当今在计算机以及计算机网络中流行最广泛、最活跃、最具破坏性的特制程序。因此,防毒、杀毒已成为计算机使用者必不可少的技能。     

Personalized recommendation based on review topics

The traditional collaborative filtering algorithm is a successful recommendation technology. The core idea of this algorithm is to calculate user or item similarity based on user ratings and then to predict ratings and recommend items based on similar users’ or similar items’ ratings. However, real applications face a problem of data sparsity because most users provide only a few ratings, such that the traditional collaborative filtering algorithm cannot produce satisfactory results. This paper proposes a new topic model-based similarity and two recommendation algorithms: user-based collaborative filtering with topic model algorithm (UCFTM, in this paper) and item-based collaborative filtering with topic model algorithm (ICFTM, in this paper). Each review is processed using the topic model to generate review topic allocations representing a user’s preference for a product’s different features. The UCFTM algorithm aggregates all topic allocations of reviews by the same user and calculates the user most valued features representing product features that the user most values. User similarity is calculated based on user most valued features, whereas ratings are predicted from similar users’ ratings. The ICFTM algorithm aggregates all topic allocations of reviews for the same product, and item most valued features representing the most valued features of the product are calculated. Item similarity is calculated based on item most valued features, whereas ratings are predicted from similar items’ ratings. Experiments on six data sets from Amazon indicate that when most users give only one review and one rating, our algorithms exhibit better prediction accuracy than other traditional collaborative filtering and state-of-the-art topic model-based recommendation algorithms.     

制造业如何实施ERP系统

国内企业对ERP认知上的落后是妨碍企业成功实施ERP的原因，如何提高中外企业实施ERP的满意度成为一个研究热点。文中使用最基础的软件，了解最基础的数据，规范最基础的流程，为企业真正实施ERP系统打下基础。给出了制造业如何了解和实施ERP信息管理系统的具体方案。并以某电子公司为实例，详细介绍了如何用Excel来实施ERP的销售、计划、库存、采购等部分模块，规范企业流程，为企业最终实施ERP做准备。     

基于社交网络分析的企业营销应用策略研究

随着全球社交网络的蓬勃发展,人们对社交网络越来越依赖。如何对社交网络用户、用户关系及用户与企业交互进行分析,使社交网络企业达到以最合适的方式向最合适的客户推荐最合适的产品信息的目的,成为企业必须重视的问题。     

Facing basic issues in office automation

A great deal has been written about office automation; most writers have backed their arguments with impressive statistics. But most of these statustics crumble under close scrutiny, and most basic concepts turn out to be poorly defined. This paper is an attempt to put at least parts of office automation on a rigorous academic footing.     

Automatic feature-queried bird identification system based on entropy and fuzzy similarity

Birdwatching is one of the very interesting hobbies and most important work. Many birdwatching assistant systems have been developed. However, most of them do not have any intelligence and cannot tolerate noises either. A bird identification system, BirdID is proposed and implemented. To identify birds, BirdID imitates bird experts to automatically direct birdwatchers to provide features. It also tries to list the most likely species after each feature is entered. In BirdID, entropy and fuzzy similarity are used to select most appropriate queried features and calculate similarity, respectively, which makes BirdID more intelligent and noise-tolerant. The experiments on a dataset with 106 species show that BirdID works well.     

Detecting the most unusual part of two- and three-dimensional digital images

The purpose of this paper is to introduce an algorithm that can detect the most unusual part of a digital image in probabilistic setting. The most unusual part of a given shape is defined as a part of the image that has the maximal distance to all non-intersecting shapes with the same form. The method is tested on two- and three-dimensional images and has shown very good results without any predefined model. A version of the method independent of the contrast of the image is considered and is found to be useful for finding the most unusual part (and the most similar part) of the image conditioned on given image.The results can be used to scan large image databases, as for example medical databases.     

A study of a jumping one-leg robot with two degrees of freedom

This study aims to improve human jumping capabilities from an engineering perspective by proposing a supportive device, as in a robot suit. The robot expresses a time-oriented optimal torque pattern, which is the most efficient jumping motion and timing, of each joint that can jump the highest using a motor. Then humans learn the most efficient jumping motion. To actualize the most efficient jumping motion, we observe human jumping motions and analytically calculate the most efficient torque patterns based on them. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008