With the ever-increasing popularity of Internet of Things(IoT),massive enterprises are attempting to encapsulate their developed outcomes into various lightweight Web Application Programming Interfaces(APIs)that can b...With the ever-increasing popularity of Internet of Things(IoT),massive enterprises are attempting to encapsulate their developed outcomes into various lightweight Web Application Programming Interfaces(APIs)that can be accessible remotely.In this context,finding and writing a list of existing Web APIs that can collectively meet the functional needs of software developers has become a promising approach to economically and easily develop successful mobile applications.However,the number and diversity of candidate IoT Web APIs places an additional burden on application developers’Web API selection decisions,as it is often a challenging task to simultaneously ensure the diversity and compatibility of the final set of Web APIs selected.Considering this challenge and latest successful applications of game theory in IoT,a Diversified and Compatible Web APIs Recommendation approach,namely DivCAR,is put forward in this paper.First of all,to achieve API diversity,DivCAR employs random walk sampling technique on a pre-built“API-API”correlation graph to generate diverse“API-API”correlation subgraphs.Afterwards,with the diverse“API-API”correlation subgraphs,the compatible Web APIs recommendation problem is modeled as a minimum group Steiner tree search problem.A sorted set of multiple compatible and diverse Web APIs are returned to the application developer by solving the minimum group Steiner tree search problem.At last,a set of experiments are designed and implemented on a real dataset crawled from www.programmableweb.com.Experimental results validate the effectiveness and efficiency of our proposed DivCAR approach in balancing the Web APIs recommendation diversity and compatibility.展开更多
Intelligent vehicles are advancing at a fast speed with the improvement of automation and connectivity,which opens up new possibilities for different cyber-attacks,including in-vehicle attacks(e.g.,hijacking attacks)a...Intelligent vehicles are advancing at a fast speed with the improvement of automation and connectivity,which opens up new possibilities for different cyber-attacks,including in-vehicle attacks(e.g.,hijacking attacks)and vehicle-to-everything communicationattacks(e.g.,data theft).These problems are becoming increasingly serious with the development of 4G LTE and 5G communication technologies.Although many efforts are made to improve the resilience to cyber attacks,there are still many unsolved challenges.This paper first identifies some major security attacks on intelligent connected vehicles.Then,we investigate and summarize the available defences against these attacks and classify them into four categories:cryptography,network security,software vulnerability detection,and malware detection.Remaining challenges and future directions for preventing attacks on intelligent vehicle systems have been discussed as well.展开更多
Sports matches are very popular all over the world.The prediction of a sports match is helpful to grasp the team's state in time and adjust the strategy in the process of the match.It's a challenging effort to...Sports matches are very popular all over the world.The prediction of a sports match is helpful to grasp the team's state in time and adjust the strategy in the process of the match.It's a challenging effort to predict a sports match.Therefore,a method is proposed to predict the result of the next match by using teams'historical match data.We combined the Long Short-Term Memory(LSTM)model with the attention mechanism and put forward an ASLSTM model for predicting match results.Furthermore,to ensure the timeliness of the prediction,we add the time sliding window to make the prediction have better timeliness.Taking the football match as an example,we carried out a case study and proposed the feasibility of this method.展开更多
Word sense disambiguation(WSD)is a fundamental but significant task in natural language processing,which directly affects the performance of upper applications.However,WSD is very challenging due to the problem of kno...Word sense disambiguation(WSD)is a fundamental but significant task in natural language processing,which directly affects the performance of upper applications.However,WSD is very challenging due to the problem of knowledge bottleneck,i.e.,it is hard to acquire abundant disambiguation knowledge,especially in Chinese.To solve this problem,this paper proposes a graph-based Chinese WSD method with multi-knowledge integration.Particularly,a graph model combining various Chinese and English knowledge resources by word sense mapping is designed.Firstly,the content words in a Chinese ambiguous sentence are extracted and mapped to English words with BabelNet.Then,English word similarity is computed based on English word embeddings and knowledge base.Chinese word similarity is evaluated with Chinese word embedding and HowNet,respectively.The weights of the three kinds of word similarity are optimized with simulated annealing algorithm so as to obtain their overall similarities,which are utilized to construct a disambiguation graph.The graph scoring algorithm evaluates the importance of each word sense node and judge the right senses of the ambiguous words.Extensive experimental results on SemEval dataset show that our proposed WSD method significantly outperforms the baselines.展开更多
The recent surge in the number of machines,appliances,and services connected to the Internet demands secure processing and transmission of sensory data.Authentication plays a crucial role in a typical security model u...The recent surge in the number of machines,appliances,and services connected to the Internet demands secure processing and transmission of sensory data.Authentication plays a crucial role in a typical security model used in the Internet of Things(IoT),and it protects data communications from various attacks,such as impersonation and denial of service,by verifying and allowing legitimate users to access the IoT resources.However,recent authentication literature has not addressed the need for developing a scalable and efficient authentication method in this field.This paper proposes a secure and anonymous ticket-based authentication method for the IoT.The proposed method protects the network from various security and privacy threats such as data alternation and denial of service while also offering mutual authentication and sensor anonymity.Our security and performance evaluations confirm the improvement.展开更多
Currently,many biometric systems maintain the user’s biometrics and templates in plaintext format,which brings great privacy risk to uses’biometric information.Biometrics are unique and almost unchangeable,which mea...Currently,many biometric systems maintain the user’s biometrics and templates in plaintext format,which brings great privacy risk to uses’biometric information.Biometrics are unique and almost unchangeable,which means it is a great concern for users on whether their biometric information would be leaked.To address this issue,this paper proposes a confidential comparison algorithm for iris feature vectors with masks,and develops a privacy-preserving iris verification scheme based on the El Gamal encryption scheme.In our scheme,the multiplicative homomorphism of encrypted features is used to compare of iris features and their mask information.Also,this paper improves the Hamming distance of iris features,which makes the similarity matching work better than existing ones.Experimental results confirm the practicality of our proposed schemes in real world applications,that is,for the iris feature vectors and masks of 2048 bits,nearly 12 comparisons can be performed per second.展开更多
In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised...In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.展开更多
The shape approximation method has been proven to be rapid and practicable in resolving low-thrust trajectory;however,it still faces the challenges of large deviation from the optimal solution and inability to satisfy...The shape approximation method has been proven to be rapid and practicable in resolving low-thrust trajectory;however,it still faces the challenges of large deviation from the optimal solution and inability to satisfy the specific flight time and fuel mass constraints.In this paper,a modified shape approximation low-thrust model is presented,and a novel constrained optimization algorithm is developed to solve this problem.The proposed method aims at settling the bi-objective optimization orbit involving the twin objectives of minimum flight time and low fuel consumption and enhancing the accuracy of optimized orbit.In particular,a transformed high-order polynomial model based on finite Fourier series is proposed,which can be characterized as a multi-constraint optimization problem.Then,a novel optimization algorithm is specifically developed to optimize the large-scale multi-constraint dynamical equations of shape trajectory.The key performance indicators of the index include minimum flight time,low fuel consumption and bi-objective optimization of the two.Simulation results prove that this approach possesses both the high precision achievable by numerical methods and low computational complexity offered by shape approximation techniques.Besides,the Pareto front of the fuel-time bi-objective optimization orbit is firstly introduced to analyze an intact optimal solution set.Furthermore,we have demonstrated that our proposed approach is appropriate to generate the preliminary orbit for pseudo-spectral method.展开更多
Since the use of a quantum channel is very expensive for transmitting large messages, it is vital to develop an effective quantum compression encoding scheme that is easy to implement. Given that, with the single-phot...Since the use of a quantum channel is very expensive for transmitting large messages, it is vital to develop an effective quantum compression encoding scheme that is easy to implement. Given that, with the single-photon spin-orbit entanglement, we propose a quantum secret sharing scheme using orbital angular momentum onto multiple spin states based on Fibonacci compression encoding. In our proposed scheme, we can represent the frequency of any secret message which is typically collection of bits encodings of text or integers as a bitstring using the base Fibonacci sequence, which is encoded multiple spin states for secret shares transmitted to participants. We demonstrate that Fibonacci compression encoding carries excellent properties that enable us to achieve more robust quantum secret sharing schemes with fewer number of photons.展开更多
In this paper, we develop a large-capacity quantum digital secret sharing(QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum(OAM) entanglement with the recursive Fibonacci and Lucas matric...In this paper, we develop a large-capacity quantum digital secret sharing(QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum(OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie'(Bob') detected value.展开更多
Currentlyradio frequency identification(RFID)technology has been widely used in many kinds of applications.Store retailers use RFID readers with multiple antennas to monitor all tagged items.However,because of the int...Currentlyradio frequency identification(RFID)technology has been widely used in many kinds of applications.Store retailers use RFID readers with multiple antennas to monitor all tagged items.However,because of the interference from environment and limitations of the radio frequency technology,RFID tags are identified by more than one RFID antenna,leading to the false positive readings.To address this issue,we propose a RFID data stream cleaning method based on K-means to remove those false positive readings within sampling time.First,we formulate a new data stream model which adapts to our cleaning algorithm.Then we present the preprocessing method of the data stream model,including sliding window setting,feature extraction of data stream and normalization.Next,we introduce a novel way using K-means clustering algorithm to clean false positive readings.Last,the effectiveness and efficiency of the proposed method are verified by experiments.It achieves a good balance between performance and price.展开更多
文摘With the ever-increasing popularity of Internet of Things(IoT),massive enterprises are attempting to encapsulate their developed outcomes into various lightweight Web Application Programming Interfaces(APIs)that can be accessible remotely.In this context,finding and writing a list of existing Web APIs that can collectively meet the functional needs of software developers has become a promising approach to economically and easily develop successful mobile applications.However,the number and diversity of candidate IoT Web APIs places an additional burden on application developers’Web API selection decisions,as it is often a challenging task to simultaneously ensure the diversity and compatibility of the final set of Web APIs selected.Considering this challenge and latest successful applications of game theory in IoT,a Diversified and Compatible Web APIs Recommendation approach,namely DivCAR,is put forward in this paper.First of all,to achieve API diversity,DivCAR employs random walk sampling technique on a pre-built“API-API”correlation graph to generate diverse“API-API”correlation subgraphs.Afterwards,with the diverse“API-API”correlation subgraphs,the compatible Web APIs recommendation problem is modeled as a minimum group Steiner tree search problem.A sorted set of multiple compatible and diverse Web APIs are returned to the application developer by solving the minimum group Steiner tree search problem.At last,a set of experiments are designed and implemented on a real dataset crawled from www.programmableweb.com.Experimental results validate the effectiveness and efficiency of our proposed DivCAR approach in balancing the Web APIs recommendation diversity and compatibility.
文摘Intelligent vehicles are advancing at a fast speed with the improvement of automation and connectivity,which opens up new possibilities for different cyber-attacks,including in-vehicle attacks(e.g.,hijacking attacks)and vehicle-to-everything communicationattacks(e.g.,data theft).These problems are becoming increasingly serious with the development of 4G LTE and 5G communication technologies.Although many efforts are made to improve the resilience to cyber attacks,there are still many unsolved challenges.This paper first identifies some major security attacks on intelligent connected vehicles.Then,we investigate and summarize the available defences against these attacks and classify them into four categories:cryptography,network security,software vulnerability detection,and malware detection.Remaining challenges and future directions for preventing attacks on intelligent vehicle systems have been discussed as well.
文摘Sports matches are very popular all over the world.The prediction of a sports match is helpful to grasp the team's state in time and adjust the strategy in the process of the match.It's a challenging effort to predict a sports match.Therefore,a method is proposed to predict the result of the next match by using teams'historical match data.We combined the Long Short-Term Memory(LSTM)model with the attention mechanism and put forward an ASLSTM model for predicting match results.Furthermore,to ensure the timeliness of the prediction,we add the time sliding window to make the prediction have better timeliness.Taking the football match as an example,we carried out a case study and proposed the feasibility of this method.
基金The research work is supported by National Key R&D Program of China under Grant No.2018YFC0831704National Nature Science Foundation of China under Grant No.61502259+1 种基金Natural Science Foundation of Shandong Province under Grant No.ZR2017MF056Taishan Scholar Program of Shandong Province in China(Directed by Prof.Yinglong Wang).
文摘Word sense disambiguation(WSD)is a fundamental but significant task in natural language processing,which directly affects the performance of upper applications.However,WSD is very challenging due to the problem of knowledge bottleneck,i.e.,it is hard to acquire abundant disambiguation knowledge,especially in Chinese.To solve this problem,this paper proposes a graph-based Chinese WSD method with multi-knowledge integration.Particularly,a graph model combining various Chinese and English knowledge resources by word sense mapping is designed.Firstly,the content words in a Chinese ambiguous sentence are extracted and mapped to English words with BabelNet.Then,English word similarity is computed based on English word embeddings and knowledge base.Chinese word similarity is evaluated with Chinese word embedding and HowNet,respectively.The weights of the three kinds of word similarity are optimized with simulated annealing algorithm so as to obtain their overall similarities,which are utilized to construct a disambiguation graph.The graph scoring algorithm evaluates the importance of each word sense node and judge the right senses of the ambiguous words.Extensive experimental results on SemEval dataset show that our proposed WSD method significantly outperforms the baselines.
文摘The recent surge in the number of machines,appliances,and services connected to the Internet demands secure processing and transmission of sensory data.Authentication plays a crucial role in a typical security model used in the Internet of Things(IoT),and it protects data communications from various attacks,such as impersonation and denial of service,by verifying and allowing legitimate users to access the IoT resources.However,recent authentication literature has not addressed the need for developing a scalable and efficient authentication method in this field.This paper proposes a secure and anonymous ticket-based authentication method for the IoT.The proposed method protects the network from various security and privacy threats such as data alternation and denial of service while also offering mutual authentication and sensor anonymity.Our security and performance evaluations confirm the improvement.
基金partially supported by the National Natural Science Foundation of China(Grant Nos.61772150,61862012)the National Cryptography Development Fund of China under project MMJJ20170217+3 种基金the Guangxi Key R&D Fund under project AB17195025the Guangxi Natural Science Foundation under grant 2018GXNSFAA281232the open project of Guangxi Key Laboratory of Cryptography and Information Security(Grant Nos.GCIS201622,GCIS201702)the GUET Excellent Graduate Thesis Program(16YJPYSS23).
文摘Currently,many biometric systems maintain the user’s biometrics and templates in plaintext format,which brings great privacy risk to uses’biometric information.Biometrics are unique and almost unchangeable,which means it is a great concern for users on whether their biometric information would be leaked.To address this issue,this paper proposes a confidential comparison algorithm for iris feature vectors with masks,and develops a privacy-preserving iris verification scheme based on the El Gamal encryption scheme.In our scheme,the multiplicative homomorphism of encrypted features is used to compare of iris features and their mask information.Also,this paper improves the Hamming distance of iris features,which makes the similarity matching work better than existing ones.Experimental results confirm the practicality of our proposed schemes in real world applications,that is,for the iris feature vectors and masks of 2048 bits,nearly 12 comparisons can be performed per second.
基金Supported in part by an International Macquarie University Research Excellence Scholarship(i MQRES),Australian Research Council Grant DP0987734also supported by the National Basic Research Program of China(973 Program)under Grant No.2010CB923200+2 种基金the National Natural Science Foundation of China under No.61377067Fund of State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications,China,National Natural Science Foundation of China under Grant Nos.61202362,61262057,61472433China Postdoctora Science Foundation under Grant No.2013M542560
文摘In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.
基金supported by the National Natural Science Foundation of China(Nos.61627810,61790562,61403096).
文摘The shape approximation method has been proven to be rapid and practicable in resolving low-thrust trajectory;however,it still faces the challenges of large deviation from the optimal solution and inability to satisfy the specific flight time and fuel mass constraints.In this paper,a modified shape approximation low-thrust model is presented,and a novel constrained optimization algorithm is developed to solve this problem.The proposed method aims at settling the bi-objective optimization orbit involving the twin objectives of minimum flight time and low fuel consumption and enhancing the accuracy of optimized orbit.In particular,a transformed high-order polynomial model based on finite Fourier series is proposed,which can be characterized as a multi-constraint optimization problem.Then,a novel optimization algorithm is specifically developed to optimize the large-scale multi-constraint dynamical equations of shape trajectory.The key performance indicators of the index include minimum flight time,low fuel consumption and bi-objective optimization of the two.Simulation results prove that this approach possesses both the high precision achievable by numerical methods and low computational complexity offered by shape approximation techniques.Besides,the Pareto front of the fuel-time bi-objective optimization orbit is firstly introduced to analyze an intact optimal solution set.Furthermore,we have demonstrated that our proposed approach is appropriate to generate the preliminary orbit for pseudo-spectral method.
基金Supported by the National Natural Science Foundation of China under No.61702427the Doctoral Program of Higher Education under Grant No.SWU115091+5 种基金the Fundamental Research Funds for the Central Universities(XDJK2018C048)the financial support in part by the 1000-Plan of Chongqing by Southwest University under No.SWU116007the National Natural Science Foundation of China under Grant No.61772437Sichuan Youth Science and Technique Foundation under No.2017JQ0048the National Natural Science Foundation of China under Grant No.61401371Josef Pieprzyk has been supported by National Science Centre,Poland,Project Registration Number UMO-2014/15/B/ST6/05130
文摘Since the use of a quantum channel is very expensive for transmitting large messages, it is vital to develop an effective quantum compression encoding scheme that is easy to implement. Given that, with the single-photon spin-orbit entanglement, we propose a quantum secret sharing scheme using orbital angular momentum onto multiple spin states based on Fibonacci compression encoding. In our proposed scheme, we can represent the frequency of any secret message which is typically collection of bits encodings of text or integers as a bitstring using the base Fibonacci sequence, which is encoded multiple spin states for secret shares transmitted to participants. We demonstrate that Fibonacci compression encoding carries excellent properties that enable us to achieve more robust quantum secret sharing schemes with fewer number of photons.
基金Supported by the Fundamental Research Funds for the Central Universities under Grant No.XDJK2016C043the Doctoral Program of Higher Education under Grant No.SWU115091+3 种基金the National Natural Science Foundation of China under Grant No.61303039the Fundamental Research Funds for the Central Universities under Grant No.XDJK2015C153the Doctoral Program of Higher Education under Grant No.SWU114112the Financial Support the 1000-Plan of Chongqing by Southwest University under Grant No.SWU116007
文摘In this paper, we develop a large-capacity quantum digital secret sharing(QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum(OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie'(Bob') detected value.
基金supported by National Natural Science Foundation of China(61907025,61807020)Scientific Research Foundation of Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks(WSNLBZY201512)Jiangsu Government Scholarship for Studying Abroad。
文摘Currentlyradio frequency identification(RFID)technology has been widely used in many kinds of applications.Store retailers use RFID readers with multiple antennas to monitor all tagged items.However,because of the interference from environment and limitations of the radio frequency technology,RFID tags are identified by more than one RFID antenna,leading to the false positive readings.To address this issue,we propose a RFID data stream cleaning method based on K-means to remove those false positive readings within sampling time.First,we formulate a new data stream model which adapts to our cleaning algorithm.Then we present the preprocessing method of the data stream model,including sliding window setting,feature extraction of data stream and normalization.Next,we introduce a novel way using K-means clustering algorithm to clean false positive readings.Last,the effectiveness and efficiency of the proposed method are verified by experiments.It achieves a good balance between performance and price.
