Search

With a rapid increase in the volume of data, it is extremely critical for a business to display users with personalized recommendations. Applications such as Youtube, Amazon Prime Video, etc., keep track of the user’s activity, preferences, and ratings in order to provide meaningful recommendations. Such recommenders are typically based upon long-term preference profiles. However, our proposed approach implements a deep learning model that overcomes the current limitations of content and collaborative based filtering approaches and achieved a root mean squared error of 0.8659. These intermediate recommendations are further filtered based upon the changes in user preferences over time and provides the final recommendations tailored to user’s recent interactions. The proposed approach obtains a hit rate of 63% taking the user’s current interests and behavior into account.

Objective The emergence of distraction‐based growing rods has provided the means to reduce the progression of spinal deformity in early onset scoliosis (EOS). The current protocols for evaluating spinal implants (ie, ASTM‐F1717 and ISO‐12189) were developed for fusion/dynamic devices. These protocols do not feature long unsupported rod lengths subjected to distraction. Due to the unsuitability of the existing guidelines for the evaluation of growing rods, a new distraction‐based finite element protocol is presented herein for the first time. Method A vertebrectomy (VO) model from current protocols was modified to accommodate multi‐spinal segments (ie, MS model) in which springs with appropriate stiffness were simulated in between the plastic blocks. To assess the efficacy of the protocol, two different computational studies were conducted: (a) compression‐bending (MS‐CB) with no distraction, and (b) distraction followed by compression‐bending (MS‐D + CB). In each study, the model with no axial connector (rods‐only) was modified to include a) 80‐mm long tandem (LT) connectors, and b) side‐by‐side (SBS) connectors. Stiffness and yield loads were calculated as per ASTM‐F1717 guidelines and compared with the corresponding VO models with no distraction. In the MS‐D + CB models, distraction was applied at the top block, stretching the spring‐block construct in a simulation of scoliosis surgery prior to locking the construct at the connector‐rods' interface. Results MS‐CB models predicted higher stiffness and yield loads, compared to the VO models. The locking mechanism produced pre‐existing stresses on the rod‐connector interface, which caused a shift in the location of high‐stress regions to the distraction site. Distraction led to a decrease in the construct's stiffness and yield load. Discussion The proposed protocol enables the simulation of clinical parameters that are not feasible in the F1717 models and predicted stress patterns in the hardware consistent with observed clinical failures.

MANET is a self-configuring network, in which topology is dynamic. These nodes are struggling to cope with the normal effect of radio communication channels, multi-user interference, multi-path fading etc. The design of an optimum routing protocol for MANET is highly difficult. To determine the connectivity of network organizations, there is a need for an efficient algorithm link scheduling, and routing in such dynamic scenarios, becomes very important. The efficiency of a routing algorithm depends on the proficient and winning route computation. Usually, the shortest path algorithm is a successful method to calculate the optimal way in static networks. But this idea is not possible in MANET platform. There are many factors which can be considered for routing. Multihop paths are used in MANET for interconnecting the nodes. All the nodes are present in the network which are used for path construction for delivering a packet from source to destination node.

Steganography is the art of secret communication and evolved rapidly in the research community, and hiding data in images is relatively secure against spoofing; buying these point researchers targeted hiding secrets in LSBs of image pixels, and that particular method is known as LSB image steganography and evolved as an emerging method of secure data transmission over Internet. Influenced with this fundamental concept, this research is presenting a secure data hiding approach that ensures to maintain the quality of stego image while concealing more data per image. This research leverages the LZW compression technique to enlarge the text coverage in cover images, and for added security, it hides data in random pixels of the image which deliver the strength of “transposition cryptography.” LSB-based presented approach is influenced by the novel invention of H. B. Kekre and same algorithm would be considered for the comparative analysis of data hiding capabilities of presented method. This research is focused to hide data in LSB bits and will target MSBs only in the cases when LSB bits of all image pixels have conceived the secret bits, and this approach is the heartbeat of this research and ensures the better quality stego image after the hiding process, it could be considered that a bare eye cannot distinguish any difference comparing with original image. Presented approach is fully secured against the possibility of R-S detection attacks. Experimental analysis indicates that presented approach is very secure even having 2 times more data concealing as compared to kekre’s method. Apart from that all digested data was recovered at the destination, this approach is a lossless data hiding approach.

the increasing problems of uncertainty, vagueness and imprecision during the modeling of various control system, the fuzzy logic comes into account. Fuzzy logic was first introduced by a Polish philosopher, Jan Lukasiewicz, in 1930. As the classical logic operates with only two values- 1 (true) and 0 (false), Lukasiewicz introduced a new logic which has more than two truth values. Lukasiewicz extends the range of classical logic to all the real numbers in the interval between 0 and 1 and named it as fuzzy logic. Fuzzy logic is a powerful tool which represents and process human knowledge in the form of fuzzy if-then rules. As the fuzzy logic systems is based on human thinking and natural language and also has a good stability, fast response and less complexity, the applications based on fuzzy logic have been increased significantly. To follow the trend, this paper presents the basic introduction of fuzzy logic, fuzzy sets and its operations. This paper provides a huge description of fuzzy logic system and fuzzy inference system and also provides comparison between fuzzy logic system and conventional control system. In this paper, the various applications of fuzzy logic have been simulated using the MATLAB.

The parallel corpus for multilingual NLP tasks, deep learning applications like Statistical Machine Translation Systems is very important. The parallel corpus of Hindi-English language pair available for news translation task till date is of very limited size as per the requirement of the systems are concerned. In this work we have developed an automatic parallel corpus generation system prototype, which creates Hindi-English parallel corpus for news translation task. Further to verify the quality of generated parallel corpus we have experimented by taking various performance metrics and the results are quite interesting.

Hidden node problem is the most common in communication process, where the two nodes that is sender or receiver in the network are not able to see each other and no communication is possible between them. With this problem, a node which wants to send data to other node will not be able to know whether the data has transmitted to the destination or not, which degrades the efficiency of the network. Several existing techniques have been proposed till now in order to resolve these issues in wireless networks but still these methods are not able to get out of it properly and capably. This study implements a new approach by dividing the area of the network in 4 equal sections on the basis of clusters. Then the concept of Cluster Head (CH) is introduced in order to maintain the information or status of the related nodes. The result section shows the proficiency of the proposed work over the traditional work with respect to enhanced accuracy and throughput.

A hybrid approach of cryptography, data compression and steganography has been proposed in this paper. Motivation behind this research is to provide a smart image steganographic technique which must be capable enough to provide better quality stego-image with a high data hiding capability. Proposed approach is a LSB based approach and inspired with the invention of H. B. Kekre in the field of image steganography. Maximum data hiding capability of proposed approach will be evaluated from kekre's algorithm. Proposed approach hides data in the upper LSB bit only when its adjacent LSB bit of all the pixel have conceived a bit of secret data for better quality of the stego-image. LZW compression scheme is used to optimize the size of secret data, it will enable a personal to hide approx 2 times more data in a cover-image. This approach is secure against the RS detection attack and its stego-image is totally indistinguishable from the original image (cover-image) by the human eye.

Proteomics is an attempt to describe or explain biological state and qualitative and quantitative changes of protein content of cells and extracellular biological materials under different conditions to further understand biological processes. Protein-Protein interaction prediction and classification is a very important task. Prediction and classification of protein-protein interactions can help in improving the understanding of diseases and can provide the basis for new therapeutic approaches. In this work a model is proposed to classify protein-protein interactions. Jordan Recurrent Neural Network is used to classify the proteinprotein interactions. The model developed gives 97.25% of accuracy which is 8.7% more than Back-Propagation Neural Network.

Mobile Ad-Hoc Networks (MANETs) are autonomous and decentralized wireless systems. Mobile Ad hoc Network is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. Many Routing protocols have been proposed so far to improve the routing performance and reliability. This research paper describes the characteristics of ad hoc routing protocols Ad-hoc On Demand Distance Vector Routing (AODV), Optimized link State Routing (OLSR), Temporally Ordered Routing Algorithm (TORA), Dynamic Source Routing (DSR), Destination-Sequenced Distance-Vector Routing (DSDV) based on the performance metrics like packet delivery fraction, Average delay, Normalized Routing load, Throughput and Jitter under low mobility and low traffic network as well as under high mobility and high traffic network. Results show that AODV has maximum throughput under low traffic and DSDV has maximum throughput under high traffic. As network becomes dense OLSR, DSR and DSDV perform well in terms of Throughput than AODV and TORA. TORA performs well in dense networks in terms of packet delivery fraction but at the same time Normalized Routing load of TORA is maximum among all the protocols in both the networks. DSDV has least Normalized Routing load in both low and high traffic. OLSR and DSDV give the least Jitter and Average Delay in both networks.

of the Quality of Service (QoS) in the UMTS (Universal Mobile Telecommunications System) network has been done using different parameters. UMTS is a universal telecommunication service which is more popularly known as 3G. It uses Wideband Code Division Multiple Access (WCDMA) techniques inculcating internet protocol, urban terrestrial and radio air interfaces. Thus, resources used here also allow lower generation services. It provides better speed, security, bandwidth utilization etc. Quality of Service is analyzed by changing the value of the precedence bit of the CBR application. The values of the precedence bits that have been taken are 0, 1, 4 and 6. The comparison has been done on the basis of throughput, average end to end delay etc.

Climate change is a reality, and the modern healthcare sector not just contributes towards this grave phenomenon but is itself being affected by it. The present review was thus conducted to understand the meaning of ‘Green Hospital’, to identify the many ways in which health sector is contributing towards climate change, to explore possibilities for countering this grave trend and last of all to look for institutions that are pioneering change. Data for the review was extracted from multiple online sources using the Google search engine. It was found that hospitals, being resource intensive establishments, consume vast amounts of electricity, water, food and construction materials to provide high quality care. It was also found that certain healthcare institutions, by employing simple, smart and sustainable measures can greatly reduce their environmental footprint. But constructing Green Hospitals can be a challenge considering the local conditions and growing customer expectations.

3D-Playfair cipher is a multiple letter encryption cipher. Trigraphs (combination of 3 characters) of the plaintext are treated as single unit and converted into corresponding cipher text trigraphs and vice-versa. Classical Playfair Cipher supports English alphabets with limitation that only one alphabet “i” or “j” will be considered at a time. 3D-Playfair Cipher came into focus to eliminate this limitation. In addition to that 3D-Playfair Cipher also overlooks the limitation of similar fashion encryption of diagrams and its reverse diagrams. 3D-Playfair cipher supports all 26 English alphabets {A-Z}, 10 digits {0–9} and 28 special characters including { ! “ ∗ # $ % & ‘ +, − . / : ; ( ) ? @ [ ] \ ⁁ _ | }. The theme of this research is to enhance the security of text files that contains alphabets, numerals and special characters. In this approach we developed a structure rotation concept on key matrix of 3D-Playfair cipher using random key to achieve the objective. Random sequences are generated through Linear Feedback Shift Register due to its simplicity and better performance.

3D-Playfair cipher is multiple letter encryption cipher. In this, trigraphs of plaintext are treated as single units and converted into corresponding cipher text trigraphs. 3D-Playfair Ciphers originates due to the limitations in classical Playfair as it supports only alphabets and may not support two alphabets at the same time. It also eliminates the fact that a diagram and its reverse will encrypt in a similar fashion. 3D-Playfair cipher supports all 26 alphabets, 10 digits and 28 special characters. The theme of research is to furnish security to data which contains alphabets numerals and special characters during transmission that's why additional bitwise operations are introduced and applied on the cipher text of 3D-Playfair cipher with a random key. Linear Feedback Shift Register is a good candidate for generation of random sequences and is selected for generating random keys for bitwise operations to offer better security to cipher text before transmission over the internet. Here X-OR or X-NOR operations are taken into consideration for the bitwise operations based on the key.

Smart grid technology envisages the use of strategic consumers. With demand for power outstripping supply in most countries, this motivates the need for an incentive compatible and efficient mechanism to allocate inevitable power cuts across consumers. In this paper, we propose (i) a reverse auction mechanism and (ii) a forward auction mechanism that both are designed to allocate the power cuts. These auctions are based on redistribution mechanisms and satisfy dominant strategy incentive compatibility and allocative efficiency. The mechanisms are weakly budget balanced and since they are based on redistribution mechanisms, they lead to reduced budget imbalance. We demonstrate the efficacy of these mechanisms for a typical scenario in Indian power grid operations and subsequently explore the relative performance of the mechanisms in a detailed simulation setting.