Applied Mechanics and Materials Vols. 135-136

Abstract: Knowledge-intensive is a significant feature of the modern service-oriented industrial structure, and knowledge service is a main part of knowledge science. With research practices and accumulations in the field of tribological knowledge acquisition of turbine, automobile engines and other complex mechanical systems, construction of knowledge base and cooperation with enterprises in chain of “University-Industry-Research”, based on the understanding and experience of conceptual contents and features of tribology, knowledge service and resource unit and other concepts in the process of utilization, this paper studied the expression of modeling knowledge in the process of basic tribological knowledge service, construction of knowledge unit based on knowledge base and the driving force of knowledge acquisition and knowledge flow.

Abstract: Collecting the traffic accidents data of Han Ning highway in 2008, 2009 and 2010 three years, through two aspects of time and space to do statistical analysis and data mining of the traffic accidents of this highway. The result of the analysis is that accident rates have a certain relevance to time and space. From the time perspective, holidays and vacation days are accident high-risk days. From the space perspective, accident rate in the ascent and in the downhill are higher than on the straight road, cars go straight have a higher accident rate than in the corners, traffic accident rate in single-km single-lane tunnel is higher than outside the tunnel. Through the time and space distribution rule of the traffic accident, educating traffic participants follow the time and space distribution rule to restrict their behavior. Educating traffic managers obey the time and space distribution rule of traffic accident to adopt targeted management measures and engineering measures. Both of these two aspects have very important significance in reducing traffic accidents.

Abstract: The applications of Information and Communication Technology (ICT) on new health care service design have drawn vast interests from both academics and industry. In this study we systematically analyzed the needs of different levels for the elderly. From home care service to acute medical treatment at hospital, the selection of appropriate service mainly depends on the level of medication. We address some critical issues and new trends for designing new care service via ICT. The study finds that the availability of enhanced Internet access, innovative interactive tools and devices, integrated health information systems, as well as gene-based screening and diagnostic tools will be the main areas for new health service design which can be tailored for the needs of different service levels.

Abstract: Increasing interest has been devoted to Planning as Heuristic Search over the years. Intense research has focused on deriving fast and accurate heuristics for domain-independent planning. This paper reports on an extensive survey and analysis of research work related to heuristic derivation techniques for state space search. Survey results reveal that heuristic techniques have been extensively applied in many efficient planners and result in impressive performances. We extend the survey analysis to suggest promising avenues for future research in heuristic derivation and heuristic search techniques.

Abstract: Precision is selected unwillingly by human being when dealing with imprecise objects because of the limitation of human cognitive ability, which deviates from the substance of the processed object when it gets the feasible way of solution. Nowadays, in terms of the research in the Ontology and the Semantic Web, the time for the transformation from the “precise phase” to the “imprecise phase” is ripe. The interoperability among ontologies is seriously blocked by the heterogeneity of ontologies constructed under distributed environment. In this case, Ontology merging in the same domain is the most effective method to solve ontology heterogeneity. Firstly, the improved fuzziness and the R-improved roughness are respectively defined and verified as the more efficient measure way for the fuzziness and roughness. Secondly, a composite appraisal method of fuzzy-rough relevancy in combination of the fuzzy set theory and the rough set theory is proposed, which can serve as the basis of the inquiry and reasoning of the imprecise ontology, the transformation reference of the fuzzy roughness set or the rough fuzziness set. Lastly, by employing semantic bridge generator and conflict processor, a novel multiple-mapping-based imprecise ontology merging framework is proposed. The example verification reveals that both the imprecise ontology merging efficiency can be improved and the merging source imprecise ontologies into object imprecise ontology can be done automatically under the semantic web environment.

Abstract: By changing the constrain conditions of delivery time windows and vehicle capacities to objective function, A vehicle scheduling model was built up based on minimum length of total transportation distance, which included penalty function terms of time window and vehicle capacity constrains, and the model characteristics and application prospects was analyzed. A improved Genetic Algorithm program was put forward to solve the model, in which a chromosome coding suitable to describe delivery routes was designed, a suitable-degree function was proposed, and a reproduction operator, a crossover operator and a mutation operator were constructed. An example was given to demonstrate feasibility of the algorithm. The study indicates that the Algorithm has higher algorithm efficiency and can effectively solve vehicle scheduling problems of military distribution centers.

Abstract: Some improvements were put forward to modify the medical image reconstruction method based on MC algorithm. Computing redundancy, bad expansibility and “scalelike effect” lie in standard MC algorithm now. To solve the repeating calculation redundant problem, a suitable data structure was applied to seek cubes; by making segmentation result as the input of MC algorithm, the author eliminated the limitation of expansibility; by smoothing the normal vector of isosurfaces, this paper improved the image displaying effect. Finally, a special storage data structure was designed to save the non-manifold triangle model obtained from MC algorithm. The modification mentioned above has been realized in 3D reconstructing software-MedLG which was developed by authors’ institute and applied successfully in customized prostheses designing already. Moreover, The reconstructed model can also be used in biomechanics researching.

Abstract: On the basis of generalized fuzzy set theory, local contrast enhancement and human visual properties, a kind of adaptive enhancement technique presented. In this technique, first, a orthotropic Prewitt operator act on the original image, and then a normalization grads image can be obtained, second, we get the blurred image through a real-time low-pass filter such as Butterworth or Wavelet filter. At last we design a enhancement function based on a-tan function with the blurred image and grads image as input. And the gray image is translated to correspondent general membership function by using the a-tan mapping. The method can not only improve dynamic range, but also enhance the local contrast in the different gray levels with more image edges and details. Its efficiency and superiority are clarified by experiment.

Abstract: Mining functional modules with biological significance has attracted lots of attention recently. However, protein-protein interaction (PPI) network and other biological data generally bear uncertainties attributed to noise, incompleteness and inaccuracy in practice. In this paper, we focus on received PPI data with uncertainties to explore interesting protein complexes. Moreover, some novel conceptions extended from known graph conceptions are used to develop a depth-first algorithm to mine protein complexes in a simple uncertain graph. Our experiments take protein complexes from MIPS database as standard of accessing experimental results. Experiment results indicate that our algorithm has good performance in terms of coverage and precision. Experimental results are also assessed on Gene Ontology (GO) annotation, and the evaluation demonstrates proteins of our most acquired protein complexes show a high similarity. Finally, several experiments are taken to test the scalability of our algorithm. The result is also observed.

Abstract: Several studies have shown that the prediction of protein function using PPI data is promising. However, the PPI data generated from experiments are noisy, incomplete and inaccurate, which promotes to represent PPI dataset as an uncertain graph. In this paper, we proposed a novel algorithm to mine maximal dense subgraphs efficiently in uncertain PPI network. It adopted several techniques to achieve efficient mining. An extensive experimental evaluation on yeast PPI network demonstrated that our approach had good performance in terms of precision and efficiency.