Pub Date : 2013-10-17DOI: 10.1109/IcConSCS.2013.6632021
Andreea Lavinia Popescu, D. Popescu, Radu Tudor Ionescu, N. Angelescu, Romeo Cojocaru
This paper presents an alternative approach to classical box counting algorithm for fractal dimension estimation. Irrelevant data are eliminated from input sequences of the algorithm and a new fractal dimension, called efficient fractal dimension (EFD), which is based on the remaining sequences is calculated. The discriminating capacity and the time efficiency of EFD are evaluated in comparison with fractal dimension (FD) computed by box counting both theoretically and empirically. The results revealed that EFD is better than FD for texture identification and classification.
{"title":"Efficient fractal method for texture classification","authors":"Andreea Lavinia Popescu, D. Popescu, Radu Tudor Ionescu, N. Angelescu, Romeo Cojocaru","doi":"10.1109/IcConSCS.2013.6632021","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632021","url":null,"abstract":"This paper presents an alternative approach to classical box counting algorithm for fractal dimension estimation. Irrelevant data are eliminated from input sequences of the algorithm and a new fractal dimension, called efficient fractal dimension (EFD), which is based on the remaining sequences is calculated. The discriminating capacity and the time efficiency of EFD are evaluated in comparison with fractal dimension (FD) computed by box counting both theoretically and empirically. The results revealed that EFD is better than FD for texture identification and classification.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130300424","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-10-17DOI: 10.1109/IcConSCS.2013.6632020
I. Tache, C. Vasseur, D. Stefanoiu, M. Vermandel, D. Popescu
The x-ray angiograms are frequently performed before a cerebral intervention on diseased vessels. The clinicians complain about the difficulty to find small vessels on images with grey level intensities and to differentiate veins from arteries. The main problem in classification resides in finding the right parameters which can completely characterize the patterns of pixels' intensity time course from x-ray projection image series. A basic signal processing was made: a low pass filter for eliminating the undesired information, as long as the application of fast Fourier transform for investigation of signal spectral characteristics. In the presented article, a classification method of blood vessels from the cerebral angiograms based on temporal signals is presented, with a successful rate of identification of arteries of 78% and veins of 65%.
{"title":"Supervised classification of cerebral blood vessels","authors":"I. Tache, C. Vasseur, D. Stefanoiu, M. Vermandel, D. Popescu","doi":"10.1109/IcConSCS.2013.6632020","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632020","url":null,"abstract":"The x-ray angiograms are frequently performed before a cerebral intervention on diseased vessels. The clinicians complain about the difficulty to find small vessels on images with grey level intensities and to differentiate veins from arteries. The main problem in classification resides in finding the right parameters which can completely characterize the patterns of pixels' intensity time course from x-ray projection image series. A basic signal processing was made: a low pass filter for eliminating the undesired information, as long as the application of fast Fourier transform for investigation of signal spectral characteristics. In the presented article, a classification method of blood vessels from the cerebral angiograms based on temporal signals is presented, with a successful rate of identification of arteries of 78% and veins of 65%.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116122358","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-10-17DOI: 10.1109/IcConSCS.2013.6632062
Houssem Eddine Hadji, Malika Babes
The frequency assignment problem (FAP), where the objective is to find the best possible combination that minimizes the total number of violations in an assignment, is studied in this paper using a Tabu Search (TS) algorithm with a dynamic tabu list in order to improve the performance and the effectiveness of original TS algorithm. The basic idea is to really explore and exploit the search space and to escape from local minimum in order to have more chance to find the global optimum. Due to the NP-hardness of the FAP, any optimal solution is guaranteed in a limited time. So that, to reduce the computation time necessary to the convergence of our algorithm, we define a new objective (fitness function) for our model of solution. Our experimental results show that the computation time and accuracy is clearly improved and the proposed TS algorithm can be efficiently applied to find a near-optimal solution.
{"title":"Accelerating the convergence of a modified Tabu Search algorithm using a new objective function for the frequency assignment problem","authors":"Houssem Eddine Hadji, Malika Babes","doi":"10.1109/IcConSCS.2013.6632062","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632062","url":null,"abstract":"The frequency assignment problem (FAP), where the objective is to find the best possible combination that minimizes the total number of violations in an assignment, is studied in this paper using a Tabu Search (TS) algorithm with a dynamic tabu list in order to improve the performance and the effectiveness of original TS algorithm. The basic idea is to really explore and exploit the search space and to escape from local minimum in order to have more chance to find the global optimum. Due to the NP-hardness of the FAP, any optimal solution is guaranteed in a limited time. So that, to reduce the computation time necessary to the convergence of our algorithm, we define a new objective (fitness function) for our model of solution. Our experimental results show that the computation time and accuracy is clearly improved and the proposed TS algorithm can be efficiently applied to find a near-optimal solution.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130476033","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-10-17DOI: 10.1109/IcConSCS.2013.6632038
Lothar Kiltz, Marc Janocha, J. Rudolph
A plate that may freely move in the field of four electromagnets is automatically controlled such as to keep a ping-pong ball bouncing. A simple mathematical model of the process is used together with an algebraic derivative estimator in order to estimate the impact times of the ball. This information is used to predict the next impact. The only measurement used in this process is the plate position measurement. It is related with the reference forces in order to generate a motion appropriate to keep the ball bouncing. Precision and robustness against measurement noise, mechanical vibrations, and fast motions of the plate are achieved by a suitable parameterization of the algebraic derivative estimator and an automatic calibration. Experimental results are shown.
{"title":"Algebraic estimation of impact times: Juggling a ball with a magnetically levitated plate","authors":"Lothar Kiltz, Marc Janocha, J. Rudolph","doi":"10.1109/IcConSCS.2013.6632038","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632038","url":null,"abstract":"A plate that may freely move in the field of four electromagnets is automatically controlled such as to keep a ping-pong ball bouncing. A simple mathematical model of the process is used together with an algebraic derivative estimator in order to estimate the impact times of the ball. This information is used to predict the next impact. The only measurement used in this process is the plate position measurement. It is related with the reference forces in order to generate a motion appropriate to keep the ball bouncing. Precision and robustness against measurement noise, mechanical vibrations, and fast motions of the plate are achieved by a suitable parameterization of the algebraic derivative estimator and an automatic calibration. Experimental results are shown.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128231745","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-10-17DOI: 10.1109/IcConSCS.2013.6632061
M. Dascalu, Stefan Trausan-Matu, Philippe Dessus
Starting from dialogism in which every act is perceived as a dialogue, we shift the perspective towards multi-participant chat conversations from Computer Supported Collaborative Learning in which ideas, points of view or more generally put voices interact, inter-animate and generate the context of a conversation. Within this perspective of discourse analysis, we introduce an implemented framework, ReaderBench, for modeling and automatically evaluating polyphony that emerges as an overlap or synergy of voices. Moreover, multiple evaluation factors were analyzed for quantifying the importance of a voice and various functions were experimented to best reflect the synergic effect of co-occurring voices for modeling the underlying discourse structure.
{"title":"Voices' inter-animation detection with readerbench modelling and assessing polyphony in CSCL chats as voice synergy","authors":"M. Dascalu, Stefan Trausan-Matu, Philippe Dessus","doi":"10.1109/IcConSCS.2013.6632061","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632061","url":null,"abstract":"Starting from dialogism in which every act is perceived as a dialogue, we shift the perspective towards multi-participant chat conversations from Computer Supported Collaborative Learning in which ideas, points of view or more generally put voices interact, inter-animate and generate the context of a conversation. Within this perspective of discourse analysis, we introduce an implemented framework, ReaderBench, for modeling and automatically evaluating polyphony that emerges as an overlap or synergy of voices. Moreover, multiple evaluation factors were analyzed for quantifying the importance of a voice and various functions were experimented to best reflect the synergic effect of co-occurring voices for modeling the underlying discourse structure.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123885362","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-10-17DOI: 10.1109/IcConSCS.2013.6632014
M. Benrejeb
The proposed stability conditions of dynamical systems characterized by arrow form matrices, presented in this paper, are deduced from stability study of overvaluing systems based vector norms and the use of the practical Borne and Gentina stability criterion. These matrices, with non null elements located around its diagonal and its last rows and columns, are well adapted with the chosen stability criterion based determinants computation. It is shown that this stability study approach is also efficient for multimodel system control and for coupled chaotic systems hybrid synchronization.
{"title":"On the use of arrow form matrices for processes stability and stabilizability studies","authors":"M. Benrejeb","doi":"10.1109/IcConSCS.2013.6632014","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632014","url":null,"abstract":"The proposed stability conditions of dynamical systems characterized by arrow form matrices, presented in this paper, are deduced from stability study of overvaluing systems based vector norms and the use of the practical Borne and Gentina stability criterion. These matrices, with non null elements located around its diagonal and its last rows and columns, are well adapted with the chosen stability criterion based determinants computation. It is shown that this stability study approach is also efficient for multimodel system control and for coupled chaotic systems hybrid synchronization.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124892777","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-10-17DOI: 10.1109/IcConSCS.2013.6632034
C. Petrescu, C. Lupu, F. Tudor, M. Azzouzi
This paper presents the design and the realization of data acquisition system measure, to record and to maximize solar panel power. The special feature of this system is the short sampling time that allows tracking of fast variations in solar irradiance. It was designed to operate autonomously hence; low power consumption and local data storage capabilities were the main requirements that were taken into account during the design stage.
{"title":"Data acquisition system for recording of photovoltaic panel power","authors":"C. Petrescu, C. Lupu, F. Tudor, M. Azzouzi","doi":"10.1109/IcConSCS.2013.6632034","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632034","url":null,"abstract":"This paper presents the design and the realization of data acquisition system measure, to record and to maximize solar panel power. The special feature of this system is the short sampling time that allows tracking of fast variations in solar irradiance. It was designed to operate autonomously hence; low power consumption and local data storage capabilities were the main requirements that were taken into account during the design stage.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115114989","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-10-17DOI: 10.1109/IcConSCS.2013.6632035
R. Mateescu, D. Stefanoiu, N. D. Christov
This paper proposes a discrete-time predictive controller with constraints for variable speed horizontal wind turbines. The control strategy, implemented using discrete-time model predictive control (MPC) is optimized using a certain set of constrains applied to the control signal u(k). MPC provides an integrated solution for controlling systems with interacting variables, complex dynamics and constraints. The paper will show that with a small modification in the control signal, the degree of performance deterioration can be reduced if the constraints are incorporated in the implementation, leading to the idea of constrained control.
{"title":"Discrete-time MPC with constraints for variable speed wind turbines","authors":"R. Mateescu, D. Stefanoiu, N. D. Christov","doi":"10.1109/IcConSCS.2013.6632035","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632035","url":null,"abstract":"This paper proposes a discrete-time predictive controller with constraints for variable speed horizontal wind turbines. The control strategy, implemented using discrete-time model predictive control (MPC) is optimized using a certain set of constrains applied to the control signal u(k). MPC provides an integrated solution for controlling systems with interacting variables, complex dynamics and constraints. The paper will show that with a small modification in the control signal, the degree of performance deterioration can be reduced if the constraints are incorporated in the implementation, leading to the idea of constrained control.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124893844","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-10-17DOI: 10.1109/IcConSCS.2013.6632029
Alexandru Alin Fasui, A. Olteanu, N. Tapus
Mobile devices become more and more powerful with each generation and, from a performance point of view, they are rapidly approaching modern computers and laptops. Both user requirements and recent research efforts lead to solutions that allow this new category of computers to be included in a distributed computing environment. First, we discuss some of the key challenges of integrating mobile devices into distributed computing systems. Second, we survey current frameworks and mechanisms for this kind of integration. Third, we discuss per-device and per-application performance analysis. Fourth, we provide a case study on two mobile applications.
{"title":"On using Grid and distributed computing for mobile applications","authors":"Alexandru Alin Fasui, A. Olteanu, N. Tapus","doi":"10.1109/IcConSCS.2013.6632029","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632029","url":null,"abstract":"Mobile devices become more and more powerful with each generation and, from a performance point of view, they are rapidly approaching modern computers and laptops. Both user requirements and recent research efforts lead to solutions that allow this new category of computers to be included in a distributed computing environment. First, we discuss some of the key challenges of integrating mobile devices into distributed computing systems. Second, we survey current frameworks and mechanisms for this kind of integration. Third, we discuss per-device and per-application performance analysis. Fourth, we provide a case study on two mobile applications.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125217327","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-10-17DOI: 10.1109/IcConSCS.2013.6632031
Virgil Zamfirache, Alina Eftcnoiu, Paula Iosif, A. Olteanu, N. Tapus
Distance learning is an increasingly popular concept, based on the existence of educational institutions that produce online materials and support, and of numerous students that consume these resources at their own pace. In recent years, a number of Course Management Systems appeared and are widely adopted by institutions across the world. As students are subjects to the increasing popularity of mobiles, an additional step can be taken in which mobile devices are introduced to further assist them in various learning activities. This concept, known as m-Learning (Mobile Learning) leads to a better organization of available resources and a `anywhere, anytime' type of access. However, current mobile solutions for interaction with Course Management Systems are not exploiting some of the best advantages mobiles have, with consequences on performance and functionality. This paper follows the design and development of a mobile application and a web service designed as an extension to the Moodle course management system, with mobile-specific functionality, such as the offline mode, notifications, and attendance based on location.
{"title":"Extending the moodle course management system for mobile devices","authors":"Virgil Zamfirache, Alina Eftcnoiu, Paula Iosif, A. Olteanu, N. Tapus","doi":"10.1109/IcConSCS.2013.6632031","DOIUrl":"https://doi.org/10.1109/IcConSCS.2013.6632031","url":null,"abstract":"Distance learning is an increasingly popular concept, based on the existence of educational institutions that produce online materials and support, and of numerous students that consume these resources at their own pace. In recent years, a number of Course Management Systems appeared and are widely adopted by institutions across the world. As students are subjects to the increasing popularity of mobiles, an additional step can be taken in which mobile devices are introduced to further assist them in various learning activities. This concept, known as m-Learning (Mobile Learning) leads to a better organization of available resources and a `anywhere, anytime' type of access. However, current mobile solutions for interaction with Course Management Systems are not exploiting some of the best advantages mobiles have, with consequences on performance and functionality. This paper follows the design and development of a mobile application and a web service designed as an extension to the Moodle course management system, with mobile-specific functionality, such as the offline mode, notifications, and attendance based on location.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134319760","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
扫码关注我们
求助内容：
应助结果提醒方式：