• Journal of Biosystems Engineering
• /
• v.30 no.3 s.110
• /
• pp.172-178
• /
• 2005

Grading and sorting an indeterminate form of agricultural products such as sweet potatoes and potatoes are a labor intensive job because its shape and size are various and complicate. It costs a great deal to sort sweet potato in an indeterminate forms. There is a great need for an automatic grader fur the potatoes. Machine vision is the promising solution for this purpose. The optical indices for qualifying weight and appearance quality such as shape, color, defects, etc. were obtained and an on-line sorting system was developed. The results are summarized as follows. Sorting system combined with an on-line inspection device was composed of 5 sections, human inspection, feeding, illumination chamber, image processing & control, and grading & discharging. The algorithms to compute geometrical parameters related to the external guality were developed and implemented for sorting the deformed sweet potatoes. Grading accuracy by image processing was $96.4\%$ and the processing capacity was 10,800 pieces per hour.

• Journal of the Korean Academy of Child and Adolescent Psychiatry
• /
• v.28 no.1
• /
• pp.38-43
• /
• 2017

This study analyzes the role of the Sorting Hat in structuring the identity of the characters in the Harry Potter series written by J. K. Rowling. In the different stages of adolescence, one explores and re-establishes one's identity. One's sense of identity is determined by the commitments made regarding personal and social traits. However, it is difficult to establish a concrete identity formation process theory that is communicable to adolescents. In Harry Potter, the characters' identities are reflected upon the Sorting Hat and are continuously molded throughout the book. The Sorting Hat provides nurturing experiences based on temperament. Based primarily on their temperament, it sorts the students into four houses, each with their own distinct characteristics. Once sorted, the houses become the living and learning communities in which the students share the same dormitory and classes until their graduation. Within the community, the students seek connections, supportive relationships, and understanding within the group. The taking on of the group identity is an explanatory variable in the formation of individual identity. The Sorting Hat provides the students with stability and a safe boundary. After being sorted based on their temperament, the inexperienced and immature adolescents can explore different options under the guidance of the Hat before making a definite commitment. By presenting them with an appropriate environment (such as a mentor, friend, or family member), the Hat further shapes their identity and integrates the identity elements ascribed in the beginning. By providing experiences and interactions based on their unique temperament and environment, the Sorting Hat plays a crucial role in establishing the students' identities. The Sorting Hat can be an ideal model for finding one's identity during adolescence.

• Journal of Practical Engineering Education
• /
• v.14 no.3
• /
• pp.565-572
• /
• 2022

Card sorting is a useful data collection method for understanding users' perceptions of relationships between items. In general, card sorting is an intuitive and cost-effective technique that is very useful for user research and evaluation. In this study, the core competencies of each field were used as competency cards used in the next stage of card sorting for course development, and the clustering results were derived by applying the K-means algorithm to cluster the results. As a result of card sorting, competency clustering for core competencies for each occupation in each field was verified based on Participant-Centric Analysis (PCA). For the number of core competency cards for each occupation, the number of participants who agreed appropriately for clustering and the degree of card similarity were derived compared to the number of sorting participants.

• Journal of Soil and Groundwater Environment
• /
• v.18 no.3
• /
• pp.93-108
• /
• 2013

This study is aimed to prepare the effective detail survey methods(Phase II) of abandoned metal mines through the contamination assessment for mine types and facilities in the abandoned metal mine areas. The study sites of 12 abandoned mines are located in Gyeonggi-do and Gangwon-do and those were chosen among 310 sites that the Phase II survey was conducted from 2007 to 2009 after considering the results of Phase I for abandoned mines scattered all over the country. 12 study sites were classified into four types; Type I sites only have pit mouth. Type II sites have pit mouth and mine-waste field. Type III sites have pit mouth and tailing sorting field. Type IV sites have pit mouth, tailing sorting field and concentrator(s). In forest land, paddy soil and farm land of Type I, As and Cd were showed average concentration, and Cu and Pb were high on the pit mouth area in one mines where the pit mouth was developed within 500 m. In the mines of Type II, Cu and Pb were showed average concentration too, but As and Cd were slightly high in pit mouth and mine-waste field. The mines of Type III which had grinding particle process through physical separation milling or hitting showed similar tendency with Type II. However, mines of Type IV pit mouth, mine-waste field and showed various results depending on defining the contamination sources. For example, if contamination source was pit mouth, the mixed results of Type I, II, II were showed. In tailing sorting field which was regarded as the most important source and having high mobility, however, if there were no facilities or it was difficult to access directly, field sampling was missed occasionally during phase I and phase II survey. For that reason, the assessment for tailing sorting field is missed and it leads to completely different results. In the areas of Type I mines, the concentration of heavy metals exceeded precautionary standards of soil contamination or not within 1,000 meters of pit mouth. Nickel(Ni) was the largest factor of the heavy metal contamination in this type. The heavy metals except Arsenic(As) were shown high levels of concentration in Type II areas, where pit mouth and mine-waste field were operated for making powder in upriver region; therefore, to the areas in the vicinity of midstream and downstream, the high content of heavy metals were shown. The tendency of high level of heavy metals and toxic materials contained in flotation agent used during sorting process were found in soil around sorting and tailing field. In the abandoned-pit-mouth area, drygrinding area and tailing sorting field area, the content of Cupper(Cu) and Zinc(Zn) were higher than other areas. Also, the contaminated area were larger than mine reclamation area(2,000 m) and the location of tailing sorting field was one of the important factors to estimate contaminated area.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.15 no.3
• /
• pp.115-121
• /
• 2016

A mackerel grader is a machine for sorting mackerel according to size. In this study, the dynamic deflection and optimal sorting simulation of a mackerel grader was carried out by using multi-body dynamics. To analyze the dynamic deflection of the roller, RecurDyn, a multi-body dynamics analysis program, was used. The dynamic deflection of the roller pipe was analyzed according to the inclination of the roller pipe. When the inclination of the roller pipe was 30 degrees, the roller indicated the maximum deflection of about 6.3 mm at the center of the mass. To simulate the mackerel sorting, the mackerel grader machine was modeled, and the contact simulation between the mackerel model and the rotating roller pipe was carried out. When the inclination of the roller frame was 7 degrees, the mackerel grader indicated optimal sorting performance.

• Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
• /
• 2001.06a
• /
• pp.1616-1616
• /
• 2001

To select kernels for breeding that have required constituent content from either naturally distributed samples or artificially mutated ones, it is necessary to process batch samples in a short time. The constituent content of single-kernel grains such as wheat and rice has been determined using conventional bench type NIR instruments; however, it takes a lot of time and effort. Shizuoka Seiki (Fukuroi-city, Japan) and NFRI (National Food Research Institute) of MAFF (Ministry of Agriculture, forestry and Fisheries of Japan) have jointly developed a continuous high-speed single-kernel brown rice sorting machine based on rice protein content. It consists of several sections such as a feeding mechanism, measuring unit, sorting mechanism and controlling PC. The feeding mechanism picks up single-kernel brown rice from the hopper (maximum of 5kg storage capacity) and sends it to the measuring unit. A spectrum of the brown rice is obtained in the measuring unit, which consists of a near-infrared array sensor. The brown rice is then sorted in the sorting mechanism based on its protein content estimated by the controlling PC. In the present study, measuring speed was approximately 500ms for the full spectrum range and overall sorting speed was approximately 2.8s for one kernel. Accuracy of estimation was approximately SEP=0.5% of dry matter protein content for nonglutinous rice.

• IE interfaces
• /
• v.14 no.3
• /
• pp.247-254
• /
• 2001

As current postal automation is limited to dispatch and arrival sorting, delivery sequence sorting is performed manually by each postman. It not only acts as a bottleneck process in the overall mailing process but is expensive operation. To cope with this problem effectively, delivery sequence sorting automation is required. The important components of delivery sequence sorting automation system are sequence sorter and Hangul OCR which function is to extract the address of delivery point. DSI database will be interfaced to both Hangul OCR and sequence sorter for finding the accurate delivery sequence number and stacker number. The objectives of this research are to develop DSI(Delivery Sequence Information) database prototype and client application for managing information effectively. For database requirements collection and analysis, we draw all possible sorting plans, and apply the AHP(Analytic Hierarchy Process) method to determine the optimal one. And then, we design DSI database schema based on the optimal one and implement it using Oracle RDBMS. In addition, as address information in DIS database consist of hierarchical structure which has its correspondence sequence number, so it is important to reorganize sequence information accurately when address information is inserted, deleted or updated. To increase delivery accuracy, we reflect this point in writing application.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.53 no.6
• /
• pp.43-50
• /
• 2011

The fractal method has recently been applied to a model for determining soil grain size distribution. The objective of this study is to review the applicability of the fractal method for a analysis of submarine sedimentary environments by comparing fractal constants with grain size statistical analysis for the soil samples of Pohang (PH) and Namhae (NH). The y-interception of log (grain size)-log (passing) equation was also used because grain size distribution couldn't be expressed with fractal dimension only. The result of comparison between fractal constants (dimension, y-interception) and grain size statistical indices, the fractal dimension was directly proportional to the mean and the sorting. And the y-interception showed high correlation with the mean. The fractal dimension and y-interception didn't show significant correlation with the skewness and the kurtosis. Thus regression equations between fractal constants and two statistical indices (mean, sorting) were derived. All classifications of the mean and the sorting could be determined using the regression equation based on the fractal dimension and y-interception. Therefore, fractal constants could be used as an alternative index representing the sedimentary environments instead of the mean and sorting.

• Journal of Power Electronics
• /
• v.14 no.6
• /
• pp.1109-1118
• /
• 2014

A Fundamental Frequency Sorting Algorithm (FFSA) is proposed in this paper to balance the voltages of floating dc capacitors for Modular Multilevel Converters (MMCs). The main idea is to change the sequences of the CPS-PWM carriers according to the capacitor voltage increments during the previous fundamental period. Excessive frequent sorting is avoided and many calculating resources are saved for the controller. As a result, more sub-modules can be dealt with. Furthermore, it does not need to measure the arm currents. Therefore, the communication between the controllers can be simplified and the number of current sensors can be reduced. Moreover, the proposed balancing method guarantees that all of the switching frequencies of the sub-modules are equal to each other. This is quite beneficial for the thermal design of the sub-modules and the lifetime of the power switches. Simulation and experimental results acquired from a 9-level prototype verify the viability of the proposed balancing method.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.271-286
• /
• 2011

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.