Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560787
S. Riadi, D. El Ghanami, A. Maach
In optical burst switched (OBS) networks contention is the main source of burst loss. Burst cloning scheme is a proactive loss recovery mechanism that attempts to prevent burst loss at core nodes. However, at high load, burst cloning scheme leads to a significant burst loss at edge nodes due to burst queue saturation. In this paper, we adopt the burst cloning scheme with star topology, and we propose an enhancement for burst cloning scheme, called opportunistic burst cloning scheme, which aims to control the extra load of burst cloning through a simple technique to disable/enable burst cloning mechanism. We analytically analyze conventional OBS, basic burst cloning scheme and opportunistic burst cloning scheme over star networks. The results obtained from simulation confirm that our analytical model exhibits a good accuracy. The both analytical and simulation results confirm that opportunistic burst cloning scheme achieves better overall network performance than the other approaches.
{"title":"An opportunistic burst cloning scheme for star OBS networks","authors":"S. Riadi, D. El Ghanami, A. Maach","doi":"10.1109/SITA.2013.6560787","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560787","url":null,"abstract":"In optical burst switched (OBS) networks contention is the main source of burst loss. Burst cloning scheme is a proactive loss recovery mechanism that attempts to prevent burst loss at core nodes. However, at high load, burst cloning scheme leads to a significant burst loss at edge nodes due to burst queue saturation. In this paper, we adopt the burst cloning scheme with star topology, and we propose an enhancement for burst cloning scheme, called opportunistic burst cloning scheme, which aims to control the extra load of burst cloning through a simple technique to disable/enable burst cloning mechanism. We analytically analyze conventional OBS, basic burst cloning scheme and opportunistic burst cloning scheme over star networks. The results obtained from simulation confirm that our analytical model exhibits a good accuracy. The both analytical and simulation results confirm that opportunistic burst cloning scheme achieves better overall network performance than the other approaches.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125562289","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}
Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560794
M. Ettaouil, K. Haddouch, Youssef Hami, Loqman Chakir
In this paper, we propose a new approach to solve the maximal constraint satisfaction problems (Max-CSP) using the continuous Hopfield network. This approach is divided into two steps: the first step involves modeling the maximal constraint satisfaction problem as 0-1 quadratic programming subject to linear constraints (QP). The second step concerns applying the continuous Hopfield network (CHN) to solve the QP problem. Therefore, the generalized energy function associated to the CHN and an appropriate parameter-setting procedure about Max-CSP problems are given in detail. Finally, the proposed algorithm and some computational experiments solving the Max-CSP are shown.
{"title":"Neural networks approach for solving the Maximal Constraint Satisfaction Problems","authors":"M. Ettaouil, K. Haddouch, Youssef Hami, Loqman Chakir","doi":"10.1109/SITA.2013.6560794","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560794","url":null,"abstract":"In this paper, we propose a new approach to solve the maximal constraint satisfaction problems (Max-CSP) using the continuous Hopfield network. This approach is divided into two steps: the first step involves modeling the maximal constraint satisfaction problem as 0-1 quadratic programming subject to linear constraints (QP). The second step concerns applying the continuous Hopfield network (CHN) to solve the QP problem. Therefore, the generalized energy function associated to the CHN and an appropriate parameter-setting procedure about Max-CSP problems are given in detail. Finally, the proposed algorithm and some computational experiments solving the Max-CSP are shown.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125912579","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}
Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560823
E. Belmekki, M. Bellafkih, N. Bouaouda
The security in IMS network is a big challenge for both users and service providers over IMS. Many research works are interested in this field to build more secure networks and to deal with security problems. This paper aims to present firstly a synthesis of the most important existing model used to secure IMS network. Secondly, the paper introduces our approach to address security in IMS. This approach defines light model for IMS network, identifies and focuses in the most vulnerable components of IMS network. It gives more importance to secure these components in order to build a safety network.
{"title":"Efficient light model for securing IMS network","authors":"E. Belmekki, M. Bellafkih, N. Bouaouda","doi":"10.1109/SITA.2013.6560823","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560823","url":null,"abstract":"The security in IMS network is a big challenge for both users and service providers over IMS. Many research works are interested in this field to build more secure networks and to deal with security problems. This paper aims to present firstly a synthesis of the most important existing model used to secure IMS network. Secondly, the paper introduces our approach to address security in IMS. This approach defines light model for IMS network, identifies and focuses in the most vulnerable components of IMS network. It gives more importance to secure these components in order to build a safety network.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132380782","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}
Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560784
M. Lahby, L. Cherkaoui, A. Adib
The most challenging problem in the heterogeneous wireless networks is ensuring seamless network selection. For that reason, a large variety of algorithms based on multi attribute decision making (MADM) have been proposed to deal with this issue. The analytic hierarchy process (AHP) and the technique for order preference by similarity to an ideal solution (TOPSIS) represent two MADM methods which are exhaustively used in the literature to cope with the network selection problem. However both of these methods still suffer from the ranking abnormality and the number of handoffs. Thus, we aim to propose a hybrid network selection strategy based multiple analytic hierarchy process (M-AHP) and the enhanced technique for order preference by similarity to an ideal solution (E-TOPSIS). The M-AHP method represents an extension of AHP which is used to weigh each criterion. While the E-TOPSIS method represents an extension of TOPSIS which is used to rank the alternatives. Simulation results demonstrate that our hybrid strategy for network selection can dealing with the limitations of MADM methods.
{"title":"Hybrid network selection strategy by using M-AHP/E-TOPSIS for heterogeneous networks","authors":"M. Lahby, L. Cherkaoui, A. Adib","doi":"10.1109/SITA.2013.6560784","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560784","url":null,"abstract":"The most challenging problem in the heterogeneous wireless networks is ensuring seamless network selection. For that reason, a large variety of algorithms based on multi attribute decision making (MADM) have been proposed to deal with this issue. The analytic hierarchy process (AHP) and the technique for order preference by similarity to an ideal solution (TOPSIS) represent two MADM methods which are exhaustively used in the literature to cope with the network selection problem. However both of these methods still suffer from the ranking abnormality and the number of handoffs. Thus, we aim to propose a hybrid network selection strategy based multiple analytic hierarchy process (M-AHP) and the enhanced technique for order preference by similarity to an ideal solution (E-TOPSIS). The M-AHP method represents an extension of AHP which is used to weigh each criterion. While the E-TOPSIS method represents an extension of TOPSIS which is used to rank the alternatives. Simulation results demonstrate that our hybrid strategy for network selection can dealing with the limitations of MADM methods.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114235537","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}
Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560793
N. Bouhmala
The performance of metaheuristics deteriorates very rapidly because the complexity of the problem usually increases with its size and the solution space of the problem increases exponentially with the problem size. Because of these two issues, optimization search techniques tend to spend most of the time exploring a restricted area of the search space preventing the search to visit more promising areas, and thus leading to solutions of poor quality. Designing efficient optimization search techniques requires a tactical interplay between diversification and intensification. The former refers to the ability to explore many different regions of the search space, whereas the latter refers to the ability to obtain high quality solutions within those regions. In this paper, three well known metaheuristics (Tabu Search, Memetic Algorithm and Walksat) are used with the multilevel context. The multilevel strategy involves looking at the search as a process evolving from a k-flip neighborhood to the standard I-flip neighborhood-based structure in order to achieve a tactical interplay between diversification and intensification. Benchmark results exhibit good prospects of multilevel metaheuristics.
{"title":"Multilevel diversification and intensification in metaheuristics","authors":"N. Bouhmala","doi":"10.1109/SITA.2013.6560793","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560793","url":null,"abstract":"The performance of metaheuristics deteriorates very rapidly because the complexity of the problem usually increases with its size and the solution space of the problem increases exponentially with the problem size. Because of these two issues, optimization search techniques tend to spend most of the time exploring a restricted area of the search space preventing the search to visit more promising areas, and thus leading to solutions of poor quality. Designing efficient optimization search techniques requires a tactical interplay between diversification and intensification. The former refers to the ability to explore many different regions of the search space, whereas the latter refers to the ability to obtain high quality solutions within those regions. In this paper, three well known metaheuristics (Tabu Search, Memetic Algorithm and Walksat) are used with the multilevel context. The multilevel strategy involves looking at the search as a process evolving from a k-flip neighborhood to the standard I-flip neighborhood-based structure in order to achieve a tactical interplay between diversification and intensification. Benchmark results exhibit good prospects of multilevel metaheuristics.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122263329","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}
Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560813
Ibrahim El Bitar, Fatima-Zahra Belouadha, O. Roudiès
The WS (Web services) description is an important step in the services consumption's cycle. Semantic WS extends the capabilities of a WS by associating semantic concepts in order to enable better search, discovery, selection, composition and integration. Several WS description approaches have been proposed to present a detailed description exceeding the limitations of the syntactic standard WSDL. Our analysis of these works leads us to group them into two classes: Annotations Based Description Approaches and Semantic Language Based Approaches. In this paper, we provide a comparative evaluation of these approaches based on a set of criteria that can be qualified as performance indicators. The identified comparison criteria are the following: ontology dependence, service description adaptation, expressiveness and the capacity of the description.
{"title":"Review of Web services description approaches","authors":"Ibrahim El Bitar, Fatima-Zahra Belouadha, O. Roudiès","doi":"10.1109/SITA.2013.6560813","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560813","url":null,"abstract":"The WS (Web services) description is an important step in the services consumption's cycle. Semantic WS extends the capabilities of a WS by associating semantic concepts in order to enable better search, discovery, selection, composition and integration. Several WS description approaches have been proposed to present a detailed description exceeding the limitations of the syntactic standard WSDL. Our analysis of these works leads us to group them into two classes: Annotations Based Description Approaches and Semantic Language Based Approaches. In this paper, we provide a comparative evaluation of these approaches based on a set of criteria that can be qualified as performance indicators. The identified comparison criteria are the following: ontology dependence, service description adaptation, expressiveness and the capacity of the description.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115305929","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}
Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560821
Hassan Razouki, Abdellatif Hair
Security presents a crucial point in mobile agent systems and may hinder the expansion and use of this paradigm. The protection of mobile agents is considered as one of the greatest challenges of security, because the platform of execution has access to all the components of the mobile agent. In this paper, we present a new architecture paradigm of mobile agents, which allows the separation of the implementation tasks of the agent and its security mechauisms. Our approach is based on using two strategies of adaptation to adapt the mobile agent security at runtime, depending on the sensitivity of the services required to perform the duties of the agent and the degree of confidence of the visited platforms. The first is a static adaptation performed by the MSAS (the Management System of Agents Security). The second is a reflexive structural dynamic adaptation performed by the mobile agent itself. These two adaptations take into account the dynamic security requirements in systems based on mobile agent.
{"title":"Components-based software architecture for secure mobile agents via two strategies of adaptation","authors":"Hassan Razouki, Abdellatif Hair","doi":"10.1109/SITA.2013.6560821","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560821","url":null,"abstract":"Security presents a crucial point in mobile agent systems and may hinder the expansion and use of this paradigm. The protection of mobile agents is considered as one of the greatest challenges of security, because the platform of execution has access to all the components of the mobile agent. In this paper, we present a new architecture paradigm of mobile agents, which allows the separation of the implementation tasks of the agent and its security mechauisms. Our approach is based on using two strategies of adaptation to adapt the mobile agent security at runtime, depending on the sensitivity of the services required to perform the duties of the agent and the degree of confidence of the visited platforms. The first is a static adaptation performed by the MSAS (the Management System of Agents Security). The second is a reflexive structural dynamic adaptation performed by the mobile agent itself. These two adaptations take into account the dynamic security requirements in systems based on mobile agent.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130129799","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}
Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560815
Hanane Lhannaoui, M. Kabbaj, Z. Bakkoury
Business process management aims to create and develop value inside organizations. Though, business processes are exposed to different risks that may cause failures in their execution. In order to preserve this value, applying risk management principles in Business process management discipline has become a field that takes a lot of attention. Risk-aware Business Process Management (R-BPM) is an area that combines the advantages of Business Process Management and Risk Management. Some works tried to propose approaches for mitigating risks but only in the execution phase. Our research work aims to mitigate risks by design using a method based on a risk analysis technique HAZOP (HA-Zard OP-erability). In this paper, our objective is twofold. We will firstly introduce an approach for analyzing business process models using an adaptation of HAZOP, propose recommendations for reducing risks and we will then plan actions to implement those recommendations by design. Afterward, we will propose a redesign for the business process model and consequently get an improvement for the original model.
业务流程管理的目标是在组织内部创造和发展价值。但是，业务流程暴露于可能导致其执行失败的不同风险中。为了保持这一价值，在业务流程管理规程中应用风险管理原则已成为一个备受关注的领域。风险感知业务流程管理(R-BPM)是一个结合了业务流程管理和风险管理优点的领域。一些作品试图提出降低风险的方法，但只在执行阶段。我们的研究工作旨在通过设计基于风险分析技术HAZOP (HA-Zard op - operability)的方法来降低风险。在本文中，我们的目标是双重的。我们将首先介绍一种使用HAZOP的改编来分析业务流程模型的方法，提出降低风险的建议，然后我们将计划行动，通过设计来实现这些建议。之后，我们将建议对业务流程模型进行重新设计，从而对原始模型进行改进。
{"title":"Towards an approach to improve business process models using risk management techniques","authors":"Hanane Lhannaoui, M. Kabbaj, Z. Bakkoury","doi":"10.1109/SITA.2013.6560815","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560815","url":null,"abstract":"Business process management aims to create and develop value inside organizations. Though, business processes are exposed to different risks that may cause failures in their execution. In order to preserve this value, applying risk management principles in Business process management discipline has become a field that takes a lot of attention. Risk-aware Business Process Management (R-BPM) is an area that combines the advantages of Business Process Management and Risk Management. Some works tried to propose approaches for mitigating risks but only in the execution phase. Our research work aims to mitigate risks by design using a method based on a risk analysis technique HAZOP (HA-Zard OP-erability). In this paper, our objective is twofold. We will firstly introduce an approach for analyzing business process models using an adaptation of HAZOP, propose recommendations for reducing risks and we will then plan actions to implement those recommendations by design. Afterward, we will propose a redesign for the business process model and consequently get an improvement for the original model.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132417418","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}
Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560817
Zebbara Khalid, EL-Ansari Mohamed, Mazoul Abdenbi
This paper presents a fast road obstacle detection system based on stereo vision. The algorithm contains three main components: road detection, obstacle detection and obstacles tracking. The road detection is achieved by using a small rectangular shape at bottom center of disparity image to extract the disparities of the road. The roadsides are located by using morphological processing and Hough transform. In the obstacle detection process, the objects can be easily located by the segmentation process. The obstacles' tracking is achieved by the discrete Kalman filter. The proposed approach has been tested on different images. The provided results demonstrate the effectiveness of the proposed method.
{"title":"Stereo vision-based road obstacles detection","authors":"Zebbara Khalid, EL-Ansari Mohamed, Mazoul Abdenbi","doi":"10.1109/SITA.2013.6560817","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560817","url":null,"abstract":"This paper presents a fast road obstacle detection system based on stereo vision. The algorithm contains three main components: road detection, obstacle detection and obstacles tracking. The road detection is achieved by using a small rectangular shape at bottom center of disparity image to extract the disparities of the road. The roadsides are located by using morphological processing and Hough transform. In the obstacle detection process, the objects can be easily located by the segmentation process. The obstacles' tracking is achieved by the discrete Kalman filter. The proposed approach has been tested on different images. The provided results demonstrate the effectiveness of the proposed method.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132112069","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}
Pub Date : 2013-05-08DOI: 10.1109/SITA.2013.6560797
Ali Aajli, K. Afdel
The distance learning platforms are increasingly used in universities, colleges and companies seeking effective and continuous training of their employees without constraint of time and space. The effectiveness of such a learning system depends mainly on the degree of information assimilated by the learner at the end of training. In this article, we focus on the implementation of a system for measuring competence for computer sciences. This system uses the model of item response theory. The results provided by this system are presented to the student, as a dashboard. They will allow the teacher or tutor to have the necessary elements to monitor their learning by identifying the causes blocking and checking its achievements. This system can also help to improve the recruitment process of companies using it in a near-selection process of candidates for jobs.
{"title":"Conception and implementation of a computer adaptive assessment system for E-Learning based on a new measuring skills approach","authors":"Ali Aajli, K. Afdel","doi":"10.1109/SITA.2013.6560797","DOIUrl":"https://doi.org/10.1109/SITA.2013.6560797","url":null,"abstract":"The distance learning platforms are increasingly used in universities, colleges and companies seeking effective and continuous training of their employees without constraint of time and space. The effectiveness of such a learning system depends mainly on the degree of information assimilated by the learner at the end of training. In this article, we focus on the implementation of a system for measuring competence for computer sciences. This system uses the model of item response theory. The results provided by this system are presented to the student, as a dashboard. They will allow the teacher or tutor to have the necessary elements to monitor their learning by identifying the causes blocking and checking its achievements. This system can also help to improve the recruitment process of companies using it in a near-selection process of candidates for jobs.","PeriodicalId":145244,"journal":{"name":"2013 8th International Conference on Intelligent Systems: Theories and Applications (SITA)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125015666","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
扫码关注我们
求助内容：
应助结果提醒方式：