• 제목/요약/키워드: Network Expansion

검색결과 805건 처리시간 0.024초

다수단 가변수요 통행배정문제를 위한 부분선형화 알고리즘의 성능비교 (A Performance Comparison of the Partial Linearization Algorithm for the Multi-Mode Variable Demand Traffic Assignment Problem)

  • 박태형;이상건
    • 대한산업공학회지
    • /
    • 제39권4호
    • /
    • pp.253-259
    • /
    • 2013
  • Investment scenarios in the transportation network design problem usually contain installation or expansion of multi-mode transportation links. When one applies the mode choice analysis and traffic assignment sequentially for each investment scenario, it is possible that the travel impedance used in the mode choice analysis is different from the user equilibrium cost of the traffic assignment step. Therefore, to estimate the travel impedance and mode choice accurately, one needs to develop a combined model for the mode choice and traffic assignment. In this paper, we derive the inverse demand and the excess demand functions for the multi-mode multinomial logit mode choice function and develop a combined model for the multi-mode variable demand traffic assignment problem. Using data from the regional O/D and network data provided by the KTDB, we compared the performance of the partial linearization algorithm with the Frank-Wolfe algorithm applied to the excess demand model and with the sequential heuristic procedures.

정보성 업무특성 따른 업무공간 레이아웃(Lay-out)에 관한 연구 (A Study on the Working space Lay-out for Working on Information in the Offices)

  • 이상호;신동준
    • 한국실내디자인학회논문집
    • /
    • 제32호
    • /
    • pp.64-71
    • /
    • 2002
  • Today, term of ‘industrial society’means the totally changing society by new technical innovation through the Industrial Revolution begun in England at the mid-nineteenth century and it made social structure centering agricultural culture change with industrial culture with expansion of goods by the massive production. Information working area has to bo a space not just for improving business efficiency in industrial society but for developing efficiency in working in harmony with the information and structural aspects based on computer and communication technology. There are two kinds of environmental elements of working space : the tangible ones are the area and the structure of working space, lights, network, layout and information machines in office, the intangible ones are a feeling of satisfaction of management and arrangement of office information machines capability of information delivery, common ownership of documents and their files, the security and connection between office workers, and harmony. According to the wave of information begun from the late twentieth century, structural layout of working area has become various by the working type through network of new developed information communication machines. But it is hard to apply them in actually.

Real-Time Stochastic Optimum Control of Traffic Signals

  • Lee, Hee-Hyol
    • Journal of information and communication convergence engineering
    • /
    • 제11권1호
    • /
    • pp.30-44
    • /
    • 2013
  • Traffic congestion has become a serious problem with the recent exponential increase in the number of vehicles. In urban areas, almost all traffic congestion occurs at intersections. One of the ways to solve this problem is road expansion, but it is difficult to realize in urban areas because of the high cost and long construction period. In such cases, traffic signal control is a reasonable method for reducing traffic jams. In an actual situation, the traffic flow changes randomly and its randomness makes the control of traffic signals difficult. A prediction of traffic jams is, therefore, necessary and effective for reducing traffic jams. In addition, an autonomous distributed (stand-alone) point control of each traffic light individually is better than the wide and/or line control of traffic lights from the perspective of real-time control. This paper describes a stochastic optimum control of crossroads and multi-way traffic signals. First, a stochastic model of traffic flows and traffic jams is constructed by using a Bayesian network. Secondly, the probabilistic distributions of the traffic flows are estimated by using a cellular automaton, and then the probabilistic distributions of traffic jams are predicted. Thirdly, optimum traffic signals of crossroads and multi-way intersection are searched by using a modified particle swarm optimization algorithm to realize real-time traffic control. Finally, simulations are carried out to confirm the effectiveness of the real-time stochastic optimum control of traffic signals.

64-비트 데이터패스를 이용한 Whirlpool 해시 함수의 하드웨어 구현 (A Hardware Implementation of Whirlpool Hash Function using 64-bit datapath)

  • 권영진;김동성;신경욱
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2017년도 추계학술대회
    • /
    • pp.485-487
    • /
    • 2017
  • 국제 표준화 기구인 ISO/IEC에서 10118-3 표준으로 채택된 Whirlpool 해시 함수는 AES 블록 암호와 유사한 SPN(Substitution Permutation Network) 구조를 기반으로 하여 메시지의 무결성을 제공하는 알고리듬이다. 본 논문에서는 Whirlpool 해시 함수의 하드웨어 구현에 대해서 기술한다. 라운드 블록은 64-비트 데이터 패스로 설계하였으며, 10회의 라운드에 걸쳐서 암호화가 진행된다. 면적을 최소화하기 위해 키 확장과 암호화 알고리듬은 동일한 하드웨어를 사용한다. Verilog HDL을 이용해 Whirlpool 해시 함수를 모델링하였고, ModelSim으로 시뮬레이션을 수행하여 정상 동작을 확인하였다.

  • PDF

Partially Carbonized Poly (Acrylic Acid) Grafted to Carboxymethyl Cellulose as an Advanced Binder for Si Anode in Li-ion Batteries

  • Cho, Hyunwoo;Kim, Kyungsu;Park, Cheol-Min;Jeong, Goojin
    • Journal of Electrochemical Science and Technology
    • /
    • 제10권2호
    • /
    • pp.131-138
    • /
    • 2019
  • To improve the performance of Si anodes in advanced Li-ion batteries, the design of the electrode plays a critical role, especially due to the large volumetric expansion in the Si anode during Li insertion. In our study, we used a simple fabrication method to prepare Si-based electrodes by grafting polyacrylic acid (PAA) to a carboxymethyl cellulose (CMC) binder (CMC-g-PAA). The procedure consists of first mixing nano-sized Si and the binders (CMC and PAA), and then coating the slurry on a Cu foil. The carbon network was formed via carbonization of the binders i.e., by a simple heat treatment of the electrode. The carbon network in the electrode is mechanically and electrically robust, which leads to higher electrical conductivity and better mechanical property. This explains its long cycle performance without the addition of a conducting agent (for example, carbon). Therefore, the partially carbonized CMC-g-PAA binder presented in this study represents a new feasible approach to produce Si anodes for use in advanced Li-ion batteries.

Modelling of Public Financial Security and Budget Policy Effects

  • Zaichko, Iryna;Vysotska, Maryna;Miakyshevska, Olena;Kosmidailo, Inna;Osadchuk, Nataliia
    • International Journal of Computer Science & Network Security
    • /
    • 제21권9호
    • /
    • pp.239-246
    • /
    • 2021
  • This article substantiates the scientific provisions for modelling the level of Ukraine's public financial security taking into account the impact of budget policy, in the process of which identified indicators of budget policy that significantly affect the public financial security and the factors of budget policy based on regression analysis do not interact closely with each other. A seven-factor regression equation is constructed, which is statistically significant, reliable, economically logical, and devoid of autocorrelation. The objective function of maximizing the level of public financial security is constructed and strategic guidelines of budget policy in the context of Ukraine's public financial security are developed, in particular: optimization of the structure of budget revenues through the expansion of the resource base; reduction of the budget deficit while ensuring faster growth rates of state and local budget revenues compared to their expenditures; optimization of debt serviced from the budget through raising funds from the sale of domestic government bonds, mainly on a long-term basis; minimization of budgetary risks and existing threats to the public financial security by ensuring long-term stability of budgets etc.

A Review of Machine Learning Algorithms for Fraud Detection in Credit Card Transaction

  • Lim, Kha Shing;Lee, Lam Hong;Sim, Yee-Wai
    • International Journal of Computer Science & Network Security
    • /
    • 제21권9호
    • /
    • pp.31-40
    • /
    • 2021
  • The increasing number of credit card fraud cases has become a considerable problem since the past decades. This phenomenon is due to the expansion of new technologies, including the increased popularity and volume of online banking transactions and e-commerce. In order to address the problem of credit card fraud detection, a rule-based approach has been widely utilized to detect and guard against fraudulent activities. However, it requires huge computational power and high complexity in defining and building the rule base for pattern matching, in order to precisely identifying the fraud patterns. In addition, it does not come with intelligence and ability in predicting or analysing transaction data in looking for new fraud patterns and strategies. As such, Data Mining and Machine Learning algorithms are proposed to overcome the shortcomings in this paper. The aim of this paper is to highlight the important techniques and methodologies that are employed in fraud detection, while at the same time focusing on the existing literature. Methods such as Artificial Neural Networks (ANNs), Support Vector Machines (SVMs), naïve Bayesian, k-Nearest Neighbour (k-NN), Decision Tree and Frequent Pattern Mining algorithms are reviewed and evaluated for their performance in detecting fraudulent transaction.

IPsec System에서 IKEv2 프로토콜 엔진의 구현 및 성능 평가 (An Implementation and Performance Evaluation of IPsec System engaged IKEv2 Protocol Engine)

  • 김성찬;천준호;전문석
    • 정보보호학회논문지
    • /
    • 제16권5호
    • /
    • pp.35-46
    • /
    • 2006
  • 기존의 보안 시스템에서 키 교환에 사용되어 왔던 인터넷 키 교환 프로토콜은 확장성과 속도, 효율성 그리고 안정성에 문제가 있다는 지적을 받아 왔다. 본 연구에서는 이러한 문제점을 해결하고자 했으며, 새로 구현한 인터넷 키 교환 프로토콜을 IPsec에 연동되는 테스트베드에 탑재하여 성능평가를 하였다. 네트워크가 점점 확장되어 가는 상황에서 기존의 인터넷 키 교환 프로토콜은 네트워크의 확장성에 한계가 있기 때문에 RFC에서 제안하는 표준에 따라서 구현하였으며 키 교환 및 인증 과정에서 지적된 복잡성과 속도 문제를 해결하였다. 복잡한 메시지 교환 단계를 줄여서 속도를 향상시켰고, 재협상 시 기존 상태 값들을 재활용함으로써 효율성을 증가 시켰다.

Optimization Methods for Power Allocation and Interference Coordination Simultaneously with MIMO and Full Duplex for Multi-Robot Networks

  • Wang, Guisheng;Wang, Yequn;Dong, Shufu;Huang, Guoce;Sun, Qilu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권1호
    • /
    • pp.216-239
    • /
    • 2021
  • The present work addresses the challenging problem of coordinating power allocation with interference management in multi-robot networks by applying the promising expansion capabilities of multiple-input multiple-output (MIMO) and full duplex systems, which achieves it for maximizing the throughput of networks under the impacts of Doppler frequency shifts and external jamming. The proposed power allocation with interference coordination formulation accounts for three types of the interference, including cross-tier, co-tier, and mixed-tier interference signals with cluster head nodes operating in different full-duplex modes, and their signal-to-noise-ratios are respectively derived under the impacts of Doppler frequency shifts and external jamming. In addition, various optimization algorithms, including two centralized iterative optimization algorithms and three decentralized optimization algorithms, are applied for solving the complex and non-convex combinatorial optimization problem associated with the power allocation and interference coordination. Simulation results demonstrate that the overall network throughput increases gradually to some degree with increasing numbers of MIMO antennas. In addition, increasing the number of clusters to a certain extent increases the overall network throughput, although internal interference becomes a severe problem for further increases in the number of clusters. Accordingly, applications of multi-robot networks require that a balance should be preserved between robot deployment density and communication capacity.

Intelligent Route Construction Algorithm for Solving Traveling Salesman Problem

  • Rahman, Md. Azizur;Islam, Ariful;Ali, Lasker Ershad
    • International Journal of Computer Science & Network Security
    • /
    • 제21권4호
    • /
    • pp.33-40
    • /
    • 2021
  • The traveling salesman problem (TSP) is one of the well-known and extensively studied NPC problems in combinatorial optimization. To solve it effectively and efficiently, various optimization algorithms have been developed by scientists and researchers. However, most optimization algorithms are designed based on the concept of improving route in the iterative improvement process so that the optimal solution can be finally found. In contrast, there have been relatively few algorithms to find the optimal solution using route construction mechanism. In this paper, we propose a route construction optimization algorithm to solve the symmetric TSP with the help of ratio value. The proposed algorithm starts with a set of sub-routes consisting of three cities, and then each good sub-route is enhanced step by step on both ends until feasible routes are formed. Before each subsequent expansion, a ratio value is adopted such that the good routes are retained. The experiments are conducted on a collection of benchmark symmetric TSP datasets to evaluate the algorithm. The experimental results demonstrate that the proposed algorithm produces the best-known optimal results in some cases, and performs better than some other route construction optimization algorithms in many symmetric TSP datasets.