AN INTERLOCKING MECHANISM FOR STACKING MULTIPLE DEBIT/CREDIT CARDS

The present disclosure provides an interlocking mechanism for organizing or arranging plurality of cards together. In the interlocking mechanism, a recess or groove is provided on one side of the card. On the other side of the same card, the recess may appear as a protrusion. To organize the cards, one or more cards may be brought together on top of each other such that the protrusion of one card may be aligned with the recess of the other card. Once aligned, the cards may be stacked together by inserting the protrusion of one card into the recess of the other card. The stack of cards formed in this manner will bind the cards together such that there is no chance to lose or drop any cards unless the user intends to do so. Notably, the user may conveniently carry the plurality of cards as a block

CREDIT CARD WITH DYNAMIC CREDIT RATING DISPLAY

The present disclosure relates to a method, system and payment card for dynamically displaying credit rating. As such, credit related information and transaction information of a cardholder associated with a payment card is received from an issuer server. The credit related information and transaction information of the cardholder are used for predicting one or more behavioural parameters associated with the cardholder. Further, the one or more values are used for determining a credit rating of the cardholder. The credit rating of the cardholder may be displayed on the payment card or cardholder device or on any merchant device facilitating transaction for the cardholder

A GLOBAL ATM LOCATOR AND A METHOD THEREOF

The present disclosure is related to a global Automated Teller Machine (ATM) locator and a method thereof. The method includes receiving, by a global ATM locator, a request message from an electronic device of a user for details related to a nearest ATM. The global ATM locator initiates an API call to a payment network provider associated with the global network provider to fetch the information related to the nearest ATM for the user, as per the information given in the request message and current location of the user. Thereafter, the global ATM locator receives the requested details related to the nearest ATM such as balance amount, denominations of the balance amount, location of the ATM, wheelchair accessibility at the ATM, depositing capability at the ATM, access fee of the ATM and the like. The received information is provided to the user such that can make an informed decision about which ATM to visit for performing desired financial operations. Further, the present disclosure enables the user to query a global ATM locator to receive information related to not just the nearest ATM, but also other details such as balance amount in the ATM, working status of the ATM, wheelchair accessibility at the ATM, depositing capability at the ATM, Access fee/transaction fee of the ATM, and the like without the need to physically visit the ATM center. Therefore, the present disclosure enhances user experience, eliminates the time and resources involved in the tedious process of searching for an ATM center for performing certain financial operations, and also reduces delays in the financial operations that can be performed through the ATM

METHOD AND SYSTEM FOR IMPLEMENTING HAPTIC SURFACES IN PAYMENT CARDS

The present disclosure relates to a technique for implementing haptic surfaces in the payment cards to facilitate convenient operation by visually impaired users. The technique involves embedding a suitable power source on the payment card and storing the electrical energy from the power source within the card such that whenever the power button is switched ON, the electrical energy flows from the stored source to the haptic surface enabled digits embedded on the payment card so as to bubble-out the haptic surface enabled digits. These bubbled-out digits may be easily read by the cardholder by touching the popped-up surface. When the electrical current stops, the bubbled-out surface deflates and goes flat. This ensures the convenient and effective reading of card details by the cardholder while ensuring financial security and privacy of the user

BIOMETRIC AUTHENTICATION FOR PAYMENT TRANSACTIONS

The present disclosure relates to system and method of authenticating online payment transactions. The method includes receiving a payment transaction request from a mobile device 110. Upon receiving the payment transaction request, a digital payment system 120 transmits a request for user’s biometric data for performing biometric authentication. Upon receiving the user’s biometric data from the mobile device 110, the digital payment system 120 compares the received biometric data with the user’s biometric data stored in a memory. If the biometric data matches, the digital payment system 120 approves the transaction and a notification is sent to the mobile device. The proposed method may help visually impaired users to authenticate payment transactions using the biometric means. Further, the proposed method also helps to reduce fraudulent transactions

Can We Run in Parallel? Automating Loop Parallelization for TornadoVM

With the advent of multi-core systems, GPUs and FPGAs, loop parallelization has become a promising way to speed-up program execution. In order to stay up with time, various performance-oriented programming languages provide a multitude of constructs to allow programmers to write parallelizable loops. Correspondingly, researchers have developed techniques to automatically parallelize loops that do not carry dependences across iterations, and/or call pure functions. However, in managed languages with platform-independent runtimes such as Java, it is practically infeasible to perform complex dependence analysis during JIT compilation. In this paper, we propose AutoTornado, a first of its kind static+JIT loop parallelizer for Java programs that parallelizes loops for heterogeneous architectures using TornadoVM (a Graal-based VM that supports insertion of @Parallel constructs for loop parallelization). AutoTornado performs sophisticated dependence and purity analysis of Java programs statically, in the Soot framework, to generate constraints encoding conditions under which a given loop can be parallelized. The generated constraints are then fed to the Z3 theorem prover (which we have integrated with Soot) to annotate canonical for loops that can be parallelized using the @Parallel construct. We have also added runtime support in TornadoVM to use static analysis results for loop parallelization. Our evaluation over several standard parallelization kernels shows that AutoTornado correctly parallelizes 61.3% of manually parallelizable loops, with an efficient static analysis and a near-zero runtime overhead. To the best of our knowledge, AutoTornado is not only the first tool that performs program-analysis based parallelization for a real-world JVM, but also the first to integrate Z3 with Soot for loop parallelization

Real‐time time‐dependent density functional theory using density fitting and the continuous fast multipole method

An implementation of real‐time time‐dependent density functional theory (RT‐TDDFT) within the TURBOMOLE program package is reported using Gaussian‐type orbitals as basis functions, second and fourth order Magnus propagator, and the self‐consistent field as well as the predictor–corrector time integration schemes. The Coulomb contribution to the Kohn–Sham matrix is calculated combining density fitting approximation and the continuous fast multipole method. Performance of the implementation is benchmarked for molecular systems with different sizes and dimensionalities. For linear alkane chains, the wall time for density matrix time propagation step is comparable to the Kohn‐Sham (KS) matrix construction. However, for larger two‐ and three‐dimensional molecules, with up to about 5,000 basis functions, the computational effort of RT‐TDDFT calculations is dominated by the KS matrix evaluation. In addition, the maximum time step is evaluated using a set of small molecules of different polarities. The photoabsorption spectra of several molecular systems calculated using RT‐TDDFT are compared to those obtained using linear response time‐dependent density functional theory and coupled cluster methods

Teaching NeuroImages: Reversible neuroimaging findings during treatment of infantile spasms with vigabatrin

A 10-month-old boy with global developmental delay presented to clinic with a few months of infantile spasms occurring multiple times a day. His seizures continued despite vigabatrin (dosed at 133 mg/kg/d), levetiracetam, and steroid therapy. On vigabatrin, routine follow-up MRI showed abnormal signal change , which may occur in 30.9% of patients.1 Risk is associated with a high peak dose but not cumulative.2 These findings are largely asymptomatic although rarely patients can present with hyperkinetic disorders.2 The imaging findings resolved on 4-month follow-up after tapering vigabatrin. At 18 months of age, the patient continues to have 1 seizure every 2 weeks

A Comparison of the Accuracy of Maples and Rice and Newly Derived Formula for Age Estimation: A Forensic Study

Aims and objectives: The aim of the study was to study the physiological changes of teeth according to the Gustafson’s criteria by obtaining a new linear regression formula andcompare it with Maples and Rice formula for age estimation. Materials and methods: Total of 70 cases who visited the department of oral and maxillofacial surgery for extraction weretaken in the study for teeth collection and the age of the patients was noted. The following dental parameters were studied in each case; attrition, periodontal disease, cementum apposition, secondary dentine deposition, root translucency and root resorption. Total scores of different parameters were plotted against the total score were plotted and regression formula obtained and by the use of this formula ages were estimated. Maples and Rice formula was also applied in the same scores and ages estimated. Results: On comparing the means of both the calculated age and the actual age, it was observed that the difference between them was statistically significant except in the age group of > 70 years age group. On calculating the age mean error was found to be ± 4.52 and for Maples and Rice it was ± 6.43.&nbsp

Push-out bond strength of different endodontic obturation material at three different sites : in-vitro study

The key to success of any root canal therapy is adequate obturation of the prepared root canal space. Root canal sealers are not dimensionally stable and might dissolve partially over a period of time. The objective of this in vitro study is to evaluate the push-out bond strength to intraradicular dentin of two endodontic obturation materials. Forty extracted single rooted permanent teeth were used. Canals orifice was explored, teeth were instrumented. The samples were divided into two groups each containing twenty specimens obturated with different obturation material (Group1 Epiphany/Resilon and Group 2 Gutta Percha/AH Plus).The obturation systems used in this study was Element Obturation unit (Sybron Endo). Each tooth root was horizontally sectioned in approximately 2-mm thick slices from the coronal 1/3rd, middle 1/3rd and apical 1/3rd. The push-out bond strength of each specimen was calculated using Universal Testing Machine. The statistical analysis was done using two way analysis of variance (ANOVA) and tukey?s test. There was significant difference between push out bond strength of Resilon/Epiphany and AH Plus/Gutta Percha. Gutta percha group was superior with push out bond strength of 2.22 (± 0.16) Mpa in comparison to Resilon/Epiphany group with 1.61 (±0.14) Mpa (p<0.001). The interfacial bond strength achieved with Resilon/Epiphany self-etch (SE) to intraradicular dentine was not superior to that of AH Plus/Gutta Percha