• Title/Summary/Keyword: Common number network

Search Result 210, Processing Time 0.017 seconds

Algorithm for Common Number Network of Sum Clue Sujiko Puzzle (합 실마리 수지코 퍼즐에 관한 공통 숫자 망 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.5
    • /
    • pp.83-88
    • /
    • 2024
  • In a grid board with 9 cells of 3×3, the sum clue Sujiko puzzle with 4 fixed sum clues(FSCs) and variable sum clues(VSCs) is an NP-complete problem with no known way to solve the puzzle in polynomial time. To solve this puzzle 9! in all possible cases, a brute-force method should be applied to substitute the number. This paper determined the unique combination number cell by reducing the number of candidates that can enter empty cells. If the only number combination cell no longer exists, this paper proposes a method for determining a common number network with numbers common to the intersection cell of FSC+VSC. Applying the proposed algorithm to 9 benchmarking experimental data showed that puzzles can be solved in polynomial time for all problems.

An Efficient Routing Algorithm Based on the Largest Common Neighbor and Direction Information for DTMNs (DTMNs를 위한 방향성 정보와 최대 공동 이웃 노드에 기반한 효율적인 라우팅 프로토콜)

  • Seo, Doo Ok;Lee, Dong Ho
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.1
    • /
    • pp.83-90
    • /
    • 2010
  • DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.

A Study on the Topology Design Algorithm for Common Channel Signalling Network (공통선 신호망의 토폴로지 설계 알고리즘에 관한 연구)

  • 이준호;김중규;이상배;박민용
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.5
    • /
    • pp.369-381
    • /
    • 1991
  • In this paper, design algorithms for SMP(Single Mated Pair) and MMP (Multipli Mated Pair) structure of CCS (Common Channel Signaling) network are proposed through the study of the structure of CCS network. High reliability and fast messagy transfer time are the most important requirements for the CCS network. Based on it, three parameters such as monotraffic, reliability (maximum isolated SP(Signalling Point) number when any two STP(Signalling Transfer Points) fail and total network cost are defined. And the proposed algorithms different from preexisted algorithm that minimizes total network cost, maximize monotraffic with two constraints, reliability and total network cost. Comparing the experimental results of the proposed algorithms with those of the preexisted algorithm that minimizes total network cost, shows that the proposed algorithms produce a more reliable topology that has more monotraffic and a little higher total network cost. Additionaly, with the results of the proposed algorithms, SMP and MMP structures are compared.

  • PDF

The Wireless Network Optimization of Power Amplification via User Volume in the Microcell Terrain

  • Guo, Shengnan;Jiang, Xueqin;Zhang, Kesheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2581-2594
    • /
    • 2018
  • The microcell terrain is the most common wireless network terrain in our life. In order to solve wireless network optimization of weak coverage in the microcell terrain, improve call quality and reduce the cost of the premise, power amplifiers in base stations should be adjusted according to user volume. In this paper, characteristics of microcell topography are obtained after analysis. According to the topography characteristics of different microcells, changes in the number of users at different times have been estimated, meanwhile, the number of scatter users are also obtained by monitoring the PCCPCH RSCP and other parameters. Then B-Spline interpolation method has been applied to scatter users to obtain the continuous relationship between the number of users and time. On this basis, power amplification can be chosen according to changes in the number of users. The methods adopted by this paper are also applied in the engineering practice, sampling and interpolation are used to obtain the number of users at all times, so that the power amplification can be adjusted by the number of users in a microcell. Such a method is able to optimize wireless network and achieve a goal of expanding the area of base stations, reduce call drop rate and increase capacity.

Development of Task Assignment Strategy for the Optimized Utilization of the Real-time Network System (실시간 네트워크 시스템의 이용률 최적화를 위한 태스크 배치 전략 개발)

  • Oh, Jae-Joon;Kim, Hong-Ryeol;Kim, Dae-Won
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.72-75
    • /
    • 2004
  • In this paper, the task assignment strategy considering communication delay and the priority of distributed tasks is proposed for the real-time network system in order to maximize the utilization of the system. For the task assignment strategy, the relationship among priority of tasks in network nodes, the calculation time of each task, and the end-to-end response time including the network delay is formulated firstly. Then, the task assignment strategy using the genetic algorithm is proposed to optimize the utilization of the system considering the LCM(Least Common Multiple) period. The effectiveness of proposed strategy is proven by the simulation for estimating the performance such as the utilization and the response time of the system in case of changing the number of tasks and the number of network nodes.

  • PDF

Optimal Soft-combine Zone Configuration in a Multicast CDMA Network (멀티캐스트 CDMA 네트워크에서의 Soft-combine을 지원할 기지국의 선정)

  • Kim Jae-Hoon;Myung Young-Soo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.3
    • /
    • pp.1-10
    • /
    • 2006
  • In this paper we deal with a cell planning issue arisen in a CDMA based multicast network. In a CDMA based wireless network, a terminal can significantly reduce the bit error rate via the cohesion of data streams from multiple base stations. In this case, multiple base stations have to be operated according to a common time line. The cells whose base stations are operated as such are called soft-combined cells. Therefore, a terminal can take advantage of error rate reduction, if the terminal is in a soft-combined cell and at least one neighboring cell is also soft-combined. However, as soft-combining operation gives heavy burden to the network controller, the limited number of cells can be soft-combined. Our problem us to find a limited number of soft-combined cells such that the benefit of the soft-combining operation is maximized.

Synchronization of Common Channel in Distributed Push Servers (분산 푸시서버에서 공통채널 연동)

  • 연승호;김영헌;한군희;백순화;전병민
    • Journal of Broadcast Engineering
    • /
    • v.5 no.1
    • /
    • pp.130-138
    • /
    • 2000
  • The paper describes a push system, a broadcasting system in the internet, which is developed for internet and intranet use. In this paper, we carried out research on the method to support the large number of users in the intranet environment. Particularly the paper analyzes the effects on the network traffic according to the number of the user connected to the push system and the frequency of the connections when push servers are distributed over the intranet. Push system described here uses two different kinds of channels, common channel and local channel. Common channel is the channel to be replicated among the push servers in the intranet. This paper shows that the method using the common channel synchronization is efficient in supporting the large number of intranet users. We introduce an algorithm to make the interconnections between channels efficiently amongpush servers distributed over the intranet.

  • PDF

An Area Efficient Network Interface Architecture (NoC에서 면적 효율적인 Network Interface 구조에 관한 연구)

  • Lee, Ser-Hoon;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5C
    • /
    • pp.361-370
    • /
    • 2008
  • NoC is adopted for data communication between processors and IPs in MPSoC system. NoC has an advantage of scalability in that system can be easily expanded just by adding switches. However, as the number of switches increases, chip area increases as well as data transfer latency. This paper proposes an architecture that can reduce the number of switches in the system by sharing network interfaces. To reduce NI area, the modules sharing network interface use a common buffer in network interface. Experimental results show that the chip area has been reduced by 46.5% and data transfer latency by 17.1%, respectively, compared to conventional architecture.

Genome-Wide Association Study between Copy Number Variation and Trans-Gene Expression by Protein-Protein Interaction-Network (단백질 상호작용 네트워크를 통한 유전체 단위반복변이와 트랜스유전자 발현과의 연관성 분석)

  • Park, Chi-Hyun;Ahn, Jae-Gyoon;Yoon, Young-Mi;Park, Sang-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.18D no.2
    • /
    • pp.89-100
    • /
    • 2011
  • The CNV (Copy Number Variation) which is one of the genetic structural variations in human genome is closely related with the function of gene. In particular, the genome-wide association studies for genetic diseased persons have been researched. However, there have been few studies which infer the genetic function of CNV with normal human. In this paper, we propose the analysis method to reveal the functional relationship between common CNV and genes without considering their genomic loci. To achieve that, we propose the data integration method for heterogeneity biological data and novel measurement which can calculate the correlation between common CNV and genes. To verify the significance of proposed method, we has experimented several verification tests with GO database. The result showed that the novel measurement had enough significance compared with random test and the proposed method could systematically produce the candidates of genetic function which have strong correlation with common CNV.

A CLB based CPLD Low-power Technology Mapping Algorithm (CLB 구조의 CPLD 저전력 기술 매핑 알고리즘)

  • 김재진;윤충모;인치호;김희석
    • Proceedings of the IEEK Conference
    • /
    • 2003.07b
    • /
    • pp.1165-1168
    • /
    • 2003
  • In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

  • PDF