scholarly journals An English Online Homework Tutoring System Supported by Internet Database

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Huanxiang Hao
Keyword(s):  
User Satisfaction ◽  
Resource Sharing ◽  
Clustering Algorithm ◽  
Data Access ◽  
Practical Experience ◽  
Online Homework ◽  
Business Logic ◽  
Processing Efficiency ◽  
College English ◽  
Online Tutoring

College English tutoring is an important content of current research, and how to provide more effective methods for teaching tutoring is currently a hot research topic. Therefore, this paper designs an Internet-based online tutoring platform for college English teaching, which is accelerated by using the K-means clustering algorithm. The data processing efficiency and processing methods to improve user satisfaction require more practical experience to summarize. In the business logic layer, the uploaded information is mined through the K-means clustering algorithm to form an online tutoring university English database to provide platform data support, realize the business logic judgment of the data, convert the data in the database, and return to the user interface of other formats, to provide users with browsing and consulting. In the data access layer, the data from the business logic layer is processed. After the processing is completed, data can be added, deleted, modified, and checked in the database. Finally, the operation result of the database is fed back to the business logic layer for processing. Experimental results show that the designed platform has good data mining performance, low connection speed and low response delay, good compatibility, low CPU usage, fast resource sharing speed, and high user satisfaction. It can be connected to different operating systems.

scholarly journals Image Retrieval Using Data Mining Technique

2020 ◽  
pp. 2115-2125
Author(s):  
Sarmad T. Abdul-Samad ◽  
Sawsan Kamal
Keyword(s):  
Image Retrieval ◽  
User Satisfaction ◽  
Clustering Algorithm ◽  
Retrieval System ◽  
Spatial Information ◽  
Search Space ◽  
Extraction Process ◽  
Retrieval Process ◽  
Data Mining Technique ◽  
Image Retrieval System

Even though image retrieval is considered as one of the most important research areas in the last two decades, there is still room for improvement since it is still not satisfying for many users. Two of the major problems which need to be improved are the accuracy and the speed of the image retrieval system, in order to achieve user satisfaction and also to make the image retrieval system suitable for all platforms. In this work, the proposed retrieval system uses features with spatial information to analyze the visual content of the image. Then, the feature extraction process is followed by applying the fuzzy c-means (FCM) clustering algorithm to reduce the search space and speed up the retrieval process. The experimental results show that using the spatial features increases the system accuracy and that the clustering algorithm speeds up the image retrieval process. This shows that the proposed system works with texture and non-texture images.  

Music Retrieval and Recommendation Scheme Based on Varying Mood Sequences

2012 ◽  
pp. 257-273 ◽  
Author(s):  
Sanghoon Jun ◽  
Seungmin Rho ◽  
Eenjun Hwang
Keyword(s):  
User Satisfaction ◽  
Clustering Algorithm ◽  
Sequence Similarity ◽  
User Interaction ◽  
User Preferences ◽  
New Music ◽  
Music Recommendation ◽  
Unsatisfactory Result ◽  
Music Retrieval ◽  
Music Clip

A typical music clip consists of one or more segments with different moods and such mood information could be a crucial clue for determining the similarity between music clips. One representative mood has been selected for music clip for retrieval, recommendation or classification purposes, which often gives unsatisfactory result. In this paper, the authors propose a new music retrieval and recommendation scheme based on the mood sequence of music clips. The authors first divide each music clip into segments through beat structure analysis, then, apply the k-medoids clustering algorithm for grouping all the segments into clusters with similar features. By assigning a unique mood symbol for each cluster, one can transform each music clip into a musical mood sequence. For music retrieval, the authors use the Smith-Waterman (SW) algorithm to measure the similarity between mood sequences. However, for music recommendation, user preferences are retrieved from a recent music playlist or user interaction through the interface, which generates a music recommendation list based on the mood sequence similarity. The authors demonstrate that the proposed scheme achieves excellent performance in terms of retrieval accuracy and user satisfaction in music recommendation.

Replica Placement Strategy for Data Grid Environment

2013 ◽  
Vol 5 (1) ◽  
pp. 70-81 ◽  
Author(s):  
Mohammed K. Madi ◽  
Yuhanis Yusof ◽  
Suhaidi Hassan
Keyword(s):  
Resource Sharing ◽  
Data Access ◽  
Data Grid ◽  
Computational Time ◽  
Replica Placement ◽  
File Transfer ◽  
Large Bandwidth ◽  
Multiple Copies ◽  
Data Files ◽  
Computational Resources

Data Grid is an infrastructure that manages huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. To increase resource availability and to ease resource sharing in such environment, there is a need for replication services. Data replication is one of the methods used to improve the performance of data access in distributed systems by replicating multiple copies of data files in the distributed sites. Replica placement mechanism is the process of identifying where to place copies of replicated data files in a Grid system. Existing work identifies the suitable sites based on number of requests and read cost of the required file. Such approaches consume large bandwidth and increases the computational time. The authors propose a replica placement strategy (RPS) that finds the best locations to store replicas based on four criteria, namely, 1) Read Cost, 2) File Transfer Time, 3) Sites’ Workload, and 4) Replication Sites. OptorSim is used to evaluate the performance of this replica placement strategy. The simulation results show that RPS requires less execution time and consumes less network usage compared to existing approaches of Simple Optimizer and LFU (Least Frequently Used).

Assessing the effectiveness of a national resource sharing system

2014 ◽  
Vol 42 (2/3) ◽  
pp. 98-104 ◽  
Author(s):  
Silvana Mangiaracina ◽  
Cristina Cocever ◽  
Marco Chiandoni ◽  
Stefania Arabito
Keyword(s):  
User Satisfaction ◽  
Resource Sharing ◽  
Design Methodology ◽  
Swot Analysis ◽  
Qualitative Assessment ◽  
Library Services ◽  
Content Type ◽  
Italian Studies ◽  
User Expectations ◽  
National Resource

Purpose – The purpose of this paper is to report on the surveys, carried out during 2011 and 2013, regarding the functionality of and possible improvements to Italy’s nationwide resource sharing service NILDE (Network for Inter-Library Document Exchange). Design/methodology/approach – The methodology comprises both an analysis of quantitative data about ILL transactions initiated during a 2011 study and a qualitative assessment of the system based on information obtained from the surveys and a SWOT analysis. This proved to be an effective methodology, and a new survey was launched in 2013 to verify whether the choices made and the projects undertaken were in line with user expectations. Findings – The results turned out to be particularly interesting and a source of hints for planning future improvements. Originality/value – Italian studies for assessing user satisfaction of library services, based on user surveys, often relate to a single library or a single University. The NILDE survey was delivered nationwide to all the registered users of NILDE. This is the most extensive survey for the number of libraries and the various types of end users involved.

scholarly journals Multidepot Recycling Vehicle Routing Problem with Resource Sharing and Time Window Assignment

2021 ◽  
Vol 2021 ◽  
pp. 1-21
Author(s):  
Yong Wang ◽  
Xiuwen Wang ◽  
Xiangyang Guan ◽  
Jinjun Tang
Keyword(s):  
Resource Allocation ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Resource Sharing ◽  
Clustering Algorithm ◽  
Time Window ◽  
Operational Efficiency ◽  
Nsga Ii ◽  
Routing Problem ◽  
Logistics Networks

This study aims to provide tactical and operational decisions in multidepot recycling logistics networks with consideration of resource sharing (RS) and time window assignment (TWA) strategies. The RS strategy contributes to efficient resource allocation and utilization among recycling centers (RCs). The TWA strategy involves assigning time windows to customers to enhance the operational efficiency of logistics networks. A biobjective mathematical model is established to minimize the total operating cost and number of vehicles for solving the multidepot recycling vehicle routing problem with RS and TWA (MRVRPRSTWA). A hybrid heuristic algorithm including 3D k-means clustering algorithm and nondominated sorting genetic algorithm- (NSGA-) II (NSGA-II) is designed. The 3D k-means clustering algorithm groups customers into clusters on the basis of their spatial and temporal distances to reduce the computational complexity in optimizing the multidepot logistics networks. In comparison with NSGA algorithm, the NSGA-II algorithm incorporates an elitist strategy, which can improve the computational speed and robustness. In this study, the performance of the NSGA-II algorithm is compared with the other two algorithms. Results show that the proposed algorithm is superior in solving MRVRPRSTWA. The proposed model and algorithm are applied to an empirical case study in Chongqing City, China, to test their applicability in real logistics operations. Four different scenarios regarding whether the RS and TWA strategies are included or not are developed to test the efficacy of the proposed methods. The results indicate that the RS and TWA strategies can optimize the recycling services and resource allocation and utilization and enhance the operational efficiency, thus promoting the sustainable development of the logistics industry.

A Kind of Intelligent Client Flow Engine Based on Ajax

2012 ◽  
Vol 220-223 ◽  
pp. 2504-2507
Author(s):  
Yi Chuan Shao ◽  
Xing Jia Yao ◽  
Li Wei Tian
Keyword(s):  
Data Access ◽  
Business Logic ◽  
Caching Mechanism

To solve the lack of intelligence and the traditional Ajax engine server’s overload problem, we design a new Ajax engine based on the browser caching mechanism named ICFE (Intelligent Client Flow Engine) which separates the business logic layer from data access layer, and transfers business logic layer and the relevant data to the client catch to implement.

Architecture of Campus Security Management System Based on WCF and RFID Technology

2013 ◽  
Vol 411-414 ◽  
pp. 462-466 ◽  
Author(s):  
Yue Li ◽  
Wen Hua Zeng ◽  
Lv Qing Yang ◽  
Zhuang Liang Wu ◽  
Mei Hong Wang
Keyword(s):  
Software Architecture ◽  
Management System ◽  
Security Management ◽  
Data Access ◽  
Rfid Technology ◽  
Business Logic ◽  
Distributed Environment ◽  
Campus Security ◽  
Service Models ◽  
Degree Of Coupling

This paper proposes a specific architecture of campus security management system based on WCF service of SOA and RFID technology, aiming at meeting the security and scalability requirement of the distributed environment of campus security management system. With the help of WCF service models, the underlying interaction among database, data access layer, RFID device information transaction and business logic processing are packaged seamlessly. Then the WCF service models provide platform-independent service to .Net MVC Framework Controller, which could be replaced by any type of caller, separating the presentation and implementation of this system. Because of the advantages of reducing the degree of coupling and greatly enhancing the security, scalability and reliability of the system, this architecture has been one of the recommended trends of software architecture.

Research on Database for Aluminum Alloys

2013 ◽  
Vol 655-657 ◽  
pp. 1815-1819
Author(s):  
Du Yuan ◽  
Ping Gu ◽  
Jian Min Zeng ◽  
Ping Chen ◽  
Yu Lin Zheng
Keyword(s):  
Aluminum Alloys ◽  
Data Access ◽  
Data Management System ◽  
Distributed Model ◽  
Business Logic ◽  
Enterprise Information System ◽  
Enterprise Information ◽  
Design And Implementation ◽  
Main Module ◽  
Scientific Classification

An overall description of the structure, main module function, database design and implementation of the Aluminum Alloy Data Management System (AADMS) is presented in this paper. AADMS is developed by JavaEE multilayer distributed model which includes client, web, business and EIS (EIS: Enterprise Information System) layers. This model can separate the complex business logic and data access logic from the client, enhancing the reliability, portability and expansibility of the system. The system provides scientific classification and management methods for general aluminum alloys, and accomplishes a highly efficient query function for materials and process information.

scholarly journals BC Data ScoutTM: A New Tool To Investigate Datasets For Health Research

2018 ◽  
Vol 3 (4) ◽  
Author(s):  
Sarah Kesselring ◽  
Jessica Galo ◽  
Kelly Sanderson ◽  
Shirley Wong ◽  
Maureen Neuman ◽  
...  
Keyword(s):  
User Satisfaction ◽  
Population Data ◽  
Data Access ◽  
Data Availability ◽  
Administrative Databases ◽  
Hospital Data ◽  
Full Data ◽  
High Quality Research ◽  
Support Unit ◽  
Access Request

IntroductionBC’s Ministry of Health (MOH) maintains many administrative databases with rich information and analytical potential. Researchers are keen to use these data for both discovery and applied research. Historically, limited views of data availability and populations therein have supported study feasibility. Therefore, we developed BC Data ScoutTM, a cohort browser. Objectives and ApproachWe developed a cohort browser service to provide information to researchers planning a study using MOH data. The objective was to create a tool that is simple to use, provides quick results and is free to users to encourage its use. A better understanding of the data available can improve study quality and expand the user-base by giving researchers access to information not previously available during the planning stages. The tool will be evaluated by examining the number of requests received and a user satisfaction survey. Plans are in place to expand into additional data sources and extend query sophistication. ResultsThe BC Data ScoutTM online tool provides cohort information in the form of highly aggregated, approximate results to researchers planning a study. It was developed by the MOH, the BC SUPPORT Unit and Population Data BC (PopData) and was launched in February 2018. The service is delivered by PopData. BC Data ScoutTM offers province-wide information for query, is accessible to a wide group of eligible researchers, and has data availability from the year 2000 onwards. Four types of MOH data are available for query: hospital data; physician data; pharmaceutical data; and demographics. In addition to determining study feasibility, the aggregate reports also help to further refine a full data access request and provide enough information to complete and strengthen a funding application. Conclusion/ImplicationsBC Data ScoutTM will be beneficial for researchers planning to request data. This preliminary information may increase the chances of meaningful research studies to obtain funding, and the production of relevant, high-quality research results. BC will be among the first jurisdictions across Canada to offer this type of feasibility service.

Sign in / Sign up

Export Citation Format

Share Document