• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.5
• /
• pp.187-196
• /
• 2010

We present a link that allows Excel to call the functions in the lp_solve system. lp_solve is free software licensed under the GPL that solves linear and mixed integer linear programs of moderate size. Our link manages the interface between Excel and lp_solve. Excel has a built-in add-in named Solver that is capable of solving mixed integer programs, but only with fewer than 200 variables. This link allows Excel users to handle substantially larger problems at no extra cost. Futhermore, we introduce that a network drawing method in Excel using arc adjacency lists of a network.

• Journal of Practical Agriculture & Fisheries Research
• /
• v.16 no.1
• /
• pp.3-16
• /
• 2014

The purposes of this study is to draw up some measures for improving the farmer's satisfaction for certificate system of environment-friendly agricultural products. The data was collected from a survey in 2013. The results of survey for farmers producing environment-friendly agricultural products are as follows. First, almost 60% of the respondents are certified by the private certificate bodies. Second, the main factors affecting farmers' choice of the authority are their trust (49%), geographical adjacency (22.1%), and other farmers' recommendation (7.7%), etc. Third, the index of farmers satisfaction level regarding the certification bodies and the examiner is estimated as 4 out of 5 marks followed by ex post facto management (3.8), application process (3.77), application document (3.66), etc. Lastly, farmers want to make improvement on the complicated application process most (37.9%), followed by expensive application fee (25.2%) and excessive application documents (17.5%). The results can be used to improve the supervision system of certification bodies of farmers, who produce environment-friendly agricultural products.

• The Journal of Society for e-Business Studies
• /
• v.25 no.3
• /
• pp.131-145
• /
• 2020

The numbers of SNS (Social Network Service) users and usage amounts are increasing every year. The influence of SNS is increasing also. SNS has a wide range of influences from daily decision-making to corporate management activities. Therefore, proper analysis of SNS can be a very meaningful work, and many studies are making a lot of effort to look into various activities and relationships in SNS. In this study, we analyze the SNS following relationships using Twitter, one of the representative SNS services. In other words, unlike the existing SNS analysis, our intention is to analyze the interests of the accounts by extracting and visualizing the accounts that two accounts follow in common. For this, a common following account was extracted using Microsoft Excel macros, and the relationship between the extracted accounts was defined using an adjacency matrix. In addition, to facilitate the analysis of the following relationships, a direction graph was used for visualization, and R programming was used for such visualization.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.165-175
• /
• 2016

A data allocation technique is essential to improve the performance of data broadcast systems. This paper explores the issues for allocating data items on broadcast channels to process multiple-data queries in the environment where query profiles and query request rates are given, and proposes a new data allocation scheme named QBDA. The proposed scheme allows the query with higher request rate to have higher priority to schedule its data items and introduces the concept of marking to reduce data conflicts. Simulation is performed to evaluate the performance of QBDA. The simulation results show that the proposed scheme outperforms other schemes in terms of the average response time since it can process queries with high request rate fast and show a very desirable characteristics in the aspects of query data adjacency and data conflict probability.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.1 s.5
• /
• pp.91-104
• /
• 1995

The spatial aggregation of data, in transportation and other planning processes, is an important theoretical consideration because the results of any analysis are not entirely independent of the delineation of zones. Moreover, using a different spatial aggregation may lead to different, and sometimes contradictory conclusions. Two criteria have been considered as important in designing zone systems. They are scale and aggregation. The scale problem arises because of uncertainty about the number of zones needed for a study and the aggregation problem arises because of uncertainty about how the data are to be aggregated to from a given scale problem. In a transportation study, especially in the design of traffic analysis zone(TAZ), the scale problem is directly related to the number dof zones and the aggregation problem involves spatial clustering, meeting the general requirements of forming the zones system such as equal traffic generation, convexity, and the consistency with the political boundary. In this study, first, the comparative study of delineating spatial units has been given. Second, a FORTRAN-based heuristic algorithm for designing TAZ based on socio-economic data has been developed and applied to the Korean peninsula containing 132 micro parcels. The vector type ARC/INFO GIS topological data mosel has been used to provise the adjacency information between parcels. The results, however, leave some to be desired in order to overcome such problems as non-convexity of the agglomerated TAZ system and/or uneven traffic phenomenon for each TAZ.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1591-1596
• /
• 1991

The present paper describes a method of recognizing a polyhedron employing the notion of network constraint analysis. Typical difficulties in three-dimensional object recognition, other than shading, reflection, and hidden line problems, include the case where appearances of an object vary according to observation points and the case where an object to be recognized is occluded by other objects placed in its front, resulting in incomplete information on the object shape. These difficulties can, however, be solved to a large extent, by taking account of certain local constraints defined on a polyhedral shape. The present paper assumes a model-based vision employing an appearance-oriented model of a polyhedron which is provided by placing it at the origin of a large sphere and observing it from various positions on the surface of the sphere. The model is actually represented by the sets of adjacent faces pairs of the polyhedron observed from those positions. Since the shape of a projected face gives constraint to that of its adjacent face, this results in a local constraint relation between these faces. Each projected face of an unknown polyhedron on an acquired image is examined its match with those faces in the model, producing network constraint relations between faces in the image and faces in the model. Taking adjacency of faces into consideration, these network constraint relations are analyzed. And if the analysis finally provides a solution telling existence of one to one match of the faces between the unknown polyhedron and the model, the unknown polyhedron is understood to be one of those memorized models placed in a certain posture. In the performed experiment, a polyhedron was observed from 320 regularly arranged points on a sphere to provide its appearance model and a polyhedron with arbitrarily postured, occluded, or imposed another difficulty was successfully recognized.

• The Research Journal of the Costume Culture
• /
• v.7 no.3
• /
• pp.35-49
• /
• 1999

The North Pacific Arctic region has common factors such as climatic characteristics and similarity of animals inhabiting the region. But also there exists geographical barriers that separates the tribes, different languages between the tribes. Although there are such differences, the clothing and ornaments of the region have relatively similar design and style. And above all possess the ‘spirit’. The tribes find the motives of such ‘spirit’ in human, animal, and soul\`s adaptability to change and in grafting such changes of forms into clothing. Especially as means of pleasing the animal that they vitally rely on, the tribes made the clothing as beautiful as the nature itself and they tried to connect the humans and animals universally through such clothing that have social, artistic, and enchantic conditions. The supply of raw materials of animals has elevated the creativeness one step up and the precise knowledge about fur show their superior techniques in making fur clothing. The use of gutskin has is an excellent example of such knowledge, which is very unique of the region. The gutskin has moderate plasticity and thus can be cut into all sorts of pattern. It harmonizes the functionality and practicality. The worldwide fashion trend is dominated by Western style, but the clothing of this region is still keeping its distinctive folk identity. At the start of the research, Kayak and itelmen tribes of Asia, the tribes of Amur river and Aleut and Tlingit tribes of North America seems to be geographically too far from each other and therefore searching theoretical background for common cultural origins seems to be immoderate. But lighting the fact that geographical adjacency that can be perceived through costume cultural history, is the most important factor that gives mutual influences to costume culture between the neighboring tribes, cultural relative similarity of the costume is influenced by geographical location rather than physical distance between the tribes. Also humans\` adaptability to their environment is seriously contaminated with man-made products. This study on North Pacific Arctic region is telling us many things about our past, present and future.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.721-726
• /
• 2012

In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.

• The Journal of the Korea Contents Association
• /
• v.17 no.6
• /
• pp.250-260
• /
• 2017

This study analyzed the impacts of programming characteristics perceived by the consumers of entertainment programs on general programming channels on watching intention and the data of a survey with 360 adult viewers in the capital area. Research questions were verified as follows: First, as a result of multiple regression to analyze the impacts of the factors of programming characteristics perceived by the consumers on their watching intention, setting personal characteristics as a control variable, programming characteristics as an independent variable and watching intention as a dependent variable, the regression model was significant. Thus, the more positive the perceived factors of programming characteristics, the more significant their watching intention improved. Second, the factors of programming characteristics significantly affecting watching intention had greater positive(+) impacts in the following order: Adjacency > substantiality > weight of genre > social evidence > relative advantage > ease of access.

• Korean Journal of Remote Sensing
• /
• v.30 no.6
• /
• pp.817-827
• /
• 2014

In the satellite remote sensing, the operational environment of the satellite sensor causes image degradation during the image acquisition. The degradation results in noise and blurring which badly affect identification and extraction of useful information in image data. This study proposes a maximum a posteriori (MAP) estimation using Point-Jacobian iteration to restore a degraded image. The proposed method assumes a Gaussian additive noise and Markov random field of spatial continuity. The proposed method employs a neighbor window of spoke type which is composed of 8 line windows at the 8 directions, and a boundary adjacency measure of Mahalanobis square distance between center and neighbor pixels. For the evaluation of the proposed method, a pixel-wise classification was used for simulation data using various patterns similar to the structure exhibited in high resolution imagery and an unsupervised segmentation for the remotely-sensed image data of 1 mspatial resolution observed over the north area of Anyang in Korean peninsula. The experimental results imply that it can improve analytical accuracy in the application of remote sensing high resolution imagery.