A systematic mapping study on best practices for domain-specific modeling

Model-driven software development comes in different styles. While standard-based approaches leverage existing language standards (e.g., UML), tooling, and development processes, domain-specific modeling (DSM) requires languages and tool support to be created prior to the actual software development. The design, implementation, and testing of languages and tool support require a wide spectrum of methods and techniques which introduce complexity and new challenges. To tackle these DSM-specific challenges, best practices have been collected from various application domains and published in literature to guide the development and application of DSM solutions. It is the goal of this paper to identify studies reporting best practices on domain-specific modeling. Moreover, a systematic and comprehensive compilation of best practices should act as a starting point to identify literature that facilitates industrial adoption of DSM. To search for literature and classify identified studies, we conduct a systematic mapping study (SMS). Furthermore, we perform an in-depth analysis of the identified studies to answer how practices overlap, complement, or contradict each other. The systematic search resulted in 21 studies reporting 321 best practices. From these 321 practices, we compiled 192 unique best practices. We found that the DSM community created a substantial corpus of best practices for DSM. The large majority of practices (75%) are only reported once. The top best practices by number of reports contain only practices that are reported at least four times. However, the frequency of reports does not necessarily imply a high importance of practice, as the application of practices is always context specific.     

Empirical analysis of the evolution of a taxonomy for best practices

Taxonomies play an increasingly role in knowledge management, providing the basis on which to find and communicate knowledge, information and metrics. However, knowledge continues to evolve over time. As a result, taxonomies also need to continue to evolve.Two different evolved versions of a taxonomy for best practices, each based on the same original taxonomy were analyzed. This research investigated empirical approaches to trace the changes in the original taxonomy. In so doing, an approach using empirical findings to monitoring and anticipating taxonomy change is initiated. There were a number of findings, including a tendency to evolve to greater complexity.     

Performance characterization in computer vision: A guide to best practices

It is frequently remarked that designers of computer vision algorithms and systems cannot reliably predict how algorithms will respond to new problems. A variety of reasons have been given for this situation and a variety of remedies prescribed in literature. Most of these involve, in some way, paying greater attention to the domain of the problem and to performing detailed empirical analysis. The goal of this paper is to review what we see as current best practices in these areas and also suggest refinements that may benefit the field of computer vision. A distinction is made between the historical emphasis on algorithmic novelty and the increasing importance of validation on particular data sets and problems.     

Hybrid genetic algorithm and association rules for mining workflow best practices

Business workflow analysis has become crucial in strategizing how to create competitive edge. Consequently, deriving a series of positively correlated association rules from workflows is essential to identify strong relationships among key business activities. These rules can subsequently, serve as best practices. We have addressed this problem by hybridizing genetic algorithm with association rules. First, we used correlation to replace support-confidence in genetic algorithm to enable dynamic data-driven determination of support and confidence, i.e., use correlation to optimize the derivation of positively correlated association rules. Second, we used correlation as fitness function to support upward closure in association rules (hitherto, association rules support only downward closure). The ability to support upward closure allows derivation of the most specific association rules (business model) from less specific association rules (business meta-model) and generic association rules (reference meta-model). Downward closure allows the opposite. Upward-downward closures allow the manager to drill-down and analyze based on the degree of dependency among business activities. Subsequently, association rules can be used to describe best practices at the model, meta-model and reference meta-model levels with the most general positively dependent association rules as reference meta-model. Experiments are based on an online hotel reservation system.     

探索软件开发过程的CMM最佳实践方法

基于中、小型规模的软件开发特点,通过融合多种软件过程开发实践,保证快速、合理、低代价和清晰的软件开发过程控制基础上,作者基于工程实践的总结和归纳,提出一种基于组件构建软件系统的CMM和RUP的有序过程控制的最佳实践方法,该方法具有清晰过程控制、可被重复检验和理解,允许在软件过程中进行适应性的自我调整和完善。通过实际案例的统计和规律性分析,证明该种软件开发过程的最佳实践方法在实际的工程项目管理中具有较强的工程指导意义和现实参考价值。     

Usability principles and best practices for the user interface design of complex 3D architectural design and engineering tools

This study proposes usability principles for the user interfaces (UI) design of complex 3D parametric architectural design and engineering tools. Numerous usability principles have been developed for generic desktop or web applications. The authors tried to apply existing usability principles as guidelines for evaluating complex 3D design and engineering applications. However, the principles were too generic and high-level to be useful as design or evaluation guidelines. The authors, all with more than 10 or 30 years of experience with various CAD systems, selected and reviewed 10 state-of-the-art 3D parametric design and engineering applications and captured what they thought were best practices, as screenshots and videos. The collected best practices were reviewed through a series of discussion sessions. During the discussion sessions, UI design principles underlying the collected best practices were characterized in the line of existing UI principles. Based on the best practices and the derived common UI principles, a new set of refined and detailed UI principles were proposed for improving and evaluating 3D parametric engineering design tools in the future.     

新兴高校校园网综合防雷设计方案分析

高校校园网建设大都投入巨大,新兴高校尤其是地处南方雷暴多发地区的高校都面临着一个如何进行防雷的问题。本文针对雷电产生的原因、雷电对人以及对建筑物和设备的危害进行了详细的描述,通过对宜春学院校园网防雷项目中碰到的问题及解决办法的分析,给出了在新兴高校校园网建设中如何进行防雷设计的有益思路。     

Note on the best order for queues in series

Some remarks are made on the best order for queues in series in the light of investigations made by the authors.     

A solution to the next best view problem for automated surfaceacquisition

A solution to the “next best view” (NBV) problem for automated surface acquisition is presented. The NBV problem is to determine which areas of a scanner's viewing volume need to be scanned to sample all of the visible surfaces of an a priori unknown object and where to position/control the scanner to sample them. A method for determining the unscanned areas of the viewing volume is presented. In addition, a novel representation, positional space, is presented which facilitates a solution to the NBV problem by representing what must be and what can be scanned in a single data structure. The number of costly computations needed to determine if an area of the viewing volume would be occluded from some scanning position is decoupled from the number of positions considered for the NBV, thus reducing the computational cost of choosing one. An automated surface acquisition systems designed to scan all visible surfaces of an a priori unknown object is demonstrated on real objects     

Using DEA to find the best partner for a horizontal cooperation

In this paper Data Envelopment Analysis is used to select among different potential partners to form a joint venture which is the one that best fits the strategic goal of a horizontal cooperation. Since each potential partner has a different technology the one whose technology better complements ours is the one that will bring the greatest synergy to the technology of the joint venture. Models for the cases that the joint venture is planning to open one or several facilities are presented. A priori and ex-post measures of synergy between the partners are proposed. Also, a simple way of sharing the costs of the horizontal cooperation based on cooperative game theory is presented. The proposed approach is quite flexible and can be extended to include multiple-partner joint ventures as well as a multi-period planning horizon.     

Looking for the best software engineers

The author maintains that software managers find staffing decisions difficult because they have never been trained to be successful in the interview and selection process. He reports the results of a series of informal interviews with about 30 managers and engineers regarding the traits software managers look for in the people they have working for them and the characteristics they want to see in job candidates (external or internal) for software-engineering and technician positions on their project teams     

Regret to the best vs. regret to the average

We study online regret minimization algorithms in an experts setting. In this setting, the algorithm chooses a distribution over experts at each time step and receives a gain that is a weighted average of the experts’ instantaneous gains. We consider a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the average of all experts, the regret to any given fixed mixture of experts, or the regret to the worst expert. This study leads both to new understanding of the limitations of existing no-regret algorithms, and to new algorithms with novel performance guarantees. More specifically, we show that any algorithm that achieves only $O(\sqrt{T})$ cumulative regret to the best expert on a sequence of T trials must, in the worst case, suffer regret $\varOmega(\sqrt{T})$ to the average, and that for a wide class of update rules that includes many existing no-regret algorithms (such as Exponential Weights and Follow the Perturbed Leader), the product of the regret to the best and the regret to the average is, in the worst case, Ω(T). We then describe and analyze two alternate new algorithms that both achieve cumulative regret only $O(\sqrt{T}\log T)$ to the best expert and have only constant regret to any given fixed distribution over experts (that is, with no dependence on either T or the number of experts N). The key to the first algorithm is the gradual increase in the “aggressiveness” of updates in response to observed divergences in expert performances. The second algorithm is a simple twist on standard exponential-update algorithms.     

一种基于防汽车追尾的车载测距安全预警装置的研制

介绍了激光雷达测距原理，进而引入到测距系统中，构建了一车载测距预警系统，分析了系统核心模块的组成和基本原理并给出了程序框图。当车间距达到阈值时及时发出声光与语音信号，提醒司机注意，避免追尾事故的发生。     

How to avoid the derivation of redundant clauses in reasoning systems

This paper addresses two problems concerning the issue of redundant information in resolution based reasoning systems. The first one deals with the question how the derivation of redundant clauses, such as duplicates or instances of already retained clauses, can be substantially reduced. The second one asks for a criterion to decide, which clauses need not be tested for redundancy. We consider a particular kind of redundancy, which we call ancestor subsumption, that is the subsumption of a resolvent by one of its ancestors. It will be shown that the occurrence of cyclic clause sets, which roughly correspond to sets of logical equivalences, accounts for ancestor subsumed resolvents. Moreover, two techniques will be given to cope with the problems caused by such cyclic structures. The first technique, called literal demodulation, uses logical equivalences as rewrite rules, the second one employs a particular kind of theory resolution.     

粒子群算法在多船避碰决策中的应用

多船避碰是船舶避碰中最复杂的问题,也是船舶自动避碰方法研究中的难点之一.对许多学者的多船避碰研究进行分析,将最近会遇距离DCPA、最近会遇时间TCPA、两船距离、相对距离、本船转向角等作为基本评判参数,利用雷达进行一系列的观测,获得避让要素,建立碰撞危险度的评价模型.应用粒子群算法找出最优的解决方案,得出最优转向避碰幅度解.该方法不仅有助于解决多船会遇情况下的本船最优转向角度值,而且也有助于多船避碰决策系统的智能化设计与开发.