0
votes
0answers
2 views

How to create a debugger for Windows processes

My goal is to create an application that will help me debug/profile my software (that was compiled in C#/.NET) in a GUI representation, with the following requirements: When a function is called, ...
0
votes
0answers
6 views

How to exclude all points adjacent to a given point from the feasible region of IP

Consider a basic integer program such as: $$\begin{align} \min_x & \quad c^Tx \\ \text{s.t.} & \quad Ax \leq b \\ &\quad x_i \in \{-100,\ldots,100\} \end{align} $$ where $x \in ...
2
votes
0answers
13 views

What are the conditions that make the A* algorithm optimal over the other unidirectional search algorithms

I was wondering as what are the specific conditions which make the A* algorithm - optimal in terms of the node expansion over the other Unidirectional algorithms: When the same heuristic ...
0
votes
0answers
5 views

I read that by increasing block size in cache memory miss rates decreses as spatial locality is exploited.

Please explain how does first miss rate reduce by increasing block size and then after some point it increases like a bath tub curve?
3
votes
1answer
9 views

Why is pure literal elimination absent in DPLL-based algorithms like Chaff?

I'm looking into various SAT-solvers and trying to understand how they work and why they are designed in certain ways. (But I'm not in a university at the moment and I do not know anyone who is a ...
0
votes
0answers
14 views

Algorithm to solve an optimization problem for non-homogenous poisson process with unknow distribution

Jobs arrive at an M/M/1 type server according to an non-homogenous Poisson process with rate parameter $\lambda_k$. Where $\lambda_k$ and $\mu_k$ denotes the arrival rate and service rate at $k_{th}$ ...
4
votes
1answer
18 views

Data General MV/8000 virtues of “No mode bit”

I'm reading Tracy Kidder's "The Soul of a New Machine" where a team at Data General design a new machine (codenamed "Eagle", later named MV/8000). It is 32-bit extension of a previous architecture ...
-1
votes
0answers
10 views

Difference between fixed and dynamic priority scheduling

What are differences between fixed and dynamic priority scheduling? For example how you tell RMS from EDF scheduling models and what do they differ at when it comes to scheduling them (in a single ...
-3
votes
0answers
11 views

How can be calculated DAG (Directed Acyclic Graphic)? [on hold]

How can be calculate DAG (Directed Acyclic Graphic) is there any software required to calculate or else be manual way to calculate. If the manual way to calculate.what are the required steps.and also ...
-2
votes
0answers
15 views

Survey data not too many, want to go forward [on hold]

I have proposed in the case of Phd research a step by step software pattern-based design approach (step 1: do this, step 2: do that, etc.) and need to validate it now. My validation process is ...
2
votes
0answers
24 views

Proof that P is closed against switching between polynomially related encodings

Lemma 34.1 Let $Q$ be an abstract decision problem on an instance set $I$, and let $e_1$ and $e_2$ be polynomially related encodings on $I$. Then, $e_1(Q)\in \mathrm{P}$ if and ...
8
votes
2answers
271 views

Kleene star operation on the empty language

In my text book it is mentioned that: $\emptyset^*=\{\epsilon\}$ where $\emptyset$ is an empty language. However, we know that $L \cdot \emptyset = \emptyset$, where $L$ is any Language. I am not ...
-1
votes
0answers
16 views

Methods for comparing software design approaches

In the case of my Phd I have proposed a pattern-based e-learning software development approach. I want to compare my framework, and its relevant patterns, to others similar frameworks existing. Do ...
2
votes
0answers
9 views

The meaning of discount factor on reinforcement learning

After reading of the google deepmind achievements on Atari's games, I am trying to understand the q-learning and q-networks, but I am little bit confused. The confusion arise in the concept of the ...
1
vote
0answers
30 views

How is the problem of sorting in contiguous runs called?

I am having a bit of brain fail and I can't remeber the name of the following problem (so I can find some literature around it...). Given a sequence of values, sort it in a way that equal elements ...
2
votes
1answer
29 views

Are there other interpretations of |G| than |V|, that is |V(G)|?

This may be a basic question, but I'm hoping someone can settle this nagging doubt I'm having. I'm reading up on FPT complexity using a book by Downey and Fellows. It has some introductory examples ...
1
vote
2answers
31 views

How to read BNF syntax of C?

Today I heard of BNF which is a language for languages. Also heard that it specifies the entire syntax of C in four pages. So I thought of checking it out. After reading through this page, I got a ...
2
votes
1answer
18 views

Resource Request for a “Most Similar Vector Problem” on an Integer Lattice?

I am currently working on problem that I think could be expressed as an integer lattice problem, and hoping to find some guidance on this forum. Given $u \in \mathbb{R}^n$ and a bounded integer ...
1
vote
1answer
25 views

Maximum bipartite matching when some nodes must be matched

Consider the problem of finding a maximum cardinality bipartite matching under the additional condition that some set $S$ of nodes (all lying on the same side of the bipartition) must be matched. ...
5
votes
1answer
39 views

Can an Earley Parser be made into a fuzzy parser similar to the Levenshtein Automata Algo for DFA?

There's a way to perform fuzzy parsing (accepts strings even with typos to a certain edit distance), with a DFA and a run-time constructed Levenshtein Automata of the input word. Can something ...
-1
votes
0answers
17 views

zero-one goal programming algorithms - any new development?

I am trying to solve zero-one goal programming problem (media buying problem) and I am searching for the relevant algorithms but it seems to me that the development of algorithms (both for binary goal ...
1
vote
2answers
26 views

Do Approximation Algorithms Analyzed in the Worst Case?

From wikipedia: For some approximation algorithms it is possible to prove certain properties about the approximation of the optimum result. For example, a $ρ$-approximation algorithm $A$ is ...
8
votes
5answers
3k views

What are the simplest examples of programs that we do not know whether they terminate?

The halting problem states there is no algorithm that will determine if a given program halts. As a consequence, there should be programs about which we can not tell whether they terminate or not. ...
2
votes
1answer
122 views

Is there a more efficient algorithm than backtracking/dynamic programming?

Consider the following game: One day a castle is attacked at sunrise (by surprise) by n soldiers. Each soldier carries a canon and a rifle. The castle has strength s. On the first day each ...
0
votes
0answers
23 views

Computer Science Major [on hold]

Programming is my thing, and 99.9%, I would take computer science as my major in college (which is 3 years from now). AP courses are coming, and I'm curious of what I should take. I have already ...
1
vote
1answer
21 views

What are algorithms for computing contours from given edges?

Let's say I have a set of edges which makes the contour, however there are too many of them and some are too long. I have to remove edges, and shorten them to make contour. I cannot add new edges! I ...
0
votes
1answer
15 views

Getting the essential from the fundamental matrix

Is it possible to get E from F? I suppose that can't work, because then I could calculate the the extrinsic (and maybe also intrinsic?) parameters of the cameras without a calibration object of known ...
2
votes
1answer
7 views

Fundamental and essential matrices, value of intrinsic parameters

I observe a scene with two cameras, c1 and c2, that produce two images i1 and i2, respectively. What I ultimately want to do is to use information of image i1 and image2 simultaneously, e.g., for ...
-2
votes
0answers
12 views

C program - structure variable data packing and alignment [on hold]

What will be the output of the program on a 32-bit machine (using GCC)? Explain. ...
0
votes
0answers
16 views

Introduction to Artificial Intelligence [on hold]

I adore artificial intelligence and all of its applications. However, I have a very basic and theoretical knowledge of it. I'm looking to get more well versed and even start working on complex ...
1
vote
3answers
159 views

If recursive Fibonacci is $O(2^N)$ then why do I get 15 calls for N=5?

I learned that recursive Fibonacci is $O(2^N)$. However, when I implement it and print out the recursive calls that were made, I only get 15 calls for N=5. What I am missing? Should it not be 32 or ...
0
votes
0answers
28 views

How to make quick sort recursive? [migrated]

Currently I am trying to make a recursive quick sort. There are many different methods for quick sort but for my method, I have to take the first element of the array and always use the first element ...
-1
votes
1answer
25 views

Find variance within one pass

Given a list of real numbers. Is it possible to find the variance with no more than 1 iteration with constant space complexity? My intuition is that it is not possible. But how do I prove it ...
1
vote
0answers
17 views

How does one calculate the block-sensitivity of a function?

I am looking at this paper : http://arxiv.org/pdf/1411.3419v1.pdf But somehow I am not being able to fish out a method to calculate this quantity called the "block-sensitivity". Can someone kindly ...
10
votes
2answers
134 views

When is the concatenation of two regular languages unambiguous?

Given languages $A$ and $B$, let's say that their concatenation $AB$ is unambiguous if for all words $w \in AB$, there is exactly one decomposition $w = ab$ with $a \in A$ and $b \in B$, and ambiguous ...
1
vote
1answer
15 views

Calibration and overlay of RGBD with a thermal camera

I have a thermal camera that I would like to overlay automatically to the output of a RGBD camera (e.g., Kinect). I can retrieve the intrinsic parameters of the thermal camera by using a special ...
-1
votes
0answers
15 views

What is a 4-way parallel algorithm? [on hold]

What is the definition of a 4-way (or 8-way) parallel algorithm? What means 4-way? How can we implement such an algorithm?
-2
votes
0answers
30 views

I need Help please [on hold]

Consider the following designs (All memory accesses are in terms of bytes, and all are using paging techniques): Characteristic Design 1 Design 2 Design 3 Physical ...
0
votes
2answers
74 views

Train Neural network with infinite amount of data [on hold]

Does a sufficiently complex neural network guarantee to find the optimal solution, given an infinite amount of data and the back propagation technique for training? In other words, given an infinite ...
-3
votes
0answers
13 views

Min/Max Depth of a binary tree [on hold]

Is the Min Depth of this tree 2, because of the distance of leaf node "9"? Is the Max Depth if this tree 4, because of the distance of leaf node "2"?
0
votes
1answer
29 views

Bringing images into alignment

I observe a scene with two cameras, c1 and c2, that produce two images i1 and i2, respectively. What I now want is to bring i1 and i2 into alignment, that is I want to know where pixel (x,y) in i1 is ...
-1
votes
0answers
5 views

What should I study next? [on hold]

I have completed my BE in CS and currently working as DBA but I love to study further so what should I do next that will help me to grow in my career?
3
votes
0answers
41 views

What is the simplest written language to work on in handwriting recognition?

Handwriting recognition is an important but very complicated domain of Computer Sciences. Computers nowadays do a quite fair job even if there is room for improvement in the future. I am wondering if ...
11
votes
5answers
3k views

Why is a quantum computer not capable of solving more problems than a classical computer?

On the Wikipedia page for quantum algorithm I read that [a]ll problems which can be solved on a quantum computer can be solved on a classical computer. In particular, problems which are ...
4
votes
0answers
66 views

Does this data structure already exist, and is there a better alternative?

Consider a polymorphic Haskell function type, like the type for .: (a -> b) -> (b -> c) -> a -> c This type ...
1
vote
1answer
33 views

What does pre-, post- and in-order walk mean for a n-ary tree?

The tree traversal methods explained in this Wikipedia article are pre-order, post-order and in-order. Are these methods limited to binary trees? The algorithm seems to be defined in terms of left and ...
3
votes
3answers
39 views

Is there any meaning behind the classification of “λ-terms” in classes such as “church number” and “church list”?

λ-calculus terms can be informally/intuitively categorized, such as: (λ f x . (f (f (f x))))) is a church natural (3) ...
1
vote
1answer
20 views

Shaefer's Dichotomy Theorem [duplicate]

Could you please resolve a confusion with Schaefer's theorem for me? Namely, why does it not imply many problems in P are NP-complete? For example, primality testing surely cannot be reduced to one of ...
0
votes
0answers
50 views

What are the basics? [on hold]

I am learning programming and whenever i hear terms like memory dump , dram , shaders , kernel , architecture. i have no idea what they mean. is there a book or article on basics about what term is ...

15 30 50 per page