• Journal of the Korean housing association
• /
• v.14 no.6
• /
• pp.193-204
• /
• 2003

In connection with the plan for improving the residential environment gradually by analyzing the present condition of the reconstruction and parcel form of the housing area in a inner area, the main objective of this research is to develop a cooperative urban housing model based on the neighborhood agreement. The parcel form has a structure that is inappropriate for individual reconstruction； thus, the substantial improvement only through the residential environment improvement project has its limitations. As an alternative plan to resolve such limitations, I proposed a system that enables step-by-step reconstruction within the small-scaled blocks through the annexation of the land based on the neighborhood agreement. Nonetheless, I realized that it is difficult to apply such reconstruction system to individual housing. Therefore, I presented a design concept on the cooperative urban housing project as a residential form for the reconstruction inside blocks. A model plan vouches for its effectiveness. To apply substantially the cooperative urban housing plan based on the neighborhood agreement, we need to supplement the sectional plan system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.3
• /
• pp.533-540
• /
• 2021

To evaluate the performance of a system, one-dimensional 3-neighborhood cellular automata(CA) based pseudo-random generators are widely used in many fields. Although two-dimensional CA and one-dimensional 5-neighborhood CA have been applied for more effective key sequence generation, designing symmetric one-dimensional 5-neighborhood CA corresponding to a given primitive polynomial is a very challenging problem. To solve this problem, studies on one-dimensional 5-neighborhood CA synthesis, such as synthesis method using recurrence relation of characteristic polynomials and synthesis method using Krylov matrix, were conducted. However, there was still a problem with solving nonlinear equations. To solve this problem, a symmetric one-dimensional 5-neighborhood CA synthesis method using a transition matrix of 90/150 CA and a block matrix has recently been proposed. In this paper, we detail the theoretical process of the proposed algorithm and use it to obtain symmetric one-dimensional 5-neighborhood CA corresponding to high-order primitive polynomials.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.34-43
• /
• 2010

Texture information plays an important role in object recognition and classification. To perform an accurate classification, the texture feature used in the classification must be highly discriminative. This paper presents a novel texture descriptor for texture-based image retrieval and its application in Computer-Aided Diagnosis (CAD) system for Emphysema classification. The texture descriptor is based on the combination of local surrounding neighborhood difference and centralized neighborhood difference and is named as Combined Neighborhood Difference (CND). The local differences of surrounding neighborhood difference and centralized neighborhood difference between pixels are compared and converted into binary codewords. Then binomial factor is assigned to the codewords in order to convert them into high discriminative unique values. The distribution of these unique values is computed and used as the texture feature vectors. The texture classification accuracies using Outex and Brodatz dataset show that CND achieves an average of 92.5%, whereas LBP, LND and Gabor filter achieve 89.3%, 90.7% and 83.6%, respectively. The implementations of CND in the computer-aided diagnosis of Emphysema is also presented in this paper.

• Journal of Preventive Medicine and Public Health
• /
• v.51 no.1
• /
• pp.23-32
• /
• 2018

Objectives: To identify the associations of characteristics of the neighborhood environment with substance abuse among clients receiving treatment for drug abuse in Thailand. Methods: A cross-sectional study was conducted of 1128 drug addicts from 28 neighborhoods who were receiving treatment at all 7 compulsory drug detention centers in Thailand. A trained interviewer conducted structured interviews with the subjects about substance use and the perceived neighborhood environment in their community. A multilevel logistic regression model was applied to estimate the effects of the neighborhood environment on substance use. Results: The majority of participants, 53.8% only used methamphetamine pills, 31.3% used other illicit drugs as well as methamphetamine pills, and 14.9% used an illicit drug other than methamphetamine. Three neighborhood characteristics were associated with substance use. A 1-unit increase in the perceived neighborhood cohesion score was associated with a 15% reduction in methamphetamine pill use and an 11% reduction of the use of both methamphetamine pills and another illicit drug. Conversely, a 1-unit increase in perceived neighborhood crime predicted 19 and 14% increases in the use of methamphetamine pills and the use of both methamphetamine pills and another illicit drug, respectively. In addition, a 1-unit increase in the scores for stigma surrounding addiction corresponded to a 25% increase of the use of methamphetamine pills and a 12% increase in the use of both methamphetamine pills and another illicit drug. Conclusions: Substance use among drug addicts was influenced by characteristics of the neighborhood environment. Therefore, prevention and intervention strategies should be designed based on a consideration of the impact of neighborhood context on substance use behaviors.

• Journal of Korean Institute of Industrial Engineers
• /
• v.43 no.1
• /
• pp.1-11
• /
• 2017

Stochastic resource-constrained project scheduling problem is an extension of resource-constrained project scheduling problem such that activity duration has stochastic nature. In real situation where activity duration is not known until the activity is finished, open-loop based static policies such as activity-based policy and priority-based policy will not well cope with duration variability. Then, a dynamic policy based on closed-loop decision making will be regarded as an alternative toward achievement of minimal makespan. In this study, a dynamic policy designed to select activities to start at each decision time point is illustrated. The performance of static and dynamic policies based on variable neighborhood search is evaluated under the discrete-event simulation environment. Experiments with J120 sets in PSPLIB and several probability distributions of activity duration show that the dynamic policy is superior to static policies. Even when the variability is high, the dynamic policy provides stable and good solutions.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.737-745
• /
• 2008

In this paper, a novel neighborhood metric of histogram equalization (HE) algorithm for contrast enhancement is presented. We present a refinement of HE using neighborhood metrics with a general framework which orders pixels based on a sequence of sorting functions which uses both global and local information to remap the image greylevels. We tested a novel sorting key with the suggestion of using the original image greylevel as the primary key and a novel neighborhood distinction metric as the secondary key, and compared HE using proposed distinction metric and other HE methods such as global histogram equalization (GHE), HE using voting metric and HE using contrast difference metric. We found that our method can preserve advantages of other metrics, while reducing drawbacks of them and avoiding undesirable over-enhancement that can occur with local histogram equalization (LHE) and other methods.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.3
• /
• pp.41-48
• /
• 2019

The purpose of this study is to investigate the environmental factors relating to children's outdoor play and to assess how the residential neighborhood is suitable for play in the perception of parents. Based on a citywide survey of 500 parents of elementary school students in grades 1-4 in Seoul, this empirical study shows that children's outdoor play environments in residential neighborhoods of Seoul have been observed to be overall unsuitable for play activity. Three physical environmental factors (spatial availability, neighborhood attractiveness, and street difficulties) and three social environmental factors (fear of crime, social interactions, and psychological comfort) are related to children's play activity. Five factors, with the exception of the psychological comfort factor, impact the suitability of children's outdoor play environment. Specifically, it is the physical environment, rather than the social environment, that was deemed unsuitable in spite of its impacts. These findings help us understand the current conditions of neighborhood play environments associated with children's play activity. It is necessary to improve parents' perceptions of the play environment and children's play activities by improving the physical environment.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1105-1112
• /
• 2020

One-dimensional 3-neighborhood Cellular Automata (CA)-based pseudo-random number generators are widely applied in generating test patterns to evaluate system performance and generating key sequence generators in cryptographic systems. In this paper, in order to design a CA-based key sequence generator that can generate more complex and confusing sequences, we study a one-dimensional symmetric 5-neighborhood CA that expands to five neighbors affecting the state transition of each cell. In particular, we propose an n-cell one-dimensional symmetric 5-neighborhood CA synthesis algorithm using the algebraic method that uses the Krylov matrix and the one-dimensional 90/150 CA synthesis algorithm proposed by Cho et al. [6].

• Journal of Intelligence and Information Systems
• /
• v.18 no.3
• /
• pp.119-135
• /
• 2012

Among various recommendation techniques, neighborhood-based Collaborative Filtering (CF) techniques have been one of the most widely used and best performing techniques in literature and industry. This paper proposes new approaches that can enhance the neighborhood-based CF techniques by identifying a few best neighbors (the most similar users to a target user) more accurately with more information about neighbors. The proposed approaches put more weights to the users who have more items co-rated by the target user in similarity computation, which can help to better understand the preferences of neighbors and eventually improve the recommendation quality. Experiments using movie rating data empirically demonstrate simultaneous improvements in both recommendation accuracy and diversity. In addition to the typical single rating setting, the proposed approaches can be applied to the multi-criteria rating setting where users can provide more information about their preferences, resulting in further improvements in recommendation quality. We finally introduce a single metric that measures the balance between accuracy and diversity and discuss potential avenues for future work.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.43-51
• /
• 2001

As the density of memories increases, unwanted interference between cells and coupling noise between bit-lines are increased. And testing high-density memories for a high degree of fault coverage can require either a relatively large number of test vectors or a significant amount of additional test circuitry. So far, conventional test algorithms have focused on faults between neighborhood cells, not neighborhood bit-lines. In this paper, a new test algorithm for neighborhood bit-line sensitive faults (NBLSFs) based on the NPSFs(Neighborhood Pattern Sensitive Faults) is proposed. And the proposed algorithm does not require any additional circuit. Instead of the conventional five-cell or nine-cell physical neighborhood layouts to test memory cells, a three-cell layout which is minimum size for NBLSFs detection is used. Furthermore, to consider faults by maximum coupling noise by neighborhood bit-lines, we added refresh operation after write operation in the test procedure(i.e.,$write{\rightarrow}\;refresh{\rightarrow}\;read$). Also, we show that the proposed algorithm can detect stuck-at faults, transition faults, coupling faults, conventional pattern sensitive faults, and neighborhood bit-line sensitive faults.