• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2211-2232
• /
• 2018

The unstructured and semi-structured big data in social network poses new challenges in query retrieval. This requirement needs to be met by introducing quality retrieval time measures like indexing. Due to the huge volume of data storage, there originate the need for efficient index algorithms to promote query processing. However, conventional algorithms fail to index the huge amount of frequently obtained information in real time and fall short of providing scalable indexing service. In this paper, a new LIndex algorithm, which is a heuristic on Lucene is built on Neo4jHA architecture that holds the social network Big data. LIndex is a flexible and simplified adaptive indexing scheme that ascendancy decomposed shortest paths around term neighbors as basic indexing unit. This newfangled index proves to be effectual in query space pruning of graph database Neo4j, scalable in index construction and deployment. A graph query is processed and optimized beyond the traditional Lucene in a time-based manner to a more efficient path method in LIndex. This advanced algorithm significantly reduces query fetch without compromising the quality of results in time. The experiments are conducted to confirm the efficiency of the proposed query retrieval in Neo4j graph NoSQL database.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.40-51
• /
• 2009

A paired many-to-many k-disjoint path cover (paired k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate disjoint path covers in recursive circulants G($cd^m$,d) with $d{\geq}3$ and tori, and show that provided the number of faulty elements (vertices and/or edges) is f or less, every nonbipartite recursive circulant and torus of degree $\delta$ has a paired k-DPC for any f and $k{\geq}1$ with $f+2k{\leq}{\delta}-1$.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.140-147
• /
• 2000

In our modern information society, many subjects related to computer networks are studies. The electronic bidding system based on cryptology is one of such subjects. In this study, we focus upon the bidding system used in the internet electronically. The electronic bidding system compared to the older version is time consuming and cost efficient in the process of bidding. However, there are many issues, that connected with the safety and the equality, to be resolved before the system can be applied in practice. Therefore, in this paper, we consider with the problems and requirements of the electronic bidding system and analyze the conventional electronic bidding systems based on the requirements. Also we propose the new secure efficient electronic bidding system that satisfies all requirments.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1530-1537
• /
• 2016

Recently, solar power generation shows the significant growth in the renewable energy field. Using the short-term prediction, it is possible to control the electric power demand and the power generation plan of the auxiliary device. However, a short-term prediction can be used when you know the weather forecast. If it is not possible to use the weather forecast information because of disconnection of network at the island and the mountains or for security reasons, the accuracy of prediction is not good. Therefore, in this paper, we proposed a system capable of short-term prediction of solar power generation amount by using only the weather information that has been collected by oneself. We used temperature, humidity and insolation as weather information. We have applied a moving average to each information because they had a characteristic of time series. It was composed of min, max and average of each information, differences of mutual information and gradient of it. An artificial neural network, SVM and RBF Network model was used for the prediction algorithm and they were combined by Ensemble method. The results of this suggest that using a moving average during pre-processing and ensemble prediction models will maximize prediction accuracy.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.827-838
• /
• 1999

멀티미디어 통신에서 통신 성능에 관련된 요구 사항들은 QoS 매개 변수들로서 서술된다. QoS매개 변수들에서 중요한 매개 변수 중의 하나가 전송 신뢰성이다. QoS 매개 변수로서의 신뢰성은 오류 감지, 보고 그리고 정정 기법으로 정의된다. 하지만 기존의 오류 제어 기법들은 멀티미디어 데이타의 통합된 관점을 고려하지 않았다. 그래서 우리는 MEC(multimedia-oriented error control)라고 명명된 오류 제어 기법을 제안하였다. 1 본 논문에서는 MEC기법의 성능을 조사 하였다. 성능평가 결과는 MEC기법이 기존의 오류 제어 기법보다도 낮은 전송지연(lower delay)과 호손율(blocking probability) 을 갖는다는 것을 볼 수 있었다. 결국 제안된 MEC기법은 수송 프로토콜에게 유연성과 높은 성능을 갖도록 해준다.Abstract Communication performance requirements are described as QoS parameters in multimedia communication. One of the important QoS parameters is the reliability of the transfer. As a QoS parameter, the reliability defines error detection, report and correction mechanisms. Conventional error control mechanisms, however, do not consider the integrated viewpoint of multimedia data. So we have proposed the MEC(multimedia-oriented error control). 1 In this paper, we have investigated the performance evaluation of the MEC. The results show that the MEC mechanism provides lower transfer delay and blocking probability than those of the conventional error recovery mechanism. Therefore, the proposed MEC mechanism makes the transport protocol have the flexibility and high performance.

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.935-958
• /
• 2020

The core value of finance is credit. It can be said that without credit, there can be no finance. The distributed structure of the blockchain and the low-cost trust-building mechanism based on mathematical algorithms provide a new solution and path for solving and optimizing related problems in the financial field. The blockchain technology is applied in the development of the financial industry through consensus mechanisms, smart contracts, and distributed networks. In this research, a comprehensive survey of the blockchain technology is proposed in the development of financial services including equity crowdfunding and credit investigations in inclusive finance, cross-border remittance, Internet financial payment, P2P lending, supply chains finance, and the application of blockchain in the field of anti-money laundering. This paper discusses the role of blockchain in solutions to different issues in the financial field. It also discusses the architectures in different financial service application scenarios from the perspective of the financial trust mechanism and the perspective of the technology and rule change of blockchain participation in financial innovation. Finally, the problems and challenges of blockchain in financial services are discussed, and corresponding solutions are proposed.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.176-192
• /
• 2014

The realization of Wireless Multimedia Sensor Networks (WMSNs) has been fostered by the availability of low cost and low power CMOS devices. However, the transmission of bulk video data requires adequate bandwidth, which cannot be promised by single path communication on an intrinsically low resourced sensor network. Moreover, the distortion or artifacts in the video data and the adherence to delay threshold adds to the challenge. In this paper, we propose a two stage Quality of Service (QoS) guaranteeing scheme called Prioritized Multipath WMSN (PMW) for transmitting H.264 encoded video. Multipath selection based on QoS metrics is done in the first stage, while the second stage further prioritizes the paths for sending H.264 encoded video frames on the best available path. PMW uses two composite metrics that are comprised of hop-count, path energy, BER, and end-to-end delay. A color-coded assisted network maintenance and failure recovery scheme has also been proposed using (a) smart greedy mode, (b) walking back mode, and (c) path switchover. Moreover, feedback controlled adaptive video encoding can smartly tune the encoding parameters based on the perceived video quality. Computer simulation using OPNET validates that the proposed scheme significantly outperforms the conventional approaches on human eye perception and delay.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.53-63
• /
• 1999

ATM 네트워크에서 다양한 트래픽을 특성과 QoS 요구사항을 갖는 멀티미디어 서비스의 종단간 품질을 만족시키면서 망 자원을 효율적으로 이용하기 위해서는 가상경로(virtual path : VP) 의 적절한 배치 및 대역 할당을 통한 논리적 망의 구성, 호 접속 시의 종적 경로 설정, 그리고 그와 연계된 효율적인 동적 대역 관리가 필수적으로 요구된다. 본 논문에서는 새로운 호가 시도될 때 논리적 망의 설계에서 설정된 가상경로의 대역으로 호의 품질 요구사항을 만족 시킬수 없거나 또는 미리 설정해 놓은 가상경로연결(VP Connection) 이 존재하지 않을 경우에 물리적 링크의 잔여용량을 기반으로 적절한 가상경로를 선택하여 용량을 재조정하기 위한 최적 관리 모델로서 MHR (Minimum Hop Route), MCR(Maximum Capacity Route), 그리고 MRCR (MaxMin Residual Capacity Route)방식을 제안하고 이에 대한 최적화 정식을 제안하였다. 제안된 각 최적화 모델에 대한 해를 노드의 수가 m인 네트워크에서 O(m2)의 복잡도로 구할 수 있는 알고리즘을 제시하고 시뮬레이션을 통해 제안된 최적화 모델이 망의 성능에 미치는 영향을 평균 호 차단률 평균 이용 링크의 수 , 그리고 노드 쌍간의 호 차단률의 분산등에 의해 망 운용의 효율성과 공평성등을 비교분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.4227-4240
• /
• 2019

In this paper, we present our proposed magnetic induction based wireless communication system. The proposed system is designed to perform communication as well as distance measurement in underground environments. In order to improve the communication quality, we propose and implement the adaptive channel compensation technique. Based on the fact that the channel may be fast time-varying, we keep track of the channel status each time the data is received and accordingly compensate the channel coefficient for any change in the channel status. By using the proposed compensation technique, the developed platform can reliably communicate over distances of 10m while the packet error rate is being maintained under 5%. We also implement the distance measurement block that is useful for various applications that should promptly estimate the location of nearby nodes in communication. The distance between two nodes in communication is estimated by generating a table describing pairs of the magnetic signal strength and the corresponding distance. The experiment result shows that the platform can estimate the distance of a node located within 10m range with the measurement error less than 50cm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.133-151
• /
• 2019

In order to achieve faster content distribution speed and stronger fault tolerance, a P2P peer can connect to multiple peers in parallel and receive chunks of the data simultaneously. A critical issue in this environment is selecting a set of nodes participating in swarming sessions. Previous related researches only focus on performance metrics, such as downloading time or the round-trip time, but in this paper, we consider a new performance metric which is closely related to the network and propose a peer selection algorithm that produces the set of peers generating optimal worst link stress. We prove that the optimal algorithm is practicable and has the advantages with the experiments on PlanetLab. The algorithm optimizes the congestion level of the bottleneck link. It means the algorithm can maximize the affordable throughput. Second, the network load is well balanced. A balanced network improves the utilization of resources and leads to the fast content distribution. We also notice that if every client follows our algorithm in selecting peers, the probability is high that all sessions could benefit. We expect that the algorithm in this paper can be used complementary to existing methods to derive new and valuable insights in peer-to-peer networking.