• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1C
• /
• pp.37-47
• /
• 2011

In this paper, we propose a novel ML decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a depth- or breadth-first search method, possibly exploiting the advantages of both the depth- and breadth-first search methods in an organized way. Numerical results indicate that, when the depth- and breadth-first search algorithms are adopted appropriately, the proposed scheme exhibits substantially lower computational complexity than conventional ML decoders while maintaining the ML bit error performance.

• Asia Marketing Journal
• /
• v.15 no.3
• /
• pp.97-115
• /
• 2013

This paper was motivated by two gaps in the extant literature on brand portfolio planning. First, research has shown that, as the number of products connected to a brand increases, the extended product receives more favorable evaluations. However, this result was obtained by comparing two brands with different number of products while controlling the brands' breadths. Hence one may question if the above result would hold when the brand is narrow as well as broad. Second, the literature has investigated the effect of brand breadth on the perceived fit and evaluations of an extended product within a relatively limited range ("narrow vs. broad") and not considered the case of a "very broad" brand. To address these gaps, we propose two hypotheses: 1) the effects of the number of products associated with a brand on the perceived fit and evaluations of a moderately far brand extension are moderated by the brand's breadth (H1); and 2) the relationship between a brand's breadth and a moderately far extension's perceived fit and evaluations looks like an inverse-U shape (H2). Study 1 was conducted to test H1. Study 1 employed a 2 × 2 within-subjects design in which the first factor was the number of products (small (2) or large (5)), and the second factor was brand breadth (narrow or broad). We measured brand breadth as the perceived similarity among products associated with a brand. Participants provided the perceived fit and evaluations of an extended product. Study 2 was conducted to test H2 as well as to replicate Study 1 in a more general setting and with different products. It employed a 2 × 3 within-subjects design, in which the first factor was the number of products (small (2) or large (5)), and the second factor was brand breadth (narrow, broad, or very broad). The results from two experiments support both hypotheses. This paper contributes to the literature on brand extensions in two ways. First, it broadens our understanding of the effects of product number and brand breadth on extended product evaluations by considering the two factors jointly. Second, we believe this study to be the first to present evidence that brand breadth can exert an inverted U-shape effect on the perceived fit and evaluations of an extended product. The results also offer implications for marketers. First, marketers should heed the finding that adding similar products to a narrow brand does not help the brand's extension launch. Second, the finding that the relationship between brand breadth and extended product evaluations might not be linear provides practical implications. While a narrow brand should not keep launching close extensions, nor should a broad brand continue producing far extensions to broaden its breadth. A firm with a broad corporate or family brand might want to consider introducing a new brand instead of adding dissimilar products under the brand umbrella.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.258-260
• /
• 2007

Nowadays the automotive circuit design becomes more complicated a practical modern car circuit usually contains thousands of wires. So the error connection between connector and pins becomes more difficult to be located. This paper proposes a general way to locate all error wires in an automotive circuit design. Firstly, we give an exact definition of error wire to guide our job. This definition also composes the core part of our algorithm. Then we limit the area of the error wires by several steps. During these steps, we apply breadth-first search method to step over all wires under consideration of reducing time cost. In addition, we apply bidirectional stack technique to organize the data structure for algorithm optimization. This algorithm can get a result with all error wires and doubtful wires in a very efficient way. The analysis of this algorithm shows that the complexity is linear. We also discuss some possible improvement of this algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.5
• /
• pp.468-574
• /
• 1991

In construction of breadth-frist tree, the communication complexity can be reduced by efficent synchronization schemes based on several threshold values, We determine several new threshold values by considering the graph density represented as lognm, where n and m are the number of nodes and links., repectively. When thesethreshold values are used in the synchroization method for constructing distrbuted bradth-first search tree, we can obtain a more efficient algorithm in sparse graphs, and also, this algorithm has vthe same performance for communication complexity in dense graphs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.34-42
• /
• 2007

The sphere decoder (SD) has recently been proposed to perform maximum likelihood (ML) decoding for multi-input multi-output systems. Employing a 'breadth-first' searching algorithm for closet points in a lattice, we propose a novel ML decoding scheme for multi-input multi-output systems. Simulation results show that the proposed scheme has the same bit error rate performance as the conventional ML decoders while allowing significantly lower computational burden than the SD.

• Fashion & Textile Research Journal
• /
• v.20 no.1
• /
• pp.75-82
• /
• 2018

This study was attempted to clarify differences in sizes and shapes of foot between 20's and 60-70's women and analyzed the characteristics of elderly women's foot shapes as compared with those of young. The 2D data were 101 elderly and 101 young women in Seoul and Gyeonggi-do. The results are as follows: Firstly, the foot length of the elderly was shorter than that of the young, the foot breadth and the heel width were widened, but the toes breadth became smaller and the deformity of the toe 1 and the first metatarsal part appeared. Secondly, in the Foot Index, there was a significant difference in age group, the young is more than the elderly in the narrow type, standard type, the elderly women showed more than three times the young in the wide type. Thirdly, in the factor analysis for the foot type classification, 'foot length' factors in both age groups were large. Next, young group were influenced by 'toes breadth', lateral ball breadth' factors, elderly group was influenced by the 'lateral ball breadth', 'medial ball breadth' factors. Lastly, in the cluster analysis of the elderly group, the types of sole were classified as W-Type(20.8%, wide foot and toes, large heel), H-type(20.8%, small toes breadth, heel), D-type(31.7%, long length and wide lateral ball) and A-Type(26.7%, which is found only in the elderly, small length and large toes angle). As a result, it is necessary to design the shoes that match the characteristics of the soles of the elderly women.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.782-791
• /
• 2013

This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots. In order to match up targets with measured azimuths, we apply the maximum likelihood (ML), depth-first, and breadth-first tree search algorithms, in which we use the measured azimuths and the number of pixels on IR screen for pruning branches and selecting candidates. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the probability of missing target, mean of the number of calculating nodes, and mean error of the estimated coordinates of the proposed algorithms.

• East Asian Journal of Business Economics (EAJBE)
• /
• v.6 no.4
• /
• pp.13-24
• /
• 2018

Purpose - This study investigates the moderation effect of internal factor, a firms size, on the external knowledge sourcing strategy and its effectiveness in generating radical innovation. We incorporate concepts of breadth and depth as two measures to gauge the degree of openness in firms external search Research design and methodology - The dependent variable in the regression model is the percentage of innovative sales and therefore, Tobit regression is employed for estimating significant factors affecting on the ratio of first-to-market by breadth and depth in external knowledge, internationalization, and size. Results - The results show that the external knowledge, in terms of both breadth and depth, has a positive relationship with radical innovation. However internationalization as external knowledge resources is not statistically accepted. Firm size has moderating effect on innovation negatively only in case of using external knowledge resources to a high degree. Conclusions - Firms obtain external information mostly from customers, competitors, and suppliers etc. empirical knowledge in terms of scope and intensity is an important contributor to innovation. And intensity use of external knowledge and information resources can work in favor of smaller firms rather than larger ones. Internationalization seems to have little effect on innovation but it requires further researches with clear criteria and more data.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.27-34
• /
• 2010

Web crawlers are fundamental programs which iteratively download web pages by following links of web pages starting from a small set of initial URLs. Previously several web crawling orderings have been proposed to crawl popular web pages in preference to other pages, but some graph search techniques whose characteristics and efficient implementations had been studied in graph theory community have not been applied yet for web crawling orderings. In this paper we consider various graph search techniques including lexicographic breadth-first search, lexicographic depth-first search and maximum cardinality search as well as well-known breadth-first search and depth-first search, and then choose effective web crawling orderings which have linear time complexity and crawl popular pages early. Especially, for maximum cardinality search and lexicographic breadth-first search whose implementations are non-trivial, we propose linear-time web crawling orderings by applying the partition refinement method. Experimental results show that maximum cardinality search has desirable properties in both time complexity and the quality of crawled pages.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.4
• /
• pp.274-282
• /
• 1998

A feature is a local shape of a product directly related to the manufacturing process. The feature plays a role of the bridge connecting CAD and CAM. In the process planning for he CAM, information on manufacturing is required. To get the a manufacturing information from CAD dat, we need to recognize features. Once features are recognized, they are used as an input for the process planning. In this paper, we thoroughly investigate the composite features, which are generated by interacting simple features. The simple features in the composite feature usually have precedence relation in terms of process sequence. Based on the reason for the precedence relation, we classify the composite features for the process planning. In addition to the precedence relation, approach direction is used as an input for the process planning. In the process planning, the number of set-up orientations are minimized whole process sequence for the features are generated. We propose a process planning algorithm based on the topological sort and breadth-first search of graphs. The algorithn is verified using sample products.