圆环面上纤维轨迹的计算机辅助设计

曲面上的曲线造型是计算机图形领域的一个新的研究热点,而且它们在纤维织物编织,三维服装裁剪以及复合材料的纤维缠绕轨迹设计等领域有十分广泛的应用,为了解决圆环面上纤维轨迹的计算机辅助设计问题,研究了圆环面上测地线的解析解以及拟测地线数值求解的具体算法并给出了其表达式,测地线是曲面上两点之间最短距离的曲线段,在一般曲面上没有解析解,但是在圆环面上却可求出其精确的解析解,但在曲面的边沿部分,测地线因不能实现自然的折返过渡,于是拟测地线就被引进到曲面上的曲线造型设计之中,在拟测地线分析研究基础上,给出了圆环面上拟测地线的方程及数值解法,通过其在一个实例中的应用结果证明,该方法可获得织物的纺织条纹以及缠绕物体的纤维轨迹。     

Primal or dual: which promises faster spatiotemporal search?

The existing predictive spatiotemporal indexes can be classified into two categories, depending on whether they are based on the primal or dual methodology. Although we have gained considerable empirical knowledge about various access methods, currently there is only limited understanding on the theoretical characteristics of the two methodologies. In fact, the experimental results in different papers even contradict each other, regarding the relative superiority of the primal and dual techniques. This paper presents a careful study on the query performance of general primal and dual indexes, and reveals important insight into the behavior of each technique. In particular, we mathematically establish the conditions that determine the superiority of each methodology, and provide rigorous justification for well-known observations that have not been properly explained in the literature. Our analytical findings also resolve the contradiction in the experiments of previous work.     

A grid-based node split algorithm for managing current location data of moving objects

There is rapidly increasing interest in Location Based Service (LBS) which utilizes location data of moving objects. To efficiently manage the huge amounts of location data in LBS, the GALIS (Gracefully Aging Location Information System) architecture, a cluster-based distributed computing architecture, is proposed. The GALIS using the non-uniform 2-level grid algorithm performs load balancing and indexing for nodes. However, the non-uniform 2-level grid algorithm has a problem creating unnecessary nodes when moving objects are crowded in a certain region. Therefore, a new node split algorithm, which is more efficient for various distribution of moving objects, is proposed in this paper. Because the algorithm proposed in this paper considers spatial distribution for the current location of moving objects, it can perform efficient load balancing without creating unnecessary nodes even when moving objects are congested in a certain region. Besides, the various data distribution configuration for moving objects has been experimented by implementing node split simulators and it’s been verified that the proposed algorithm can split nodes more efficiently than the existing algorithm.

d-Dimensional parametric models for dynamic animation of deformable objects

This paper introduces an accurate, efficient, and unified engine dedicated to dynamic animation of d-dimensional deformable objects. The objects are modelled as d-dimensional manifolds defined as functional combinations of a mesh of 3D control points, weighted by parametric blending functions. This model ensures that, at each time step, the object shape conforms to its manifold definitions. The object motion is deduced from the control points dynamic animation. In fact, control points should be viewed as the degrees of freedom of the continuous object. The chosen dynamic equations (Lagrangian formalism) reflect this generic modelling scheme and yield an exact and computationally efficient linear system.     

基于水管理对象的数字流域顶层设计技术方法研究

水利信息化是实现水利现代化的基础和重要标志。以水管理对象为基础,利用现代信息技术构造数字流域,集中管理流域内的水事问题,是实现流域现代化管理的有效途径。从数字流域体系架构、水管理对象构造及全息化描述、基础平台构建、业务系统的构件化开发、数字功能流域等方面详细介绍了基于水管理对象的数字流域构造技术方法。     

Survey on model-based manipulation planning of deformable objects

A systematic overview on the subject of model-based manipulation planning of deformable objects is presented. Existing modeling techniques of volumetric, planar and linear deformable objects are described, emphasizing the different types of deformation. Planning strategies are categorized according to the type of manipulation goal: path planning, folding/unfolding, topology modifications and assembly. Most current contributions fit naturally into these categories, and thus the presented algorithms constitute an adequate basis for future developments.     

CONTEXTUAL LANGUAGE MODELS FOR RANKING ANSWERS TO NATURAL LANGUAGE DEFINITION QUESTIONS

Question–answering systems make good use of knowledge bases (KBs, e.g., Wikipedia) for responding to definition queries. Typically, systems extract relevant facts from articles regarding the question across KBs, and then they are projected into the candidate answers. However, studies have shown that the performance of this kind of method suddenly drops, whenever KBs supply narrow coverage. This work describes a new approach to deal with this problem by constructing context models for scoring candidate answers, which are, more precisely, statistical n‐gram language models inferred from lexicalized dependency paths extracted from Wikipedia abstracts. Unlike state‐of‐the‐art approaches, context models are created by capturing the semantics of candidate answers (e.g., “novel,”“singer,”“coach,” and “city”). This work is extended by investigating the impact on context models of extra linguistic knowledge such as part‐of‐speech tagging and named‐entity recognition. Results showed the effectiveness of context models as n‐gram lexicalized dependency paths and promising context indicators for the presence of definitions in natural language texts.     

The transformation and analysis of networks by means of computer algorithms

This paper describes the analysis of networks, using digital computers. If the nodes of the network are assigned alpha-numeric symbols, the network is said to be alpha-numerical. The paper describes transforma-tions of non-directed alpha-numeric networks: edges are separated and rearranged so as to form new networks. The results of these investiga-tions lead to the formulation of algorithms, which have been programmed and solved on a ZUSEZ 22 digital computer. Networks are stored as incidence matrices and transformed by matrix operations. Transforma-tions which are effected by separation and rejoining of at most two edges, are called elementary transformations. It will be shown that every struc-tural transformation can be represented as a logical consequence of elementary transformations. Our investigations permit the following ex-positions:

Alpha-numerical networks can be interpreted as chemical structure formulae; transformations can be interpreted as chemical reactions.     

New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems

Multi-objective shortest path problem (MOSPP) is an active area of research because of its application in a large number of systems such as transportation systems, communication systems, power transmission systems, pipeline distribution systems of water, gas, blood and drainage, neural decision systems, production planning and project planning. In these networks it becomes necessary to find the best path from one node to a specified or all other nodes. The computational complexity of the existing algorithms in the literature to compute all Pareto minimum paths from a specified source node to all other nodes in an MOSPP is of exponential order in the worst case. Instead of generating all the values of the Pareto minimum paths in exponential time, we propose an algorithm to find a set of values of the Pareto minimum paths in polynomial time, which is very significant in many contexts. If an MOSPP of a network is having negative cycle, all the existing algorithm only indicate the existence of the negative cycle, that too after exponential number of operations. However, applying the proposed algorithm, we can find a set of Pareto minimum paths of any MOSPP of a network even if it contains negative cycles. The proposed algorithm is illustrated with examples.