• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 D
• /
• pp.2531-2533
• /
• 2005

The proposed neural network technique is the real time computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objects during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of objects. All of therm request much memory space and time. Therefore the most reliable neural-network algorithm is drived for real-time matching of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques in moving objects.

• 한국측량학회지
• /
• 제5권2호
• /
• pp.12-23
• /
• 1987

본 연구에서는 국립지리원에서 1974년-1986년에 수행한 우리나라 제 1차 1등수준측량 데이터의 철저한 분석이 이루어졌다. 각 노선별 정확도의 분석과 조정결과의 검토를 통하여 각국의 경우와 비교ㆍ평가되었다. 연구결과로는 수준망에 내재된 정오차가 전반적으로 크게 나타나고 있으나 국제측지학협회(IAG)의 정밀수준측량 정확도를 만족하고 있으므로 지도제작이나 건설공사용으로 타당함을 보여주고 있다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.707-710
• /
• 2005

In this paper, we propose a new communication network for on-chip communication. The network is based on a direct sequence code division multiple access (DS-CDMA) technique. The new communication network is suitable for a parallel processing system and also drastically reduces the I/O pin count. Our network architecture is mainly divided into a CDMA-based network interface (CNI), a communication channel, a synchronizer. The network includes a reverse communication channel for reducing latency. The network decouples computation task from communication task by the CNI. An extreme truncation is considered to simplify the communication link. For the scalability of the network, we use a PN-code reuse method and a hierarchical structure. The network elements have a modular architecture. The communication network is done using fully synthesizable Verilog HDL to enhance the portability between process technologies.

• 한국콘텐츠학회논문지
• /
• 제5권1호
• /
• pp.189-199
• /
• 2005

그리드 컴퓨팅은 과학기술 분야의 큰 문제들을 해결하기 위해 네트워크 상에 분산된 수많은 컴퓨터들의 컴퓨팅 파워와 대용량 저장장치를 공유하여 문제들을 해결할 수 있는 기술이다. 그리드 컴퓨팅의 환경은 WAN으로 구성된 각기 다른 성능과 이질적인 네트워크 상태들로 구성된다. 그래서, 이러한 이질적인 성능요소들을 고려하여 계산 작업에 반영시키는 것이 무엇보다 중요하다. 본 논문에서는 네트워크 상태정보를 고려한 노드별 작업 프로세스 수를 결정하는 효율적인 방법을 제안한다. 네트워크 상태정보는 latency, bandwidth, latency-bandwidth 혼합정보를 고려한다. 먼저, 측정된 네트워크 상태정보를 이용하여 노드별 성능비율을 구하고 이를 통해 작업 프로세스 수를 결정한다. 마지막 단계에서는, 결정된 노드별 작업 프로세스 수를 기반으로 자동으로 RSL 파일을 생성하여 작업을 수행한다. 네트워크 성능정보는 NWS(Network Weather Service)에 의해 수집된다. 실험결과에 따르면, 네트워크 성능정보를 고려한 방법이 그렇지 않은 기존의 균등방식보다 작업량, 작업 프로세스 수, 노드 수 관점에서 각각 23%, 31%, 57% 성능이 향상되었다.

• 안보군사학연구
• /
• 통권1호
• /
• pp.345-360
• /
• 2003

To build an information oriented armed forces, the Korean military telecommunication networks adopt TCP/IP standard communication infrastructures based on ATM packet switched networks. Utilizing this network infrastructure, the Korean armed forces also applies to the areas of battleship management for efficient operation command controls and resource management for efficient resource allocations. In this military communication networks, it is essential to determine the least cost network topology under equal performance and reliability constraints. Basically, this type of communication network design problem is known in the literature as an NP Hard problem. As the number of network node increases, it is very hard to obtain an optimal solution in polynomial time. Therefore, it is reasonable to use a heuristic algorithm which provides a good solution with minimal computational efforts. In this study, we developed a simulated annealing based heuristic algorithm which can be utilized for the design of military communication networks. The developed algorithm provides a good packet switched network topology which satisfies a given set of performance and reliability constraints with reasonable computation times.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1570-1594
• /
• 2017

Social network services have recently changed from environments for simply building connections among users to open platforms for generating and sharing various forms of information. Existing user reputation computation methods are inadequate for determining the trust in users on social media where explicit ratings are rare, because they determine the trust in users based on user profile, explicit relations, and explicit ratings. To solve this limitation of previous research, we propose a user reputation computation method suitable for the social media environment by incorporating implicit as well as explicit ratings. Reliable user reputation is estimated by identifying malicious information raters, modifying explicit ratings, and applying them to user reputation scores. The proposed method incorporates implicit ratings into user reputation estimation by differentiating positive and negative implicit ratings. Moreover, the method generates user reputation scores for individual categories to determine a given user's expertise, and incorporates the number of users who participated in rating to determine a given user's influence. This allows reputation scores to be generated also for users who have received no explicit ratings, and, thereby, is more suitable for social media. In addition, based on the user reputation scores, malicious information providers can be identified.

• 디지털융복합연구
• /
• 제19권5호
• /
• pp.307-313
• /
• 2021

본 논문에서는 기존 객체 검출 방법 대비 매개변수를 감소시킨 경량화 네트워크를 제안하였다. 현재 사용되는 검출 모델의 경우 정확도 향상을 위해 네트워크 복잡도를 크게 늘렸다. 따라서, 제안하는 네트워크는 EfficientNet을 특징 추출 네트워크로 사용하였으며, 후속 레이어는 저수준 세부 특징과 고수준의 의미론적 특징을 활용하기 위해 피라미드 구조로 형성하였다. 피라미드 구조 사이에 attention process를 적용하여 예측에 불필요한 노이즈를 억제하였다. 네트워크의 모든 연산 과정은 depth-wise 및 point-wise 컨볼루션으로 대체하여 연산량을 최소화하였다. 제안하는 네트워크는 PASCAL VOC 데이터셋으로 학습 및 평가하였다. 실험을 통해 융합된 특징은 정제 과정을 거쳐 다양한 객체에 대해 견고한 특성을 보였다. CNN 기반 검출 모델과 비교하였을 때 적은 연산량으로 검출 정확도가 향상되었다. 향후 연구로 객체의 크기에 맞게 앵커의 비율을 조절할 필요성이 사료된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1892-1903
• /
• 2016

Mobile social network is becoming more and more popular with respect to the development and popularity of mobile devices and interpersonal sociality. As the amount of social data increases in a great deal and cloud computing techniques become developed, the architecture of mobile social network is evolved into cloud-based that mobile clients send data to the cloud and make data accessible from clients. The data in the cloud should be stored in a secure fashion to protect user privacy and restrict data sharing defined by users. Ciphertext-policy attribute-based encryption (CP-ABE) is currently considered to be a promising security solution for cloud-based mobile social network to encrypt the sensitive data. However, its ciphertext size and decryption time grow linearly with the attribute numbers in the access structure. In order to reduce the computing overhead held by the mobile devices, in this paper we propose a new Outsourcing decryption and Match-then-decrypt CP-ABE algorithm (OM-CP-ABE) which firstly outsources the computation-intensive bilinear pairing operations to a proxy, and secondly performs the decryption test on the attributes set matching access policy in ciphertexts. The experimental performance assessments show the security strength and efficiency of the proposed solution in terms of computation, communication, and storage. Also, our construction is proven to be replayable choosen-ciphertext attacks (RCCA) secure based on the decisional bilinear Diffie-Hellman (DBDH) assumption in the standard model.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
• /
• pp.607-613
• /
• 2011

This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

• Journal of Information Processing Systems
• /
• 제18권1호
• /
• pp.12-25
• /
• 2022

In recent years, deep convolutional neural networks have made significant progress in the research of single image super-resolution. However, it is difficult to be applied in practical computing terminals or embedded devices due to a large number of parameters and computational effort. To balance these problems, we propose CSRNet, a lightweight neural network based on channel split residual learning structure, to reconstruct highresolution images from low-resolution images. Lightweight refers to designing a neural network with fewer parameters and a simplified structure for lower memory consumption and faster inference speed. At the same time, it is ensured that the performance of recovering high-resolution images is not degraded. In CSRNet, we reduce the parameters and computation by channel split residual learning. Simultaneously, we propose a double-upsampling network structure to improve the performance of the lightweight super-resolution network and make it easy to train. Finally, we propose a new evaluation metric for the lightweight approaches named 100_FPS. Experiments show that our proposed CSRNet not only speeds up the inference of the neural network and reduces memory consumption, but also performs well on single image super-resolution.