( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Distributed dual objective control of an energy storage system under jointly connected switching networks.

, , и . Autom., (июня 2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Xiaofeng Ren

Xiaofeng Li

Xiaofeng Wu

Xiaofeng Yan

Xiaofeng Jiang

 

Другие публикации лиц с тем же именем

Quantum Ant Colony Algorithm Based on Bloch Coordinates., , и . ICICA (LNCS), том 7473 из Lecture Notes in Computer Science, стр. 405-412. Springer, (2012)Web-Conferencing Based Education: An Empirical Comparison with Face-to-Face Education., , и . AMCIS, Association for Information Systems, (2011)Impact of Business Intelligence and IT Infrastructure flexibility on Competitive Performance: An Organizational Agility Perspective., и . ICIS, Association for Information Systems, (2011)Effect of Business Intelligence and IT Infrastructure Flexibility on Organizational Agility., и . ICIS, Association for Information Systems, (2012)The Design and Implementation of Online Identification of CAPTCHA Based on the Knowledge Base., , , , и . CCTA (2), том 479 из IFIP Advances in Information and Communication Technology, стр. 92-99. (2015)Protecting Electronic Signatures in Case of Key Leakage., , , , , и . Mycrypt, том 10311 из Lecture Notes in Computer Science, стр. 252-274. Springer, (2016)t-Out-of-n String/Bit Oblivious Transfers Revisited., , , , и . ISPEC, том 3439 из Lecture Notes in Computer Science, стр. 410-421. Springer, (2005)MobiShare+: Security Improved System for Location Sharing in Mobile Online Social Networks., , , , и . J. Internet Serv. Inf. Secur., 4 (1): 25-36 (2014)Advances on cloud services and cloud computing., , и . Concurr. Comput. Pract. Exp., 27 (8): 1985-1987 (2015)HVDB: a hierarchical verifiable database scheme with scalable updates., , , , и . J. Ambient Intell. Humaniz. Comput., 10 (8): 3045-3057 (2019)