Near Field Communication (NFC) is a short-range communication technology. Because of its popularity, NFC is widely applied in the field of Internet of Things (IoT). NFC technology reduces the use of many other devices, so that only smartphones, which have NFC embedded in them, are then widely used for various purposes. Smartphones are becoming quite popular equipment today, because smartphone users are increasing from time to time. With this development, NFC is embeded in smartphones widely used and quite popular.
Implementation of NFC has been done in various fields, such as health, business, transportation and others. NFC applications in the Service Domain include healthcare, location, finance, social networking, entertainment, education etc. In the field of healthcare applications, NFC can facilitate communication between patients and paramedics, such as doctors, nurses, pharmacists, and other sections. In other fields there are social networking applications, entertainment applications, education applications, NFC miscellaneous applications.
In terms of the development of the tag itself, NFC can be discussed with 2 kinds of approach. Firstly is from the side of tag, and secondly is in terms of communication technology. There are 4 types of NFC tags, type 1, type 2, type 3 and type 4. Each type has its own specifications. Frames, data and payload formats have their own different specifications. In its technological side there are 3 types of NFC A, B and F. Each type has its different way in signals and the data format sent. NFC type A is used in this testing
Such rapid development, however, gives positive and negative impacts. One of the effects is that with the use of NFC cards that there will be more possibilities for multiple cards to be read simultaneously. For this reason, a reader is required to read more than one card. Trials show that some cards can be read by a reader sequentially and can write or read.
Software effort prediction with algorithm based frameworks
Shrikant Pawar, Aditya Stanam
The need for accurate effort predictions for projects is one of the most critical and complex issues in the software industry. Effort estimation is an essential activity in planning and monitoring software project development to deliver the product on time and within budget. The competitiveness of software organizations depends on their ability to predict the effort required for developing software systems accurately. Several algorithmic approaches have been proposed in the literature to support software engineers in improving the accuracy of their estimations. The decision of how to select different techniques considering the characteristics of a specific dataset through genetic algorithms could be viewed as a search-based problem for software engineering. Some groups use well known evolutionary learning algorithms (MMRE, PRED (25), PRED (50) and PRED (75), while others use machine learning methods like artificial neural network and fuzzy logic. Analogy estimation is also being utilized for estimating software effort, which has been shown to predict accurate results consistently. Genetic frameworks are becoming famous for selecting best learning schemes for effort prediction using the elitism techniques, utilizing some well-known parameters like Spearman's rank correlation, the median of the magnitude of relative error (MdMRE), and mean of the absolute residuals (MMAR). The technique of using fuzzy rough sets for the analysis is also becoming popular. This article aims to compare various algorithm based frameworks for predicting software development effort which can generate the best-optimized software product.
A New Approach to Automesh Generation of all β graded triangular and quadrilateral Finite Elements over Analytical Surfaces by using the Parabolic Arcs passing through four points on the Boundary Curve
H.T. Rathod, Bharath Rathod
This paper presents a new mesh generation method for a simply connected curved domain of a planar region which has curved boundary described by one or more analytical equations. We first decompose this curved domain into simple sub regions in the shape of curved triangles. These simple regions are then triangulated to generate a fine mesh of linear triangles in the interior and curved triangles near to the boundary of curved domain. These simple regions are then triangulated to create 6-node triangles by inserting midside nodes to these triangles. Each isolated 6-node triangle is then split into four triangles according to the usual scheme, that is, by using straight lines to join the midside nodes. To preserve the mesh conformity a similar procedure is also applied to every triangle of the domain to fully discretize the given convex curved or cracked convex curved domains into all triangles, thus propagating refinements and .The quadrangulation of graded 3-node linear triangles is done by inserting three midside nodes and a centroidal node.Then each graded triangle is split into three quadrilaterals by using straight lines to join the centroid to the midside nodes. This simple method generates a high quality mesh whose elements confirm well to the requested shape by refining the problem domain.
We have approximated the curved boundary arcs by equivalent parabolic arcs.To preserve the mesh conformity, a similar procedure is also applied to every triangle of the domain to fully discretize the given curved domain into all triangles and quadrilaterals, thus propagating a uniform refinement. This simple method generates a high quality mesh whose elements confirm well to the requested shape by refining the problem domain. Examples of a circular disk and a cracked circular disk are presented to illustrate the simplicity and efficiency of the new mesh generation method. We have appended the MATLAB programs which incorporate the mesh generation scheme developed in this paper. These programs provide valuable output on the nodal coordinates ,element connectivity and graphic display of the all triangular and quadrilateral mesh for application to finite element analysis.
Analysis of Encryption Techniques to Enhance Secure Data Transmission
Rajesh Kannan, Dr. R. Mala
with the rapid increase of technology, the data stored and transmitted among the client and server has been increased tremendously. In order to provide high security for the confidential data, there is a need for proper encryption techniques that are to be followed by the concerns. This paper presents an analysis of the various encryption algorithms and their performance on handling the private data with authentication, access control, secure configuration and data encryption. Document oriented databases such as MongoDB, Cassandra, CouchDB, Redis and Hypertable are compared on the basis of their security aspects since they manipulate the huge amount of unstructured data in their databases. It is proposed that each database has its own security breaches and emphasises the need for proper encryption methods to secure the data stored in them.