Floating point arithmetic is widely used in many areas especially scientific computation and signal processing. The main objective of this paper is to reduce the power consumption and to increase the speed of execution and the implementation of floating point multiplier using sequential processing on the reconfigurable hardwareFloating Point (FP) addition, subtraction and multiplication are wid...

in this study, optimized adaptive neuro-fuzzy inference system (oanfis) was employed on a set of daily, weekly, 10-days and monthly data of inflow water into the alavian dam to predict the real-time inflow of the reservoir. sequential and exhaustive search algorithms were used to determine the numbers and time steps of the model inputs and also reducing the prediction’s errors. in sequential se...

As core counts continue to grow in modern microarchitectures, automatic parallelization technologies are becoming increasingly important to fill the gap between hardware that has increased parallelism and software that is still designed for sequential execution. In previous research, we have proposed a novel dynamic binary parallelization scheme called T-DBP, which leverages hot traces to provi...

Millions of people search daily for movies, music, and books on the Internet. Unfortunately, non-personalized exploration of items can result in an infeasible number of costly interaction steps. We study the problem of efficient, repeated interactive search. In this problem, the user is navigated to the items of interest through a series of options and our objective is to learn a better search ...

In this study, we calculate the sensitivity reach on vector leptoquark (LQ) $U_1$ at experiments proposed in Forward Physics Facility (FPF), including FASER$\nu$, FASER$\nu2$, FLArE (10 tons), and (100 tons) using neutrino-nucleon scattering ($\nu N \rightarrow \nu N'$ $\nu l N'$). We cover a wide mass range of $10^{-3}$ GeV $\leq M_{LQ}\leq 10^4$ GeV. The new result shows that offers best to L...

Before the search it is impossible to predict how many looks will be necessary to locate the target. A policy is a plan of search that tells where the nth look will be made--should it be necessary. For any policy, if P ( k ) is the probabil i ty tha t the target is found on or before the kth look, C(]c) is the total cost of the first k looks, and C is the random total cost, then the expectation...

Searchable symmetric encryption (SSE) has been widely applied in the encrypted database for queries practice. Although SSE is powerful and feature-rich, it always plagued by information leaks. Some recent attacks point out that forward privacy which disallows leakage from update operations, now becomes a basic requirement any newly designed schemes. However, subsequent search operations can sti...