{"title":"Raising information system effectiveness through Webservices","authors":"Sami Mahfoudhi, R. Faiz","doi":"10.1109/AICCSA.2010.5587005","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587005","url":null,"abstract":"Previous researches suggested that user resistance is one of the major problems facing Information Technology project effectiveness in developing countries. This user resistance is based partially on the non alignment of the new designed IT project with the organization cultural and social factors characterizing the internal environment of organization in developing countries. On the other hand, technical anomalies are also considered to be effectiveness barriers and direct causes of user resistance. The purpose of our research is to provide technical solutions to reduce the user resistance and raising the effectiveness of the IT through the using of Webservices technology.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125430248","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}
{"title":"Aspect oriented Modeling of Real-Time system with UML and MARTE","authors":"Naoufel Machta, M. Bennani, S. Ahmed","doi":"10.1109/AICCSA.2010.5586948","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586948","url":null,"abstract":"In this paper we introduce a aspect oriented modeling based-approach to build real-time application, which consists of transforming standard application into real-time ones at design time. This is performed by weaving real-time constraints, such as timing, scheduling, synchronization and architecture deployment into the standard application. We introduce a rule which defines how real-time constraints will be woven. Depending on the design language, this rule will have a set of instantiation values. We guess, in this paper1, the case of UML designed standard applications which will be processed into a MARTE ( UML profile for Modeling and Analyzing Real-Time and Embedded systems) real-time application model. We introduce our approach through a case study from the literature on real-time and embedded systems.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125540838","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}
{"title":"RBT-Km: K-Means clustering for Multiple Sequence Alignment","authors":"J. Taheri, Albert Y. Zomaya","doi":"10.1109/AICCSA.2010.5586934","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586934","url":null,"abstract":"This paper presents a novel approach for solving the Multiple Sequence Alignment (MSA) problem. K-Means clustering is combined with the Rubber Band Technique (RBT) to introduce an iterative optimization algorithm, namely RBT-Km, to find the optimal alignment for a set of input protein sequences. In this technique, the MSA problem is modeled as a Rubber Band, while the solution space is modeled as plate with several poles corresponding locations in the input sequences that are most likely to be correlated and/or biologically related. K-Means clustering is then used to discriminate biologically related locations from those that may appear by chance. RBT-Km is tested with one of the well-known benchmarks in this field (BALiBASE 2.0). The results demonstrate the superiority of the proposed technique even in the case of formidable sequences.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121161873","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}
{"title":"A Multi Start Great Deluge metaheuristic for engineering design problems","authors":"S. Dhouib","doi":"10.1109/AICCSA.2010.5586932","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586932","url":null,"abstract":"The Great Deluge (GD) metaheuristic is general, powerful and easily implemented, it is derived from Simulated Annealing (SA). In this paper, a Multi Start Great Deluge (MSGD) method is proposed and applied to optimize engineering design problems. The MSGD approach uses the GD algorithm to intensify search and employ the Multi Start technique to diversify the workspace. By computer simulations, it is shown that the performance of the proposed algorithms MSGD is better than the previous simulated annealing and genetic algorithm.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122480967","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}
{"title":"Characteristics of assembled bursts in OBS network under correlated input traffic","authors":"G. Chakraborty, S. Choudhury, N. Debnath","doi":"10.1109/AICCSA.2010.5586988","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586988","url":null,"abstract":"In this paper, a general analytical model for computation of burst length distribution and burst assembly time distribution for different burst assembly algorithms, under correlated input traffic, at the output of an edge optical burst switching node, has been developed. The model is developed by extending our previous work that was capable of capturing the effect of correlation only for time based burstifier. The effects of correlation in all three static kinds of burstifier has been studied and it is found that variance of both burst length distribution and assembly time distribution increase with increase in input traffic correlation. It is also observed that for a dual threshold based burstifier, the probability of reaching the thresholds change significantly with change in source correlation. Approximation techniques, to reduce the time complexity of the model, have also been suggested.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132487884","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}
{"title":"Adaptive audio-aware scheduling in Xen virtual environment","authors":"Huacai Chen, Hai Jin, Kan Hu, Minhao Yuan","doi":"10.1109/AICCSA.2010.5586974","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586974","url":null,"abstract":"With the development of client virtualization technology, it has become an important tendency to apply soft real-time applications in virtual environment. Currently, most schedulers in VMM (i.e., virtual machine monitor) take the fairly sharing of processor resources and load balancing as a main concern, while show less regard to application diversity and I/O responsiveness. This would be unable to meet the requirement for latency-sensitive tasks, such as audio application. Audio stream may suffer from severe input buffer overrun or output buffer underrun, especially in the case that there is no real-time guarantee on virtualized clients under heavy load. In this paper, we introduce experiments to illustrate that current scheduler in Xen does a poor job in guaranteeing fluent audio playing, and then formulate the fluent playing conditions a scheduler should satisfy. A scheduling strategy with soft real-time support is proposed to improve the responsiveness of latency-sensitive guests. To implement our proposition, we extend the Credit scheduler by using flexible time slice and real-time priority. Our solution is audio-aware and capable of adjusting the real-time priority of guest domains adaptively, achieving a better experience for end-users. The experimental results show that audio glitches can be completely eliminated via our extended scheduler even when the system load is very high.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132562561","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}
{"title":"Evaluations of the strong ground motion parameter by neural computing and microtremor measurement","authors":"T. Kerh, Tienchi Ku, D. Gunaratnam","doi":"10.1109/AICCSA.2010.5587031","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587031","url":null,"abstract":"In this study, a new weight-based neural network model was developed in accordance with a series of historical seismic records to estimate peak ground acceleration at a total of 33 train stations in the Kaohsiung mass rapid transit system of Taiwan. The performance of this model was compared with a simple distribution model and an available ambient vibration survey. The comparison of results showed that the neural network models exhibit a variation tendency similar to the microtremor measurements for all the train stations. The results also showed that over 90% of estimations by the weight-based neural network model were smaller than that of the simple distribution model, and the former model proved to perform better, as the estimations were closer to the survey data for most of the cases. This type of weight-based neural network model might capture the actual response at a construction site more closely, and the results obtained confirm that all train stations comply with the seismic requirement of the building code.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130735720","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}
{"title":"Wireless multimedia sensor and actuator system: A necessary public security and safety testbed for an urban emergency preparedness class of applications","authors":"A. Boukerche","doi":"10.1109/AICCSA.2010.5587047","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5587047","url":null,"abstract":"This talk will consist in an overview about the majore search projects related to wireless multimedia, context aware computing and wireless ad hoc and sensor networks, distributed and collaborative virtual environment, which we are currently investigating at PARADISE Research Laboratory, uOttawa. Next, we shall focus upon the design of large-scale distributed and mobile system for critical conditions monitoring class of applications using both location/context aware computing and wireless multimedia sensor and actor technologies. Then, we shall focus upon the security and localization problems in mobile and wireless multimedia sensor networks. Finally, if time permits, we will talk about LIVE testbed, a convergence of Wireless sensors, wireless multimedia and virtual environment technologies we are developing at PARADISE Research Laboratory for an emergency preparedness and response class of applications as well as SWiMNet, a high performance testbed we have developed which allows very detailed and realistic model specifications. It will facilitate and enable us to evaluate and design new protocols and applications for future generations of wireless sensor and vehicular network technologies.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131091636","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}
{"title":"Accuracy of morphology-based phylogenetic fossil placement under Maximum Likelihood","authors":"S. Berger, A. Stamatakis","doi":"10.1109/AICCSA.2010.5586939","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586939","url":null,"abstract":"The capability to conduct Maximum Likelihood based phylogenetic (evolutionary) analyses on datasets that contain both morphological, as well as molecular data partitions with programs such as RAxML, gives rise to new methodological questions. As we demonstrate on 5 real world datasets that comprise morphological as well as DNA data the trees inferred by separately using the morphological or molecular data partitions are highly incongruent. Since in typical current-day phylogenomic alignments, there is significantly more molecular than morphological data available, and hence the final tree shape in a concatenated analysis is dominated by molecular data, the question arises how morphological data can be used within this context. One important application lies in the phylogenetic placement of fossil taxa (for which only morphological data is available) into a fixed, given molecular or otherwise well-established reference tree. By using real and simulated datasets we conduct the first assessment of placement accuracy for fossil taxa under the Maximum Likelihood criterion. We demonstrate that, despite conflicting phylogenetic signals from the morphological and molecular partitions, the Maximum Likelihood criterion is powerful enough to yield accurate fossil placements. Moreover, we develop and make available a new morphological site weight calibration algorithm that yields an average improvement of fossil placement accuracy of 20% on more than 2,500 simulated datasets and of 25% on the 5 real-world datasets that all contain highly conflicting phylogenetic signal.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130647531","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}
M. Khouadjia, Laetitia Vermeulen-Jourdan, E. Talbi
{"title":"Adaptive particle swarm for solving the Dynamic Vehicle Routing Problem","authors":"M. Khouadjia, Laetitia Vermeulen-Jourdan, E. Talbi","doi":"10.1109/AICCSA.2010.5586976","DOIUrl":"https://doi.org/10.1109/AICCSA.2010.5586976","url":null,"abstract":"Usually, the combinatorial optimization problems are modeled in a static way. All data are known in advance, i.e., before the optimization process has started. But in practice, many problems are dynamic, and change during the time. For the Dynamic Vehicle Routing Problem (DVRP), new orders arrive when the working day plan is in progress. Thus, the routes must be reconfigured dynamically during the optimization process. The Particle Swarm Optimization has been previously used to solve continuous dynamic optimization problems, whereas only, few works were proposed for combinatorial ones. In this paper, we present an Adaptive Particle Swarm for solving the Vehicle Routing Problem with Dynamic Requests (VRPDR). The effectiveness of this approach is evaluated thanks to a well-known set of benchmarks. It is compared with different population based metaheuristics, and a single-solution based metaheuristic. Experimental results show that our approach may significantly decrease travel distances, and is adaptive with respect to dynamic environment.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127361146","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}