MESSAGE
| DATE | 2016-11-14 |
| FROM | Ruben Safir
|
| SUBJECT | Re: [Learn] merge sort parallel hw
|
From learn-bounces-at-nylxs.com Mon Nov 14 09:02:48 2016
Return-Path:
X-Original-To: archive-at-mrbrklyn.com
Delivered-To: archive-at-mrbrklyn.com
Received: from www.mrbrklyn.com (www.mrbrklyn.com [96.57.23.82])
by mrbrklyn.com (Postfix) with ESMTP id 396B4161312;
Mon, 14 Nov 2016 09:02:48 -0500 (EST)
X-Original-To: learn-at-nylxs.com
Delivered-To: learn-at-nylxs.com
Received: from [10.0.0.62] (flatbush.mrbrklyn.com [10.0.0.62])
by mrbrklyn.com (Postfix) with ESMTP id 5AA11160E77;
Mon, 14 Nov 2016 00:03:24 -0500 (EST)
To: Bayna Robertson
References: <6714100a-3ebd-8129-b8bc-6d1db3ae59be-at-mrbrklyn.com>
<877f8ccf4h.fsf-at-contrapunctus.net>
<4cc3c62e-0920-4ebd-ad7d-7ebee6432f22.maildroid-at-localhost>
<7c24c78a-f82b-3e6c-9c16-3d62ae034bf3-at-panix.com>
<737f2054-828c-b0d8-2260-6125760687b7-at-my.liu.edu>
<87bmxmw307.fsf-at-contrapunctus.net>
From: Ruben Safir
Message-ID:
Date: Mon, 14 Nov 2016 00:03:24 -0500
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:45.0) Gecko/20100101
Thunderbird/45.4.0
MIME-Version: 1.0
In-Reply-To:
X-Mailman-Approved-At: Mon, 14 Nov 2016 09:02:45 -0500
Subject: Re: [Learn] merge sort parallel hw
X-BeenThere: learn-at-nylxs.com
X-Mailman-Version: 2.1.17
Precedence: list
List-Id:
List-Unsubscribe: ,
List-Archive:
List-Post:
List-Help:
List-Subscribe: ,
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: quoted-printable
Errors-To: learn-bounces-at-nylxs.com
Sender: "Learn"
On 11/11/2016 05:23 PM, Bayna Robertson wrote:
> What are we going to do about the textbook?
Is this it? I think I have one coming.
##- Please type your reply above this line -##
Ruben,
Thank you for your message.
We received your order on October 30 and shipped it directly to you
within 2 business days . Here is the address to which the order was sent:
Ruben I Safir
1580 East 19th Street
Apt 1E
Brooklyn
NY
11230
United States
The post office delivers most standard rate packages in about 8 to 14
business days.
I will escalate this issue with the shipping carrier to find out where
your item currently is, obtain a tracking number, and/or speed up the
delivery process. If I am able to gather any additional information I
will forward it to you.
We do make a full refund available for any items that are lost in the
mail (it's rare, but it does sometimes happen). If this order has not
arrived by 30 days from when the order was placed, please let us know.
- Ann
----------------------------------------------
ruben, Nov 11, 8:57 PM EST
AbeBooks has received the following inquiry.
The following inquiry was provided by this customer: where is it?
Buyer Information:
Name: ruben
Email: ruben-at-mrbrklyn.com
Country: U.S.A.
Title: Introduction To Expert Systems (3rd Edition)
Author: Jackson, Peter
Book ID: ABE_book_usedgood_0201876868
Price: 13.71
Shipping: 0.00
Description: This Book is in Good Condition. Clean Copy With Light Amount o=
=3D
f Wear. 100% Guaranteed. Summary: In May 1997, IBM' s Deeper Blue defeated =
=3D
the world chess champion Gary Kasparov, showing that an artificial intellig=
=3D
ence system can outplay even the most skilled of human experts. Since the f=
=3D
irst expert systems appeared in the late sixties, we have seen three decade=
=3D
s of research and development engineer human knowledge to more practical en=
=3D
ds, in a pioneering effort that has integrated diverse areas of cognitive a=
=3D
nd computer science. Today, expert systems exist in many forms, from medica=
=3D
l diagnosis to investment analysis and from counseling to production contro=
=3D
l.This third edition of Peter Jackson' s best-selling book updates the tech=
=3D
nological base of expert systems research and embeds those developments in =
=3D
a wide variety of application areas. The earlier chapters have been refocus=
=3D
ed to take a more practical approach to the basic topics, while the later c=
=3D
hapters introduce new topic areas such as case-based reasoning, connectioni=
=3D
st systems and hybrid systems. Results in related areas, such as machine le=
=3D
arning and reasoning with uncertainty, are also accorded a thorough treatme=
=3D
nt. The new edition contains many new examples and exercises, most of which=
=3D
are in CLIPS, a language that combines production rules with object-orient=
=3D
ed programming. LISP, PROLOG and C++ are also featured where appropriate. I=
=3D
nteresting problems are posed throughout, and are solved in exercises invol=
=3D
ving the analysis, design and implementation of CLIPS programs. This book w=
=3D
ill prove useful to a wide readership including general readers, students a=
=3D
nd teachers, software engineers and researchers. Its modular structure enab=
=3D
les readers to follow a pathway most suited to their needs, providing themw=
=3D
ith an up-to-date account of expert systems technology. Key Features 50 pag=
=3D
e appendix devoted to the CLIPS programming language, which is used as the =
=3D
main vehicle for examples and exercises New coverage includes
Order Date: October 30, 2016
Sales Order Number: 105487067
Purchase Order Number: 130466731
Please respond to the buyer's inquiry within two business days.
Thank you,
Your AbeBooks Team
[JPER05-K07K]
> On Friday, November 11, 2016, Christopher League t>
> wrote:
> =
>> Ruben Safir ruben.safir-at-my.liu.edu
>> writes:
>>
>> but pos2 and pos3 *change* throughout the merge loop. What you=E2=80=99re
>> comparing them to is supposed to stay fixed.
>>
>> where?
>>
>> Here=E2=80=99s the code you had:
>>
>> for(i =3D 0; i < length; i++)
>> {
>> if(pos1 < pos2 && ( pos2 =3D=3D pos3 || max(in[pos1], in[pos2]) =3D=
=3D in[pos1]))
>> {
>> space[i] =3D in[pos1];
>> pos1++;
>> }
>> else
>> {
>> space[i] =3D in[pos2];
>> pos2++;
>> }
>> }
>>
>> Obviously, pos2 is changing throughout that loop, because it says pos2++.
>> (This has nothing to do with the recursion.) In the if, what you=E2=80=
=99re
>> comparing pos1 to should stay the same.
>>
>> Here it is with my bug fix:
>>
>> for(i =3D 0; i < length; i++)
>> {
>> if(pos1 < left+mpt && ( pos2 =3D=3D right || max(in[pos1], in[pos2]) =
=3D=3D in[pos1]))
>> {
>> space[i] =3D in[pos1];
>> pos1++;
>> }
>> else{
>> space[i] =3D in[pos2];
>> pos2++;
>> }
>> }
>>
>> The pos1 and pos2 are indeed =E2=80=9Ccursors=E2=80=9D working through t=
he two lists.
>> Both of them move. The pos1 gets to the end of its list when it equals
>> left+mpt. The pos2 gets to the end of its list when it equals right.
>>
>> CL
>>
> =
-- =
So many immigrant groups have swept through our town
that Brooklyn, like Atlantis, reaches mythological
proportions in the mind of the world - RI Safir 1998
http://www.mrbrklyn.com
DRM is THEFT - We are the STAKEHOLDERS - RI Safir 2002
http://www.nylxs.com - Leadership Development in Free Software
http://www2.mrbrklyn.com/resources - Unpublished Archive
http://www.coinhangout.com - coins!
http://www.brooklyn-living.com
Being so tracked is for FARM ANIMALS and and extermination camps,
but incompatible with living as a free human being. -RI Safir 2013
_______________________________________________
Learn mailing list
Learn-at-nylxs.com
http://lists.mrbrklyn.com/mailman/listinfo/learn
|
|
