Pub Date : 2014-06-15DOI: 10.1109/MECO.2014.6862691
R. Bazylevych, S. Byelyayev, L. Bazylevych, A. N. Kolesenkov, B. Kostrov, E. Ruchkina, V. Ruchkin
The article represents the approach suitable for the electronic circuit of the hierarchical clustering and division. The concept is complemented with the representation of fuzzy clustering. The suggested algorithms have the calculations complexity approximate to the linear, which allows to use them for the large-scale problems solution. This article is made under the grant RFBR No 1407-00261 — “Clasterization and organization of cloud and distributed computing systems on the neuroprocessor base”.
本文提出了一种适合于电子电路分层聚类和分层划分的方法。该概念补充了模糊聚类的表示。所提出的算法具有近似线性的计算复杂度，可以用于大规模问题的求解。本文是在RFBR No 1407-00261 -“基于神经处理器的云和分布式计算系统的集群化和组织”的资助下完成的。
{"title":"The analysis and optimization algorithms of the electronic circuits design","authors":"R. Bazylevych, S. Byelyayev, L. Bazylevych, A. N. Kolesenkov, B. Kostrov, E. Ruchkina, V. Ruchkin","doi":"10.1109/MECO.2014.6862691","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862691","url":null,"abstract":"The article represents the approach suitable for the electronic circuit of the hierarchical clustering and division. The concept is complemented with the representation of fuzzy clustering. The suggested algorithms have the calculations complexity approximate to the linear, which allows to use them for the large-scale problems solution. This article is made under the grant RFBR No 1407-00261 — “Clasterization and organization of cloud and distributed computing systems on the neuroprocessor base”.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129111017","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 : 2014-06-15DOI: 10.1109/MECO.2014.6862693
Mališa Vučinić, B. Tourancheau, F. Rousseau, A. Duda, Laurent Damon, R. Guizzetti
Wireless Sensor Networks (WSN) powered by energy harvesting from the environment represent a sustainable direction towards the future Internet of Things. In this paper, we evaluate the effect security features have on power consumption of such WSNs and revisit the previous conclusions regarding the energetic cost of security. We approach the problem of estimating the cost of security from a highly practical standpoint, and show that many real world, security agnostic factors affect the energy consumption of a device, but are often neglected by security researchers. Consequently, overpriced conclusions are often made that may affect decisions if security features should be by default enabled in real deployments. Our experimental results show that for practical applications and implementations security features introduce a negligible degradation that is often acceptable even for the most energy stringent systems, such as those based on energy harvesting.
{"title":"Energy cost of security in an energy-harvested IEEE 802.15.4 Wireless Sensor Network","authors":"Mališa Vučinić, B. Tourancheau, F. Rousseau, A. Duda, Laurent Damon, R. Guizzetti","doi":"10.1109/MECO.2014.6862693","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862693","url":null,"abstract":"Wireless Sensor Networks (WSN) powered by energy harvesting from the environment represent a sustainable direction towards the future Internet of Things. In this paper, we evaluate the effect security features have on power consumption of such WSNs and revisit the previous conclusions regarding the energetic cost of security. We approach the problem of estimating the cost of security from a highly practical standpoint, and show that many real world, security agnostic factors affect the energy consumption of a device, but are often neglected by security researchers. Consequently, overpriced conclusions are often made that may affect decisions if security features should be by default enabled in real deployments. Our experimental results show that for practical applications and implementations security features introduce a negligible degradation that is often acceptable even for the most energy stringent systems, such as those based on energy harvesting.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127740077","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 : 2014-06-15DOI: 10.1109/MECO.2014.6862674
A. Parshin, Y. Parshin
Article deals with synthesis and analysis of detector of fractal 2D signal in the presence of non-correlated Gaussian noise. Model of signal is 2D fractal Brownian motion (FBM), which describes many types of signal. Expressions for likelihood ratio given based on FBM models in spatial and spectral fields. This expressions are a sufficient statistics for many problems of signal processing. Detection performances of FBM signal are calculated by statistical simulating. Investigation results can be distributed on multicomponent FBM signal processing and FBM signal processing at the background of FBM interference.
{"title":"Optimal detection of 2D fractal object based on model of fractal Brownian surface","authors":"A. Parshin, Y. Parshin","doi":"10.1109/MECO.2014.6862674","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862674","url":null,"abstract":"Article deals with synthesis and analysis of detector of fractal 2D signal in the presence of non-correlated Gaussian noise. Model of signal is 2D fractal Brownian motion (FBM), which describes many types of signal. Expressions for likelihood ratio given based on FBM models in spatial and spectral fields. This expressions are a sufficient statistics for many problems of signal processing. Detection performances of FBM signal are calculated by statistical simulating. Investigation results can be distributed on multicomponent FBM signal processing and FBM signal processing at the background of FBM interference.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129610902","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 : 2014-06-15DOI: 10.1109/MECO.2014.6862658
M. Vigliar, L. Puglia, M. Fratello, G. Raiconi
In this paper new and significant improvements for a recently proposed hardware co-processor for Stereo Matching are introduced. Main focus is on small memory requirements while preserving the needed accuracy. Starting from a pair of stereo images, the co-processor computes the “disparity map” used to define corresponding points on the two images. The approach follows the well-known scheme for string alignment by Needleman & Wunsch, commonly used in bioinformatics. The architecture, highly modular, was designed by using Bluespec SystemVerilog development tool and is described in detail. Synthesis results for several FPGA platforms are shown. The actual circuit is an updated version of SASC design. Performance is benchmarked against the former implementation as well as against two reference software versions.
{"title":"SASCr2: Enhanced hardware string alignment coprocessor for stereo correspondence","authors":"M. Vigliar, L. Puglia, M. Fratello, G. Raiconi","doi":"10.1109/MECO.2014.6862658","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862658","url":null,"abstract":"In this paper new and significant improvements for a recently proposed hardware co-processor for Stereo Matching are introduced. Main focus is on small memory requirements while preserving the needed accuracy. Starting from a pair of stereo images, the co-processor computes the “disparity map” used to define corresponding points on the two images. The approach follows the well-known scheme for string alignment by Needleman & Wunsch, commonly used in bioinformatics. The architecture, highly modular, was designed by using Bluespec SystemVerilog development tool and is described in detail. Synthesis results for several FPGA platforms are shown. The actual circuit is an updated version of SASC design. Performance is benchmarked against the former implementation as well as against two reference software versions.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129425402","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 : 2014-06-15DOI: 10.1109/MECO.2014.6862659
A. Scionti, S. Kavvadias, R. Giorgi
Discovering the most appropriate reconfiguration instants for improving performance and lowering power consumption is not a trivial problem. In this paper we show the benefit in terms of performance gain and power reduction of the dynamic adaptation (e.g., cache size, clock frequency, and core issue-width) of an embedded platform, through a design space exploration campaign, and focusing on a relevant case study. To this end, we analyze a set of benchmarks belonging to the embedded application domain with the aim of illustrating how the appropriate selection of reconfiguration instants can positively influence system performance and power consumption. Experimental results using the cjpeg benchmark show that power consumption can be reduced by an average of 22%. Our methodology can be used to create a set of run-time management policies for driving the adaptation process.
{"title":"Dynamic power reduction in self-adaptive embedded systems through benchmark analysis","authors":"A. Scionti, S. Kavvadias, R. Giorgi","doi":"10.1109/MECO.2014.6862659","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862659","url":null,"abstract":"Discovering the most appropriate reconfiguration instants for improving performance and lowering power consumption is not a trivial problem. In this paper we show the benefit in terms of performance gain and power reduction of the dynamic adaptation (e.g., cache size, clock frequency, and core issue-width) of an embedded platform, through a design space exploration campaign, and focusing on a relevant case study. To this end, we analyze a set of benchmarks belonging to the embedded application domain with the aim of illustrating how the appropriate selection of reconfiguration instants can positively influence system performance and power consumption. Experimental results using the cjpeg benchmark show that power consumption can be reduced by an average of 22%. Our methodology can be used to create a set of run-time management policies for driving the adaptation process.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129271206","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 : 2014-06-15DOI: 10.1109/MECO.2014.6862711
S. Tomovic, P. Stanisic
Frequent itemset mining has been a focused theme in data mining research for years. It was first proposed for market basket analysis in the form of association rule mining. Since the first proposal of this new data mining task and its associated efficient mining algorithms, there have been hundreds of followup research publications. In this paper we further develop the ideas presented in [1]. In [1] we consider two problems from linear algebra, namely set intersection problem and scalar product problem and make comparisons to the frequent itemset mining task. In this paper we formulate and prove new theorems that estimate the number of candidate itemsets that can be generated in the level-wise mining approach.
{"title":"Upper bounds on the number of candidate itemsets in Apriori like algorithms","authors":"S. Tomovic, P. Stanisic","doi":"10.1109/MECO.2014.6862711","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862711","url":null,"abstract":"Frequent itemset mining has been a focused theme in data mining research for years. It was first proposed for market basket analysis in the form of association rule mining. Since the first proposal of this new data mining task and its associated efficient mining algorithms, there have been hundreds of followup research publications. In this paper we further develop the ideas presented in [1]. In [1] we consider two problems from linear algebra, namely set intersection problem and scalar product problem and make comparisons to the frequent itemset mining task. In this paper we formulate and prove new theorems that estimate the number of candidate itemsets that can be generated in the level-wise mining approach.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124289828","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 : 2014-06-15DOI: 10.1109/MECO.2014.6862730
S. Milinkovic
This paper discusses the implementation of a pure software-based, low cost embedded speech recognition system. The applied algorithms are memory efficient, scalable and provide sufficient accuracy of recognition. Advantages of such a system include rapid prototyping, flexibility in design modifications, and being a library, ease of integration with other applications.
{"title":"Pure software-based speech recognition for OS-less embedded systems","authors":"S. Milinkovic","doi":"10.1109/MECO.2014.6862730","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862730","url":null,"abstract":"This paper discusses the implementation of a pure software-based, low cost embedded speech recognition system. The applied algorithms are memory efficient, scalable and provide sufficient accuracy of recognition. Advantages of such a system include rapid prototyping, flexibility in design modifications, and being a library, ease of integration with other applications.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116679194","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 : 2014-06-15DOI: 10.1109/MECO.2014.6862694
G. Horvat, D. Zagar, D. Vinko
Quality of Service (QoS) support in large-scale Wireless Sensor Networks (WSNs) is becoming a hot topic in WSN area of research, primarily due to the fact that very complex problems need to be solved using resource constrained WSN nodes. On the other hand, with the large number of nodes in a network, a collective intelligence approach comes into focus for solving various issues. However, as node density and number increases various related problems comes into focus, such as increased RF interference on physical layer, large number of hops in data routing and the overall coverage area issue. All of these parameters are the result of WSN node deployment strategy and their influence on QoS cannot be neglected. To analyze this problem the paper simulated the behavior of large-scale WSN (up to 1000 nodes using OMNeT++) randomly deployed over an area of interest, based on deployment parameters (coverage area, number of nodes and TX power) and in respect to QoS metrics. From simulation results it can be concluded that deployment parameters substantially affects the QoS that a network can support. By choosing optimal deployment parameters it is possible to maximize QoS in a network.
{"title":"Influence of node deployment parameters on QoS in large-scale WSN","authors":"G. Horvat, D. Zagar, D. Vinko","doi":"10.1109/MECO.2014.6862694","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862694","url":null,"abstract":"Quality of Service (QoS) support in large-scale Wireless Sensor Networks (WSNs) is becoming a hot topic in WSN area of research, primarily due to the fact that very complex problems need to be solved using resource constrained WSN nodes. On the other hand, with the large number of nodes in a network, a collective intelligence approach comes into focus for solving various issues. However, as node density and number increases various related problems comes into focus, such as increased RF interference on physical layer, large number of hops in data routing and the overall coverage area issue. All of these parameters are the result of WSN node deployment strategy and their influence on QoS cannot be neglected. To analyze this problem the paper simulated the behavior of large-scale WSN (up to 1000 nodes using OMNeT++) randomly deployed over an area of interest, based on deployment parameters (coverage area, number of nodes and TX power) and in respect to QoS metrics. From simulation results it can be concluded that deployment parameters substantially affects the QoS that a network can support. By choosing optimal deployment parameters it is possible to maximize QoS in a network.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123259676","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 : 2014-06-15DOI: 10.1109/MECO.2014.6862690
Hossein Rasekh, Mohsen Sadeghi, A. Golmakani, Maaruf Ali
The predominant concern for SRAM cell designers is stability for nano-scaled technology due to the reduction in power supply voltages. We propose two novel SRAM cells, based on the Schmitt Trigger at 65 nm feature size in CMOS. This achieves 4–5.35 times higher read static noise margin (VDD = 350 mV) compared to the conventional 6T cell design. It also provides the much desired greater enhancement in stability compared with three other reported SRAM cell designs.
{"title":"Design of stable SRAM cells based on Schmitt Trigger","authors":"Hossein Rasekh, Mohsen Sadeghi, A. Golmakani, Maaruf Ali","doi":"10.1109/MECO.2014.6862690","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862690","url":null,"abstract":"The predominant concern for SRAM cell designers is stability for nano-scaled technology due to the reduction in power supply voltages. We propose two novel SRAM cells, based on the Schmitt Trigger at 65 nm feature size in CMOS. This achieves 4–5.35 times higher read static noise margin (VDD = 350 mV) compared to the conventional 6T cell design. It also provides the much desired greater enhancement in stability compared with three other reported SRAM cell designs.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125292829","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 : 2014-06-15DOI: 10.1109/MECO.2014.6862713
S. Panov, S. Koceski
This paper introduces a metaheuristic approach to the problem of OCR of Old Slavic letters. This approach consists of several sequential stages: filtering, binarization, skeletonization, feature extraction and decision tree classification. The image preprocessing steps proved to provide improvements to the correctness of the letter classification, since the quality of the filtered image influences the feature extraction phase, which is based on the unique characteristics of the Old Slavic letters. Various verifications of this approach were performed and the correctness of this approach has been proven.
{"title":"Metaheuristic approach to optical character recognition of Old Slavic letters","authors":"S. Panov, S. Koceski","doi":"10.1109/MECO.2014.6862713","DOIUrl":"https://doi.org/10.1109/MECO.2014.6862713","url":null,"abstract":"This paper introduces a metaheuristic approach to the problem of OCR of Old Slavic letters. This approach consists of several sequential stages: filtering, binarization, skeletonization, feature extraction and decision tree classification. The image preprocessing steps proved to provide improvements to the correctness of the letter classification, since the quality of the filtered image influences the feature extraction phase, which is based on the unique characteristics of the Old Slavic letters. Various verifications of this approach were performed and the correctness of this approach has been proven.","PeriodicalId":416168,"journal":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129060800","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
扫码关注我们
求助内容：
应助结果提醒方式：