답변 있음
How to remove duplicate nodes from generated path and segments inbetween?
If you have R2015b or newer, there are built-in functions to do this. In particular, <http://www.mathworks.com/help/matlab/ref/g...

10년 초과 전 | 0

답변 있음
Modified Outerjoin function code
This requires a bit more creativity, but this is how I would do it. %% 1. Making the data (see my comment at the end) A ...

10년 초과 전 | 0

답변 있음
Modified version of VLOOKUP for Matlab
You can do this using <http://www.mathworks.com/help/matlab/ref/outerjoin.html OUTERJOIN> . A = table; A.ID = [1;1;2]; ...

10년 초과 전 | 1

| 수락됨

답변 있음
NSP (Nurse Scheduling Problem)
This blog post may be of help: <http://blogs.mathworks.com/loren/2016/01/06/generating-an-optimal-employee-work-schedule-usin...

10년 초과 전 | 2

답변 있음
how can I find the minimum distance from convex boundary
I like Matt J's SVM-based idea. It is actually very straightforward to solve this as a maximum separation problem. Reference:...

거의 13년 전 | 3

문제를 풀었습니다

Increment a number, given its digits
Take as input an array of digits (e.g. x = [1 2 3]) and output an array of digits that is that number "incremented" properly, (i...

거의 13년 전

문제를 풀었습니다

Project Euler: Problem 1, Multiples of 3 and 5
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23...

거의 13년 전

답변 있음
Is there a way to speed up matrix calculations by Parallel Computing Toolbox?
As others have pointed out, this will be difficult to parallelize for a single run, since you are integrating forward in time, a...

대략 13년 전 | 0

| 수락됨

답변 있음
Find all largest empty circles in a list of points
You don't have to try all combinations. You just need to calculate the Delaunay triangulation. Assuming that no 4 points lie on ...

대략 13년 전 | 2

답변 있음
Matlab executable requires 8.1 of MCR
You could also download it yourself here: <http://www.mathworks.com/products/compiler/mcr/index.html> Version 8.1 correspo...

대략 13년 전 | 3

| 수락됨

답변 있음
Remove the spurious edge of skeleton
I think there must be a more efficient way to do it, but this at least works. BWDISTGEODESIC starts at a given point, and then c...

대략 13년 전 | 11

| 수락됨

답변 있음
How to connect points horizontally and vertically in non-rect grid?
Idea 1. Use SURF [x,y] = ndgrid(0:0.1:2); %Just making random data x = sin(x).*y; y = x+y.^2; figure, surf(x,y,z...

대략 13년 전 | 0

| 수락됨

답변 있음
Efficiently multiplying diagonal and general matrices
The best solution is going to depend on what your m and n actually are (if you know representative values of them, you should in...

대략 13년 전 | 1

| 수락됨

답변 있음
Efficiently multiplying diagonal and general matrices
M = randn(10000,10); D = diag(randn(10000,1).^2); tic A = M'*D*M; toc tic B = bsxfun(@times,M,sqrt(dia...

대략 13년 전 | 0

답변 있음
diagonal pixel differences of image matrix
b = [2 1 8 24;9 10 3 12;2 5 8 19;1 2 3 4]; conv2(b,[-1 0; 0 1],'valid')

대략 13년 전 | 1

답변 있음
ODE with diff? DE in x(t), w/ forcing y(t), where y'(t) also appears.
It might seem counterintuitive, but even though y'(t) appears in the ODE, you don't actually need to calculate it. No DIFF, no G...

대략 13년 전 | 1

답변 있음
The advantages of MATLAB over other programing languges for Image Processing
I'm sure I've left a bunch of stuff off this list, but this is what I got off the top of my head. * A very large (and growing...

대략 13년 전 | 2

답변 있음
minimum row value and return the row
Do you mean to say, you want the row with the minimum maximum value? A=[12 64 76; 34 10 27; 9 8 20; 10 30 8]; [value,ind...

대략 13년 전 | 2

| 수락됨

답변 있음
Generate Y from the conditional f(y|x)
If your goal is to generate points with that 3-dimensional PDF, then I think it could be done a bit simpler without having to do...

대략 13년 전 | 1

| 수락됨

답변 있음
Why isn't the autocorrelation of rand a delta function?
As described in detail here, <http://en.wikipedia.org/wiki/Autocorrelation>, there is more than one convention when calculating ...

대략 13년 전 | 1

| 수락됨

답변 있음
Splitting an axis into a linear and log scale
I don't think there's an easy way to do it, but you might be able to piece together two axes to make it look like its half linea...

13년 초과 전 | 4

| 수락됨

답변 있음
Finding vertices of (large) linear program feasible region
For the k-th direction, the set of possible edge points is b./A(:,k) along with +/-Inf. So test each one in order to see if it i...

13년 초과 전 | 0

| 수락됨

답변 있음
Integral with scalar input
For an integrand that can't accept vector inputs, but only take scalar values one by one, you actually need to set ArrayValued t...

13년 초과 전 | 1

| 수락됨

답변 있음
In MATLAB (cumulative distribution function), how can I find the corresponding data point (Y) for any chosen cumulative probability?
Alternatively, you can use ICDF directly on the probability distribution object icdf(pd,[0.2 0.466])

13년 초과 전 | 0

| 수락됨

답변 있음
Nesting parentheses issue: any workaround?
I am in agreement with Jan. I cannot recall a single instance where I needed to use 32 parenthesis for anything. If you really n...

13년 초과 전 | 0

답변 있음
Fit a piece-wise linear function to data: fitting 2 lines to data and finding their corresponding parameters
You data doesn't really look like it has a constant trend at the beginning. In any case, you should still be able to solve it wi...

13년 초과 전 | 0

| 수락됨

답변 있음
Find row in matrix, fast and with special conditions
Not sure if this is faster, but might be worth a try. d1 = 12650; d2 = 4; S = randn(d1,d2); s = S(randi(d1),:); ...

13년 초과 전 | 0

답변 있음
multiplication table in matlab
N = 10 (1:N)'*(1:N)

13년 초과 전 | 4

답변 있음
How to calculate the cumulative value by consequetive hours
data = [1 2 3 4 5 6 7 8]; for n = 2:5 conv(data,ones(1,n),'valid') end This gives me: ans = 3 ...

13년 초과 전 | 1

답변 있음
Perfect random numbers - How can I refine an initial dataset from randn to be perfrectly normal?
If you want to generate a set of numbers that "looks random", has 0 mean, 1 variance, 0 skewness, 3 kurtosis, you can start with...

13년 초과 전 | 2