With the massive increase of digital resource based on the network,it becomes very important that how to help readers acquire the information needed according to the individualized requirement and interest in an accur...With the massive increase of digital resource based on the network,it becomes very important that how to help readers acquire the information needed according to the individualized requirement and interest in an accurate,convenient and prompt method. Therefore,it is very urgent to investigate individualized information service of library. In this paper,based on the development of the individualized information service for the reader in the college library,the individualized information service is clarified by using three perspectives,including establishment of individualized information demand model,integration of internal and external resource and protection of the reader privacy. Finally,the corresponding strategy and related measure are presented.展开更多
The information transmission path optimization(ITPO) can often a ect the e ciency and accuracy of remanufactur?ing service. However, there is a greater degree of uncertainty and complexity in information transmission ...The information transmission path optimization(ITPO) can often a ect the e ciency and accuracy of remanufactur?ing service. However, there is a greater degree of uncertainty and complexity in information transmission of remanu?facturing service system, which leads to a critical need for designing planning models to deal with this added uncer?tainty and complexity. In this paper, a three?dimensional(3D) model of remanufacturing service information network for information transmission is developed, which combines the physic coordinate and the transmitted properties of all the devices in the remanufacturing service system. In order to solve the basic ITPO in the 3D model, an improved 3D ant colony algorithm(Improved AC) was put forward. Moreover, to further improve the operation e ciency of the algorithm, an improved ant colony?genetic algorithm(AC?GA) that combines the improved AC and genetic algorithm was developed. In addition, by taking the transmission of remanufacturing service demand information of certain roller as example, the e ectiveness of AC?GA algorithm was analyzed and compared with that of improved AC, and the results demonstrated that AC?GA algorithm was superior to AC algorithm in aspects of information transmission delay, information transmission cost, and rate of information loss.展开更多
The benefits of cloud storage come along with challenges and open issues about availability of services, vendor lock-in and data security, etc. One solution to mitigate the problems is the multi-cloud storage, where t...The benefits of cloud storage come along with challenges and open issues about availability of services, vendor lock-in and data security, etc. One solution to mitigate the problems is the multi-cloud storage, where the selection of service providers is a key point. In this paper, an algorithm that can select optimal provider subset for data placement among a set of providers in multicloud storage architecture based on IDA is proposed, designed to achieve good tradeoff among storage cost, algorithm cost, vendor lock-in, transmission performance and data availability. Experiments demonstrate that it is efficient and accurate to find optimal solutions in reasonable amount of time, using parameters taken from real cloud providers.展开更多
As a core component of the network,web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attacke...As a core component of the network,web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attackers.Although the moving target defense(MTD)has been proposed to increase the attack difficulty for the attackers,there is no solo approach can cope with different attacks;in addition,it is impossible to implement all these approaches simultaneously due to the resource limitation.Thus,the selection of an optimal defense strategy based on MTD has become the focus of research.In general,the confrontation of two players in the security domain is viewed as a stochastic game,and the reward matrices are known to both players.However,in a real security confrontation,this scenario represents an incomplete information game.Each player can only observe the actions performed by the opponent,and the observed actions are not completely accurate.To accurately describe the attacker’s reward function to reach the Nash equilibrium,this work simulated and updated the strategy selection distribution of the attacker by observing and investigating the strategy selection history of the attacker.Next,the possible rewards of the attacker in each confrontation via the observation matrix were corrected.On this basis,the Nash-Q learning algorithm with reward quantification was proposed to select the optimal strategy.Moreover,the performances of the Minimax-Q learning algorithm and Naive-Q learning algorithm were compared and analyzed in the MTD environment.Finally,the experimental results showed that the strategy selection algorithm can enable defenders to select a more reasonable defensive strategy and achieve the maximum possible reward.展开更多
Due to a rapid increase in the number of functionally equivalent web services at open and dynamic Io T service environment,Qo S has become a major discrimination factor to reflect the user's expectation and experi...Due to a rapid increase in the number of functionally equivalent web services at open and dynamic Io T service environment,Qo S has become a major discrimination factor to reflect the user's expectation and experience of using a service.There are different languages and models for expressing Qo S advertisements and requirements among service providers and consumers.Therefore,it leads to the issues of semantic interoperability of Qo S information and semantic similarity match between a semantic description of the service being requested by the service consumer,and a formal description of the service being offered by the service provider.In this paper,we propose a hierarchical two-layer semantic Qo S ontology to promote the description and declaration of Qo S-based service information in detail for any domain and application.And,we develop a semantic matchmaking algorithm to compare the web services according to their Qo S information and adopt analytical hierarchy process( AHP) to make decision for the ranked services depending on the Qo S criteria.The comparison study and experimental result show that our proposed system is superior to other service ranking approaches.展开更多
In order to provide individual information service in digital library,it′s necessary to develop a personalized recommender system Based on information retrieval,information filtering and collaborative filtering techn...In order to provide individual information service in digital library,it′s necessary to develop a personalized recommender system Based on information retrieval,information filtering and collaborative filtering technologies,this article gives some examples of the recommender system and analyzes their key展开更多
文摘With the massive increase of digital resource based on the network,it becomes very important that how to help readers acquire the information needed according to the individualized requirement and interest in an accurate,convenient and prompt method. Therefore,it is very urgent to investigate individualized information service of library. In this paper,based on the development of the individualized information service for the reader in the college library,the individualized information service is clarified by using three perspectives,including establishment of individualized information demand model,integration of internal and external resource and protection of the reader privacy. Finally,the corresponding strategy and related measure are presented.
基金National Natural Science Foundation of China(Grant Nos.51805385,71471143)Hubei Provincial Natural Science Foundation of China(Grant No.2018CFB265)Center for Service Science and Engineering of Wuhan University of Science and Technology(Grant No.CSSE2017KA04)
文摘The information transmission path optimization(ITPO) can often a ect the e ciency and accuracy of remanufactur?ing service. However, there is a greater degree of uncertainty and complexity in information transmission of remanu?facturing service system, which leads to a critical need for designing planning models to deal with this added uncer?tainty and complexity. In this paper, a three?dimensional(3D) model of remanufacturing service information network for information transmission is developed, which combines the physic coordinate and the transmitted properties of all the devices in the remanufacturing service system. In order to solve the basic ITPO in the 3D model, an improved 3D ant colony algorithm(Improved AC) was put forward. Moreover, to further improve the operation e ciency of the algorithm, an improved ant colony?genetic algorithm(AC?GA) that combines the improved AC and genetic algorithm was developed. In addition, by taking the transmission of remanufacturing service demand information of certain roller as example, the e ectiveness of AC?GA algorithm was analyzed and compared with that of improved AC, and the results demonstrated that AC?GA algorithm was superior to AC algorithm in aspects of information transmission delay, information transmission cost, and rate of information loss.
基金This study is supported by the National Natural Science Foundation of China(61370069), the National High Technology Research and Development Program("863"Program) of China (2012AA012600), the Cosponsored Project of Beijing Committee of Education,the Fundamental Research Funds for the Central Universities (BUPT2011RCZJ16) and China Information Security Special Fund (NDRC).
文摘The benefits of cloud storage come along with challenges and open issues about availability of services, vendor lock-in and data security, etc. One solution to mitigate the problems is the multi-cloud storage, where the selection of service providers is a key point. In this paper, an algorithm that can select optimal provider subset for data placement among a set of providers in multicloud storage architecture based on IDA is proposed, designed to achieve good tradeoff among storage cost, algorithm cost, vendor lock-in, transmission performance and data availability. Experiments demonstrate that it is efficient and accurate to find optimal solutions in reasonable amount of time, using parameters taken from real cloud providers.
基金This paper is supported by the National Key R&D Program of China(2017YFB0802703)the National Nature Science Foundation of China(61602052).
文摘As a core component of the network,web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attackers.Although the moving target defense(MTD)has been proposed to increase the attack difficulty for the attackers,there is no solo approach can cope with different attacks;in addition,it is impossible to implement all these approaches simultaneously due to the resource limitation.Thus,the selection of an optimal defense strategy based on MTD has become the focus of research.In general,the confrontation of two players in the security domain is viewed as a stochastic game,and the reward matrices are known to both players.However,in a real security confrontation,this scenario represents an incomplete information game.Each player can only observe the actions performed by the opponent,and the observed actions are not completely accurate.To accurately describe the attacker’s reward function to reach the Nash equilibrium,this work simulated and updated the strategy selection distribution of the attacker by observing and investigating the strategy selection history of the attacker.Next,the possible rewards of the attacker in each confrontation via the observation matrix were corrected.On this basis,the Nash-Q learning algorithm with reward quantification was proposed to select the optimal strategy.Moreover,the performances of the Minimax-Q learning algorithm and Naive-Q learning algorithm were compared and analyzed in the MTD environment.Finally,the experimental results showed that the strategy selection algorithm can enable defenders to select a more reasonable defensive strategy and achieve the maximum possible reward.
基金Sponsored by the Scientific Research Foundation of NJUPT(Grant No.NY209017,NY211108,and NYKL201105)Huawei Company(Grant No.YB2014010003(Project IRP-2013-08-06))
文摘Due to a rapid increase in the number of functionally equivalent web services at open and dynamic Io T service environment,Qo S has become a major discrimination factor to reflect the user's expectation and experience of using a service.There are different languages and models for expressing Qo S advertisements and requirements among service providers and consumers.Therefore,it leads to the issues of semantic interoperability of Qo S information and semantic similarity match between a semantic description of the service being requested by the service consumer,and a formal description of the service being offered by the service provider.In this paper,we propose a hierarchical two-layer semantic Qo S ontology to promote the description and declaration of Qo S-based service information in detail for any domain and application.And,we develop a semantic matchmaking algorithm to compare the web services according to their Qo S information and adopt analytical hierarchy process( AHP) to make decision for the ranked services depending on the Qo S criteria.The comparison study and experimental result show that our proposed system is superior to other service ranking approaches.
文摘In order to provide individual information service in digital library,it′s necessary to develop a personalized recommender system Based on information retrieval,information filtering and collaborative filtering technologies,this article gives some examples of the recommender system and analyzes their key
