• Bulletin of the Korean Chemical Society
• /
• v.12 no.2
• /
• pp.143-148
• /
• 1991

In the unhydrated and hydrated states, conformational free energies of L-ascorbic acid anion (AAA) were computed with an empirical potential function and the hydration shell model (a program CONBIO). The conformational energy was minimized from possible starting conformations expressed with five torsion angles of the molecule. The conformational entropy of each low energy conformation in both states was computed using a harmonic approximation. As found in L-ascorbic acid (AA), intramolecular hydrogen bonds (HBs) are proved to be of significant importance in stabilizing the overall conformations of AAA in both states, and give the folded conformations, which are quite different from those in crystal. There are competitions between HBs and hydration around O3 atom of the lactone ring and hydroxyls of the acyclic side chain. Especially, the whole conformation of AAA is strongly dependent on the water-accessibility of O3 atom. Though there is a significant effect of the hydration on conformational surface, the lowest energy conformation of the unhydrated AAA is conserved. The different patterns of HBs and hydration result in the conformations of AAA in both states being different from those of AA. It can be drawn by several feasible conformations obtained in the hydrated state that there exists an ensemble of several conformations in aqueous solution.

• Biomolecules & Therapeutics
• /
• v.30 no.1
• /
• pp.98-116
• /
• 2022

The small GTPase RhoA has been studied extensively for its role in actin dynamics. In this study, multiple bioinformatics tools were applied cooperatively to the microarray dataset GSE64714 to explore previously unidentified functions of RhoA. Comparative gene expression analysis revealed 545 differentially expressed genes in RhoA-null cells versus controls. Gene set enrichment analysis (GSEA) was conducted with three gene set collections: (1) the hallmark, (2) the Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway, and (3) the Gene Ontology Biological Process. GSEA results showed that RhoA is related strongly to diverse pathways: cell cycle/growth, DNA repair, metabolism, keratinization, response to fungus, and vesicular transport. These functions were verified by heatmap analysis, KEGG pathway diagramming, and direct acyclic graphing. The use of multiple gene set collections restricted the leakage of information extracted. However, gene sets from individual collections are heterogenous in gene element composition, number, and the contextual meaning embraced in names. Indeed, there was a limit to deriving functions with high accuracy and reliability simply from gene set names. The comparison of multiple gene set collections showed that although the gene sets had similar names, the gene elements were extremely heterogeneous. Thus, the type of collection chosen and the analytical context influence the interpretation of GSEA results. Nonetheless, the analyses of multiple collections made it possible to derive robust and consistent function identifications. This study confirmed several well-described roles of RhoA and revealed less explored functions, suggesting future research directions.

• Asian-Australasian Journal of Animal Sciences
• /
• v.16 no.2
• /
• pp.185-188
• /
• 2003

Data on the use of breeding records of dairy cattle farm of Fenghuang-shan in Chengdu areas during a period of six years is systematically analyzed. The results show that Holstein heifers have their 1st estrus at an average age of $513.6{\pm}46.7$ d which is not related to the calving season. Estrus mostly occurs in the months with mild ambient temperature (March, April, May, November and December). There is a very poor rate of estrus detection; only 30.0% successive estrus is observed within 24 d, 29.3% within 25-48 d, 40.6% over 48 d. The average number of insemination per conception is 1.50 for heifers and 1.74 for cows, but conception rate (CR) is lower in the relatively warm months (July, August and September) ranged from 48.1% to 51.9% compared with 58.1% to 68.5% in other months. High temperature is the most important factor affecting fertilization in warm months, but neither did CR decline immediately with the increased air temperature in June, nor did it increase immediately with the declined air temperature in September. Post partum anestrous period is $119.5{\pm}60.5$ d. The average interval from calving to conception is $159.4{\pm}85.6$ d with only 19.8% of the cows conceived within 85 d of calving. Cows with high milk yield have longer acyclic periods and lower conception rates. Improvement of efficient managements must be a precedent condition in Chengdu areas.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.10
• /
• pp.867-873
• /
• 2001

The purpose of this study is to find analytic solution of determining the optimal capacity (lot-size) of multiproduct acyclic multistage production and inventory system to meet the finished product demand under the constraint of finite intermediate storage. Intermediate storage is a practical way to mitigate the material flow imbalance through the line of supply and demand chain. However, the cost of constructing and operating storage facilities is becoming substantial because of increasing land value, environmental and safety concern. Therefore, reasonable decision-making about the capacity of processes and storage units is an important subject for industries. The industrial solution for this subject is to use the classical economic lot sizing method, EOQ/EPQ(Economic Order Quantity/Economic Production Quantity) model, incorporated with practical experience. But EOQ/EPQ model is not suitable for the chemical plant design with highly interlinked processes and storage units because it is developed based on single product and single stage. This study overcomes the limitation of the classical lot sizing method. The superstructure of the plant consists of the network of serially and/or parallelly interlinked non-continuous processes and storage units. The processes transform a set of feedstock materials into another set of products with constant conversion factors. A novel production and inventory analysis method, PSW(Periodic Square Wave) model, is applied to describe the detail material flows among equipments. The objective function of this study is minimizing the total cost composed of setup and inventory holding cost. The advantage of PSW model comes from the fact that the model provides a set of simple analytic solutions in spite of realistic description of the material flows between processes and storage units. the resulting simple analytic solution can greatly enhance the proper and quick investment decision for the preliminary plant design problem confronted with economic situation.

• Bulletin of the Korean Chemical Society
• /
• v.27 no.7
• /
• pp.1005-1008
• /
• 2006

The reaction of $AgClO_{4}$ with acyclic potential tridentate N,N,N',N',N''-pentamethyldiethylenetriamine (pmdeta) has given colorless crystals suitable for X-ray crystallography. The crystal structure ($P2_{1}$/n, a = 14.413(1) $\AA$, b = 25.270(2) $\AA$, c = 16.130(1) $\AA$, b = $103.012(1){^{\circ}}$, V = 5723.7(8) A$\AA^{3}$, Z = 4, R = 0.0349) has been solved and refined. Three silver(I) ions connect four pmdeta ligands to produce discrete complex of $[Ag_3(pmdeta)_4](ClO_4)_3$. A pmdeta ligand is bridged to three silver(I) ions, and three other pmdeta ligands are chelated to each silver(I) center in a tridentate mode. Thus, the product is a rare tri-nuclear silver(I) complex with two different chemical environments. $^{13}C$ NMR and $MAS\;^{13}$C NMR indicate that the tri-nuclear silver(I) complex is not rigid in solution. The contact angles and thermal analyses of the complex are measured and discussed.

• The Journal of Society for e-Business Studies
• /
• v.20 no.4
• /
• pp.61-76
• /
• 2015

In general, we have utilized the hierarchical concept tree as a crucial data structure for indexing huge amount of textual data. This paper proposes a generality rank-based method that can automatically develop hierarchical concept structures with the Wikipedia data. The goal of the method is to regard each of Wikipedia articles as a concept and to generate hierarchical relationships among concepts. In order to estimate the generality of concepts, we have devised a special ranking function that mainly uses the number of hyperlinks among Wikipedia articles. The ranking function is effectively used for computing the probabilistic subsumption among concepts, which allows to generate relatively more stable hierarchical structures. Eventually, a set of concept pairs with hierarchical relationship is visualized as a DAG (directed acyclic graph). Through the empirical analysis using the concept hierarchy of Open Directory Project, we proved that the proposed method outperforms a representative baseline method and it can automatically extract concept hierarchies with high accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3046-3070
• /
• 2017

Nowadays, the utilization of multiprocessor environments has been increased due to the increase in time complexity of application programs and decrease in hardware costs. In such architectures during the compilation step, each program is decomposed into the smaller and maybe dependent segments so-called tasks. Precedence constraints, required execution times of the tasks, and communication costs among them are modeled using a directed acyclic graph (DAG) named task-graph. All the tasks in the task-graph must be assigned to a predefined number of processors in such a way that the precedence constraints are preserved, and the program's completion time is minimized, and this is an NP-hard problem from the time-complexity point of view. The results obtained by different approaches are dominated by two major factors; first, which order of tasks should be selected (sequence subproblem), and second, how the selected sequence should be assigned to the processors (assigning subproblem). In this paper, a hybrid proposed approach has been presented, in which two different artificial ant colonies cooperate to solve the multiprocessor task-scheduling problem; one colony to tackle the sequence subproblem, and another to cope with assigning subproblem. The utilization of background knowledge about the problem (different priority measurements of the tasks) has made the proposed approach very robust and efficient. 125 different task-graphs with various shape parameters such as size, communication-to-computation ratio and parallelism have been utilized for a comprehensive evaluation of the proposed approach, and the results show its superiority versus the other conventional methods from the performance point of view.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.185-198
• /
• 2000

Recently the technological advance in the hardware dealing with multimedia data as well as the explosive increase of the volume of multimedia data bring about new interest in the use of multimedia presentations in many application domains. To use multimedia presentations efficiently, the integration of multimedia presentations into DBMS is necessary. This paper presents a multimedia presentatation query language based on contents and query processing techniques. Presently, multimedia presentation authoring tools denote a multimedia presentation using a presentation graph which is a DAG. A Node in the graph is a same type of media stream and edges denote a play-out order and a synchronization way among nodes. The contents of presentations graphs are the information of each stream, the sequential order of the information inside each stream and the play-out order among the streams. GCalculus/S is a calculus-based query language and can deal with the contents of a presentation graph and physical characteristics of multimedia data. It expresses the sequential order of information inside each stream and the play-out order of streams of a presentation graph using temporal operators Next, Connected and Until. O-Algebra, which is object algebra, is extended to process GCalculus/S queries.

• Journal of Pharmaceutical Investigation
• /
• v.18 no.3
• /
• pp.113-123
• /
• 1988

A series of water-soluble polyparacyclophanes bearing two diphenylmethane or two diphenyl ether skeletons were investigated to develop useful host compounds by using 1-anilinonaphthalene-6-sulfonate (ANS) and 2-p-toluidinylnaphthalene-6-sulfonate (TNS) as fluorescent hydrophobic substrates in aqueous solution. It was noteworthy that remarkable fluorescent enhancements and blue shifts of ANS and TNS were observed only in the presence of 1,6,20,25-tetraaza[6.1.6.1] paracyclophane (CPM 44) and 1,6,21,27-tetraaza [7.1.7.1] paracyclophane (CPM 55) for diphenylmethane skeleton, and 1,7,21,27-tetraaza-14,34-dioxa [7.1.7.1] paracyclophane (CPE 55) and 1,8,22,29-tetraaza-15,36-dioxa [8.1.8.1] paracyclophane (CPE 66) for diphenyl ether skeleton, comparing with ${\alpha}-\;and\;{\beta}-cyclodextrins$. However, their acyclic analogues such as 4,4'-dimethylaminodiphenylmethane and 4,4'-dimethylaminodiphenyl ether, and paracyclophanes whose cavities were smaller showed only small effects under the same conditions. These facts suggested that hosts and substrates were in an intimate contact which would not occur without larger structures, and thus that guest molecules were strongly incorporated in the hydrophobic cavities of these larger paracyclophanes. The effects of pH on the fluorescent intensity of ANS-CPM 44, ANS-CPM 55, ANS-CPE 55, ANS-CPE 66, TNS-CPM 44, TNS-CPM 55, TNS-CPE 55 and TNS-CPE 66 systems were not significant below pH 2.0, but their fluorescent intensities were markedly reduced with increasing ionic strength.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.476-484
• /
• 2008

Most string problems and their solutions are relevant to diverse applications such as pattern matching, data compression, recently bioinformatics, and so on. However, there have been few works on the relations between string problems and cryptographic problems. In this paper, we consider the following string reconstruction problems and show how these problems can be applied to cryptography. Given a string x of length n over a constant-sized alphabet ${\sum}$ and a set W of strings of lengths at most an integer $k({\leq}n)$, the first problem is to find the sequence of strings in W that reconstruct x by the minimum number of concatenations. We propose an O(kn+L)-time algorithm for this problem, where L is the sum of all lengths of strings in a given set, using suffix trees and a shortest path algorithm for directed acyclic graphs. The other is a dynamic version of the first problem and we propose an $O(k^3n+L)$-time algorithm. Finally, we show that exponentiation problems that arise in cryptography can be successfully reduced to these problems and propose a new solution for exponentiation.