• Journal of Information Processing Systems
• /
• 제14권6호
• /
• pp.1347-1360
• /
• 2018

Owing to limited energy in wireless devices power saving is very critical to prolong the lifetime of the networks. In this regard, we designed a cross-layer optimization mechanism based on power control in which source node broadcasts a Route Request Packet (RREQ) containing information such as node id, image size, end to end bit error rate (BER) and residual battery energy to its neighbor nodes to initiate a multimedia session. Each intermediate node appends its remaining battery energy, link gain, node id and average noise power to the RREQ packet. Upon receiving the RREQ packets, the sink node finds node disjoint paths and calculates the optimal power vectors for each disjoint path using cross layer optimization algorithm. Sink based cross-layer maximal minimal residual energy (MMRE) algorithm finds the number of image packets that can be sent on each path and sends the Route Reply Packet (RREP) to the source on each disjoint path which contains the information such as optimal power vector, remaining battery energy vector and number of packets that can be sent on the path by the source. Simulation results indicate that considerable energy saving can be accomplished with the proposed cross layer power control algorithm.

• Journal of Information Processing Systems
• /
• 제18권2호
• /
• pp.188-196
• /
• 2022

Recently, neural architecture search (NAS) has received increasing attention as it can replace human experts in designing the architecture of neural networks for different tasks and has achieved remarkable results in many challenging tasks. In this study, a path-based computation neural architecture encoder (PCE) was proposed. Our PCE first encodes the computation of information on each path in a neural network, and then aggregates the encodings on all paths together through an attention mechanism, simulating the process of information computation along paths in a neural network and encoding the computation on the neural network instead of the structure of the graph, which is more consistent with the computational properties of neural networks. We performed an extensive comparison with eight encoding methods on two commonly used NAS search spaces (NAS-Bench-101 and NAS-Bench-201), which included a comparison of the predictive capabilities of performance predictors and search capabilities based on two search strategies (reinforcement learning-based and Bayesian optimization-based) when equipped with different encoders. Experimental evaluation shows that PCE is an efficient encoding method that effectively ranks and predicts neural architecture performance, thereby improving the search efficiency of neural architectures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.492-506
• /
• 2009

Index structures that are based on sequence matching for XPath processing such as ViST, PRIX and LCS-TRIM have recently been proposed to reduce the search time of XML documents. However, ViST can cause a lot of unnecessary computation and I/O when processing structural joint queries because its numbering scheme is not optimized. PRIX and LCS-TRIM require much processing time for matching XML data trees and queries. In this paper, we propose a novel index structure that solves the problems of ViST and improves the performance of PRIX and LCS-TRIM. Our index structure provides the minimum sequence matching scheme to efficiently process structural queries. Finally, to verify the superiority of the proposed index structure with the minimum sequence matching scheme, we compare our index structure with ViST, PRIX and LCS-TRIM in terms of query processing of a single path or of a branching path including wild-cards ('*' and '//' ).

• ETRI Journal
• /
• 제39권1호
• /
• pp.41-50
• /
• 2017

In connection-oriented data transport services, data loss can occur when a service experiences a problem in its end-to-end path. To resolve the problem promptly, the data transport systems providing the service must quickly modify their internal configurations, which are distributed among different locations within each system. The configurations are modified through a series of problem (event) handling procedures, which are carried out by multiple control processors in the system. This paper proposes a provisioning-to-signaling method for inter-control-processor messaging to improve the time efficiency of event processing. This method simplifies the sharing of the runtime event, and minimizes the time variability caused by the amount of event data, which results in a decrease in the latency time and an increase in the time determinacy when processing global events. The proposed method was tested for an event that required 4,000 internal path changes, and was found to lessen the latency time of global event processing by about 50% compared with the time required for general methods to do the same; in addition, it reduced the impact of the event data on the event processing time to about 30%.

• 전기학회논문지P
• /
• 제64권4호
• /
• pp.315-320
• /
• 2015

Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.527-529
• /
• 2006

In this paper, we find a robot's path using a Virtual Reality Modeling Language and overlay vision. For correct robot's path we describe a method for localizing a mobile robot in its working environment using a vision system and VRML. The robt identifies landmarks in the environment, using image processing and neural network pattern matching techniques, and then its performs self-positioning with a vision system based on a well-known localization algorithm. After the self-positioning procedure, the 2-D scene of the vision is overlaid with the VRML scene. This paper describes how to realize the self-positioning, and shows the overlap between the 2-D and VRML scenes. The method successfully defines a robot's path.

• 한국멀티미디어학회논문지
• /
• 제21권4호
• /
• pp.535-544
• /
• 2018

Developing a new texture path tool is crucial in 3D industries to automatically manage and set up texture paths for characters and environment modelings. For a better study, I compare the problems, methods and functions of the new tool(SongRepath tool) with other commonly used tools such as File Path Editor, Genie, He Texture Path. Next, I analyze the top down method system for these commonly used tools, and create a new bottom-up algorithm for a better use and efficiency. Finally, analyzing and comparing SongRepath tool with other tools in terms of operation in convenience, steps for results, checking number of Texture files, checking the numbers of new paths, checking the numbers of files not found, checking the numbers of path not changed, errors or problems, and availability of cancelation while proceeding the result. As a result, this study shows that SongRepath tool has less errors and saves more time on the processing works.

• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

• 대한전자공학회논문지TC
• /
• 제43권11호
• /
• pp.192-199
• /
• 2006

최근 인터넷 트래픽의 급격한 증가로 다양한 트래픽 처리를 위한 대역폭 확보 및 효율적인 트래픽 처리 기술이 요구되고 있다. 이러한 요구에 백본네트워크에서 발생하는 트래픽 처리를 위한 다양한 경로설정 알고리즘이 소개되고 있지만 획일적인 노드 운용으로 부분적인 링크에서의 경로 설정 실패 확률을 증가시키고 있다. 즉, 미리 결정된 최대 채널 설정 허용 시간은 한정적인 설정 성공률을 가지며 이후 발생되는 트래픽의 손실 확률을 증가시킬 수 있다. 이러한 문제점을 해결하기 위해 가변적인 연결 설정 시간을 적용하여 허용 시간을 초과한 채널 요구 트래픽의 경우도 채널 설정을 제공함으로써 추가적인 트래픽 서비스를 제공할 수 있다. 따라서 본 논문에서는 네트워크 상황 변화에 따른 가변적인 연결 설정 지연시간 파라미터를 사용하는 GLSP (Generalized Label Switch Path) 경로 설정 알고리즘을 제안하였다. 알고리즘은 획일화된 백본 네트워크의 설정 확률 값을 향상시킬 수 있는 장점을 가지고 있다.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2007년도 추계학술대회논문집
• /
• pp.109-111
• /
• 2007

Community Noise has been great concerned in public. A road traffic noise has affected too much damage on quiet living environment. In this paper, the noise barrier effect on the street has been examned. As a tool of the path analyses, a cepstrum analyses of signal processing technique has been implemented.