Route evaluation indexes of Changsha-Jishou freeway for protecting cultural heritages and natural environment

The highway construction inevitably may cause certain influence to the cultural heritage and the natural environment along the route, particularly in design stage; if the route selection is unreasonable, it will certainly impact the natural resource seriously along the route. On the contrary, good design can reasonably develop, use, protect and promote the value of cultural heritage and natural environment. Changsha to Jishou （Chang-Ji） freeway is one section of Changsha to Chongqing freeway, which is one of the eight big west channels as planned in China; two cities of Changde and Huaihua and one autonomous region of Xianxi in western Hunan province, along which the cultural heritage and the natural resource are rich, and the natural landscape is exquisite. This paper investigates and analyzes the natural resources along the route of Chang-Ji freeway, puts forward some protection design evaluation indexes for mountain area freeway by the thought of context sensitive design. At last, the paper introduces the effect of applying the indexes to select route of Chang-Ji freeway.

Kernel-Based Semantic Relation Detection and Classification via Enriched Parse Tree Structure

This paper proposes a tree kernel method of semantic relation detection and classification （RDC） between named entities. It resolves two critical problems in previous tree kernel methods of RDC. First, a new tree kernel is presented to better capture the inherent structural information in a parse tree by enabling the standard convolution tree kernel with context-sensitiveness and approximate matching of sub-trees. Second, an enriched parse tree structure is proposed to well derive necessary structural information, e.g., proper latent annotations, from a parse tree. Evaluation on the ACE RDC corpora shows that both the new tree kernel and the enriched parse tree structure contribute significantly to RDC and our tree kernel method much outperforms the state-of-the-art ones.

Precise slicing of interprocedural concurrent programs

Program slicing is an effective technique for an- alyzing concurrent programs. However, when a conventional closure-based slicing algorithm for sequential programs is ap- plied to a concurrent interprocedural program, the slice is usually imprecise owing to the intransitivity of interference dependence. Interference dependence arises when a state- ment uses a variable defined in another statement executed concurrently. In this study, we propose a global dependence analysis approach based on a program reachability graph, and construct a novel dependence graph called marking-statement dependence graph （MSDG）, in which each vertex is a 2-tuple of program state and statement. In contrast to the conven- tional program dependence graph where the vertex is a state- ment, the dependence relation in MSDG is transitive. When traversing MSDG, a precise slice will be obtained. To en- hance the slicing efficiency without loss of precision, our slic- ing algorithm adopts a hybrid strategy. The procedures con- taining interaction statements between threads are inlined and sliced by the slicing algorithm based on program reachability graphs while allowing other procedures to be sliced as se- quential programs. We have implemented our algorithm and three other representative slicing algorithms, and conducted an empirical study on concurrent Java programs. The exper- imental results show that our algorithm computes more pre- cise slices than the other algorithms. Using partial-order re- duction techniques, which are effective for reducing the size of a program reachability graph without loss of precision, ouralgorithm is optimized, thereby improving its performance to some extent.