Processing of Oleoresin Onion (양파 Oleoresin의 가공)
-
- The Korean Journal of Food And Nutrition
- /
- v.10 no.3
- /
- pp.302-308
- /
- 1997
The purpose of this study was to investigate the extraction yield and quality stability as to the oleoresin process with large amount of onion at one time. The first mixed-product is raw onion juice which was reduced the compression and concentrated by Brix 70% mixed together wit the residue which was extracted and concentrated by ethanol, the second product manufactured by the same method above after the autoclaving with onion, and the other product is made by grinding by 50mesh to freeze-dried onion. Each of yields were 7.3, 9.1 and 0.8% and each of total sugar content was 616.4, 712.3 and 150.3mg/g. Therefore the product extracted by ethanol from freeze-dried onion was very low in yield and total sugar content. By the index of the overall odor intensity, contents of total pyruvate were 1,733.7, 520.6, and 2,716.5
The linear combination of bond orbitals method is used to investigate the reactivity of halomethanes in abstraction reactions by atoms. The activation energy is evaluated on the assumption that, in an activated complex, two electrons in a bond to be broken become completely isolated from the rest of the
The scaling properties on the length distribution of microcrack populations from Tertiary crystalline tuff are investigated. From the distribution charts showing length range with 15 directional angles and five groups(I~V), a systematic variation appears in the mean length with microcrack orientation. The distribution charts are distinguished by the bilaterally symmetrical pattern to nearly N-S direction. The whole domain of the length-cumulative frequency diagram for microcrack populations can be divided into three sections in terms of phases of the distribution of related curves. Especially, the linear middle section of each diagram of five groups represents a power-law distribution. The frequency ratio of linear middle sections of five groups ranges from 46.6% to 67.8%. Meanwhile, the slope of linear middle section of each group shows the order: group V(
Studies were carried out in order to elucidate chemical components and microflora in three types of soy-sauce, 12-year aged soy-sauce prepared by improved method. 7-year aged and 20-year aged soy-sauce prepared by ordinary method. They results are summarized as follows: 1. The followings are found to be the important factors affecting the quality of soy sauce. a. Organic acids, reducing sugars and free amino acids were increased in the course of storage. b. In the aged soy-sauces under study non-volatile organic acid increased while volatile organic acid decreased and the total acidity was dependent only upon tie latter. c. It was found that suit concentration decreased during the storage. 2. The results of investigation of microflora in the stored soy-sauce are shown as follows. Soy-sauce Improved Ordinary Microbe 12-Y. 20-Y. 7-Y. Aerobic bacteria colony/1ml. 6 123 2 Halophilic lactic acid bacteria colony/1ml. 4 6 10 Osmophilic yeast colony/1ml.
Recommender system has become one of the most important technologies in e-commerce in these days. The ultimate reason to shop online, for many consumers, is to reduce the efforts for information search and purchase. Recommender system is a key technology to serve these needs. Many of the past studies about recommender systems have been devoted to developing and improving recommendation algorithms and collaborative filtering (CF) is known to be the most successful one. Despite its success, however, CF has several shortcomings such as cold-start, sparsity, gray sheep problems. In order to be able to generate recommendations, ordinary CF algorithms require evaluations or preference information directly from users. For new users who do not have any evaluations or preference information, therefore, CF cannot come up with recommendations (Cold-star problem). As the numbers of products and customers increase, the scale of the data increases exponentially and most of the data cells are empty. This sparse dataset makes computation for recommendation extremely hard (Sparsity problem). Since CF is based on the assumption that there are groups of users sharing common preferences or tastes, CF becomes inaccurate if there are many users with rare and unique tastes (Gray sheep problem). This study proposes a new algorithm that utilizes Social Network Analysis (SNA) techniques to resolve the gray sheep problem. We utilize 'degree centrality' in SNA to identify users with unique preferences (gray sheep). Degree centrality in SNA refers to the number of direct links to and from a node. In a network of users who are connected through common preferences or tastes, those with unique tastes have fewer links to other users (nodes) and they are isolated from other users. Therefore, gray sheep can be identified by calculating degree centrality of each node. We divide the dataset into two, gray sheep and others, based on the degree centrality of the users. Then, different similarity measures and recommendation methods are applied to these two datasets. More detail algorithm is as follows: Step 1: Convert the initial data which is a two-mode network (user to item) into an one-mode network (user to user). Step 2: Calculate degree centrality of each node and separate those nodes having degree centrality values lower than the pre-set threshold. The threshold value is determined by simulations such that the accuracy of CF for the remaining dataset is maximized. Step 3: Ordinary CF algorithm is applied to the remaining dataset. Step 4: Since the separated dataset consist of users with unique tastes, an ordinary CF algorithm cannot generate recommendations for them. A 'popular item' method is used to generate recommendations for these users. The F measures of the two datasets are weighted by the numbers of nodes and summed to be used as the final performance metric. In order to test performance improvement by this new algorithm, an empirical study was conducted using a publically available dataset - the MovieLens data by GroupLens research team. We used 100,000 evaluations by 943 users on 1,682 movies. The proposed algorithm was compared with an ordinary CF algorithm utilizing 'Best-N-neighbors' and 'Cosine' similarity method. The empirical results show that F measure was improved about 11% on average when the proposed algorithm was used