Finding groups with maximum betweenness centrality

In this paper we consider the problem of identifying the most influential (or central) group of nodes (of some predefined size) in a network. Such a group has the largest value of betweenness centrality or one of its variants, for example, the length-scaled or the bounded-distance betweenness centralities. We demonstrate that this problem can be modelled as a mixed integer program (MIP) that can be solved for reasonably sized network instances using off-the-shelf MIP solvers. We also discuss interesting relations between the group betweenness and the bounded-distance betweenness centrality concepts. In particular, we exploit these relations in an algorithmic scheme to identify approximate solutions for the original problem of identifying the most central group of nodes. Furthermore, we generalize our approach for identification of not only the most central groups of nodes, but also central groups of graph elements that consists of either nodes or edges exclusively, or their combination according to some pre-specified criteria. If necessary, additional cohesiveness properties can also be enforced, for example, the targeted group should form a clique or a κ-club. Finally, we conduct extensive computational experiments with different types of real-life and synthetic network instances to show the effectiveness and flexibility of the proposed framework. Even more importantly, our experiments reveal some interesting insights into the properties of influential groups of graph elements modelled using the maximum betweenness centrality concept or one of its variations.     

Cooperative group optimization with ants (CGO-AS): Leverage optimization with mixed individual and social learning

We present CGO-AS, a generalized ant system (AS) implemented in the framework of cooperative group optimization (CGO), to show the leveraged optimization with a mixed individual and social learning. Ant colony is a simple yet efficient natural system for understanding the effects of primary intelligence on optimization. However, existing AS algorithms are mostly focusing on their capability of using social heuristic cues while ignoring their individual learning. CGO can integrate the advantages of a cooperative group and a low-level algorithm portfolio design, and the agents of CGO can explore both individual and social search. In CGO-AS, each ant (agent) is added with an individual memory, and is implemented with a novel search strategy to use individual and social cues in a controlled proportion. The presented CGO-AS is therefore especially useful in exposing the power of the mixed individual and social learning for improving optimization. The optimization performance is tested with instances of the traveling salesman problem (TSP). The results prove that a cooperative ant group using both individual and social learning obtains a better performance than the systems solely using either individual or social learning. The best performance is achieved under the condition when agents use individual memory as their primary information source, and simultaneously use social memory as their searching guidance. In comparison with existing AS systems, CGO-AS retains a faster learning speed toward those higher-quality solutions, especially in the later learning cycles. The leverage in optimization by CGO-AS is highly possible due to its inherent feature of adaptively maintaining the population diversity in the individual memory of agents, and of accelerating the learning process with accumulated knowledge in the social memory.     

地方高校本科计算机专业数据库系统课程体系建设

针对地方高校本科计算机专业数据库课程教学进行研究,首先详细分析了地方高校应用型本科该专业课程的培养目标;其次通过设置数据库课程群和课程链,制定了数据库相关系列课程的体系结构;最后对地方高校应用型本科计算机专业数据库系列课程的教学方法和考核方式进行了探讨.     

基于Internet网的集成化供应链管理协同环境

本文试从企业集团化生产管理方式的特点与要求出发,通过Internet网和WWW（W orld Wide Web）来实现企业集团供应链协同和信息集成,提出基于WWW的供应链集成支撑环 境,它的主要特征是为管理决策者进行讨论、分析提供文字、声音、图象以及模拟分析工具 的会议式协同环境．     

A Novel Approach to Solve the FMS Formation Problem

We propose in this paper a genetic algorithm (GA)-based approach to solve the Flexible Manufacturing System (FMS) formation problem. First, we divide the unity of machines into small groups or cells using Group Technology (GT). And an option for considering the minimization of workload variation between cells is included. Then the implementation is done using GA. When using GA, the designer is allowed to specify the number of cells and impose lower and upper bounds on cell size. This makes the GA scheme flexible for solving the FMS formation problems.     

From insect to Internet: Situated control for networked robot teams

Ant-like systems take advantage of agents' situatedness to reduce or eliminate the need for centralized control or global knowledge. This reduces the need for complexity of individuals and leads to robust, scalable systems. Such insect-inspired situated approaches have proven effective both for task performance and task allocation. The desire for general, principled techniques for situated interaction has led us to study the exploitation of abstract situatedness – situatedness in non-physical environments. The port-arbitrated behavior-based control approach provides a well-structured abstract behavior space in which agents can participate in situated interaction. We focus on the problem of role assumption, distributed task allocation in which each agent selects its own task-performing role. This paper details our general, principled Broadcast of Local Eligibility (BLE) technique for role-assumption in such behavior-space-situated systems, and provides experimental results from the CMOMMT target-tracking task. This revised version was published online in August 2006 with corrections to the Cover Date.     

Numerically Invariant Signature Curves

Corrected versions of the numerically invariant expressions for the affine and Euclidean signature of a planar curve introduced by Calabi et al. in (Int. J. Comput. Vision, 26: 107–135, 1998) are presented. The new formulas are valid for fine but otherwise arbitrary partitions of the curve. We also give numerically invariant expressions for the four differential invariants parameterizing the three dimensional version of the Euclidean signature curve, namely the curvature, the torsion and their derivatives with respect to arc length.     

WINDOWS中DDEML创建程序组与程序项的方法

在安装硬件设备和相应应用程序时,在WINDOWS中创建程序组和程序项有时是非常必要的。本文介绍运用DDEML在WINDOWS中创建程序组和程序项的具体实用技术。可供读者参考。     

组播技术在数字视音频监控系统中的应用

IP组播技术是九十年代初发展起来的网络传输新技术。本文主要介绍了组播技术的基本原理,描述其机制与特点,并具体说明了组播技术在数字视音频监控系统中的应用方法和实现过程。