Pub Date : 2013-10-31DOI: 10.1109/ICCCCM.2013.6648903
A. Shrivastava, S. Akashe
Design of complex arithmetic logic circuits considering leakage current, active power and delay is an important and challenging task in deep submicron circuits. Double gate transistor circuit consider as a promising candidate for low power application domain as well as used in Radio Frequency (RF) devices. In this paper we designed full adder with the help of double gate transistor, the used parameters value has been varied significantly thus improving the performance of full adder. Power Gating is one of the most used circuit techniques to reduce the leakage current in idle circuit. In this paper different parameters are analysed on Power Gating Technique. Power Gating technique achieves 93% reduction of leakage current, active power is reduced by 60% and delay is reduced by 14% as compared with conventional double gate full adder. Simulation results of double gate full adder have been performed on cadence virtuoso with 45nm technology.
{"title":"Design high performance and low power 10T full adder cell using double gate MOSFET at 45nm technology","authors":"A. Shrivastava, S. Akashe","doi":"10.1109/ICCCCM.2013.6648903","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648903","url":null,"abstract":"Design of complex arithmetic logic circuits considering leakage current, active power and delay is an important and challenging task in deep submicron circuits. Double gate transistor circuit consider as a promising candidate for low power application domain as well as used in Radio Frequency (RF) devices. In this paper we designed full adder with the help of double gate transistor, the used parameters value has been varied significantly thus improving the performance of full adder. Power Gating is one of the most used circuit techniques to reduce the leakage current in idle circuit. In this paper different parameters are analysed on Power Gating Technique. Power Gating technique achieves 93% reduction of leakage current, active power is reduced by 60% and delay is reduced by 14% as compared with conventional double gate full adder. Simulation results of double gate full adder have been performed on cadence virtuoso with 45nm technology.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114880227","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-31DOI: 10.1109/ICCCCM.2013.6648912
Yash Bharadwaj, S. Chakraverty
Symmetric encryption is widely used to enforce data security and provide other cryptographic primitives. Despite significant research that has led to the development of sophisticated symmetric encryption algorithms, very little has been done to develop systematic frameworks that can support the creation of adaptable, application-specific encryption techniques with varying levels of security. In this paper, we tackle this challenge by proposing a new Circular Design Pattern (CDP) which serves as a template for generating Dynamic Symmetric Encryption Frameworks (DSEF). The layout of a DSEF remains the same but the underlying algorithms may vary during run time. We illustrate how the proposed CDP can be used to create new DSEF from the set of existing algorithms. We propose a modified version of conventional cryptosystem model to deploy the DSEF. We analyze the enhanced security level of any new symmetric encryption algorithm generated by the CDP. We also present a comparison of the proposed CDP with some existing design patterns that may be used for creating DSEF.
{"title":"A design pattern for symmetric encryption","authors":"Yash Bharadwaj, S. Chakraverty","doi":"10.1109/ICCCCM.2013.6648912","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648912","url":null,"abstract":"Symmetric encryption is widely used to enforce data security and provide other cryptographic primitives. Despite significant research that has led to the development of sophisticated symmetric encryption algorithms, very little has been done to develop systematic frameworks that can support the creation of adaptable, application-specific encryption techniques with varying levels of security. In this paper, we tackle this challenge by proposing a new Circular Design Pattern (CDP) which serves as a template for generating Dynamic Symmetric Encryption Frameworks (DSEF). The layout of a DSEF remains the same but the underlying algorithms may vary during run time. We illustrate how the proposed CDP can be used to create new DSEF from the set of existing algorithms. We propose a modified version of conventional cryptosystem model to deploy the DSEF. We analyze the enhanced security level of any new symmetric encryption algorithm generated by the CDP. We also present a comparison of the proposed CDP with some existing design patterns that may be used for creating DSEF.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128584573","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-31DOI: 10.1109/ICCCCM.2013.6648916
Prateek Jain, S. Akashe
A speculative configuration of MOS transistors with a threshold rejection technique is modified. The design configuration is analyzed logic in aspect cum internal threshold abolition (ITA) and discloses circuit imminent and recital confines. Consequent circuit equations exemplify the exchange between the voltage drop and the reverse leakage. Moreover, a circuit development process for the improvement of the power transmission efficiency (PTE) of a 4×1 MUX with ITA MOS configuration was modified based on the design. A 4×1 MUX was optimized and employed in a digital system 45-nm CMOS technology, and Cadence simulation experimental implementation results of the leakage power and PCE illustrate superior conformity through the proposed configuration.
{"title":"Analyze the ATMOS configuration with VTH abolition logic in 4×1 MUX","authors":"Prateek Jain, S. Akashe","doi":"10.1109/ICCCCM.2013.6648916","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648916","url":null,"abstract":"A speculative configuration of MOS transistors with a threshold rejection technique is modified. The design configuration is analyzed logic in aspect cum internal threshold abolition (ITA) and discloses circuit imminent and recital confines. Consequent circuit equations exemplify the exchange between the voltage drop and the reverse leakage. Moreover, a circuit development process for the improvement of the power transmission efficiency (PTE) of a 4×1 MUX with ITA MOS configuration was modified based on the design. A 4×1 MUX was optimized and employed in a digital system 45-nm CMOS technology, and Cadence simulation experimental implementation results of the leakage power and PCE illustrate superior conformity through the proposed configuration.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126133002","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-31DOI: 10.1109/ICCCCM.2013.6648908
Himajit Aithal, S. Janardhanan
This paper presents a robust control method for trajectory tracking of a two wheeled mobile robot. A second order sliding mode control methodology is used to ensure continuity in the torque inputs, in addition to disturbance rejection. The results are validated through two simulations.
{"title":"Trajectory tracking of two wheeled mobile robot using higher order sliding mode control","authors":"Himajit Aithal, S. Janardhanan","doi":"10.1109/ICCCCM.2013.6648908","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648908","url":null,"abstract":"This paper presents a robust control method for trajectory tracking of a two wheeled mobile robot. A second order sliding mode control methodology is used to ensure continuity in the torque inputs, in addition to disturbance rejection. The results are validated through two simulations.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124248972","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-31DOI: 10.1109/ICCCCM.2013.6648913
Versha Verma, D. Kaur, Ravindra Kumar Singh, A. Kaur
3D-Playfair cipher is multiple letter encryption cipher. In this, trigraphs of plaintext are treated as single units and converted into corresponding cipher text trigraphs. 3D-Playfair Ciphers originates due to the limitations in classical Playfair as it supports only alphabets and may not support two alphabets at the same time. It also eliminates the fact that a diagram and its reverse will encrypt in a similar fashion. 3D-Playfair cipher supports all 26 alphabets, 10 digits and 28 special characters. The theme of research is to furnish security to data which contains alphabets numerals and special characters during transmission that's why additional bitwise operations are introduced and applied on the cipher text of 3D-Playfair cipher with a random key. Linear Feedback Shift Register is a good candidate for generation of random sequences and is selected for generating random keys for bitwise operations to offer better security to cipher text before transmission over the internet. Here X-OR or X-NOR operations are taken into consideration for the bitwise operations based on the key.
{"title":"3D - Playfair cipher with additional bitwise operation","authors":"Versha Verma, D. Kaur, Ravindra Kumar Singh, A. Kaur","doi":"10.1109/ICCCCM.2013.6648913","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648913","url":null,"abstract":"3D-Playfair cipher is multiple letter encryption cipher. In this, trigraphs of plaintext are treated as single units and converted into corresponding cipher text trigraphs. 3D-Playfair Ciphers originates due to the limitations in classical Playfair as it supports only alphabets and may not support two alphabets at the same time. It also eliminates the fact that a diagram and its reverse will encrypt in a similar fashion. 3D-Playfair cipher supports all 26 alphabets, 10 digits and 28 special characters. The theme of research is to furnish security to data which contains alphabets numerals and special characters during transmission that's why additional bitwise operations are introduced and applied on the cipher text of 3D-Playfair cipher with a random key. Linear Feedback Shift Register is a good candidate for generation of random sequences and is selected for generating random keys for bitwise operations to offer better security to cipher text before transmission over the internet. Here X-OR or X-NOR operations are taken into consideration for the bitwise operations based on the key.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123842822","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-31DOI: 10.1109/ICCCCM.2013.6648910
Divya Bartaria, Surabhi Sinha, P. Chandra, V. Krishna
Metallic complexes of multimetal and multiligand systems are complicated for calculating equilibrium concentrations in solution. Complexation equilibria have been deduced on the basis of speciation curves obtained through SCGOS computer program. The formation constants of ternary(1:1:1) quaternary(1:1:1:1) complexes of CuII, PbII, HgII, CdII, ZnII, CoII and NiII with Glutamic acid(A) and Uracil(B) as ligands have been determined potentiometrically in aqueous medium.Study of metal complexes of said ligands with respect to their stability, solution structure and quantitative aspects has been done. Acid dissociation constants of the ligands used and the formation constants of the ternary and quaternary complexes were determined at 37±1°C and in ionic strength I = 0.1 M NaNO3. Different concentration of species as a function of pH was examined and sequence of overall stability constants for MA, MB, MAB and M1M2AB type of complexes have been discussed which seem to follow Irving William order.
多金属和多配体体系的金属配合物在溶液中的平衡浓度计算比较复杂。根据SCGOS计算机程序得到的物种形成曲线，推导出络合平衡。用电位法测定了以谷氨酸(A)和尿嘧啶(B)为配体的CuII、PbII、HgII、CdII、ZnII、CoII和NiII三元(1:1:1:1)四元(1:1:1)配合物的形成常数。对上述配体的金属配合物的稳定性、溶液结构和定量等方面进行了研究。在37±1°C和离子强度I = 0.1 M NaNO3条件下，测定了所用配体的酸解离常数以及三元和四元配合物的形成常数。考察了不同物质浓度对pH值的影响，并讨论了MA、MB、MAB和M1M2AB型配合物的总体稳定常数的顺序，它们似乎遵循欧文威廉顺序。
{"title":"Computation of multimetalmultiligand complex formation equilibria in aqueous medium involving glutamic acid as primary ligand and Uracil as secondary ligand","authors":"Divya Bartaria, Surabhi Sinha, P. Chandra, V. Krishna","doi":"10.1109/ICCCCM.2013.6648910","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648910","url":null,"abstract":"Metallic complexes of multimetal and multiligand systems are complicated for calculating equilibrium concentrations in solution. Complexation equilibria have been deduced on the basis of speciation curves obtained through SCGOS computer program. The formation constants of ternary(1:1:1) quaternary(1:1:1:1) complexes of CuII, PbII, HgII, CdII, ZnII, CoII and NiII with Glutamic acid(A) and Uracil(B) as ligands have been determined potentiometrically in aqueous medium.Study of metal complexes of said ligands with respect to their stability, solution structure and quantitative aspects has been done. Acid dissociation constants of the ligands used and the formation constants of the ternary and quaternary complexes were determined at 37±1°C and in ionic strength I = 0.1 M NaNO3. Different concentration of species as a function of pH was examined and sequence of overall stability constants for MA, MB, MAB and M1M2AB type of complexes have been discussed which seem to follow Irving William order.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121361073","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-31DOI: 10.1109/ICCCCM.2013.6648920
Kanika Sharma, Naresh Kumar
Web applications are increasingly used to provide e-services such as online banking, online shopping, and social networking over the internet. With this advancement, the attacks over the web applications have also increased. According to Cenzic 2013 report 99% of web applications are vulnerable tested in 2012 [1]. The root causes behind these vulnerabilities are lack of security awareness, design flaws & implementation bugs. Writing secure code for web application is a complex task as developer emphasis more on implementation of business logic for web application rather than implementing it with secure logic. These vulnerabilities might be exploited by malicious users which can harm the database & reputation of an organization. In this paper we have proposed an Application Intrusion Detection System tool which can detect & prevent web application attacks at the time of occurrence. We have implemented proposed approach with ASP.NET web application and also perform Chi Square test to validate our assumptions. Once completed SWART has future potential to detect and prevent maximum attacks with less complexity.
Web应用程序越来越多地用于通过internet提供电子服务，如在线银行、在线购物和社交网络。随着这一进步，针对web应用程序的攻击也有所增加。根据Cenzic 2013年的报告，99%的web应用程序在2012年的测试中存在漏洞[1]。这些漏洞背后的根本原因是缺乏安全意识、设计缺陷和实现错误。为web应用程序编写安全代码是一项复杂的任务，因为开发人员更多地关注web应用程序的业务逻辑实现，而不是使用安全逻辑实现。这些漏洞可能被恶意用户利用，从而损害组织的数据库和声誉。本文提出了一种应用程序入侵检测系统工具，可以在web应用程序攻击发生时进行检测和预防。我们已经用ASP实现了建议的方法。. NET web应用程序，并执行卡方检验来验证我们的假设。一旦完成，SWART在未来有可能以更低的复杂性检测和防止最大的攻击。
{"title":"SWART: Secure Web Application Response Tool","authors":"Kanika Sharma, Naresh Kumar","doi":"10.1109/ICCCCM.2013.6648920","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648920","url":null,"abstract":"Web applications are increasingly used to provide e-services such as online banking, online shopping, and social networking over the internet. With this advancement, the attacks over the web applications have also increased. According to Cenzic 2013 report 99% of web applications are vulnerable tested in 2012 [1]. The root causes behind these vulnerabilities are lack of security awareness, design flaws & implementation bugs. Writing secure code for web application is a complex task as developer emphasis more on implementation of business logic for web application rather than implementing it with secure logic. These vulnerabilities might be exploited by malicious users which can harm the database & reputation of an organization. In this paper we have proposed an Application Intrusion Detection System tool which can detect & prevent web application attacks at the time of occurrence. We have implemented proposed approach with ASP.NET web application and also perform Chi Square test to validate our assumptions. Once completed SWART has future potential to detect and prevent maximum attacks with less complexity.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126422765","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-31DOI: 10.1109/ICCCCM.2013.6648922
Swati Tevatia, R. Prasad, D. Rai
Finding a pattern P[0...m-1] in a large body of text T[0...n-1], m≤n, is called pattern matching. One of its variation is parameterized string matching. Two strings are said to parameterized match, if one can be transformed into other via some bijective mapping. The parameterized matching has important applications in software maintenance and plagiarism detection. In this paper, we propose a new algorithm for multi-pattern parameterized string matching problem. This is an extension of quick multiple matching algorithm for exact string matching. Experimental results show that the new algorithm is very fast in practice.
{"title":"An offensive algorithm for multi-pattern parameterized string matching","authors":"Swati Tevatia, R. Prasad, D. Rai","doi":"10.1109/ICCCCM.2013.6648922","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648922","url":null,"abstract":"Finding a pattern P[0...m-1] in a large body of text T[0...n-1], m≤n, is called pattern matching. One of its variation is parameterized string matching. Two strings are said to parameterized match, if one can be transformed into other via some bijective mapping. The parameterized matching has important applications in software maintenance and plagiarism detection. In this paper, we propose a new algorithm for multi-pattern parameterized string matching problem. This is an extension of quick multiple matching algorithm for exact string matching. Experimental results show that the new algorithm is very fast in practice.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123418943","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-31DOI: 10.1109/ICCCCM.2013.6648907
Manjusha Bhave, S. Janardhanan, L. Dewan
Robotic manipulators are widely used in space applications. It is a very tough task to handle actuator failure. Purposely, the system could also be designed to be underactuated to lower the weight and power consumption and make it cost effective. Higher order sliding mode control could prove to be a good control philosophy for controlling such underactuated systems. In the present work a strategy of choosing sliding function for tracking control of end effector in underactuated manipulator has been demonstrated by designing the third order sliding mode control and finite time convergence to sliding surface has also been achieved.
{"title":"A robust third order sliding mode control of rigid underactuated robotic manipulator","authors":"Manjusha Bhave, S. Janardhanan, L. Dewan","doi":"10.1109/ICCCCM.2013.6648907","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648907","url":null,"abstract":"Robotic manipulators are widely used in space applications. It is a very tough task to handle actuator failure. Purposely, the system could also be designed to be underactuated to lower the weight and power consumption and make it cost effective. Higher order sliding mode control could prove to be a good control philosophy for controlling such underactuated systems. In the present work a strategy of choosing sliding function for tracking control of end effector in underactuated manipulator has been demonstrated by designing the third order sliding mode control and finite time convergence to sliding surface has also been achieved.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134258213","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-31DOI: 10.1109/ICCCCM.2013.6648906
N. Satyanarayana, S. Janardhanan
In this paper, we propose a new method of minimum-variance functional filtering for a class of sampled-data systems. The proposed method is based on multirate sampling of the plant output. This work includes the formulation of multirate output model for continuous-time system having noise in plant dynamics and measurement and necessary and sufficient conditions are given for existence of functional with minimal number of output samples. Numerical example is given to illustrate the procedure and its merits.
{"title":"Minimum variance functional filtering for multirate sampled systems","authors":"N. Satyanarayana, S. Janardhanan","doi":"10.1109/ICCCCM.2013.6648906","DOIUrl":"https://doi.org/10.1109/ICCCCM.2013.6648906","url":null,"abstract":"In this paper, we propose a new method of minimum-variance functional filtering for a class of sampled-data systems. The proposed method is based on multirate sampling of the plant output. This work includes the formulation of multirate output model for continuous-time system having noise in plant dynamics and measurement and necessary and sufficient conditions are given for existence of functional with minimal number of output samples. Numerical example is given to illustrate the procedure and its merits.","PeriodicalId":230396,"journal":{"name":"2013 International Conference on Control, Computing, Communication and Materials (ICCCCM)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125230090","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
扫码关注我们
求助内容：
应助结果提醒方式：