To enhance the serviceability of steel bridge deck pavement(SBDP)in high-temperature and rainy regions,a concept of rigid bottom and flexible top was summarized using engineering practices,which led to the proposal of...To enhance the serviceability of steel bridge deck pavement(SBDP)in high-temperature and rainy regions,a concept of rigid bottom and flexible top was summarized using engineering practices,which led to the proposal of a three-layer ultra-high-performance pavement(UHPP).The high-temperature rutting resistance and wet-weather skid resistance of UHPP were evaluated through composite structure tests.The internal temperature distribution within the pavement under typical high-temperature conditions was analyzed using a temperature field model.Additionally,a temperature-stress coupling model was employed to investigate the key load positions and stress response characteristics of the UHPP.The results indicate that compared with the traditional guss asphalt+stone mastic asphalt structure,the dynamic stability of the UHPP composite structure can be improved by up to 20.4%.Even under cyclic loading,UHPP still exhibits superior surface skid resistance compared to two traditional SBDPs.The thickness composition of UHPP significantly impacts its rutting resistance and skid resistance.UHPP exhibits relatively low tensile stress but higher shear stress levels,with the highest shear stress occurring between the UHPP and the steel plate.This suggests that the potential risk of damage for UHPP primarily lies within the interlayer of the pavement.Based on engineering examples,introducing interlayer gravel and optimizing the amount of bonding layer are advised to ensure that UHPP possesses sufficient interlayer shear resistance.展开更多
In order to solve the semantic irreconcilable problems caused by contextual differences during the process of ontology integration, a context-driven reconciliation mechanism is proposed. The mechanism is based on the ...In order to solve the semantic irreconcilable problems caused by contextual differences during the process of ontology integration, a context-driven reconciliation mechanism is proposed. The mechanism is based on the previous work about a context-based formalism-Context-SHOIQ （D ＋ ） DL, which is used for explicitly representing context of ontology by adopting the description logic and the category theory. The formalism is extended by adding four migration rules （InclusionRule, SelectionRule, PreferenceRule, and MappingRule）, that are used to specify what should be imported into the IntegrativeContext, and three related contextual integration operations of increasing interoperability （import, partial reconciliation, and full reconciliation）. While not exhaustive, the mechanism is sufficient for solving the five types of semantic irreconcilable problems that are discussed, and favors integration of ontologies from one context to another.展开更多
The related work to reveal the primary characteristics of roles underlying the existing approaches is analyzed. Then, it is demonstrated that the representation of roles is rather complex and error-prone in these appr...The related work to reveal the primary characteristics of roles underlying the existing approaches is analyzed. Then, it is demonstrated that the representation of roles is rather complex and error-prone in these approaches. Especially, the constraints among roles in the same context cannot be expressed by the current web ontology language （OWL）. To solve these problems, a novel model of role is presented and a corresponding ontology language is provided for representing this model. The key idea underlying the solution is that a role should be regarded as an element of a certain context and a context as a structured thing which is comprised of some internal elements. The structure of context possesses inherent modularity and local semantics, whereby the representation of roles and context is significantly simplified.展开更多
Since the specifications of most of the existing context-sensitive graph grammars tend to be either too intricate or not intuitive, a novel context-sensitive graph grammar formalism, called context-attributed graph gr...Since the specifications of most of the existing context-sensitive graph grammars tend to be either too intricate or not intuitive, a novel context-sensitive graph grammar formalism, called context-attributed graph grammar（CAGG）, is proposed. In order to resolve the embedding problem, context information of a graph production in the CAGG is represented in the form of context attributes of the nodes involved. Moreover, several properties of a set of confluent CAGG productions are characterized, and then an algorithm based on them is developed to decide whether or not a set of productions is confluent, which provides the foundation for the design of efficient parsing algorithms. It can also be shown through the comparison of CAGG with several typical context-sensitive graph grammars that CAGG is more succinct and, at the same time, more intuitive than the others, making it more suitably and effortlessly applicable to the specification of visual languages.展开更多
A context memory model and an approach for context query and association discovery are proposed. The context query is based on a resource description framework （RDF） dataset and SPARQL language. To discover collabor...A context memory model and an approach for context query and association discovery are proposed. The context query is based on a resource description framework （RDF） dataset and SPARQL language. To discover collaborative associations, an approach of transforming RDF named graphs into ＂context graph＂ is proposed. First, the definitions of the importance of the nodes and the weight assignment for the ＂context graph＂ are given. Secondly, the implementation of a spread activation algorithm based on ＂context graph＂ is proposed. An infrastructure is also built up in the collaborative context space （CCS） system to support context memory and knowledge discovery in a collaborative environment.展开更多
A two-phase monadic approach is presented for monadically slicing programs with procedures. In the monadic slice algorithm for interprocedural programs, phase 1 initializes the slice table of formal parameters in a pr...A two-phase monadic approach is presented for monadically slicing programs with procedures. In the monadic slice algorithm for interprocedural programs, phase 1 initializes the slice table of formal parameters in a procedure with the given labels, and then captures the callees＇ influence on callers when analyzing call statements. Phase 2 captures the callees＇ dependence on callers by replacing all given labels appearing in the corresponding sets of formal parameters. By the introduction of given labels, this slice method can obtain similar summary information in system-dependence-graph（SDG）-based algorithms for addressing the calling-context problem. With the use of the slice monad transformer, this monadic slicing approach achieves a high level of modularity and flexibility. It shows that the monadic interprocedural algorithm has less complexity and it is not less precise than SDG algorithms.展开更多
The existence of solutions for singular nonlinear two point boundary value problems subject to Sturm Liouville boundary conditions with p Laplacian operators is studied by the method of upper and lower solution...The existence of solutions for singular nonlinear two point boundary value problems subject to Sturm Liouville boundary conditions with p Laplacian operators is studied by the method of upper and lower solutions. The proof is based on an application of Schauder’s fixed point theorem to a modified problem whose solutions are that of the original one. At the same time, Arzela Ascoli theorem is used to prove that the defined operator N is a compact map.展开更多
基金The National Natural Science Foundation of China(No.51878167)the Postgraduate Research and Practice Innovation Program of Jiangsu Province(No.KYCX23_0300).
文摘To enhance the serviceability of steel bridge deck pavement(SBDP)in high-temperature and rainy regions,a concept of rigid bottom and flexible top was summarized using engineering practices,which led to the proposal of a three-layer ultra-high-performance pavement(UHPP).The high-temperature rutting resistance and wet-weather skid resistance of UHPP were evaluated through composite structure tests.The internal temperature distribution within the pavement under typical high-temperature conditions was analyzed using a temperature field model.Additionally,a temperature-stress coupling model was employed to investigate the key load positions and stress response characteristics of the UHPP.The results indicate that compared with the traditional guss asphalt+stone mastic asphalt structure,the dynamic stability of the UHPP composite structure can be improved by up to 20.4%.Even under cyclic loading,UHPP still exhibits superior surface skid resistance compared to two traditional SBDPs.The thickness composition of UHPP significantly impacts its rutting resistance and skid resistance.UHPP exhibits relatively low tensile stress but higher shear stress levels,with the highest shear stress occurring between the UHPP and the steel plate.This suggests that the potential risk of damage for UHPP primarily lies within the interlayer of the pavement.Based on engineering examples,introducing interlayer gravel and optimizing the amount of bonding layer are advised to ensure that UHPP possesses sufficient interlayer shear resistance.
文摘In order to solve the semantic irreconcilable problems caused by contextual differences during the process of ontology integration, a context-driven reconciliation mechanism is proposed. The mechanism is based on the previous work about a context-based formalism-Context-SHOIQ （D ＋ ） DL, which is used for explicitly representing context of ontology by adopting the description logic and the category theory. The formalism is extended by adding four migration rules （InclusionRule, SelectionRule, PreferenceRule, and MappingRule）, that are used to specify what should be imported into the IntegrativeContext, and three related contextual integration operations of increasing interoperability （import, partial reconciliation, and full reconciliation）. While not exhaustive, the mechanism is sufficient for solving the five types of semantic irreconcilable problems that are discussed, and favors integration of ontologies from one context to another.
基金The National Natural Science Foundation of China(No.90612009,60403050),the National Basic Research Program of China (973Program)(No.2005CB321802).
文摘The related work to reveal the primary characteristics of roles underlying the existing approaches is analyzed. Then, it is demonstrated that the representation of roles is rather complex and error-prone in these approaches. Especially, the constraints among roles in the same context cannot be expressed by the current web ontology language （OWL）. To solve these problems, a novel model of role is presented and a corresponding ontology language is provided for representing this model. The key idea underlying the solution is that a role should be regarded as an element of a certain context and a context as a structured thing which is comprised of some internal elements. The structure of context possesses inherent modularity and local semantics, whereby the representation of roles and context is significantly simplified.
基金The National Natural Science Foundation of China(No.60571048,60673186,60736015)the National High Technology Researchand Development Program of China(863Program)(No.2007AA01Z178)
文摘Since the specifications of most of the existing context-sensitive graph grammars tend to be either too intricate or not intuitive, a novel context-sensitive graph grammar formalism, called context-attributed graph grammar（CAGG）, is proposed. In order to resolve the embedding problem, context information of a graph production in the CAGG is represented in the form of context attributes of the nodes involved. Moreover, several properties of a set of confluent CAGG productions are characterized, and then an algorithm based on them is developed to decide whether or not a set of productions is confluent, which provides the foundation for the design of efficient parsing algorithms. It can also be shown through the comparison of CAGG with several typical context-sensitive graph grammars that CAGG is more succinct and, at the same time, more intuitive than the others, making it more suitably and effortlessly applicable to the specification of visual languages.
基金The National Natural Science Foundation of China(No.90412009).
文摘A context memory model and an approach for context query and association discovery are proposed. The context query is based on a resource description framework （RDF） dataset and SPARQL language. To discover collaborative associations, an approach of transforming RDF named graphs into ＂context graph＂ is proposed. First, the definitions of the importance of the nodes and the weight assignment for the ＂context graph＂ are given. Secondly, the implementation of a spread activation algorithm based on ＂context graph＂ is proposed. An infrastructure is also built up in the collaborative context space （CCS） system to support context memory and knowledge discovery in a collaborative environment.
基金The National Outstanding Young Scientist Foundation by NSFC(No.60703086,60503020)
文摘A two-phase monadic approach is presented for monadically slicing programs with procedures. In the monadic slice algorithm for interprocedural programs, phase 1 initializes the slice table of formal parameters in a procedure with the given labels, and then captures the callees＇ influence on callers when analyzing call statements. Phase 2 captures the callees＇ dependence on callers by replacing all given labels appearing in the corresponding sets of formal parameters. By the introduction of given labels, this slice method can obtain similar summary information in system-dependence-graph（SDG）-based algorithms for addressing the calling-context problem. With the use of the slice monad transformer, this monadic slicing approach achieves a high level of modularity and flexibility. It shows that the monadic interprocedural algorithm has less complexity and it is not less precise than SDG algorithms.
文摘The existence of solutions for singular nonlinear two point boundary value problems subject to Sturm Liouville boundary conditions with p Laplacian operators is studied by the method of upper and lower solutions. The proof is based on an application of Schauder’s fixed point theorem to a modified problem whose solutions are that of the original one. At the same time, Arzela Ascoli theorem is used to prove that the defined operator N is a compact map.
