• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.267-272
• /
• 2021

The current study aimed at measuring the rate of loss in search results of the actual number of publications in journals indexed by Web of Science when not using the accurate official authority name as indicated by the Ministry of Education. Conducting a search using the authority name does not always yield complete results of all existing publications. Researchers in Saudi universities tend to use up to 10 different random names of universities when searching. This interesting fact has prompted the authors of this paper to conduct a study on the search results of 30 Saudi universities using the authority name as indicated by the Ministry of Education. The statistical analyses revealed that there is a high tendency for the wrong use of authority names. Results show that 8 universities were not found in the search results. Furthermore, other universities are losing between 10 and 30% of search results that reflect the actual number of publications. Consequently, the rank of each university, as well as the general rank of Saudi universities in the Web of Science, will be affected.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.131-135
• /
• 2007

In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1165-1168
• /
• 2003

In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.10
• /
• pp.847-854
• /
• 1991

This paper presents a new output phase assignment algorithm which determines the phases of all the nodes in a given boolean network. An estimation function is defined, which is represented by the relation between the literals in the given function expression. A weight function, WT (fi, fj) is defined, which is represented by approximate amount of common subexpression between function fi and fj. Common Subexpression Graph(CSG) is generated for phase selection by the weight function between all given functions. We propose a heuristic algorithm finding subgraph of which sum of weights has maximum by assigning phases into the given functions. The experiments with MCNC benchmarks show the efficiency of the proposed method.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.11
• /
• pp.132-139
• /
• 1993

This paper presents a new performance-driven multi-levelizer which transforms a two-level description into a boolean network of the multilevel structure satisfied with user's costraints, such as chip area, the number of wires and literals, maximum delay, function level, fanin, fanout, etc.. The performance of circuits is estimated by reference to the informations in cell library through the cell mapping phase, and multi-levelization of circuits is constructed by the decomposition using the kernel and factoring concepts. Here, the saving cost of a common subexpression is defined to the sum of area and delay saved, when it is substituted. The experiments with MCNC benchmarks show the efficiency of the proposed method.

• Journal of Applied Reliability
• /
• v.6 no.2
• /
• pp.187-194
• /
• 2006

In this paper, We presented the algorithm for estimating a reliability between nodes in wireless communication network such as RBN and MANET To estimate the reliability between nodes, we first modeled RNB and MANET as probability graph. Branches of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp arithmetic to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

• Journal of the Korean Society for Library and Information Science
• /
• v.21
• /
• pp.225-248
• /
• 1991

The paper suggests newly conceptualized information retrieval system on the notion of citation analysis. The paper also criticizes the traditional information retrieval techniques using Boolean logic. The underlying assumption of this paper is that any pair of papers cited by one paper could be strongly related each other in meaning (Co-citation Analysis). And also any two papers to share same references could be similar each other (Bibliographic Coupling), By using graph algorithm, the networks of two kinds of the papers (the citing group, the cited group) is made in the fields of the genetics and the information and library science. The results say that the maps or networks for cited and citing groups can be useful when applied to the paper set made by the broad searching by subjects or keywords.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.59-63
• /
• 2007

In this paper, a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• Journal of Microbiology and Biotechnology
• /
• v.16 no.6
• /
• pp.993-998
• /
• 2006

We earlier suggested a hierarchical regulatory network using defined modeling symbols and weights in order to improve the flux balance analysis (FBA) with regulatory events that were represented by if-then rules and Boolean logic. In the present study, the simulation results of the models, which were developed and improved from the previou model by incorporating a hierarchical regulatory network into the FBA, were compared with the experimental outcome of an aerobic batch growth of E. coli on glucose and tryptophan. From the experimental result, a diauxic growth curve was observed, reflecting growth resumption, when tryptophan was used as an alternativee after the supply of glucose was exhausted. The model parameters, the initial concentration of substrates (0.92 mM glucose and 1 mM tryptophan), cell density (0.0086 g biomass/1), the maximal uptake rates of substrates (5.4 mmol glucose/g DCW h and 1.32 mmol tryptophan/g DCW h), and lag time (0.32 h) were derived from the experimental data for more accurate prediction. The simulation results agreed with the experimental outcome of the temporal profiles of cell density and glucose, and tryptophan concentrations.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2108-2115
• /
• 2000

The conventional Boolean retrieval systems based on vector spae model can provide the results of retrieval fast, they can't reflect exactly user's retrieval purpose including semantic information. Consequently, the results of retrieval process are very different from those users expected. This fact forces users to waste much time for finding expected documents among retrieved documents. In his paper, we designed a bayesian SOM(Self-Organizing feature Maps) in combination with bayesian statistical method and Kohonen network as a kind of unsupervised learning, then perform classifying documents depending on the semantic similarity to user query in real time. If it is difficult to observe statistical characteristics as there are less than 30 documents for clustering, the number of documents must be increased to at least 50. Also, to give high rank to the documents which is most similar to user query semantically among generalized classifications for generalized clusters, we find the similarity by means of Kohonen centroid of each document classification and adjust the secondary rank depending on the similarity.