Rank: 109 based on 469 downloads (last 30 days) and 47 files submitted

Dimitri Shvorob

E-mail: dimitri.shvorob@gmail.com

Personal Profile:
Professional Interests:

Watch this Author's files

Files
Watch Lists

Files Posted by Dimitri					View all 1 - 5 of 47
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
01 Apr 2009		Order book simulation (a naive artificial stock market) Author: Dimitri Shvorob	order book exchange c...	17	0
29 Mar 2009		The Object of My Callback (object references with Matlab timers) Author: Dimitri Shvorob	timer callback object..., oop	4	0
23 Mar 2009		Scrolling display (price/volume chart) Author: Dimitri Shvorob	timer, event, listener, stock, chart	6	0	5.0 5.0 \| 1 rating
18 Mar 2009		Queue (A simple implementation) Author: Dimitri Shvorob	queue priority collec...	16	4	5.0 5.0 \| 3 ratings
27 Aug 2008		Merge matrices (in a SQL equijoin) Author: Dimitri Shvorob	sql, join, matrices, merge, utilities, matrix manipiltaion	9	3	5.0 5.0 \| 2 ratings

Comments and Ratings by Dimitri		View all 1 - 3 of 3
Updated	File	Comments	Rating
05 Sep 2009	Export data to SAS (via Excel; with SAS/ACCESS and ActiveX Automation Server) Author: Dimitri Shvorob	Apparently, the two-star ranking stems from Alessandro not finding the XLS file. Does anybody else not see it? Please give me a shout.
05 Sep 2009	Import data from SAS (via Excel; with SAS/ACCESS and ActiveX Automation Server) Author: Dimitri Shvorob	Does anybody else not see the spreadsheet? Please give me a shout.
29 Mar 2009	PCA based face recognition This code is PCA base face recognition programme. Author: Gholamreza (Shahab) Anbarjafari	Loop-heavy script by a Matlab novice, adding to a mountain of PCA face-recognition code samples already on FEX.

Comments and Ratings on Dimitri's Files			View all 1 - 5 of 82
Updated	File	Comment by	Comments	Rating
26 Oct 2011	Evaluate Nelson-Siegel function (or fit one to a yield curve) Author: Dimitri Shvorob	aasifalimd
31 Aug 2011	Check your FEX author rank Display and record your FEX statistics Author: Dimitri Shvorob	Teng, Ted P	Haha, great stuff. This can also have other applications, e.g., keeping track of rankings from other websites!
23 Aug 2011	Visualize dynamic hedging (via an interactive GUI) Author: Dimitri Shvorob	Ning
29 Jul 2011	Export data to SAS (via Excel; with SAS/ACCESS and ActiveX Automation Server) Author: Dimitri Shvorob	Marco	Hello: how many rows can be saved in one step? Does Excel constraint the process in any way? MySQL-mediated data transfer would be preferable but I find it very slow to go from SAS to MySQL to Matlab to MySql, especially when I transfer large SAS tables to MySql (over a million rows). Is there a way to speed up the process? do you have any hints? Thanks!!!
26 Jul 2011	Extract text from a PDF document (if you are lucky) Author: Dimitri Shvorob	mathworks2011	V Poor. Does not work. The author even notes it does not work inside the m-file! java.lang.Throwable: Warning: You did not close the PDF Document at org.pdfbox.cos.COSDocument.finalize(COSDocument.java:418) at java.lang.ref.Finalizer.invokeFinalizeMethod(Native Method) at java.lang.ref.Finalizer.runFinalizer(Unknown Source) at java.lang.ref.Finalizer.access$100(Unknown Source) at java.lang.ref.Finalizer$FinalizerThread.run(Unknown Source)

Top Tags Applied by Dimitri	1 - 5 of 142
analysis, finance, modeling, utilities, statistics

Files Tagged by Dimitri					View all 1 - 5 of 46
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
01 Apr 2009		Order book simulation (a naive artificial stock market) Author: Dimitri Shvorob	order book exchange c...	17	0
29 Mar 2009		The Object of My Callback (object references with Matlab timers) Author: Dimitri Shvorob	timer callback object..., oop	4	0
18 Mar 2009		Queue (A simple implementation) Author: Dimitri Shvorob	queue priority collec...	16	4	5.0 5.0 \| 3 ratings
27 Aug 2008		Merge matrices (in a SQL equijoin) Author: Dimitri Shvorob	sql, join, matrices, merge, utilities, matrix manipiltaion	9	3	5.0 5.0 \| 2 ratings
27 Aug 2008		Merge dataset arrays (in a SQL equijoin) Author: Dimitri Shvorob	dataset, sql, join, structures, merge, cell arrays	6	0

Currently Watching
Type	Description
File	Queue
File	Scrolling display
File	The Object of My Callback
File	Order book simulation

Comments and Ratings Matching Dimitri's Watch List			1-5 of 6
Date	File	Comment by	Comments	Rating
24 Jun 2010	Queue (A simple implementation)	Ahmed Gad	Hi, 1- It needed some improvements for pre-allocation before insertion. 2- Priority queue implementation using heaps is much more efficient than the current one. I changed the implementation a bit to consider those two points. I'll post the code to you to change yours instead. Hope it helps. PQueue.m classdef PQueue < Queue % PQueue - strongly-typed Priority Queue collection % % Properties: % % Type (string) % Comparator (function handle, @gt by default) % % Methods: % % PQueue(type) % PQueue(type,comparator) % display % size % isempty % clear % contains(obj) % offer(obj) % remove(obj) % peek - returns [] if queue is empty % poll - returns [] if queue is empty % values - returns contents in a cell array % % Notes: % % Compatible classes must overload eq() for object-to-object comparisons % % Comparator must be defined in the class, or a base class: RedWidget and % BlueWidget objects can be combined if a Widget comparator is defined % % Derived from Queue % % Example: % % q = PQueue('Widget',@gt) % % q.offer(RedWidget(1)) % q.offer(RedWidget(3)) % q.offer(RedWidget(2)) % q.offer(BlueWidget(2)) % q.offer(BlueWidget(2)) % % q.size % q.remove(RedWidget(2)); % q.size % q.remove(BlueWidget(2)); % q.size % % q.peek % q.poll % q.size % % Author: dimitri.shvorob@gmail.com, 3/15/09 % Modified for heap implementation and pre-allocation by: % a[DOT]mounir86@gmailDOTcom, 24/06/2010 properties (SetAccess = protected) Comparator % function handle end methods function[obj] = PQueue(type,varargin) obj = obj@Queue(type); if nargin > 1 obj.Comparator = varargin{1}; else obj.Comparator = @gt; end end function[obj] = offer(obj,e) if length(e) > 1 throw(MException('PQueue:offerMultiple','??? Cannot offer multiple elements at once.')) end if ~isa(e,obj.Type) throw(MException('PQueue:offerInvalidType','??? Invalid type.')) end obj.Elements{obj.lastInd+1} = e; obj.lastInd = obj.lastInd + 1; if(length(obj.Elements) == obj.lastInd) obj.Elements = [obj.Elements obj.Elements]; end currInd = obj.lastInd; parentInd = floor(currInd / 2); while(parentInd ~= 0) if(obj.Comparator(obj.Elements{currInd},obj.Elements{parentInd})) tempElement = obj.Elements{currInd}; obj.Elements{currInd} = obj.Elements{parentInd}; obj.Elements{parentInd} = tempElement; currInd = parentInd; parentInd = floor(currInd / 2); else break; end end end function[out] = poll(obj) if obj.isempty out = []; return; end out = obj.Elements{1}; if(obj.size == 1) obj.lastInd = obj.lastInd - 1; return; end obj.Elements{1} = obj.Elements{obj.lastInd}; obj.lastInd = obj.lastInd - 1; currInd = 1; childInd = currInd * 2; while(childInd <= obj.lastInd) if(childInd + 1 > obj.lastInd) if(~obj.Comparator(obj.Elements{currInd},obj.Elements{childInd})) tempElement = obj.Elements{currInd}; obj.Elements{currInd} = obj.Elements{childInd}; obj.Elements{childInd} = tempElement; currInd = childInd; childInd = currInd * 2; else break; end elseif(obj.Comparator(obj.Elements{childInd + 1},obj.Elements{childInd})) if(~obj.Comparator(obj.Elements{currInd},obj.Elements{childInd + 1})) tempElement = obj.Elements{currInd}; obj.Elements{currInd} = obj.Elements{childInd + 1}; obj.Elements{childInd + 1} = tempElement; currInd = childInd + 1; childInd = currInd * 2; else break; end elseif(~obj.Comparator(obj.Elements{currInd},obj.Elements{childInd})) tempElement = obj.Elements{currInd}; obj.Elements{currInd} = obj.Elements{childInd}; obj.Elements{childInd} = tempElement; currInd = childInd; childInd = currInd * 2; else break; end end end end end Queue.m classdef Queue < handle % Queue - strongly-typed Queue collection % % Properties: % % Type (string) % % Methods: % % Queue(type) % display % size % isempty % clear % contains(obj) % offer(obj) % remove(obj) % peek - returns [] if queue is empty % poll - returns [] if queue is empty % values - returns contents in a cell array % % Notes: % % Compatible classes must overload eq() for object-to-object comparisons. % % Example: % % q = Queue('Widget') % % q.offer(RedWidget(1)) % q.offer(RedWidget(3)) % q.offer(RedWidget(2)) % q.offer(BlueWidget(2)) % q.offer(BlueWidget(2)) % % q.size % q.remove(RedWidget(2)); % q.size % q.remove(BlueWidget(2)); % q.size % % q.peek % q.poll % q.size % % Author: dimitri.shvorob@gmail.com, 3/15/09 % Modified for heap implementation and pre-allocation by: % a[DOT]mounir86@gmailDOTcom, 24/06/2010 properties (GetAccess = protected, SetAccess = protected, Hidden = true) Elements lastInd end properties (SetAccess = protected) Type end methods function[obj] = Queue(type) if ~ischar(type) throw(MException('Queue:constructorInvalidType','??? ''type'' must be a valid class name.')) end obj.Elements = cell(1, 100); obj.lastInd = 0; obj.Type = type; end function disp(obj) disp([class(obj) '<' obj.Type '> (head on top)']) if ~obj.isempty for i = 1:obj.lastInd disp(obj.Elements{i}) end else disp([]) end end function[out] = size(obj) out = obj.lastInd; end function[out] = values(obj) out = obj.Elements{1:obj.lastInd}; end function[out] = isempty(obj) out = obj.size == 0; end function[obj] = clear(obj) obj.Elements = {}; obj.lastInd = 0; end function[out] = contains(obj,e) out = false; for i = 1:obj.size if e == obj.Elements{i} out = true; break end end end function[obj] = offer(obj,e) if length(e) > 1 throw(MException('Queue:offerMultiple','??? Cannot offer multiple elements at once.')) end if ~isa(e,obj.Type) throw(MException('Queue:offerInvalidType','??? Invalid type.')) end if isempty(obj.Elements) obj.Elements = {e}; else obj.Elements{obj.lastInd+1} = e; obj.lastInd = obj.lastInd + 1; if(length(obj.Elements) == obj.lastInd) obj.Elements = [obj.Elements obj.Elements]; end end end function[obj] = remove(obj,e) if length(e) > 1 throw(MException('Queue:removeMultiple','??? Cannot remove multiple elements at once.')) end if ~isa(e,obj.Type) throw(MException('Queue:removeInvalidType','??? Invalid type.')) end if ~isempty(obj.Elements) k = []; for i = 1:obj.size if e == obj.Elements{i} k = [k i]; %#ok end end if ~isempty(k) obj.Elements(k) = []; obj.lastInd = obj.lastInd - length(k); end end end function[out] = peek(obj) if ~obj.isempty out = obj.Elements{1}; else out = []; end end function[out] = poll(obj) if ~obj.isempty out = obj.Elements{1}; obj.Elements(1) = []; obj.lastInd = obj.lastInd - 1; else out = []; end end end end	Comment only
23 Jun 2010	Queue (A simple implementation)	Ahmed Gad	Simple yet powerful. Thanks so much.	5
02 Nov 2009	Scrolling display (price/volume chart)	James		5
22 May 2009	Queue (A simple implementation)	Andrea Tagliasacchi	Good choice for object oriented. However, if you want a generic priority queue which don't assume elements to be Matlab objects refer to my submission.	Comment only
22 May 2009	Queue (A simple implementation)	Andrea Tagliasacchi		5

Contact us at files@mathworks.com