• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.1
• /
• pp.61-71
• /
• 2003

Interconnect test for highly integrated environments like SoC, becomes more important as the complexity of a circuit increases. This importance is from two facts, test time and complete diagnosis. Since the interconnect test between IPs is based on the scan technology such as IEEE1149.1 and IEEE P1500, it takes long test time to apply test vectors serially through a long scan chain. Complete diagnosis is another important issue because a defect on interconnects are shown as a defect on a chip. But generally, interconnect test algorithms that need the short test time can not do complete diagnosis and algorithms that perform complete diagnosis need long test time. A new interconnect test algorithm is developed. The new algorithm can provide a complete diagnosis for all faults with shorter test length compared to the previous algorithms.

• 한국어정보학회:학술대회논문집
• /
• 2016.10a
• /
• pp.157-161
• /
• 2016

본 논문에서는 클러스터 간의 중복을 허용한 계층적 클러스터링(hierarchical clustering) 기법에 적합한 클러스터 간 유사도 평가방법(linkage metric)을 제안하였다. 클러스터 간 유사도 평가방법은 계층적 클러스터링에서 클러스터를 통합하거나 분해하는데 쓰이며 사용된 방법에 따라 클러스터링의 결과가 다르게 형성된다. 기존의 클러스터 간 유사도 평가방법인 single linkage, complete linkage, average linkage 중 single linkage와 complete linkage는 클러스터 간 중복이 허용된 환경에서 정확도가 낮은 문제점이 있고, average linkage는 정확도가 두 방법에 비해 높지만 계산 시간 소요가 크다는 단점이 있다. 따라서 본 논문에서는 기존의 average linkage를 개선하여 중복된 데이터에 의한 필요 계산량을 크게 줄임으로써 시간적 성능이 우수한 클러스터 간 유사도 평가방법을 제안하였다. 또한, 제안된 방법을 기존 방법들과 비교실험하여 중복을 허용하는 계층적 클러스터링 환경에서 정확도는 비슷하거나 더 높고, average linkage에 비해 계산량이 감소됨을 확인하였다.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.602-608
• /
• 2015

In this paper, the limited error tracking problem is investigated for distributed leader-following wireless sensor networks (LFWSNs), where all sensors share data by the local communications, follower sensors are influenced by leader sensors directly or indirectly, but not vice versa, all sensor nodes track a reference state that is determined by the states of all leader sensors, and tracking errors are limited. In a LFWSN, the communicating graph is mainly expressed by some complete subgraphs; if we fix subgraphs that are composed of all leaders while all nodes in complete subgraphs of followers run on the sleeping-awaking method, then the fixed leaders and varying followers topology is obtained, and the switching topology is expressed by a Markov chain. It is supposed that the measurements of all sensors are corrupted by additive noises. Accordingly, the limited error tracking protocol is proposed. Based on the theory of asymptotic boundedness in mean square, it is shown that LFWSN keeps the limited error tracking under the designed protocol.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1149-1157
• /
• 2017

The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve the efficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (Improved Extension Rule) is based on extension rule. The number of atoms and the number of clauses affect the efficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithm CIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLL rules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause set is got from these small clause sets'. A strategy MOAMD (maximum occurrences and maximum difference) for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. This arrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, the algorithm CIER will be more efficient.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.283-291
• /
• 2007

A simple graph G is said to be fractional n-factor-critical if after deleting any n vertices the remaining subgraph still has a fractional perfect matching. For fractional n-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.9
• /
• pp.114-120
• /
• 1995

It is important to test the various kinds of interconnect faults between chips on a card/module. When boundary scan design techniques are adopted, the chip to chip interconnection test generation and application of test patterns is greatly simplified. Various test generation algorithms have been developed for interconnect faults. A new interconnect test generation algorithm is introduced. It reduces the number of test patterns by half over present techniques. It also guarantees the complete diagnosis of mutiple interconnect faults.

• Educational Technology International
• /
• v.12 no.2
• /
• pp.95-116
• /
• 2011

This study examines effects of Facebook on language learning in terms of facilitating interaction and collaboration by applying Facebook in a Korean language class. Forty one exchange students from seventeen countries who participated in the study used Facebook to exchange information and complete group projects. Results show that Facebook was effective in sharing class materials, engaging in class community and collaborating to complete assignments. Students also comment that socializing with peers was helpful, yet more activities and discussion to draw active participation is needed. This study also points out the important role of instructors who implement social media and manage the class.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2302-2311
• /
• 1998

The problem of scheduling general packet traffic on WDM optical interconnection networks is NP-complete, It is known that the list scheduling is a good approximation algurithm fur this problem, The resulting list schedules vary depending on the order of transmitters considered to be placed on each time slot We propose an improvement of the list scheduling that tries different orders of transmitters to obtain shorter schedule lengths, Genetic algorithms are used to explore various orders of transmitters.

• The Korean Journal of Emergency Medical Services
• /
• v.7 no.1
• /
• pp.179-198
• /
• 2003

If see disaster administration system of our country, start in terms of is coping by countermeasure after four immediately after disaster occurrence many problems blessing with a sons by tribe and so on of link nature between formation, disaster administration complete charge utensil's absence, disaster charge manpower and budget be indicated and join. If examine improvement way accordingly, is as following ; Necessity of synthetic disaster administration system, Fire fighting formation's independence guarantee, Integration of fire fighting connection similarity business, Disaster administration's permanent establishment complete charge utensil's necessity, Disaster administration midautumn complete charge utensil at a metropolitan autonomous fire fighting system reorganization, Role division of labor between center and local government, Disaster administration professional human strength positivity, Disaster administration information system construction practical use, Equipment and improvement of budget state, Education public information for safety culture consciousness fixing, Internationalization of fire fighting business, globalization propulsion, Structure, member of rescue confrontation system and efficiency. Fire fighting environment is changing greatly, and fire fighting must become center to correspond to do confrontation that do one thing troble when produce disaster.