One of the most basic result in circuit complexity is the constnat depth cirdcuit lower bound computing PARITY function using the switching lemma. Another popular function MAJORITY has also lower bound $exp (\Omega (n^{1/(d-1)}))$ and matching upper bound $exp (O (n^{2/(d-1)}))$.My question is about upper bound of Threshold function which is a natural generalization of majority function. The formal definition of the threshold function is the following one. DEFINITION:$THR(x_{1},...,x_{n})=  \begin{cases}    1 & a_{1}x_{1}+\cdots +a_{n}x_{n} \geq t \\    0 & otherwise  \end{cases}$We assume that each weight $a_{i} \in \mathbb{Z}$ is at most $2^{O(n)}$QUESTION1:The depth $d$ circuit with unbounded fanin AND OR NOT gates to compute the above function has size $2^{n^{\epsilon}}$ ?Where $\epsilon $ can depend on $d$ like $2^{n^{1/100d}}$ .QUESTION2Can we $\textit{relax}$ the assumption that   $a_{i} \in \mathbb{Z}$ is at most $2^{O(n)}$ ?For example, even if we assume that  $a_{i} \in \mathbb{R}$ is at most $2^{2^{O(n)}}$ and give the strong power of each threshold gate, does uppwer bounds  $2^{n^{\epsilon}}$  holds ? 
Constant Depth Circuit Computing Threshold Function
cc.complexity theory;circuit complexity