Pub Date : 2021-01-01DOI: 10.24138/jcomss-2021-0028
Nyoman Putra Sastra, Komang Oka Saputra, D. Wiharta
In this paper, we improve the robustness of the Hough transform-based clock skew measurement on the occurrence of a jump point. The current Hough transform-based skew method uses angle (θ), thickness (ω), and region (β), to create a parallelogram that covers the densest part of an offset-set. However, the assumption that all offsets are considered to line up roughly in only one direction restricts the ability of the current method when handling an offset-set in which its densest part is located separately, the jump point condition. By acquiring the parallelogram from coexisting angle-region tuples at the beginning and the ending parts of the offset-set, we completed the ability of the Hough transform-based method to handle the jump point. When handling the jump point problem, the proposed coexisting parallelogram method could reach 0.35 ppm accuracy compared with tens ppm by the current methods.
{"title":"Coexisting Parallelogram Method to Handle Jump Point on Hough Transform-based Clock Skew Measurement","authors":"Nyoman Putra Sastra, Komang Oka Saputra, D. Wiharta","doi":"10.24138/jcomss-2021-0028","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0028","url":null,"abstract":"In this paper, we improve the robustness of the Hough transform-based clock skew measurement on the occurrence of a jump point. The current Hough transform-based skew method uses angle (θ), thickness (ω), and region (β), to create a parallelogram that covers the densest part of an offset-set. However, the assumption that all offsets are considered to line up roughly in only one direction restricts the ability of the current method when handling an offset-set in which its densest part is located separately, the jump point condition. By acquiring the parallelogram from coexisting angle-region tuples at the beginning and the ending parts of the offset-set, we completed the ability of the Hough transform-based method to handle the jump point. When handling the jump point problem, the proposed coexisting parallelogram method could reach 0.35 ppm accuracy compared with tens ppm by the current methods.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098797","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 : 2021-01-01DOI: 10.24138/jcomss-2021-0123
M. Al-Rayif
To overcome unpredictable spikes in the peak-toaverage power ratio (PAPR) in the presence of an orthogonal frequency-division multiplexing (OFDM) for multi-input-multioutput (MIMO) systems, implementation of a new SLM scheme is presented in this paper, which is extended from our previous study of IQ-SLM in SISO-OFDM system. In each transmit antenna, both real and imaginary parts of the base-band data symbol were modified independently using a corresponding phase element within a commonly generated phase vector, instead of modifying the complex data symbol as a single component. After applying an inverse fast Fourier transform (IFFT) for the real, imaginary, and original base-band vectors, the minimum PAPR component was observed. Therefore, the phase vector that introduced the minimal PAPR was considered to convert the original data block for transmission. This technique is called the In-phase/Quadrature-SLM (IQ-SLM) scheme. In this proposal, only U phase vectors were generated to treat all Nt data blocks, simultaneously, unlike the conventional MIMO-SLM techniques which generate UNt candidate phase blocks. The thing which, in turn, can be considered as a further computational complexity reduction, specifically in data-phase conversion stages. As a result, in terms of the complementary cumulative distribution function of PAPR performance(CCDF-PAPR), the proposal achieved a greater decibel reduction than conventional SLM methods such as dSLM, oSLM, and sSLM, at different subcarrier lengths N , candidate phase vectors U , transmit antennas Nt. Also, it shows a comparable BER performances over the dSLM scheme referencing to the theoretical curves, in the case where Nt ≤ Nr for both zero-forcing (ZF) and ZF with vertical Bell laboratories layered space-time (V-BLAST) detector. Keywords—Peak-to-average power ratio (PAPR), ZF-VBLAST, selective mapping (SLM), I/Q-SLM, complementary cumulative distribution function (CCDF), MIMO-OFDM.
{"title":"PAPR Reduction Method based on In-phase/Quadrature Data Symbol Components in MIMO-OFDM Systems","authors":"M. Al-Rayif","doi":"10.24138/jcomss-2021-0123","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0123","url":null,"abstract":"To overcome unpredictable spikes in the peak-toaverage power ratio (PAPR) in the presence of an orthogonal frequency-division multiplexing (OFDM) for multi-input-multioutput (MIMO) systems, implementation of a new SLM scheme is presented in this paper, which is extended from our previous study of IQ-SLM in SISO-OFDM system. In each transmit antenna, both real and imaginary parts of the base-band data symbol were modified independently using a corresponding phase element within a commonly generated phase vector, instead of modifying the complex data symbol as a single component. After applying an inverse fast Fourier transform (IFFT) for the real, imaginary, and original base-band vectors, the minimum PAPR component was observed. Therefore, the phase vector that introduced the minimal PAPR was considered to convert the original data block for transmission. This technique is called the In-phase/Quadrature-SLM (IQ-SLM) scheme. In this proposal, only U phase vectors were generated to treat all Nt data blocks, simultaneously, unlike the conventional MIMO-SLM techniques which generate UNt candidate phase blocks. The thing which, in turn, can be considered as a further computational complexity reduction, specifically in data-phase conversion stages. As a result, in terms of the complementary cumulative distribution function of PAPR performance(CCDF-PAPR), the proposal achieved a greater decibel reduction than conventional SLM methods such as dSLM, oSLM, and sSLM, at different subcarrier lengths N , candidate phase vectors U , transmit antennas Nt. Also, it shows a comparable BER performances over the dSLM scheme referencing to the theoretical curves, in the case where Nt ≤ Nr for both zero-forcing (ZF) and ZF with vertical Bell laboratories layered space-time (V-BLAST) detector. Keywords—Peak-to-average power ratio (PAPR), ZF-VBLAST, selective mapping (SLM), I/Q-SLM, complementary cumulative distribution function (CCDF), MIMO-OFDM.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098597","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 : 2021-01-01DOI: 10.24138/JCOMSS-2020-0013
Nikita Goel, Vrinda Gupta
—In this paper, we consider a drone as a relay in Co-operative Communication (CC) to improve the network performance in an upcoming wireless network. Drone Assisted CC (DA-CC) is more useful when the central coordinator (base station) gets disrupted. In such a scenario, the drone works as an aerial relay and provides CC diversity to the end-users. In this article, a Decode-and-Forward (DF) protocol is used as a relaying scheme at the drone, and the Maximal Ratio Combining (MRC) scheme is used at the end-users for combining the direct and relayed signal. Here, we assume Nakagami faded channel among Air-to-Ground (A2G) links and Rayleigh faded distribution between Ground-to-Ground (G2G) links. The performance of DA-CC is evaluated in a hybrid channel environment and compared based on drone height, rate, horizontal distance, and transmitted power with the existing Rayleigh and Nakagami faded distributions. The analytical expression of outage probability and the rate have been derived for analysis purposes, and Monte-Carlo simulations are used to verify the analytical results. This work can have security and surveillance applications to improve the network performance in the absence of a central base station.
{"title":"Outage and Rate Evaluation of Drone based Decode and Forward Cooperation for Hybrid Fading Channels","authors":"Nikita Goel, Vrinda Gupta","doi":"10.24138/JCOMSS-2020-0013","DOIUrl":"https://doi.org/10.24138/JCOMSS-2020-0013","url":null,"abstract":"—In this paper, we consider a drone as a relay in Co-operative Communication (CC) to improve the network performance in an upcoming wireless network. Drone Assisted CC (DA-CC) is more useful when the central coordinator (base station) gets disrupted. In such a scenario, the drone works as an aerial relay and provides CC diversity to the end-users. In this article, a Decode-and-Forward (DF) protocol is used as a relaying scheme at the drone, and the Maximal Ratio Combining (MRC) scheme is used at the end-users for combining the direct and relayed signal. Here, we assume Nakagami faded channel among Air-to-Ground (A2G) links and Rayleigh faded distribution between Ground-to-Ground (G2G) links. The performance of DA-CC is evaluated in a hybrid channel environment and compared based on drone height, rate, horizontal distance, and transmitted power with the existing Rayleigh and Nakagami faded distributions. The analytical expression of outage probability and the rate have been derived for analysis purposes, and Monte-Carlo simulations are used to verify the analytical results. This work can have security and surveillance applications to improve the network performance in the absence of a central base station.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098619","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 : 2021-01-01DOI: 10.24138/JCOMSS-2021-0072
S. Mathew, M. Alkhatib, M. Barachi
—Smart city analytics requires the harnessing and analysis of emotions and sentiments conveyed by images and video footage. In recent years, facial sentiment analysis attracted significant attention for different application areas, including marketing, gaming, political analytics, healthcare, and human computer interaction. Aiming at contributing to this area, we propose a deep learning model enabling the accurate emotion analysis of crowded scenes containing complete and partially occluded faces, with different angles, various distances from the camera, and varying resolutions. Our model consists of a sophisticated convolutional neural network (CNN) that is combined with pooling, densifying, flattening, and Softmax layers to achieve accurate sentiment and emotion analysis of facial images. The proposed model was successfully tested using 3,750 images containing 22,563 faces, collected from a large consumer electronics trade show. The model was able to correctly classify the test images which contained faces with different angles, distances, occlusion areas, facial orientation and resolutions. It achieved an average accuracy of 90.6% when distinguishing between seven emotions (Happiness, smiling, laughter, neutral, sadness, anger, and surprise) in complete faces, and 86.16% accuracy in partially occluded faces. Such model can be leveraged for the automatic analysis of attendees’ engagement level in events. Furthermore, it can open the door for many useful applications in smart cities, such as measuring employees’ satisfaction and citizens’ happiness.
{"title":"A Deep Learning Approach for Real-Time Analysis of Attendees’ Engagement in Public Events","authors":"S. Mathew, M. Alkhatib, M. Barachi","doi":"10.24138/JCOMSS-2021-0072","DOIUrl":"https://doi.org/10.24138/JCOMSS-2021-0072","url":null,"abstract":"—Smart city analytics requires the harnessing and analysis of emotions and sentiments conveyed by images and video footage. In recent years, facial sentiment analysis attracted significant attention for different application areas, including marketing, gaming, political analytics, healthcare, and human computer interaction. Aiming at contributing to this area, we propose a deep learning model enabling the accurate emotion analysis of crowded scenes containing complete and partially occluded faces, with different angles, various distances from the camera, and varying resolutions. Our model consists of a sophisticated convolutional neural network (CNN) that is combined with pooling, densifying, flattening, and Softmax layers to achieve accurate sentiment and emotion analysis of facial images. The proposed model was successfully tested using 3,750 images containing 22,563 faces, collected from a large consumer electronics trade show. The model was able to correctly classify the test images which contained faces with different angles, distances, occlusion areas, facial orientation and resolutions. It achieved an average accuracy of 90.6% when distinguishing between seven emotions (Happiness, smiling, laughter, neutral, sadness, anger, and surprise) in complete faces, and 86.16% accuracy in partially occluded faces. Such model can be leveraged for the automatic analysis of attendees’ engagement level in events. Furthermore, it can open the door for many useful applications in smart cities, such as measuring employees’ satisfaction and citizens’ happiness.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098492","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 : 2021-01-01DOI: 10.24138/JCOMSS-2020-0024
Tanissia Djemai, P. Stolf, T. Monteil, J. Pierson
—Mobility of Internet of Things (IoT) objects is a key characteristic of IoT environments. It brings dynamicity, uncertainty and raises many challenges when it is associated with computation and network resources management for IoT applications. The resources management problem under objects mobility consideration is even more sensitive if we consider that various IoT applications have stringent Quality of Service (QoS) needs. Fog Computing is a distributed computation paradigm that increases data centers computation and storage abilities with nodes between end-users and the Cloud. Fog computing offers a large distributed infrastructure to support IoT applications needs by bringing services closer to end users. However, Fog infrastructures inherit the energy greediness characteristics of both data centers and network infrastructures. This work investigates the IoT services placement problem in the Fog as an optimization problem to minimize energy consumption and enhance QoS while considering mobility of IoT objects. We model the placement problem as a multi-objective optimization problem and we propose a location history based mobility model (HTM) to estimate future locations of IoT mobile nodes. We propose a framework composed of online strategies for IoT services placement and a Mobility-aware Genetic Algorithm (MGA) for services migrations. We evaluate our strategies through iFogSim simulator and compare the proposed framework to migrations and placement strategies from the literature based on Shortest Access Point migration strategy (SAP) and with Penguins Search Optimization Algorithm (PeSOA). Experiments show that the proposed framework outperforms literature approaches for the considered objectives and for various configurations of the mobile environment.
{"title":"Investigating Mobility-aware Strategies for IoT Services Placement in the Fog under Energy and QoS Constraints","authors":"Tanissia Djemai, P. Stolf, T. Monteil, J. Pierson","doi":"10.24138/JCOMSS-2020-0024","DOIUrl":"https://doi.org/10.24138/JCOMSS-2020-0024","url":null,"abstract":"—Mobility of Internet of Things (IoT) objects is a key characteristic of IoT environments. It brings dynamicity, uncertainty and raises many challenges when it is associated with computation and network resources management for IoT applications. The resources management problem under objects mobility consideration is even more sensitive if we consider that various IoT applications have stringent Quality of Service (QoS) needs. Fog Computing is a distributed computation paradigm that increases data centers computation and storage abilities with nodes between end-users and the Cloud. Fog computing offers a large distributed infrastructure to support IoT applications needs by bringing services closer to end users. However, Fog infrastructures inherit the energy greediness characteristics of both data centers and network infrastructures. This work investigates the IoT services placement problem in the Fog as an optimization problem to minimize energy consumption and enhance QoS while considering mobility of IoT objects. We model the placement problem as a multi-objective optimization problem and we propose a location history based mobility model (HTM) to estimate future locations of IoT mobile nodes. We propose a framework composed of online strategies for IoT services placement and a Mobility-aware Genetic Algorithm (MGA) for services migrations. We evaluate our strategies through iFogSim simulator and compare the proposed framework to migrations and placement strategies from the literature based on Shortest Access Point migration strategy (SAP) and with Penguins Search Optimization Algorithm (PeSOA). Experiments show that the proposed framework outperforms literature approaches for the considered objectives and for various configurations of the mobile environment.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"17 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098683","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 : 2021-01-01DOI: 10.24138/JCOMSS-2021-0027
Bhushana Samyuel Neelam, Benjamin A. Shimray
Internet of things (IoT) is one of the leading technologies which spanned from the trivial consumer applications to time-critical industrial applications. The current research in IoT focuses mostly on network performance as it is experiencing bottlenecks in data communication. IoT communication preferred UDP due to the limitations of TCP hard-state handshaking procedures on throughput. Proposed work developed a prototype with IoT devices communicating on a new internet architecture i.e. recursive inter-networking architecture (RINA) which has eliminated hard-state handshaking procedures. The impact of RINA on the network performance in process control and data acquisition is observed in terms of latency variations, network jitter and throughput. The results were compared against the network performance when the proposed prototype was communicating on TCP/IP. A Comparative analysis was provided to identify the improved network performance in RINA. This prototype was implemented in closed network configurations like LAN and WLAN in RINA as well as TCP/IP.
{"title":"Observation of Enhanced Network Performance in IoT Process Control and Data Sensing with RINA","authors":"Bhushana Samyuel Neelam, Benjamin A. Shimray","doi":"10.24138/JCOMSS-2021-0027","DOIUrl":"https://doi.org/10.24138/JCOMSS-2021-0027","url":null,"abstract":"Internet of things (IoT) is one of the leading technologies which spanned from the trivial consumer applications to time-critical industrial applications. The current research in IoT focuses mostly on network performance as it is experiencing bottlenecks in data communication. IoT communication preferred UDP due to the limitations of TCP hard-state handshaking procedures on throughput. Proposed work developed a prototype with IoT devices communicating on a new internet architecture i.e. recursive inter-networking architecture (RINA) which has eliminated hard-state handshaking procedures. The impact of RINA on the network performance in process control and data acquisition is observed in terms of latency variations, network jitter and throughput. The results were compared against the network performance when the proposed prototype was communicating on TCP/IP. A Comparative analysis was provided to identify the improved network performance in RINA. This prototype was implemented in closed network configurations like LAN and WLAN in RINA as well as TCP/IP.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098754","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 : 2021-01-01DOI: 10.24138/jcomss-2021-0065
Abdelali El Boutahiri, K. Khadiri, A. Tahiri, H. Qjidaa
The external unit of small telemetry system for animals uses inductive link to transmit both data and power to a small implant. In this work, firstly, we have presented a wideband frequency shift keying (FSK) transmitter, which is a class E power amplifier (PA) switches between two load networks that make the PA tuned correctly at tow input clock frequencies. Carrier frequencies used for data modulation are 5MHz/10MHz, the data rate of the proposed link is 2.5 Mbps. On the other hand, the analog circuits of the internal unit are designed in this paper. Internal unit has a demodulator circuit to derive directly a frequency clock from the FSK carrier and to sample the binary data stream. It also has a low power generator circuit to generate the supply voltage to the other blocks. The low power generator is composed of a high efficiency, low power rectifier, and a low power voltage regulator. To minimize the quiescent current of the regulator, we propose a control section which is a two-stage error amplifier to control the gate voltage of the PMOS transistors used in the differential pair of the voltage regulator and thus stabilize the direct current (DC) level at its output signal (Vreg). The output voltage of the proposed generator circuit is regulated at 1V, the quiescent current simulated is about 9.9μA and the line regulation performance is only 8mV/V. All circuits proposed in this paper were designed and simulated using Cadence in 180 nm CMOS technology.
{"title":"A Design of Telemetry System for Small Animals","authors":"Abdelali El Boutahiri, K. Khadiri, A. Tahiri, H. Qjidaa","doi":"10.24138/jcomss-2021-0065","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0065","url":null,"abstract":"The external unit of small telemetry system for animals uses inductive link to transmit both data and power to a small implant. In this work, firstly, we have presented a wideband frequency shift keying (FSK) transmitter, which is a class E power amplifier (PA) switches between two load networks that make the PA tuned correctly at tow input clock frequencies. Carrier frequencies used for data modulation are 5MHz/10MHz, the data rate of the proposed link is 2.5 Mbps. On the other hand, the analog circuits of the internal unit are designed in this paper. Internal unit has a demodulator circuit to derive directly a frequency clock from the FSK carrier and to sample the binary data stream. It also has a low power generator circuit to generate the supply voltage to the other blocks. The low power generator is composed of a high efficiency, low power rectifier, and a low power voltage regulator. To minimize the quiescent current of the regulator, we propose a control section which is a two-stage error amplifier to control the gate voltage of the PMOS transistors used in the differential pair of the voltage regulator and thus stabilize the direct current (DC) level at its output signal (Vreg). The output voltage of the proposed generator circuit is regulated at 1V, the quiescent current simulated is about 9.9μA and the line regulation performance is only 8mV/V. All circuits proposed in this paper were designed and simulated using Cadence in 180 nm CMOS technology.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098433","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 : 2021-01-01DOI: 10.24138/jcomss-2021-0102
H. Yehoshyna, V. Romanuke
—In this paper, we suggest a novel recommender system where a set of appropriate propositions is formed by measuring how user query features are close to space of all possible propositions. The system is for e-traders selling commodities. A commodity has hierarchical-structure properties which are mapped to the respective numerical scales. The scales are normalized so that a query from a potential customer and any possible proposition from the e-trader is a multidimensional point of a nonnegative unit hypercube put on the coordinate origin. The user can weight levels. The distance between the query and propositions are measured by the respective metric in the Euclidean arithmetic space. The best proposition is defined by the shortest distance. Top N propositions are defined by N shortest distances. The system does not depend on any user experience, nor on the e-trader tendency to impose one’s preferences on the customer.
{"title":"Constraint-based Recommender System for Commodity Realization","authors":"H. Yehoshyna, V. Romanuke","doi":"10.24138/jcomss-2021-0102","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0102","url":null,"abstract":"—In this paper, we suggest a novel recommender system where a set of appropriate propositions is formed by measuring how user query features are close to space of all possible propositions. The system is for e-traders selling commodities. A commodity has hierarchical-structure properties which are mapped to the respective numerical scales. The scales are normalized so that a query from a potential customer and any possible proposition from the e-trader is a multidimensional point of a nonnegative unit hypercube put on the coordinate origin. The user can weight levels. The distance between the query and propositions are measured by the respective metric in the Euclidean arithmetic space. The best proposition is defined by the shortest distance. Top N propositions are defined by N shortest distances. The system does not depend on any user experience, nor on the e-trader tendency to impose one’s preferences on the customer.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098500","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 : 2021-01-01DOI: 10.24138/jcomss-2021-0046
V. Shynkarenko, Oleksandr K. Zhevaho
We present an approach of constructing a source code history for a modern code review. Practically, it is supposed to be used in programming training, especially within initial stages. The developed constructor uses constructive-synthesizing modeling tools to classify a source code history by fine-grained changes and to construct an event log file aimed to provide information on students’ coding process. Current research applies Process Mining techniques to the software engineering domain to identify software engineering skills. By better understanding of the way students design programs, we will help novices learn programming. This research provides an innovative method of using code and development process review in teaching programming skills and is aimed to encourage using code review and monitoring coding practice in educational purposes. The standard method of evaluation takes into consideration only a final result, which doesn’t meet modern requirements of teaching programming.
{"title":"Application of Constructive Modeling and Process Mining Approaches to the Study of Source Code Development in Software Engineering Courses","authors":"V. Shynkarenko, Oleksandr K. Zhevaho","doi":"10.24138/jcomss-2021-0046","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0046","url":null,"abstract":"We present an approach of constructing a source code history for a modern code review. Practically, it is supposed to be used in programming training, especially within initial stages. The developed constructor uses constructive-synthesizing modeling tools to classify a source code history by fine-grained changes and to construct an event log file aimed to provide information on students’ coding process. Current research applies Process Mining techniques to the software engineering domain to identify software engineering skills. By better understanding of the way students design programs, we will help novices learn programming. This research provides an innovative method of using code and development process review in teaching programming skills and is aimed to encourage using code review and monitoring coding practice in educational purposes. The standard method of evaluation takes into consideration only a final result, which doesn’t meet modern requirements of teaching programming.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098878","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 : 2021-01-01DOI: 10.24138/jcomss-2021-0133
Safa Belhaous, Soumia Chokri, Sohaib Baroud, Mohamed Mestari
Parallelization has become a universal technique for computing an intensive scientific simulation to shorten the execution time of complex problems. It consists of bringing together the power of several thousand processors to perform complex calculations at high speed. The choice of the runtime environment to execute parallel programs significantly influences the execution time. For this reason, this article aims to materialize the impact of computing architectures on the performance of parallel implementations. To better achieve this contribution, we have implemented the heat equation executed on CUDA platform and we have compared the results with those of SkelGIS implementation from the literature. Through the results of the experiments, we demonstrated that the execution time of the CUDA implementation on graphics processing unit (GPU) is almost 100X faster for very large meshes compared to the other implementations.
{"title":"Comparative Study of the Execution Time of Parallel Heat Equation on CPU and GPU","authors":"Safa Belhaous, Soumia Chokri, Sohaib Baroud, Mohamed Mestari","doi":"10.24138/jcomss-2021-0133","DOIUrl":"https://doi.org/10.24138/jcomss-2021-0133","url":null,"abstract":"Parallelization has become a universal technique for computing an intensive scientific simulation to shorten the execution time of complex problems. It consists of bringing together the power of several thousand processors to perform complex calculations at high speed. The choice of the runtime environment to execute parallel programs significantly influences the execution time. For this reason, this article aims to materialize the impact of computing architectures on the performance of parallel implementations. To better achieve this contribution, we have implemented the heat equation executed on CUDA platform and we have compared the results with those of SkelGIS implementation from the literature. Through the results of the experiments, we demonstrated that the execution time of the CUDA implementation on graphics processing unit (GPU) is almost 100X faster for very large meshes compared to the other implementations.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69098634","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
扫码关注我们
求助内容：
应助结果提醒方式：