Pub Date : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7880017
Farouk Chetouah, N. Bouzit, I. Messaoudene, Salih Aidel, Massinissa Belazzoug, B. Hammache
In this communication, we propose a miniaturized rectangular dielectric resonator antenna (RDRA) for wireless communication services (WCS). The studied structure consists of a rectangular Dielectric resonator stacked on a thick layer of dielectric material that has very high permittivity. The numerical analysis was done by two different electromagnetic modeling software; Ansoft HFSS and CST. The obtained results are given in terms of the reflection coefficients and the radiation characteristics of the proposed antenna. The proposed antenna design operates around 2.314 GHz and provides an impedance bandwidth of 20 MHz.
{"title":"Miniaturized rectangular dielectric resonator antenna for WCS standards","authors":"Farouk Chetouah, N. Bouzit, I. Messaoudene, Salih Aidel, Massinissa Belazzoug, B. Hammache","doi":"10.1109/INNOVATIONS.2016.7880017","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7880017","url":null,"abstract":"In this communication, we propose a miniaturized rectangular dielectric resonator antenna (RDRA) for wireless communication services (WCS). The studied structure consists of a rectangular Dielectric resonator stacked on a thick layer of dielectric material that has very high permittivity. The numerical analysis was done by two different electromagnetic modeling software; Ansoft HFSS and CST. The obtained results are given in terms of the reflection coefficients and the radiation characteristics of the proposed antenna. The proposed antenna design operates around 2.314 GHz and provides an impedance bandwidth of 20 MHz.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125205068","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 : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7880036
Sheikh Nasir Saeed, A. Abid, Ehsan U. Waraich, S. Atta, A. Naseer, A. Sheikh, Emad A. Felemban
To manage large crowded events is a very challenging task nowadays. People are looking for solutions in which they can easily monitor the crowd, trace individuals, study formation and deformation patterns of the crowd. Millions of Muslims from around the world gather and perform Hajj in Makkah, Saudi Arabia in the 12th month of every lunar year. To monitor the crowd during Hajj is a great challenge. In this paper, we are proposing an identifiable crowd monitoring framework named iCrowd. This framework collect, identify, infer, analyze, store and retrieve the real-time location information of each of the pre-registered participants (pilgrims), and provides a digital view of crowd in near real-time. iCrowd framework is designed on a three-layer approach, device layer, middleware layer, and the application layer. We demonstrate our proposed framework with simulated data in the context of the event of Hajj.
{"title":"iCrowd — A framework for monitoring of identifiable crowd","authors":"Sheikh Nasir Saeed, A. Abid, Ehsan U. Waraich, S. Atta, A. Naseer, A. Sheikh, Emad A. Felemban","doi":"10.1109/INNOVATIONS.2016.7880036","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7880036","url":null,"abstract":"To manage large crowded events is a very challenging task nowadays. People are looking for solutions in which they can easily monitor the crowd, trace individuals, study formation and deformation patterns of the crowd. Millions of Muslims from around the world gather and perform Hajj in Makkah, Saudi Arabia in the 12th month of every lunar year. To monitor the crowd during Hajj is a great challenge. In this paper, we are proposing an identifiable crowd monitoring framework named iCrowd. This framework collect, identify, infer, analyze, store and retrieve the real-time location information of each of the pre-registered participants (pilgrims), and provides a digital view of crowd in near real-time. iCrowd framework is designed on a three-layer approach, device layer, middleware layer, and the application layer. We demonstrate our proposed framework with simulated data in the context of the event of Hajj.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131097382","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 : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7880046
N. Samsudin, A. Mustapha, M. Wahab
As blogs widely spread, the need to extract information is necessary in order to deal with different issues such as social, political, criminal and others. This research takes off from Gharehchopogh et al. [2], [3] who used the C4.5 and K-Nearest Neighbor (K-NN) algorithms to classify bloggers whether they are professional or otherwise from the Kohkilooyeh and Boyer Ahmad province in Iran. As a comparative measure, this paper proposed the Random Forest algorithm to perform the blog classification using the same dataset. The results showed that ensemble classification via Random Forest algorithm is able to produce higher precision of 88% as compared to 82% by the C4.5 algorithm and 84% by K-NN in the previous research.
{"title":"Ensemble classification of cyber space users tendency in blog writing using random forest","authors":"N. Samsudin, A. Mustapha, M. Wahab","doi":"10.1109/INNOVATIONS.2016.7880046","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7880046","url":null,"abstract":"As blogs widely spread, the need to extract information is necessary in order to deal with different issues such as social, political, criminal and others. This research takes off from Gharehchopogh et al. [2], [3] who used the C4.5 and K-Nearest Neighbor (K-NN) algorithms to classify bloggers whether they are professional or otherwise from the Kohkilooyeh and Boyer Ahmad province in Iran. As a comparative measure, this paper proposed the Random Forest algorithm to perform the blog classification using the same dataset. The results showed that ensemble classification via Random Forest algorithm is able to produce higher precision of 88% as compared to 82% by the C4.5 algorithm and 84% by K-NN in the previous research.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128609144","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 : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7880027
Aravassery Jihad, S. Mathew, Sujni Paul, D. PonmaryPushpalatha
With diabetes patients doubling every year especially in the UAE there is a need to curb this epidemic and help those who are affected to live an active life. Continuous monitoring of health indicators ensures prompt medical attention and reduction in fatalities. The primary challenge to continuously monitor diabetes is that glucose level measurement requires invasive methods. Moreover, continuous monitoring must happen remotely and therefore would require computing and networking technologies that is seamless, real-time, high speed, and with large storage capacities. With the increasing penetration of smartphones, especially in the UAE, we propose a framework for continuous monitoring of diabetes on the smartphone platform. We also survey the state-of-the-art in continuous health monitoring.
{"title":"Continuous health monitoring using smartphones — A case-study for monitoring diabetic patients in UAE","authors":"Aravassery Jihad, S. Mathew, Sujni Paul, D. PonmaryPushpalatha","doi":"10.1109/INNOVATIONS.2016.7880027","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7880027","url":null,"abstract":"With diabetes patients doubling every year especially in the UAE there is a need to curb this epidemic and help those who are affected to live an active life. Continuous monitoring of health indicators ensures prompt medical attention and reduction in fatalities. The primary challenge to continuously monitor diabetes is that glucose level measurement requires invasive methods. Moreover, continuous monitoring must happen remotely and therefore would require computing and networking technologies that is seamless, real-time, high speed, and with large storage capacities. With the increasing penetration of smartphones, especially in the UAE, we propose a framework for continuous monitoring of diabetes on the smartphone platform. We also survey the state-of-the-art in continuous health monitoring.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"33 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128732925","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 : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7880048
Leena Lulu, B. Belkhouche, S. Harous
Given an input document d, the problem of local text reuse detection is to detect from a given documents collection, all the possible reused passages between d and the other documents. Comparing the passages of document d with the passages of every other document in the collection is obviously infeasible especially with large collections such as the Web. Therefore, selecting a subset of the documents that potentially contains reused text with d becomes a major step in the detection problem. This paper describes a new efficient approach of query formulation to retrieve Arabic-based candidate source documents from the Web. We evaluated the work using a collection of documents especially constructed for this work. The experiments show that on average, 79.97% of the Web documents used in the reused cases were successfully retrieved.
{"title":"Candidate document retrieval for Arabic-based text reuse detection on the web","authors":"Leena Lulu, B. Belkhouche, S. Harous","doi":"10.1109/INNOVATIONS.2016.7880048","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7880048","url":null,"abstract":"Given an input document d, the problem of local text reuse detection is to detect from a given documents collection, all the possible reused passages between d and the other documents. Comparing the passages of document d with the passages of every other document in the collection is obviously infeasible especially with large collections such as the Web. Therefore, selecting a subset of the documents that potentially contains reused text with d becomes a major step in the detection problem. This paper describes a new efficient approach of query formulation to retrieve Arabic-based candidate source documents from the Web. We evaluated the work using a collection of documents especially constructed for this work. The experiments show that on average, 79.97% of the Web documents used in the reused cases were successfully retrieved.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114164775","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 : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7879991
B. Preneel
Bart Preneel is in the research group COSIC of the Electrical Engineering Department of the Katholieke Universiteit Leuven in Belgium. His main research area is information security focusing on cryptographic algorithms and protocols as well as their applications to computer and network security and mobile communications. His favorite research topics are hash functions, MAC algorithms, stream ciphers and block ciphers. He is teaching cryptology, network security, coding theory, and discrete applied algebra at the K.U. Leuven. He has been visiting professor at the Technical University Denmark, the Ruhr Universitaet Bochum (Germany), the Graz University of Technology (Austria), the University of Bergen (Norway), and the Universiteit Gent (Belgium). In ′93-′94 he was a research fellow at the University of California at Berkeley. He had contributed to the growth of COSIC, a research group in cryptology and its applications.
{"title":"Keynote speakers: The future of information security","authors":"B. Preneel","doi":"10.1109/INNOVATIONS.2016.7879991","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7879991","url":null,"abstract":"Bart Preneel is in the research group COSIC of the Electrical Engineering Department of the Katholieke Universiteit Leuven in Belgium. His main research area is information security focusing on cryptographic algorithms and protocols as well as their applications to computer and network security and mobile communications. His favorite research topics are hash functions, MAC algorithms, stream ciphers and block ciphers. He is teaching cryptology, network security, coding theory, and discrete applied algebra at the K.U. Leuven. He has been visiting professor at the Technical University Denmark, the Ruhr Universitaet Bochum (Germany), the Graz University of Technology (Austria), the University of Bergen (Norway), and the Universiteit Gent (Belgium). In ′93-′94 he was a research fellow at the University of California at Berkeley. He had contributed to the growth of COSIC, a research group in cryptology and its applications.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124478214","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 : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7880033
M. Fraiwan, Bayan Al-Younes, O. Al-Jarrah, N. Khasawneh
The prevalence of social media, in the whole world and the Arab region in particular, has fueled the active engagement and participation of large swaths of the Arabic society in current events. Social media has been used to rally public opinion, increase awareness, spread information/misinformation, and organize large events. Data analysis is necessary to drive decision making, advertisement, political campaigning, counter-intelligence, etc. The sheer volume of data and number of users calls for automated methods for analysis and classification of Arabic text. In this paper, the problem of analysis and classification of Arabic news reports was studied. Innovative methods, based on lexical analysis and machine learning, were employed to tame the complexity of the Arabic language. Different classification algorithms were compared and the classification accuracy results are promising. This research presents seminal steps toward specialized analysis of Arabic crowd-sourced data and social media.
{"title":"Analysis and classification of Arabic crowd-sourced news reports: A case study of the Syrian crisis","authors":"M. Fraiwan, Bayan Al-Younes, O. Al-Jarrah, N. Khasawneh","doi":"10.1109/INNOVATIONS.2016.7880033","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7880033","url":null,"abstract":"The prevalence of social media, in the whole world and the Arab region in particular, has fueled the active engagement and participation of large swaths of the Arabic society in current events. Social media has been used to rally public opinion, increase awareness, spread information/misinformation, and organize large events. Data analysis is necessary to drive decision making, advertisement, political campaigning, counter-intelligence, etc. The sheer volume of data and number of users calls for automated methods for analysis and classification of Arabic text. In this paper, the problem of analysis and classification of Arabic news reports was studied. Innovative methods, based on lexical analysis and machine learning, were employed to tame the complexity of the Arabic language. Different classification algorithms were compared and the classification accuracy results are promising. This research presents seminal steps toward specialized analysis of Arabic crowd-sourced data and social media.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133023863","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 : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7880053
M. N. Ba-Hutair, Z. Aghbari, I. Kamel
Social networks have gained a lot of interest in recent literature due to the huge amount of data that can be extracted from them. With this ever growing data, emerged the need for techniques to handle it and analyze it. Several papers have proposed many techniques to analyze a given social network from several aspects. Communities are a crucial property in social networks and community detection is considered one of the most important problems in these networks. For this, many papers have devised algorithms for detecting communities. The issue with these algorithms is that they only take into consideration the relation (or distance) between the nodes for detecting communities. In this paper, a new algorithm is proposed to detect communities based on the interests of the nodes rather than their distances from each other. The paper carries out some experiments to test how well is the clustering algorithm in terms of the accuracy and the execution time.
{"title":"On detecting communities in social networks with interests","authors":"M. N. Ba-Hutair, Z. Aghbari, I. Kamel","doi":"10.1109/INNOVATIONS.2016.7880053","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7880053","url":null,"abstract":"Social networks have gained a lot of interest in recent literature due to the huge amount of data that can be extracted from them. With this ever growing data, emerged the need for techniques to handle it and analyze it. Several papers have proposed many techniques to analyze a given social network from several aspects. Communities are a crucial property in social networks and community detection is considered one of the most important problems in these networks. For this, many papers have devised algorithms for detecting communities. The issue with these algorithms is that they only take into consideration the relation (or distance) between the nodes for detecting communities. In this paper, a new algorithm is proposed to detect communities based on the interests of the nodes rather than their distances from each other. The paper carries out some experiments to test how well is the clustering algorithm in terms of the accuracy and the execution time.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134293769","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 : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7880016
B. Hammache, A. Messai, I. Messaoudene, M. A. Meriche, Massinissa Belazzoug, Farouk Chetouah
In this paper, a reconfigurable triple notched-band UWB (Ultra Wide Band) antenna is presented. This compact antenna covers the frequency range from 3.1 GHz to 11.21 GHz. In order to reject a three frequency bands including the WiMAX (3.2–3.6 GHz), WLAN (5.15–5.85 GHz) and X band (7.25–8.395 GHz), we have inserted three different slots in the radiating patch; two C-shaped slots and a rectangular slot. To achieve the reconfiguration in the notched-band antenna, we have added a PIN diode in every slot to control these slots. The proposed antenna has a size of 30×30 mm2. The simulated results show a bandwidth with VSWR less than 2 and the radiation pattern is Omni-directional in XZ plane and bidirectional in YZ plane.
{"title":"Reconfigurable triple notched-band ultra wideband antenna","authors":"B. Hammache, A. Messai, I. Messaoudene, M. A. Meriche, Massinissa Belazzoug, Farouk Chetouah","doi":"10.1109/INNOVATIONS.2016.7880016","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7880016","url":null,"abstract":"In this paper, a reconfigurable triple notched-band UWB (Ultra Wide Band) antenna is presented. This compact antenna covers the frequency range from 3.1 GHz to 11.21 GHz. In order to reject a three frequency bands including the WiMAX (3.2–3.6 GHz), WLAN (5.15–5.85 GHz) and X band (7.25–8.395 GHz), we have inserted three different slots in the radiating patch; two C-shaped slots and a rectangular slot. To achieve the reconfiguration in the notched-band antenna, we have added a PIN diode in every slot to control these slots. The proposed antenna has a size of 30×30 mm2. The simulated results show a bandwidth with VSWR less than 2 and the radiation pattern is Omni-directional in XZ plane and bidirectional in YZ plane.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130994806","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 : 2016-11-01DOI: 10.1109/INNOVATIONS.2016.7880015
Eman Rabiah, B. Belkhouche
We investigate navigation algorithms, and specifically path planning, a fundamental function of autonomous robots. We formally address the issue of enhancing reliability of the widely-used A∗ path planning algorithm. In our step-wise refinement process, we capture successively more concrete specifications by transforming a high-level specification into an equivalent executable program. To elaborate an initial representation of the A∗ algorithm, we express it in an abstract and intuitive, yet formal, description. We use traditional mathematical concepts, such as sets, functions and predicate logic to capture this description. We then use the Z specification language to effect the transformation from the mathematical description into Z schemas, thus obtaining a formal specification. We use CZT to perform syntax and type checking and the Z/EVES tool to automatically prove some properties about the specification. Subsequently, we use the Z formal refinement theory to generate the implementation specification. This stage involves both data and operation refinement and is carried out in several basic sub-steps. A Java-based simulation prototype that mirrors the implementation specification is developed in order to demonstrate the applicability of our software development approach.
{"title":"Formal specification, refinement, and implementation of path planning","authors":"Eman Rabiah, B. Belkhouche","doi":"10.1109/INNOVATIONS.2016.7880015","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2016.7880015","url":null,"abstract":"We investigate navigation algorithms, and specifically path planning, a fundamental function of autonomous robots. We formally address the issue of enhancing reliability of the widely-used A∗ path planning algorithm. In our step-wise refinement process, we capture successively more concrete specifications by transforming a high-level specification into an equivalent executable program. To elaborate an initial representation of the A∗ algorithm, we express it in an abstract and intuitive, yet formal, description. We use traditional mathematical concepts, such as sets, functions and predicate logic to capture this description. We then use the Z specification language to effect the transformation from the mathematical description into Z schemas, thus obtaining a formal specification. We use CZT to perform syntax and type checking and the Z/EVES tool to automatically prove some properties about the specification. Subsequently, we use the Z formal refinement theory to generate the implementation specification. This stage involves both data and operation refinement and is carried out in several basic sub-steps. A Java-based simulation prototype that mirrors the implementation specification is developed in order to demonstrate the applicability of our software development approach.","PeriodicalId":412653,"journal":{"name":"2016 12th International Conference on Innovations in Information Technology (IIT)","volume":"401 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122189796","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
扫码关注我们
求助内容：
应助结果提醒方式：