f



#1 #n+1 #2n+1 #2 #n+2 #2n+2 #3 #n+3 #2n+3 #n #2n #3n #1 #2 #3 #n #n+1 #n+2 #n+3 #2n #2n+1 100 Gbps aggregate stream of 64/66b words virtual lane markers virtual lane 1 virtual lane 2 virtual lan

#1
#n+1
#2n+1
#2
#n+2
#2n+2
#3
#n+3
#2n+3
#n
#2n
#3n
#1
#2
#3
#n
#n+1
#n+2
#n+3
#2n
#2n+1
100 Gbps aggregate stream of 64/66b words
virtual lane markers
virtual lane 1
virtual lane 2
virtual lane 3
virtual lane n
Simple 66-bit word level
round robin distribution
Transmit PM
Transmit PM
Receive PM
Receive PM
Transmit PC
Receive PC
1
0.0
1.0
0.1
0.2
0.3
1.2
1.2
1.1
0.0
1.0
0.1
1.1
2.0
3.0
4.0
6.0
7.0
9.0
10.0 11.0
12.0 13.0
14.0 15.0
17.0
18.0
19.0
2.0
3.0
4.0
5.0
6.0
7.0
8.0
9.0
10.0
11.0
12.0
13.0
14.0
15.0
16.0
17.0
18.0
19.0
0.0
0.1
8.0
16.0
5.0
13.0
2.0
10.0
18.0
7.0
15.0
2.1
4.0
12.0
1.0
9.0
17.0
4.1
6.0
14.0
3.0
11.0
19.0
6.1
8.0
5.0
16.0
VL0
VL1 VL2
0.0
1.0
0.1
1.1
2.0
3.0
4.0
5.0
6.0
7.0
8.0
9.0
10.0
11.0
12.0
13.0
14.0
15.0
16.0
17.0
18.0
19.0
0.0
1.0
0.1
0.2
0.3
1.2
1.2
1.1
2.0
3.0
4.0
6.0
7.0
9.0
10.0 11.0
12.0 13.0
14.0 15.0
17.0
18.0
19.0
8.0
5.0
16.0
VL19

identified and reported.
2:1
0 10
2:1
1 11
2:1
2 12
2:1
3 13
2:1
4 14
2:1
5 15
2:1
6 16
2:1
7 17
2:1
8 18
2:1
9 19
1:2
1:2
1:2
1:2
1:2
1:2
1:2
1:2
1:2
1:2
Transmit P
Receive P
PMAtor
PMAtor
PMDoor
PMDoor
Virtual_Lanes
Electrical_Lanes
Optical_Lanes
Electrical_Lanes begin transit transmit... .... transmitting...
0
marty.musatov (1143)
6/5/2012 4:03:48 PM
comp.theory 5139 articles. 0 followers. marty.musatov (1143) is leader. Post Follow

0 Replies
1515 Views

Similar Articles

[PageSpeed] 51

Reply:

Similar Artilces:

[1 1 1 1 1 ;2 2 2 2 2 ;3 3 3 3 3 3;....;n n n n n]
Hi, Anybody knows how to create this matrix but without using any loops? a=[1 1 1 1 1 ;2 2 2 2 2 ;3 3 3 3 3 ;.......;n n n n n ] Thank you. Hana. Hana wrote: > Hi, > Anybody knows how to create this matrix but without using any loops? > a=[1 1 1 1 1 ;2 2 2 2 2 ;3 3 3 3 3 ;.......;n n n n n ] HELP REPMAT - Randy Hana wrote: > > > Hi, > Anybody knows how to create this matrix but without using any > loops? > a=[1 1 1 1 1 ;2 2 2 2 2 ;3 3 3 3 3 ;.......;n n n n n ] > > Thank you. > Hana. Hope this isn't homework. >> repmat([1:n]'...

[0 0 1 1 2 2 3 3 4 4 ... n n]
Is there a way to achieve a vector like the one below without using loops? [0 0 1 1 2 2 3 3 4 4 ... n n] "Ulrik Nash" <uwn@sam.sdu.dk> wrote in message <kp999d$a8e$1@newscl01ah.mathworks.com>... > Is there a way to achieve a vector like the one below without using loops? > > [0 0 1 1 2 2 3 3 4 4 ... n n] You could try this: floor(0:1/rep:n+1-1/rep) where rep is the number of repetitions (2 in your case) Hi, a cool way to do that is using the kronecker product kron(0:n,[1 1]); "Ulrik Nash" <uwn@sam.sdu.dk> wrote in message <kp999d$a8e$1@newscl01ah.mathworks.com>... > Is there a way to achieve a vector like the one below without using loops? > > [0 0 1 1 2 2 3 3 4 4 ... n n] There is another way to achieve that. Do this like the following: >> n=7; u(1:2:2*n+1)=0:n; >> u(2:2:2*n+2)=0:n; The array u seems to be what you want. ...

how to "(1-3*x^2)/(1-3*x+x^2+2*x^3) => 1/(1-2*x) + x/(1-x-x^2)"?
hi normal(1/(1-2*x) + x/ (1-x-x^2),expanded); 1/(1-2*x) + x/(1-x-x^2) => (1-3*x^2)/(1-3*x+x^2+2*x^3) how to do the reverse? dillogimp@gmail.com writes: > normal(1/(1-2*x) + x/ (1-x-x^2),expanded); > 1/(1-2*x) + x/(1-x-x^2) => (1-3*x^2)/(1-3*x+x^2+2*x^3) > how to do the reverse? convert(%,parfrac,x); -- Joe Riel ...

Newbie question; why (cons (list 1 2) (list 3 4)) is ((1 2) 3 4) and not ((1 2) (3 4))
Hi, I just started to learn LISP, and stumbled in SICP upon (cons (list 1 2) (list 3 4)) is evaluated to ((1 2) 3 4) I do not understand why this is not: ((1 2) (3 4)) because (cdr (cons (list 1 2) (list 3 4))) is (3 4) and (car (cons (list 1 2) (list 3 4))) is (1 2) Is there a logical explanation? Thank you for your patience. -- Greg Out of order, gregor <gregor@ediwo.com> writes: > Is there a logical explanation? Yes. > I just started to learn LISP, and stumbled in SICP upon But first, let's talk about LISP, Lisp, Scheme and Common Lisp. LISP is the name of the programming language invented in 1959 by John McCarthy and of the first program implementing it written amongst other by Steve Russel, one of his students. LISP 1.5 is a segueing version of that same program dating about 1962 that had some distribution. Then various lisp languages were developed at various places by various teams. Names such as MacLisp, InterLisp, LeLisp, StandardLisp, vLisp, Lisp Machine Lisp, Scheme, GNU Emacs Lisp, etc. It was quite a mess, and people had a hard time sharing programs. So they talked and designed and wrote and voted and produced the ANSI Common Lisp standard (in the USA), meanwhile in Europe they produced the ISO Lisp standard. Nowadays, almost all the other lisps are "dead", with only scheme (current version r5rs, r7r...

Meaning of 1:1, 1:1 generalization, 1:n, 1:n non identifying, n:m
Hi All, I've been taking a look at DB Designer 4, and looking through the documentation (http://www.fabforce.net/dbdesigner4/doc/index.html) I am a little unclear on some of their nomenclature: '1:1' - Ok, one to one. Got it. '1:1 generalization' - Don't know this. Obviously different somehow from one to one, but how? '1:n' - One to many, I assume. '1:n non identifying' - Nonidentifying? What does this mean? 'n:m' - Many to many? Again, not sure. Can anyone help clarify? Thanks! -Josh Joshua Beall wrote: > I...

HoldForm[1*2*3] should give 1 x 2 x 3 not 2 x 3
HoldForm[] is loosing the 1* when it apparently should not: In[1]:= HoldForm[1*2*3] Out[1]= 2 x 3 In[2]:= HoldForm[1*1*1] Out[2]= 1 x 1 x 1 In[3]:= HoldForm[3*2*1] Out[3]= 3 x 2 In[4]:= HoldForm[2*2*2] Out[4]= 2 x 2 x 2 In[5]:= HoldForm[2*1*3] Out[5]= 2 x 3 In[6]:= HoldForm[1*2] Out[6]= 1 x 2 In[7]:= HoldForm[1*2*1] Out[7]= 1 x 2 x 1 Q.E.D. Indeed, the same happens with Hold and HoldComplete. I'd say this is a bug. Cheers -- Sjoerd On Feb 25, 11:07 am, "Q.E.D." <a...@netzero.net> wrote: > HoldForm[] is loosing the 1* when it...

How to get the FFT cycles: N>8 Tcycle = 3N/2-2 + log2(N)*(N/2+3);
Hi, I use Simulink FFT block to generate HDL code. The help says: N>8 Tcycle = 3N/2-2 + log2(N)*(N/2+3); I see that it uses 4 multipliers in the butterfly. I would like to know the meaning of the above equation. 3N/2-2 is the prelog? For each cyle, what is the cycle number? It uses 4 DPRAM. I guess that it should have a number account for the DPRAM cycles, some delay register cycles, but I cannot find that number in the above eqaution. Could you help me? Thanks, ...

Re: [tao-bugs] Increase in IFR Service footprint
Hello again, Something just occurred to me. Version 1.3.1 may have pre-dated some other changes to the IFR that would certainly explain the increase in runtime footprint you are referring to. Back in December, I changed the query dispatch mechanism in the IFR from servant locator to default servant, to optimize the performance. This new mechanism creates 30-odd servants and a POA for each at IFR startup time. This was done last December. Also, regarding the possible memory leaks - these servants and POAs have their lifetimes tied to the IFR, so any Purify checks must shut down the IFR gracefully to be accurate. Sorry for the confusion at first. Jeff "Simon McQueen" <sm@prismtechnologies.com> wrote in message news:<3F2656AB.2050208@prismtechnologies.com>... > TAO VERSION: 1.3.3 > ACE VERSION: 5.3.3 > > HOST MACHINE and OPERATING SYSTEM: > Win 2k > > COMPILER NAME AND VERSION (AND PATCHLEVEL): > Visual C++ 6 SP 5 dynamic debug build. > > AREA/CLASS/EXAMPLE AFFECTED: > Interface Repository > > DOES THE PROBLEM AFFECT: > COMPILATION? > No. > LINKING? > No. > EXECUTION? > Yes. > > SYNOPSIS: > I've been looking at a leak in 1.3.1 for a customer and whilst I was > checking against the latest CVS to see if the fix needed forward porting > I happened to notice that t...

building GCC 3.3.2 or 3.2.3 on Unixware 7.1.1
Has anybody done this successfully? I'm running into problems with the C++ library. AFAICT, the compiler is built ok (bootstrapping all succeeds), but the C++ library chokes. It seems to mostly be complaining about the 'volatile' keyword in pthread.h. I'm using binutils, btw. The ccs based build fails to bootstrap for me. Best regards, Brent Brent Eagles wrote: > Has anybody done this successfully? > > I'm running into problems with the C++ library. AFAICT, the compiler is > built ok (bootstrapping all succeeds), but the C++ library...

simple clipping to +-(2^n) or +-(2^n-1)?
Hi all, I searched the web and didn't find anything useful, but is there some trick to clip a signed int to, say, +-15 or +-16, maybe using some bit pattern processing? Best regards, Andre On Wed, 14 Jan 2015 15:33:21 +0100, Andre <lodwig@pathme.de> wrote: >Hi all, > >I searched the web and didn't find anything useful, >but is there some trick to clip a signed int to, say, >+-15 or +-16, maybe using some bit pattern processing? > >Best regards, > >Andre if (x(n) > UpperLimit) x(n) = UpperLimit; if (x(n) < LowerLimit) ...

[1,2,3] exactly same as [1,2,3,] ?
x=[1,2,3] and x=[1,2,3,] are exactly the same, right? I'm generating some python data, and it's less error prone to not treat the last element specially, but I want to be sure I'm generating an equivalent data structure. Many TIA! Mark -- Mark Harrison Pixar Animation Studios mh@pixar.com wrote: > x=[1,2,3] > and > x=[1,2,3,] > > are exactly the same, right? When confronted with this type of question, I ask the interpreter: {{{ mac:~ pmcnett$ python Python 2.5.2 (r252:60911, Feb 22 2008, 07:57:53) [GCC 4.0.1 (Apple Computer, Inc. build 5363)] on darwin Type ...

why (1, 2, 3) > [1, 2, 3] is true?
I tired to google for comparison of tuple to list but i failed. Could anyone explain it to me? Best regards, fat bold cyclop fat bold cyclop, 25.02.2010 14:00: > I tired to google for comparison of tuple to list but i failed. > > Could anyone explain it to me? Both are not equal, so the comparison returns an arbitrary result in Py2. Note that this was fixed in Py3: Python 3.1.1+ (r311:74480, Nov 2 2009, 15:45:00) [GCC 4.4.1] on linux2 Type "help", "copyright", "credits" or "license" for more information. >>> (1,2,3) > [1,2,3]...

if time = 3 seconds, how do i set the values of the time steps 0,0.1,0.2,0.3,0.5,1.0,1.5,2.0,3.0,5.0 to -9999 from time =3 seconds
Hi &nbsp; I have 18 inputs (arrays) which contain certain statistics and if time&nbsp;&nbsp;= 3 seconds, set the values of time step 5.0 to -9999.0. &nbsp; I was wondering if there is an efficient way to do this without using a lot of case statements? &nbsp; Thank you. Hello AdrianT, it's not really clear to me what you want to do... I suspect: you have an array containing values and you want to output them with a fixed timing of 3 seconds: you should use a for loop autoindexing trough your array and sending the value to your indicator/output/whatever. Put a "wait for next multiple" into your for loop. Or do you want to have a minimum time delay of 3 seconds? Again use a for loop, get the time value and use a InRange&amp;Coerce with minimum set to 3 seconds... Or you should explain more precisely what you need... Hi Thanks for that. Let me explain. &nbsp; The time may vary. Let me give an example. if time&nbsp; = 2.1, I want to set the time step's &nbsp;3.0 and 5.0's values to -9999.0. if the time =0.1 seconds then I want to set 0.2,0.3, 0.5 etc values to -9999.0 etc .................................................................... &nbsp; Can you please help? Thank you. Hello TUDS, do you use different accounts/nicknames ? Well, that's easy, at least for a sorted array: Search for your time-value in the array (Threshold 1D array). Fill all elements from that index till the end with your "error...

Re: vector[m,1] vector[n,1] matrix[m,n] #2
I think that's called an outer product: mv = Array[m, {5}] nv = Array[n, {3}] {m[1], m[2], m[3], m[4], m[5]} {n[1], n[2], n[3]} Outer[Times, mv, nv] {{m[1] n[1], m[1] n[2], m[1] n[3]}, {m[2] n[1], m[2] n[2], m[2] n[3]}, {m[3] n[1], m[3] n[2], m[3] n[3]}, {m[4] n[1], m[4] n[2], m[4] n[3]}, {m[5] n[1], m[5] n[2], m[5] n[3]}} Bobby On Fri, 28 Jan 2011 05:11:09 -0600, EF <he.frauendorfer@t-online.de> wrote: > Hi, > > is there a "simple kernel based" routine to do the scalar product of two > one dimensional vectors, producing the m...

Conjecture: 2n+1= 2^i+p ; 6k-2 or 6k+2 = 3^i+p
I have a conjecture: Any odd positive number is the sum of 2 to an i-th power and a (negative) prime. 2n+1 = 2^i+p for example: 5 = 2+3 9=4+5 15=2^3+7 905=2^12-3191 .... as to 2293=2^i +p ,I don't know i , p . it is sure that i>30 000 if the conjecture is correct. More, n = 3^i+p, (if n=6k-2 or n=6k+2) for example:8 = 3+5 16=3^2+7 100=3+97, 562 = 3^6 -167 I can't proof this. Do you have any idea? While I think questions like these may be great fun, I feel that they don't belong in this forum as long as they are not connected with Mathematica. I ...

Problem installing matplotlib 1.3.1 with Python 2.7.6 and 3.3.3 (release candidate 1)
Hello, I tried to install matplotlib 1.3.1 on the release candidates of Python 2.7.6 and 3.3.3. I am on Mac OS X 10.6.8. Although the installation gave no problems, there is a problem with Tcl/Tk. The new Pythons have their own embedded Tcl/Tk, but when installing matplotlib it links to the Frameworks version of Tcl and TK, not to the embedded version. This causes confusion when importing matplotlib.pyplot: objc[70648]: Class TKApplication is implemented in both /Library/Frameworks/Python.framework/Versions/2.7/lib/libtk8.5.dylib and /Library/Frameworks/Tk.framework/Versions/8.5/Tk. One of the two will be used. Which one is undefined. objc[70648]: Class TKMenu is implemented in both /Library/Frameworks/Python.framework/Versions/2.7/lib/libtk8.5.dylib and /Library/Frameworks/Tk.framework/Versions/8.5/Tk. One of the two will be used. Which one is undefined. objc[70648]: Class TKContentView is implemented in both /Library/Frameworks/Python.framework/Versions/2.7/lib/libtk8.5.dylib and /Library/Frameworks/Tk.framework/Versions/8.5/Tk. One of the two will be used. Which one is undefined. objc[70648]: Class TKWindow is implemented in both /Library/Frameworks/Python.framework/Versions/2.7/lib/libtk8.5.dylib and /Library/Frameworks/Tk.framework/Versions/8.5/Tk. One of the two will be used. Which one is undefined. And then later it gives a lot of error messages. So I think it should be linked to the embedded version. For this the matplotlib setupext.py should be ad...

MuPAD bugs: sum(1/n!, n= 1..n)
Dear SciFace, It looks like there is an infinite loop in MuPAD 3.1. Your product returns instantly correct answers to the following sums sum(n, n= 1..n); sum(1/n, n= 1..n); sum(1/2^n, n= 1..n); 1/2*n*(n + 1) EULER + psi(n + 1) 1 - (1/2)^n However, if the user makes an attempt to calculate sum(1/n!, n= 1..n); MuPAD 3.1 keeps running after 40,000 seconds. Secondly, clicking at the Stop button produces no effect, and the only way to continue the calculations is to save the notebook and restart it. The same bug manifestation is present in MuPAD 3.0. We enjoy MuPAD over years and have not a vestige of doubt that your analysts will localize the origin of the problem soon. Best wishes, Cyber Tester http://www.cybertester.com/ http://maple.bug-list.org/ http://www.CAS-testing.org/ .................................................................. ...

[RELEASED] Python 3.2.4 rc 1 and Python 3.3.1 rc 1
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On behalf of the Python development team, I am pleased to announce the first release candidates of Python 3.2.4 and 3.3.1. Python 3.2.4 will be the last regular maintenance release for the Python 3.2 series, while Python 3.3.1 is the first maintenance release for the 3.3 series. Both releases include hundreds of bugfixes. There has recently been a lot of discussion about XML-based denial of service attacks. Specifically, certain XML files can cause XML parsers, including ones in the Python stdlib, to consume gigabytes of RAM and swamp the CPU. These releases do not include any changes in Python XML code to address these issues. Interested parties should examine the defusedxml package on PyPI: https://pypi.python.org/pypi/defusedxml These are testing releases: Please consider trying them with your code and reporting any bugs you may notice to: http://bugs.python.org/ To download Python 3.2.4 or Python 3.3.1, visit: http://www.python.org/download/releases/3.2.4/ or http://www.python.org/download/releases/3.3.1/ respectively. Enjoy! - -- Georg Brandl, Release Manager georg at python.org (on behalf of the entire python-dev team and all contributors) -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.19 (GNU/Linux) iEYEARECAAYFAlFRRIoACgkQN9GcIYhpnLD6jACgnzYdYRKZ4kwkKeN3zSLSZ3Zr M/IAn17vlpxI3a3xk+i/ODOrCkMnRZro =B5sA -----END PGP SIGNATURE----- ...

[RELEASED] Python 3.2.4 rc 1 and Python 3.3.1 rc 1
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On behalf of the Python development team, I am pleased to announce the first release candidates of Python 3.2.4 and 3.3.1. Python 3.2.4 will be the last regular maintenance release for the Python 3.2 series, while Python 3.3.1 is the first maintenance release for the 3.3 series. Both releases include hundreds of bugfixes. There has recently been a lot of discussion about XML-based denial of service attacks. Specifically, certain XML files can cause XML parsers, including ones in the Python stdlib, to consume gigabytes of RAM and swamp the CPU. These releases do not include any changes in Python XML code to address these issues. Interested parties should examine the defusedxml package on PyPI: https://pypi.python.org/pypi/defusedxml These are testing releases: Please consider trying them with your code and reporting any bugs you may notice to: http://bugs.python.org/ To download Python 3.2.4 or Python 3.3.1, visit: http://www.python.org/download/releases/3.2.4/ or http://www.python.org/download/releases/3.3.1/ respectively. Enjoy! - -- Georg Brandl, Release Manager georg at python.org (on behalf of the entire python-dev team and all contributors) -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.19 (GNU/Linux) iEYEARECAAYFAlFRRIoACgkQN9GcIYhpnLD6jACgnzYdYRKZ4kwkKeN3zSLSZ3Zr M/IAn17vlpxI3a3xk+i/ODOrCkMnRZro =B5sA -----END PGP SIGNATURE----- ...

LaTex equation numbering like 2.1, 2.2, also 2.0.1, 2.0,2, 2.1.1, etc
David Roach wrote: > Is there a simple command to have latex number > the equations by the section numbers automatically. > > David From the LaTeX Companion (what a wonderful book!) %%%%%%%%%%%%%%%%%%%%%% % number equations within sections % In preamble \makeatletter \@addtoreset{equation}{section} \makeatother \renewcommand{\theequation}{\thesection.\arabic{equation}} %%%%%%%%%%%%%%%%%%%%%% Numbers within sections...I use this all the time in articles. Even works with ******************* ******************* Brilliant. And then I got numbering within subsections by repeating and editing (not replacing), so I now have:- (Just after the documentClass command) \makeatletter \@addtoreset{equation}{section} \makeatother \renewcommand{\theequation}{\thesection.\arabic{equation}} \makeatletter \@addtoreset{equation}{subsection} \makeatother \renewcommand{\theequation}{\thesubsection.\arabic{equation}} Bob Bob Marlow schrieb: > David Roach wrote: > >> Is there a simple command to have latex number >> the equations by the section numbers automatically. >> >> David > > From the LaTeX Companion (what a wonderful book!) > > %%%%%%%%%%%%%%%%%%%%%% > > % number equations within sections > % In preamble > > \makeatletter > \@addtoreset{equation}{section} > \makeatother > \renewcommand{\theequation}{\thesection.\arabic{equation}} > > %%%%%%%%%%%%%%%%%%%%%% [more code] > Hi! I th...

1.1, 1.2, 1.3 are all goners now
It seems, well, it doesn't seem but it is, well, it seems that the subject version of Workbenches won't be any more these, versions of Workbench, but versions of Amix. The Amiga's go for the Network. :-)) Have you seen that CDTV on amiga.jorg? That kind od schalametry for games, like some high tech heavily classic games will be played... Heyyyaaa!!! p.s. some piece of equipment, eh.. CD, floppy, installable HD, all, joysticks, joypads for CDTV, playing CDs and playing games. It's like you'll need a high class massive wood shelf for this, the CDs and for the - :( r...

Re: [tao-bugs] Increase in IFR Service footprint
Hi Simon, > Yes, I'm sure the footprint of the IFR has gone up, since I recently > added support for components, events, and valuetypes. However, I > haven't yet had time to do more than make sure it all builds ok - no > debugging or testing yet. I'm currently dividing my time between two > other projects, so I'd welcome fixes or patches from anyone who has > the time and inclination. This would something where PrismTech could really help us out by handling some of the QA and enhancements for the IFR! Thanks, Doug ...

Help construct a tree 1 -> 1.1 -> 1.2 -> 2 -> 2.1 -> 2.1.1 etc HELP !!!!!!!
Folks I need help. I have a view or(Text file) as follows: '1 2.1 1.1.1 1.1.1.1 2.2.1 1.3 2 Dim Parent() As String Dim Level1() As String Dim Level2() As String Dim Level3() As String etc .. How can I construct a tree. parent, children, grand children etc... and also figure out # of children # of grand children etc Thanks "Mos" <lndebug@gmail.com> wrote in message news:875cd1df-7605-45ab-9f7b-f1edec25d47b@r34g2000vbi.googlegroups.com... > Folks I need help. I have a view or(Text file) as follows: > > '1 > 2.1 > 1.1.1 > 1....

Help construct a tree 1 -> 1.1 -> 1.2 -> 2 -> 2.1 -> 2.1.1 etc HELP !!!!!!!
Borland Guru's I need help I have a text file as follows: 1 2 1.1 1.1.1 3.3 2.3 etc I cannot use a control active x tree I need to read this file and 1 is a parent 1.1 is a child of parent 1 and 2 is a parent 2.3 is a child of parent 2 and construct in search a way using arrays or probably a recursive function No xml parsing just read a file. Does any body have a function "Mos" <lndebug@gmail.com> wrote in message news:c1aaeb20-3c1f-408d-9986-bb8d28a87509@s31g2000vbp.googlegroups.com... > I have a text file as follows: > 1 > 2 > 1.1 >...

Web resources about - #1 #n+1 #2n+1 #2 #n+2 #2n+2 #3 #n+3 #2n+3 #n #2n #3n #1 #2 #3 #n #n+1 #n+2 #n+3 #2n #2n+1 100 Gbps aggregate stream of 64/66b words virtual lane markers virtual lane 1 virtual lane 2 virtual lan - comp.theory

Aggregate (rocket family) - Wikipedia, the free encyclopedia
The A1 was the first rocket design in the Aggregate series. It was designed in 1933 by Wernher von Braun in a Wehrmacht (German armed forces) ...

Facebook Measurements James Dailey, Aggregate Knowledges Rob Gatto Discuss Cross-Publisher Measurement ...
James Dailey of Facebooks measurement team and Aggregate Knowledge President Rob Gatto are featured in a 15-minute video discussion on the Facebook ...

Aggregate Conference (@aggregateconf) on Twitter
Log in Sign up You are on Twitter Mobile because you are using an old version of Internet Explorer. Learn more here Aggregate Conference @ aggregateconf ...

Aggregate Demand Shock (& Depression) - YouTube
VOICE NARRATOR: The 2007 to 2008 economic crash caused a big demand shock, a sudden subtraction of money from demand. Supply shocks and demand ...

Bulk aggregate metadata 'should be monitored'
Scott Ludlam says that the data retention bill is 'broken' and the problem is that 'access is warrantless.'

Aggregate Knowledge's Matt Curcio Says Cool Data Isn't Always the Right Data
... and computational neuroscience Matt Curcio had grown tired of academic life. The chief scientist at media intelligence and analytics firm Aggregate ...

Neustar Acquires DMP Aggregate Knowledge For $119M
In its first digital marketing acquisition since buying TargusInfo in 2011, Neustar has acquired data management platform Aggregate Knowledge ...

Neustar Buys Aggregate Knowledge, One of Facebook's Ad Tech Favorites, for $119 Million Cash
iStockphoto - dny59 Neustar, which makes most of its money managing databases for phone companies, is buying Aggregate Knowledge, an analytics ...

Socially Aggregate The News To Fit Your Needs With Wavii AppAdvice
Love the news, but only want content tailored for you, and a way to share it with others? Wavii brings a social aspect to getting your news. ...

News.Me app gets supports from publishers, aggregates popular news for a small price
Today, News.Me , a subscription-based aggregator developed by Betaworks and The New York Times Company, has hit the Apple iTunes store, providing ...

Resources last updated: 3/25/2016 10:52:05 AM