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

Int. J. Inf. Syst. Model. Des.最新文献

筛选
英文 中文
Enterprise Management Data Acquisition System Based on WoT 基于WoT的企业管理数据采集系统
Int. J. Inf. Syst. Model. Des. Pub Date : 2023-03-31 DOI: 10.4018/ijismd.313577
Kun Yan, Dongyan Li
{"title":"Enterprise Management Data Acquisition System Based on WoT","authors":"Kun Yan, Dongyan Li","doi":"10.4018/ijismd.313577","DOIUrl":"https://doi.org/10.4018/ijismd.313577","url":null,"abstract":"With the rapid development of the WoT, acquisition requirements to the data grow with each passing day. However, the existing data acquisition systems usually use the upload mode. Uploading data not only takes a lot of time, but also requires staff to continuously monitor on duty. Aiming at the problem of enterprise management data acquisition, a WoT-based enterprise management data acquisition and analysis system is constructed. The system obtains multiple monitoring data through the data acquisition module and integrates these data through the processing module, which can solve the problems of traditional data acquisition systems. In order to effectively fuse data, based on canonical correlation analysis (CCA), the multiple order statistics correlation discrimination analysis algorithm is proposed as a fusion strategy. Experimental results show that the fusion strategy based on CCA can effectively integrate monitoring data and accurately identify different characters.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122152738","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
An Efficient Trajectory Representative Generation Moving Web-Based Data Prediction Using Different Clustering Algorithms 基于不同聚类算法的高效轨迹代表生成移动web数据预测
Int. J. Inf. Syst. Model. Des. Pub Date : 2023-01-13 DOI: 10.4018/ijismd.316132
V. Mishra, Megha Mishra, B. Dewangan, T. Choudhury
{"title":"An Efficient Trajectory Representative Generation Moving Web-Based Data Prediction Using Different Clustering Algorithms","authors":"V. Mishra, Megha Mishra, B. Dewangan, T. Choudhury","doi":"10.4018/ijismd.316132","DOIUrl":"https://doi.org/10.4018/ijismd.316132","url":null,"abstract":"This paper highlighted moving and trajectory object cluster (MOTRACLUS) algorithm and analyzed the sub-trajectories and real-trajectories algorithm for moving web-based data and suggested a new approach of moving elements. This paper evaluates the hurricane data measure and mass less data measure entropy of trajectories objects of moving data of Chhattisgarh location. The paper covered prediction generation with their distance cluster minimum description length (MDL) algorithm and other corresponding distance cluster (CLSTR) algorithm. This paper highlighted the k-nearest algorithm with least cluster section (LCSS) model and dimensional Euclidean of MDL algorithm. The algorithm consists of two parts, that is, partitioning and grouping phase. This paper develops and enhances a cluster of trajectory objects and calculates the actual distance of moving objects. This algorithm works on the CLSTR algorithm and calculates trajectory movement of the object. In this, the authors evaluate the entropy of moving objects by consideration of the heuristic parameter.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129472414","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
Energy-Aware VM Scheduler: A Systematics Review 能量感知虚拟机调度程序:一个系统综述
Int. J. Inf. Syst. Model. Des. Pub Date : 2022-11-01 DOI: 10.4018/ijismd.297631
R. Shukla, Anoop Kumar Chaturvedi
{"title":"Energy-Aware VM Scheduler: A Systematics Review","authors":"R. Shukla, Anoop Kumar Chaturvedi","doi":"10.4018/ijismd.297631","DOIUrl":"https://doi.org/10.4018/ijismd.297631","url":null,"abstract":"Cost is the backbone of any business model to sustain and growth in the competitive business market. Considering this, higher energy consumption may affect the operational cost of any industry. Cloud computing is one of the most popular IT business model for service provider and its users. It is observed in many research, that the average cost of the services are highly dependent upon the run time and power consumption. More power consumption effect the environmental things as well. In this review, more than 100 research articles are considered to evaluate the energy consumption methods, issues and challenges from 2009 to 2021. Based on the study, the energy-aware load balancing methods are classified into four major clusters. The most cited methods are compared based on method used, platform where it is deployed, different evaluation parameters like cost, run time, Virtual Machine utilization, Service-level-agreement violation rate, and Quality-of-service QoS. The result of this review is presented as open research issues and challenges for forthcoming research.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131180483","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 Cloudlet Allocation to Virtual Machine to Impact Cloud System Performance 高效的Cloudlet分配给虚拟机，影响云系统性能
Int. J. Inf. Syst. Model. Des. Pub Date : 2022-11-01 DOI: 10.4018/ijismd.297630
Lizia Sahkhar, Bunil Kumar Balabantaray, S. Yadav
{"title":"Efficient Cloudlet Allocation to Virtual Machine to Impact Cloud System Performance","authors":"Lizia Sahkhar, Bunil Kumar Balabantaray, S. Yadav","doi":"10.4018/ijismd.297630","DOIUrl":"https://doi.org/10.4018/ijismd.297630","url":null,"abstract":"Performance is an essential characteristic of any cloud computing system. It can be enhance through parallel computing, scheduling and load balancing. This work evaluates the connection between the response time (RT) and virtual machine’s (VM) CPU utilization when cloudlets are allocated from the datacenter broker to VM. To accentuate the RT and VM’s CPU utilization, a set of 100 and 500 heterogeneous cloudlets are analyzed under hybridized provisioning, scheduling and allocation algorithm using CloudSim simulator. These includes space shared (SS) and time shared (TS) provisioning policy, shortest job first (SJF), first come first search (FCFS), round robin (RR) and a novel length-wise allocation (LwA) algorithm. The experimental analysis shows that the RT is the least when SJF is combined with RR allocation at 40.665 secs and VM’s CPU utilization is the least when SJF is combined with LwA policy at 12.48 in all combinations of SS and TS provisioning policy.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126655448","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
Detecting Sinkhole Attacks in IoT-Based Wireless Sensor Networks Using Distance From Base Station 基于基站距离的物联网无线传感器网络天坑攻击检测
Int. J. Inf. Syst. Model. Des. Pub Date : 2022-11-01 DOI: 10.4018/ijismd.297628
Koushik Mondal, S. Yadav, Vipin Pal, A. Singh, Yogita Yogita, Mangal Singh
{"title":"Detecting Sinkhole Attacks in IoT-Based Wireless Sensor Networks Using Distance From Base Station","authors":"Koushik Mondal, S. Yadav, Vipin Pal, A. Singh, Yogita Yogita, Mangal Singh","doi":"10.4018/ijismd.297628","DOIUrl":"https://doi.org/10.4018/ijismd.297628","url":null,"abstract":"Wireless sensor networks (WSNs) are infrastructure-less in nature, which contains numbers of autonomous sensor nodes. These sensor nodes are dedicated to monitoring the physical conditions of the environment and are organizing the collected data at a central location. Application area of WSN, like - heath care, military surveillance, are sensitive with respective to information sensed, that’s why security of WSN needs to be very effective. Providing security to WSN plays a major role as it consists of limited resources. The security system should lie within the boundary of the resource potential as well as should be competent enough to handle attacks. Intrusion detection system (IDS) is one such type of defense system, which can fulfill the measure of limitation of resources. In this paper, a detection technique is proposed against sinkhole attack using the Euclidean distance of each node from base station. The main advantage of the proposed technique is that it doesn't require any extra hardware setup as well as doesn't require extra communication cost.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"536 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133390001","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
Analysis of Cloud and Self-Web-Hosting Services Based on Security Parameters 基于安全参数的云和自托管服务分析
Int. J. Inf. Syst. Model. Des. Pub Date : 2022-11-01 DOI: 10.4018/ijismd.297629
Surbhi Khare, Abhishek Badholia
{"title":"Analysis of Cloud and Self-Web-Hosting Services Based on Security Parameters","authors":"Surbhi Khare, Abhishek Badholia","doi":"10.4018/ijismd.297629","DOIUrl":"https://doi.org/10.4018/ijismd.297629","url":null,"abstract":"Most of the web applications are hosting by cloud due to low cost and low infrastructure setup is required. In continue to this, user no need to maintain the infrastructure by their own. In this paper, both the technology, self-web-hosting, and cloud-web-hosting are compared based on different security parameters like key generation (PKI), automatic authentication and protection of intra-tenant networks, secure logging system events, spam filtering, CAPTCHA generation and authentication, and software widgets such as password metering. These parameters are classified into seven categories and the review has been conducted based on these categories. The bibliometric analysis has been conducted where ever more than 70 research found in Web-of-Science (WoS) database through bibliometric library and biblioshine package in R programming. The outcome of this analysis is presented in tabular form, and open challenges of both the technologies are discussed in details with proposed solutions.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130707508","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
QoS-Aware Web Services Recommendations Using Dynamic Clustering Algorithms 使用动态聚类算法的qos感知Web服务推荐
Int. J. Inf. Syst. Model. Des. Pub Date : 2022-11-01 DOI: 10.4018/ijismd.301274
P. Pandharbale, S. Mohanty, A. Jagadev
{"title":"QoS-Aware Web Services Recommendations Using Dynamic Clustering Algorithms","authors":"P. Pandharbale, S. Mohanty, A. Jagadev","doi":"10.4018/ijismd.301274","DOIUrl":"https://doi.org/10.4018/ijismd.301274","url":null,"abstract":"Service-Oriented Computing (SOC) activates communication through web services to provide computing as a service for business applications in the Service-Oriented Architecture (SOA). To make SOC successful, finding a needed service to build a system directly depending on the collection of services is a critical confront, in this paper we planned the clustering-based approach called Dynamic Clustering (DCLUS). The novelty in DCLUS compared to static-based clustering technique is the use of dynamic clustering technique. In existing CLUS, the static various widths clustering method is exploited for the users and services clustering. However, due to the limitations of static clustering, we proposed dynamic clustering to optimize the performance of clustering using data mining to find the associations and patterns, for services, and also the prediction accuracy. The performance of the proposed DCLUS system will be implemented and evaluated facing the existing system in phases of precision, recall, and f-score performance metrics using the research dataset.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126110978","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
Altering OWL Ontologies for Efficient Knowledge Organization on the Semantic Web 改变OWL本体以实现语义网上高效的知识组织
Int. J. Inf. Syst. Model. Des. Pub Date : 2022-10-20 DOI: 10.4018/ijismd.313431
Abhisek Sharma, S. Jain
{"title":"Altering OWL Ontologies for Efficient Knowledge Organization on the Semantic Web","authors":"Abhisek Sharma, S. Jain","doi":"10.4018/ijismd.313431","DOIUrl":"https://doi.org/10.4018/ijismd.313431","url":null,"abstract":"The increase in the number of users on the internet and the advancement in information technology have spiked the generation of information to an unprecedented level making information retrieval and web mining a difficult task. Semantic technologies can help improve the results of web mining by providing constructs that can help represent the web documents in a machine-understandable manner. To keep providing semantically rich services while keeping this surge in the amount of information in mind, we have to work towards ways to make the process of information management efficient while retaining its effectiveness. One of the ways to accomplish the above task is to improvise the knowledge organization in a manner that every piece of information is in its designated place. This paper discusses and addresses the problems with current knowledge organization methodologies and presents an algorithm to alter the available OWL ontologies. The authors were able to get a noticeable improvement in the amount of storage used by the ontology with fewer axioms without losing any information.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"6 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120833531","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
Content and Popularity-Based Music Recommendation System 基于内容和人气的音乐推荐系统
Int. J. Inf. Syst. Model. Des. Pub Date : 2022-10-20 DOI: 10.4018/ijismd.315027
Mamata Garanayak, S. K. Nayak, K. Sangeetha, T. Choudhury, S. Shitharth
{"title":"Content and Popularity-Based Music Recommendation System","authors":"Mamata Garanayak, S. K. Nayak, K. Sangeetha, T. Choudhury, S. Shitharth","doi":"10.4018/ijismd.315027","DOIUrl":"https://doi.org/10.4018/ijismd.315027","url":null,"abstract":"The future of many modern technologies includes machine learning and deep learning methodologies. One of the prominent applications of these technologies is the recommender system. Due to the rapid growth of the songs in digital formats, the searching and managing of songs has become a great problem. In this study, the authors developed a recommender system using popularity and rhythm content of the song. The studies compared various techniques to improve the robustness and minimal error of the system. The authors will mostly focus on content-based, popularity-based, and collaborative-based filtering algorithms and also try to combine them using a hybrid approach. The authors utilized MAE for comparing the several procedures implemented here for the recommendation. Out of all procedures used, SVD performed well with MAE of 1.60 while KNN didn't perform that well as the authors had fewer features of song with mean absolute error of 2.212. User-relied and item-relied prototypes performed the best with MAE of 0.931 and 0.629.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125314959","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
Improving Big Data Analytics With Interactive Augmented Reality 用交互式增强现实改进大数据分析
Int. J. Inf. Syst. Model. Des. Pub Date : 2022-10-20 DOI: 10.4018/ijismd.315124
S. Hirve, C. Reddy
{"title":"Improving Big Data Analytics With Interactive Augmented Reality","authors":"S. Hirve, C. Reddy","doi":"10.4018/ijismd.315124","DOIUrl":"https://doi.org/10.4018/ijismd.315124","url":null,"abstract":"Since, data is generated every minute by everyone including consumers and/or business worldwide, there is an enormous worth for big data analytics. Big data analytics is a technique for extracting important information from large amounts of a data. Visualization is the best medium to analyze and share information. Visual images help to transmit bid data to the human brain within a few seconds. Visual interpretations help in visualizing data from different angles. Visualization helps to outline problems and understand current trends. Augmented reality enables the user to experience the real world, which is digitally augmented in a way. The main objective of this research work is to find the solution to visualize the analyzed data and show it to the users in a 3D view and to improve the angle of visualization with the help of augmented reality techniques.","PeriodicalId":289800,"journal":{"name":"Int. J. Inf. Syst. Model. Des.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130212589","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学术官方微信