This work extends the line of research on the hidden number problem. Motivated by studying bit security in finite fields, we define the multivariate hidden number problem. Here, the secret and the multiplier are vectors, and partial information about their dot product is given. Using tools from discrete Fourier analysis introduced by Akavia, Goldwasser and Safra, we show that if one can find th...

in the qur'an, men and women are equal in terms of human dignity and spiritual interest and faith; but god did not speak to women immediately and directly; especially in law verses, god speaks to men directly but he speaks to women as a third person (hidden person). in this paper, this problem has been analyzed in view of divine-social tasks in the quran and it became clear that god has gi...

This paper details a working solution to the longstanding XOR problem as well as several examples of its use in constructing larger networks. Using a specific instance of the generalized delta rule, it solves certain well defined problems in record time. This solution is not without its faults but these almost certainly are outweighed by its advantages. _________________________________________...

In this paper we introduce a graph problem, called Maximum Node Clustering (MNC). We prove that the problem is strongly NP -complete and show that it can be approximated in polynomial time within a ratio arbitrarily close to 2. For the special case where the graph is a tree, we prove that the problem is weakly NP -complete as it generalizes the 0/1 Knapsack problem and is solvable in pseudopoly...

Quality of neural network mappings may be evaluated by visual inspection of hidden and output node activities for the training dataset. This paper discusses how to visualize such multidimensional data, introducing a new projection on a lattice of hypercube nodes. It also discusses what type of information one may expect from visualization of the activity of hidden and output layers. Detailed an...