J. Comput. Sci. Technol.最新文献

筛选
英文 中文
Effective Smoke Detection Using Spatial-Temporal Energy and Weber Local Descriptors in Three Orthogonal Planes (WLD-TOP) 基于时空能量和三正交平面韦伯局部描述子的有效烟雾探测
J. Comput. Sci. Technol. Pub Date : 2018-04-25 DOI: 10.24215/16666038.18.E05
John Adedapo Ojo, Jamiu Alabi Oladosu
{"title":"Effective Smoke Detection Using Spatial-Temporal Energy and Weber Local Descriptors in Three Orthogonal Planes (WLD-TOP)","authors":"John Adedapo Ojo, Jamiu Alabi Oladosu","doi":"10.24215/16666038.18.E05","DOIUrl":"https://doi.org/10.24215/16666038.18.E05","url":null,"abstract":"Video-based fire detection (VFD) technologies have received significant attention from both academic and industrial communities recently. However, existing VFD approaches are still susceptible to false alarms due to changes in illumination, camera noise, variability of shape, motion, colour, irregular patterns of smoke and flames, modelling and training inaccuracies. Hence, this work aimed at developing a VSD system that will have a high detection rate, low false-alarm rate and short response time. Moving blocks in video frames were segmented and analysed in HSI colour space, and wavelet energy analysis of the smoke candidate blocks was performed. In addition, Dynamic texture descriptors were obtained using Weber Local Descriptor in Three Orthogonal Planes (WLD-TOP). These features were combined and used as inputs to Support Vector Classifier with radial based kernel function, while post-processing stage employs temporal image filtering to reduce false alarm. The algorithm was implemented in MATLAB 8.1.0.604 (R2013a). Accuracy of 99.30%, detection rate of 99.28% and false alarm rate of 0.65% were obtained when tested with some online videos. The output of this work would find applications in early fire detection systems and other applications such as robot vision and automated inspection.","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131377437","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}
引用次数: 2
Design and Implementation of a Computer Vision System for an Autonomous Chess-Playing Robot 自主下棋机器人计算机视觉系统的设计与实现
J. Comput. Sci. Technol. Pub Date : 2018-04-25 DOI: 10.24215/16666038.18.E01
G. Larregay, F. Pinna, L. Avila, Daniel Moran
{"title":"Design and Implementation of a Computer Vision System for an Autonomous Chess-Playing Robot","authors":"G. Larregay, F. Pinna, L. Avila, Daniel Moran","doi":"10.24215/16666038.18.E01","DOIUrl":"https://doi.org/10.24215/16666038.18.E01","url":null,"abstract":"This work describes a mechatronic system composed by a robot arm that can play chess autonomously. The system is based on an industrial-grade robot manipulator, a computer vision system, and an open source chess engine. Classification algorithms were implemented in order to detect whether a given chessboard square is occupied, and in that case, if the piece is black or white. Such algorithms were compared in terms of their complexity of implementation, execution time and accuracy of predictions. To achieve an uniform illumination of the chessboard, a theoretical model of an LED illuminance curve was used to find the best orientation for each diode using a genetic algorithm. Both the support base for the LEDs and the chess pieces were made using a 3D printer. This implementation demonstrates the capabilities of the proposed vision-based system, whose complexity can be increased in the future for a number of applications.","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130382477","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}
引用次数: 4
All Near Neighbor GraphWithout Searching 不需要搜索的所有近邻图
J. Comput. Sci. Technol. Pub Date : 2018-04-25 DOI: 10.24215/16666038.18.E07
Edgar Chávez, Verónica Ludueña, Nora Reyes, Fernando Kasián
{"title":"All Near Neighbor GraphWithout Searching","authors":"Edgar Chávez, Verónica Ludueña, Nora Reyes, Fernando Kasián","doi":"10.24215/16666038.18.E07","DOIUrl":"https://doi.org/10.24215/16666038.18.E07","url":null,"abstract":"Given a collection ofnobjects equipped with a dis-tance functiond(·,·), the Nearest Neighbor Graph(NNG) consists in finding the nearest neighbor ofeach object in the collection. Without an index thetotal cost of NNG is quadratic. Using an index thecost would be sub-quadratic if the search for indi-vidual items is sublinear. Unfortunately, due to theso calledcurse of dimensionalitythe indexed and thebrute force methods are almost equally inefficient. Inthis paper we present an efficient algorithm to buildthe Near Neighbor Graph (nNG), that is an approx-imation of NNG, using only the index construction,without actually searching for objects.","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115877709","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}
引用次数: 2
Algorithm of Myoelectric Signals Processing for the Control of Prosthetic Robotic Hands 假肢机械手控制中的肌电信号处理算法
J. Comput. Sci. Technol. Pub Date : 2018-04-25 DOI: 10.24215/16666038.18.E04
Rodrigo E. Russo, J. Fernandez, R. Rivera
{"title":"Algorithm of Myoelectric Signals Processing for the Control of Prosthetic Robotic Hands","authors":"Rodrigo E. Russo, J. Fernandez, R. Rivera","doi":"10.24215/16666038.18.E04","DOIUrl":"https://doi.org/10.24215/16666038.18.E04","url":null,"abstract":"The development of robotic hand prosthetic aims to give back people with disabilities, the ability to recover the functionality needed to manipulate the objects of their daily environment. The electrical signals sent by the brain through the nervous system are associated with the type of movement that the limbs must execute. Myoelectric sensors are non-intrusive devices that allow the capture of electrical signals from the peripheral nervous system. The relationship between the signals originated in the brain tending to generate an action and the myoelectric ones as a result of them, are weakly correlated. For this reason, it is necessary to study their interaction in order to develop the algorithms that allow recognizing orders and transform them into commands that activate the corresponding movements of the prosthesis.The present work shows the development of a prosthesis based on the design of an artificial hand Open Bionics to produce the movements, the MyoWare Muscle sensor for the capture of myoelectric signals (EMG) and the algorithm that allows to identify orders associated with three types of movement. Arduino Nano module performs the acquisition and control processes to meet the size and consumption requirements of this application.","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134238583","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}
引用次数: 11
Family of Evaluation Strategies: A Practical Case for Comparing and Adopting Strengths 评价策略族:优势比较与采用的实践案例
J. Comput. Sci. Technol. Pub Date : 2018-04-25 DOI: 10.24215/16666038.18.E06
Guido Tebes, Denis Peppino, Pablo Becker, Fernanda Papa, Belen Rivera, L. Olsina
{"title":"Family of Evaluation Strategies: A Practical Case for Comparing and Adopting Strengths","authors":"Guido Tebes, Denis Peppino, Pablo Becker, Fernanda Papa, Belen Rivera, L. Olsina","doi":"10.24215/16666038.18.E06","DOIUrl":"https://doi.org/10.24215/16666038.18.E06","url":null,"abstract":"Companies commonly establish and pursue business goals. A goal states a purpose. In the Software Engineering literature, different evaluation purposes such as to understand, monitor, improve, control, compare and select are mentioned. Considering that these purposes share distinctive and common aspects, in the present work, we include a categorization that helps a better understanding of them. On the other hand, to reach the purpose of a goal, a suitable strategy should be chosen. A strategy describes a particular course of action by means of process and method specifications. We have envisioned different strategies for different evaluation goal purposes. Therefore, in this paper we also present some strategies, which are part of a family of strategies driven by measurement and evaluation activities. Specifically, we documentevaluation strategies for the monitoring, improving, and comparing and adopting purposes. In addition, we illustrate the comparing and adopting strategyapplied to four social network mobile apps","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128801678","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}
引用次数: 5
Service Migration in a Distributed Virtualization System
J. Comput. Sci. Technol. Pub Date : 1900-01-01 DOI: 10.24215/16666038.21.e16
P. Pessolani, Luis Santiago Re, Tomás Andrés Fleitas
{"title":"Service Migration in a Distributed Virtualization System","authors":"P. Pessolani, Luis Santiago Re, Tomás Andrés Fleitas","doi":"10.24215/16666038.21.e16","DOIUrl":"https://doi.org/10.24215/16666038.21.e16","url":null,"abstract":"Cloud applications are usually formed by different components (microservices) that may be located in different virtual and/or physical computers. To achieve the desired level of performance, availability, scalability, and robustness in this kind of system developers are forced to maintain and configure complex sets of infrastructure, platforms, and frameworks which are expensive to implement, operate and manage. Another approach would be to use a Distributed Virtualization System (DVS) that provides a mechanism that each component could use to communicate with others, regardless of their location and thus, avoiding the potential problems and complexity added by their distributed execution. This communication mechanism already has useful features for developing commercial-class distributed applications, such as replication support (active and passive) and process migration. This article describes the mechanisms used for the migration of server processes between nodes of a DVS cluster transparently for client and server processes, doing special focus on how to solve the problem of keeping client/server communications active even when the server process location has changed.","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127588202","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}
引用次数: 0
Cooperative Coevolutionary Particle Swarms using Fuzzy Logic for Large Scale Optimization 基于模糊逻辑的协同进化粒子群大规模优化
J. Comput. Sci. Technol. Pub Date : 1900-01-01 DOI: 10.24215/16666038.21.e11
F. Paz, G. Leguizamón, E. Mezura-Montes
{"title":"Cooperative Coevolutionary Particle Swarms using Fuzzy Logic for Large Scale Optimization","authors":"F. Paz, G. Leguizamón, E. Mezura-Montes","doi":"10.24215/16666038.21.e11","DOIUrl":"https://doi.org/10.24215/16666038.21.e11","url":null,"abstract":"A cooperative coevolutionary framework can improve the performance of optimization algorithms on large-scale problems. In this paper, we propose a new Cooperative Coevolutionary algorithm to improve our preliminary work, FuzzyPSO2. This new proposal, called CCFPSO, uses the random grouping technique that changes the size of the subcomponents in each generation. Unlike FuzzyPSO2, CCFPSO’s re-initialization of the variables, suggested by the fuzzy system, were performed on the particles with the worst fitness values. In addition, instead of updating the particles based on the global best particle, CCFPSO was updated considering the personal best particle and the neighborhood best particle. This proposal was tested on large-scale problems that resemble real-world problems (CEC2008, CEC2010), where the performance of CCFPSO was favorable in comparison with other state-of-the-art PSO versions, namely CCPSO2, SLPSO, and CSO. The experimental results indicate that using a Cooperative Coevolutionary PSO approach with a fuzzy logic system can improve results on high dimensionality problems (100 to 1000 variables).","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122479130","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}
引用次数: 0
Specifying and Analyzing a Software Testing Ontology at the Top-Domain Ontological Level 在顶域本体论层面指定和分析软件测试本体论
J. Comput. Sci. Technol. Pub Date : 1900-01-01 DOI: 10.24215/16666038.21.e12
Guido Tebes, L. Olsina, Denis Peppino, Pablo Becker
{"title":"Specifying and Analyzing a Software Testing Ontology at the Top-Domain Ontological Level","authors":"Guido Tebes, L. Olsina, Denis Peppino, Pablo Becker","doi":"10.24215/16666038.21.e12","DOIUrl":"https://doi.org/10.24215/16666038.21.e12","url":null,"abstract":"","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130649611","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}
引用次数: 5
Evidence-based lean conceptual data modelling languages 基于证据的精益概念数据建模语言
J. Comput. Sci. Technol. Pub Date : 1900-01-01 DOI: 10.24215/16666038.21.e10
Pablo Fillotrani, C. Keet
{"title":"Evidence-based lean conceptual data modelling languages","authors":"Pablo Fillotrani, C. Keet","doi":"10.24215/16666038.21.e10","DOIUrl":"https://doi.org/10.24215/16666038.21.e10","url":null,"abstract":"Multiple logic-based reconstructions of conceptual data modelling languages such as EER, UML Class Diagrams, and ORM exist. They mainly cover various fragments of the languages and none are formalised such that the logic applies simultaneously for all three modelling language families as unifying mechanism. This hampers interchangeability, interoperability, and tooling support. In addition, due to the lack of a systematic design process of the logic used for the formalisation, hidden choices permeate the formalisations that have rendered them incompatible. We aim to address these problems, first, by structuring the logic design process in a methodological way. We generalise and extend the DSL design process to apply to logic language design more generally and, in particular, by incorporating an ontological analysis of language features in the process. Second, we specify minimal logic profiles availing of this extended process, including the ontological commitments embedded in the languages, of evidence gathered of language feature usage, and of computational complexity insights from Description Logics (DL). The profiles characterise the essential logic structure needed to handle the semantics of conceptual models, therewith enabling the development of interoperability tools. There is no known DL language that This work was partially supported by the National Research Foundation of South Africa and the Argentinian Ministry of Science and Technology. Pablo R. Fillottrani Departamento de Ciencias e Ingenieŕıa de la Computación, Universidad Nacional del Sur, Bah́ıa Blanca, Argentina and Comisión de Investigaciones Cient́ıficas, Provincia de Buenos Aires, Argentina E-mail: prf@cs.uns.edu.ar C. Maria Keet Department of Computer Science, University of Cape Town, South Africa E-mail: mkeet@cs.uct.ac.za matches exactly the features of those profiles and the common core is small (in the tractable DL ALNI). Although hardly any inconsistencies can be derived with the profiles, it is promising for scalable runtime use of conceptual data models.","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116069082","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}
引用次数: 3
Procedure to improve the accuracy of dental implant failures by data science techniques 应用数据科学技术提高牙种植体失败的准确性
J. Comput. Sci. Technol. Pub Date : 1900-01-01 DOI: 10.24215/16666038.21.e13
Nancy Ganz, A. Ares, Horacio D. Kuna
{"title":"Procedure to improve the accuracy of dental implant failures by data science techniques","authors":"Nancy Ganz, A. Ares, Horacio D. Kuna","doi":"10.24215/16666038.21.e13","DOIUrl":"https://doi.org/10.24215/16666038.21.e13","url":null,"abstract":"","PeriodicalId":188846,"journal":{"name":"J. Comput. Sci. Technol.","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128214746","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信