• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.81-90
• /
• 2013

During the past decade, many changes and attempts have been tried and are continued developing new technologies in the computing area. The brick wall in computing area, especially power wall, changes computing paradigm from computing hardwares including processor and system architecture to programming environment and application usage. The high performance computing (HPC) area, especially, has been experienced catastrophic changes, and it is now considered as a key to the national competitiveness. In the late 2000's, many leading countries rushed to develop Exascale supercomputing systems, and as a results tens of PetaFLOPS system are prevalent now. In Korea, ICT is well developed and Korea is considered as a one of leading countries in the world, but not for supercomputing area. In this paper, we describe architecture design of MAHA supercomputing system which is aimed to develop 300 TeraFLOPS system for bio-informatics applications like human genome analysis and protein-protein docking. MAHA supercomputing system is consists of four major parts - computing hardware, file system, system software and bio-applications. MAHA supercomputing system is designed to utilize heterogeneous computing accelerators (co-processors like GPGPUs and MICs) to get more performance/$, performance/area, and performance/power. To provide high speed data movement and large capacity, MAHA file system is designed to have asymmetric cluster architecture, and consists of metadata server, data server, and client file system on top of SSD and MAID storage servers. MAHA system softwares are designed to provide user-friendliness and easy-to-use based on integrated system management component - like Bio Workflow management, Integrated Cluster management and Heterogeneous Resource management. MAHA supercomputing system was first installed in Dec., 2011. The theoretical performance of MAHA system was 50 TeraFLOPS and measured performance of 30.3 TeraFLOPS with 32 computing nodes. MAHA system will be upgraded to have 100 TeraFLOPS performance at Jan., 2013.

• Journal of Preventive Medicine and Public Health
• /
• v.22 no.3 s.27
• /
• pp.389-397
• /
• 1989

To identify the problems in child rearing practice of employed mothers in urban poor area, all of 201 women with children under 6 years old living in Yun San 3 Dong, a poor area of Pusan city, were interviewed with a questionnaire by a trained interviewer from 10th April to 10th May 1989. Among 201 women, 51 women were employed and 150 women were unemployed. Of the employed mothers 78.5% got their jobs because of economical need and 31.4% of them worker for 60-69 hours per week. Their average monthly income was 100,000-190,000 Won in 33.4% and 200,000-290,000 Won in 25.4% Breast milk was fed in 66.0% of the children of unemployed mothers while 49.0 of the children of the employed mothers were breast-fed (p<0.05). The most common reason for not breast feeding was shortage of breast milk among unemployed mothers (58.9%) but that of the employed mothers was their job(63.6%). The basic immunization for children was completed in 70.5% of children of employed mothers as compared with 82.0% of the children of the unemployed mothers were completely immunized (p>0.1). Accident experience rate of children among the employed mothers was 23.5 a and that of the children of the unemployed mothers was 17.3% . The most common cause of acident in children of the unemployed mothers was carelessness while they were playing(34.6%) but in children of the employed mothers it was traffic accident(25.0%) and falling(25.0%). Most of the traffic accidents took place while the children's brother or sister of age under 14 years were baby sitting. When the accident took place 73.1% of the unemployed mothers were just at home, but 58.3% of the employed mothers were out of home for work. In case of the employed mothers, 58.7% of their children were looked after by an adult mainly grandparents, 15.7% by the children's brothers and sisters under 14 years old, and 3.9% of the children were left alone. A majority of the unemployed mothers wanted to get a job if someone could take care of their children. To facilitate the women employment and for the safety and health of the children, good nurseries for working mothers need to be established at a cost they can afford.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.102-116
• /
• 2006

Electronic catalogs (or e-catalogs) hold information about the goods and services offered or requested by the participants, and consequently, form the basis of an e-commerce transaction. Catalog management is complicated by a number of factors and product classification is at the core of these issues. Classification hierarchy is used for spend analysis, custom3 regulation, and product identification. Classification is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. However, product classification has received little formal treatment in terms of underlying model, operations, and semantics. We believe that the lack of a logical model for classification Introduces a number of problems not only for the classification itself but also for the product database in general. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eClass, however, have a lot of limitations to meet these requirements for dynamic features of classification. In this paper, we try to understand what it means to classify products and present how best to represent classification schemes so as to capture the semantics behind the classifications and facilitate mappings between them. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes. And describe the semantic classification model, which satisfies the requirements for dynamic features oi product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph. We believe the model proposed in this paper satisfies the requirements and challenges that have been raised by previous works.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1218-1226
• /
• 2008

With the development of semiconductor integrated technology and with the increasing use of multimedia functions in computer, more functions have been implemented as hardware. Nowadays, most microprocessors beyond 32 bits generally implement an integer multiplier as hardware. However, as for a divider, only specific microprocessor implements traditional SRT algorithm as hardware due to complexity of implementation and slow speed. This paper suggested an algorithm that uses a multiplier, 'w bit $\times$ w bit = 2w bit', to process $\frac{N}{D}$ integer division. That is, the reciprocal number D is first calculated, and then multiply dividend N to process integer division. In this paper, when the divisor D is '$D=0.d{\times}2^L$, 0.5 < 0.d < 1.0', approximate value of ' $\frac{1}{D}$', '$1.g{\times}2^{-L}$', which satisfies ' $0.d{\times}1.g=1+e$, $e<2^{-w}$', is defined as over reciprocal number and then an algorithm for over reciprocal number is suggested. This algorithm multiplies over reciprocal number '$01.g{\times}2^{-L}$' by dividend N to process $\frac{N}{D}$ integer division. The algorithm suggested in this paper doesn't require additional revision, because it can calculate correct reciprocal number. In addition, this algorithm uses only multiplier, so additional hardware for division is not required to implement microprocessor. Also, it shows faster speed than the conventional SRT algorithm and performs operation by word unit, accordingly it is more suitable to make compiler than the existing division algorithm. In conclusion, results from this study could be used widely for implementation SOC(System on Chip) and etc. which has been restricted to microprocessor and size of the hardware.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.8
• /
• pp.223-230
• /
• 2021

The lightweight block cipher PIPO announced at ICISC'20 has been effectively implemented by applying the bit slice technique. In this paper, we propose a parallel optimal implementation of PIPO for ARM processors. The proposed implementation enables parallel encryption of 8-plaintexts and 16-plaintexts. The implementation targets the A10x fusion processor. On the target processor, the existing reference PIPO code has performance of 34.6 cpb and 44.7 cpb in 64/128 and 64/256 standards. Among the proposed methods, the general implementation has a performance of 12.0 cpb and 15.6 cpb in the 8-plaintexts 64/128 and 64/256 standards, and 6.3 cpb and 8.1 cpb in the 16-plaintexts 64/128 and 64/256 standards. Compared to the existing reference code implementation, the 8-plaintexts parallel implementation for each standard has about 65.3%, 66.4%, and the 16-plaintexts parallel implementation, about 81.8%, and 82.1% better performance. The register minimum alignment implementation shows performance of 8.2 cpb and 10.2 cpb in the 8-plaintexts 64/128 and 64/256 specifications, and 3.9 cpb and 4.8 cpb in the 16-plaintexts 64/128 and 64/256 specifications. Compared to the existing reference code implementation, the 8-plaintexts parallel implementation has improved performance by about 76.3% and 77.2%, and the 16-plaintext parallel implementation is about 88.7% and 89.3% higher for each standard.

• Journal of Internet Computing and Services
• /
• v.14 no.6
• /
• pp.71-84
• /
• 2013

Log data, which record the multitude of information created when operating computer systems, are utilized in many processes, from carrying out computer system inspection and process optimization to providing customized user optimization. In this paper, we propose a MongoDB-based unstructured log processing system in a cloud environment for processing the massive amount of log data of banks. Most of the log data generated during banking operations come from handling a client's business. Therefore, in order to gather, store, categorize, and analyze the log data generated while processing the client's business, a separate log data processing system needs to be established. However, the realization of flexible storage expansion functions for processing a massive amount of unstructured log data and executing a considerable number of functions to categorize and analyze the stored unstructured log data is difficult in existing computer environments. Thus, in this study, we use cloud computing technology to realize a cloud-based log data processing system for processing unstructured log data that are difficult to process using the existing computing infrastructure's analysis tools and management system. The proposed system uses the IaaS (Infrastructure as a Service) cloud environment to provide a flexible expansion of computing resources and includes the ability to flexibly expand resources such as storage space and memory under conditions such as extended storage or rapid increase in log data. Moreover, to overcome the processing limits of the existing analysis tool when a real-time analysis of the aggregated unstructured log data is required, the proposed system includes a Hadoop-based analysis module for quick and reliable parallel-distributed processing of the massive amount of log data. Furthermore, because the HDFS (Hadoop Distributed File System) stores data by generating copies of the block units of the aggregated log data, the proposed system offers automatic restore functions for the system to continually operate after it recovers from a malfunction. Finally, by establishing a distributed database using the NoSQL-based Mongo DB, the proposed system provides methods of effectively processing unstructured log data. Relational databases such as the MySQL databases have complex schemas that are inappropriate for processing unstructured log data. Further, strict schemas like those of relational databases cannot expand nodes in the case wherein the stored data are distributed to various nodes when the amount of data rapidly increases. NoSQL does not provide the complex computations that relational databases may provide but can easily expand the database through node dispersion when the amount of data increases rapidly; it is a non-relational database with an appropriate structure for processing unstructured data. The data models of the NoSQL are usually classified as Key-Value, column-oriented, and document-oriented types. Of these, the representative document-oriented data model, MongoDB, which has a free schema structure, is used in the proposed system. MongoDB is introduced to the proposed system because it makes it easy to process unstructured log data through a flexible schema structure, facilitates flexible node expansion when the amount of data is rapidly increasing, and provides an Auto-Sharding function that automatically expands storage. The proposed system is composed of a log collector module, a log graph generator module, a MongoDB module, a Hadoop-based analysis module, and a MySQL module. When the log data generated over the entire client business process of each bank are sent to the cloud server, the log collector module collects and classifies data according to the type of log data and distributes it to the MongoDB module and the MySQL module. The log graph generator module generates the results of the log analysis of the MongoDB module, Hadoop-based analysis module, and the MySQL module per analysis time and type of the aggregated log data, and provides them to the user through a web interface. Log data that require a real-time log data analysis are stored in the MySQL module and provided real-time by the log graph generator module. The aggregated log data per unit time are stored in the MongoDB module and plotted in a graph according to the user's various analysis conditions. The aggregated log data in the MongoDB module are parallel-distributed and processed by the Hadoop-based analysis module. A comparative evaluation is carried out against a log data processing system that uses only MySQL for inserting log data and estimating query performance; this evaluation proves the proposed system's superiority. Moreover, an optimal chunk size is confirmed through the log data insert performance evaluation of MongoDB for various chunk sizes.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.3
• /
• pp.1-40
• /
• 1965

To measure variations in some of the important agronomic characteristics of rice varieties under shifting of seedling dates, this study has been carried out at the Paddy Crop Division of Crop Experiment Station(then Agricultural Experiment Station) in Suwon for the period of three years 1958 to 1960. The varieties used in this study were Kwansan, Suwon ＃82, Mojo, Paltal and Chokwang, which have the different agronomic characteristics such as earliness and plant type. Seeds of each variety were sown at 14 different dates in 10-day interval starting on March 2. The seedlings were grown on seed bed for 30, 40, 50, 60, 70 and 80 days, respectively. The results of this study are as follows: A. Heading dates. 1. As the seeding date was delayed, the heading dates was almost proportionally delayed. The degree of delay was higher in early varieties and lower in late varieties and the longer the seedling stage, the more delayed the heading date. 2. Number of days to heading was proportionally lessened as seeding was delayed in all the varieties but the magnitude varied depending upon variety. In other words, the required period for heading in case of late planting was much shortened in late variety compared with early one. Within a variety, the number of days to heading was less shortened as the seedling stage was prolonged. Early variety reached earlier than late variety to the marginal date for the maximum shortening of days to heading and the longer the seeding stage, the limitted date came earlier. There was a certain limit in seeding date for shortening of days to heading as seeding was delayed, and days to heading were rather prolonged due to cold weather when seeded later than that date. 3. In linear regression equation, Y=a+bx obtained from the seeding dates and the number of days to heading, the coefficient b(shortening rate of days to heading) was closely correlated with the average number of days to heading. That is, the period from seeding to heading was more shortened in late variety than early one as seeding was delayed. 4. To the extent that the seedling stage is not so long and there is a linear relationship between delay of seeding and shortening of days to heading, it might be possible to predict heading date of a rice variety to be sown any date by using the linear regression obtained from variation of heading dates under the various seeding dates of the same variety. 5. It was found out that there was a close correlation between the numbers of days to heading in ordinary culture and the other ones. When a rice variety was planted during the period from the late part of March to the middle of June and the seedling ages were within 30 to 50 days, it could be possible to estimate heading date of the variety under late or early culture with the related data of ordinary culture. B. Maturing date. 6. Within (he marginal date for maturation of rice variety, maturing date was proportionally delayed as heading was delayed. Of course, the degree of delay depended upon varieties and seedling ages. The average air temperature (Y) during the ripening period of rice variety was getting lower as the heading date. (X) was delayed. Though there was a difference among varieties, in general, a linear regression equation(y=25.53-0.182X) could be obtained as far as heading date were within August 1 to September 13. 7. Depending upon earliness of a rice variety, the average air temperature during the ripening period were greatly different. Early variety underwent under 28$^{\circ}C$ in maximum while late variety matured under as low as 22$^{\circ}C$. 8. There was a highly significant correlation between the average air temperature (X) during the ripening period, and number of day (Y) for the maturation. And the relationship could be expressed as y=82.30-1.55X. When the average air temperature during the period was within the range of 18$^{\circ}C$ to 28$^{\circ}C$, the ripening period was shortened by 1.55 days with increase of 1$^{\circ}C$. Considering varieties, Kwansan was the highest in shortening the maturing period by 2.24 days and Suwon ＃82 was the lowest showing 0.78 days. It is certain that ripening of rice variety is accelerated at Suwon as the average air temperature increases within the range of 18$^{\circ}C$ to 28$^{\circ}C$. 9. Between number of days to heading (X) related to seeding dates and the accumulated average air temperature (Y) during the ripening period, a positive correlation was obtained. However, there was a little difference in the accumulated average air temperature during the ripening period even seeding dates were shifted to a certain extent. C. Culm- and ear-lengths. 10. In general all the varieties didn't show much variation in their culm-lengths in case of relatively early seeding but they trended to decrease the lengths as seeding was delayed. The magnitude of decreasing varied from young seedlings to old ones. Young seedlings which were seeded during May 21 to June 10 didn't decrease their culm-lengths, while seedlings old as 80 days decreased the length though under ordinary culture. 11. Variation in ear-length of rice varieties show the same trend as the culm-length subjected to the different seeding dates. When rice seedlings aged from 30 to 40 days, the ear-length remained constant but rice plants older than 40 days obviously decreased their ear-lengths. D. Number of panicles per hill. 12. The number of panicles per hill decreased up to a certain dates as seeding was delayed and then again increased the panicles due to the development of numerous tillers at the upper internodes. The seeding date to reach to the least number of panicles of rice variety depended upon the seedling ages. Thirty- to 40-day seedlings which were seeded during May 31 to June 10 developed the lowest number of panicles and 70- to 80-day seedlings sown for the period from April 11 to April 21 reached already to the minimum number of panicles. E. Number of rachillae. 13. To a certain seeding date, the number of rachillae didn't show any variation due to delay of seeding but it decreased remarkably when seeded later than the marginal date. 14. Variation in number of rachillae depended upon seedling ages. For example, 30- to 40-day old seedlings which, were originally seeded after May 31 started to decrease the rachillae. On the other hand, 80-day old seedlings which, were seeded on May 1 showed a tendency to decrease rachillae and the rice plant sown on May 31 could develop narrowly 3 or 4 panicles. F. Defective grain and 1.000-grain weights. 15. Under delay of the seeding dates, weight of the defective grains gradually increased till a certain date and then suddenly increased. These relationships could be expressed with two different linear regressions. 16. If it was assumed that the marginal date for ripening was the cross point of these two lines, the date seemed. closely related with seedling ages. The date was June 10- in 30- to 40-day old seedlings but that of 70- to 80-day old seedlings was May 1. Accordingly, the marginal date for ripening was getting earlier as the seedling stage was prolonged. 17. The 1.000-grain weight in ordinary culture was the heaviest and it decreased in both early and late cultures. G. Straw and rough rice weights. 18. Regardless of earliness of variety, rice plants under early culture which were seeded before March 22 or April 1 did not show much variation in straw weight due to seedling ages but in ordinary culture it gradually decreased and the degree was became greater in late culture. 19. Relationship between seeding dates (X) and grain weight related to varieties and seedling ages, could be expressed as a parabola analogous to a line (Y=77.28-7.44X$_1$-1.00lX$_2$). That is, grain yield didn't vary in early culture but it started to decrease when seeded later than a certain date, as seeding was delayed. The variation was much greater in cases of late planting and prolongation of seedling age. 20. Generally speaking, the relationship between grain yield (Y) and number of days to heading (X) was described with linear regression. However, the early varieties were the highest yielders within the range of 60 to 110, days to heading but the late variety greatly decreased its yield since it grows normally only under late culture. The grain yield, on the whole, didn't increase as number of days to heading exceeded more than 140 days.