发布求助
文献互助 智能选刊 最新文献

3C TIC: Cuadernos de desarrollo aplicados a las TIC最新文献

筛选
英文 中文
Reidemeister Number in Lefschetz Fixed point theory Lefschetz不动点理论中的Reidemeister数
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.61-70
T. Mubeena
{"title":"Reidemeister Number in Lefschetz Fixed point theory","authors":"T. Mubeena","doi":"10.17993/3ctic.2022.112.61-70","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.61-70","url":null,"abstract":"Several interesting numbers such as the homotopy invariant numbers the Lefschets number L(f), the Nielsen number N(f), fixed point index i(X, f,U) and the Reidemeister number R(f) play important roles in the study of fixed point theorems. The Nielsen number gives more geometric information about fixed points than other numbers. However the Nielsen number is hard to compute in general. To compute the Nielsen number, Jiang related it to the Reidemeister number R(f ) of the induced homomorphism f  :  1(X)    1(X) when X is a lens space or an H-space (Jian type space). For such spaces, either N(f) = 0 or N(f) = R(f) the Reidemeister number of f  and if R(f) =   then N(f) = 0 which implies that f is homotopic to a fixed point free map. This is a review article to discuss how these numbers are related in fixed point theory.","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129109078","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
Rice quality analysis using image processing and machine learning 使用图像处理和机器学习的稻米质量分析
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.158-164
R. Dharmik, Sushilkumar Chavhan, S. Gotarkar, Arjun Pasoriya
{"title":"Rice quality analysis using image processing and machine learning","authors":"R. Dharmik, Sushilkumar Chavhan, S. Gotarkar, Arjun Pasoriya","doi":"10.17993/3ctic.2022.112.158-164","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.158-164","url":null,"abstract":"Object Detection and its analysis are used in various fields. Rice quality evaluation subtask in Agricultural industries is not exception for object Detection. Manual identification using image processing techniques, Machine Learning Techniques and Deep Learning is also used for the rice quality analysis. Due to Feature identification challenge machine Learning and Deep Learning are in the demand. As rice is mostly used agricultural product so it is important to have the proper analysis of the crops. In this study we proposed the used of image processing method with the help of Machine Learning model. Rice grain morphological characteristics are what define a grain’s quality analysis. The suggested method can operate efficiently with little expense.","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129222514","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
Benchmarking for Recommender System (MFRISE) 推荐系统(MFRISE)的基准测试
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.146-156
M. Mali, D. Mishra, M. Vijayalaxmi
{"title":"Benchmarking for Recommender System (MFRISE)","authors":"M. Mali, D. Mishra, M. Vijayalaxmi","doi":"10.17993/3ctic.2022.112.146-156","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.146-156","url":null,"abstract":"The advent of the internet age offers overwhelming choices of movies and shows to viewers which create need of comprehensive Recommendation Systems (RS). Recommendation System will suggest best content to viewers based on their choice using the methods of Information Retrieval, Data Mining and Machine Learning algorithms. The novel Multifaceted Recommendation System Engine (MFRISE) algorithm proposed in this paper will help the users to get personalized movie recommendations based on multi-clustering approach using user cluster and Movie cluster along with their interaction effect. This will add value to our existing parameters like user ratings and reviews. In real-world scenarios, recommenders have many non-functional requirements of technical nature. Evaluation of Multifaceted Recommendation System Engine must take these issues into account in order to produce good recommendations. The paper will show various technical evaluation parameters like RMSE, MAE and timings, which can be used to measure accuracy and speed of Recommender system. The benchmarking results also helpful for new recommendation algorithms. The paper has used MovieLens dataset for purpose of experimentation. The studied evaluation methods consider both quantitative and qualitative aspects of algorithm with many evaluation parameters like mean squared error (MSE), root mean squared error (RMSE), Test Time and Fit Time are calculated for each popular recommender algorithm (NMF, SVD, SVD++, SlopeOne, Co- Clustering) implementation. The study identifies the gaps and challenges faced by each above recommender algorithm. This study will also help researchers to propose new recommendation algorithms by overcoming identified research gaps and challenges of existing algorithms.","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125550309","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
The Leray-Schauder Principle in Geodesic Spaces 测地线空间中的Leray-Schauder原理
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.99-106
Sreya Valiya Valappil, Shaini Pulickakunnel
{"title":"The Leray-Schauder Principle in Geodesic Spaces","authors":"Sreya Valiya Valappil, Shaini Pulickakunnel","doi":"10.17993/3ctic.2022.112.99-106","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.99-106","url":null,"abstract":"The essential maps introduced by Granas in 1976 is a best tool for proving continuation results for compact maps. Several authors modified this idea to different scenarios. This is a review article, here, we consider the continuation results based on essential maps and the Leray-Schauder principle in the setting of uniquely geodesic spaces [20].","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121481784","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
Applications of Fixed Point Theorems to Solutions of Operator Equations in Banach Spaces 不动点定理在Banach空间算子方程解中的应用
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.72-79
Neeta Singh
{"title":"Applications of Fixed Point Theorems to Solutions of Operator Equations in Banach Spaces","authors":"Neeta Singh","doi":"10.17993/3ctic.2022.112.72-79","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.72-79","url":null,"abstract":"In this paper we use Browder’s and Gohde’s fixed point theorem, Kirk’s fixed point theorem and the Sadovskii fixed point theorem to obtain solutions of operator equations in Banach spaces.","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131864849","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
Near-lossless compression scheme using hamming codes for non-textual important regions in document images 使用汉明码对文档图像中的非文本重要区域进行近无损压缩
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.225-237
P. Paikrao, D. Doye, Milind V. Bhalerao, M. Vaidya
{"title":"Near-lossless compression scheme using hamming codes for non-textual important regions in document images","authors":"P. Paikrao, D. Doye, Milind V. Bhalerao, M. Vaidya","doi":"10.17993/3ctic.2022.112.225-237","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.225-237","url":null,"abstract":"Working at Bell Labs in 1950, irritated with error-prone punched card readers, R W Hamming began working on error-correcting codes, which became the most used error-detecting and correcting approach in the field of channel coding in the future. Using this parity-based coding, two-bit error detection and one-bit error correction was achievable. Channel coding was expanded further to correct burst errors in data. Depending upon the use of the number of data bits ‘d’ and parity bits ‘k’ the code is specified as (n, k) code, here ‘n’ is the total length of the code (d+k). It means that 'k' parity bits are required to protect 'd' data bits, which also means that parity bits are redundant if the code word contains no errors. Due to the framed relationship between data bits and parity bits of the valid codewords, the parity bits can be easily computed, and hence the information represented by 'n' bits can be represented by 'd' bits. By removing these unnecessary bits, it is possible to produce the optimal (i.e., shortest length) representation of the image data. This work proposes a digital image compression technique based on Hamming codes. Lossless and near-lossless compression depending upon need can be achieved using several code specifications as mentioned here. The achieved compression ratio, computational cost, and time complexity of the suggested approach with various specifications are evaluated and compared, along with the quality of decompressed images.","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129144634","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
Essential Spectrum of Discrete Laplacian – Revisited 离散拉普拉斯函数的本质谱
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.52-59
V. B. Kiran Kumar
{"title":"Essential Spectrum of Discrete Laplacian – Revisited","authors":"V. B. Kiran Kumar","doi":"10.17993/3ctic.2022.112.52-59","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.52-59","url":null,"abstract":"Consider the discrete Laplacian operator A acting on l2(Z). It is well known from the classical literature that the essential spectrum of A is a compact interval. In this article, we give an elementary proof for this result, using the finite-dimensional truncations An of A. We do not rely on symbol analysis or any infinite-dimensional arguments. Instead, we consider the eigenvalue-sequences of the truncations An and make use of the filtration techniques due to Arveson. Usage of such techniques to the discrete Schrödinger operator and to the multi-dimensional settings will be interesting future problems.","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132263451","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
Background removal of video in realtime 背景删除视频在实时
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.195-206
Arya Khanorkar, Bhavika Pawar, Diksha Singh, Kritika Dhanbhar, Nikhil Mangrulkar
{"title":"Background removal of video in realtime","authors":"Arya Khanorkar, Bhavika Pawar, Diksha Singh, Kritika Dhanbhar, Nikhil Mangrulkar","doi":"10.17993/3ctic.2022.112.195-206","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.195-206","url":null,"abstract":"Background removal for video is a computer-vision based system to remove the background from a video with ease. Creating a professional background when at home, i.e., not in a very professional environment, can be a tedious task. Not everyone has time to learn editing and the technicalities involved in having an entire setup for creating a sophisticated background and it is not practical that normal people buy green screens or blue screens just for their everyday formal meets. Our goal is to create a quick and easy solution to that by removing background in real time while also maintaining the quality of the call, having the additional benefit of adding custom backgrounds and enabling users to add effects like adjust lighting, contrast etc., we are combining all 4-5 steps in 1 single step. SelfieSegmentation module of Mediapipe helps us achieve this. The Selfie Segmentation API creates an output mask from an input image. The mask will be the same size as the input image by default. A float integer with a range of [0.0, 1.0] is assigned to each pixel of the mask. The higher the confidence that the pixel depicts a person, and vice versa, the closer the number is to 1.0.","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129949456","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
RFM analysis for customer segmentation using machine learning: a survey of a decade of research 使用机器学习的客户细分的RFM分析:十年研究的调查
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.166-173
Sushilkumar Chavhan, R. Dharmik, Sachin Jain, K. Kamble
{"title":"RFM analysis for customer segmentation using machine learning: a survey of a decade of research","authors":"Sushilkumar Chavhan, R. Dharmik, Sachin Jain, K. Kamble","doi":"10.17993/3ctic.2022.112.166-173","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.166-173","url":null,"abstract":"Customer segmentation is a method of categorizing corporate clients into groups based on shared characteristics. In this study, we looked at the different customer segmentation methods and execute RFM analysis by using various clustering algorithms. Based on RFM values (Recent, Frequency, and Cost) of customers, the successful classification of company customers is divided into groups with comparable behaviors. Customer retention is thought to be more significant than acquiring new clients are analyzed on two different databases. Results show the significance of each method. Comparison is helps for selection of better customer segmentation.","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123309689","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
Efficient system for CPU metric visualization 高效的CPU度量可视化系统
3C TIC: Cuadernos de desarrollo aplicados a las TIC Pub Date : 2022-12-29 DOI: 10.17993/3ctic.2022.112.239-250
K. Vayadande, Ankur Raut, Roshita Bhonsle, Vithika Pungliya, Atharva Purohit, Samruddhi Pate
{"title":"Efficient system for CPU metric visualization","authors":"K. Vayadande, Ankur Raut, Roshita Bhonsle, Vithika Pungliya, Atharva Purohit, Samruddhi Pate","doi":"10.17993/3ctic.2022.112.239-250","DOIUrl":"https://doi.org/10.17993/3ctic.2022.112.239-250","url":null,"abstract":"There are multiple metrics associated with the smooth and efficient working of a computer system. Some of the crucial parts are like the CPU, memory usage and GPUs. For different Operating Systems, they have their own System Software for managing and analysing their sessions. Like Task Manager in Windows, Nmon in Linux and Activity Monitor in Mac. In addition to it, there are few applications software’s which perform similar tasks with slight modifications. In this paper, a web application is proposed that will fetch these performance metrics from the user's system and display them using dynamic charts. The proposed application is a system independent tool and can be useful for all operating system. The application also can be used to determine whether or not a game is compatible with the user's system based on the system requirements.","PeriodicalId":237333,"journal":{"name":"3C TIC: Cuadernos de desarrollo aplicados a las TIC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133474315","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信