ON K-SETS AND NANO O-SETS IN IDEAL NANO TOPOLOGICAL SPACES
Authors: D.ARUMUGAKANI, M. RAJA KALAIVANAN
Abstract
The age of the internet and smart application has created a great challenges for the owners of companies and institution providing services of all kinds, as the internet and application have created new virtual world that is not limited by limits , time or place facilitating many services and developing many areas .React native and python for developing smart application development languages such as android and other languages which gives great potential for its proximity to the human language in this project we will talk about the production of an android application linked to web control panel that provides services directed to the service sector and we specially mentioned public washing places and we will study the system from where the creation and technology used, then we will address the target tree, market needs and other services.
Clustering-Based Collaborative Filtering Using an Incentivized/Penalized User Model
Authors: Kaneez Fatima, Amer Noor Khan, Saleha Butool
Abstract
Giving or recommending appropriate content based on the quality of experience is the most important and challenging issue in recommender systems. As collaborative filtering (CF) is one of the most prominent and popular techniques used for recommender systems, we propose a new clustering- based CF (CBCF) method using an incentivized/penalized user (IPU) model only with the ratings given by users, which is thus easy to implement. We aim to design such a simple clustering- based approach with no further prior information while improving the recommendation accuracy. To be precise, the purpose of CBCF with the IPU model is to improve recommendation performance such as precision, recall, and F1 score by carefully exploiting different preferences among users. Specifically, we formulate a constrained optimization problem in which we aim to maximize the recall (or equivalently F1 score) for a given precision. To this end, users are divided into several clusters based on the actual rating data and Pearson correlation coefficient. Afterward, we give each item an incentive/penalty according to the preference tendency by users within the same cluster. Our experimental results show a significant performance improvement over the baseline CF scheme without clustering in terms of recall or F1 score for a given precision.
Time-Cost Trade-off Analysis for Building Construction Projects
Authors: Varun Pratap Singh, B.P.Mudgal
Abstract
In Construction planning the major problem is reducing the time- cost and it developed the time- cost trade-off (TCTO) problem moments. The time and cost is always identified with each other and if we assume time as precious as plutocrat (time value of money) TVOM also the dealing with these type of problem is must be easy. In moment’s competitive business terrain, delivering systems in the least possible time, with maximum quality and minimal cost has got a critical issue for design directors. Design time crashing plays an important part in design operation determining which conditioning duration to crash to complete the design in the quested time. TCTO problem in design operation have been traditionally answered by two distinctive approaches like CTM, PERT, Heuristic styles and so on. The relative analysis between mathematically (Linear Programming Method/ Traditional) and CTM is done by using an illustration.
DIFFERENT TYPES OF INTRUCTIONAL STRATAGIES IN TEACHING-LEARNING (T-L) PROCESS
Authors: Dr. S. Arun Sankar
Abstract
Any teaching-learning (T-L) experience is planned and implemented to develop intended outcomes in the learners. A teacher has to be concerned about how learning can be made more effective and efficient and this is where the different types of instructional methods can be of great help. This paper endeavours to discuss the concept of instructional strategy and its importance in the realm of engineering education.