Networks representing many complex systems in nature and society share some
common structural properties like heterogeneous degree distributions and strong
clustering. Recent research on network geometry has shown that those real
networks can be adequately modeled as random geometric graphs in hyperbolic
spaces. In this paper, we present a computer program to generate such graphs.
Besides real-world-like networks, the program can generate random graphs from
other well-known graph ensembles, such as the soft configuration model, random
geometric graphs on a circle, or Erd\H{o}s-R\'enyi random graphs. The
simulations show a good match between the expected values of different network
structural properties and the corresponding empirical values measured in
generated graphs, confirming the accurate behavior of the program.

本文介绍了一种计算机程序来生成具有超几何空间中随机几何图形模型的网络，并模拟其在不同网络结构特性方面的表现。

双曲线图生成器

Hyperbolic Graph Generator

This paper investigates the problems arising in the construction of a program
to play the game of contract bridge. These problems include both the difficulty
of solving the game's perfect information variant, and techniques needed to
address the fact that bridge is not, in fact, a perfect information game. GIB,
the program being described, involves five separate technical advances:
partition search, the practical application of Monte Carlo techniques to
realistic problems, a focus on achievable sets to solve problems inherent in
the Monte Carlo approach, an extension of alpha-beta pruning from total orders
to arbitrary distributive lattices, and the use of squeaky wheel optimization
to find approximately optimal solutions to cardplay problems. GIB is currently
believed to be of approximately expert caliber, and is currently the strongest
computer bridge program in the world.

本文探讨了构建一款玩合同桥牌的计算机程序所面临的问题，包括解决完全信息变体游戏的困难和应对合同桥牌并不是完全信息游戏的方法。GIB，即本程序，包含了五种技术形式：分区搜索、将蒙特卡洛技术实际应用于现实问题、侧重于可达解集来解决蒙特卡洛方法固有的问题、将 alpha-beta 剪枝从总序扩展到任意分配格、使用 squeaky wheel 优化方法解决卡牌问题的问题。GIB 目前被认为是大约专家水平，并且是当前世界上最强的电脑合同桥牌程序。