Genetic Algorithms are excellent approaches to solving complex problem in optimization with difficult constraints. The vehicle routing problem (VRP) has been shown as an NP-complete problem. On the foundation of stressing the limitations of the network in VRP this paper introduces a finite automaton (FA) to produce individual population and implement a new evolution way using genetic algorithm. Besides, the paper shows the application in an urban public transportation system.
{"title":"The Application of Genetic Algorithm in Vehicle Routing Problem","authors":"Yueqin Zhang, Shiying Chen, Jinfeng Liu, Fu Duan","doi":"10.1109/ISECS.2008.227","DOIUrl":"https://doi.org/10.1109/ISECS.2008.227","url":null,"abstract":"Genetic Algorithms are excellent approaches to solving complex problem in optimization with difficult constraints. The vehicle routing problem (VRP) has been shown as an NP-complete problem. On the foundation of stressing the limitations of the network in VRP this paper introduces a finite automaton (FA) to produce individual population and implement a new evolution way using genetic algorithm. Besides, the paper shows the application in an urban public transportation system.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114643166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Resource discovery is the key requirements in large heterogeneous grid environments, and an effective and efficient resource discovery mechanism is crucial. Grid system using P2P technology can improve the central control of the traditional grid and the single point of failure. In this paper, a novel grid resource discovery scheme is proposed, which is integrated P2P mode and agent technology. The scheme can adapt to the complex, heterogeneous and dynamic resources of the grid environment, and has a better scalability.
{"title":"Research on Grid Resource Discovery Scheme Integrated P2P Mode","authors":"Z. Xiong, Xuemin Zhang, Jianxin Chen","doi":"10.1109/ISECS.2008.58","DOIUrl":"https://doi.org/10.1109/ISECS.2008.58","url":null,"abstract":"Resource discovery is the key requirements in large heterogeneous grid environments, and an effective and efficient resource discovery mechanism is crucial. Grid system using P2P technology can improve the central control of the traditional grid and the single point of failure. In this paper, a novel grid resource discovery scheme is proposed, which is integrated P2P mode and agent technology. The scheme can adapt to the complex, heterogeneous and dynamic resources of the grid environment, and has a better scalability.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128227327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Role based access control (RBAC) has been widely adopted as a policy neutral access control model by many IT corporations. RBAC96, which is the most famous family of RBAC models, provides a common frame reference for related research and development. Many properties proposed in the family, e.g. limited inheritance, mutually exclusive roles, cardinality, and interaction, have been separately discussed in the previous work. In this paper, an extended RBAC model implementing those properties is proposed to provide an approach for implementing RBAC3. The extended RBAC model is based on deputy mechanism and is called deputy-based access control (DBAC). Since the private role hierarchy and constraint can be uniformly handled in DBAC, a flexible and powerful access control system can be implemented.
{"title":"An Extended RBAC Model for Uniform Implementation of Role Hierarchy and Constraint","authors":"Yi Ren, Zhiting Xiao, Sipei Guo","doi":"10.1109/ISECS.2008.163","DOIUrl":"https://doi.org/10.1109/ISECS.2008.163","url":null,"abstract":"Role based access control (RBAC) has been widely adopted as a policy neutral access control model by many IT corporations. RBAC96, which is the most famous family of RBAC models, provides a common frame reference for related research and development. Many properties proposed in the family, e.g. limited inheritance, mutually exclusive roles, cardinality, and interaction, have been separately discussed in the previous work. In this paper, an extended RBAC model implementing those properties is proposed to provide an approach for implementing RBAC3. The extended RBAC model is based on deputy mechanism and is called deputy-based access control (DBAC). Since the private role hierarchy and constraint can be uniformly handled in DBAC, a flexible and powerful access control system can be implemented.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126960149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
According to the relation between generalized fractal dimension and generalized entropy, obtain entropy through fractal dimension, and expand and improve the system structure entropy model, furthermore, establish entropy model of order degree of FSCN system based on organizational structure entropy and information entropy. Meanwhile, reveal generation and propagation of information accord with fractal growth in DLA model to get information fractal dimension and information entropy. And an example is provided to explain and compare the result. Moreover, entropy mechanism of FSCN system mutation is deduced from entropy model of order degree of FSCN.
{"title":"Research on Entropy Model of Order Degree of Fractal Supply Chain Network","authors":"Wenfang Sun, Huaizhen Ye","doi":"10.1109/ISECS.2008.74","DOIUrl":"https://doi.org/10.1109/ISECS.2008.74","url":null,"abstract":"According to the relation between generalized fractal dimension and generalized entropy, obtain entropy through fractal dimension, and expand and improve the system structure entropy model, furthermore, establish entropy model of order degree of FSCN system based on organizational structure entropy and information entropy. Meanwhile, reveal generation and propagation of information accord with fractal growth in DLA model to get information fractal dimension and information entropy. And an example is provided to explain and compare the result. Moreover, entropy mechanism of FSCN system mutation is deduced from entropy model of order degree of FSCN.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123772543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a network environment, trust management is an important security issue. A weighted sum is prevalent in trust formalization. Trust is contextual, continuous and changeful. There are many factors that can affect trust update in the whole lifetime of trust. However, these factors have not been studied thoroughly. In this paper, we propose a weighted trust formula and present an integrated trust update method. First, we will compare several recommendation trust formula and analyze the factors that affect trust update. We propose to use abnormal trust value sequence and statistical analysis to detect malicious recommenders and false recommendation trust values in the whole lifetime of trust. Assuming that direct trust weight and recommendation trust weight are independent from each other, we propose a real-time weight update method through trust value sequences. Simulation results show that our method could effectively detect malicious recommenders and malicious recommendation trust values and make trust value sequence smoother.
{"title":"Reputation-based Trust Update in Network Environment","authors":"Shufen Peng, Jingsha He, Yao Meng","doi":"10.1109/ISECS.2008.211","DOIUrl":"https://doi.org/10.1109/ISECS.2008.211","url":null,"abstract":"In a network environment, trust management is an important security issue. A weighted sum is prevalent in trust formalization. Trust is contextual, continuous and changeful. There are many factors that can affect trust update in the whole lifetime of trust. However, these factors have not been studied thoroughly. In this paper, we propose a weighted trust formula and present an integrated trust update method. First, we will compare several recommendation trust formula and analyze the factors that affect trust update. We propose to use abnormal trust value sequence and statistical analysis to detect malicious recommenders and false recommendation trust values in the whole lifetime of trust. Assuming that direct trust weight and recommendation trust weight are independent from each other, we propose a real-time weight update method through trust value sequences. Simulation results show that our method could effectively detect malicious recommenders and malicious recommendation trust values and make trust value sequence smoother.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122025037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We will construct a perfectly hiding commitment in two rounds from any one-way permutation, which is a negation of this result that O(n/(log n)) rounds is the tight lower bound on the rounds complexity of perfectly hiding commitments from any one-way permutation. Based on our commitments, we will construct a computational zero-knowledge proof for any NP that achieves negligible error probability in 5 rounds of interaction, assuming only the existence of a one-way permutation.
{"title":"5-Round Computational Zero-Knowledge Proof with Negligible Error Probability for Any NP from Any One-Way Permutation","authors":"Chunming Tang, D. Pei, Z. Yao","doi":"10.1109/ISECS.2008.88","DOIUrl":"https://doi.org/10.1109/ISECS.2008.88","url":null,"abstract":"We will construct a perfectly hiding commitment in two rounds from any one-way permutation, which is a negation of this result that O(n/(log n)) rounds is the tight lower bound on the rounds complexity of perfectly hiding commitments from any one-way permutation. Based on our commitments, we will construct a computational zero-knowledge proof for any NP that achieves negligible error probability in 5 rounds of interaction, assuming only the existence of a one-way permutation.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125110166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Executable code not effectively inspected and authorized before its execution has been one of the key reasons for wild spread of malicious codes. This paper proposes a program file authorization model based on an integrity measurement and access control combined methodology. It measures integrity signature of each program file and verifies it with the its original value before its execution. By allowing only running of known and trusted programs, it is able to disable invokes of malicious programs. To protect from attacks which donpsilat modify a program file, an active code authorization scheme is proposed. It divides a program file into an ordered series of code blocks by the return and jump instructions, constructs the integrity signatures of all code blocks respectively at compiling time, then measures and verifies them at run-time. By disallowing unexpected code blocks from running, it is able to prevent invokes of malicious codes injected by attackers.
{"title":"An Executable Code Authorization Model for Secure Operating System","authors":"Chen Ze-mao, Wu Xiaoping, Tang Weimin","doi":"10.1109/ISECS.2008.43","DOIUrl":"https://doi.org/10.1109/ISECS.2008.43","url":null,"abstract":"Executable code not effectively inspected and authorized before its execution has been one of the key reasons for wild spread of malicious codes. This paper proposes a program file authorization model based on an integrity measurement and access control combined methodology. It measures integrity signature of each program file and verifies it with the its original value before its execution. By allowing only running of known and trusted programs, it is able to disable invokes of malicious programs. To protect from attacks which donpsilat modify a program file, an active code authorization scheme is proposed. It divides a program file into an ordered series of code blocks by the return and jump instructions, constructs the integrity signatures of all code blocks respectively at compiling time, then measures and verifies them at run-time. By disallowing unexpected code blocks from running, it is able to prevent invokes of malicious codes injected by attackers.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125925510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Taking the retailerpsilas default in supply chain for example, in this paper, using the theory of credit default swap, the writer intends to make a research on the shift of default risk in supply chain. On the condition of insured interest rate and recovery rate, a supposition is made that the default rate of supply chain depends on the doubly stochastic Poisson default process, and then a model of credit default swap is established, and a simple pricing model of standard credit default swap and long-term credit default swap are discussed.
{"title":"Research on the Shift of Default Risk in Supply Chain Based on the Credit Default Swap","authors":"Xianjun Qi, Hongping Yang","doi":"10.1109/ISECS.2008.189","DOIUrl":"https://doi.org/10.1109/ISECS.2008.189","url":null,"abstract":"Taking the retailerpsilas default in supply chain for example, in this paper, using the theory of credit default swap, the writer intends to make a research on the shift of default risk in supply chain. On the condition of insured interest rate and recovery rate, a supposition is made that the default rate of supply chain depends on the doubly stochastic Poisson default process, and then a model of credit default swap is established, and a simple pricing model of standard credit default swap and long-term credit default swap are discussed.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124104508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Based on the supposition that enterprise employees are rationality-bounded, this paper establishes an evolutionary game model of knowledge sharing inside enterprise. We can get the evolutionary stable point of the model by calculation. By the analysis of the position of the stable point, we can find out the key factors which should be focused upon during the design of knowledge sharing incentive mechanism inside the enterprise. We submit a major argument that an appropriate incentive mechanism with the proper focusing factors could make the knowledge sharing of an enterprise evolve toward a state which is satisfied by enterprise managers.
{"title":"An Analysis of Knowledge Sharing Incentive Mechanism inside the Enterprise Based on Evolutionary Game","authors":"Yang Liu","doi":"10.1109/ISECS.2008.167","DOIUrl":"https://doi.org/10.1109/ISECS.2008.167","url":null,"abstract":"Based on the supposition that enterprise employees are rationality-bounded, this paper establishes an evolutionary game model of knowledge sharing inside enterprise. We can get the evolutionary stable point of the model by calculation. By the analysis of the position of the stable point, we can find out the key factors which should be focused upon during the design of knowledge sharing incentive mechanism inside the enterprise. We submit a major argument that an appropriate incentive mechanism with the proper focusing factors could make the knowledge sharing of an enterprise evolve toward a state which is satisfied by enterprise managers.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129631798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Buyer-seller negotiation is an interactive process so that the outcome is not only determined by an agentpsilas own tactics but also influenced by his opponentpsilas choices. Therefore, retrieving the knowledge of the opponent to simulate the opponentpsilas possible actions can increase the payoffs. An ANN_based Opponentpsilas negotiation behavior model (OpNBM) is proposed. It consists of two basic negotiation behaviors: Bid_Evaluation simulates the negotiatorpsilas utility function, and Bid_Generation simulates the concession strategy. Furthermore, by observing the changes of the opponent during the actual bargaining process, the agent keeps adjusting the OpNBM with increase of the negotiation rounds. Several experiments have shown that the OpNBM can help agents to better prepare for the negotiation and achieve a better outcome.
{"title":"An Opponent's Negotiation Behavior Model to Facilitate Buyer-seller Negotiations in Supply Chain Management","authors":"Fang Fang, Ye Xin, Xia Yun, Xun Haitao","doi":"10.1109/ISECS.2008.93","DOIUrl":"https://doi.org/10.1109/ISECS.2008.93","url":null,"abstract":"Buyer-seller negotiation is an interactive process so that the outcome is not only determined by an agentpsilas own tactics but also influenced by his opponentpsilas choices. Therefore, retrieving the knowledge of the opponent to simulate the opponentpsilas possible actions can increase the payoffs. An ANN_based Opponentpsilas negotiation behavior model (OpNBM) is proposed. It consists of two basic negotiation behaviors: Bid_Evaluation simulates the negotiatorpsilas utility function, and Bid_Generation simulates the concession strategy. Furthermore, by observing the changes of the opponent during the actual bargaining process, the agent keeps adjusting the OpNBM with increase of the negotiation rounds. Several experiments have shown that the OpNBM can help agents to better prepare for the negotiation and achieve a better outcome.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128984157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：