Search

SF6 gas has excellent dielectric strength, but it causes global warming about 23900 times more than CO2 which is the main cause of global warming. This shows necessity of the environment friendly dielectric gas which can replace SF6. In this dissertation, we made the 3 phase unity bundle operation tank type experimental switch to do the impulse withstand voltage test and the power frequency withstand voltage test for the experiment to find out the electronic character of SF6, CF4 and mixture of SF6 and CF4. From this experiment, there was increase in impulse withstand voltage when put CF4 gas gradually into SF6. Further more, we found out the ratio of the mixture which works similar as SF6 gas switch. We could make an environment friendly resource with maintaining dielectric strength by combing SF6 and CF4 which generates a lower level of global warming. [ABSTRACT FROM AUTHOR]

SF6 gas has excellent dielectric strength, but it causes global warming about 23900 times more than CO2 which is the main cause of global warming. This shows necessity of the environment friendly dielectric gas which can replace SF6. In this dissertation, we made the 3 phase unity bundle operation tank type experimental switch to do the impulse withstand voltage test and the power frequency withstand voltage test for the experiment to find out the electronic character of SF6, CF4 and a mixture of SF6 and CF4. From this experiment, there was increase in impulse withstand voltage when put CF4 gas gradually into SF6. Further more, we found out the ratio of the mixture which works similar as SF6 gas switch. We could make an environment friendly resource with maintaining dielectric strength by combing SF6 and CF4 which generates a lower level of global warming. [ABSTRACT FROM AUTHOR]

This paper presents a Nash genetic algorithm (Nash GA) as a solution for a network design problem, formulated as a bi-level programming model and designs a backbone topology in a hierarchical Link-State (LS) routing domain. Given that the sound backbone topology structure has a great impact on the overall routing performance in a hierarchical LS domain, the importance of this research is evident. The proposed decision model will find an optimal configuration that consists of backbone router for Backbone Provider (BP), router for Internet Service Provider (ISP), and connection link properly meeting two-pronged engineering goals: i.e., average message delay and connection costs. It is also presumed that there are decision makers for BP and the decision makers for ISP join in the decision making process in order to optimize the own objective function. The experiment results clearly indicates that it is essential to the effective operations of hierarchical LS routing domain to consider not only the engineering aspects but also specific benefits from systematical layout of backbone network, which presents the validity of the decision model and Nash GA. [ABSTRACT FROM AUTHOR]

The data grid may consist of huge number of documents and the number of documents which contain the keywords in the query may be very large. Therefore, we need some method to measure the relevance of the documents to the query. In this paper we propose algorithms for computing k-keyword proximity score [3] in more realistic environments. Furthermore, we show that they can be used to find longest repetitive substring with constraints in a set of strings. [ABSTRACT FROM AUTHOR]

The IP address lookup problem is to find the longest matching IP prefix from a routing table for a given IP address. In this paper we implemented and extended the results of [3] by incorporating the access frequencies of the target IP addresses. Experimental results showed that the number of memory access is reduced significantly. [ABSTRACT FROM AUTHOR]

One of the most important relevance factors in the Web search context is the proximity score, i.e., how close the keywords appear together in a given document. A basic proximity score is given by the size of the smallest range containing all the keywords in the query. We generalize the proximity score to include many practically important cases and present an O(n log k) time algorithm for the generalized problem, where k is the number of keywords and n is the number of occurrences of the keywords in a document. [ABSTRACT FROM AUTHOR]

A validity of Grid computing with Monte Carlo (MC) docking simulations was examined in order to execute prediction and data handling for the computational chiral discrimination. Docking simulations were performed with various computational parameters for the chiral discrimination of a series of 17 enantiomers by β-cyclodextrin (β-CD) or by 6-amino-6-deoxy-β-cyclodextrin (am-β-CD). Rigid-body MC docking simulations gave more accurate predictions than flexible docking simulations. The accuracy was also affected by both the simulation temperature and the kind of force field. The prediction rate of chiral preference was improved by as much as 76.7% when rigid-body MC docking simulations were performed at low temperatures (100 K) with a sugar22 parameter set in the CHARMM force field. Our approach for Grid-based MC docking simulations suggested the conformational rigidity of both the host and guest molecule. [ABSTRACT FROM AUTHOR]