• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.462-465
• /
• 2000

It is important to compress three dimensional (3D) data efficiently, since 3D data are too large to store or transmit in general. In this paper, we propose a lossless compression algorithm of the 3D mesh connectivity, based on the vertex degree. Most techniques for the 3D mesh compression treat the connectivity and the geometric separately, but our approach attempts to exploit the geometric information for compressing the connectivity information. We use the geometric angle constraint of the vertex fanout pattern to predict the vertex degree, so the proposed algorithm yields higher compression efficiency than the conventional algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.701-710
• /
• 1995

A thinning algorithm is a very important procedure in order to increase recognition rate in the character recognition. This paper is the study of a parallel thinning algorithm available for the recognition of various characters, and it proposes the parallel thinning algorithm using the 8-neighbors connectivity value. Characteristics of the proposed algorithm are easiness of implementation of parallelism, the result of thinning is perfectly-8 connectivity and represented by numeric information. The proposed algorithm is very suitable for characters having many curve segments such as English, Japanese etc. Performance evaluation was performed by the measure of similarity to reference skeleton.

• ETRI Journal
• /
• v.39 no.5
• /
• pp.729-736
• /
• 2017

This work investigates secure cluster-aided multi-hop randomize-and-forward networks. We present a hop-by-hop multi-hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP) of the hop-by-hop transmission scheme. For comparison, we also analyze SCPs of traditional end-to-end transmission schemes with two relay-selection policies. We perform simulations, and our analytical results verify that the proposed hop-by-hop scheme is superior to end-to-end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop-by-hop scheme achieves near-optimal performance in terms of the SCP.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.43-46
• /
• 2008

This paper proposes an advanced test circuit for detecting the connectivity between a drum ring of laser printer and PCB. The detection circuit of charge sharing is proposed, which minimizes the influences of internal parasitic capacitances. The test circuit is composed of precharge circuit, analog comparator, level shifter. Its functional operation is verified using $0.6{\mu}m$ 3.3V/40V CMOS process parameter by HSPICE. Access time is100ns. Layout of the drum contact test circuit is $465{\mu}m\;{\times}\;117{\mu}m$.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.4
• /
• pp.1-12
• /
• 2008

The issues of developing the value added services for public transport connectivity and transfer with information and communication technologies has been discussed in terms of incorporating system facilities with public transit modes to increase the ridership of public transit. This paper demonstrates a conceptual model for providing the location based public transit transfer information service on demand with respect to system requirements, subsystems, and logical architecture based on the national ITS architecture. The subsystems in this study which include transfer information center, parking concierge, user route guidance and information provision system are also investigated in detail in order for information service and/or contents provider to develop business models on public transit connectivity and transfer. This model is expected to be utilized in providing the variety of service models with the different types of public transit connectivity and transfer systems according to the system scale and the public transit modes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1060-1068
• /
• 2016

The range-free localization using connectivity information has problems of mobile tracking. This paper proposes two Bayesian filter-based mobile tracking algorithms considering a propagation scenario. Kalman and Markov Chain Monte Carlo (MCMC) particle filters are applied according to linearity of two measurement models. Measurement models of the Kalman and MCMC particle filter-based algorithms respectively are defined as connectivity between mobiles, information fusion of connectivity information and received signal strength (RSS) from neighbors within one-hop. To perform the accurate simulation, we consider a real indoor map of shopping mall and degree of radio irregularity (DOI) model. According to obstacles between mobiles, we assume two types of DOIs. We show the superiority of the proposed algorithm over existing range-free algorithms through MATLAB simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1230-1251
• /
• 2011

This document specifies a new IPv6 deployment protocol called CHANC, which stands for Configuring Hosts to Auto-detect (IPv6, IPv6-in-IPv4, or IPv4) Network Connectivity. The main part is an application level tunneling protocol that allows Internet Service Providers (ISPs) to rapidly start deploying IPv6 service to their subscribers whom connected to the Internet via IPv4-only access networks. It carries IPv6 packets over HTTP protocol to be transmitted across IPv4-only network infrastructure. The key aspects of this protocol are: offers IPv6 connectivity via IPv4-only access networks, stateless operation, economical solution, assures most firewall traversal, and requires simple installation and automatic configuration at customers' hosts. All data packets and routing information of the IPv6 protocol will be carried over the IPv4 network infrastructure. A simple application and a pseudo network driver must be installed at the end-user's hosts to make them able to work with this protocol. Such hosts will be able to auto-detect the ISP available connectivity in the following precedence: native IPv6, IPv6-in-IPv4, or no IPv6 connectivity. Because the protocol does not require changing or upgrading customer edges, a minimal cost in the deployment to IPv6 service should be expected. The simulation analysis showed that the performance of CHANC is pretty near to those of native IPv6, 6rd, and IPv4 protocols. Also, the performance of CHANC is much better than that of D6across4 protocol.

• Journal of The Korean Association of Information Education
• /
• v.13 no.4
• /
• pp.461-470
• /
• 2009

Even though the revised operational guide for ICT education emphasizes the basic concepts of computer science, many primary and secondary schools do not deal with the changed requirements properly. Also, it is doubtful if the education considers teaching period and the levels of students or not. In this paper, we survey on the state of ICT education, the relationship between ICT education and Computer Education, and the connectivity in Computer Education between primary and secondary schools. In order to do these, we analyze the result of our questionnaire and we propose an improved method for the connectivity in Computer Education. The results are (i) primary school teachers don't consider the connectivity of Computer Education and (ii) the teachers who have higher satisfaction levels of ICT education think ICT education and Computer Education between two schools are correlated and connected. As a result, new policies to re-educate teachers are required.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.95-101
• /
• 2011

In this paper, using pixel connectivity tracking feature to remove a doctor has been studied. Feature extraction method is a method using the crossing. However, by crossing a lot of feature extraction method sis a doctor. Extracted using the method of crossing the wrong feature to remove them from the downside and the eight pixels around the fork to trace if it satisfies the conditions in the actual feature extraction and feature conditions are not satisfied because the doctor was removed. To evaluate the performance using crossing methods and extracted using pixel connectivity trace was compared to the actual feature, the experimental results using pixel connectivity trace arcuate sentence, croissants sentence, sentence the defrost feature on your doctor about47%, respectively, 40%, 30%were found to remove.