Blog

Given an AVL tree containing nodes ordered by unique integer I.D’s and data as pointers to some struct, what would be the expected minimum number of elements that will justify the creation and maintenance of the tree? I know this is a broad question so let me give some more details: Say I have theRead more

The context: I have been working lately with problems like the following: Let $ x_{k}\in\mathbb{R}^n$ be a state evolving accroding to: $ $ x_{k+1} = f(x_k,u_k), k=0,\dots,N-1 $ $ given some $ x_0$ and controls $ u_0,\dots,u_{N-1}\in\{1,\dots,L\}$ (the set of possible controls is a finite set of "modes"). The goal is to choose the controlsRead more

At page 21 of this book: https://cs.au.dk/~amoeller/spa/spa.pdf I found this: I started reading everything and understanding it pretty well, until this. It’s defining the possible types of a language. I’m very confused about what theta and alpha mean. What are those meta-variables? What is ua.t and t[ua.t/a]? Could someone give me some context? I’m notRead more

I’m on the Wikipedia page for Hindley-Milner type systems, on the section about “let polymorphism”: https://en.wikipedia.org/wiki/Hindley%E2%80%93Milner_type_system#Let-polymorphism I’m a bit confused on this sentence: Ideally, this would be allowed with any use of a bound variable What does that mean exactly? I’m not following the syntax in this section. Thanks!Read more

Let be $ \Sigma=\{0,1\}$ and $ L$ $ =$ $ \{u \in \Sigma^* :$ $ odd\ number\ of\ 0’s\ and\ odd\ number\ of\ 1’s\}$ . How Can I build a regular expression or an automata for this languaje? I have no idea, and I gess $ L$ is not regular, but I vane’t been ableRead more

Is there a data structure or an algorithm or a combination of both to allow me to filter a set of documents based on the number of missing words (compared to another list)? Problem Definition We have a list of documents $ D = \{d_1, d_2, \dots, d_n\}$ . Each document $ d_i$ consists ofRead more

I implemented the classical non-weighted converged version of HITS algorithm. I create a root set and a base set from the root set and then I applied the HITS algorithm and got the authorities and hubs scores. Then what? I am not sure what to do with this information while I rank the pages. IRead more

I have a basic understanding how operators work (bitwise, logical, unary, ternary, etc.), but I am confused how you define what the operator does so the machine knows how to treat the operator when you use it in your code base. Are operators predefined by the compiler and is there a way for me toRead more

I’m writing a neural network and am having trouble with finding the cost to weight gradient. Supposedly the gradient is given by $ \frac{\partial C}{\partial w^l_{jk}} = a^{l-1}_k \partial^l_j$ but I’m having problems with my matrix dimensions. If $ a^{l-1}$ is of dimensions $ [n^{l-1},1]$ , $ \delta^l$ is of dimensions $ [n^{l},1]$ , andRead more

Monads in category theory is defined by triples T, unit, flat⟩. class Monad t where map :: (a -> b) -> (t a -> t b) — functorial action unit :: a -> t a flat :: t (t a) -> t a class KleisliTriple t where unit :: a -> t a flatMap ::Read more