2016 (359)
2015 (182)
2014 (116)
2013 (55)
2012 (31)
2011 (24)
2010 (18)
2009 (19)
2008 (8)
Study on Micro-Grid Power Storage Converter
보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing Vol.8 No.3 2015.06 pp.337-350
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
In the micro-grid, power storage converter is played as a interface between the battery pack and grid electricity storage device, to achieve a two-way exchange of energy. In this paper, the research and development of power storage converter can realize multiple sets of independent control of the battery, flexible configuration of the system capacity and flexible cutting of the battery pack. Structural design uses multi-level topology. It contains 15 non-isolated half-bridge parallel bi-directional DC / DC converter. Control strategy designed to be grid inverter adopts SVPWM control technology. DC / DC converter designed to improve the droop control strategy based on environmental design. The high-power energy storage converter product this paper designed have completed the charge and discharge related droop control and Full power grid experiment. The charge and discharge currents accurately track the current instruction and the grid efficiently is more than 95%. It verified the rationality and effectiveness of the design and is the important part of the optical storage and solar power generation systems.
Privacy-Preserving for Check-In Services in MSNS Based on Ant Colony Algorithm
보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing Vol.8 No.3 2015.06 pp.351-358
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
The sign-in service of Mobile Social Networking Services (MSNS) has a serious issue of privacy disclosure. As to solving this issue, there is a method proposed to protect privacy. This method is to conduct binary coding for sign-in sequence and then construct ant path diagram. The random search, the positive and negative feedback principle of ant path graph are applied to mine frequent item sets. The longest common subsequence is achieved from sign-in sequence and corresponding frequent item sets. Finally, k-anonymous sign-in sequence will be obtained. Based on real data, this method is compared with (k, δ) - anonymity which proves the accuracy and efficiency of this method through various aspects.
보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing Vol.8 No.3 2015.06 pp.359-370
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
This paper presents a hybrid algorithm for traveling salesman problem. The algorithm is a combination of the genetic algorithm and simulated annealing algorithm; in other words, it is a hybrid algorithm. The combination overcomes the deficiencies of the two algorithms when acting separately. The real distance between customers has been used on the basis of geographical information system (GIS) in order to make the result more suitable in real-life. The algorithm has tested on the examples of international standards. We made a comparison with the result of second nearest neighbor algorithm and genetic optimization algorithm. The test showed that the algorithm proposed in this paper has improved the results.
0개의 논문이 장바구니에 담겼습니다.
선택하신 파일을 압축중입니다.
잠시만 기다려 주십시오.