text
stringlengths
454
608k
url
stringlengths
17
896
dump
stringclasses
91 values
source
stringclasses
1 value
word_count
int64
101
114k
flesch_reading_ease
float64
50
104
Namespaces can play a major role in maintaining credibility and handling of company documents. With the addition of a namespace and mosaics, the Apostille system becomes even more robust as it allows a sort of watermark on the updates, which provide proof that this update came from the actual company claimed. Let's say you are a co-signer with your partners. You have a multisig account which owns the NEM namespace "your.biz" You place an announcement on your official website which states that you own "your.biz". Your customers see this announcement and can now be assured that any notarized documents which contain “your.biz” is a legitimate document originating from your company. Furthermore, if you or your multisig account owns a namespace, you can brand your message for others with account access to view. Another good idea is to create a mosaic under that namespace to be used as proof of originality and send it along with a message, thus verifying the Apostille notarization a second time. Lastly, interested third parties auditing the document and verifying it, may also send messages or mosaics to say that the document has undergone third-party verification.
http://docs.nem.io/en/nanowallet/apostille-module/use-of-namespaces
CC-MAIN-2018-47
refinedweb
196
52.19
TCEA State Programming Contest April 28, 2001 Problem 2.6 Scientific Notation General Statement: Read a number in scientific notation and output its equivalent decimal value. Input: All data is on a single line. The first integer indicates how many pairs of numbers follow. The first of each pair is A, the base number, and the second is E, the power of 10. Output: Round each answer to 2 decimal places. Trailing zeros to the right of the decimal point are required. A leading zero to the left of the decimal point is not required. The output is to be formatted exactly like that for the sample output given below. Assumptions: E is in the range –10 .. 10. A is 1 or larger but less than 10. Discussion: If A = 3.926 and E = 4, the number represented is 3.926 X 104 or 39260, which is 39260.00 when rounded to 2 decimal places. Sample Input: 4 4.296 3 3.8 -2 1.8 2 2.8678 1 Sample Output: 4296.00 0.04 180.00 28.68 Solutions: #include <stdio.h> #include <math.h> int main () { int dataSet; scanf ("%d", &dataSet); while ( dataSet-- ) { double base; scanf ("%lf", &base); int power; scanf ("%d", &power); printf ("%.2lf\n", base * pow (10, power) ); } return 0; }
https://tausiq.wordpress.com/2009/08/04/scientific-notation/
CC-MAIN-2017-30
refinedweb
215
79.97
On 04/04/2016 07:43 AM, Alberto Garcia wrote: > Currently, block jobs can only be owned by root nodes. This patch > allows block jobs to be in any arbitrary node, by making the following > changes: > > - Block jobs can now be identified by the node name of their > BlockDriverState in addition to the device name. Since both device > and node names live in the same namespace there's no ambiguity. > > - The "device" parameter used by all commands that operate on block > jobs can also be a node name now. > > - The node name is used as a fallback to fill in the BlockJobInfo > structure and all BLOCK_JOB_* events if there is no device name for > that job. Having more than one way to name a job might be okay for convenience, but only if the canonical name is unambiguous. I agree with Kevin's concern that using the device and/or node name as the canonical name of the job is worrisome, because it locks us into having only one job with that name at a time. > +++ b/docs/qmp-events.txt > @@ -92,7 +92,7 @@ Data: > > - "type": Job type (json-string; "stream" for image streaming > "commit" for block commit) > -- "device": Device name (json-string) > +- "device": Device name, or node name if not present (json-string) On the surface this sounds okay (you are promising to return a canonical name, insofar as job canonical names are currently the node/device name until the time that we allow job ids with multiple jobs per device) - even if it means that you return a device name when the user started a job based on a node name. But I'm also worried about jobs where the node name tied to a device changes over time (creating a snapshot, pivoting to a mirror, doing an active commit with a pivot to the backing file - all of these are cases where the device name stays the same, but the top node name associated with the device differs over time). If the device name is the canonical one, then a job started on node "A" but reported as device "D", needs to STILL be known as job "D" even if by the end of the job node "A" is no longer associated with device "D" (because "D" is now serving the top-level node "B"). > @@ -1513,7 +1513,7 @@ > # the operation is actually paused. Cancelling a paused job automatically > # resumes it. > # > -# @device: the device name > +# @device: the device or node name of the owner of the block job. We aren't consistent on whether to use a trailing '.'. I don't care enough to standardize on a style, so no need to respin for just that. -- Eric Blake eblake redhat com +1-919-301-3266 Libvirt virtualization library signature.asc Description: OpenPGP digital signature
https://lists.gnu.org/archive/html/qemu-devel/2016-04/msg04621.html
CC-MAIN-2018-05
refinedweb
468
62.01
Agenda See also: IRC log <ht> Scribe: Henry S. Thompson <ht> ScribeNick: ht (Dave O, TVR to attend by 'phone late afternoons) SW: Scribe schedule: M p.m. NM; T a.m. RL, T p.m. NW; W a.m. DC RESOLUTION: to approve minutes 13 Sep <DanC_lap> (I couldn't find a decision to meet in November when I looked, actually. I suppose it doesn't matter much.) SW: We have an f2f booked for November, but no venue or date for the next one NM: DO has suggested Feb/Mar in Vancouver DC: I am renewing a bid for Venice -- Massimo Marchiori would host <DanC_lap> <DanC_lap> TBL: an idea: Monterey, adjacent to TED 29/2--1/3 HT: 3--5 March I have to be in Tokyo, travel either side ... but my term ends before then TBL: How about 26-27 Feb? ... in Vancouver? SW: HST and TVR (elected); NM and DC (appointed) terms end 31 Jan 2008 <scribe> ACTION: Stuart to pursue Feb Vancouver hosting offer via WBS, pbly for 3 days [recorded in] RL: I've gotten lots of good feedback on this ... Both Pat Hayes and Roy Fielding have gotten involved ... The problem in part is terminological -- the distinction between HTTP 'resource' and WebArch 'resource' hasn't been well drawn TBL: Roy Fielding, either in his thesis or the HTTP spec., wasn't particularly formal about terminology RL: What I mean by HTTP:resource is the definition in the HTTP spec. of 'resource' NM: Some of those produce 200 when you do a GET, and sometimes you get a 303, and then whether the URI identifies a resource or not is unclear <DanC_lap> [[ resource A network data object or service that can be identified by a URI, as defined in section 3.2. Resources may be available in multiple representations (e.g. multiple languages, data formats, size, and resolutions) or vary in other ways. ]] RL: In section 1.3 Terminology we have a defnition of a network data object or service NM: Does this cover only http: URIs? NW: No, section 3.2 makes clear it covers URL, URN, ... -- any scheme RL: So I was trying to define two terms in the draft -- I'm using 'web resource' for the meaning from WebArch and 'web presence' for the HTTP/1.1 meaning HST: What about the original definition of "a resource is anything that can be named by a URI" SW: That's in the URI spec. TBL: I'm not so interested in old definitions, because they were often not framed in very strict ways ... The distinction between inf. res. and res. which we articulated in WebArch was hard-won, and does have the crispness we need RL: So I think we left something out of WebArch, which is what I've called 'web presence', which is what responds e.g. 302 when you GET a non-inf. res. ... This is what I've called a 'web presence' NM: What about 404? RL: That's the one thing that's not a web presence, it's the lack of one NM: What kind of thing is it? DC: Is there a definition in the draft? RL: No, not really -- examples and discussions NM: It feels like a state of being RL: That's sort of right -- it could be a piece of code, or some server configuration -- it's the result of someone _doing_ something so that doing a GET on a particular URI will not respond 404 SW: It's an aspect of web infrastructure ... Partly addresses Pat's complaint of the distinction between what you access to find out about Mars and Mars itself ... Pat wants us to distinguish more carefully between access and identify as operations/terms RL: Looking for an architecture level description of what someone does when they mint a URI, whetehr <Zakim> ht, you wanted to follow up on 'what someone does' <Zakim> DanC_lap, you wanted to ask that we please tell the straightforward story of "doc#term means whatever term refers to as used in doc, by analogy to one paper importing a term by HST: I really like this idea of what it is someone does, once, so that thereafter something which used to produce a 404 now produces something else (useful) DC: I really want this document to focus on the simple questions of what doc#term means ... and how people should choose URIs SW: The original motivation was RL: to take the short email Roy Fielding sent about our closing of httpRange-14 and write it up in detail DC: Then how can the issue be closed? [unminuted process discussion] <DanC_lap> ("core issue decided" is just silly if what's written down doesn't satisfy the community) <DanC_lap> actually, fragmentInXML-28 SW: What issue should we address a) the 300 responses and b) the # issues under? TBL: I think the # question is important -- there are lots of uses of it both in RDF and HTML and there's a lot of confusion and misunderstanding ... We can and should write a finding to explain how this all works, to help the communities which are struggling <Zakim> Noah, you wanted to say we shouldn't talk too much about the deployment mechanics <DanC_lap> (issue 57 is somewhat timely w.r.t. the WebAPI XHR work) NM: I am worried that the draft is a bit too broad -- not clear to me what the focus was ... a lot of stuff about things you might like to learn about interacting with the Web ... but it didn't really work for me, a mixture of things that are right, things that are not quite right and things that are wrong ... It needs a set of goals, to focus discussion on how the document actually addresses the goals RL: I had a set of goals, which I guess didn't come through -- focussed on explaining what it could mean to interact with non-information resources NM: I'm worried that the overlap with the existing IETF RFCs isn't managed well -- in particular, 2616 RL: Well, we did say in our SF meeting that we would include the response codes <Zakim> ht, you wanted to add indirection identification to the pile <DanC_lap> (hmm... indirect identification... I'd like more clarity on that, though I can imagine it would cost a lot to get there) <Zakim> DanC_lap, you wanted to suggest looking at redirections in the XHR spec HST: I hope we will include indirect identification in any attempt to provide an overview about designing URIs, including when to use # <Norm> Yes, 303 is weak practically, if not theoretically DC: There is an opportunity, in the context of XMLHttpRequest, to revise the way redirects are exposed through standard library APIs NM: So you're saying the code reflects a narrower understanding of how the Web should be working, and the opportunity is here to try to fix this DC: For example, if you have a relative URI to resolve against a redirected base TBL: SemWeb is worrying about that <Zakim> Norm, you wanted to say that in retrospect, we shouldn't attempt to redefine the return codes DC: GRDDL has a 5-page appendix, which says, briefly "Resolve against the result of redirection" NW: It is a mistake to try to redefine what the response codes mean <DanC_lap> NW: The most we can say about 303 is that we are using an existing technology in a particular way RL: I put section 4.3 to implement what I understood the group to be asking for, so we could decide if we really mean it NW: Right, and now that I've seen it I think we were wrong, and it should come out <Zakim> timbl, you wanted to ask whether Dan wan ted a tutorial (rather than judgement) about hash, and to suggest we do worked examples in HTML and RDF. NW: We can say we use it in such and such a way, but we can't say what it _means_ -- that's for the RFC TBL: An issue on what # means, or a tutorial to tell people? DC: Issue 28 is good enough for me (# in XML) TBL: Not good enough for me -- in a tutorial, I can say using Planets#Mars to identify Mars can work w/o ever doing a GET, and someone responds "Without doing a GET, how do I know what the media type is, w/o which I don't know what a fragid means" NM: I didn't understand your take on that until you explained it to me at a f2f, roughly, that in the _absence_ of a media type there are general principles I can appeal to DC: It's best if you have a media type and a resource and that gives the same answer, but you can live w/o it <DanC_lap> DC: you can get information about what a URI identifies from various places; it's best when they agree TBL: Working here on WebArch fed well into the redraft of the URI spec -- maybe the same thing would work for the proposed redraft of the HTTP spec. . .. SW: How about the Cool URIs for the SemWeb document -- that seems like a good start on a "how to design URIs" document ... Any progress on ACTION-43, TBL? <scribe> ACTION: [WITHDRAWN] on Tim Berners-Lee to Find the paper that he annotated on the plane (and transcribe comments on "Cool URIs for the Semantic Web"). ACTION-43 [recorded in] SW: # w/o content-type? You can work backwards from what must have been the minter's intent <Zakim> DanC_lap, you wanted to note "cool URIs" is headed for /TR/ DC: The SemWeb Cool URIs spec is officially believed to be on our queue, for TAG review before it goes to REC ... It's getting exposure, and we should take on reviewing it SW: I have sent reviews on behalf of the TAG on an earlier draft DC: So we should be reviewing the new draft, to see if they did what we asked <DanC_lap> (I find 9.8.2007 ) <DanC_lap> (sort linked from ) <Stuart> <DanC_lap> ( I also find ... date pending... ) <DanC_lap> <DanC_lap> 14 Feb <DanC_lap> 14 Sep 2007 , says HTTP last-modified Last line says "1.1 Revised Version 9.8.2007. Changes based on TAG review." <Noah> Asking about <Norm> I found Dan's suggestion of projecting it and doing a group review somewhat appealing SW: ACTION: TBL to review the 14 Sep draft of the Cool URIs for the SemWeb document on behalf of the TAG and bring the comments back to the TAG <Noah> Was it officially on behalf of the TAG? Ah, first signature says from Stuart, 2nd says Stuart for the TAG. Sorry, missed that. NW: I will try to review it, but I also like the idea of a group review from a projected view SW: Shall we carry this over, or stick with the agenda ... that is, we could pull the review of action statuses forward, to give us time tomorrow for a projected review. . . [Coffee Break] [resumed] SW: So RL would like us to use some of 'his' time to look at the SWCoolURIs doct, in case it influences the treatment of his draft NM: Let's not leave w/o coming back to Rhys's draft for disposition https: //gnowsis.opendfki.de/repos/gnowsis/papers/2006_11_concepturi/html/cooluris_sweo_note.html TBL: The discussion of URI/URL in the intro is at best misleading -- they shouldn't use URL at all DC: I think this speaks to the audience NM: Doesn't the latest RFC move away from URLs? DC: Yes, that's what this para. is about ... deleting URL won't help NM: I think the history of this should be explained here <timbl> 1. "At the same time, web documents have always been addressed with Uniform Resource Locators (URLs). URIs and URLs share the same syntax, every URL is also a URI. " <timbl> The distinction between URLs and URI is not helpful. The term "URI" should be used throughout. This discussion has I suspect prompted the rather confused track "What happens if a URI is also a URL?". <timbl> 2. "On the traditional Web, URIs were used primarily for Web documents—to link to them, and to access them in a browser. In short, to locate a Web document—hence the term URL (Uniform Resource Locator). The notion of resource identity was not so important on the traditional Web, a URL simply identifies whatever we see when we type it into a browser." <timbl> This uses the term URL, but suggest identity was not important ... it was important. <timbl> change to maybe <timbl> "On the traditional Web, URIs were used primarily for Web documents—to link to them, and to access them in a browser. In short, to identify a Web document, such as <> or a hypertext acnhor within a document such as <>. With the semantic Web, URIs are used to identify arbitrary things such as people, proteins and calendar events. <Noah> Note that I suggested during the discussion that it might be helpful for them to explain that the recommended terminology was changed in RFC 3986. URL used to be an appropriate term, now URI is preferred. RL: They use URIs in the titles of sections, and URLs everywhere else DC: I prefer they dispose of URL in the introduction, and use URI througout NM: Or put in an appendix to explain the history General discussion leading to an agreed first comment in TBL's draft [to be attached] TBL's second comment: Identity was always important DC: Google does lots of canonicalisation because the value of cache hits is high and the cost of conflating two actually distinct resources is low <Stuart> FYI... my comments on the earlier draft are at: SW: Section 2 doesn't really address the reference/resource distinction NM: I'm concerned with the 'everything' in that section TBL: I don't think it's all that misleading, this is a tutorial, I think it's OK NM: OK TBL's second proposed edit agreed as written <DanC_lap> bug: "Content negotiation [TAG-Alt] is often implemented with a twist: Instead of a direct answer, the server redirects to another URL where the appropriate version is found:" <DanC_lap> no, that's not content negotiation HT: is 302 the one that means "fix the source link"? TBL: no <DanC_lap> DC: hmm... maybe redirects based on Accept: are a form of conneg DC: Well, maybe if they're choosing a redirect based on headers it _is_ conneg too <DanC_lap> oh, just change "the HTML..." to "the content of the document in HTML in English" <DanC_lap> hi DO... we're poring over Further discussion of how strong to make TBL's comment 4 on the conneg/redirect para and of the cost (theoretical and practical) of round trips <Noah> From our alternative representations finding: Wording of TBL's comment 4 agreed <Noah> With that same URI, use HTTP content-negotiation, along with the correct HTTP VARY headers to serve up the appropriate representation at access time. Ensure that the VARY headers capture the right parameters that were used to choose the representation that is being served — this is important for correct behavior when using cacheing proxies. <Noah> As an alternative to the previous step, arrange for the server to generate an HTTP 302 (Found) redirect to automatically serve up when is accessed by user-agent_i. <DanC_lap> (we started ~30min later than the agenda called for; the agenda calls for lunch at 12:30. I'm starting to feel lunch-y) Discussion of the 301/302 difference, and the fact that browsers (incorrectly) treat them the same TBL: There's a security argument for this -- not letting the user be misled about "where they are" Discussion of SW's comment on the first para of section 3 SW: OK, I'll back off, but I do maintain that not all use of e.g. 303 are by definition uses of the Semantic Web <DanC_lap> (hmm... I wonder about using "hypertext web" rather than "traditional web") HST: I think that _historically_, that is, before the SemWeb was thought of, that http: URIs were _always_ used to identify what we know call information resources. <DanC_lap> (hmm... "We call these things resources" suggests there are things other than resources, which there aren't. noodling on alternatives doesn't yield much, though.) <DanC_lap> for the record, I abstain from adding http: in there too, norm. DC: Shall we carry this forward offline? SW: How? <Stuart> ACTION: Norman review Cool URIs for the Semantic Web [recorded in] <trackbot-ng> Created ACTION-46 - review Cool URIs for the Semantic Web [on Norman Walsh - due 2007-09-24]. <ht_> [break for lunch] <Stuart> trackbot-ng, status? <Stuart> trackbot, status? <DanC_lap> trackbot-ng, status <Stuart> ACTION: Tim Review the 14 Sep draft of the Cool URIs for the SemWeb document on behalf of the TAG and bring the comments back to the TAG [recorded in] <trackbot-ng> Created ACTION-47 - Review the 14 Sep draft of the Cool URIs for the SemWeb document on behalf of the TAG and bring the comments back to the TAG [on Tim Berners-Lee - due 2007-09-24]. <dorchard> I can dial in now. Apparently I'm awake for the duration... <Noah> scribenick: Noah <scribe> scribe: Noah Mendelsohn date: 17 September 2007 <scribe> chair: Stuart Williams <scribe> agenda: <dorchard> wanders off to review Noah's latest note.. SW: Need to ask whether as a result of this morning's discussion we can give Rhys guidance. HT: Don't think so. We didn't make it into the pertinent parts of the Cool URI's document. SW: Yes, seems unlikely we can get far enough while Tim's still with us. ... OK, we might come back to this at 14:30 UK time, otherwise after Cool URIs review is completed. <ht> Dave, use that code and we'll join you shortly <ht> ht has danC_lap, Noah, Norm, Rhys, Stuart, timbl SW: Where should we go with this? HT: On last telcon, my review of XHTML modularization concluded that with respect to distributed extensibility, XML Schema Substitution groups, particularly as provided in Schema 1.1, are just what they need. Remind me, what's the motivation for this issue again? SW: Had some roots in class attributes, profile attributes (possibly deprecated in HTML 5), microformats, etc. If the values for these aren't URIs, or don't get you to URIs, you can't "follow your nose" on the Web. DC: I had raised an issue relating to standardized name values. When Microsoft and Netscape were arguing about the Marquee tag, we said short strings were bad. Now we act like in microformats it's OK. Maybe it's because there's more of a consensus process around microformat deployment. ... Then people ask "what about collisions". I think microformats answer is "not a serious risk". To some extent that's true. And there the conversation tends to stop. ... Comes up somewhat with respect to new URI schemes. Stopping to ask IANA when you're grinding code isn't something people feel motivated to do. Hard to know how to motivate people. ... There's a Facebook ML (FBML) proposal from Facebook that's mentioned in a Sam Ruby post. Was discussion about distributed extensibility with Ian Hickson about SVG etc. in HTML 5. Ian says: they'll be there. The pushback is that things like SVG were the result of relatively centralized definition. ... HTML group seems to take position that these things should shake out, and then get integrated into HTML as the community settles on them. HT: Is this an issue people are still prepared to discuss, or are positions pretty well set. DC: Complicated. <Zakim> dorchard, you wanted to say that I think microformats does "values", are *nice* guys, and fly below the radar but technically no different DO: The microformats answer is only OK until there is a collision. The multimedia folks did hit a collision and wrote up an interesting posting on that. ... That's different from the <marquee> case, because attribute values seem less scary than element names. Also, everyone involved seems like nice guys; less concern about corporate agendas. <DanC_lap> (the difference between element names and class attribute values is that class attribute values were open to the user/author, and element names were reserved for standardization) DO: So, this seems to fly below the radar, but technically attribute value squatting is no different than element name squatting. There really isn't openness at microformats.org <Zakim> ht, you wanted to mention XPointer registry HT: As a result of discussion in this forum a long time ago, we did in the end implement a registry for XPointer schemes at W3C. ... This lets you construct a URI from the short name to get the information you need. ... This an example of a middle ground option. NW: I think that's only the right answer if you own the space in which the name goes. Probably not right for class attribute. HT: Yes, but might be for roles. Why couldn't microformats people do that? NM: Because they don't get to say what goes in my class attributes. TBL: I happened to use rel="chapter" in some of my design issues book, so RDFa guys produce bogus triples when pointed to my stuff. NM: that's related to the long/shortname issue, but the real problem there, as with microformats, is grabbing ownership long after the first deployments. ... So, distributed extensibility is an important issue. Deciding that certain attribute values have specific meaning years after documents have been deployed is a related but ultimately different issue. DO: ??? NM: First come first serve doesn't give you much quality. One of my concerns about microformats is that in 20 years we'll all know that class="phone47" is the right way to do phone numbers, because the first 46 cuts weren't right. Dave - please type in what you said...I had trouble getting it for the minutes. Thanks. SW: Do registry based systems meet the need. <dorchard> Now here's an idea. Microformats should define a versioning strategy that includes version #s in the value (structured attributes) HT: Yes, it's not centrally managed. DC: Huh, of course it is. HT: I'll try again. Something that's automatic and first come/first serve, because anyone can initiate the grabbing of the name. <dorchard> Then they say if you see "phone" or "phone1xyz" then they are compatible. <dorchard> if you see "phone2xyz" then they are version 2 of the phone and all v2 phones are compatible HT: Aren't dns names a good example? NM: Well, there have been ICANN problems. TBL: Well there are lists, trees, etc. At least trees have delegation. Graphs remove that weakness. ... I think a tree is right for DNS, because sometimes you need some control. Nobody's done internet with guids on everything. HT: If you want global uniqueness, a registry is as distributed as you can get. DC: Large random numbers. <Zakim> DanC_lap, you wanted to bring up recent Atom <DanC_lap> <dorchard> I previously said "adding the equivalent of ns prefix to microformats may be too complicated, and the microformats folks probably wouldn't change what they did" DC: Tim Bray blocked about Atom interop problems and David Megginson suggested that XML Namespaces were an example of premature standardization. <DanC_lap> comment From: David Megginson (Sep 14 2007, at 17:33) <DanC_lap> "in retrospect, we got too far in front of implementors' requirements and delivered a spec to solve problems someone might have some day in the future, instead of problems people actually had at the time." HT: Yeah, one of the RDF tools assumes that xsd: is bound to the 2001 XML Schema namespace URI. I used it for something else this week and the tool just blew up. <DanC_lap> <link rel="openid.server" href=""> DC: Sometimes you see rel="openid.server". Like prefixing your emacs functions with your initials. HT: Emacs has no package system. <Zakim> dorchard, you wanted to say that planning for the future will always provoke a response of "that's not a problem why should I do it now?" NM: I think everyone more or less agrees about the technology choices, it's getting people to see that the use cases matter. DO: Getting people to plan for the future, as with versioning, is hard. ... Microformats folks feel that "I don't have a problem now." ... You can generalize that to try and figure out when you're going to have trouble. It's easy to see in Java that you will. ... Less obvious for class attributes. <DanC_lap> (I'm curious about the cost/benefit in practice with java using DNS for package names... it avoids some conflicts, but it motivates some renaming when companies move in DNS space, I gather. I'm curious about actual experience) <ht> HST found it a royal pain DO: Dave Megginson may say namespaces was premature. It's not perfect but it's been effective in giving the community something to solve the problem. SW: We need to talk about the "follow your nose" aspect. <dorchard> On the "follow your nose" rationale for using URIs, I think most folks figure that search engines solve that problem.. DC: We used to joke about how, before Google, it implied that everyone would have to talk to everyone. NM: How does that work? DC: Google registers that all. NM: That's not everyone talking to everyone, it's everyone talking to Google. <Zakim> ht, you wanted to consider the Python example TBL: Noah's right. Everyone talking to everyone is n-squared. What you're describing is a notice board, which is order n. HT: Well, I just tried looking at my own favorite DTD, which has a class="code". So, I took Dan's advice and Googled them. Lo and behold, there are lots of them. How do I know if they're significant? ... It's not a usable notice board. How do I use it? DC: You just did. You told me it's "all over the map". HT: I can't tell if I'm openning myself to the problem Tim experienced, which is what Tim reported, I.e. that someone will infer the wrong semantics from my document. Henry takes some time to look for class="vcard" in Google. HT: If I wanted to put some of this in a TAG finding, I couldn't. <raman> Raman, signing in from the bus to work DC: It's economics. 10 years ago, the cost of doing the search was higher. <raman> Please email me the dialin and access code, can dial in once I get to work (about 60 minutes from now HT: Nothing was done to help the emacs community. Python didn't have a package mechanism to start, but around v1.4 or so Guido decided to offer an (optional) package system. <raman> I think most of the pushback against namespaces and packaging in the html community is a consequence of using namespace URIs to achieve the end-result --- the pushback is "syntactic not semantic". <raman> Notice that no one pushes back against greasemonkey scripts introducing a namespace <raman> Noah, none of what you typed about the conference code made any sense to me. NM: The community that's vulnerable to collisions is very different when I'm important some emacs macros than when someone runs a tool over the Web and stumbles on Tim's document. <raman> OK, I'll use zakin with our usual code when i get to work DC: Grounding packages in DNS can be a pain if a company gets bought. NM: The Norm is you live with the old package names. <raman> Also, given their syntactic ugliness, xml namespaces do far less than they promise on the surface no nesting for instance (not that I want nested namespaces -- that was a disaster in Common Lisp). RL: There are tools that will just do it for you in Java. <DanC_lap> eikeon <DanC_lap> redimport, I think NM: Again, remember that there's usually a programmer there, knowing what they're doing when you use a Java package. Anyone at all can find Tim's documents on the Web. <DanC_lap> (this bumps into all my noodling and bookmarks on software installation) TBL: there are tools that let you do some automatic import in Python SW: Are we ready for our technical plenary session? DC: I think the rubber hits the road when we talk to HTML 5, openid, groups, etc. I'm OK if this sits in the someday pile until the plenary. SW: We've had offers from Tim, Noah, Dan, and Norm. ... Dave, you pick what you need. ... Dave, are you moderator? DO: I've proposed, nobody pushed back. I'd be ok if someone else moderated after I brought people together. NM: Dave, we had talked about asking you to host a face to face in or near Vancouver Tues-Thurs Feb 26-28. OK? DO: Yes ****BREAK**** <ht> Uncaught exception: Permission denied to call method XMLHttpRequest.open <ht> zakim +0 is ht ACTION-15 <scribe> ACTION: [DONE] Henry S. Thompson to Review XHTML Modularization () ACTION-15 [recorded in] HT: I said on the call that substitution groups were a good bottom up extension mechanism, but a bad top-down modularization mechanism. They're not that good at helping you to share work. For example, sharing between XHTML basic an other versions. ... A good system should help you maintaining the versions as bits change. ... I've concluded that what I said was false. You can in fact achieve good top down sharing. ... The simplest and most universal way, we be to have one file per element. They already have >50 files for 80 elements, so they're nearly there (though they might not be fully conscious of that). DC: How? HT: 30 second version. Substitution groups are bottom up. The only thing that determines whether <a> is allowed is in the definition of <a> itself. So the easiest way to determine whether <a> is in your language, is to include only the file with the def. of <a>. One can do better. Intuition is I could reproduce what they have, but I haven't proven that. NW: For what it's worth, the Docbook RelaxNG schema works in a very similar style. SW: You have an action item. <Stuart> trackbot-ng, status HT: I want a new one. ACTION-16 on David Orchard to Incorporate the NVDL text into the findings. - due 2007-09-27, open SW: Action continues. <scribe> ACTION: Noah Mendelsohn to draft a blog item for review and, pending creation of a TAG blog mechanism, post it (ACTION-28) [CONTINUES] [recorded in] SW: Continues, pending availability of blog DC: Is the blog on today's agenda. <ht> ACTION: ht to produce an exemplary implementation of XHTML Modularization using substitution groups for both bottom-up extensibility and top-down modularity [recorded in] <trackbot-ng> Created ACTION-48 - Produce an exemplary implementation of XHTML Modularization using substitution groups for both bottom-up extensibility and top-down modularity [on Henry S. Thompson - due 2007-09-24]. <Norm> trackbot-ng, status <dorchard> A link to the announcement of latest editor's drafts should be on the agenda and the issue page: <dorchard> <scribe> ACTION: on Stuart Williams to complete review of terminology section of of 4 July versioning draft. ACTION-35 [DONE] [recorded in] SW: I posted a review last week. Dave, did you see it. DO: No. <Rhys> > Stuart's review DC: You said: Suggest replace: "Defn: A *Language* ..." with: "Defn: A *Language* consists of a set of admissable text; DC: Why did you want that change. ... I thought the original definition was OK. SW: At least note that I have done my action. ... I didn't see the terminology much used in the strategies. NW: I had the same comment on use of terminology in the XML section. <DanC_lap> 2.2.2 Forwards Compatible <DanC_lap> DC: we talked about 2.2.2 strategies before; I'm interested to see how the recent changes deal with it DO: I asked Noah to look at 2.2.2, he had problem with GPN. He pointed out that the GPN isn't right because it doesn't deal with reduction. ... Noah agreed that expansion is the majority of the cases, but suggested that we be clear in an intro, and proposed some text for an intro. <DanC_lap> (sounds like "requires" is too strong, since later it says SHOULD; maybe "motivates") <Norm> DanC_lap asked for an example of terminology problems; compare "component" in the terminology section with "component" in the XML document. DO: Noah also brought up that that if we're just doing extension, then the GPN is a tautology. ... That's why I had said SHOULD in the GPN, to account for reduction. ... Maybe it's not a GPN, it's an axiom. But I feel it needs to be bolded. ... I also posted a couple of lengthy articles on my blog. DO: Marc de Graauw also posted some material on www-tag, but unfortunately I haven't yet reviewed it in detail. <DanC_lap> (good question: who is the GPN aimed at? surely language designers) NM: That's mostly a good summary. I wonder whether this isn't really trying to say "extensible languages are good, consider creating one" <Zakim> DanC_lap, you wanted to observe that "Any Language intended for forwards-compatible versioning SHOULD have extensibility." seems odd... the definition of language doesn't seems to DC: I think having extensibility need redundancy? ... I think having extensibility means it has redundancy? NM: Yes, that's how I'd like to do it! DC: But is that what Dave wrote. I'm trying to remember the definition. It seems to say that a language is extensible if there is redundancy. TBL: Yes, spare syntax. <Stuart> [Definition: A language is Extensible if the syntax of a language allows information that is not defined in the current version of the language.]. <Stuart> from DC: There no processors in the definitions. ... In part 2 it says: "" <DanC_lap> "[Definition: A language is Extensible if the syntax of a language allows information that is not defined in the current version of the language.]" NM: I don't think it says that, but I'm increasingly convinced that it SHOULD say that. <DanC_lap> ^ I read that as "A language is Extensible if there are two texts that map to the same semantics". Asking Dave if that's as intended seems to yield "it's complicated" TBL: I'm torn between saying that, which is correct but confusing to newbies, vs. talking about the places where you can stick new stuff in. HT: Having redundency isn't enough. NM: Necessary, but not sufficient? HT: Yes. <DanC_lap> (the C++ case seems like a _not_ extensible language. they assign stuff to texts that used to be _illegal_) DO: You can have a language that has no redundancy. WS Security causes faulting. <DanC_lap> (you can have an extensible language with no redundancy? oh... he explains... a more subtle notion of redundancy than I meant) <DanC_lap> (in our model, there are usually several ways to look at a format as a webarch:language) <ht> HST mentions the role of "Colorless green ideas sleep furiously" <Norm> Noah: If your text isn't in the accept set, all bets are offf <timbl> () <Norm> ...If it's in the accept but not the defined set then we can only tell you something about it (scribe got lost) <Norm> ...And if it's in both sets, then you can say it's perfectly good information even if my app doesn't like it. <Norm> ...What worries me is that we seem to bounce between these levels without being careful. <raman> have been on about 10 minutes it's hard to understand the phone conversation, room is echoing ... <DanC_lap> (degraw's stuff treats processing formally, I think) NM: I do note that this doesn't much build on part 1. My nervousness with processing model is, in part, that we need to connect it to our part 1 concepts of information etc. SW: I thought we were going to talk more about reduction. Is there something in the strategies that shows a forward compatible restriction that's not a reduction. <daveorchard> adding optional components ( in XML, this is generally elements and/or attributes) <daveorchard> adding optional content, for example extending an enumeration DO: From section 1.2: ... adding optional components ( in XML, this is generally elements and/or attributes) ... adding optional content, for example extending an enumeration SW: Are you talking about one way message scenario? <DanC_lap> (there's a strong connection between examples and audience. I'm noodling on our audience and whether the GPN advice is likely to convince them, and it does seem like WS-* messaging designers are more natural audience members than, say, HTML 5 designers) <daveorchard>: Remind me on forward and backward compatible.: I didn't quite parse "fully strictly" DO: You asked for some examples. That's them. SW: OK, I'll check out examples. ... Fully seemed to be about being very tolerant, strictly seemed redundant. DO: I may have overloaded fully. ... Where do you want to go now? SW: I've only gone there because it crept into the IRC log NM: I'm still confused about the lack of connection to the part 1 terminology DO: That's intentional. I think going to the rigorous terminology will throw off the readers we intend to address. ... I think we really want to say, build extensible languages and a model for them. <DanC_lap> (huh? you don't want to use the definitions in the advice? that seems backward.) DC: Not if the terms aren't defined. NW: I'm worried too. TBL: Are we saying "to make extensible languages, make them extensible". DC: Yes, make it comprehensible, but work from the base. TBL: What's our feeling about examples. <DanC_lap> (I'm not at all surprised this is hard.) <Zakim> Norm, you wanted to say that I don't read that definition the same way as Dan <Zakim> daveorchard, you wanted to say that a language can be extensible but NOT redundant and NOT forwards-compatible evolvable. <Zakim> Noah, you wanted to talk about processing NM: I think we sometimes need more rigor consider the text that says: "Preserve existing information Rule: Any Language intended for forwards-compatible versioning MUST require that extensions MUST not invalidate the non-extension text's information." ... Is there some operation called invalidation that can be done on information. <DanC_lap> (this 'invalidate' stuff comes back to what I called an open research problem around compatiblity of information.) <DanC_lap> (again, it doesn't surprise me that we're having trouble giving general advice; the traditional formal models don't help much here.) DC: Talking about compatibility seems better than "not invalidating" TBL: In a lot of cases things aren't backwards compatible, there's limited damage. Consider HTML tables. If you put a doc with tables that don't understand them, then you can still get useful stuff out. Graceful degradation. <timbl> "Applications are expected to behave properly" has som room for judgement it seems to me <DanC_lap> (tbl's point about costs is another reminder that economics figure in to language design and evolution a whole lot, and our formal models don't touch on that at all. maybe that's ok, I dunno.) NM: But I think we're missing a chance to work through the info model. In the HTML case, a processor that knows tables will have in its info model will know "There's a table there". A processor that knows the older language only knows "there's a <table> element there." DO: If what I get is that I1 is a subset of I2, then... there has to be some relationship there. <DanC_lap> (looking at ... he formalizes this information stuff as behavior of processors. hm.) SW: Where would you go, Noah? NM: Not 100% sure, but I'd be inclined to try to talk about what we do and don't know about compatible information. I think that in some simple cases, e.g. that map to relatively orthogonal named properties, you can do a generalized solution. In practice, I think knowing that a traffic light being off and a traffic light being green are incompatible is domain specific. <daveorchard> I think the HMTL adding tables and being able to extract flight times is a great example. <daveorchard> Which is very different than a PO adding a security token.. <daveorchard> And it seems that the language designer makes their best guess as to how to do compatibility TBL: I think we worked hard on the terminology and should keep it. Haven't read strategies carefully enough. It's finding it difficult to add values for users. I wonder whether we could illustrate these with particular, or even notorious examples where versioning has or hasn't worked well. <daveorchard> Then producer of a new version decides whether they want to produce an instance that is compatible or not according to the rules in V1.. TBL: You could say HMTL growth was successful, allowed tables to be put in. Could give the validator as a bad example, because it stopped people from extending the language when it needn't have. <DanC_lap> (examples: HTML 1 to 2 to 3 to 4; XSLT 1 to 2; XML 1.0 to 1.1 (bzzt). CSS.) TBL: Is there a story we can tell about CSS not having a version number? <DanC_lap> (other examples I hear about include: XBL) TBL: Could tell the story about IETF admonitition to typically add x-____ headers, and that didn't work out. ... Talking about them would be good. <DanC_lap> (the moz-rounded-corners example brings us right back to the class attribute registry discussion) <Zakim> timbl, you wanted to ask about what classic examples we know NM: Would you try to connect them to the formalism. TBL: Yes. ... The real problem with the x- stuff was that there was no transition to the non x- stuff. ... Given examples will bring this alive. <daveorchard> <DanC_lap> +1 more examples sooner DC: Maybe we could do more for the specific examples to flesh them out. TVR: I've been confused about the business of when you put HTML and CSS together. ... When I have an HTML document and CSS, different processors may give you a given look. <daveorchard> The XML document has many more examples and details at <DanC_lap> (I think populating the CSS column is likely to be interesting and non-trivial; whether CSS's versioning story is exemplary is a source of unending discussion in circles I run in.) TVR: Start with a document D and stylesheet S. S has a property that hides what it's applied to, but only one processor honors it. What does that mean. DO: Right. TBL: Canonical example. People who generate Web pages will tell people which version of CSS is being used where. <Stuart> If you regard HTML or HTML+CSS as a presentation language, then surely information/meaning is appearance on the screen! NM: I think you can do at least two information mappings for that case. In one, you just note that the property is there, and leave it to the processing level to know that skipping a hide instruction is incompatible. In the other mapping, each text is labeled at the information level as displayable or not. In that case, you'll see that the information as mapped is incompatible. TVR: I think you need some warning (TVR--can you help me scribe this better). SW: Dan, what would you do next? DC: I still think dealing with forwards compatibility is one of the more interesting things we can do. The connections from that section to the definitions could be better. The idea of doing more examples could add value. DO: We kind of focussed on that first section. There's stuff in 2.2.2.1 "must accept unknown extenstions", where there are more examples. <DanC_lap> (hmm... I didn't say "could be better"; I suppose it's sort of a fair paraphrase, but I don't at all mean to say "coudl easily better") DO: The 2.2.2.1 is accept the unknowns; 2.2.2.2 is to provide a fallback. ... Also some stuff about understanding version identifiers. <DanC_lap> (perhaps I'm not a typical reader, but I'd probably prefer headings like "versioning in HTTP 1.1" to "ust Accept Unknown Extensions") <DanC_lap> (hmm... "text portion"... I think the pattern to note there is the flat-list pattern) DO: For example, talking about "processors must not fault if receiving the expected major version numbers" SW: I skimmed it recently. I see myriad good practice notes which describe themselves as rules, and not knowing in what context they apply. I infer they don't all apply simultaneously. Find myself asking: which rules do I use when. I'm lost in a sea of rules. <Norm> ack <Zakim> Norm, you wanted to encourage the editor to reconsider his position about using the terminology in the strategies document; making the whole suite of documents tighter and crisper <timbl> For example. <timbl> Provide Extension handling Rule: Languages SHOULD specify how unknown extensions are handled. ---> NW: I'd like to encourage you to reconsider your inclination to keep the terminology out of the strategies, but I think the documents would be better if they were tighter and more rigorous. We could also in principle add a primer etc., but I think we'd be better off. This is the first time I've heard you say you weren't trying to do that, and it somewhat disappoints me. <timbl> An extensible languages provides mapping from documents in any extended set to dopcuments whose semantcis is lready defined. SW: 10 mins to 5PM. Need to wrap up. This is all the time we have scheduled. Need to decide where to go. <timbl> The the next one is unnecessary in facrt "Preserve existing information Rule: Any Language intended for forwards-compatible versioning MUST require that extensions MUST not invalidate the non-extension text's information.". <timbl> Sorry, /me waqs not wrapping up <timbl> 'Forwards-compatible requires extensibility rule: Any Language intended for forwards-compatible versioning SHOULD have extensibility." TBL: Consider Forwards-compatible requires extensibility rule: Any Language intended for forwards-compatible versioning SHOULD have extensibility." Is this saying: "For something to be extensible it must by extensible". If it were crisper, you could tell. ... If we related it to the terminology thing it would be less readable, but more solid. SW: I think I've heard that the issue is "What really are the messages that the TAG wants to deliver". TBL: I think we want to give people patterns they can remember and apply. SW: Do we have a catalog TBL: To some degree they're in the good practice rules. <DanC_lap> (yes, the GPNs make more sense as patterns, since people know that patterns sometimes apply and sometimes don't.) NM: I think we can also help people to think a bit more clearly. E.g. do people really know how different languages use version ids. Adjourned. <daveorchard> Enjoy your sail!
http://www.w3.org/2001/tag/2007/09/17-tagmem-minutes.html
crawl-001
refinedweb
7,936
70.33
Introduction to Quantum Computing Using Qiskit and IBM Q Introduction to Quantum Computing Using Qiskit and IBM Q At the end of this tutorial, you will be able to simulate the behavior of quantum circuits on your computer using Qiskit. Join the DZone community and get the full member experience.Join For Free Before we dive into the real work, I want to lay down the requirements, and how to get them: You will need to have Python ( version > 3.5 ), Anaconda, and the Jupyter Console. You can install all of them at the same time, simply by getting the Anaconda distribution. You can find it here. Next, you will need to install the Qiskit library. To do that, you can use any package management system, but for this tutorial, I will demonstrate the steps of doing it using PIP. Now, you will need to get PIP which is a package management system for Python. Use this command to install PIP: sudo apt install python-pip Then use pip to install Qiskit using this command: xxxxxxxxxx pip install qiskit You are almost there. Now all you need to do is to open up a terminal window. Then, type in: jupyter console Congratulations, now you are ready to start executing commands and exploring the behavior of quantum circuits. I want to cover the theory behind the experiment that we will be doing, but first, it is good to know the difference between a Qubit and a regular bit. If you haven’t heard already, quantum computers use Qubits instead of classical bits to perform their tasks. Qubits are quantum-mechanical systems that can result in a 0 or a 1 or some superposition of them. Here is a good picture to show that: In the last picture, you can see on the left the possible values of classical bits, versus on the right, the values a Qubit could take. These values can be represented by a percentage of the relative probability of finding the qubit in one state of the superposition or another. That probability could be given by the distance from the center of the position within a unit sphere. If it is closer to the bottom (relative to the picture), then it will be a 1, otherwise, it will be a 0. To avoid confusion, I want to stress that quantum bits, just like classical bits, always result in either a 0 or a 1. They do not take on any other different values. But how they get there, is what is different from classical bits, and that is what makes it powerful. Back to the theory. The big picture of what we will be doing in this tutorial is trying to cause an entangled state (also known as the Bell State). Buzzwords aside, look at the past sphere: the states along the axis running from 0 to 1 are essentially classical states. Now imagine two Qubits’ positions being right at the equator of the circle of the sphere (equidistant from the poles). That is a 50 50 chance of being 0 or 1, and boom that’s an entangled state. In such a superposition state, each Qubit possesses correlations such that neither Qubit’s state can be fully described without referencing the state of the other Qubit. This is the simplest way to demonstrate the difference between a Quantum Computer and a classical one. Let’s dive right into coding after making sure you are working in your preferred directory. Let’s first start by creating a quantum circuit made out of a quantum register and a classical register. to do so, you will need to import qiskit, and define some variables. If you are familiar with Python, you will find ease at doing this, since, under the hood, we are just coding in Python. import qiskit as qkqr = qk.QuantumRegister(2) cr = qk.ClassicalRegister(2) qc = qk.QuantumCircuit(qr,cr) At this point, I want to introduce a mobile application called Hello Quantum. It is made by IBM and it looks very similar to a puzzle game. However, it explains how the quantum gates work and their behavior very well. I suggest playing with it for a little bit if you are interested in learning more about the circuit composition. The app’s icon looks like this: Back to the code, now we can add operations to our circuit. We previously defined two registers (one quantum and one classical) and made a circuit out of them. Next, let’s apply a Hadamard gate on the quantum register and a cnot (controlled not) gate on the classical register. qc.h(qr[0])qc.cx(qr[0],qr[1]) Let’s add the measurements to the circuit we just created. Since we want to do the measurements with and without a Hadamard gate beforehand, it will be easier to create separate circuits for the measurements and combine them with our entangling circuit. The measure_Z circuit will just do our measurement on the standard basis. Afterward, we use a qiskit function to store the result in the classical register xxxxxxxxxx measure_Z = qk.QuantumCircuit(qr,cr) measure_Z.measure(qr,cr) We’ll call our second measure measure_X and we’ll apply a Hadamard gate to it before the measurement. xxxxxxxxxx measure_X = qk.QuantumCircuit(qr,cr) measure_X.h(qr) measure_X.measure(qr,cr) Now that we have defined our measurement circuits, we can append them to our entangling circuit, creating two new circuits that we will label test_Z and test_X. xxxxxxxxxx test_Z = qc + measure_Z test_X = qc + measure_X These are all the previous commands executed successfully to help make sure you nail them. Now we get to the more exciting stuff! Real Quantum Computer connection! Navigate to and make an account and login. Once you are logged in, click on the avatar picture on the top right corner and go to account, then to advanced. You will be able to see a similar screen to this. Copy your API Token, we will use it shortly. Next, import IBMQ and get ready to connect to a quantum computer! xxxxxxxxxx from qiskit import execute, IBMQIBMQ.enable_account("Paste your APItoken here") Make sure you pass in your API token as a string. Now if you run IBMQ.backend() you should be able to see all the backends available to you by IBM. If you look closely, they are under IBM Q Backend Acces on your IBM Q account. Now let’s define a variable for our backend and start executing some code on the QC. backend = IBMQ.get_backend('ibmqx4') I chose ibmqx4 for this example, but this is purely up to you what to use. Sometimes some backends go on maintenance, so I always check what backends are available before I choose one. Here is a quick summary of the backend connecting. Now, remember the test jobs that we were preparing out of the circuits earlier? Now we are going to use them! let’s create a job this way: xxxxxxxxxx job= qk.execute([test_Z, test_X], backend = backend, shots = 1000) Next, let’s execute the job.status() a few times, to monitor the status of the job. It should be queued if there are a lot of use for the quantum machines (or if you picked a busy one, a quick fix is to go back and redefine the variable for the backend with a different provider!), and after a bit, it should succeed. This is what I got from following that. At this point, the next step is to get the result for the execution of the job. xxxxxxxxxx result = job.result() result.get_counts(test_Z) result.get_counts(test_X)from qiskit.tools.visualization import plot_histogramplot_histogram(result.get_counts(test_Z)) Those were the results of my execution. Yours may vary. The interpretation of that is that because of the execution on a quantum computer, we have shown the existence of the “Bell State”, which is when a Qubit is in the right middle between a 0 and 1 and, and only happens in a quantum system. That is given to us by the middle values on the x-axis (01 and 10), which represents the “Bell state”, otherwise known as the entangled state. Don’t believe me? See for yourself! let’s wrap this up by executing the same job on a local simulator (not quantum). These are the commands you will need to connect to Aer and use their local simulator, and re-execute the past job: xxxxxxxxxx from qiskit import Aerbackend = Aer.get_backend('qasm_simulator')job = qk.execute([test_Z, test_X], backend= backend, shots=1000)result = job.result()plot_histogram(result.get_counts(test_Z)) Here are the results: As you see from the graphs, there is no entangled state. All boring regular 0 and 1 bits. However, this was just your proof that you were using a quantum computer! Congratulations if you made it this far and were able to connect to the IBM Q backend and execute your first job! I want to thank Mr. McClure for being my biggest resource for this article. I utilized a lot of his Youtube video, I suggest you check it out! Published at DZone with permission of Marouen Helali . See the original article here. Opinions expressed by DZone contributors are their own. {{ parent.title || parent.header.title}} {{ parent.tldr }} {{ parent.linkDescription }}{{ parent.urlSource.name }}
https://dzone.com/articles/introduction-to-quantum-computing-using-qiskit-and
CC-MAIN-2020-24
refinedweb
1,552
64.61
Hi Richard, Can confirm that the operator's on_kill() is not triggered via `clear`, only job.on_kill() is triggered, but it doesn't propagate to the operator/task. From what I can tell, currently the only way to trigger on_kill() is via manually sending a SIGTERM to the process while the task is running (code ref <>), or if the task actually times out (code ref <> ). I assume that the intended behavior is to trigger operator's on_kill() method whenever a task is cleared. If so, I'd propose patching theLocalTaskJob's on_kill() method as below in a PR: def on_kill(self): * self.task_instance.task.on_kill()* self.task_runner.terminate() self.task_runner.on_finish() Hope this helps! On Wed, Sep 13, 2017 at 8:37 AM, Richard Baron Penman < richard.penman@gmail.com> wrote: > Thanks Ash. > In my logs I see "Job shut down externally", so that BaseJob.kill() > method is certainly executed. > > My understanding is this then calls self.on_kill(): > > b2e1753f5b74ad1b6e0889f7b784ce69623c95ce/airflow/jobs.py#L2512 > > which terminates the process: > > b2e1753f5b74ad1b6e0889f7b784ce69623c95ce/airflow/task_ > runner/bash_task_runner.py#L34 > > How is the operators on_kill() method then triggered? According to my > logging it is not executed. > > > On Fri, Sep 8, 2017 at 4:49 AM, Ash Berlin-Taylor > <ash_airflowlist@firemirror.com> wrote: > > That sets the task instance state to SHUTDOWN, which is then picked up > by the task sentinel here > incubator-airflow/blob/b2e1753f5b74ad1b6e0889f7b784ce > 69623c95ce/airflow/jobs.py#L164-L165 < > incubator-airflow/blob/b2e1753f5b74ad1b6e0889f7b784ce > 69623c95ce/airflow/jobs.py#L164-L165> which triggers kill, so it is meant > to work. > > > > -ash > > > >> On 7 Sep 2017, at 20:00, Richard Baron Penman <richard.penman@gmail.com> > wrote: > >> > >> Is this known to work? > >> I tried clearing and the on_kill() method wasn't triggered. > >> > >> As far as I can tell the clearing is performed by the > >> clear_task_instances() function, which changes the task status but does > not > >> kill the process: > >> > b2e1753f5b74ad1b6e0889f7b784ce69623c95ce/airflow/models.py#L120 > >> > >> > >> > >> On Thu, Sep 7, 2017 at 4:46 AM, Maxime Beauchemin < > >> maximebeauchemin@gmail.com> wrote: > >> > >>> "Clearing" a running task instance either through the UI or through > the CLI > >>> should trigger on_kill. > >>> > >>> Max > >>> > >>> On Wed, Sep 6, 2017 at 11:45 AM, Richard Baron Penman < > richardbp@gmail.com > >>>> > >>> wrote: > >>> > >>>> Hello, > >>>> > >>>> Is there a way to trigger the on_kill() method of an operator through > the > >>>> UI? > >>>> I tried changing the state of a running task and deleting it, but > neither > >>>> approach triggered the on_kill() method and so the process was still > >>>> running. > >>>> > >>>> Similar question was asked on SO: > >>>>- > >>>> airflow-task-running-on-a-remote-location-through-airflow-ui > >>>> > >>>> Richard > >>>> > >>> > > > > -- Joy Gao Software Engineer 350 Convention Way, Suite 200 Redwood City, CA 94063 Mobile: 669-224-9305 Payments partner to the platform economy
http://mail-archives.us.apache.org/mod_mbox/airflow-dev/201709.mbox/%3CCAKMdtFdQVMakOebNooRD=-r5VDiV4QG4frofLOzhcw6C9UZz_g@mail.gmail.com%3E
CC-MAIN-2020-45
refinedweb
444
66.64
Janez and I have recently returned from a two-week stay in Moscow, Russian Federation, where we were teaching data mining to MA students of Applied Statistics. This is a new Master’s course that attracts the best students from different backgrounds and teaches them statistical methods for work in the industry. It was a real pleasure working at HSE. The students were proactive by asking questions and really challenged us to do our best. One of the things we did was compute minimum cost of misclassifications. The story goes like this. Sara is a doctor and has data on 303 patients with heart disease (Orange’s heart-disease.tab data set). She used some classifiers and now has to decide how many patients to send for further tests. Naive Bayes classifier, for example, returned probabilities of a patient being sick (column Naive Bayes 1). For each threshold in probabilites, she will compute how many false positives (patients declared sick when healthy) and how many false negatives (patients declared healthy when sick) a classifiers returns. Each mistake is associated with a cost. Now she wants to find out, how many patients to send for tests (what probability threshold to choose) so that her cost is the lowest. First, import all the libraries we will need: import matplotlib.pyplot as plt import numpy as np from Orange.data import Table from Orange.classification import NaiveBayesLearner, TreeLearner from Orange.evaluation import CrossValidation Then load heart disease data (and print a sample). heart = Table("heart_disease") print(heart[:5]) Now, train classifiers and select probabilities of Naive Bayes for a patient being sick. scores = CrossValidation(heart, [NaiveBayesLearner(), TreeLearner()]) #take probabilites of class 1 (sick) of NaiveBayesLearner p1 = scores.probabilities[0][:, 1] #take actual class values y = scores.actual #cost of false positive (patient classified as sick when healthy) fp_cost = 500 #cost of false negative (patient classified as healthy when sick) fn_cost = 800 Set counts, where we declare 0 patients being sick (threshold >1). fp = 0 #start with threshold above 1 (no one is sick) fn = np.sum(y) For each threshold, compute the cost associated with each type of mistake. ps = [] costs = [] #compute costs of classifying i patients as sick for i in np.argsort(p1)[::-1]: if y[i] == 0: fp += 1 else: fn -= 1 ps.append(p1[i]) costs.append(fp * fp_cost + fn * fn_cost) In the end, we get a list of probability thresholds and associated costs. Now let us find the minimum cost and its probability of a patient being sick. costs = np.array(costs) #find probability of a patient being sick at lowest cost print(ps[costs.argmin()]) This means the threshold that minimizes our cost for a given classifier is 0.620655. Sara would send all the patients with a probability of being sick higher or equal than 0.620655 for further tests. At the end, we can also plot the cost to patients sent curve. fig, ax = plt.subplots() plt.plot(ps, costs) ax.set_xlabel('Patients sent') ax.set_ylabel('Cost') You can download the IPython Notebook here: [download id=“2053”].
https://orange.biolab.si/blog/2018/05/03/data-mining-course-at-higher-school-of-economics-moscow/
CC-MAIN-2019-47
refinedweb
512
58.58
I'm trying to createa function that takes command line arguments, parses them, and returns a stream to be used for output. If a filename is specified, the program will write to that file. If no filename is specified, the default output will be to cout. I haven't gotten to the parsing yet. Simply passing an ostream parameter and trying to assign it to equal cout is giving me preoblems already. The error is one of those really long errors, so I won't post it unless someone wants it. I've tried making line 15 either an ostream or an ofstream. Neither works. #include <ostream> #include <fstream> #include <iostream> using namespace std; void foo(ostream& outs) { outs = cout; } int main() { ofstream outs; foo(outs); outs << "Hello World\n"; return 0; }
https://www.daniweb.com/programming/software-development/threads/429353/trying-to-pass-an-ostream-parameter
CC-MAIN-2021-31
refinedweb
132
72.56
table of contents NAME¶log_open, log_close, log_reset, log_flush, log_printf, log_vprintf, log_putc, log_puts - log routines for debugging LIBRARIES¶Debug Library (-ldebug) SYNOPSIS¶ #include <debug/log.h> int log_open(const char *logfile, int level, int flags); void log_close(void); int log_reset(void); int log_flush(void); int log_printf(int level, const char *fmt, ...); int log_vprintf(int level, const char *fmt, va_list ap); int log_putc(int level, int c); int log_puts(int level, const char *str); DESCRIPTION¶log_open() initializes the logging system. The filename of the file to which messages are logged should be specified by logfile, or NULL if messages should be printed to the console. The values for level and flags are given in the next section. From version 0.4.1 onwards the debug library also supports logging to syslog instead of a file. Instead of specifying a file, just specify a string in the form ident.facility, where ident is a string which will be prepended to each syslog message and is usually the program name. The facility should be the facility to which messages should be logged. log_close() flushes all pending messages, and closes the file descriptor of the log file (if any). log_reset() reinitializes the logging system. If any files are currently opened for writing, it will be closed and reopened. This is useful if you need to rotate log files. log_flush() flushes all pending messages (if any). log_printf() and log_vprintf() are replacements for printf(3) and vprintf(3) respectively. log_putc() will log a single character. This is the equivalent of putchar(3). log_puts() will log a string. It is the equivalent of puts(3), except that is does not append a trailing newline. PARAMETERS¶This section lists the parameters used to set the values of level and flags. level¶This determines the importance of the message. The levels are, in order of decreasing verbosity: - LOG_NOISY - verbose debug messages - LOG_DEBUG - debug messages - LOG_VERBOSE - informational messages - LOG_NORMAL - normal, but significant, conditions - LOG_WARNING - warning conditions - LOG_ERROR - error conditions - LOG_QUIET - no messages are printed The level argument to log_printf(), log_vprintf(), log_putc(), and log_puts() specify the level at which the message should be printed. It does not make sense to specify LOG_QUIET to these functions. The level argument to log_open() sets the verbosity of the program. Any messages printed with a level higher (more verbose) than that specified to the log_open() function, will be discarded. flags¶The flags argument to log_open() is an OR of any of these: - LOG_HAVE_COLORS - If this flag is specified and messages are printed to the console (i.e. no log file is specified), messages will be printed in different colors, depending on their log level. - LOG_PRINT_FUNCTION - If this flag is specified, the function in which the print function was called would be printed in addition to the filename and line number. - LOG_DEBUG_PREFIX_ONLY - If this flag is specified, only messages with a level higher or equal to (i.e. more or as verbose) LOG_DEBUG will be printed in color and with file, line number, and (if necessary), the function. - LOG_DETECT_DUPLICATES - If this flag is specified, messages would be buffered and duplicate lines would not be printed. Instead, the first message would be printed, followed by a line describing the number of times the message repeated. This is a great way to prevent flooding, but unfortunately it has the side effect of always being one statement behind. - LOG_DETECT_FLOODING - If specified, the rate at which messages are printed would be limited in order to avoid flooding. This feature have not been implemented yet, and is currently ignored. RETURN VALUE¶All functions except log_close() return 0 if successful, -1 if some error occurred. Check errno to see which error occurred. If log_reset() or log_open() fails, behaviour is undefined and it should be assumed that no logging is possible. The log_close() function returns no value. NOTES¶If this routines are combined with the memory SEE ALSO¶mem_open(3), errno(3), atexit(3), printf(3), vprintf(3), putchar(3), puts(3) logrotate(8), syslog(3), logger(1)
https://manpages.debian.org/buster/libdebug0-dev/log_printf.3debug.en.html
CC-MAIN-2019-51
refinedweb
664
64.41
Just studying for my Java final. No homework here. I want my function to return an array, with the array holding just the values of data that appear in good. This is what should be returned: {3, 5, 3, 2, 3, 3} What is currently being returned: {0, 3, 5, 3} I didn't want to miss any numbers, so I decided to iterate through j for the "good" array, and then just i for the one that I was looking for matching numbers. Perhaps part of the problem is that if the condition is met, it goes to the next iteration of the loop. I'm not sure. Thanks for looking! public class Arrays2 { public static void main(String args[]){ int [] data = {8, 3, 5, 3, 7, 2, 8, 3, 3 }; int [] good = {5, 2, 3, 2}; int [] result = f2(data, good); for (int i = 0; i < result.length; i++){ System.out.println(result[i]); } } public static int[] f2(int []data, int[] good){ int [] result = new int[good.length]; for (int i = 0; i < good.length; i++){ for (int j = 0; j < good.length; j++){ if (good[j] == data[i]) result[i] = data[i]; } } return result; } } This post has been edited by leo255: 04 June 2014 - 04:07 PM
http://www.dreamincode.net/forums/topic/348138-want-to-copy-matching-numbers-from-two-arrays-onto-a-new-one/
CC-MAIN-2017-04
refinedweb
210
81.93
This is one of the 100 recipes of the IPython Cookbook, the definitive guide to high-performance scientific computing and data science in Python. import numpy as np import matplotlib.pyplot as plt %matplotlib inline \begin{align*} \frac{\partial u}{\partial t} &= a \Delta u + u - u^3 - v + k\\ \tau\frac{\partial v}{\partial t} &= b \Delta v + u - v\\ \end{align*} The variable $u$ represents the concentration of a substance favoring skin pigmentation, whereas $v$ represents another substance that reacts with the first and impedes pigmentation. At initialization time, we assume that $u$ and $v$ contain independent random numbers on every grid point. Besides, we take Neumann boundary conditions: we require the spatial derivatives of the variables with respect to the normal vectors to be null on the boundaries of the domain $E$. Let's define the four parameters of the model. a = 2.8e-4 b = 5e-3 tau = .1 k = -.005 $$dt \leq \frac{dx^2}{2}$$ size = 80 # size of the 2D grid dx = 2./size # space step T = 10.0 # total time dt = .9 * dx**2/2 # time step n = int(T/dt) U = np.random.rand(size, size) V = np.random.rand(size, size) $$\Delta u(x,y) \simeq \frac{u(x+h,y)+u(x-h,y)+u(x,y+h)+u(x,y-h)-4u(x,y)}{dx] plt.imshow(U, cmap=plt.cm.copper, extent=[-1,1,-1,1]); Whereas the variables when completely random at initialization time, we observe the formation of patterns after a sufficiently long simulation time. You'll find all the explanations, figures, references, and much more in the book (to be released later this summer). IPython Cookbook, by Cyrille Rossant, Packt Publishing, 2014 (500 pages).
http://nbviewer.jupyter.org/github/ipython-books/cookbook-code/blob/master/notebooks/chapter12_deterministic/04_turing.ipynb
CC-MAIN-2018-13
refinedweb
290
56.96
Introduction to React JSX In react js many time we face situation where we required to combined the JavaScript with html react introduces the file type which is JSX. Instead of creating a different technology for handling two at one place they introduced the JSX. You will see in the react js there will be states, there will be functions and there will be HTML and CSS also on the same file in any particular component. So to deal with all these kind of attributes they introduced the concept of JSD file. For example const x =<h1>How are you</h1>, so here we can see it not complete html and not even JavaScript. Uses of JSX in React Given below are the uses of JSX in React: 1. Easy to write code In case of JSX it allows us to write the HTML, CSS and javascript on the same file which gives a better clarity and understanding for the code. We take a look on the example like const x =<h1>Hello friend</h1>, in this we have written the HTML and javascript on the same file , it does not looks like a complete HTML or any complete javascript. We can also attach the css along with the html like const x =<h1 style={StyleObject}>hello friend</h1>, here in this we can add the style object for StyleObject with some css attributes which can change the design of the h1 tag. 2. Used without “ ” with JavaScript If you have worked on any plain javascript files with extension like .js then you will see that you will have to use double quotes in case if you wanted to combined the html with the javascript and in the same way if we wanted to display the javascript inside the html file with .html extension then also we need to use javascript start and end tags. With the help of the JSX we will be able to simply write without these things and we can easily manage both the flow without using the quotes and with any javascript tag for managing html and javascript respectively. 3. Without createElement() place the HTML in JavaScript With the help of jsx we will be able to create html dom from javascript into the html, which means we will write the HTML inside the javascript combination with the javascript and css and that can be directly converted to html dom without using the attribute or function called createElement(). It saves the extra calculation because we are not again creating the dom from javascript to another format. For example cons x =<h1>Hello friend </h1>, here it is combination of both javascript and html and the html tag can be easily be placed to the html real node without using the concept of the createElement(). How to Use JSX in React? In the below we have given some of the important examples where we are displaying the various uses and way of working of the jsx in the react js. In the example below we are combining the javascript, HTML and css all together and all these are possible because of the jsx file type. Here in the example we can understand the importance of the jsx file which giving us a flexibility to use all type of extensions in the same file. It is reducing our effort to manage separate flow for html and for javascript. In case we wanted to run the below example then we can create any file with the extension of jsx and we can place the examples on the files and we can see the output of the execution on the browser. Example #1 Code: function fullName(userDetail) { return userDetail.userFirstName + ' ' + userDetail.userMiddleName + ' '+userDetail.userLastName; } //Defining the css to design the output view with color and with some other attributes. constuserStyle={ color:"red", fontSize:"15px" } //Defining the css to design the output view with color and with some other attributes. constuserdetails = { userFirstName: 'Ranjan', userMiddleName: 'Kumar', userLastName : "Pandey" }; //Here we can see that we are combining the html and javascripttogether . const user = <h1 style ={userStyle}>Welcome to React programing, {fullName(userdetails)}!</h1>; ReactDOM.render(user, document.getElementById('main')); HTML, Below is the html which will hold the hole react jsx file output <div id="main"></div> Output: Example #2 Code: //Defining the css to design the output view with color and with some other attributes. constjsxStyle={ color:"red", fontSize:"15px", justifyContent: "center", alignItems: "center", textAlign :"center", marginTop: "1em" } class JsxExample extends React.Component { render() { return <div> //Here we can see that we are combining the html and javascript together. <h1 style={jsxStyle}>This is the tutorial for JSX</h1> </div>; } } React.render(<JsxExample />, document.getElementById('main')); HTML, Below is the html which will hold the hole react jsx file output <div id="main"></app> Output: Example #3 Code: //Defining the css to design the output view with color and with some other attributes. var Shape = React.createClass({ shapeStyle: { width: "101px", height: "101px", mozBorderRadius: "51%", alignItems: "center", webkitBorderRadius: "101%", background: "green" }, render: function() { return ( //Here we can see that we are combining the html and javascript together. <div className="shape-class" style = {this.shapeStyle}></div> ); } }); React.render( <Shape />, document.getElementById('main')); HTML, Below is the html which will hold the hole react jsx file output <div id="main"></app> Output: Conclusion From this tutorial we saw the basic concept of the jsx and we saw the uses and the flow of the jsx, we saw its importance and uses with the help of some important examples, with focusing the real time cases. Recommended Articles This is a guide to React JSX. Here we discuss the introduction, uses of JSX in react and how to use JSX in react? with examples respectively. You may also have a look at the following articles to learn more –
https://www.educba.com/react-jsx/
CC-MAIN-2021-49
refinedweb
972
57
Next: Fill Values, Previous: nc_get_varm_ type, last dimension for the variable in C). zero for C. If the length of the string to be written is n, then the vector of edge lengths will specify n in the character-position dimension, and one for all the other dimensions:(1, 1, ... , 1, n). In C, fixed-length strings may be written to a netCDF dataset without the terminating zero byte, to save space. Variable-length strings should be written with a terminating zero byte so that the intended length of the string can be determined when it is later read. Here is an example that defines a record variable, tx, for character strings and stores a character-string value into the third record using nc_put_vara_text. In this example, we assume the string variable and data are to be added to an existing netCDF dataset named foo.nc that already has an unlimited record dimension time. #include <netcdf.h> ... int ncid; /* netCDF ID */ int chid; /* dimension ID for char positions */ int timeid; /* dimension ID for record dimension */ int tx_id; /* variable ID */ #define TDIMS 2 /* rank of tx variable */ int tx_dims[TDIMS]; /* variable shape */ size_t tx_start[TDIMS]; size_t tx_count[TDIMS]; static char tx_val[] = "example string"; /* string to be put */ ... status = nc_open("foo.nc", NC_WRITE, &ncid); if (status != NC_NOERR) handle_error(status); status = nc_redef(ncid); /* enter define mode */ if (status != NC_NOERR) handle_error(status); ... /* define character-position dimension for strings of max length 40 */ status = nc_def_dim(ncid, "chid", 40L, &chid); if (status != NC_NOERR) handle_error(status); ... /* define a character-string variable */ tx_dims[0] = timeid; tx_dims[1] = chid; /* character-position dimension last */ status = nc_def_var (ncid, "tx", NC_CHAR, TDIMS, tx_dims, &tx_id); if (status != NC_NOERR) handle_error(status); ... status = nc_enddef(ncid); /* leave define mode */ if (status != NC_NOERR) handle_error(status); ... /* write tx_val into tx netCDF variable in record 3 */ tx_start[0] = 3; /* record number to write */ tx_start[1] = 0; /* start at beginning of variable */ tx_count[0] = 1; /* only write one record */ tx_count[1] = strlen(tx_val) + 1; /* number of chars to write */ status = nc_put_vara_text(ncid, tx_id, tx_start, tx_count, tx_val); if (status != NC_NOERR) handle_error(status);
http://www.unidata.ucar.edu/software/netcdf/old_docs/docs_3_6_3/netcdf-c/Strings.html#Strings
crawl-003
refinedweb
341
50.57
I'm having troble with eepro100 on 2.3.99-prex. It generates timeout error very often. I thought it is alpha platform problem but it's new driver's bug. There's a race condition problem in speedo_start_xmit(). The driver does read-modify-write and mean while 8255x write something to the same address. So I change the operation automic. Old driver(in 2.2.14) doesn't have the problem. What about seperating one 4bytes field to two 2byte fields. Soohoon. diff -w drivers/net/eepro100.c ~/linux/drivers/net/eepro100.c 899c899 < /* #if 0 - Alphas need this or else they come up in 10 Mbit mode */ --- > #if 0 916c916 < /* #endif */ --- > #endif 1221,1223c1221 < // last_cmd->cmd_status &= cpu_to_le32(~(CmdSuspend | CmdIntr)); < clear_bit(30, &last_cmd->cmd_status); < clear_bit(29, &last_cmd->cmd_status); --- > last_cmd->cmd_status &= cpu_to_le32(~(CmdSuspend | CmdIntr)); This archive was generated by hypermail 2b29 : Mon May 15 2000 - 21:00:29 EST
http://lkml.iu.edu/hypermail/linux/alpha/0005.1/0004.html
CC-MAIN-2019-04
refinedweb
149
60.61
Help to get Live Stream from an Industrial Camera few days before I posted a query to get a live stream from an industrial camera which is of baumer company. Someone replied to ask to respected company for code so I asked and got the code. Code: import sys import neoapi result = 0 try: camera = neoapi.Cam() camera.Connect() camera.f.ExposureTime.Set(10000) image = camera.GetImage() image.Save("getting_started.bmp") except (neoapi.Exception, Exception) as exc: print('error: ', exc.GetDescription()) result = 1 sys.exit(result) Now here the module neoapi is incomplete it almost shown numbers of file not found. I am using pycharm community version and python version is 3.7. Now I need help if there is another package which is stronger or equal to this neoapi module which is used to get live stream or image or is their some better page, from where i can download the completed version of neoapi Note: Already used opencv ant matplot
https://imaginghub.com/forum/posts/1353-help-to-get-live-stream-from-an-industrial-camera
CC-MAIN-2022-40
refinedweb
162
56.66
On 30 août 2011, at 15:32, Emmanuel Lecharny wrote: > Hi guys, Hi, > we just had a private convo with Pierre-Arnaud about coding rules. We are not following exactly the same type of rules in Studio and in ADS, which is quite normal. There are some reason why there is a divergence. As we've seen in our private convo with Emmanuel, the divergence is very very subtle and it's mostly a divergence on "unwritten" rules that we can't find in our coding standards documentation... The rest of rules are clearly well followed (except some very very old parts of code that haven't been touch for years now). > I think we need to discuss a few things here. > > Currently, we have a small coding standard page : > > It's pretty simple, with not a lot of rules. Both ADS and Studio are more or less following those rules which were established a long time ago (there are still some very old files in ADS which are not following those rules, but with more than 3000 files on the project, we won't spend one month reviewing all of those files one by one...) Same thing for Studio. Some pretty old files may not be following *all* the rules. > I'd like to add a few more rules, at least for ADS, and suggest that Studio keep a slightly different sets of rules, but in any case, I'd like to see all the rules added to the wiki. > > Here is what I think would be good for ADS : > - add a blank line before each 'if', 'for', 'do', 'switch', 'case' unless the previous line is a '{' In most cases I agree, but I find some cases where I prefer leaving the if close to the previous expression. Especially in cases where I get a variable and I want to test something on it just after. Here's an example: >> // Testing variable >> SomeType variable = anotherVariable.getVariable(); >> if ( variable.hasFlag() ) >> { >> [...] In that particular case, IMO, it helps grouping expressions for a better readability. > - get rid of trinary operator ( expr ? op1 : op2 ) I would prefer keeping it as it's very handy for variable nullity checks. Here's an example: >> return ( ( variable == null ) ? "null" : variable ); I prefer the compact format instead of this: >> if ( variable == null ) >> { >> return "null"; >> } >> else >> { >> return variable; >> } Now, if I'm the only one liking it, I will refrain myself from using it in the future... ;) > - add a blank line before each 'return' +1 > - in if ( expr ), we should use '(' and ')' for expressions containing an '==' or any other logical connector +1 > We also may want to add some rules for pom.xml. +1 Even though I think we already share the same rules, having them written is always a plus. Especially for newcomers. > Typically, what I'd like to see is a blank line between each element like <dependency>. Here is an example : > > <dependencies> > <!-- Apache Directory Studio library plugins dependencies --> > <dependency> > <groupId>org.apache.directory.shared</groupId> > <artifactId>shared-ldap-model</artifactId> > <scope>provided</scope> > </dependency> > > <dependency> > <groupId>org.apache.directory.shared</groupId> > <artifactId>shared-util</artifactId> > <scope>provided</scope> > </dependency> > > This is to separate all the items which have the same dame, for clarity sake. Why not. I liked the idea of grouping a set of dependencies under a common "label" like this "Apache Directory Studio library plugins dependencies" in your example. But adding a blank line doesn't really break either... So, +1. One more thing I'd like to add to pom.xml guidelines, I really like when dependencies are ordered in alphabetical order. In Studio, we deal with a lot of dependencies for each project (mostly Eclipse dependencies + a few others) and having them ordered REALLY helps when looking for something, IMO. > For Studio, I let Stefan and Pierre-Arnaud define the rules they prefer to use, as i'm not working often on its code. For the sake of a better interaction and simplicity, I think we should share the same rules across the whole Directory project. As I'm mostly the only dissident on some of the facts above, I can and will adapt myself. Not a big deal (except for the trinary operator... ;) ). Regards, Pierre-Arnaud > Any comments ? > > -- > Regards, > Cordialement, > Emmanuel Lécharny > >
http://mail-archives.apache.org/mod_mbox/directory-dev/201108.mbox/%3C07AF0E26-47A5-4801-9050-6AB00992954A@marcelot.net%3E
CC-MAIN-2014-52
refinedweb
712
62.58
On the last day of GrafanaCONline in June, our CEO Raj Dutt announced that Grafana Labs had acquired k6, the company behind the open source load-testing tool. In fact, our relationship with k6 had started more than two years earlier. At the beginning of 2019, we were working on replacing Grafana’s “remember me” cookie solution with a short-lived token solution for the Grafana 6.0 release. During the development, we wanted to test how the refresh of short-lived tokens would behave when the system is put under heavy load and/or when scaling out and running multiple Grafana instances. Hence the search began for an OSS load-testing tool. I only had some limited experience using Locust, but it was implemented in Python and also required load tests to be implemented in Python, a language I’ve never used. One nice thing I remembered I enjoyed back then was that it had a UI to control and visualize the load test results. The Grafana backend and most of Grafana Labs’ other software is implemented using Go. So we looked for a tool that could be run and managed with the same simplicity and ease of use as other Go tools and services, and that still would allow load tests to be implemented in a language many of us already use. Enter k6 After searching a bit, I happened to find k6, which checked off the OSS and Go requirements. Load tests are written using JavaScript ES2015/ES6 — a good fit since the Grafana frontend/UI already uses it and some of the backend developers, including me, are familiar with it. Before trying it out, I remember I was really impressed by the documentation and examples showing the simplicity of the tool and how easy it looked to get started writing and running a load test. k6 is a high-performing load testing tool, scriptable in JavaScript. To achieve this, one of the trade-offs is that it doesn’t run in a browser, hence it doesn’t render web pages the same way a web browser does. The advantage of this approach is that it is significantly less resource-intensive, and thus more cost-effective, than other browser-based testing tools. Due to this, k6 load tests are preferably written targeting a HTTP API and/or HTTP endpoints returning non-visual responses that are easy to interpret for machines, like JSON. When running a k6 load test, there’s a large number of options, but as a simplified version, you can use a fixed duration or a fixed number of iterations together with a number of virtual users (VUs) to simulate load. In addition, k6 supports two different ways to verify the outcome of load tests: checks (assert) and thresholds (pass/fail). For more information, see the k6 documentation. Here’s what a basic k6 script looks like: import http from 'k6/ import { sleep } from 'k6'; export default function () { sleep(1); } I started to write a load test that would simulate a user loading a Grafana dashboard that refreshes every 5 seconds. The scenario consisted of an initial iteration, called a setup function, to log in the user, followed by next iterations making one annotation request and 20 data source requests each. Each iteration was verified using checks, e.g., the user was authenticated with a properly set login cookie set. In addition, k6 verifies whether each HTTP request has returned an expected 200 OK status code by default (though this behavior can be changed). To make the load test code easier to read, the code for providing a HTTP client for interacting with Grafana’s log-in endpoint and HTTP API and utility functions have been extracted to a reusable module. This is currently shared by all load tests. We also created a shell-script that acts as a convenient wrapper around the k6 Docker image. It allows us to provide an API for running load tests with sane defaults, while letting us override certain parameters when running local vs. scale-out scenarios. Check out all the details and readme in the load test directory of the Grafana GitHub repository. Compared with my earlier experience using Locust, I really enjoyed the fact that with k6, the development workflow is optimized for developers. The ability to run a load test in the terminal and get instant feedback in a nicely organized output that’s easy to share in a textual representation is really nice and makes my life as a developer easier. One of the other great things that I didn’t realize at first is the ability to monitor Grafana or your application while the k6 load tests are running. We have a Grafana high availability (HA) test setup using Docker Compose. With this setup, we can scale up the number of Grafana instances we want, use MySQL or Postgres as the backend database, and use Prometheus and Loki to ingest Grafana and database metrics and logs. We can then run our k6 load test against this setup, and alongside the k6 load test results we can visualize Grafana, Docker, and database metrics stored in Prometheus, and tail logs stored in Loki, allowing us to identify potential bottlenecks and problems and/or help us validate that certain load tests perform as expected. Grafana ❤️ k6 Using k6 to verify the implementation of the new short-lived token solution was a great success. We managed to identify bottlenecks and errors in the code before actually shipping the code. A couple months later, we got reports that upgrading to Grafana v6.2 in combination with using the Grafana auth proxy resulted in a lot of 500 internal server errors when trying to load data for dashboard panels. An auth proxy load test was implemented to reproduce the problem, develop a solution, and verify the solution by running the load test comparing the results. k6 once again helped us track down a nasty bug. Here are some other examples of how we’ve successfully used k6: - A suggested improvement of the short-lived token solution could be verified by running the existing load tests, reducing risks for introducing new bugs, and getting it released to end users quickly. - Improved database query performance by implementing a k6 load test, running it to test and tune query performance of a slow database query using different indices and a rewrite of the original query. - As mentioned in this blog post, we used k6 to investigate how to protect against DDoS attacks and optimize the throughput for rendering images. Conclusion We’ve already gotten a lot of value out of k6 load testing, and now that k6 is part of the Grafana Labs family, I’m looking forward to working with the tool even more. For anyone who’s going down the same road we were on back in 2019, you should know that k6 already integrates well with CI/CD tools, and k6 Cloud can be used to schedule regular load tests so that you can keep an eye on how performance changes over time. This should allow you to be more proactive and catch bugs and problems earlier. I’m happy to report that there’s also an official k6 Cloud plugin for Grafana, so you can view your test results stored in k6 Cloud in Grafana. Alternatively, you can also use k6’s Prometheus remote_write feature to send metrics to Grafana Cloud. To learn more about using k6 with Grafana, be sure to sign up for the free webinar on Sept. 16, “Intro to load testing with Grafana and k6.”
https://grafana.com/blog/2021/08/23/how-we-use-the-k6-load-testing-tool-for-developing-grafana/?pg=webinar-intro-load-testing&plcmt=resources
CC-MAIN-2022-21
refinedweb
1,270
55.47
errno.h(0P) POSIX Programmer's Manual errno.h(0P) This manual page is part of the POSIX Programmer's Manual. The Linux implementation of this interface may differ (consult the corresponding Linux manual page for details of Linux behavior), or the interface may not be implemented on Linux. errno.h — system error numbers #include <errno.h> Some of the functionality described on this reference page extends the ISO C standard. Any conflict between the requirements described here and the ISO C standard is unintentional. This volume of POSIX.1‐2008. Additional error numbers may be defined on conforming systems; see the System Interfaces volume of POSIX.1‐2008. None. None. The System Interfaces volume of POSIX.1‐2008, Section 2.3, Error errno.h(0P) Pages that refer to this page: signal.h(0p), errno(3p)
https://man7.org/linux/man-pages/man0/errno.h.0p.html
CC-MAIN-2020-50
refinedweb
137
53.07
Automatic Reporting in Python - Part 1: From Planning to Hello World goyder Updated on ・7 min read I'd like to document and step through the execution of a simple concept in Python: creating an automatic HTML reporting tool. The outcome would be a single stand-alone HTML file. An HTML file is a great reporting tool: even stripped of a back-end server, you can package up a good volume of info in a page and have handy-dandy interactivity. Now, to be fair: this is not a terribly exciting or sexy project. All the same, automatically producing reports is a fantastic trick to have up your sleeve, especially in business environments. Automate the boring stuff, as they say. Personally, I mainly intend to use this to automate reporting of model performance in the machine learning space, but you could of course use this for any context! Naturally, tools like this already exist. But I want to make my own, for the experience and flexibility it offers me. How is this guide presented? Rather than just providing a dump of code that works, I'd like to incrementally work through the development, step-by-step. You'll see what I see - code what I code! Personally, I've always found this kind of tutorial more effective as: - It gives an insight of how someone else approaches a problem - It actually reflects how I code - feature by feature, commit by commit. Who is this for? A user "knee-deep" in Python is assumed. I'll not run over standard syntax and the like, but I'll be sure to stop and explain anything particularly tricky. Wherever possible, I'll refer back to cleverer and clearer explanations. Step Zero - Stop for a minute I'm actually a chemical engineer by background. While I certainly gained and applied a lot of useful and/or esoteric knowledge from this background, by far the most useful bit of advice I ever learnt was probably also the most simple: When approaching a new problem, draw a picture. By "draw a picture", I mean to externalise the problem. Sketch it out and get thoughts and ideas out on paper. Before tackling this (relatively small-scale) project, I sat down and spent 10-15 minutes sketching out how I thought I might approach it, what parts would move, what parts would stay static, and a (very) rough structure of the project. My own nigh-incomprehensible sketch is as follows. Some key learnings from early planning Based on my early "planning", some things came clear: - An HTML templating system makes a lot of sense. These systems are designed to input dynamic content into static template: this sounds exactly like what we're after. In Python, Jinja is a common choice, and may be familiar to anyone who has played with Flask. - In the machine-learning space, I'm constantly finding new things I might want to look out for, or new ways to compare models, or new ways to analyse a dataset - so both the content of a report and the features I can pack into any report should be flexible. - A lot of the data I work with is in .csv format, so having tools to work with that and generate interrogatable HTML blocks from it would be neat. Step One - Lay a foundation For pretty much any size project bigger than tinkering in the command line for a couple of minutes, I'm fond of setting up a Github repo and a consistent environment. This, I think, will be a pretty small-scale project, so I'm not terribly concerned with laying down a full project structure, but it's worth being comfortable with this for further reference. This: - Encourages good habits in keeping the project clean - Helps me jump from my Mac laptop to my Linux desktop (or any other environment, for that matter) with a minimum of fuss A few quick goals to start us off: Set up a virtual environment We want to create an isolated instance of Python for this project - or "virtual environment" - rather than using whatever general installation is present on this machine. This isolates our dependencies and makes it easier to move the project around. I'm working in Pycharm, which gives you the option to create new virtual environment from the start. To make this transferable, I'll keep a requirements.txt file in the root of my project directory which details what packages are required in the environment. There are many, many, many guides on this topic, and they're good to refer to for more specific details. Set up a Git/Github repo To implement version tracking and allow ready transport to and fro from Github, we'll initialise a Git repo locally (in the project folder) and create a new repo in Github. The local Git repo can then pushed to Github. A succint guide can be found on Github.com. As a matter of course of working in a Git/Github repo, we'll add the following to the root project directory: - A readme.mdfile that briefly describes the project, and - A .gitignorefile that indicates which files and folders should not be tracked by Git and pushed to Github. This might include automatically generated files (from the IDE, or from the virtual environment, for instance), sensitive files and config data, or anything else you've created locally that doesn't need to be shared with the world. For me, this looks like: # .gitignore # Don't add the virtual environment, IDE, and Jupyter notebook info venv .idea .ipynb_checkpoints Write-up.ipynb Github status At this point, the skeleton of your project should look a bit like this. Step Two - "Hello, World" templating At this point, we have a very simple project structure that we can start populating with code and templates. To carry out a bit of a smoke-test and give me somewhere to build off of, I'd like to create the simplest possible report. This first implementation should input no information, and output a simple "Hello, world!" HTML page. A brief primer on templating This project is built on the concept of templating and template processors. This is an enormous but very crucial field in web publishing. In a crude explanation: we separate the structure of an HTML page and the content that is to be published. When it comes time to generate a new webpage (or in this context, a report!) we can input the content into a standardised structure and get a new webpage out. Templating is well and truly ubiquitous now, but if you'd like an example of life without consistent manual or automatic templating, you can find many unironically charming examples in a Geocities archive. Building 'hello, world' functionality Building on this distinction between structure and content, we can create very simple examples for both to test the system. Structure Our structure, in this case, is a near-empty HTML page with locations for data to be input. We'll call this a "template", and we'll store this and others under a template folder in our root project directory. We'll create a new HTML file under this folder - {project_folder}/template/report.html. The contents of this file are as follows: <!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <title>{{ content }}</title> </head> <body> {{ content }} </body> </html> Note the elements here within curly braces (in this case double curly braces - {{ and }}). This is where dynamic content will be entered. Template processors such as Jinja are very powerful and allow many features to be present in templates beyond simple insertion. Take a look at the first example on the Jinja homepage and see if you can make sense of it. Content Our content, for now, can be as simple as hello, world!. We'll create a new file in the root of the project directory called {project_folder}/autoreporting.py and hardcode our 'content' to begin with. content = "Hello, world!" Functionality We have structure and content - now we just need to get them combined using Jinja. Firstly, create an outputs directory and add it to your .gitignore file. We'll dump what we create in this folder, but there's no reason to share whatever ends up in here in your repo. Jinja requires an Environment object to store and define things like the config and loader - i.e. where we will pull our templates from. In this case, we're running off the local filesystem, so a FileSystemLoader specified to search in the templates directory will do us just fine. With our env instance, we can render our basic template and write this to file. Our autoreporting.py script now looks like this: from jinja2 import FileSystemLoader, Environment # Content to be published content = "Hello, world!" # Configure Jinja and ready the template env = Environment( loader=FileSystemLoader(searchpath="templates") ) template = env.get_template("report.html") def main(): """ Entry point for the script. Render a template and write it to file. :return: """ with open("outputs/report.html", "w") as f: f.write(template.render(content=content)) if __name__ == "__main__": main() Note the argument to template.render, content=content. This links the template and our code. The first content refers to the {{ content }} in the template, while the second is the string defined in the script. We define this relationship and the string is fed into the template to make a substitution. Results so far If you run this script and all goes well, a new report.html file will be written under outputs/. Open this file and behold what you have created! This certainly meets the criteria of "very simple, but functional." If you inspect the HTML of the page, you'll note that the {{ content }} tags in the template were neatly replaced by the Hello, world! string, which is the crux of this affair. Github status You've developed a new feature, so it's a good point to commit and push to Github. Your repo should probably look a bit like this. Next Steps The reporter walks and works, but we certainly don't have any sort of meaningful input or flexibility at this point. Our next steps will be to explore how we can read in data and report on it, and start working with JavaScript and CSS. From homelessness to making six figures: On learning how to code. A reflection of my life post High School. Perfectly succinct advice. Loved this post. I find it applies to all problems, even those outside the technical realm. I've begun to learn python this week and your post is really useful for "applying" the recent gathered knowledge. Thanks. Glad I could help, Renan!
https://dev.to/goyder/automatic-reporting-in-python---part-1-from-planning-to-hello-world-32n1?utm_source=additional_box&utm_medium=internal&utm_campaign=regular&booster_org=
CC-MAIN-2019-26
refinedweb
1,786
63.19
Strategy Copypackage com.journaldev.design.strategy; public interface PaymentStrategy { public void pay(int amount); } Now we will have to create concrete implementation of algorithms for payment using credit/debit card or through paypal. CreditCardStrategy.java Copypackage"); } } PaypalStrategy.java Copypackage strategy pattern example algorithms are ready. We can implement Shopping Cart and payment method will require input as Payment strategy. Item.java Copypackage; } } ShoppingCart.java Copypackage strategy pattern example setup with a simple program. ShoppingCartTest.java Copypackage: Copy50 paid using Paypal. 50 paid with credit/debit card Strategy Design Pattern Class Diagram Strategy Design Pattern. rup says Really nice example with explanation. Smital Patel says Instead of passing the PaymentStrategy as method argument, it should be a instance member of that class and should be passed while creating the object of ShoppingCart. Passing it as method argument is wrong. kumar says can you please explain how we could have used composition here? Prabakar says using factory pattern also we can decide instance of PaymentStrategy . Pitambar says Nice post!!! Thank you very much for the Ed Chen says Can I change the PaymentStrategy interface to be an abstract class or an normal class? Does it violate the spirit of the strategy pattern if I change the interface to class ? I am kinda confusing by using an interface or using an class.. Murshid Alam says Hi public void pay(PaymentStrategy paymentMethod){ int amount = calculateTotal(); paymentMethod.pay(amount); } Here PaymentStrategy is an interface which is holding the reference of implemented class, is it not Run time Polymorphism .? Strategy Design pattern and Runt time Polymorphism both are same..? Alan Smith says This example was not correct sam says Why ? Murat KG says Thank you! Clear example Shiva Shankar says simply superb explanation. Thanks 🙂 Arun SIngh says thats easy, thanks Pankaj Manas says The design pattern is well exaplained really. Thanks a lot. Boopathi says It would be more clear if we pass the interface reference. public class ShoppingCartTest { public static void main(String[] args) { ShoppingCart cart = new ShoppingCart(); Item item1 = new Item(“1234”,10); Item item2 = new Item(“5678”,40); cart.addItem(item1); cart.addItem(item2); //pay by paypal PaymentStrategy paymentStrategy; paymentStrategy= new PaypalStrategy(“myemail@example.com”, “mypwd”); //pay by credit card cart.pay(paymentStrategy); paymentStrategy=new CreditCardStrategy(“Pankaj Kumar”, “1234567890123456”, “786”, “12/15”); cart.pay(paymentStrategy); } } Rafal says Great !!! Ashish Patel says Thank you very much for such a very simple and clear definition&example of same. Sachin Kakkar says Can we say method overriding and overloading also implementation of Strategy design pattern as in overriding based on the object of class method gets invoked and this is decided at the run time. and in the case of overloading method invocation based on parameters passed. Does both are also implementation of Strategy design pattern. Rahul says Keep up the good work Fuhrmanator says I used your example in an answer on Stack Overflow: Sushil Jain says Thank you very much for such a very simple and clear definition&example of same. aziz says thanks maheraj says nice explanation Bhavani says Very well explained. Thanks Ravi says Thanks for your effort. Simple and clear. raed says well done , but as i know with Strategy Design Pattern the Object of the class will change his Type i mean change the behaviour of the Object at the runtime ?? BG says really nice explanation thanks for the doc Gabriel says Thanks for explain the pattern in a simple and nice way. Aashu says Can we say strategy pattern is replacement for Switch Case / If Else ? parag says Hi Pankaj, Just want to say thanks for describing the design pattern so nicely. Raja says Hello sir thank you very much for this information. Really you are the rock of Java…………..
https://www.journaldev.com/1754/strategy-design-pattern-in-java-example-tutorial
CC-MAIN-2019-13
refinedweb
621
58.58
For every line that is marked with a "# ?" symbol, try to determine what Python would print in the interactive interpreter. Then check to see if you got the answer right. def square(x): return x*x def neg(f, x): return -f(x) neg(square, 4) # ? 1 def first(x): x += 8 def second(y): print('second') return x + y print('first') return second f = first(15) # ? 2 f(16) # ? 3 def foo(x): def bar(y): return x + y return bar boom = foo(23) boom(42) # ? 4 foo(6)(7) # ? 5 func = boom func is boom # ? 6 func = foo(23) func is boom # ? 7 Define a function make_derivative that returns a function: the derivative of a function f. Assuming that f is a single-variable mathematical function, its derivative will also be a single-variable function. When called with an int a, the derivative will compute the slope of f at the point a. The formula for finding the derivative of f at point a is where h approaches 0. We will approximate the derivative by setting h to a very small number: 0.00001. The closer you make h to 0, the more accurate the derivative approximation will be. def make_derivative(f, h=1e-5): """Returns a function that is the derivative of f. >>> square = lambda x: x*x >>> derivative = make_derivative(square) >>> result = derivative(3) >>> round(result, 3) 6.0 """ "*** YOUR CODE HERE ***" Note: make_derivative itself is not the derivative; the function it returns is. Now, we will visit the idea of helper functions. Sometimes, a function must perform a lot of computations -- so many computations, in fact, that it can get messy for the programmer to write. We can instead define a helper function within the parent function that will take care of some of the computations. The parent function then calls the helper function as needed. Recall that a quadratic function is a function of the form: The quadratic equation is a classic algebraic formula used for finding the roots of quadratic functions. Part of the quadratic equation involves finding the discriminant (the part under the square root). The quadratic equation is where the discriminant, represented by the delta, is Define a function find_root that, given the coefficients a, b, and c of a quadratic function, will compute a root of the function (normally, the quadratic equation has a "+" or "-" sign -- we will focus on the "+" for now). Your implementation should use a helper function called discriminant, which also takes in the three coefficients a, b, c, and computes their discriminant. Remember, find_root is not returning the function discriminant; rather, find_root will call discriminant to help with some calculations. from math import sqrt def find_root(a, b, c): """Returns one of two roots of a quadratic function. Since there are two roots to quadratics, return the the larger root. In other words, the + or - part of the quadratic equation should just be replaced with a + >>> find_root(1, 2, 1) -1.0 >>> find_root(1, -7, 12) 4.0 """ "*** YOUR CODE HERE ***" Newton's method is an example of a problem-solving method called iterative improvement. Iterative improvement starts with an initial guess to the problem; it then uses iteration (like a while loop) to update the guess until it gets close to the optimal solution. This next application, which will make use of iterative improvement, is called the Hill Climbing problem. Given a certain unknown terrain, you must try to climb to its highest point. The key feature is that you have no knowledge of the terrain beforehand, so you can't determine its highest point just by "looking" at it. This is an example terrain, defined by the mathematical function Its contour plot is the following (think of this as a bird's eye view of the terrain). As you can see, the highest point of the above terrain is at (0, 0), with an elevation of 0 (every other elevation is negative). In this simplified example, you will start at some arbitrary initial point (x, y). You will then choose one of two actions: go north, or go east. (i.e. along the y-axis, or along the x-axis). You will make your decision based on the following simple heuristic: always choose the direction that will take you to a higher elevation. For example, if going north gets you to elevation 4, while going east only gets you to elevation 3, you'll (greedily) choose to go north. So how do you know when to stop? If going north or going east both end up taking you to a lower elevation than your current elevation, you can (naively) declare that you are at the highest point in the terrain. Note: In general, you'd need to avoid local maxima. For simple functions, such as the one proposed above, this heuristic may work. But for other functions, this heuristic will not in general find the maximum value. Two key components of iterative improvement are the update function and the is_done function. The update function is responsible for updating the current guess; the is_done function is responsible for determining when the current guess is 'sufficiently close to' the optimal value. climb_update Implement climb_update. This is a higher-order function that takes in two arguments: terrain, a mathematical function that, given a point (x,y), returns the elevation at the point; and stepsize, which is an integer that determines how large each step is. climb_update should return a function that takes two arguments: x, the x-coordinate of the current guess; and y, the y-coordinate of the current guess. climb_update will take the current guess (a coordinate pair) and choose a coordinate to the north or to the east, depending which elevation is higher. To determine the elevation at (a, b), call terrain(a, b). The parameter stepsize indicates the distance of each step. For example, if the current location is (4, 5), and stepsize is 0.5, going east takes you to (4.5, 5); going north takes you to (4, 5.5). This is an example of quantizing (or discretizing) the input function - since there are an infinite number of points on a continuous function, we enforce a pre-determined stepsize in order to allow us to work with the function in a tractable manner. You can imagine that varying the stepsize will lead to a performance/accuracy tradeoff! def climb_update(terrain, stepsize=0.5): """Given a terrain function, and a stepsize, return an update function that, given an (x,y) guess, returns an updated guess. >>> terrain = lambda x, y: -x**2 - y**2 >>> start_x, start_y = -1, -2 >>> update = climb_update(terrain) >>> update(start_x, start_y) # should move north (-1, -1.5) """ def update(x, y): "*** YOUR CODE HERE ***" return update make_ismax Next, implement make_ismax. This function takes in a terrain, and returns a function that checks if a given coordinate pair is the highest point of that terrain. We won't actually be checking that a given coordinate pair (x, y) is a mathematical maximum for the terrain (this would be trying to solve the problem we're originally trying to solve!). Instead, we'll use the following naive heuristic: For example, assume the current location (4, 5) is at elevation 5. Say that the stepsize is 0.5. Going north to (4, 5.5) gets you to elevation 4; going east to (4.5, 5) gets you to elevation 3. Your current elevation is higher than both the northern and eastern points, so is_max (which is returned by make_ismax) should return True. def make_ismax(terrain, stepsize=0.5): """Given the terrain, and a stepsize, return a function that, given a guess, tries to determine if the guess is indeed the maximum of the terrain. >>> terrain = lambda x, y: -x**2 - y**2 >>> is_max = make_ismax(terrain) >>> is_max(0, 0) True >>> is_max(-1, -1) False """ def is_max(x, y): "*** YOUR CODE HERE ***" return is_max iter_improve Finally, implement iter_improve, the function that continually iterates until an optimal solution is found. iter_improve takes four arguments: an update function, like the one returned by climb_update; an ismax function, like the one returned by make_ismax; x, and the (x,y) coordinates of the initial guess. Your implementation should make use of a while loop that continues until the maximum has been reached. Each time you go through the loop, you should keep track of the updated guess (which is a coordinate pair). If you need help, you can look at the iter_improve function for Newton's method in the lecture notes. def iter_improve(update, is_done, x, y): """Tries to find an (x,y) that achieves the goal specified by is_done, by iteratively updating an initial guess. >>> terrain = lambda x, y: -x**2 - y**2 >>> update = climb_update(terrain) >>> ismax = make_ismax(terrain) >>> x, y = iter_improve(update, ismax, -3, -5) >>> round(x, 3) 0.0 >>> round(y, 3) 0.0 """ "*** YOUR CODE HERE ***" You can use the following function to solve the Hill Climbing problem for your own terrain: def climb(terrain, start_x, start_y): update = climb_update(terrain) ismax = make_ismax(terrain) return iter_improve(update, ismax, start_x, start_y) One limitation you might have noticed is that the choice of the initial guess (start_x, start_y) is crucial towards finding the optimal solution. In particular, if (start_x, start_y) is not to the south or to the west of the terrain's maximum, then climb will not find the terrain's maximum. This is because climb_update only can move north or east. If you're up for the challenge, you can modify the climb_update function to also include movements that go south and west! This extension will make climb a little more robust. Another inherent limitation to the iter_improve framework is the stepsize. First - can you think of a terrain function that, for a stepsize=0.5, climb will be unable to find the maximum height? What could you try to do to fix this limitation? A lambda expression is a quick way to define functions without actually using def statements. In other words, the same function can be created in two ways: using def statements; and using lambda expressions. For example, the following function definition def double(x): return 2*x is equivalent to the following lambda function: square = lambda x: 2*xNotice that there is no returnstatement in the lambdaexpression; Python will automatically return the expression following the colon. This is a fundamental limitation of lambdain Python - the 'body' of a lambdamust be a single expression. This implies that you cannot convert a multi-line def statement into a lambdaexpression. For every line that is marked with a "# ?" symbol, try to determine what Python would print in the interactive interpreter. Then check to see if you got the answer right. lambda x: 2*x # ? 1 square = lambda x: x*x square # ? 2 square(4) # ? 3 hello = lambda : print('hello') hello(3) # ? 4 hello() # ? 5 adds = lambda x, y: x + y adds(3) # ? 6 adds(4, 5) # ? 7 foo = adds foo(6, 7) # ? 8 def make_adder(n): return lambda m: m+n f = make_adder(4) f(2) # ? 9 make_adder(5)(6) # ? 10 Because lambda functions can't contain multi-line statements, it is not possible to incorporate while loops in lambda functions. Try the following: g = lambda x: while x > 0: print(x); x -= 1 It should raise a SyntaxError. However, it is possible to put an if/else statement all on one line. Consider the following: abs = lambda x: x if x > 0 else -x abs(6) # ? abs(-1) # ? The one-line if/else statement reads like English: "return x if x is greater than 0, else return -x." Using only lambda expressions, recreate the piecewise function that you wrote for Homework 1. This time, however, you may only use lambda expressions! Recall that piecewise is a higher-order function that takes three arguments: the left-hand mathematical function f; an int b; and the right-hand mathematical function f. piecewise = ________________________ negate = lambda x: -x identity = lambda x: x abs = piecewise(negate, 0, identity) abs(6) == 6 abs(-3) == 3 Remember, you may only use lambda functions to solve this problem! It is possible to have nested lambda expressions, much like you would have nested def statements. Note: If you're having trouble, you might find it helpful to first write piecewise using def statements, and then 'translate' it into an equivalent program using only lambda expressions.
http://inst.eecs.berkeley.edu/~cs61a/su12/lab/lab03/lab03.php
CC-MAIN-2018-05
refinedweb
2,062
63.19
Why can't non-default arguments follow default arguments? Why does this piece of code throw a SyntaxError? >>> def fun1(a="who is you", b="True", x, y): ... print a,b,x,y ... File "<stdin>", line 1 SyntaxError: non-default argument follows default argument While the following piece of code runs without visible errors: >>> def fun1(x, y, a="who is you", b="True"): ... print a,b,x,y ... All required parameters must be placed before any default arguments. Simply because they are mandatory, whereas default arguments are not. Syntactically, it would be impossible for the interpreter to decide which values match which arguments if mixed modes were allowed. A SyntaxError is raised if the arguments are not given in the correct order: Let us take a look at keyword arguments, using your function. def fun1(a="who is you", b="True", x, y): ... print a,b,x,y Suppose its allowed to declare function as above, Then with the above declarations, we can make the following (regular) positional or keyword argument calls: func1("ok a", "ok b", 1) # Is 1 assigned to x or ? func1(1) # Is 1 assigned to a or ? func1(1, 2) # ? How you will suggest the assignment of variables in the function call, how default arguments are going to be used along with keyword arguments. >>> def fun1(x, y, a="who is you", b="True"): ... print a,b,x,y ... Reference O'Reilly - Core-Python Where as this function make use of the default arguments syntactically correct for above function calls. Keyword arguments calling prove useful for being able to provide for out-of-order positional arguments, but, coupled with default arguments, they can also be used to "skip over" missing arguments as well. From: stackoverflow.com/q/16932825
https://python-decompiler.com/article/2013-06/why-cant-non-default-arguments-follow-default-arguments
CC-MAIN-2019-47
refinedweb
294
62.58
The SSIS framework provides a Web Service task which executes a Web Service method. You can use the Web Service task for the following purposes: This article defines a step by step approach to using a Web Service call in SQL Integration Services. First, create a web service project. Now, expose a method call in the Web Service: public class SSISService : System.Web.Services.WebService { [WebMethod] public string HelloMoon() { return "Hello Moon"; } [WebMethod] public int Multiply(int nParam1, int nParam2) { return nParam1 * nParam2; } } Create an SSIS package: Add a web service task: Next, modify the Web Service task: Now, define the HTTP connection: The next step is to define the WSDL file: Define the Web Service Task inputs: Now, define the Web Service output. The output of the Web Service can be written to variables or to an output file. This sample outputs the results from the Web Service to a file system file that is defined using the File Connection Manager Editor (Figure 11). The following is the encoded output from the Web Service, stored in a test.txt file: <?xml version="1.0" encoding="utf-16"?> <int>200<.
http://www.codeproject.com/Articles/24999/Calling-a-Web-Service-from-a-SQL-Integration-Servi?fid=1187437&df=90&mpp=10&sort=Position&spc=None&tid=4264216
CC-MAIN-2014-52
refinedweb
190
57.1
04 January 2012 10:47 [Source: ICIS news] SINGAPORE (ICIS)--Asia paraxylene (PX) spot prices increased by $38-41/tonne (€29-32/tonne) on Wednesday on the back of sharp overnight gains in crude futures and a re-emergence of buying interest from China-based end-users, sources said. Spot PX prices now stood at $1,555-1,563/tonne CFR (cost and freight) Taiwan and/or China Main Port (CMP), according to ICIS data. February shipments were concluded at $1,555/tonne CFR Taiwan and/or CMP, $1,560/tonne CFR Taiwan and/or CMP and $1,563/tonne CFR Taiwan and/or CMP. A China-based end-user said it snapped up a February shipment early in the day at $1,530/tonne CFR CMP LC (letter of credit) 90 days but this could not be confirmed. There were also gains for isomer-grade xylene (IX) prices during the day, albeit to a lesser extent. IX prices stood at $1,240-1,245/tonne FOB (free on board) ?xml:namespace> Players said the gains in IX were limited as February supply was now longer than before following CPC Corp’s announcement to sell up to 35,000 tonnes of material back into the spot market. ($1 = €0.77)
http://www.icis.com/Articles/2012/01/04/9520033/asia-px-rises-on-strong-crude-futures-end-user-buying-interest.html
CC-MAIN-2014-42
refinedweb
210
63.12
Hi all, I got a problem with serial communication. I want to communicate my PC and reader, look like this below. 2483 I got success when sending data to reader (I sent "display command" and... Type: Posts; User: ardisamudra Hi all, I got a problem with serial communication. I want to communicate my PC and reader, look like this below. 2483 I got success when sending data to reader (I sent "display command" and... Thanks for replay.. Now I understand what pop3 and imap are. Last time I got error because I didn't add certificate to my keystore. Thanks Norm and djsiavens. Hi all, I got the problem about send email If I used protocol besides smtp. I success if i was sending email with smtp protocol. But I failed if I was sending with POP, IMAP. It is the succed... Hi,, You need set object properties. Take a look these code below import java.util.Properties; import javax.mail.Authenticator; import javax.mail.Message; import... Thank you Norm, Finally I got it :) Hi Norm, Do you know about reflection in java ? I little don't understand about that. Hi norm, Yes, I use it The code will print Help me!! But it's difficult to use param on showHelp method. Please tell me if i did mistake on explanation Hi everyone, I got trouble about storing method in HashMap. I got the example but there is no parameter in method, You can see the code below import... Thanks Zaphod_b,, Sorry for late reply post :) can you give me some example. I got a problem in ubuntu Hi, anybody know how to send and receive via serial in Java ? Please share information to me Oke thanks, I got it :) Btw,JAXB looks the same JDOM2. Just because there is marshall and unmarshall in JAXB and JDOM2 not. But both of them have the same output xml Hi everyone, Is there any posibilitie to set list in xml form ? Hope for reply please :) Thanks Hello guys Anyone know about how to use Jpos Space ? Please share me Thanks :) I got the problem after update ADT and SDK, I can't run my android project. I always got Unable to build: the file dx.jar was not loaded from the SDK folder!. Please anyone help me :( Hi everyone, I got a problem httpclient that connect to ssl server. Here my function to excute httpclient public void run() { HttpClient hc = new HttpClient(); Hi Zaphod.... Thanks for your code, so the full code perhaps like this below public static void convertStr2Byte() { String strKey = "BDE540BD7E91EDACA3B0125FE004F52C"; ... Hi copeg... The current encoding have length 32. So in the array should be like this bytKey[0] = 0x42; bytKey[1] = 0x44; bytKey[2] = 0x45; ........ ........ bytKey[31] = 0x43; Hi, copeg.. I expect the byte array from the String , may be I'm wrong about array example writing. The arrray should be like this : bytKey[0] = 0xBD; bytKey[1] = 0xE5; ........ ........ Hi everyone, I get confused when to convert string to byte array. let's go to the code String strKey = "BDE540BD7E91EDACA3B0125FE004F52C"; byte[] bytKey = strKey.getBytes(); ... Ok thanks, Now I can write the log :) Hi.. Actually, I just drag and drop and then the code will be generated by netbeans. Cause I already tell in netbeans you just drag and drop :) And in netbeans, you only think about what action... Hi Kinshen09 You can see my code below /* * To change this template, choose Tools | Templates * and open the template in the editor. */ Can you describe more details ? Hi Kinshen09 You already using netbeans, but why the interface not the same like the picture? Don't u just drag and drop with that
http://www.javaprogrammingforums.com/search.php?s=259b616b2510f58f880b3ee31b427069&searchid=783993
CC-MAIN-2014-10
refinedweb
611
76.42
#include <EEPROM.h>//Pin connected to ST_CP of 74HC595int latchPin = 4;//Pin connected to SH_CP of 74HC595int clockPin = 3;////Pin connected to DS of 74HC595int dataPin = 2;int seq[14] = {1,2,4,8,16,32,64,128,64,32,16,8,4,2};void setup(){ // start serial port at 9600 bps and wait for port to open: Serial.begin(57600); pinMode(dataPin, OUTPUT); //Configure each IO Pin pinMode(latchPin, OUTPUT); pinMode(clockPin, OUTPUT);}int inByte;char inData[20]; // Allocate some space for the stringchar inChar; // Where to store the character readbyte index = 0; // Index into array; where to store the characterint address = 0;byte value;void loop(){ // if we get a valid byte, read analog ins: if (Serial.available() > 0) { // get incoming byte: //inByte = Serial.read(); //Serial.println("One way"); while(Serial.available() > 0) // Don't read unless // there you know there is data { if(index < 19) // One less than the size of the array { inChar = Serial.read(); // Read a character inData[index] = inChar; // Store it index++; // Increment where to write next inData[index] = '\0'; // Null terminate the string } } // Now do something with the string (but not using ==) if (strcmp(inData, "Read") == 0){ Serial.println("SndEprom"); sendProm(); } } for (int n = 0; n < 14; n++) { digitalWrite(latchPin, LOW); //Pull latch LOW to start sending data shiftOut(dataPin, clockPin, MSBFIRST, seq[n]); //Send the data digitalWrite(latchPin, HIGH); //Pull latch HIGH to stop sending data delay(75); }}void sendProm(){ for (int i=0; i <= 100; i++){ // read a byte from the current address of the EEPROM value = EEPROM.read(address); Serial.print(address); Serial.print(","); Serial.print(value, DEC); Serial.println(); // advance to the next address of the EEPROM address = address + 1; // there are only 512 bytes of EEPROM, from 0 to 511, so if we're // on address 512, wrap around to address 0 delay(15); } address = 0;} You made about 5 steps at once. Do this step by step. You need for example a few test sketches, before trying to run the final project.Is the Arduino board running, can you upload a sketch to it ?This is your board: you make the led of the Arduino board blink when it is attached to your board ? Check the wiring of the shift registers. Either the schematic is wrong, or you have connected them wrong.This is explanation and shows cascading for 2 shift registers: have enough pins, so you don't need cascading. If the shift registers are working, you have to check how the ULN2004 are wired. The connectors to the leds have no power pin but a GND pin. The ULN2004 is like an open-collector output, you need a power pin for the leds.What do the leds look like ? Do they have a series resistor build in. I don't think so. You can't connect the leds like that. ULN2004 only drive its outputs low, so:+5 to anode, cathode to resistor, resistor to ULN2004 output. Or do you want to control 8 led strips ? I haven't read everything in the post, but did you mean to leave QA unconnected? Keep in mind in the future projects, a ULN2803 or 2804 has 8 divers rather that the 2004 with 7. When you add the decoupling capacitors install them as close as you can to VCC and GND on the I.C.s
http://forum.arduino.cc/index.php?topic=215262.msg1576646
CC-MAIN-2014-52
refinedweb
559
62.27
. iii It is intended to be a “stable” language in sense the implementors are committed to supporting Haskell 98 exactly as specified, for the foreseeable future. program were to be portable, a set of libraries would have to be standardised too. A separate effort was therefore begun by a distinct (but overlapping) committee specified files, but it will abort the attempted load command. The environment variables and command line options used by Hugs are described in the following sections. 2.1.4 Program options)ification, unboxed types, exceptions, weak pointers, and so on. GHC comes with a generational garbage collector, and a space and time profiler. 2.2.1 Where to get it Go to the official. optionsext specifics?”.; case-sensitive values types side effects pure 3.1. ARITHMETIC x = x + 1; 13 defineogenous.:> "Five squared is " ++ show (5*5) "Five squared is 25" Prelude> read "5" + 3 8 Prelude> read "Hello" + 3 Program error: Prelude.read: no parse. 18 CHAPTER 3. LANGUAGE BASICS 3.3.2 Simple List Functions.l (+) 0 [3,8,12,5] 28 However, we get different results when using the non-associative function minus: x < 0 and, if this evaluates to True, it evaluates the then condition; if the condition evaluated to False, it evaluates the else condition). You can test this program by editing the (Section 3.1), when we wrote 5*4+3. In this,. The parentheses around the inner function are necessary; otherwise, in the fir,), (-b - sqrt(b*b - 4*a*c)) / (2,.toUpper. In Hugs, simply use toUpper. 3.6 Comments Appendix B. 32 CHAPTER 3. LANGUAGE BASICS monads do notation After all, suppose you have a function that reads a string from the keyboard. If you call this function twice, and the user types something the first Chapter 5 and then discuss monads for monads’ sake in Chapter 9. fill IO import.. first to see if their guess is too low. However, since guess is a string, and num is an integer, we first 3.8. INTERACTIVITY 35 figure out what is wrong with the above code. The error is on the last line, specifically with the term word : askForWords. Remeber first.. In brief, you can’t directly remove it. That is, you cannot write a function with type IO String unweildy. In this style (assuming an initial RealWorld state were an argument to main), our “Name.hs” program from Section 3.8. Suffice it to say that doing IO operations in a pure lazy functional language is not trivial. 5.2 Actions” ‘run’ →.” 60 CHAPTER 5. BASIC INPUT/OUTPUT first has type IO (), which is fine. The second also has type IO (), which is fine. The type result of the entire computation is precisely the type of the final first IO Int) and makes it into an action that returns the given value (for instance, the value of type); } } 62 CHAPTER 5. BASIC INPUT/OUTPUT Here, because we have the return () in the first if match, we expect the code to exit there (and in mode else do print "Too high!"; doGuessing will not behave as you expect. First of all, if you guess correctly, it will first.. file that doesn’t already exists or if you specify some bad filename like *\ˆ# @., definitions and sometimes goes by the name “eta reduction”. For instance, suppose we are writting infix functions. For instance, we cannot write: Prelude> putStrLn "5+3=" ++ show (5+3) because this is interpreted as (putStrLn "5+3=") ++ (show (5+3)), which makes no sense. However,. One way to write this would be: point-free programming $ function application 78 CHAPTER 7. ADVANCED FEATURES fstGt0 l = filter (\ (a,b) -> a>0) l We can firˆ2))) foo = map (sqrt . (3+) . .: definition . This match will succeed if the value is Custom x y z for any x,. 7.5 Guards Guards can be thought of as an extension to the pattern matching facility. They enable you to allow piecewise function definitions., Eq, and the type, Color which is going to be an instance of this class. Following that, there’s the where keyword. Finally there’s the method declaration. The first eight lines of the method declaration are basically identical. The first. 7.6.2 The Show Class The Show class is used to display arbitrary values, is recommended that you implement compare if you implement only one, though. This function returns a value of type Ordering which is defined as: data Ordering = LT | EQ | GT So, for instance, we get: Section 8.4). The Enum Class The Enum class is for enumerated types; that is, for types where each element has a successor and a predecessor. It’s methods are: 88 CHAPTER 7.. That is, negate x means −x. The Read Class: 90 CHAPTER 7. ADVANCED FEATURES. 7.7 Datatypes Revisited: field x in a datatype y to z, you write y{x=z}. You can change more than one; each should be separated by commas, for instance, y{x=z, a=b, c!): 7.8. MORE LISTS 95 fine:: difficult to read. It couldn’t be easier than with list comprehensions:)., specifies: define. . odd Like datatype, we can still derive classes like Show and Eq over newtypes (in fact, I’m implicitly assuming we have derived Eq over MyInt – where is my assumption in the above code?). Moreover, in recent versions of GHC (see Section 2.2), 109 The actual Haskell types of the class functions all have included the context Entity a =>. For example, getPosition has type Entity a ⇒ a → ??. first]: 8.4. CLASSES 111 computation definitions.. In fact, fmap is essentially a generalization of map to arbitrary structures (and, of course, lists are already instances of Functor). However, we can also define) 114 CHAPTER 8. ADVANCED TYPES, Chapter 9 Monads The most difficult first give the result the name p. The reason for the complex definition: 9.2. DEFINITION 123 law1a = do x <- return a f x law1b = do f a Law 2 The second monad law states that f >>= return ≡ f. That is, f is some computation, associative 124 CHAPTER 9. MONADS take a value, print it, read another value and then print that. Thus, the entire left hand side of the law first, says that the following two programs are equivalent: law3a = do x <- f do g <- x h y law3b = do y <- do x <- f g x h y 9.3 A Simple State Mon unweild first run m’ with the new state st’. We write a new function, ‘bindState‘ difficult: instance Monad (State state) where return a = State (\state -> (state, a)) State run >>= action = State run’ where run’ st = let (st’, a) = run st State run’’ = action a in run’’ st’ mapTreeM Now,’ <- mapTreeM f lhs rhs’ <- mapTreeM f rhs return (Branch lhs’ rhs’) which is significantly cleaner than before. In fact, if we remove the type signature, we get the more general type: mapTreeM :: Monad m => (a -> m b) -> Tree a -> m (Tree b) 9.3. A SIMPLE STATE MONAD 129.. Furthermore, we can write an action that will make each leaf value equal to its old value as well as all the values preceeding: fluffLeaves tree = mapTreeM fluff tree where fluff v = do cur <- getState putState (v:cur) return (v:cur) and can see it in action:: Monads> searchAll gr 0 3 :: Maybe [Int] Just [0,1,3] We provide the type signature, so that the interpreter knows what monad we’re using., we get the empty list, indicating no path: first Just value. For lists, mplus is the same as ++. That, such that it will explore all possible paths. The new function looks like: searchAll2 g@(Graph vl el) src dst | src == dst = return [src] combine MonadPlus Maybe lists 138 CHAPTER 9. MONADS | otherwise = search’ el where search’ [] = fail "no path" search’ ((u,v,_):es) | src == u = (searchAll2 g v dst >>= \path -> return (u:path)) ‘mplus‘) ‘mplus‘other. first lift it into the transformer. The simplest example of a transformer (and arguably the most useful) is the state transformer monad, which is a state monad wrapped around an arbitrary monad. Before, we defined definition Section 9.3:; finally, infinite final) many toLower), On top of these primitives, we usually build some combinators. The many combinator, for instance,, []) Right (xl’,a) -> let Right (xl’’, rest) = many’ xl’ in Right (xl’’, a:rest) The idea here is that first first line numbers 150 in m2 n’ xl’ CHAPTER 9., got EOF") matchChar’ n (x:xs) | c x = Right (n+if x==’\n’ then 1 else 0 , xs, x) | otherwise = Left ("expecting char, got " ++ show x) The 9.8. PARSING MONADS "[1 ,\n2 , 4 \n\n\n ,a\n]" Left "5: expecting char, got ’a’" 151 We can see that the line number, on which the error occurs, increases as we add additional newlines before the erroneous “a”. 9.8.2 Parsec libarary, file you’re parsing. This is so it can give better error messages. We can try parsing with the above functions:: first,.11 It mimicks neither exactly. It’s behavior most closely resembles foldr, but differs slightly in its treatment of the initial value. We can observe the difference in an interpreter:. 170 APPENDIX C. SOLUTIONS TO EXERCISES Solution 4.12 Solution 5.1 Using if, we get something like:.". Solution 9.2 ‘mplus‘: MTrans> unListT (searchAll6 gr 0 3) Exploring 0 -> 3 Exploring 1 -> 3 Exploring 3 -> 3 Exploring 2 -> 3 Exploring 3 -> 3 MTrans> it [[0,1,3],[0,2,3]] This is precisely what we were looking for. Solution 9.5 179 op <- oneOf "+*" e2 <- parseValueLet2 case op of ’+’ -> return (e1 + e2) ’*’ -> return (e1 * e2) ] where pushBinding c v = do f, first
https://pt.scribd.com/doc/7481315/Haskel-Tutorial
CC-MAIN-2017-09
refinedweb
1,618
73.78
Good Morning: I`ve read my books and several sites about "if" statements but I can`t get a feel for why "break" can`t be placed where I have placed it. DevC++ tells me it was expecting a primary expression before "break" but I`ve been trying different ways to give it what it wants and it stills pukes on me. Can you guys explain to me what I`m not doing correctly by looking at my example? ????????????????????????????????????Code:#include <iostream> using namespace std; int main() { double c; double f; double t; cout << "In order to convert celsius to farenheit \n"; cout << "or farenheit to celsius, enter either -c- or -f-"; cin >> t; if (t != c || f) cout << "I`m outta here!"; (break;) else if (t == f) {cout << "Enter celsius temperature to convert to farenheit: "; cin >> c; cout << "The temperature in farenheit is: " << (t * (1.8)) + 32;} else (t == c) {cout << "Enter farenheit temperature to convert to celsius: "; cin >> f; cout << "The temperature in celsius is: " << (t - 32) * .555;) } system("PAUSE"); return 0; } Any advice is well appreciated...............
http://cboard.cprogramming.com/cplusplus-programming/82703-break-if-statement.html
CC-MAIN-2014-42
refinedweb
179
66.78
#include <deal.II/base/table_indices.h> A class representing a fixed size array of indices. It is used in tensorial objects like the TableBase and SymmetricTensor classes to represent a nested choice of indices. Definition at line 44 of file table_indices.h. Default constructor. This constructor sets all indices to zero. Constructor. Initializes the indices stored by this object by the given arguments indices This constructor will result in a compiler error if the template argument N is different from the number of the arguments. Definition at line 116 of file table_indices.h. Read-only access the value of the ith index. Definition at line 128 of file table_indices.h. Write access the value of the ith index. Definition at line 137 of file table_indices.h. Compare two index fields for equality. Definition at line 146 of file table_indices.h. Compare two index fields for inequality. Definition at line 156 of file table_indices.h. Sort the indices in ascending order. While this operation is not very useful for Table objects, it is used for the SymmetricTensor class. Definition at line 164 of file table_indices.h. Write or read the data of this object to or from a stream for the purpose of serialization. Definition at line 173 of file table_indices.h. Output operator for TableIndices objects; reports them in a list like this: [i1,i2,...]. Definition at line 187 of file table_indices.h. Store the indices in an array. Definition at line 107 of file table_indices.h.
https://dealii.org/developer/doxygen/deal.II/classTableIndices.html
CC-MAIN-2020-45
refinedweb
247
69.79
i just want to whether there is a replacement for getch() in C++. my friend said getch() is C function. thanks! >i just want to whether there is a replacement for getch() in C++. There isn't a standard equivalent for getch in either C or C++. >my friend said getch() is C function. No, getch is a compiler extension. You can use it in either C or C++ if your compiler supports it, but for the most part you don't need to. For what purpose were you intending to use getch? The most common by far is keeping a console window from closing when you run the program from a Windows IDE: #include <conio.h> int main() { // Your program here getch(); } That's not a recommended solution, and most experienced programmers will recommend that you use cin.get: #include <iostream> int main() { // Your program here std::cin.get(); } Okay, I have to say that i often use getch() not just to halt the console window. I used getch() along with kbhit() [to get the key if pressed any]--very important use of getch(). And there are times when I have given the user to choose from a number of options (menu items) and used getch() to get the choice. I know the latter can be done with any input functions but getch() makes it simpler-- scanf(), cin and cin.get() will show the keys as u type in and then u have to press enter, whereas in getch() u just press the key and it's not even shown. getch() also makes things easier as u can enter only one key and there's no chance of receiving any degenerate inputs. On the otherhand it's very common for scanf(), cin and cin.get() to mess up with the inputs when only one keystroke is sufficient and desireable. i would really love to know if there's any other way to get the functionality of getch()(i.e without using getch()) in the above mentioned cases. i'm using getch() at password entering that display * when password is entered. i'm using getch() at password entering that display * when password is entered. yes, i have used it for the same purpose for one of my programs too. I hope some one here will suggest how to work that out without using getch(), since according to "Narue" its a compiler extension and not a C function. Now we dont to code using something that is not part of the language. i would really love to know if there's any other way to get the functionality of getch()(i.e without using getch()) in the above mentioned cases. The problem with unbuffered input is that it becomes the responsibility of the programmer to handle the buffering. Do you allow the user to make a typing mistake? Then handle the backspace. Then you can't have immediate response because you need an "enter" for a 'final' answer. Then you're back where you started with the standard way. The reason it may 'work well' might be because other issues have been overlooked. It seems a more reasonable approach is to use standard functions that have already taken such issues into account and move forward. Yet this opinion is revisited thousands of times every year by programmers. Their first goal seems to be clearing the screen. Frankly, if the command shell commands behaved this way, I'd be pretty annoyed: execute two 'dir' commands consecutively, and the second throws away the result of the first -- annoying. Ah well, it seems new programmers always must go full circle. I do try to get them to go the right way first, otherwise it seems to be a much longer journey. That said, any nonstandard function has the implied disclaimer, "use at your own risk"! :p Try #include <iostream.h> void main() { ...... /* your program here */ cin.get(); } It should work . >It should work No, it should do whatever the hell it wants because you've invoked undefined behavior. And even when the undefined behavior is something intelligent, iostream.h is a nonstandard header, so you can't be sure that cin.get() even exists, much less that it does what you want it to. To anyone reading this thread: getch() is still available in the conio.h header file (at least in MinGW). cin.get() acts the same as getchar() - it echos the pressed key and waits for enter to be pressed. And don't worry, Narue is wrong - iostream is very standard for C++. ? >cin.get() acts the same as getchar() - it echos the >pressed key and waits for enter to be pressed. Assuming that's what getchar does. getchar makes a call to a system function that performs the actual read, and that system function (whatever it may be) isn't required by the C++ standard to provide cooked input. However, I'll give this to you because I can't think of any systems off the top of my head that don't buffer up to a line feed. It's a safe assumption. >And don't worry, Narue is wrong Narue is always right[1]. You'd do well to realize that before truly embarrassing yourself. >iostream is very standard for C++. <iostream> is standard, <iostream.h> is not. Once again, this is a very simple concept, but I'll assume that you're just having trouble with reading for comprehension and missed the ".h" part. [1] I'll qualify this. Narue is always right when it comes to the likes of you. I do make mistakes, but I get the strong impression that you're not a strong enough programmer to notice them or accurately correct me even if you do. 1) Yes, I realize that. i just thought I'd post it here for anyone who stumbles across it as I did. 2) It's not that hard for me to understand, and that's why I added the condition "in MinGW". The MinGW compiler supports getch, so anyone using a MinGW compiler will be able to compile the code. After it's been compiled, running the program on the intended platform should have the expected results. Also, as Cygwin installations typically include MinGW libraries, Cygwin also supports the conio functions like getch. And MS Visual C++ also has the conio library. What compilers don't support it? 3) I'm explaining that cin.get() is not a suitable replacement for getch() for the applications given above. 4) Okay, you got me there. I believe that the ".h" version was the one used before streams became standard (in Borland). Anyway, that's being nit-picky as it was probably just a typo, and anyone would very quickly discover that the ".h" is not needed (since that version isn't included in the installs anymore). >i just thought I'd post it here for anyone who stumbles across it as I did. It's generally considered rude to resurrect ancient threads, for any reason. >The MinGW compiler supports getch, so anyone using a <blah blah> Okay, point out on this thread where you're not the first person to mention a specific compiler or OS. I can describe situations that only work on a PDP-11, and they'd be just as completely irrelevant as you talking about MinGW on this thread. getch is non-portable. That was already mentioned, so you don't have to list the compilers where it does and doesn't work. That's what the manual is for. >I'm explaining that cin.get() is not a suitable replacement for getch() for the applications given above. For the application I mentioned it's a perfectly suitable replacement. For masking a password, it's not, but because the OP was okay with using getch after finding out that it's neither C nor C++, but a compiler extension, no replacement was necessary. >I believe that the ".h" version was the one used before streams became standard Correct. >Anyway, that's being nit-picky as it was probably just a typo I seriously doubt that it was a typo. A lot of newbies use compilers that take pre-standard code. The lack of namespaces and the use of void main makes it extremely likely that iostream.h was meant. #include <iostream> using namespace std; void main(){ cout << "hit any key"; cin.get(); // waiting for any input } cin.get(); or std::cin.get(); if we don't using namespace all works fine. >void main(){ main returns int. Since you can omit the return statement in C++, using int main on top of being correct and portable actually saves you one keystroke. It's a win-win situation. :) getch() is also actually available in C++ while it's a compiler extension it might not be available with your compiler etc. for example if you're using Microsoft VC++ 2005 or later you may find these two functions useful : int _getch( void ); wint_t _getwch( void ); these methods are locking and thread-safe, non-locking versions of these two functions are available as _getch_nolock and _getwch_nolock ! -- Good Luck ! The dNetGuru ? Found this thread when googling getch, and I had to respond. The function you're discussing is NOT a "compiler extension". It's a library function. Crap like this is why people think that C/C++ is so difficult. There is a difference between a language feature and a library function. Jesus, learn the language, people! The C++ Standard Library is not C++! Console I/O functions are not part of the compiler! You can use any library function with any compiler, as long as you compile the library source using your compiler. Goddamn...No wonder there are so many idiot java programmers. You have always the choice cause it C++ it just direct track of the keyboard using terminal for linux just add its segment all will work fine.. like clrscr() also does not work for that is you can use the system() function and type the console command In the program i have define it as "cls" so you can use it directly... as cls ; in the program If you remove the #define Linux the code will include the Conio and you can use the getch() in any case ... Just you any old program in windows can run fine now. .if you add this snippet above the code #include<iostream> using namespace std; #define Linux //Remove this for running in windows #ifdef Linux #define cls system("clear") #include <termios.h> #include <unistd.h> int getch(); int get; } #else #include<conio.h> #define cls system("cls") #endif #include<stdio.h> .. .. int main() { .. .. return 0; } >Found this thread when googling getch, and I had to respond. I recommend you resist that temptation next time. Posers should know their limits. >The function you're discussing is NOT a "compiler extension". It's a library function. If you want to split hairs with terminology, it's a library extension. But whatever you call it, the result is the same: the function is not portable. Calling it a compiler extension is more productive as most beginners can't differentiate between the compiler proper and the libraries. If I say it's a library extension, that will encourage more questions like "I want to use graphics.h with <a compiler it wasn't designed for>". >The C++ Standard Library is not C++! That's not quite true. C++ is defined by the C++ standard, and you'll find sections on the standard library in that document. If a compiler package doesn't include the standard library, it doesn't conform to standard C++. >You can use any library function with any compiler, as long >as you compile the library source using your compiler. Perhaps you should try to understand what you're talking about before being a jerk about it. The vendor-provided libraries for a compiler are already compiled. Sometimes vendors provide source code for the libraries, sometimes not. This results in two problems, which are more pronounced in non-portable functions like getch: 1) If you have the source code, chances are extremely good that it uses features, libraries, or APIs that are specific to either the compiler or the platform the compiler is targeted for. Unless you remove those non-portable parts, you can't use "any library function with any compiler, as long as you compile the library source using your compiler". You ultimately have to port the function to the compiler you want to use it with, which could involve a lot more work than simply recompiling. 2) If you don't have the source code, you only have a binary version of the library and thus have to disassemble and reverse engineer the functions you want before you can get to the point of compiling with another compiler. Of course, you still have to handle the first problem after you've done all of this grunt work. >Goddamn...No wonder there are so many idiot java programmers. You don't know what you're talking about. A little book knowledge, a pedantic attitude, and arrogance aren't going to hide that from people who do know what they're talking about. The good news is that posers can become actual authorities on a subject. Keep trying, one day you might actually be able to debate intelligently with me. Narue: "Posers should know their limits." You say it's rude to resurrect old threads but you're rude whenever you feel like it. One of the rules of this forum is "keep it pleasant". You are not following that rule. It's sad how a relatively simple skill like programming can go to a simpleton's head. Don't bother to respond; I won't read it. >but you're rude whenever you feel like it I'm appropriately rude. If you're rude to me, don't expect me to be nice to you. >One of the rules of this forum is "keep it pleasant". Not only am I quite familiar with the rules, I'm in the unique position of having the final say on their interpretation. >You are not following that rule. The key phrase in Keep It Pleasant is "malicious intent", which is the deciding factor in enforcing this rule. If it's determined that there's no malicious intent, even rude posts are more likely to be allowed than not. As such, I don't feel I've broken that particular rule. However, as it appears you've reported my post, I'll step aside and allow the rest of the mod team make an objective decision. Thank you, by the way, for reporting posts you feel cross the line regardless of who the author is. Nobody is exempt from following the rules. >It's sad how a relatively simple skill like programming can go to a simpleton's head. If you think programming is simple, you clearly haven't done much of it. >Don't bother to respond; I won't read it. I don't believe that for one second. If you're egotistical enough to scold me for not being nice when it has nothing to do with you, you're egotistical enough to be interested in my reply. To be honest, I was half expecting your IP to match nomorejunkmail's. :D
http://www.daniweb.com/software-development/cpp/threads/11811/replacement-of-getch
CC-MAIN-2014-15
refinedweb
2,572
74.49
This chapter introduces how to build Oracle Event Processing applications through a walkthrough in which you build a simple application. Along the way, it provides an overview of key concepts This chapter includes the following sections: Section 8.1, "Introduction to the Simple Application Walkthrough" Section 8.2, "Create the Workspace and Project" Section 8.3, "Create an Event Type to Carry Event Data" Section 8.4, "Add an Input Adapter to Receive Event Data" Section 8.5, "Add a Channel to Convey Events" Section 8.6, "Create a Listener to Receive and Report Events" Section 8.7, "Set Up the Load Generator and Test" Section 8.8, "Add an Oracle CQL Processor to Filter Events" Section 8.9, "Summary: Simple Application Walkthrough" This walkthrough introduces the basics of building Oracle Event Processing applications using the Eclipse IDE. It is intended as a survey of key Oracle Event Processing concepts, a starting place from which you can investigate more about each. The application you build in this walkthrough models a simple stock trade alert system. The application receives example data about stock trades, examines the data for certain characteristics, then prints some of the data to the console. The following illustration shows the application's finished EPN diagram: This introduction includes the following sections: Section 8.1.1, "Key Concepts in this Walkthrough" Section 8.1.2, "Before You Get Started" This walkthrough starts with Section 8.2, "Create the Workspace and Project". This walkthrough introduces the following concepts that are typically part of Oracle Event Processing applications you build: IDE features designed to make building Oracle Event Processing applications easier, including a project type, a graphical editor for designing event processing networks, and validation support for project-specific configuration files Building an application as an event processing network (EPN), the core design construct for modeling the behavior of an application that receives streaming data and operates on that data as it flows through the application. Designing event types that model events, normalizing event data for use with code inside the application. Using adapters to manage interactions with external components, including sources of streaming data. Implementing a Java class that can receive or send events within an event processing network. Using Oracle Continuous Query Language (Oracle CQL) to filter events based on specific properties within them. You should have installed Oracle Event Processing and the Eclipse IDE. In addition, you should have updated the Eclipse IDE with the plugin included with Oracle Event Processing. Although it introduces features specific to Oracle Event Processing, this walkthrough assumes that you are somewhat familiar with basic Java programming. For more information, see the following topics: "Installation Overview" in the Oracle Fusion Middleware Getting Started Guide for Oracle Event Processing Section 4.1, "Overview of Oracle Event Processing IDE for Eclipse" In this first step, you'll use the IDE to create the workspace and project in which to develop your application. To make it easier to develop Oracle Event Processing applications, the IDE provides the Oracle Event Processing application project type. This project type includes the artifacts and dependencies that typical Oracle Event Processing applications need, making it easier to get into writing application-specific code. You should already have configured your IDE preferences to know the location of the JRockit JRE, which is the best practice choice on which to run the Oracle Event Processing server. Create the Walkthrough Workspace and TradeReport Project Start the Eclipse IDE. When prompted to select a workspace, create a workspace called walkthroughs. From the File menu, choose New > Project to begin creating a new project. In the New Project dialog, expand Oracle Event Processing, click Oracle Event Processing Application Project, then click Next. In the New Oracle Event Processing Application Project dialog, in the Project name box, enter TradeReport. Leave the Use default location check box selected to have the new project created in the location of the workspace you created. Under Target Runtime, if no runtime is displayed in the dropdown, do the following: Click the New button. In the New Server Runtime Environment dialog, expand Oracle, then select Oracle Event Processing v11.1 and click Next. Click Next. Under New Oracle Event Processing v11.1 Runtime, next to the Oracle Middleware Home Directory box, click Browse. In the Browse for Folder dialog, locate the Middleware home directory, then click OK. By default, the Middleware home directory will be located at ORACLE_HOME/Middleware. In the JRE dropdown, select a JRockit JRE. The Oracle Event Processing server is optimized for use with the JRockit JRE. If a JRockit JRE isn't available among those listed, use the following steps to locate the JRE that is included with Oracle Event Processing. Click the Installed JRE preferences link. In the Preferences dialog, next to the Installed JREs list, click the Add button. In the Add JRE dialog, under Installed JRE Types, select Standard VM, then click Next. Next to the JRE home box, click the Directory button to browse for the location of the JRockit JRE. In the Browse For Folder dialog, expand the Middleware home directory, then the jrockit_160_29 directory, then click the JRE directory and click OK. After the Add JRE dialog displays the JRE home directory, name, and system libraries, click the dialog's Finish button. In the Preference dialog, select the check box for the JRE you just added, then click OK. In the New Server Runtime Environment dialog, from the JRE dropdown, select the JRE you just added. Click Finish. In the New Oracle Event Processing Application Project dialog, with the Oracle Event Processing v11.1 target runtime selected, click Next. Under Oracle Event Processing Application Content, confirm the properties for the project you're created. Click Finish. After you've created your project, the IDE will display the Project Explorer, with a hierarchical list of the artifacts in your project, along with an empty editor for the event processing network you're about to build. An event processing network (EPN) is a central design concept in an Oracle Event Processing application. An EPN represents the components, known as stages, that make up the application, as well as the path taken by events from stage to stage. As you develop your application, the EPN editor will display the stages you add and the connections between them. Conceptually, event data enters your application from the left, moving toward the right from stage to stage. The design that the EPN editor shows is actually a graphical representation of the EPN's underlying configuration. When you add a stage or connection through the EPN editor, the IDE writes configuration XML to an underlying assembly file (just as editing the XML file directly will result in an updated graphical design in the EPN editor). An EPN assembly file includes the default configuration for each of an EPN's stages. This is a default configuration that cannot be changed on the server at runtime without redeploying the application. For configuration that can be edited at runtime, you can use another kind of configuration file, as described later. Note: The EPN assembly file's XML schema is an extension of the Spring framework configuration file. For more on Spring, see the Spring web site. Take a look at the Project Explorer. You should have a project hierarchy that's something like what's shown in the following illustration. If you're experienced with IDEs, much of this should be familiar. In addition to the usual places for Java source code, the JRE system library, and build output, you'll also find the following: JAR files that make up the Oracle Event Processing classpath. These provide the functionality needed for the Oracle Event Processing server, including for stages of an event processing network, Spring-configured components, and logging. A spring directory for configuration files that conform to the Spring framework (for more on Spring, see the Spring web site). The file you start off with is the EPN assembly XML file that describes the contents and structure of the event processing network you're building. As you build your EPN, adding and connecting stages, the IDE captures your work in this file. You can also edit the file manually. At this point, the file merely declares namespaces for the XML that will be added to it. A wlevs directory for files that describe components whose configuration should be editable at runtime. Most components have a default configuration that you can override within a component configuration file in the wlevs directory. The only component whose configuration you must put in one of these files is a processor. A processor's Oracle CQL code is editable at runtime by using the Oracle Event Processing Visualizer. If you're configuring multiple components, you can use one or multiple component configuration files. For example, in the case of a team of developers, where each is responsible for a different component, you might want to have a configuration file per component to avoid source control conflicts. Now that you've got a project created, in Section 8.3, "Create an Event Type to Carry Event Data", you'll start assembling an event processing network. You'll begin by creating an event type that will represent incoming event data to the application's logic. Oracle Event Processing applications are about receiving, processing, and sending events. Events start as event data that can be in almost any structured form. The event data arrives at the application in its raw form, then is bound to an event type that you define. Using your own event type makes handling the data predictable for the rest of your code in the application, including Oracle CQL queries, Java code, and so on. (The conversion is done by an adapter. More about those later.) So an early task in defining any event processing network is clarifying the structure of the data coming from the source, then defining the form to which you'll convert that data for use inside the EPN. In this section, you'll work from the structure of example stock trade data to define an event type to which the data will be bound. In the case of the application you're building here, the sample incoming event data is arriving as rows of comma-separated values. Each row contains data about a particular thing that happened -- here, a stock trade. The structure of the values is consistent from row to row. Here are a few example rows: IBM,15.5,3.333333333,3000,15 SUN,10.8,-1.818181818,5000,11 ORCL,14.1,0.714285714,6000,14 GOOG,30,-6.25,4000,32 YHOO,7.8,-2.5,1000,8 Though they aren't labeled in the CSV file, the values could be labeled as follows: stock symbol, price, percentage change, volume of shares purchased, last price That's the structure of the incoming trade event data. In order to handle that data in your application -- query it, filter it, perform calculations, and so on -- you will need to assign that data to a new structure that supports doing those things. In particular, the new structure should have the ability to specify properties of particular types. Having types matched to the anticipated values makes it easier to handle the values in code. Looking at the example data and labels, you can imagine each of the values for each row bound to properties of the following Java types: String, Double, Double, Integer, Double Oracle Event Processing supports several forms on which you can base your new event type. These include JavaBean classes, tuples, and java.util.Map instances. A JavaBean class is the best practice type for new event types, so that's what you will use here for trade events. If you haven't worked with them before, you should know that JavaBeans are Java classes that follow specific standard rules designed to make them predictable. In general, the idea is for the class to provide variables to hold data inside it (such as the trade event stock symbol) and methods through which the data can be retrieved or set by code outside the class. Naming the methods with predictable names, such as "setSymbol" and "getSymbol", gives code outside the class a predictable way to use the data inside the class. For example, when Oracle Event Processing needs to bind incoming event data to your event type, it will create a new instance of the event type JavaBean and use the bean's "set" methods to set the data in the proper places inside the class. Code later in the application, such as Java code or Oracle CQL code you will write, will be able to call the bean's "get" methods to get the data out again. In the following sections, you will create the JavaBean as code behind your event type, then configure the event type to use the JavaBean. Create the TradeEvent JavaBean In this section, you will create a TradeEvent JavaBean class that will be used as an event type for incoming trade event data. In the IDE, right-click the src directory, then click New > Class. In the New Java Class dialog, in the package box, enter com.oracle.oep.example.tradereport In the Name box, enter TradeEvent. Click Finish. The TradeEvent.java source code window will display with the declaration for the TradeEvent class. In the TradeEvent class, just beneath the TradeEvent class declaration, add private variables for each of the properties you'll need as shown in the following example. public class TradeEvent { // One variable for each field in the event data. private String symbol; private Double price; private Double lastPrice; private Double percChange; private Integer volume; } Select the code for all of the variables, click the Source menu, then click Generate Getters and Setters. In the Generate Getters and Setters dialog, select the check box for each variable you selected (in other words, all of them). In the Insertion Point dropdown, select Last member. Click OK. In the TradeEvent source code window, notice that you have created pairs of methods that simply get or set the values of the variables you added. Save the TradeEvent.java file and close the code window. And that's all there is to creating a JavaBean (at least, in this case). The next step is to tell your application that the JavaBean should be used as an event type. Configure the TradeEvent Event Type In this section, you'll tell the TradeReport application that the TradeEvent JavaBean should be used as an event type. In the IDE, confirm that the empty TradeReport EPN editor is open. Its tab at the top of the window should read EPN: TradeReport. At the bottom of the designer window, click the Event Types tab. Under Event Type Definitions, select TradeReport.context.xml. This is the EPN assembly file underlying your EPN design. This is also the file you noticed in the META-INF/spring directory of the project explorer. You are selecting it here to ensure that the event type you are about to configure gets defined in that file. Under Event Type Definitions, click the plus sign to add a new event definition. Click the newEvent entry that was created. Under Event Type Details, in the Type name box, change the event type's name to TradeEvent. (It doesn't have to be the same as the JavaBean class, but it makes things simpler to use the same name.) Select the Properties defined in Java bean option. The other option is for defining events as tuples. In the Class box, enter the name of the JavaBean class you created: com.oracle.oep.example.tradereport.TradeEvent. Save the file to have the event type name updated in the event type definitions. If you're curious about what was added to your EPN assembly file, open the file. It's in the Project Explorer under TradeReport > META-INF > spring > TradeReport.context.xml. The part you added looks something like the following (you might need to click the Source tab at the bottom of the editor window): <wlevs:event-type-repository> <wlevs:event-type <wlevs:class>com.oracle.oep.example.tradereport.TradeEvent</wlevs:class> </wlevs:event-type> </wlevs:event-type-repository> As the code suggests, Oracle Event Processing manages event types in an event type repository. The TradeEvent event type you defined is mapped to the TradeEvent JavaBean class you created. Now that you have an event type defined and configured, you need to tell the application how to watch for incoming event data. You also need to specify that the data should be assigned to the TradeEvent type you created. You do those things with an adapter, which you will add in Section 8.4, "Add an Input Adapter to Receive Event Data". Before you can try out the event processing network you're building, you will need to create a way for event data to flow into it. In Oracle Event Processing applications, adapters manage traffic between external components and the internals of the event processing network. Event data arriving from external sources enter the application through an adapter, while event data leaving the application on its way to external components or applications exits through an adapter. By default, Oracle Event Processing includes adapters for three different kinds of external components: Java Message Service (JMS) destinations, HTTP publish-subscribe servers, and CSV files. The adapter for CSV files, called csvgen, is great for trying things out with code in development. It's a lightweight alternative to the task of defining an adapter for a more substantial, "real" event data source. In your own apps, you might find it easier to use the csvgen adapter until you have your EPN started and some of its logic defined. The csvgen adapter's logic knows how to translate event data read from a CSV file into the event type you defined. You use the csvgen adapter in conjunction with the load generator utility included with Oracle Event Processing (more about the load generator later in this walkthrough). The csvgen adapter's implementation code is included by default in Oracle Event Processing, so all you need to do is add configuration code to declare the adapter as a stage in your EPN, as well as set a few of its properties. Add Code to Configure a CSV Adapter In this section, you will add configuration code that creates a place for your CSV adapter in the event processing network. The code will also set a few adapter properties needed to configure the adapter's runtime behavior. You add the code to the EPN assembly file so that the adapter will be included in the EPN and appear in the EPN designer as a stage. In the IDE, locate and open the EPN assembly file. In the Project Explorer, it should be located at TradeReport > META-INF > spring > TradeReport.context.xml. Below the event-type-repository XML stanza, add the following XML to declare the adapter: <wlevs:adapter <wlevs:instance-property <wlevs:instance-property <wlevs:instance-property </wlevs:adapter> This XML stanza declares an instance of the csvgen adapter and assigns to it three properties that configure it for use in your EPN. The adapter uses the properties to map from incoming raw event data to the properties of the event type you defined in Section 8.3, "Create an Event Type to Carry Event Data". The following describes the values you're adding: Adapter declaration. The id attribute value is a unique identifier for the adapter. The provider attribute value must be "csvgen" in order to refer to the csvgen implementation included with Oracle Event Processing. The port instance property tells the adapter instance what port to listen on for incoming event data. The value here, 9200, corresponds to the port number to which the load generator will send event data (more on that later). The eventTypeName instance property tells the instance the name of the event type to which incoming event data should be assigned. Here, you give the name of the TradeEvent type you defined earlier. The eventPropertyNames instance property tells the instance the names of the event type properties to which data should be assigned. Notice in this case that the eventPropertyNames attribute value is a comma-separated list of the same properties you defined in the JavaBean for the event type. In order for the csvgen adapter to map from incoming values to event type properties, the names here must be the same as your event type and must be in the same order as corresponding values for each row of the CSV file. Save and close the EPN assembly file with the adapter XML in it. If it isn't open already, open the EPN editor to its Overview tab. In the EPN editor, notice that it now displays an icon representing the csvgen adapter instance you just added. The icon will be labeled with the adapter id value you specified in configuration code. In the next step, Section 8.5, "Add a Channel to Convey Events", you will add a way to carry events from the adapter to logic you will add in a moment. In this step, you will add a way to connect the adapter you added in Section 8.4, "Add an Input Adapter to Receive Event Data" to a bit of logic you will add in the next step. Afterward, you will test the application. In Oracle Event Processing applications, you connect EPN stages together by using a channel. A channel is a conduit that transfers events from one part of the EPN to another. Though conveying events is a channel's primary purpose, channel configuration options give you opportunities to specify other properties through which you can tune the application. These include: Whether the channel can process events asynchronously, and how big the buffer for this can get. How many threads may be used to process events in the channel (a larger number can increase performance). Whether to partition events, based on their properties, in order to have the events dispatched to separate downstream parts of the EPN. Those kinds of channel configuration properties have default values, so you needn't set them for the application you're building. In this application, you'll keep channel configuration simple. The purpose of the channel you are about to add is to carry newly generated events from the adapter that's receiving event data to code you will add in the next step. Add the AdapterOutputChannel In the IDE, ensure that the EPN editor is open and that the EPN you're building is visible. Right-click the EPN editor, then click New > Channel. A channel icon should appear in the EPN editor. Double-click the channel icon that appears in the editor to display the channel's configuration XML in the EPN assembly file. In the assembly XML file, locate the channel XML stanza for the channel you added. It should look something like the following: <wlevs:channel </wlevs:channel> You might notice a warning that "channels should declare an 'event-type' value". You are about to fix that. Edit the default XML to match the following (or simply paste the following code over the code you have). <wlevs:channel </wlevs:channel> The following describes the values you're adding to configure the channel: The channel element represents configuration for the channel, placing the channel in the EPN. The id attribute's value is a unique identifier for the channel in this EPN. (You will be adding another channel.) The event-type attribute's value is the name of the event type that the channel is configured to convey. In this case, you're setting it to TradeEvent, the name of the event type you added earlier, whose implementation is the TradeEvent JavaBean you created. Note that the value you are adding here is the same as the type-name attribute value of the event-type element elsewhere in the assembly file. After you have finished editing the channel configuration XML, save the assembly file. Return to the EPN editor. You might need to click the EPN: TradeReport tab to display the EPN editor. In the EPN editor, create a connection from the input adapter to the channel you added. To do this, click the StockTradeCSVAdapter icon and drag to the AdapterOutputChannel icon. This will create a connecting line between the two icons. To make the EPN diagram tidy by having icons display sequentially from left to right, click the Layout EPN icon at the top right corner of the EPN editor. Double-click the StockTradeCSVAdapter icon to display the adapter's configuration XML in the assembly file. In the assembly file, notice that creating a connection between the adapter and the channel has added a listener element to the adapter XML stanza. That element's ref attribute value is set to the id attribute of channel element. This XML defines the connection that is graphically displayed in the EPN editor. The resulting EPN assembly XML should look something like the following (aspects that connect components are shown in bold text): <?xml version="1.0" encoding="UTF-8"?> <beans xmlns="" xmlns: <!-- Schema locations omitted for brevity. --> <wlevs:event-type-repository> <wlevs:event-type <wlevs:class>com.oracle.cep.example.tradereport.TradeEvent</wlevs:class> </wlevs:event-type> </wlevs:event-type-repository> <wlevs:adapter <wlevs:listener <wlevs:instance-property <wlevs:instance-property <wlevs:instance-property </wlevs:adapter> <wlevs:channel </wlevs:channel> </beans> Save TradeReport.context.xml and close the file. In this step, you added a channel to convey events out of the input adapter. In the next step, Section 8.6, "Create a Listener to Receive and Report Events", you will add a stage for the events to go. In this step, you will add a stage that will complete a simple event processing network so that you can test the application with event data. The stage will be a "listener" Java class that's designed to receive trade events passing through the EPN and report information about the trades. The listener you're adding is a particular kind of Java class known in Oracle Event Processing as an event sink. An event sink is code that is able to receive events as they pass through an EPN. By intercepting events with an event sink, you can use the class's logic to find out what's inside the events and use that data while executing other logic in the class. In addition to writing event sinks, you can also write event sources, which are able to send events to stages downstream in the EPN. So you can imagine, for example, a single Java class that intercepts events, executes code that changes the events' contents (or creates new events from them), then sends the resulting events along to the next stage. Such code could also initiate other processes (potentially in other applications) based on what the events look like. Both event sinks and event sources implement particular Oracle Event Processing Java interfaces. For example, an event sink implements one of two interfaces, depending on whether the events it's receiving are part of a stream or a relation: com.bea.wlevs.ede.api.StreamSink or com.bea.wlevs.ede.api.RelationSink. The difference between streams and relations isn't especially important in the application you are building here (your code won't rely on the difference). Still, it's worth a brief explanation because it's an important part of understanding how event processing with Oracle Event Processing works. A stream is a sequence of events that's sequential with respect to time, with events with an earlier timestamp arriving before those with a later timestamp. In contrast, a relation is a set of events in which events in the set were chosen because they met certain criteria. Code executing on a relation can result in delete, insert, and update events. As an illustration, consider a metaphor for a stock trade application that's more involved than the one you're building here. Imagine that the trade events your application receives are flowing through a pipe that you can't see into. The events emerge from the pipe in the order they were received -- an order that you care about because it matters which events occurred before which other events. To catch them, you put a bucket under the end of the pipe that's designed to catch fifteen seconds' worth of the trades at a time so that your code can see if a trade of one specific stock occurred within 15 seconds before a trade of another specific stock. The pipe is a stream, where the sequence and adjacent quality are key characteristics. The bucket is a relation, where certain shared characteristics define what's in the bucket. In the following sections, you'll create a Java class that implements the interface through which it listens for events, then configure that class as an event bean, making it part of the EPN. Create the Listener Event Sink Class In this section, you'll create a Java class capable of receiving events from a stream. In the IDE, in the Project Explorer, right-click the src directory, then click New > Class. In the New Java Class dialog, in the Package box, enter com.oracle.oep.example.tradereport. In the Name box, enter TradeListener. Next to the Interfaces box, click the Add button to select the interface your listener will need to implement to be an event sink. In the Implemented Interfaces Selection dialog, in the Choose interfaces box, enter com.bea.wlevs.ede.api.StreamSink. With StreamSink selected in the Matching items box, click OK. In the New Java Class dialog, under Which method stubs would you like to create, ensure that the Inherited abstract methods check box is selected (the others should be cleared). Click Finish. The TradeListener.java source code window will open to display the declaration for the TradeListener class. A declaration for the onInsertEvent method should also be present in the .java file. This method is required when implementing the StreamSink interface. In the TradeListener class, edit the onInsertEvent method to match the following code: @Override public void onInsertEvent(Object event) throws EventRejectedException { if (event instanceof TradeEvent){ String symbolProp = ((TradeEvent) event).getSymbol(); Integer volumeProp = ((TradeEvent) event).getVolume(); System.out.println(symbolProp + ":" + volumeProp); } } This is the method that Oracle Event Processing will use to pass an event into your listener, where your code can do something with it. The changes you're making implement the method to do the following: Ensure that the incoming event is an instance of your TradeEvent JavaBean. (Any others would be ignored.) If the event is a TradeEvent, the code will simply print out the stock symbol and trade volume it contains. Save and close the TradeListener.java file. Configure the Listener Class as an Event Bean In the preceding section, you implemented an event sink to create a class to listen for events of a particular type. In this section, you will add that listener to your EPN as an event bean that you can connect to other parts of the EPN. An event bean is a way to add Java code to an EPN. Another way is a Spring bean. Though they offer differing management features, both bean models provide a means to configure an EPN stage whose implementation is Java code that you write. An event bean, which you're creating here, integrates more fully with Oracle Event Processing server features. A Spring bean is a good choice when you need to integrate with an existing Spring framework. In the EPN editor, right-click an empty area, then click New > Event Bean. Double-click the new eventBean icon to display its configuration code in the assemble XML file. In the TradeReport.context.xml source code, locate the event-bean element and edit it so that it appears as follows: <wlevs:event-bean With this code, you're configuring the event bean with the unique identifier, "ListenerBean", and an implementation class that's the class you created earlier. Save the assembly XML file. Return to the EPN editor to see that the design reflects your changes to the underlying XML, such as the new event bean name. In the EPN editor, click the AdapterOutputChannel to select it. Again click the AdapterOutputChannel and drag to the ListenerBean event bean icon. This creates a connection so that events can pass from the channel to the event bean. Tidy the diagram by clicking the Layout EPN icon. Double-click the AdapterOutputChannel to display its underlying XML. Note that the channel XML stanza now includes a listener element whose ref attribute value is the same as the ID value for the event bean you added. (The word "listener" in both places here is for convenience only.) <wlevs:channel <wlevs:listener </wlevs:channel> <wlevs:event-bean Save TradeReport.context.xml. In this step, you added an event bean to listen for events traveling through the event processing network. In the next step, Section 8.7, "Set Up the Load Generator and Test", you will test the application you are building. In this step, you will deploy your project on an instance of the Oracle Event Processing server, then use the load generator utility included with Oracle Event Processing to feed sample data to the application you are building. The load generator utility installed with Oracle Event Processing provides a way for you to easily begin testing your project. It's specifically designed to read a CSV file and send rows in the file as event data to a port you specify in its configuration. In your project, a CSV adapter listening on that port receives the rows and converts their data into instances of the event type you defined for it. Through a properties file, you can configure certain aspects of the load generator, including the CSV file and target port to use, how long the load generator should run, how fast it sends event data, and so on. In the following sections, you'll create an instance of the Oracle Event Processing server, configure it for deploying your project, then set up the load generator and test the project. Create a Server on Which to Run the Project In this section, you'll add an Oracle Event Processing server instance to the TradeReport project. Adding the server instance gives you a convenient way to use the IDE to start and stop the server, as well as redeploy the project whenever you make changes and want to test again. The IDE is aware of the Oracle Event Processing server through the server runtime environment included when you created the project. (You might have needed to add the server runtime envirronment as a separate step.) In the IDE, ensure that the Servers view is displayed. If it isn't visible, click Window > Show View > Servers to display it. In the Servers view, right-click to display the context menu, click New, then click Server. In the New Server dialog, under Select the server type, expand Oracle, then click Oracle Event Processing v11.1. Leave the host name, server name, and runtime environment as is, then click Next. Under New Oracle Event Processing v11.1 Server, ensure that the Local Server option is selected, then click Next. In the next window, under New Oracle Event Processing v11.1 Server, leave the Domain Directory as is, then click Next. Under Add and Remove, in the Available box, select TradeReport, then click the Add button between the Available and Configured boxes. Moving the TradeReport project name into the Configured list specifies that the TradeReport project you're building should be configured to run on the server you're adding. This simple step makes it easy to deploy (and redeploy) the project to the server as you're debugging. Click Finish. After you've added the server, it should be listed in the Servers view as Oracle Event Processing v11.1 at locahost (Stopped). Expand its entry to confirm that the TradeReport project is one of its configured projects. Set Up the Test Data and Load Generator You don't actually need to set up the test data and load generator -- they're set up when you install Oracle Event Processing. But since you'll be using them to debug your project, use the following steps to take a look at them. In the text editor of your choice, open the StockData.csv file included with Oracle Event Processing. By default, you'll find this file at the following path: ORACLE_HOME/Middleware/ocep_11.1/utils/load-generator/StockData.csv Notice that the contents of the file are essentially more of what you saw in the example when you defined an event type for the data. Notice that, as with any CSV file, the rows are uniform in terms of the order of values they contain. In the text editor, open the StockData.prop file. This is the properties file that configures the work of the load generator. Two of its properties -- test.csvDataFile and test.port -- are required in order for the load generator to work. The other properties are technically optional, but you'll need to set one more in order to ensure that the load generator knows that your input is in CSV form. To debug the TradeReport project, you should have the following properties set: test.csvDataFile -- The name of the CSV file that the load generator will read. The value here should be StockData.csv. test.port -- The port number to which the load generator will send event data. This should be the port value you specified when you configured the CSV adapter instance, or 9200. test.packetType -- The form that the load generator will be handling. This value should be CSV. Of course, you probably won't need to actually debug this project (you've been doing everything exactly as described here, right?). But setting a breakpoint and running the Oracle Event Processing server in debug mode will give you a chance to see how things are working. In the IDE, open the TradeListener.java file you created in an earlier step. In the Project Explorer, the file should be visible by expanding TradeReport > src > com.oracle.cep.example.tradereport. In TradeListener.java, set a breakpoint at the line with the following code: System.out.println(symbolProp + ":" + volumeProp);. The server is running in debug mode when the Console view's output ends with <Server STARTED> or <The application context for "TradeReport" was started successfully>. see errors when you attempt to republish, you might need to clean and rebuild the project before continuing. Open a command prompt and change directory to the load-generator directory installed with Oracle Event Processing. By default, this is at the following path: ORACLE_HOME/Middleware/ocep_11. Click the Resume button repeatedly to advance execution from event to event, noticing the values in each. In the Console window, notice that the listener code is printing stock symbols and volumes from the events it receives. In the Servers view, select the Oracle Event Processing server, then click the Stop the server button. In the load generator command prompt window, press CTRL+C to stop the load generator. That's it! You've created and tested a simple Oracle Event Processing application. In the last step, Section 8.8, "Add an Oracle CQL Processor to Filter Events", you'll make the application a little more interesting by adding some Oracle CQL code. In this step, you'll add a processor to filter events based on certain criteria. A processor is a stage to which you add Oracle Continuous Query Language (Oracle CQL) code for querying incoming events. Processors and Oracle CQL queries represent much of the real power of event-oriented applications you build with Oracle Event Processing. With Oracle CQL, you can focus the application's logic on just those events you care about, executing sometimes complex logic as events arrive. If you have used Structured Query Language (SQL), Oracle CQL will appear very familiar. In fact, Oracle CQL is essentially like SQL -- with the same keywords and syntax rules -- but with features added to support the unique aspects of streaming data. (If you aren't familiar with SQL, getting acquainted with it will go a long way toward helping you get the most out of Oracle CQL.) Remember that event data (and the Oracle Event Processing events that result from it) is a stream of data that the EPN receives sequentially. To continue the comparison of SQL and Oracle CQL, an event may be said in one sense to correspond to a row in a database. However, an important difference is that with events, one event is always before or after another, time-wise, and the stream is potentially infinite and ever-changing. In a relational database, rows may be said to be a finite set where data is relatively static. With a relational database, data is waiting for your query to go and get it; with a stream of event data, data is always flowing into the EPN, where your query examines it as it arrives. To make the most of the sequential, time-oriented quality of streaming data, CQL includes the ability to: Specify a window of a particular time period, or range, from which events should be queried. This could be each five seconds worth of events, for example. Specify a window of a particular number of events, called "rows," against which to query. This might be each sequence of 10 events. Specify how often the query should execute against the stream by using the slide keyword. The query could "slide" every five seconds to a later five-second window of events. Separate, or partition, an incoming stream into multiple streams based on particular characteristics of the events. You could have the query create new streams for each of specified stock symbols found in incoming trade events. In addition, CQL supports common aspects of SQL you might be familiar with, including views and joins. For example, you can write CQL code that performs a join involving streaming event data and data in a relational database table or cache. CQL is extensible through cartridges, with included cartridges providing support for queries that incorporate functionality within Java classes, for calculations specific to spatial data, and to query JDBC data sources. To get acquainted with processors and CQL, you'll keep the code you're adding here simple. You'll add a query that retrieves certain events fed from the AdapterOutputChannel. The query will be designed to retrieve only those trades whose volume is greater than 4000. Events in the query's results will be passed along to the listener. The following is what the CQL code will look like: Example 8-1 GetHighVolume Query Element with CQL Code <query id="GetHighVolume"><![CDATA[ select trade.symbol, trade.volume from AdapterOutputChannel [now] as trade where trade.volume > 4000 ]]> </query> This query can be paraphrased as "for every event coming from the AdapterOutputChannel whose trade volume is more than 4000 shares, get the symbol and volume values." The from, and where statements should look familiar if you've used SQL. The now operator represents a window of time, where the window is essentially instantaneous -- it includes every event. Another window might have been [range 5], meaning "select from all the events that arrive within each five second period." (That might be useful if you care that certain trades have occurred within five seconds of one another.) The output of this query will be a relation -- or set, rather than sequence -- that includes all of the events whose trade volume is greater than 4000. Because the window is [now], the set will always have no more than one member. A relation from a larger range might have multiple members in its set. Add a GetHighVolume Processor and Query In the IDE, in the EPN editor, right-click an empty area of the diagram, then click New > Processor. In the New Processor dialog, in the Processor ID box, enter GetHighVolumeProcessor. Select the Use an existing configuration file option. Remember that you can create a different configuration file for each processor. That might be useful if you have a different person working on each one. In the dropdown, leave config.xml selected, then click OK. In the EPN editor, notice that a GetHighVolumeProcessor icon has been created. Right-click the connector from the AdapterOutputChannel icon to the ListenerBean icon, then click Delete. Click then AdapterOutputChannel icon, then drag from it to the GetHighVolumeProcessor icon. Creating this connection makes the processor aware of the channel, After connecting the channel to the processor, you can refer to the channel by its ID value in CQL code. Double-click the GetHighVolumeProcessor icon to open its configuration code in the config.xml file. In the config.xml file, replace the query element with the following query XML: <query id="GetHighVolume"><![CDATA[ select trade.symbol, trade.volume from AdapterOutputChannel [now] as trade where trade.volume > 4000 ]]> </query> The code window should look something like the following: In the EPN editor, right-click an empty area of the diagram, then click New > Channel. Right-click the icon for the new channel, then click Rename. Type ProcessorOutputChannel and press Enter to rename the channel. Click the GetHighVolumeProcessor icon, then drag to the new channel icon to connect the processor and channel. Click the ProcessorOutputChannel icon, then drag to the ListenerBean icon to connect the channel to the listener. Click the Layout EPN button to tidy the diagram so that the icons are in a row from left to right in order of sequence. Double-click the ProcessorOutputChannel icon to open the channel's configuration in the assembly XML file. In TradeReport.context.xml, replace the default channel configuration with the following XML. In particular, note that you're specifying that TradeEvent is the event type that passes through this channel. <wlevs:channel <wlevs:listener</wlevs:channel> Save all of the files in the project. At this point, you should be ready to debug the application again. In this section, you'll debug once more to confirm that your CQL code is producing the results you intend. In the IDE, open the TradeListener.java file you created in an earlier step. In the Project Explorer, the file should be visible by expanding TradeReport > src > com.oracle.cep.example.tradereport. In TradeListener.java, confirm that you have a breakpoint at the line with the following code: System.out.println(symbolProp + ":" + volumeProp); You might need to rebuild the project before you can successfully debug.. When the Console view's output ends with <Server STARTED>, the server is running in debug mode. don't have one already, open a command prompt and change directory to the load-generator directory installed with Oracle Event Processing. By default, this is at the following path: ORACLE_HOME/Middleware/ocep_v11. Notice that the event contains only two values -- symbol and volume. That's because your query selects only those two values from events that pass through the processor. Click the Resume button repeatedly to advance execution from event to event, noticing the values in each. In the Console window, notice that the listener code is printing stock symbols and volumes from the events it receives. If you have coded your query correctly, all of the volume values should be higher than 4000. In the Servers view, select the Oracle Event Processing server, then click the Stop the server button. In the load generator command prompt window, press CTRL+C to stop the load generator. That's it -- you've finish this application. For a list of the things covered in this walkthrough, along with links to more information, see Section 8.9, "Summary: Simple Application Walkthrough". This section summarizes the simple application walkthrough, which begins with Section 8.1, "Introduction to the Simple Application Walkthrough". In this walkthrough, you built a simple Oracle Event Processing application. You assembled an event processing network to receive events and report on those that met certain criteria. For other introductory content, see Chapter 1, "Overview of Creating Oracle Event Processing Applications". This walkthrough introduced the most basic aspects of developing Oracle Event Processing applications. Those concepts include: IDE features designed to make building Oracle Event Processing applications easier. To start learning more about the IDE, see Section 4.1, "Overview of Oracle Event Processing IDE for Eclipse". Building an application as an event processing network (EPN). For another introduction to EPNs, see Section 1.2, "How an Oracle Event Processing Application Works". Designing event types that model events. For more information, see Section 9.1, "Overview of Oracle Event Processing Event Types". Using adapters to manage interactions with external components. Oracle Event Processing includes adapters. You can also build your own. See the following sections for more: Chapter 11, "Integrating the Java Message Service" Chapter 12, "Integrating an HTTP Publish-Subscribe Server" Chapter 15, "Integrating an External Component Using a Custom Adapter" Chapter 21, "Testing Applications With the Load Generator and csvgen Adapter" Implementing a Java class that can receive or send events. For more on writing event sinks and event sources, see Chapter 16, "Handling Events with Sources and Sinks" Event streams and relations as models for handling events as they pass through an event processing network. For an introduction to streams and relations, see Section 1.3, "Overview of Events, Streams and Relations". Using Oracle Continuous Query Language (Oracle CQL) to find and filter events. For more on Oracle CQL, see Chapter 17, "Querying an Event Stream with Oracle CQL"
http://docs.oracle.com/cd/E28280_01/dev.1111/e14301/walkthrough_simple.htm
CC-MAIN-2016-40
refinedweb
8,294
62.88
This article describes the SPU pipeline configuration, performance metric, and trace facilities that are available in the IBM® Full-System Simulator for the Cell BE platform (available for public download on the IBM alphaWorks Web site -- see Resources). You can get information to show the detailed internal state of an SPU at each cycle of execution. Cell BE software developers who are concerned with tuning the low-level performance characteristics of their applications can use these mechanisms to identify stalls, operand dependencies, and so on. The article also covers the procedures necessary to configure SPU characteristics and to enable the inspection features and gives some guidance in interpreting the resulting output syntax and semantics. Enabling the SPU tracing facilities in the simulator The IBM Full- System Simulator for the Cell Broadband Engine Processor platform models the Cell BE processor. This article assumes you have access to an installation of the simulator and some familiarity with its basic operation. If not, please refer to Peter Seebach's developerWorks "Get started with the Cell Broadband Engine Software Development Kit" series, Part 1 of which outlines the required procedures. Some familiarity with the SPU pipeline operation is also assumed; for more on this see also SPE Book IV. You can configure each of the models of the eight SPE cores (SPUs) to simulate code execution either in a purely functional manner or at the cycle level by switching the mode of its operation between "instruction mode" and "pipeline mode." Toggling between modes for a particular SPU is accomplished from the simulator's TCL command line (CLI) or from the GUI. For instance, for the CLI command to switch SPU 0 to pipeline mode for the "mysim" simulation instance (assuming the simulator "mysim" and SPU 0), the command is: mysim spu 0 set model pipeline You can toggle from the GUI in a couple of different ways. Within the control panel's processor tree pane, double-click the model mode entry of the desired SPE. The model will toggle between pipeline and instruction modes of operation: Figure 1. SPE0, set to the pipeline model Alternatively, you can use the SPU Modes dialog to toggle conveniently between "pipeline" and "instruction" modes. Use the "SPU Modes" control panel button to launch the SPU Modes dialog, then toggle the mode for the SPUs as appropriate: Figure 2. The SPU Modes window Configuring the SPU pipeline operation By default, the SPU pipeline model characteristics are configured to correspond to the Cell Broadband Engine hardware. This is the only configuration that has been validated against BE SPU logic, and is the configuration the SDK compilers target when generating SPU code. Because the Full-System Simulator for Cell BE is a research tool, SPU pipeline characteristics can be modified to facilitate academic exploration of alternative configurations. Experimenters wishing to exploit the SPU model configuration commands should bear several important aspects in mind: - SPU pipeline characteristics can be configured which are not feasible to implement in hardware. - Alternative configurations are untested and unsupported. Many complex and subtle interactions are modeled which are not guaranteed to operate properly in alternative configurations. Unexpected behaviors which produce misleading data is typically the result. - SDK compilers assume the default Cell BE SPU configuration when scheduling generated code. Compiled code might not execute optimally on alternative configurations. SPU characteristics are defined by the simulator's "cell" configuration object. Alterations must be made to a mutable copy of the "cell" object, and applied when constructing the simulated machine. The experimenter will need to modify the simulator's TCL startup script (for example, .systemsim.tcl) accordingly: # Create a mutable copy of the cell configuration object (for instance, "myconf") define dup cell myconf # Configure characteristics here. Refer to the table below for parameters and values myconf configure parameter value myconf configure parameter value ... # Construct the "mysim" simulated machine using the "myconf" configuration object define machine myconf mysim Table 1 lists SPU pipeline configuration parameters: Table 1. SPU pipeline model parameters The "sp-dual" feature determines whether another instruction can be issued simultaneously with a single precision operation. "dp-dual" governs the same behavior for double precision operations. The "ls-line-contend-load-only" feature specifies whether instruction line fetch contends with register file load operations only (TRUE), or with both load and store operations (FALSE). In the SPU model, this contention point is checked whenever an instruction line prefetch request is ready to enter the load/store pipe and a load/store operation is valid in stage "n" of the odd execution pipe. The depth parameter determines the latency needed to execute an instruction of the indicated class (from the time an instruction of that type enters the top of the execution pipe). The stall parameter specifies the minimum number of cycles the machine will delay before issuing any subsequent instruction to the execution pipe receiving an instruction of the indicated class. Table 2 gives pertinent depth and stall information for each "iclass": Table 2. SPU pipe depth and stall by instruction class For instance, fully pipelined double-precision operations could be simulated by enabling the "dp-dual" feature (setting spu/feature/dp-dual to TRUE), and by removing issue stalls for instructions following DP operations (setting spu/pipe/FPD/stall to 0) in the mutable configuration object prior to constructing the machine. Be aware that in the current version of the SPU model, modifying the load/store (LS) iclass depth and stall configuration parameters produces unpredictable behavior. Capturing simple SPU performance metrics The Cell BE Full-System Simulator provides a number of mechanisms to instrument applications and collect performance data. A thorough treatment of this subject is beyond the scope of this article, so I will briefly describe the most commonly used methods. The SPU model provides several event counters that can be controlled through TCL commands, as well as by the SPU applications themselves. Counters for SPU n can be reset using the simulator's " mysim spu n stats reset" TCL command. The Cell BE SDK includes declarations for functions to start, stop, and clear the model's event counters. These functions resolve to specially encoded No-Ops (AND x,x,x) when the SPU application is compiled. As the application is executed in simulation, the No-Op instructions are intercepted by the model to control the event counters. #include "profile.h" ... prof_cp0();/* Clear performance counters, inserts "AND 0,0,0", same as prof_clear() */ prof_cp30();/* Commence event counting, inserts "AND 30,30,30", same as prof_start() */ /* Code sequence to measure */ prof_cp31();/* Cease event counting, inserts "AND 31,31,31", same as prof_stop() */ ... When each of these counter control operations is interpreted by the SPU model, a message is displayed at the simulator's output window: SPUn: CPx, instruction count(non-NOP count), cycle count n is the SPU number and x is the control function code (AND x,x,x). The total number of instructions executed (instruction count), non-NOP instruction count subset, and SPU clock cycles elapsed since the counters were last cleared, follows that information on each line. More detailed event counter information can be displayed using the simulator's " mysim spu n stats print" TCL command. Enabling the SPU tracing facilities in the simulator SPU tracing provides much greater visibility into the internal operations of the simulated machine. Pipeline tracing is enabled by issuing the following TCL CLI commands in the simulator: simdebug set SPU_DISPLAY_ISSUE 1 simdebug set SPU_DISPLAY_EXEC 1 Alternatively, you can do this through the GUI. Bring up the simulator's debug control panel by pressing the "Debug Controls" button. Then, select the " SPU_DISPLAY_ISSUE" and " SPU_DISPLAY_EXEC" options from the debug controls dialog: Figure 3. Debugging options When an SPU model is configured to execute in pipeline mode and the debugging facilities are enabled as described, a text frame will be written to standard output (stdout) each cycle. A considerable amount of text information is displayed each cycle. Simulation performance will also degrade while tracing is enabled, due to the run time overhead required to collect and format trace data. Interpreting the SPU trace output Below is a sample SPU trace frame captured during the execution of an FFT algorithm written for the Cell BE platform (at cycle 229). Trace frames are dumped at the end of each cycle, after all updates, execution effects, and state changes have been made by operations in the current cycle, and before any pipelines are advanced for the next cycle. This is an important factor to keep in mind because the simulator's SPU model is clock-synchronous and is updated in reverse pipeline order. Updates occur to the execution pipe, then issue, then fetch. I will attempt to explain areas where this is an issue in interpreting the trace frames. Figure 4. And this is just one cycle! The SPU trace frame is composed of a number of textual regions, each of which describes an aspect of the SPU core pipeline state. The balance of this article provides detailed descriptions for each of these regions. See a legend for a typical SPU trace frame below. Table 3 provides a list of links you can use to navigate to any particular region of interest depicted in the annotated trace frame legend of Figure 5. Table 3. Map Figure 5. The components of an SPU trace Cycle and instruction count Figure 6. Cycle and instruction count This line indicates the current cycle number (in SPU processor clocks) and total instruction count (of executed instructions). Valid instructions are counted and interpreted in stage "o" (letter "oh", see section on execution pipes for details). The instruction count shown reflects having been incremented this cycle by the number of valid (non bubble) instructions present in stage "o." (Recall that the trace frame shows the state at the end of the cycle). Mispredict status Figure 7. Mispredict status Mispredict state is shown on this line. The number before the arrow (->) indicates the mispredict state (0 through 5) at the end of the current cycle. Zero indicates not under mispredict. The address after the arrow indicates the local store address of the next program counter (here, 0x003e0) -- since the trace frame shows state after execution has updated the SPU. The PC is updated by instructions executed in stage "o" (see section on execution pipes for details), by SPU interrupts, and by MMIO writes. Hint status Figure 8. Hint status The hint state line address before the arrow (->) is the local store address of the hinted instruction (usually a branch), in this case 0x0040c. The address after the arrow is the local store hint target address. If the hint is valid, it will be suffixed with an asterisk (*). Here, we have a valid hint which was triggered when the branch at 0x0040c was loaded into the predicted path buffer. Upon triggering, instruction prefetch is re-directed to follow the last half-line address (64 bytes, or 16 instructions) of the hint target buffer. There is a pending request for line 0x00300 which was initiated for this reason (refer to the section on prefetch unit state for details). Instructions from the 128-byte line at the hint target address have already been loaded into the hint target buffer, and will be fed into the predicted path buffer for subsequent issue as soon as the hinted branch is fetched into issue stage "g." See below for further description of the hint target buffer and hint instruction behavior. Prefetch unit status Figure 9. Prefetch unit status The prefetch unit state trace frame information has two parts. The first, labeled "pre-fetch" shows the pre-fetch request queue -- a four-deep queue of local store line-sized addresses (128-bytes, or 32 instructions each). The oldest request is furthest right in the queue. Here you see two pending requests for the 128-byte line at address 0x00300 (the oldest) and the adjacent line at address 0x00380. These requests were initiated by hint triggering and follow the address of the second hint target buffer half-line in ilbh2. The second part of the prefetch unit trace frame information, labeled "pre-fetch ls" shows outstanding 128-byte line instruction prefetch requests being processed by the SPU load/store unit pipeline. The pipeline shown here is six stages long. Requests which reach the (right) end of the request queue are accepted into the load/store pipe from the request queue at a maximum rate of one every other cycle. A new request will stall at the head of the request queue if: - A request is already in either of the first two stages (leftmost 2 positions) of the load/store pipe (every-other cycle entry rule). - A load/store instruction will execute at stage "o" of the execution pipe during the next cycle (local store arbitration rules dictate instruction fetch requests are lower in priority than load/store register file accesses). Thus, if stage "n" has a "hole" shown at the end of the current cycle (no valid load/store instruction), the prefetch request will have been allowed into the load/store pipe for the next cycle. Figure 10. A pending request Here you see a request (0x00300) arbitrating for the load/store pipe. The load/store pipe currently has no outstanding prefetch requests, but a load instruction (lqx at 0x003e0) is pending execution in stage "n" (will be at stage "o" next cycle). The request will not be allowed to enter the load/store pipe until a "hole" (non load/store instruction) opens in execution pipe stage "n." This will occur at the end of cycle 231, after the bubble currently at stage "l" (letter "el") has made its way to stage "n," two cycles from now. See below for more detail on interpreting the execution pipeline information. Each prefetch request address is prefixed by either a number or a "?" (separated from the address by a dash). Numbers indicate the destination of the prefetch: 1 -> ilb1, 2 -> ilb2, and 3 -> ilbh. Here, the request for line 0x00300 (designated 1-0x00300) is destined for ilb1 and for line 0x00380 (designated 2-0x00380) is destined for ilb2. The "?" designation is given to "stale" inline prefetch requests. Recall that hint triggering causes inline prefetch to be redirected to obtain lines whose address follows ilbh2. Any prefetch requests which are already queued for older inline prefetches could be "stale," and would need to be flushed to allow the re-directed requests to proceed to arbitrate immediately for the load/store pipeline. When the hint triggers, any prior outstanding inline prefetch requests are marked as stale. Stale requests are only candidates for disposal and will be processed normally if not discarded prior to load/store pipe entry. After the predicted path buffer is loaded from ilbh1 (in other words, the hinted branch is fetched to issue stage "g"), any remaining stale prefetch requests are flushed from the request queue. The mechanisms to queue and process outstanding prefetch requests differ somewhat between the SPU simulator and the SPU implementation. Modeling "stale" prefetch requests is an artifact of the SPU simulator approximation. Hint target buffer Figure 11. Hint target buffer The hint target buffer ( ilbh) holds a maximum of one 128-byte line (32 instructions) beginning at the local store address of the hint target. The trace frame shows the hint buffer split into two half-lines ( ilbh1 and ilbh2), each holding a maximum of 64 bytes (16 instructions). The half-line buffers are valid if marked with an equal sign (=), and invalid if marked with an X. A prefetch request to load the hint buffer is initiated when a hint instruction (hbr-type without "P" bit set) is executed (reaches execution stage "o"). This request takes precedence over any pending inline prefetch requests. After the request is accepted by the load/store pipeline and subsequently reaches the end of the load/store pipe, 128 bytes (32 instructions) will be loaded into the hint buffers. Although a full 128-byte line is read, the actual number of valid instructions in the hint buffers depends upon whether the hint target is aligned on a 128-byte boundary. Here, the branch at 0x0040c targets address 0x00298, which is offset 0x18 (24 bytes, or six instructions) into the line beginning at 0x00280. Hence, only 10 of the 16 instructions held in ilbh1 will be valid. Instructions held in the hint buffers will remain valid until: - The pipeline is flushed. - A new prefetch request initiated by an executed hint instruction reaches stage three or four of the load/store pipeline. Valid instructions from the hint buffer will be fed into the predicted path buffer when the hinted instruction (here, the branch at 0x0040c) is loaded into stage "g" of the issue pipeline. Note that transferring instructions from the hint buffer to the predicted path buffer does not invalidate the contents of the source hint buffer. Inline prefetch buffers Figure 12. Inline prefetch buffers The two inline prefetch buffers ( ilb1 and ilb2) each hold 128-byte lines (a maximum of 32 valid instructions, depending upon alignment). Each buffer is split into 64-byte half-lines (a maximum of 16 valid instructions). The two halves of ilb1 are labeled " ilb11" and " ilb12." The two halves of ilb2 are labeled " ilb21" and " ilb22." Valid buffers are marked with an equal sign (=), and invalid buffers are marked with an X. A request to load an inline prefetch buffer is generated: - For the address following ilbh2when a hint is triggered (the hinted branch is loaded into the predicted path buffer). - For the corrected address of a misprediction (in mispredict cycle/state three). - For the address following the second half-line of ilb1or ilb2when that half-line is loaded into the predicted path buffer. Inline prefetch buffers are loaded with up to 32 instructions once the request reaches the end of the load/store pipeline. Inline half-line prefetch buffers are invalidated: - When instruction content is transferred to the predicted path buffer - During pipeline flush - At mispredict cycle/state two - Eight cycles after a hint is triggered Note that condition (1) above necessitates eventual inline buffer re-fetch, since the process of transfer to the predicted path buffer is "destructive" (as compared to the hint buffer which is not affected by predicted path transfer). Predicted path buffer Figure 13. Predicted path buffer The predicted path buffer is a half-line (64 byte, 16 instructions) wide and directly feeds the issue pipelines. Upon hinted branch entry into issue stage "g," the hint buffers ( ilbh1 and ilbh2) non-destructively transfer data into the predicted path buffer for subsequent issue. Otherwise, the inline prefetch buffers ( ilb11, ilb12, ilb21, or ilb22) will in turn destructively transfer data to the predicted path buffer for issue. The predicted path buffer is marked valid by an equal sign (=), or invalid by an X. The next fetch offset within this buffer is denoted in parentheses following the local store address of the half-line in the buffer. Here, the predicted path buffer was filled with the half-line (0x00400) contents of ilb11 (which has been invalidated as a result). The first pair of instructions from the predicted path buffer have been sent to the top of the issue pipeline (stage "g") -- the shufb at 0x00400 in pipe 0, and the shufb at 0x00404 in pipe 1. Fetch will proceed to the pair of instructions at offset 0x8 within the predicted path buffer on the next cycle. Prefetch miss occurs whenever the predicted path buffer cannot be filled with valid instructions from either the inline or hint target half-line buffers. Issue pipes Figure 14. Issue pipes The uppermost stages ("g" through "j") of the two SPU pipelines handle IN ORDER issue of instructions from the predicted path buffer. No shifting of instructions occurs between the two issue pipelines (to backfill vacancies opened from single issues). The left-hand column of four lines corresponds to issue pipe 0 (even). The right-hand column corresponds to issue pipe 1 (odd). Instructions from the predicted path buffer at even effective addresses fill pipe 0, while instructions at odd effective addresses fill pipe 1. Each of the four lines corresponds to an issue pipeline stage, and shows the local store address and disassembly of the instruction resident in the given stage. Instructions which are valid are marked by an equal sign (=), while invalid slots (bubbles) are marked by X. Valid instructions which reach stage "j" are issued to either execution pipe 0 or pipe 1, depending up on the instruction class. Note that the determination of issue pipe for a given instruction is made based on its address, while the determination of execution pipe is made based on the instruction's class. Refer to Table 4, provided in the "execution pipe" section below. Two instructions at stage "j" of issue pipes 0 and 1 might be issued simultaneously (dual-issue) when: - There is no cross issue (or, the instruction at stage J of issue pipe 0 maps to execution pipe 0, and the instruction at stage J of issue pipe 1 maps to execution pipe 1). - There is no operand dependency. The following two possibilities can cause dependency stalls: - A source register needed by the issue candidate instruction is the target of a valid unexecuted instruction in the execution pipe. - A source register needed by the candidate in issue pipe 1 is the target of the instruction in issue pipe 0. - There are no structural issue stalls: - Double-precision floating point instructions impose a six-cycle stall between consecutive issues. - No instructions can be dual-issued with a double-precision instruction. If no instructions can be issued for a given cycle, the issue pipelines will not advance (stall) and no instructions will be consumed out of the predicted path buffer. Bubbles (invalid stop instructions) will be inserted into the affected execution pipes each cycle until the issue stall conditions are resolved. Instructions in the issue pipes might be invalidated when: - There is a pipeline flush. - Mispredict cycle/state five is reached. Execution pipes Figure 15. Execution pipes Execution pipelines follow the same display conventions as the issue pipelines. You can think of pipe stage "jj" (marked with an asterisk (*)) as the top of the execution pipelines. Execution pipelines do not stall. Instructions are mapped by issue to either pipe 0 (even) or pipe 1 (odd) depending upon the class of instruction (or, the pipelines are asymmetric, having different functional units assigned to each pipeline). In the sample trace frame, all of the instructions in both issue pipes will be sent to execution pipe 1, since they are all either shuffles, loads, or stores. The latency required to execute each instruction also varies by instruction type. The table below provides timing and pipeline assignment for each instruction class: Table 4. SPU instruction class and timings Operand dependency information Figure 16. Operand dependency The system simulator's SPU model interprets all valid instructions at stage "o." The effects of differing execution unit pipeline lengths are modeled by "releasing" target operands from dependency calculations after the appropriate latency has expired. The two rightmost columns of the execution pipe section of the trace frame show the dependency information. The "P0" column describes operand dependencies for instructions in execution pipe 0. The "P1" column describes dependencies for instructions in execution pipe 1. The number in parentheses is the target register number for the value to be produced by the corresponding instruction. For instance, the P1 column shows 8 for the lqx at 0x003e4 in stage "m" and 10 for the lqx at 0x003e0 in stage "n." Note that the shufb instruction ready at issue pipe 0 stage "j" (for execution pipe 1) is being stalled because of the register 10 source operand dependency. This is the cause behind the insertion of bubbles (the three invalid stop instructions) at the top of execution pipe 1 until the lqx at 0x003e0 completes execution and writes its target register. The value -1 in the dependency columns indicates the corresponding instruction has no targets (or is a bubble). The value 128 indicates the instruction's target has been "written" (released) and will therefore no longer prevent instructions from issue due to source/target operand dependencies. Where to go from here The Cell BE simulator provides extremely detailed analysis on a cycle-for-cycle basis of the current state of a simulated SPE. The output is densely packed, but now that you've got an overview of the components, you can analyze performance carefully, identifying the code paths where performance is hurting. Once you know where a branch is being mispredicted, or an algorithm is stalling waiting for results, you may be able to reorganize code to reduce or eliminate stalls. It might take a bit of practice to make effective use of this information; especially the first few times you have to track something down, budget extra time for figuring out what to look at, and for learning your way around the processor's architecture. Resources Learn - Find a good overview of the whole Cell BE architecture in Unleashing the power of the Cell broadband engine, previously published at developerWorks. - Another way to get a handle on where stalls come from is to look at issues faced by compiler writers targeting the SPE, in this developerWorks tutorial. - The Cell Cell BE. - Keep abreast of all the Power Architecture-related news: Subscribe to the Power Architecture Community Newsletter. Get products and technologies - Mercury Computer Systems' is shipping Dual Cell-Based Blades to early-release customers; and IBM has announced Cell BE-based blade systems (look for availability in or around Q3 2006). Additionally, Toshiba's comprehensive Cell Reference Set development platform and the Sony PlayStation® 3 are both expected to be released later in 2006. - If none of those are exactly what you are looking for, Contact IBM E&TS for custom Cell BE-based or custom processor-based solutions. - Get the alphaWorks Cell Broadband Engine downloads -- including the IBM Full System Simulator. - See all Power Architecture-related downloads on one page. Discuss - Participate in the discussion forum. - Take part in the IBM developerWorks Power Architecture Cell Broadband Engine discussion forum. - Send a letter to the editor..
http://www.ibm.com/developerworks/power/library/pa-cellspu/index.html?ca=drs-
CC-MAIN-2014-49
refinedweb
4,358
50.97
import "gopkg.in/src-d/go-git.v4/plumbing/revlist" Package revlist provides support to access the ancestors of commits, in a similar way as the git-rev-list command. func Objects( s storer.EncodedObjectStorer, objs, ignore []plumbing.Hash, ) ([]plumbing.Hash, error) Objects applies a complementary set. It gets all the hashes from all the reachable objects from the given objects. Ignore param are object hashes that we want to ignore on the result. All that objects must be accessible from the object storer. func ObjectsWithStorageForIgnores( s, ignoreStore storer.EncodedObjectStorer, objs, ignore []plumbing.Hash, ) ([]plumbing.Hash, error) ObjectsWithStorageForIgnores is the same as Objects, but a secondary storage layer can be provided, to be used to finding the full set of objects to be ignored while finding the reachable objects. This is useful when the main `s` storage layer is slow and/or remote, while the ignore list is available somewhere local. Package revlist imports 6 packages (graph) and is imported by 7 packages. Updated 2019-08-01. Refresh now. Tools for package owners.
https://godoc.org/gopkg.in/src-d/go-git.v4/plumbing/revlist
CC-MAIN-2020-10
refinedweb
173
51.04
Code - notes and coding rules The documentation for using wurst lives in wurst.pod. This is a description of internals, conventions and how to change the code. Have a look at some example files. There is a standard layout for making functions stand out. Please do not use your own layout, even if it is prettier. The aim is consistency and predictability. There are no tab characters. Use spaces. Use four spaces to indent in functions and loops. Indentation is almost pure Kernighan and Ritchie with four spaces. Try to make code readable in a window of 80 columns or printed page of 80 columns. This may mean shortening your line or breaking it in a place you think makes it more readable for others. All the files have lines like this: #if !defined (lint) && !defined (DONT_SEE_RCS) static const char *rcsid = "$Id: coding.pod,v 1.1 2007/09/28 16:57:19 mmundry Exp $"; #endif /* !defined (lint) && !defined (DONT_SEE_RCS) */ These come after the #include directives. Begin every function as in the examples. Do not use your own style, even if you think yours is better. Every function begins: /* ---------------- foobar ----------------------------------- * This function takes an argument and makes coffee. */ static int foobar (int zot) { .... To list the properties: There should usually be a space after punctuation, for exactly the same reasons as in English (helping readability). Commas and semi-colons definitely want to be followed by a space. Do not write for (a=0;a<lim;a++){ Do for (a = 0; a < lim; a++) { If the line is going to go beyone 79 spaces, delicately delete spaces while trying to keep readability. A typedef is useful for complicated structures. In many other places it obscures the meaning. In wurst, typedefs should never go into function prototypes. If they do, then other files cannot easily include the function prototype. Consider a very complicated structure of type struct tree. In a header you may write struct tree; int function (struct tree *t); Then anyone can include it without needing the definition of struct tree. If you write int function (treestruct *t); Then nobody can include it without seeing the typedef. blah.hand the one with the interface, blah_i.h. Do not add your own type with a name like "boolean" for true/false. If you are talking about errors, use EXIT_SUCCESS/ EXIT_FAILURE since these are ANSI standard. If you have a yes/no situation, then there is a header file with a simple enumerated type in yesno.h. The problem with your own boolean is that it gets redefined by different people, TRUE and FALSE often appear in unrelated header files and the most recent C standard has its own idea about boolean types. The order in which you declare variables should make no difference. On the compaq, at least within structures, the compiler makes noise unless you order objects from largest to smallest. This avoids padding to get best alignment. If a function can possibly be made static, it should be. Symbols should be no more visible than is necessary. There are also optimisation advantages (the compiler can assume a function is local and generate only an inlined version). If you have a static function you must In other words, do static int function (int arg) { ... } ... b = function (a); Rather than static int function (int arg); ... static int function (int arg) { ... } ... b = function (a); Obviously this rule has to be broken if there is mutual recursion. This rule exists for consistency (it is used in every file) and to follow the principle that we should write things the minimum number of times and lastly, to ensure that whenever possible, a compiler is given all the information about a static function by the time it is used. There are two aspects to this. Generally, the C functions do not print out too much information in case of error. They must, however, return an error code to the interpreter. The C functions should use err_printf() to pass on the result of strerror()/ perror(). Typically, this means the lower level C code will write something like no such file or directory, but it is up to the interpreter/script to decide whether or not to go on. Most of the C code returns EXIT_SUCCESS if it is happy and EXIT_FAILURE (as defined in stdlib.h). This leads to a problem. EXIT_FAILURE may be defined as 1, but the perl interpreter usually takes 1 as indicating success. The convention in this code is that EXIT_SUCCESS/ EXIT_FAILUREas it pleases. The interface code (Wurst.xs) handles swapping the sense when necessary. So, if C code returns an error, the interface code may do XSRETURN_UNDEF. Wurst code may not call any of the following directly. At least not to stderr. There are some general areas to think about. Functions should not print to stdout or stderr directly. Everything should go via err_printf() or mprintf() or mfprintf(). If you have to print, you code must include #include "mprintf.h" Takes exactly the same arguments as printf(). Exactly the same as fprintf(). This is a replacement for fprintf(stderr, "blah"), but it is not a direct wrapper. The convention is #include <stdio.h> #include "mprintf.h" ... int foo_bar (...) { const char *this_sub = "foo_bar"; ... if (error) err_printf (this_sub, "blah %s message\n", args); } This will result in a printing to something like stderr a string like Function foo_bar: blah args messsage All these functions with names like mxxx(), behave exactly as xxx(). If you have a static string to pass back to the interpreter, declare the function as char * some_func (..) and all will be well. This. however, is the exception. Normally, there is a string to be printed out and it has been dynamically allocated. After the interpreter has finished with the string, it should be free()'d. There are two ways to go about this. Both the approaches are fine, but perhaps the first (perl's mechanism) should be preferred from now on. Imagine your function allocates space for a string, writes something into it and you want the interpreter to be able to print it out. In the C code, declare your function returning char * like char * my_func (...) { char *x = E_MALLOC (sizeof (x[0] * length); strcpy (x, "something"); return x; } Then, in the file, something.xs, use an interface like SV * my_func (a) int a; CODE: { char *s = my_func(...); RETVAL = newSVpv (s, 0); free (s); } OUTPUT: RETVAL This will copy the string into a SV which the interpreter knows how to deal with. We can immediately free() the pointer from our function. The second method is to use the scratch space routines, scr_printf() like this. #include "scratch.h" char *s; scr_reset(); s = scr_printf ("blah %s\n", foo); s = scr_printf ("more text\n"); return s; The first call scr_reset() is necessary to tell our scratch space to free any old strings. Subsequent calls append the strings. Do not call malloc(). Instead, call the macro E_MALLOC(). This takes exactly the same arguments as malloc(), but expands to print out the file and line number if malloc() fails. It is a conscious design decision that we do not do any error recovery there. If we run out of memory, we are cactus. Most of the time, memory is malloc()'d and free()'d at the same level of code. There is a major exception to this. Objects which are passed back to the interpreter rely on the interpreter's garbage collection. You must declare and appropriate routine like foo_blah_DESTROY(). This will be called by the interpreter when the reference count for the object goes to zero. This routine must clean up any allocated space. This approach works well for objects like score matrices. These are allocated once. Although their contents may be manipulated, they do not move. Other objects, such as sequence arrays may grow or shrink and move about as determined by calls to E_REALLOC(). This means we have an extra level of redirection and the interpreter is actually given a pointer to a pointer to a sequence array. The score matrix for two objects of size M and N is of size, (M + 2) * (N + 2). The reason is that it is easier to do special treatment of ends and end gaps this way. This means one has to be careful when coding around the score matrices. In an early version, functions operated on arrays of sequences. This is being phased out. Some functions may still be able to handle arrays of sequences, mainly for getting sequences in FASTA format. These items hold a sequence. The size element holds the number of residues, but the string is allocated for (n + 1) so we can really treat it as a string with a null terminator. Sequence strings can either be conventional, one-letter amino acid names or in 'thomas' format. The strings have an enumerated type to say what state they are in. If your code depends on some format, then call the appropriate function to convert the string from one style to the other. For example, score functions will often force strings to 'THOMAS' format. Before printing, strings will usually be converted to 'PRINTABLE' format. The coordinate structure not only holds coordinates, it holds a corresponding sequence in a struct seq containe within. The number of elements in the coord and seq structures must be the same. Within the coord structure, code may not assume that the secondary strucure (sec_s) is complete, nor the phi angles (phi). If these are NULL pointers, it means they have not been read up, calculated or filled out. The coord_DESTROY routine has a look to see if these are NULL pointers and calls free() only if they are non-NULL. Probability vectors are complicated because In more detail In expanded form, the data is in a dynamically allocated 2D array. In mship[a][b], the slower changing index, a is the site in the protein. The faster, b, is the class index. In the mship[a][b] example, most of the elements are near zero. In the compressed form, cmpct_n->cmpct_n is an array where each element tells us how many non-zero probabilities are associated with site a. For site i, cmpct_n[i] says how many probabilities are stored in prob_vec->cmpct_prob. For each of those probabilities, there is a corresponding entry in prob_vec->cmpct_ndx which is the number (index) of the associated class. The number of elements in cmpct_prob will be the same as in cmpct_ndx. If there is no compressed data, prob_vec->cmpct_n must point to NULL. If prob_vec->cmpct_n is non-null, the pointer will be assumed valid. If there is no expanded data, prob_vec->mship must point to NULL. In terms of probabilities, the vector should be normalised so that all the entries sum to 1.0. When comparing objects, we want to treat the probability vectors as vectors of unit length, so we can take the dot product in order to see the similarity. We also have to allow for not knowing the state of our vectors. These three situations are coded for by setting prob_vec->norm_type to PVEC_TRUE_PROB PVEC_UNIT_VEC PVEC_CRAP Describe the number of sites. To add a function to wurst, you have to add something to This is the C/perl interface This advertises the symbols which the scripts can use. The actual code to be called. This is the documentation. In more detail. If you want to add a function, do_stuff which acts on something of type thing_struct, then do at least the following. In do_stuff.c, or wherever, define the function like int do_stuff (struct thing_struct *thing) { .... } In do_stuff.h, prototype the function interface like int do_stuff (struct thing_struct *thing); Don't define the structure here. It is not necessary for the perl interface to see structure internals. In Wurst/Wurst.xs, add #include "do_stuff.h" and a typedef typedef struct thing_struct Thing_struct; The capitalisation is not a joke. Perl likes it. Finally, still in Wurst/Wurst.xs, add the function interface, int do_stuff (x) Thing_struct *x; Go to Wurst.pm. Find the @EXPORT section and add do_stuff. Go to pod/wurst.pod and add a description of the new function under the heading, FUNCTIONS If the function returns some data type back to the interpreter, add a mention of that data type as well. There are two kinds of debugging: This is not so interesting. Use the perl debugger. This is more fun and discussed below. Wurst is coded as a perl extension, but perl does not have debugging symbols. During development, we will typically compile the extension with -g. The problem is that you cannot set breakpoints since at program load time, the perl extension (a dynamically loaded library) is not there and the debugger does not see a symbol table. This is not a terrible problem. The trick is to send a little signal after the program has started, but before the breakpoint. There are two ways to do this. Somewhere early in the perl script, before entering the function where you want a breakpoint, insert $SIG{TRAP} = 'IGNORE'; kill 'TRAP', $$; You could also set $SIG{TRAP} to point to some function of your own. These lines say that we will ignore TRAP signals. Then the code sends a TRAP to itself. The debugger notices the signal and gives you a command prompt. Now, the dynamic library is loaded and breakpoints can be set. This works with either gdb or dbx. The nice aspect of this approach is that when one is not debugging, the script runs fine. The signal is sent, but ignored. Sometimes one knows pretty well which function is going to be a problem, and where one wants to look closely. We can use the same mechanism by calling kill() from the C code. The easiest way to do this is to find the file of interest. At the top of the file, #include "dbg.h" In the subroutine of interest, insert a line breaker(); This little function just gets out the current process ID and sends it a trap'able signal. The debugger will give you a command prompt inside the breaker() function which can be quickly stepped out of. This is a challenge. One wants to work with a debugging malloc() library, which looks for leaks and so on. When building perl, it offers you the use of its own malloc() library or the system one. It is probably useful to build perl with the system library. The memory checking under dbx on Solaris works fine. Getting an add-on library like electric fence to work under solaris is a bore. Wild use of the LD_PRELOAD environment variable results in a program which gobbles up all available memory. Under linux, it seems to be no problem to link electric fence in. We assume that perl itself is free of leaks and we only want to instrument our library. Please follow these rules when writing wurst code. Keep the definition of the interface minimal and separate from the definition of the innards. If you have a C file call foo.c, then For example You may have some code like struct cow { int legs; float weight; }; int print_cow ( struct cow * daisy) { .... } Now there are a few files which have to know the innards of a struct cow and others which will want to call print_cow(). In this case, create a file cow.h which defines the structure: struct cow { int legs; float weight; }; and in a separate file, cow_i.h, struct cow; int print_cow (struct cow *c); Note: struct cow {...}. typedef struct cow Cow; typedef struct cow *CowPtr; then the prototype for print_cow() would be int print_cow (CowPtr); but then every caller would need a definition of CowPtr. Please do not do that. Use the wrappers in mprintf.c. These may not do anything fancy now, but they allow us to wrap our output at a later stage. For example, a Tcl extension is not allowed to read or write to stdout / stderr. In that case, the wrappers can do whatever is necessary to get printf(), fprintf() functions. It is so frequent that we call fopen() with an error message, that this is now in the wrapper, mfopen() in fio.c. Use #include "fio.h" FILE * mfopen (const char *fname, const char *mode, const char *s) where fname and mode are as for fopen() and s is a string which will go into error messages. Typically, this will be the name of the caller. We have a hook to ask the OS not not to cache a file after reading it for opening. Use the function file_no_cache(fp) on the FILE pointer, fp. This somtimes makes a surprising difference in performance. When reading a library of structures or profiles, wurst may read almost 10000 files sequentially. The OS tries to cache each one, although they will not be read again. The damage is that it pushes useful pages such as other people's programs out of the cache. The function file_no_cache() is a wrapper around a posix function which may not be present, so the wrapper checks appropriate #defined values and is a no-op if the posix functions do not seem to be present. A typical usage would be, if ((fp = mfopen (fname, "r", this_sub)) == NULL) return NULL; { int tmp; const char *s = "Turning off caching for %s:\n\"%s\"\n"; if ((tmp = file_no_cache(fp)) != 0) err_printf (this_sub, s, fname, strerror (tmp)); } RETURN value is zero on success or errno on failure. Very often, we want to read a line from a file, hopping over blank lines and lines that begin with a hash (#). Do not write another function to do this. #include "misc.h" get_nline (FILE *fp, char *buf, int *nr_line, size_t maxbuf) Reads a line from fp. into buffer buf whose size is given by maxbuf. nr_line points to a line counter. get_nline() will increment the variable on every line read. The routine throws away anything on a line after the hash (#) character, so you can have inline comments. There are a couple of common conversions for amino acid names and types. We may go from one to three letter codes and, internally, from Thomas to standard one letter codes. All functions for this kind of thing live in amino_a.c. All memory allocation must be done through the macros E_MALLOC() and E_REALLOC() which live in e_malloc.c. They take the standard arguments and return the standard results, but, on failure, print out a line saying where the error occurred, how much memory was requested and then they die. This is generally good behaviour. Fancier code could attempt error recovery, but usually when malloc() fails, it means there was a code error. All two dimensional matrices should be allocated via the routines which have their roots in Thomas' code (which is basically the outline given in Numerical Recipes). Some days, I call my functions print_thing() and print_foo(). On others, I use foo_print() and thing_print(). Neither is better than the other. Here is the rule... Functions should be named thing_print(). Note, I am aware of the disadvantage that you cannot see all the things you can print or copy or whatever.
http://search.cpan.org/dist/Wurst/pod/coding.pod
CC-MAIN-2017-39
refinedweb
3,194
74.69
) Ravi Shankar(5) Saineshwar Bageri(4) Asma Khalid(3) Gul Md Ershad(2) Joao Sousa(2) Ankit Sharma(2) Prashant Kumar(2) Altaf Ansari(2) Mangesh Gaherwar(2) Ammar Shaukat(2) Neel Bhatt(2) Rathrola Prem Kumar (2) Mahesh Chand(2) N Vinodh(2) Venkateswaran S(2) Banketeshvar Narayan(2) Shweta Lodha(2) Mani Gautam(2) Gnanavel Sekar(2) Sabarish Natarajan(1) Sagar Pardeshi(1) Krishna Kumar(1) Puneet Kankar(1) Srikant Maruwada(1) Rafnas T P(1) Shiv Sharma(1) Krunal Trivedi(1) Rajeesh Menoth(1) Rupesh Kahane(1) Jignesh Trivedi(1) Somak Das(1) Dennis Thomas(1) Amit Singh(1) Joseph Thomas(1) Santosh Kumar Adidawarpu(1) Pankaj Kumar Choudhary(1) Manav Pandya(1) Vijayaragavan S(1) Nirav Daraniya(1) Vincent Maverick Durano(1) Namrata Parik(1) Sachin Kalia(1) Shashangka Shekhar(1) Arvind Singh Baghel(1) Surya Narayan Barik(1) Debasis Saha(1) Jagdeep Singh Jhass(1) Suthahar J(1) Mushtaq M A(1) Vinod L(1) Iqra Ali(1) Thomas Hansen(1) Catcher Wong(1) Jerry Schumann(1) Logesh Palani(1) Alagunila Meganathan(1) El Mahdi Archane(1) Thivagar Segar(1) Ajith Kumar(1) Jayanthi P(1) Chris Love(1) Nikunj Satasiya (1) Dhruvin Shah(1) Vidya Vrat Agarwal(1) Gowtham K. Railway Ticket Fare Calculation With Strategy Pattern Jan 15, 2018. This article explains how to calculate Railway ticket fare by using Strategy Design Pattern.. ASP.NET Core 2.0 - How To Use Dependency Injection Jan 15, 2018. In this article, I'll show you the new feature introduced in ASP .NET Core that allows you to inject dependencies directly into a View using the dependency injection container..”.. Drawing Pad or Signature Pad For Android Using Xamarin.Forms Jan 12, 2018. This article will explain how to create a drawing pad or signature pad for Android OS using Xamarin Forms.. Azure CLI With Demo Creating VM Using Azure CLI Jan 12, 2018. This articles shows a demo of creating virtual machine in Azure using Azure CLI with explanation of Azure CLI cmdlets.. Create Your First Bot Using Visual Studio 2017 - Step By Step Guide Jan 11, 2018. Seeing how fast the companies are adopting the Bots, it is really the best time for you to start learning Bot framework and start adopting Bots for your business. Configure Windows Authentication In ASP.NET Core Jan 11, 2018. Using Windows authentication, users are authenticated in ASP.NET Core application with help of operating system. Windows Authentication is a very useful in intranet application where users are in same domain. FormFlow In Microsoft Bot Framework - Part Two Jan 11, 2018. In this part, we will see some of the advanced stuff that we can use while using FormFlow in real time application while dealing with real business scenarios. Creating REST Service Using Flask And Python Jan 11, 2018. This article will explain to create REST service by using Flask framework and Python.. JavaScript - Date And Time Library Moment.JS Jan 11, 2018. This article is about using client side date & time format & manipulation JavaScript library Moment.JS How To Create An Angular Service And Access It In Multiple Components Jan 10, 2018. In our previous article, we developed a single page application using Angular 4. Now in this article, we are going to talk about services.. Draggable Panel In An Android Application Jan 10, 2018. This article demonstrates how to create a draggable panel in an Android application using Android Studio.. Basics Of Angular And Its Versions - Part One Jan 09, 2018. Angular is the next version of Google’s highly popular MV* framework for building complex web. Angular Material Design Components With Reactive Forms - Part One Jan 09, 2018. This is a demo for using Angular Material Design Components with Angular 5 that creates an attractive UI and enhances the app's performance. A Single Page Application Using Angular v4 Jan 08, 2018. In this article, we are going to create a single page application in Angular 4. Ignite UI Data Grid In SharePoint Online Using AJAX - Part One Jan 08, 2018. How to use UI Data Grid in SharePoint Online using AJAX.. Using HTTPS In ASP.NET Core 2.0 Jan 05, 2018. Create an empty project and update Startup to add services and middleware for MVC, including the filter for HTTPS. Create Angular 5 Application Using .Net Core 2.0 Template In Visual Studio 2017 Jan 04, 2018. Angular 5 has been announced recently and we already have a template added in the Visual Studio 2017 with .Net Core 2. Register A Chat Bot Using MS Bot Framework Jan 03, 2018. Recently, I created a chatbot. After an implementation of Bot using MS Bot framework, it should be registered with. User Specific Notifications Using ASP.NET MVC And SignalR Jan 03, 2018. In this post, we are going to explore how to implement user-based notification using ASP.Net MVC & SignalR.. Using jTable Grid With ASP.NET MVC Jan 03, 2018. In this article, we are going to learn how to use jTable Grid with ASP.NET MVC, and along with that we are going to use Entity framework for accessing the database.). ASP.NET Core 2.0 Bearer Authentication Jan 02, 2018. Bearer Tokens (or just Tokens) are commonly used to authenticate Web APIs because they are framework independent, unlike something like Cookie Authentication that is tightly coupled with ASP.NET Core framework.. Using Collection In Kotlin Jan 02, 2018. Collections are used to store groups of related Objects in memory. Like java, kotlin also supports collection frameworks... How To Connect A Box To Google Drive For Business Using Microsoft Flow Dec 30, 2017. This article helps you to learn how to connect a box to Google Drive using Microsoft Flow. Custom Authentication With ASP.NET MVC Dec 30, 2017. In this article, we will demonstrate how we can build authentication system using ASP.NET MVC How To Reset The Administrator Password Using The Command Prompt Dec 29, 2017. This blog will help you to reset the local Administrator password from your Windows machine without any third-party software or Windows password recovery tool. Using DataTables Grid With ASP.NET MVC Dec 29, 2017. In this article, we are going to learn how to use DataTables Grid with ASP.NET MVC in step by step way.. A Web Performance Audit Of C# Corner Dec 29, 2017. A recent article on C# Corner brought the attention to performance issues due to legacy hardware that was causing the site not to scale well to meet its growing demand.. Create Your First Virtual Machine (VM) Using Azure Portal Dec 28, 2017. In this article, we will talk about different free Azure subscriptions available for developers and end users. With this, we will also learn how we can create a virtual machine using Azure Portal.. How To Earn Money Using Google AdMob With Android Application Dec 28, 2017. One of the hottest discussion points in Android Technology is how to earn money using Android Applications.... Getting Started With Azure Service Bus Dec 26, 2017. From this article you will learn an overview of Azure service bus and ow to create an Azure service bus namespace using the Azure portal About How-to-use-Expression-Web-4 NA File APIs for .NET Aspose are the market leader of .NET APIs for file business formats – natively work with DOCX, XLSX, PPT, PDF, MSG, MPP, images formats and many more!
http://www.c-sharpcorner.com/tags/How-to-use-Expression-Web-4
CC-MAIN-2018-05
refinedweb
1,239
58.28
Home | Order Online | Downloads | Contact Us | Software Knowledgebase it | es | pt | fr | de | jp | kr | cn | ru | nl | gr Bitwise Shift Left The Bitwise Shift Left operator shifts the number left. The most significant bits are lost as the number moves left, and the vacated least significant bits are zero. The following shows the binary representation of 43. 0101011 (decimal 43) By shifting the bits to the left, we lose the most significant bit (in this case, a zero), and the number is padded with a zero at the least significant bit. The following is the resulting number. 1010110 (decimal 86) Bitwise Shift Right The Bitwise Shift Right operator shifts the number right. Zero is introduced to the vacated most significant bits, and the vacated least significant bits are lost. The following shows the binary representation of the number 43. By shifting the bits to the right, we lose the least significant bit (in this case, a one), and the number is padded with a zero at the most significant bit. The following is the resulting number. 0010101 (decimal 21) The following program uses the Bitwise Shift Right and Bitwise AND to display a number as a 16-bit binary number. The number is shifted right successively from 16 down to zero and Bitwise ANDed with 1 to see if the bit is set. An alternative method would be to use successive masks with the Bitwise OR operator. #include <stdio.h> int main() { int counter, num; printf("Enter a number: "); scanf("%d", &num); printf("%d is binary: ", num); for (counter=15; counter>=0; counter--) printf("%d", (num >> counter) & 1); putchar('\n'); return 0; } Functions for Binary – Decimal Conversions The two functions given next are for Binary to Decimal and Decimal to Binary conversion. The function given next to convert a decimal number to corresponding binary number supports up to 32 – Bit Binary number. You can use this or program given before for conversion as per your
https://www.datadoctor.biz/data_recovery_programming_book_chapter5-page56.html
CC-MAIN-2019-22
refinedweb
326
59.84
UPFRONT I have a very real need for programs to treat other programs as data because I do a lot of work in program-writing programs, or “metaprogramming”, for CAD applications. I've done this sort of programming in Python and in C++, but I'm increasingly finding the Lisp family of languages to be the power tool I have always wanted. Recently, I was very pleasantly surprised with the power and features of MIT Scheme Release 7.7.0, released in March 2002. Scheme is now more than 20 years old but is very robust, containing numerous concepts only now being seen in late-modern languages, such as C++ and Java. For instance, Scheme has continuations, where the state of a computation becomes in essence a controllable object. This powerful and general facility is useful for concurrency, modeling, multithreading and arbitrary control flows. MIT Scheme's library, SLIB, contains support for working with getopt, HTML, relational databases and other functionality similar to the Python or Perl libraries. There is a very powerful Scheme Object System OOP library, which has features similar to the Common Lisp Object System (CLOS). Scheme seems to have a close kinship with Common Lisp. However, MIT Scheme is not only GPLed, but feels more approachable, with a simpler syntax than Common Lisp. For my work, Scheme's scoping model and use of namespace are somewhat better than Common Lisp programs. To get started with MIT Scheme, see the project home page:. Scheme resources are available at. See also The Scheme Programming Language: ANSI Scheme, Second Edition, by R. Kent Dybvig, ISBN 0-13-454646-6. —Michael Baxter Q1 What company started in 1938 from a garage at 367 Addison Avenue, Palo Alto, California with a resistance capacity audio oscillator as its first product? Q2 It could have been: Calex, Elcal, Calecom, Elcom, Calcomp, Digicom, Tronicom, Comptek, Computek, Esscotek or Ectek. What name was finally chosen for this startup? Q3 Incorporated as Computing-Tabulating-Recording company in 1911, it formally changed its name in 1924. What is the company called today? Q4 The story goes that the campus of the University of California, Berkeley had a machine, called Ingres, connected to the ARPAnet and another machine, called Ernie Covax, that was home to the Berkeley UNIX Project, which was connected to a network known as BerkNet. These machines were interconnected, but there was no way of moving mail from one network to another. Eric Allman wrote a software program to transfer mail between these two networks and later went on to found a company. Which? Q5 Many talented programmers, unhappy with what was going on at Fairchild Semiconductors left to create their own startups. Intel and AMD are just two examples of semiconductor companies that arose out of Fairchild Semiconductors. What did the press dub these startups that arose from Fairchild? By the time you read this, Free Radio Linux (radioqualia.va.com.au/freeradiolinux) will be about a quarter of its way through a reading of the Linux kernel by a digitized voice. The voice is a creation of r a d i o q u a l i a (radioqualia.va.com.au), an “on-line radio station aiming to open an electronic portal into the eccentricities of antipodean radio space”. The site explains, r a d i o q u a l i a is engaged in the exploration of sound and media within the context of philosophical speculation. Informed by the discrete discourses surrounding science, art and philosophy, r a d i o q u a l i a is attempting to simulate the introspectible and seemingly monadic properties of sense-datum, through sound. Since Free Radio Linux's kernel (they don't say which version) contains 4,141,432 lines of code, the reading is expected to take 14,253.43 hours, or 593.89 days. Transmission began on February 3, 2002, the fourth anniversary of the Open Source Initiative. You can listen in through Ogg Vorbis.
http://www.linuxjournal.com/article/5991?page=0,1
CC-MAIN-2015-18
refinedweb
666
62.48
Essentials All Articles What is LAMP? Linux Commands ONLamp Subjects Linux Apache MySQL Perl PHP Python BSD ONLamp Topics App Development Database Programming Sys Admin These days, the functional languages are all the rage. You see more and more hackers from the traditionally vanilla languages trying out things like Haskell or Scheme or OCaml. Breaking away from an imperative tradition forces us to think in a different way, which is always a good thing. Recently, I've heard a lot about Erlang, especially from curious members of the Ruby community. This article is the result of my quick dive into the language, and will hopefully serve as a starting point for anyone else who's been hearing the buzz, but hasn't taken the plunge yet. For this article, I'm assuming you're familiar with the general ideas behind functional programming, and that you have at least a conceptual grasp of concurrency. I'm also counting on you having at least an intermediate level of experience programming in any language. However, I'm not assuming you know any Erlang, so don't worry if this is the first time you've ever heard of the language. There are a lot of functional languages out there. All of them have their strong points and their foibles. Some seem wholly academic, while others are as pragmatic as the best object oriented languages out there. Choosing which languages to study is really a matter of figuring out what concepts you want to learn. Erlang is known for an extremely elegant concurrency model. I've always been one to cringe at the mention of things like mutex locks, race conditions, and the entire motley crew of conceptual baggage that typically come along with any sort of parallel programming. Joe Armstrong claims in "Programming Erlang" that because Erlang is designed from the ground up for concurrency, it makes life a lot easier. This, along with the promise of a small, efficient, and well thought out language implementation was enough to get me interested. We'll start by going through the nuts and bolts of the language, and eventually ramp up to a simple concurrent program in Erlang that implements a basic chat system. Though it's far from fancy, it will show you how spinning off a few processes and getting them to communicate is almost trivial in Erlang. It seems like screen I/O is something that often comes in the middle of functional programming texts, and though that's not necessarily a bad thing, a lot of us are used to the instant gratification of a "Hello World" program. It's really nothing fancy, and if you run it as an Escript, it's quite simple: #!/usr/bin/env escript main(_) -> io:format("Hello World\n"). From the *nix shell: $ chmod +x hello $ ./hello Hello World $ What you're seeing there is a function definition for main(), which gets executed by our script. The io:format() is what does our screen output. main() io:format() Of course, none of this is exciting. Let's take a look at a more functional friendly primer, which is defining factorial: -module(example). -export([fact/1]). fact(0) -> 1; fact(N) -> N * fact(N-1). This code represents a trivial Erlang module, which gives functions a namespace to live in. From this example, you can see that Erlang allows for piece-wise function definition, which makes the syntax quite pleasing to the eye for most folks who have an interest in mathematics. To run this code, we'll make use of the Erlang shell, compiling the module and then running some basic tests: $ erl Erlang (BEAM) emulator version 5.5.5 [source] [64-bit] [async-threads:0] [hipe] [kernel-poll:false] Eshell V5.5.5 (abort with ^G) 1> c(example). {ok,example} 2> example:fact(0). 1 3> example:fact(5). 120 4> example:fact(10). 3628800 5> example:fact(25). 15511210043330985984000000 What we've done here is actually compile our module and then run some examples, live in the shell, against the compiled code. Being able to easily build your modules from within the Erlang shell is very nice, it makes you almost forget that you're working with a compiled language. When we call c(example), Erlang looks for a file called example.erl in the load path, which includes the current directory. When it finds it, it populates the object code in a file called example.beam. You can then use the code freely from the shell, and even can recompile when you make changes. c(example) In this example you can see we call example:fact(n) and get the proper results back. Seeing how the function is invoked, it's easier to explain what the export() line in our file means: example:fact(n) export() -export([fact/1]) Here we are telling the compiler that we want the function fact() with one argument to be callable from outside the module definition. Without this line, we would not be able to call the function from the shell, because it would be private to the module. fact() In Erlang, a function definition with a different number of arguments is actually an entirely separate function, which is why we need to specify the number of arguments when exporting. For example, this function shares nothing in common but the same name as our original fact definition: fact(A,B) -> io:format("Chuck Norris kicks ~p people in ~p places ~n",[A,B]). If we wanted to export this and use it in the shell, we can change our export code to look like this: -export([fact/1,fact/2]). You can see that both function definitions are now accessible: 1> c(example). {ok,example} 2> example:fact(4,5). Chuck Norris kicks 4 people in 5 places ok 3> example:fact(4). 24 Of course, we're starting to get ahead of ourselves. Let's now take a look at some of the common language elements and control structures in Erlang, so that we can begin to do something useful with them. Pages: 1, 2, 3, 4 Next Page Sponsored by: © 2015, O’Reilly Media, Inc. (707) 827-7019 (800) 889-8969 All trademarks and registered trademarks appearing on oreilly.com are the property of their respective owners.
http://www.onlamp.com/pub/a/onlamp/2007/09/13/introduction-to-erlang.html
CC-MAIN-2015-22
refinedweb
1,055
62.78
Label in C# In Windows Forms, Label control is used to display text on the form and it does not take part in user input or in mouse or keyboard events. The Label is a class and it is defined under System.Windows.Forms namespace. In windows form, you can create Label in two different ways: 1. Design-Time: It is the easiest method to create properties of the Label according to your need. Output: 2. Run-Time: It is a little bit trickier than the above method. In this method, you can set create your own Label control using the Label class. Steps to create a dynamic label: - Step 1: Create a label using the Label() constructor is provided by the Label class. // Creating label using Label class Label mylab = new Label(); - Step 2: After creating Label, set the properties of the Label provided by the Label class. // Set the text in Label mylab.Text = "GeeksforGeeks"; // Set the location of the Label mylab.Location = new Point(222, 90); // Set the AutoSize property of the Label control mylab.AutoSize = true; // Set the font of the content present in the Label Control mylab.Font = new Font("Calibri", 18); // Set the foreground color of the Label control mylab.ForeColor = Color.Green; // Set the padding in the Label control mylab.Padding = new Padding(6); - Step 3: And last add this Label control to form using Add() method. // Add this label to the form this.Controls.Add(mylab); Example: Output: Important Properties of the Label Control My Personal Notes arrow_drop_up
https://www.geeksforgeeks.org/label-in-c-sharp/?ref=lbp
CC-MAIN-2021-49
refinedweb
256
57.16
Phaser v3.19.0 Release NotesRelease Date: 2019-08-08 // 12 months ago 🔖 Version 3.19.0 - Naofumi - 8th August 2019 ⚡️ Tween Updates - All Tween classes and functions have 100% complete JSDocs :) - 👀 StaggerBuilderis a new function that allows you to define a staggered tween property. For example, as part of a tween config: delay: this.tweens.stagger(500)would stagger the delay by 500ms for every target of the tween. You can also provide a range: delay: this.tweens.stagger([500, 1000])which is spread across all targets. Finally, you can provide a Stagger Config object as the second argument. This allows you to define a stagger grid, direction, starting value and more. Please see the API Docs and new Examples for further details. Tweennow extends the Event Emitter class, allowing it to emit its own events and be listened to. Tween.ACTIVE_EVENTis a new event that is dispatched when a tween becomes active. Listen to it with tween.on('active'). Tween.COMPLETE_EVENTis a new event that is dispatched when a tween completes or is stopped. Listen to it with tween.on('complete'). Tween.LOOP_EVENTis a new event that is dispatched when a tween loops, after any loop delay expires. Listen to it with tween.on('loop'). Tween.REPEAT_EVENTis a new event that is dispatched when a tween property repeats, after any repeat delay expires. Listen to it with tween.on('repeat'). Tween.START_EVENTis a new event that is dispatched when a tween starts. Listen to it with tween.on('start'). - ⚡️ Tween.UPDATE_EVENTis a new event that is dispatched when a tween property updates. Listen to it with tween.on('update'). Tween.YOYO_EVENTis a new event that is dispatched when a tween property yoyos, after any hold delay expires. Listen to it with tween.on('yoyo'). Tween.onActiveis a new callback that is invoked the moment the Tween Manager brings the tween to life, even though it may not have yet started actively tweening anything due to delay settings. Tween.onStartis now only invoked when the Tween actually starts tweening a value. Previously, it was invoked as soon as the Tween Manager activated the Tween. This has been recoded and this action is now handled by the onActivecallback. Fix #3330 (thanks @wtravO) - 👀 Tween.seekhas been rewritten so you can now seek to any point in the Tween, regardless of repeats, loops, delays and hold settings. Seeking will not invoke any callbacks or events during the seek. Fix #4409 (thanks @cristib84) - You can now set fromand tovalues for a property, i.e. alpha: { from: 0, to: 1 }which would set the alpha of the target to 0 and then tween it to 1 after any delays have expired. Fix #4493 (thanks @BigZaphod) - You can now set startand tovalues for a property, i.e. alpha: { start: 0, to: 1 }which would set the alpha of the target to 0 immediately, as soon as the Tween becomes active, and then tween it to 1 over the duration of the tween. - You can now set start, fromand tovalues for a property, i.e. alpha: { start: 0, from: 0.5, to: 1 }which would set the alpha of the target to 0 immediately, as soon as the Tween becomes active, then after any delays it would set the alpha to 0.5 and then tween it to 1 over the duration of the Tween. Tween.hasStartedis a new property that holds a flag signifying if the Tween has started or not. A Tween that has started is one that is actively tweening a property and not just in a delayed state. - ⚡️ Tween.startDelayis a new property that is set during the Tween init to hold the shortest possible time before the Tween will start tweening a value. It is decreased each update until it hits zero, after which the onStartcallback is invoked. Tween.initand Tween.playhave been rewritten so they are not run multiple times when a Tween is paused before playback, or is part of a Timeline. This didn't cause any problems previously, but it was a redundant duplication of calls. Tween.onLoopwill now be invoked after the loopDelayhas expired, if any was set. Tween.onRepeatwill now be invoked after the repeatDelayhas expired, if any was set. easeParamswould be ignored for tweens that didn't use a string for the ease function name. Fix #3826 (thanks @SBCGames) - You can now specify easeParamsfor any custom easing function you wish to use. Fix #3826 (thanks @SBCGames) - All changes to Tween.stateare now set before any events or callbacks, allowing you to modify the state of the Tween in those handlers (thanks @Cudabear) Tween.dispatchTweenEventis a new internal method that handles dispatching the new Tween Events and callbacks. This consolidates a lot of duplicate code into a single method. Tween.dispatchTweenDataEventis a new internal method that handles dispatching the new TweenData Events and callbacks. This consolidates a lot of duplicate code into a single method. - 👀 Tween.isSeekingis a new internal boolean flag that is used to keep track of the seek progress of a Tween. Timeline.onLoopwill now be invoked after the loopDelayhas expired, if any was set. Timeline.onCompletewill now be invoked after the completeDelayhas expired, if any was set. - All changes to Timeline.stateare now set before any events or callbacks, allowing you to modify the state of the Timeline in those handlers. - The TIMELINE_LOOP_EVENThas had the loopCounterargument removed from it. It didn't actually send the number of times the Timeline had looped (it actually sent the total remaining). - When a TweenData completes it will now set the currentproperty to be exactly either startor enddepending on playback direction. - When a TweenData completes it will set the exact startor endvalue into the target property. - ⚡️ TweenDatahas a new function signature, with the new indexand getActivearguments added to it. TweenBuilderhas been updated to set these, but if you create any TweenData objects directly, use the new signature. TweenData.getActiveValueis a new property that, if not null, returns a value to immediately sets the property value to on activation. GetEaseFunction, and by extension anything that uses it, such as setting the ease for a Tween, will now accept a variety of input strings as valid. You can now use lower-case, such as back, and omit the 'ease' part of the direction, such as back.inor back.inout. - The signature of getStartand getEndcustom property functions has changed to (target, key, value, targetIndex, totalTargets, tween), previously it was just (target, key, value). Custom functions don't need to change as the new arguments are in addition to those sent previously. - The signature of the LoadValue generator functions (such as delayand repeat) has changed to (target, key, value, targetIndex, totalTargets, tween)to match those of the custom property functions. If you used a custom generator function for your Tween configs you'll need to modify the signature to the new one. - Tweens created via TweenManager.createwouldn't start when Tween.playwas called without first making them active manually. They now start automatically. Fix #4632 (thanks @mikewesthad) ⚡️ Spine Updates ⚡️ The Spine Plugin is now 100% complete. It has been updated to use the Spine 3.7 Runtimes. Improvements have been made across the entire plugin, including proper batched rendering support in WebGL, cleaner skin and slot functions and lots and lots of updates. It's fully documented and there are lots of examples to be found. The following legacy bugs have also been fixed: - ➕ Adding Spine to physics causes position to become NaN. Fix #4501 (thanks @hizzd) - Destroying a Phaser Game instance and then re-creating it would cause an error trying to re-create Spine Game Objects ("Cannot read property get of null"). Fix #4532 (thanks @Alex-Badea) - Rendering a Spine object when a Camera has renderToTextureenabled on it would cause the object to be vertically flipped. It now renders correctly in both cases. Fix #4647 (thanks @probt) 🆕 New Features Shader.setRenderToTextureis a new method that will redirect the Shader to render to its own framebuffer / WebGLTexture. Shader.setSampler2DBufferis a new method that allows you to pass a WebGLTexture directly into a Shader as a sampler2D uniform, such as when linking shaders together as buffers for each other. Shader.renderToTextureis a new property flag that is set if you set the Shader to render to a texture. Shader.framebufferis a new property that contains a WebGLFramebuffer reference which is set if you set the Shader to render to a texture. Shader.glTextureis a new property that contains a WebGLTexture reference which is set if you set the Shader to render to a texture. Shader.textureis a new property that contains a Phaser Texture reference which is set if you set the Shader to save to the Texture Manager. TextureManager.addGLTextureis a new method that allows you to add a WebGLTexture directly into the Texture Manager, saved under the given key. TextureSource.isGLTextureis a new boolean property that reflects if the data backing the underlying Texture Source is a WebGLTexture or not. TextureTintPipeline.batchSpritewill now flip the UV if the TextureSource comes from a GLTexture. Math.ToXYis a new mini function that will take a given index and return a Vector2 containing the x and y coordinates of that index within a grid. RenderTexture.glTextureis a new property that holds a reference to the WebGL Texture being used by the Render Texture. Useful for passing to a shader as a sampler2D. GroupCreateConfig.quantity- when creating a Group using a config object you can now use the optional property quantityto set the number of objects to be created. Use this for quickly creating groups of single frame objects that don't need the advanced capabilities of frameQuantityand repeat. - 🔒 Pointer.lockedis a new read-only property that indicates if the pointer has been Pointer Locked, or not, via the Pointer Lock API. WebGLRenderer.snapshotFramebuffer, and the corresponding utility function WebGLSnapshot, allows you to take a snapshot of a given WebGL framebuffer, such as the one used by a Render Texture or Shader, and either get a single pixel from it as a Color value, or get an area of it as an Image object, which can then optionally be saved to the Texture Manager for use by Game Object textures. CanvasRenderer.snapshotCanvasallows you to take a snapshot of a given Canvas object, such as the one used by a Render Texture, and either get a single pixel from it as a Color value, or get an area of it as an Image object, which can then optionally be saved to the Texture Manager for use by Game Object textures. RenderTexture.snapshotis a new method that will take a snapshot of the whole current state of the Render Texture and return it as an Image object, which could then be saved to the Texture Manager if needed. RenderTexture.snapshotAreais a new method that will take a snapshot of an area of a Render Texture and return it as an Image object, which could then be saved to the Texture Manager if needed. RenderTexture.snapshotPixelis a new method that will take extract a single pixel color value from a Render Texture and return it as a Color object. - The SnapshotStateobject has three new properties: isFramebufferboolean and bufferWidthand bufferHeightintegers. Game.CONTEXT_LOST_EVENTis a new event that is dispatched by the Game instance when the WebGL Renderer webgl context is lost. Use this instead of the old 'lostContextCallbacks' for cleaner context handling. - ⏪ Game.CONTEXT_RESTORED_EVENTis a new event that is dispatched by the Game instance when the WebGL Renderer webgl context is restored. Use this instead of the old 'restoredContextCallbacks' for cleaner context handling. WebGLRenderer.currentTypecontains the type of the Game Object currently being rendered. WebGLRenderer.newTypeis a boolean that indicates if the current Game Object has a new type, i.e. different to the previous one in the display list. WebGLRenderer.nextTypeMatchis a boolean that indicates if the next Game Object in the display list has the same type as the one being currently rendered. This allows you to build batching into separated Game Objects. - 🚚 PluginManager.removeGameObjectis a new method that allows you to de-register custom Game Object types from the global Game Object Factory and/or Creator. Useful for when custom plugins are destroyed and need to clean-up after themselves. GEOM_CONSTis a new constants object that contains the different types of Geometry Objects, such as RECTANGLEand CIRCLE. Circle.typeis a new property containing the shapes geometry type, which can be used for quick type comparisons. Ellipse.typeis a new property containing the shapes geometry type, which can be used for quick type comparisons. Line.typeis a new property containing the shapes geometry type, which can be used for quick type comparisons. Point.typeis a new property containing the shapes geometry type, which can be used for quick type comparisons. Polygon.typeis a new property containing the shapes geometry type, which can be used for quick type comparisons. Rectangle.typeis a new property containing the shapes geometry type, which can be used for quick type comparisons. Triangle.typeis a new property containing the shapes geometry type, which can be used for quick type comparisons. - 🔌 InputPlugin.enableDebugis a new method that will create a debug shape for the given Game Objects hit area. This allows you to quickly check the size and placement of an input hit area. You can customzie the shape outline color. The debug shape will automatically track the Game Object to which it is bound. - 🚚 InputPlugion.removeDebugwill remove a Debug Input Shape from the given Game Object and destroy it. - ⚡️ Pointer.updateWorldPointis a new method that takes a Camera and then updates the Pointers worldXand worldYvalues based on the cameras transform (thanks @Nick-lab) ScaleManager._resetZoomis a new internal flag that is set when the game zoom factor changes. - 🚚 Texture.removeis a new method that allows you to remove a Frame from a Texture based on its name. Fix #4460 (thanks @BigZaphod) ⚡️ Updates - 0️⃣ When calling setHitAreaand not providing a shape (i.e. a texture based hit area), it will now set customHitAreato falseby default (thanks @rexrainbow) - The Shader will no longer set uniforms if the values are null, saving on GL ops. - ⚠ The Animation Manager will now emit a console warning if you try and play an animation on a Sprite that doesn't exist. - The Animation component will no longer start an animation on a Sprite if the animation doesn't exist. Previously it would throw an error saying "Unable to read the property getFirstTick of null". - 🔒 InputManager.onPointerLockChangeis a new method that handles pointer lock change events and dispatches the lock event. CanvasTexturehas been added to the Texturesnamespace so it can be created without needing to import it. The correct way to create a CanvasTextureis via the Texture Manager, but you can now do it directly if required. Fix #4651 (thanks @Jugacu) - The SmoothedKeyControlminimum zoom a Camera can go to is now 0.001. Previously it was 0.1. This is to make it match the minimum zoom a Base Camera can go to. Fix #4649 (thanks @giviz) - 🚚 WebGLRenderer.lostContextCallbacksand the onContextLostmethod have been removed. Please use the new CONTEXT_LOSTevent instead. - ⏪ WebGLRenderer.restoredContextCallbacksand the onContextRestoredmethod have been removed. Please use the new CONTEXT_RESTOREDevent instead. - ⚠ TextureManager.getBase64will now emit a console warning if you try to get a base64 from a non-image based texture, such as a WebGL Texture. - 🚚 The WebAudioSoundManagerwill now remove the document touch handlers even if the Promise fails, preventing it from throwing a rejection handler error. - 🚚 GameObjectFactory.removeis a new static function that will remove a custom Game Object factory type. - 🚚 GameObjectCreator.removeis a new static function that will remove a custom Game Object creator type. - 0️⃣ CanvasTexture.getPixelsnow defaults to 0x0 by width x height as the default area, allowing you to call the method with no arguments to get all the pixels for the canvas. - 💅 CreateDOMContainerwill now use div.style.cssTextto set the inline styles of the container, so it now works on IE11. Fix #4674 (thanks @DanLiamco) TransformMatrix.rotationnow returns the properly normalized rotation value. - 📜 PhysicsEditorParserhas now been exposed under the Phaser.Physics.Matternamespace, so you can call methods on it directly. - ⚡️ Calling CanvasTexture.updatewill now automatically call refreshif running under WebGL. This happens for both drawand drawFrame, meaning you no longer need to remember to call refreshafter drawing to a Canvas Texture in WebGL, keeping it consistent with the Canvas renderer. Frame.destroywill now null the Frames reference to its parent texture, glTexture and clear the data and customData objects. - The Container renderer functions will now read the childs alphaproperty, instead of _alpha, allowing it to work with more variety of custom children. 🐛 Bug Fixes - 🚚 The Scale Manager would throw the error 'TypeError: this.removeFullscreenTarget is not a function' when entering full-screen mode. It would still enter fullscreen, but the error would appear in the console. Fix #4605 (thanks @darklightcode) Tilemap.renderDebugwas calling out-dated Graphics API methods, which would cause the debug to fail (thanks @Fabadiculous) - The Matter.Factory.constraint, jointand worldConstraintmethods wouldn't allow a zero length constraint to be created due to a falsey check of the length argument. You can now set length to be any value, including zero, or leave it undefined to have it automatically calculated (thanks @olilanz) Pointer.getDurationwould return a negative / static value on desktop, or NaN on mobile, because the base time wasn't being pulled in from the Input Manager properly. Fix #4612 (thanks @BobtheUltimateProgrammer) - 🚚 Pointer.downTime, Pointer.upTimeand Pointer.moveTimewould be set to NaN on mobile browsers where Touch.timeStamp didn't exist. Fix #4612 (thanks @BobtheUltimateProgrammer) - 0️⃣ WebGLRenderer.setScissorwill default the drawingBufferHeightif no argument is provided, stopping NaN scissor heights. - If you called Scene.destroywithin a Game Object pointerdownor pointeruphandler, it would cause the error "Cannot read property 'game' of null" if the event wasn't cancelled in your handler. It now checks if the manager is still there before accessing its property. Fix #4436 (thanks @jcyuan) - The Arc / CircleGame Object wasn't rendering centered correctly in WebGL due to an issue in a previous size related commit, it would be half a radius off. Fix #4620 (thanks @CipSoft-Components @rexrainbow) - Destroying a Scene in HEADLESS mode would throw an error as it tried to access the gl renderer in the Camera class. Fix #4467 (thanks @AndreaBoeAbrahamsen @samme) Tilemap.createFromObjectswould ignore the sceneargument passed in to the method. It's now used (thanks @samme) - 🛠 Fixed a bug in the WebGL and Canvas Renderers where a Sprite with a flipXor flipYvalue set would render the offset frames slightly out of place, causing the animation to appear jittery. Also, the sprite would be out of place by its origin. Fix #4636 #3813 (thanks @jronn @B3L7) - Animations with custom pivots, like those created in Texture Packer with the pivot option enabled, would be mis-aligned if flipped. They now render in the correct position, regardless of scale or flip on either axis. Fix #4155 (thanks @Zax37) - Removing a frame from a 2 frame animation would cause an error when a Sprite using that animation next tried to render. Fix #4621 (thanks @orlicgms) - Calling Animation.setRepeat()wouldn't reset the repeatCounterproperly, causing Sprite bound animation instances to fail to change their repeat rate. Fix #4553 (thanks @SavedByZero) - ⚡️ The UpdateList.removemethod wouldn't flag the Game Object for removal properly if it was active. It now checks that the Game Object is in the current update list and hasn't already been inserted into the 'pending removal' list before flagging it. Fix #4544 (thanks @jcyuan) DynamicTilemapLayer.destroywill now no longer run its destroy sequence again if it has already been run once. Fix #4634 (thanks @CipSoft-Components) StaticTilemapLayer.destroywill now no longer run its destroy sequence again if it has already been run once. - 👯 Shader.uniformsnow uses Extend instead of Clone to perform a deep object copy, instead of a shallow one, avoiding multiple instances of the same shader sharing uniforms. Fix #4641 (thanks @davidmball) - Calling input.mouse.requestPointerLock()will no longer throw an error about being unable to push to the Input Manager events queue. - The POINTERLOCK_CHANGEevent is now dispatched by the Input Manager again. - 🚚 The Pointer.movementXand Pointer.movementYproperties are now taken directly from the DOM pointer event values, if the pointer is locked, and no longer incremental. Fix #4611 (thanks @davidmball) - ⚡️ The Pointer.velocityand Pointer.midPointvalues are now updated every frame. Based on the motionFactorsetting they are smoothed towards zero, for velocity, and the pointer position for the mid point. This now happens regardless if the Pointer moves or not, which is how it was originally intended to behave. - 🚚 The DESTROYevent hook wasn't removed from Group children when destroying the Group and destroyChildrenwas set to false. Now, the hook is removed regardless (thanks @rexrainbow) - ⏪ The WebGL Lost and Restored Context callbacks were never removed, which could cause them to hold onto stale references. Fix #3610 (thanks @Twilrom) - ⚡️ Origin.updateDisplayOriginno longer applies a Math.floor to the display origins, allowing you to have a 0.x origin for a Game Object that only has a width or height of 1. This fixes issues with things like 1x1 rectangles displaying incorrectly during rendering. Fix #4126 (thanks @rexrainbow) InputManager.resetCursorwill now check if the canvas element still exists before resetting the cursor on it. Fix #4662 (thanks @fromnowhereuser) - It was not possible to set the zoom value of the Scale Manager back to 1 again, having changed it to a different value. Fix #4633 (thanks @lgibson02 @BinaryMoon) 📚 Examples, Documentation and TypeScript 📄 My thanks to the following for helping with the Phaser 3 Examples, Docs and TypeScript definitions, either by reporting errors, fixing them or helping author the docs: @vacarsu @KennethGomez @samme @ldd @Jazcash @jcyuan @LearningCode2023 @PhaserEditor2D
https://js.libhunt.com/phaser-changelog/3.19.0
CC-MAIN-2020-34
refinedweb
3,604
55.64
03 May 2013 18:25 [Source: ICIS news] By Jeremy Pafford HOUSTON (ICIS)--Velocys hopes its new gas-to-liquids (GTL) plant in ?xml:namespace> This week, the US-based company, a subsidiary of UK-based Oxford Catalysts Group, opened its The demonstration plant features the company’s Fischer-Tropsch (FT) and Steam Methane Reforming (SMR) technologies. Velocys’ GTL process takes natural gas and uses the SMR to convert it into a synthesis gas of hydrogen and carbon monoxide. Through the FT process, the mixture of gases is converted into oils and waxes, which can then be further processed into products such as ultra-clean diesel, jet fuel, naphtha and bases for synthetic lubricants. The demonstration plant has a production capacity of just 1 bbl/day of ultra-clean diesel, spokesperson Michelle Moore said. But the Velocys process can be scaled up to produce 1,000-15,000 bbl/day for companies who implement it at their facilities, said Tad Dritz, business development director for the company. Velocys is marketing its product toward two areas – gas producers who would like to tie their assets to both the gas and liquids markets, and producers interested in the end products produced by the GTL process, Dritz said. The company’s GTL process makes potent “super fuels” that are more powerful and cleaner than the same fuels produced from petroleum, he said. For example, diesel refined from petroleum has a 40-45 cetane rating, while ultra-clean diesel produced through Velocys’ GTL process has a 75 cetane rating, Dritz said. Some producers blend some ultra-clean diesel into refined diesel to lower emissions and boost cetane ratings, he said. Dritz views his company’s GTL process as a small-scale way for companies to profit on associated gas or problem gas that would normally be flared or re-injected into wells. The World Bank has said that an estimated 134bn cubic metres of gas was flared worldwide in 2010. If all that was instead converted into liquid fuels, it would yield 500m bbl, Velocys officials said. And that does not take into account the trillions of cubic feet of gas that is re-injected into the ground in order to avoid flaring. Velocys’ GTL method makes capturing that gas and processing it economically viable for small- and mid-sized companies, who before would not consider it due to the costs, Dritz said. Such companies are considering the technology, Dritz said, and now Velocys has a plant to show it off. “It’s had huge interest,” he said. “We get 5-10 calls
http://www.icis.com/Articles/2013/05/03/9665248/us-velocys-sees-small-scale-gtl-process-yielding-big.html
CC-MAIN-2014-41
refinedweb
429
57.3
Hide Forgot I went through the related code, found those warnings("Bind credentials not available yet") is from here:. Seems "Extract Credentials" failed. Just for reference. You're failing here: TASK [rhscl-postgresql-apb-openshift : Wait for postgres to come up] *********** fatal: [localhost]: FAILED! => {"changed": false, "elapsed": 300, "failed": true, "msg": "Timeout when waiting for 172.30.145.236:5432"} to retry, use: --limit @/opt/apb/actions/provision.retry It does look like the pod is running: NAME READY STATUS RESTARTS AGE po/postgresql-1-d4jpp 1/1 Running 0 12m The ansible wait_for task us trying to poll the port. Is it possible it is unavailable due to firewall policy or misconfiguration of the openshift networking? Looking at I see it states: "The ovs-multitenant plug-in provides OpenShift Enterprise Enterprise clusters, the default project has VNID 0. This facilitates certain services like the load balancer, etc. to communicate with all other pods in the cluster and vice versa." So this makes sense to me that we're failing in a multitenant environment. We have an APB pod in one project that is attempting to communicate with a pod in another project. By the nature of this plugin that is disallowed. If we need APB's to communicate with pods they're working to provision, update, or deprovision, we may need to have them launch within the same namespace or ensure that if they're launching in a multitenant environment APB projects are receving VNID 0 so they can talk to pods they launch. This may be a security concern, however. Looking at the APB code the only thing happening after the wait is encoding binding credentials. After talking with cchase it sounds like there is no need to wait, so as an immediate fix we can probably just remove the check/wait. It honestly do not know why the wait there and it is quite possibly an artifact from one of the demos that was seeding data as part of the database provision. postgresql-apb 3.7.7-2 or better should fix this with package version postgresql-apb-role-1.0.14-1.el7 When you have the opportunity please also verify that mediawiki, mariadb, and mysql provision properly. Nothing is standing out to me that should prevent this from working, but I'd like to be certain. The fix works fine. # docker images REPOSITORY TAG IMAGE ID CREATED SIZE docker.io/ansibleplaybookbundle/rhscl-postgresql-apb canary fd1bdf95874d 10 hours ago 1.225 GB please help push them to stage, when verified with images on stage registry, I will move status to verified. Thanks. Fixed. Veirified with latest v3.7 image on redhat/openshift-ovs-multitenant. openshift3/postgresql-apb:v3.7.7-2 mediawiki, mariaDB, mysqlDB also works.
https://partner-bugzilla.redhat.com/show_bug.cgi?id=1512430
CC-MAIN-2020-10
refinedweb
461
57.16
Timeout issue Timeout issue I'm having a strange problem that seems to be an aborted conection by a timeout. I'm using LiveGrid on a grid with 400+ entries. When I'm scrolling down these entries and a request is made for more data, sometimes an error occurs and the grid resets (goes back to the beginning). The timeout is set to 30 seconds, but the reset occurs in less time. This is not a server issue as I can see the correct response on Fiddler (HTTP Debugger). This means that the response arrives in time. Debugging ext-base.js I can tell the following: --> On a normal request: - handleReadyState function is called - POST is made - handleTransactionResponse function is called - releaseObject function is called - handleReadyState function is called - POST is made - abort function is called from window.setTimeout - handleTransactionResponse function is called - releaseObject function is called I came up with my own solution and it seems to work under ext 2.2. It's a modification from MemoryProxy. HTML Code: MyMemoryProxy = function(data, root, sortingFunctions){ MyMemoryProxy.superclass.constructor.call(this); this.data = data; this.root = root; this.sortingFunctions = sortingFunctions; this.sortedData = {}; }; Ext.extend(MyMemoryProxy, Ext.data.DataProxy, { load : function(params, reader, callback, scope, arg){ params = params || {}; // possible params: start, limit, sort, dir var tmpData = { version: 1, total: 0 }; tmpData[this.root] = []; var srcArr = this.data[this.root], destArr = tmpData[this.root], n, i; tmpData.total = srcArr.length; var field = params.sort; if ( !this.sortedData[field] ) { var arr = []; for ( i=0; i<srcArr.length; i++ ) arr.push( srcArr[i] ); if ( this.sortingFunctions && this.sortingFunctions[field] ) { arr.sort( this.sortingFunctions[field] ); } else { arr.sort( function(a,b) { if ( a[field]<b[field] ) return -1; else if ( a[field]>b[field] ) return 1; else return 0; }); } this.sortedData[field] = arr; } srcArr = this.sortedData[field]; if ( params.dir == "ASC" ) { n = Math.min( params.start+params.limit, tmpData.total ); for ( i=params.start; i<n; i++ ) { destArr.push( srcArr[i] ); } } else { // DESC var start = tmpData.total-1-params.start; n = Math.max( start-params.limit, -1 ); for ( i=start; i>n; i-- ) { destArr.push( srcArr[i] ); } } var result; try { result = reader.readRecords(tmpData); }catch(e){ this.fireEvent("loadexception", this, arg, null, e); callback.call(scope, null, arg, false); return; } callback.call(scope, result, arg, true); }, update : function(params, records){ } }); HTML Code: var bufferedDataStore = new Ext.ux.grid.BufferedStore({ autoLoad : false, bufferSize : 300, proxy : new MyMemoryProxy( your_data, your_root, your_sortingFunctions ), url : 'dummy.php', reader : bufferedReader, sortInfo : {field: 'id', direction: 'ASC'} }); Feedback is welcomed. Thanks a lot. changhua, Thanks for the help. If you could explain what is the root cause of the timer expiration and how your solution resolves it, we appreciate. Regards, Evandro. Element.update function Element.update function I have noticed that, when i load data into BufferedStore Element.update function is been called 3 times, with the same html string. Did anybody else noticed this problem? Any ideas? Thank you. V0.3a1 available V0.3a1 available I'm proud to announce the release of Ext.ux.Livegrid 0.3a1 A lot of work has been put into this release. Major code refactoring with lots of improvements along with the support for Ext2.2. The UI matches now the usual Ext.grid-components. As of V0.3a1, Ext.ux.Livegrid is now released under the terms of the GPL V3. Furthermore, there is a backward compatibility break: The namespace has been changed to Ext.ux.grid.livegrid. Please update your code accordingly. Changelog is available on the first page, as usual. Happy coding! Thorsten Hi Mindpatterns, First of all I have to say great extension! Have you (or anybody else for that matter) ever tried to combine the live grid with MaximGB's tree grid? I know that in my company one of the biggest issues to solve in any web project was the presentation of large amounts of data in a tree. I think that if the mechanisms from the live grid are applied to the tree grid (or vice versa), this would solve this issue once and for all. I will take a look at this myself in the next days, but perhaps there is already some experience with this out there. Hi Thorsten, Actually, we first used Ext.tree.TreePanel (Actually Ext.tree.ColumnTree), because we need a tree with additional columns displayed. However, we then switched to the TreeGrid because the column tree does not have all the nice features a grid has (out of the box sorting, hiding columns, drag and drop of columns, and so on). The TreeGrid also has lazy loading support which we already use and which works well, the problem is that trees that load the content of a folder in the tree on demand still have a performance problem when there is a lot of entries in one folder (which is the case quite often). just a quick one, I am moving my current implementation of this component from Ext 2.1 as we are having a minor issue where the bottom most records are truncated, I am assuming this is to do with the viewport height bug as according to firebug the proxy is returning all the relevant records, however the last 10 or so are not being scrolled to. This is my declaration code below, it generates 'n' grids in a tab panel Code: var bufferedDataStore_billingExport_<?= $BillingTableRow[0]?> = new Ext.ux.grid.livegrid.Store({ autoLoad : true, bufferSize : 600, reader : bufferedReader, sortInfo : {field: 'date_field', direction: 'ASC'}, url : 'proxies/billingproxy.php?table=<?= $BillingTableRow[0]?>' }); var bufferedView_billingExport_<?= $BillingTableRow[0]?>= new Ext.ux.grid.livegrid.GridView({ nearLimit : 200, id: 'BufferedViewBillingExport', loadMask : { msg : 'Please wait...' }}); var bufferedGridToolbar_billingExport_<?= $BillingTableRow[0]?> = new Ext.ux.grid.livegrid.Toolbar({ view : bufferedView_billingExport_<?= $BillingTableRow[0]?>, displayInfo : true }); var searchBox_<?= $BillingTableRow[0]?>_txt = new Ext.form.TextField({ id: 'searchBox_<?= $BillingTableRow[0]?>', enableKeyEvents: true }); var grid_billingExport_<?= $BillingTableRow[0]?> = new Ext.grid.GridPanel({ ds : bufferedDataStore_billingExport_<?= $BillingTableRow[0]?>, enableDragDrop : false, cm : colModel, listeners: {activate: handleActivate_<?= $BillingTableRow[0]?>}, //autoExpandColumn: 2, sm : bufferedSelectionModel, id : 'dataGridPanel_<?= $BillingTableRow[0]?>', loadMask : { msg : 'Loading...' }, view : bufferedView_billingExport_<?= $BillingTableRow[0]?>, title : '<?= $DisplayTitle?>', bbar : bufferedGridToolbar_billingExport_<?= $BillingTableRow[0]?>, tbar : [ {text: 'Quicksearch:' }, searchBox_<?= $BillingTableRow[0]?>_txt ,{ xtype:'button', text:'X', handler: function(){ if (searchBox_<?= $BillingTableRow[0]?>_txt.getValue().length!=0) { searchBox_<?= $BillingTableRow[0]?>_txt.setValue(''); bufferedDataStore_billingExport_<?= $BillingTableRow[0]?>.load(); } } }] }); .... "grid is undefined Toolbar.js (line 112) var st = grid.getStore();" Do we have to change the way that our toolbars are generated in the new component now? Will be fixed in the next release, however.
http://www.sencha.com/forum/showthread.php?17791-Ext.ux.LiveGrid&p=234709&viewfull=1
CC-MAIN-2014-10
refinedweb
1,077
52.15
552 French revolution France sets \ upa show- down with SItaly in the World Cup finals. PAGE 1IB Prosecutors target Couey's past Defense team files several motions, asks for itens to be excluded from trial C. hron,.As Mie Assistant State Attorney Ric Ridgway says he wants to intro- duce John Couey's past record into evidence during his upcom- ing trial. DAVE PIEKLIK dpieklik@chronicleonline.com Chronicle At today's pretrial confer- ence for John Couey, prosecu- tors will seek to introduce evi- dence of a pattern of criminal behavior leading up to the mur- der of Jessica Lunsford. whom he's accused of killing last year Using a state statute referred to as the Williams Rule, prose- cutors hope to use a Jan. 7, 1978, arrest of Couey, 47. in their capital murder case against him. The statute allows prosecutors to ask a judge to allow evidence they believe establishes a pattern of similar behavior. Couey 19 at the time of the 1978 incident was arrested after breaking into a Crystal River couple's home and plac- ing his hand over their young daughter's mouth, before kiss- ing her He was convicted ofthe crime and for violating proba- tion for a string of previous burglaries, and ordered to 10 years in prison. As part of numerous motions filed last week at the Citrus County Courthouse in Inverness, Assistant State Attorney Ric Ridgway explained why he wanted to introduce the evidence. He said Couey cut a hole in a bed- room window screen and com- mitted battery on the girl by "wrapping a sheet around her so she could not imo e her arms and placing his hand over her mouth and telling her not to scream " Assistant Public Defender Dan Lewan filed a response to the motion, asking that jurors not be allowed to hear that evi- dence. In previously released court documents, investigators found a 5-inch by 5-inch L-shape cut in a screen door leading into the home Jessica Lunsford shared with her grandparents and father. Couey is accused of breaking into the home and taking the girl through a bed- room window of his mobile home across the street. The body of the 9-year-old Homosassa girl was found March 19. 2005, behind his home. Couey said he raped her and buried her alive because he was afraid of getting caught, according to court documents. He has pleaded not guilty to charges of premeditated mur- der, kidnapping, burglary and Please see CO(.,'Y/Page 4A Snorkel school at the springs I -- CATHY KAPULKA/Chronicle Children from the West Side unit of the Boys & Girls Club in Homosassa snorkel Wednesday afternoon Into Three Sisters Springs off a canal In Kings Bay in Crystal River. Eighteen children, who are part of the club's summer camp program, participated In the snorkeling trip that was donated by Bird's Underwater Dive Center. "This is something that the kids get to enjoy," Heldi Bressler, unit director, said. "We really appreciate It and are very grateful for the Bird's generosity." River Alliance challenges proposed resort expansion MEETING TODAY * The Planning and Develop- ment Review Board meets at 9 a.m. today. Nature's Resort is one of the first items on the agenda. County to recommend project be disapproved TERRY WITT terrywitt@chronicleonline.com Chronicle An environmental group known for its fierce protection of Citrus County's coastal ecology has hired an attorney to challenge the expansion plans of an RV campground in Hornosassa. The Save the Homosassa River Alliance and its attorney, Denise Lyn, will speak today against a plan by Nature's Resort to add 185 RV sites and 106 tent sites to its property on the Halls River. The expansion plan will be heard at a Planning and Development Review Board hearing. If the planning board were to recommend approval, the proposed changes to Nature Resort's master plan would go to the county commission at a later date for a final deci- sion. County staff has recommended denial of the expansion, saying it would adversely affect the public's interest and would gen- erally be incompatible with the adjoining wetlands and the Halls River. The Alliance is in agreement. "We're very concerned about the density, the wetlands, and we know the water table is very high in that area," said Alliance President Priscilla Watkins. Environmental Planner Sue Farnsworth said the changes would bring the total num- ber of camping units at Nature's Resort to 601 and would increase the density of the development to 10 units per acre. Please see "'.-..lFR;/Page 4A chautie fortesb "Copyrighted Material Syndicated Content Available from Commercial News Providers" 4 m Ii ' M*: I~@NM- ::: . ..... . ... .:v U: :Ki. ":: h::: .* ,. .. Yankeetown political fallout continues Mayor writes Gov. Bush for help TERRY WiTT terrywitt@chronicleonline.com Chronicle Yankeetown Councilwoman Mary Pate resigned Monday amid political turmoil that has left the town without a govern- ment. The loss of Pate, an eight- Syear veteran of the council, means the board lacks the required number of members to make decisions. Pate said residents had asked her in May to remain on the council when she was thinking of resigning, but after giving it more thought, she decided it was best to leave. "I can no longer be part of a governing body that continues to use unethical conduct and political backstabbing as its goals," Pate wrote in her resig- nation. Pate also said should she could no longer work with a mayor "who has difficulties with the council on setting meeting dates, dispersing information and respecting the town council and the people of the town." The letter of resignation took issue with Mayor Joanne Johannesson's June 26 letter to the governor claiming the town no longer could do business because there weren't enough town officials to sign checks. Pate said both she and the mayor had been empowered to sign checks, and she felt the letter misrepresented that fact. However; Johannesson main- tains Pate did not have author- ity to sign checks. Pate said her husband's can- cer factored into the decision to resign. She wants to spend more time with him But the ugly politics was the primary reason. The town has been embroiled in a political fight since a developer announced plans to build a vacation resort on the Withlacoochee River behind Town Hall. Please see PULITICAL/Page 4A BRIAN LaPETERChromnicle A citizen expresses concern Wednesday with a sign near the Yankeetown library. Six town officials, Including three commis- sioners, have resigned this year. X Annie's Mailbox . IW Movies . . . . 0 Comics ...... . z Crossword ...... Editorial . . . Horoscope ... Obituaries . . Stocks NIree,,ections 11JI111120101215 6 *84578 20025 CBS News pushing Couric With a little less than two months until Katie Couric's debut on "CBS Evening rJews," the network is playing up itS new star. 2A New restaurant sure to satisfy Kenneth Lay dead at 64 Enron founder dies of heart attack in Colorado; was scheduled to be sentenced later this year./12A Astronauts survey shuttle for damage * The shuttle crew reports no serious damage, but it's still early, NASA officials say./3A * Japanese naval officers lay wreath at cemetery/3A * Man charged with child abuse after allegedly hitting an infant./.4A Patrick's Pestaurant ,n Homosassa deals in imaginative fare. ,I1C y 'I 05 C:) - S I Ain 2,it., ME ENTERTINMENTCnSus OUNTYLYL)0CHorUIcu LflLrfTI.Jfl,nAJ ITcfl. 20 Florida LOTTERIES --( Here are the winning numbers selected Wednesday in the Florida Lottezy: CASH 3 4-6-5 PLAY 4 7-3-0-5 FANTASY 5 14 21 24 25 32 LOTTO 1-7-8-11-14-52 TUESDAY, JULY 4 Cash 3:3 7 3 Play 4: 7-0-6 7 Fantasy 5: 3 11 -18 21 -29 5-of-5 3 winners $72,077.99 4-of-5 411 $84.50 3-of-5 11,198 $8.50 Mega Money: 22 23 30 38 Mega Ball: 17 4-of-4 MB No winner 4-of-4 4 $2,345 3-of-4 MB 52 $395 3-of-4 1,104 $55.50 2-of-4MB 1,572 $27 2-of-4 34,105 $2 1-of-4MB 14,745 $2.50 MONDAY, JULY 3 Cash 3: 2-3-5 Play 4:4-2-6-4 Fantasy 5:5 17 19- 23-35 5-of-5 3 winners $84,195.48 4-of-5 382 $106.50 3-of-5 11,924 $9.50 SUNDAY, JULY 2 Cash 3:9- 9-9 Play 4: 8-4-8-9 Fantasy 5:1 2 -7 15 30 5-of-5 1 winners $198,103.33 4-of-5 272 $117 3-of-5 9,609 $9 SATURDAY, JULY 1 Cash 3:4 5 -1 Play 4:3-7-2-7 Fantasy 5: 6-12-14-19-36 5-of-5 3 winners $95,434.32 4-of-5 475 $97 3-of-5 13,005 $9.50 Lotto: 2 -13 16 34 36 43 6-of-6 No winner 5-of-6 93 $4,700 4-of-6 4,798 $74 3-of-6 97,104 $3.50 FRIDAY, JUNE 30 Cash 3:1 -7-8 Play 4:4 2 2 -2 Fantasy 5: 6 16 19 25 27 5-of-5 1 winner $272,733.97 4-of-5 414 $106 3-of-5 12,122 $10 INSIDE THE NUMBERS N To verify the accuracy of winning lottery numbers, players should double-check the numbers printed above with numbers officially posted by the Florida Lottery. On the Web, go to cornr; by telephone, call (850) 487.7777. cms S ...- W 4 . we ** .j l te W ro .4w,.r a,- Ito "Copyrighted Material -. O ,. Syndicated Content ww ...ot aa. SAvaiilable from Commercial News Providers Can .Bumps, 4--f 4hu- S ..... -.n * ^,. lo I I ,, mow e nmw a pofil~li 410 Ma e *41bialM -*C* Oh "M anul w .n ..i -om 4 .s..4a.-W o a- oa 0 m a a f*to a as en mo gaqe -mump -giam% ir a:.:.ON. . '* m-a The weather REPORT ..r- -.z-=z=:z:: =:z.t:.-- --- * a -" ^^ *b * w..... ..m.. S ......... ......*.. .. yS * Copyrighted Material "a m . .. . ...... o e .. n ......... * Syndicated Content Available from Commercial News Providers" I-p- a to anep aIBJ 400 na a o... m .a dome O O M em 460 ....................... ' **-AN-W-A-- !>::::.--t sow -w e a 4,w tm-as M I Mesiaenis or urystai iIver can water un iumauay aunu uafy, ucwjf u.m,,. '.. I.. ,'2006 Weather Central, Madison, Wl. ..a s *,,j 'I 0 ~4'~t~. Y~.~~fk kK% A-~4K u'L ~%L "rn's 4. m% Onus CouNTY (A) CHRoNicLE ENTERTAINMENT . I I , .4w;- -, ---- I. Today in Today is Thursday, July 6, the 187th day of 2006, There are 178 days left in the year, Today's Highlight in History: On July 6, 1944, 169 people died in a fire that broke out in the main tent of the Ringling Brothers and Barnum-and-Bailey Circus in Hartford, Conn. On this date: In 1945, President Truman signed an executive order estab- lishing the Medal of Freedom. In 1945, Nicaragua became the first nation to formally accept the United Nations Charter. In 1957, Althea Gibson became the first black tennis player to win a Wimbledon singles title, defeating fellow American Darlene Hard 6-3, 6-2 In 1989, the U.S. Army destroyed its last Pershing 1A mis- siles at an ammunition plant in Kamack, Texas, under terms of the 1987 Intermediate-range Nuclear Forces Treaty. Ten years ago: A Delta MD-88 jetliner's left engine blew apart dur- ing an aborted takeoff from Pensacola, Fla., sending metal pieces ripping into the cabin, killing a mother and her son.. , Five years ago: Former FBI agent Robert Hanssen pleaded guilty to 15 criminal counts and agreed to give a full accounting of his spying activities for Moscow. One year ago: New York Times reporter Judith Miller was jailed after refusing to testify before a grand jury investigating the leak of an undercover CIA operative's name (Miller was jailed for 85 days before agreeing to testify). Today's Birthdays: Former first lady Nancy Reagan is 85. Actor William Schallert is 84. Talk show host Merv Griffin is 81. Actor Donal Donnelly is 75. Singer-actress Della Reese is 75. Actor Ned Beatty is 69. Singer Gene Chandler is 69. President Bush is 60. Actor-director Sylvester Stallone is 60. Actor Fred Dryer is 60. Actor Burt Ward is 60. Actress Nathalie Baye is 58. Actor Geoffrey Rush is 55. Rock musician John Bazz (The Blasters) is 54. Actress Shelley Hack is 54. Actor Grant Goodeve is 54. Country singer Nanci Griffith is 53. Actress Allyce Beasley is 52. Rapper 50 Cent is 30. Actress Tamera Mowry is 28. Actress Tia Mowry is 28. Actress Eva Green is 26. Actor Gregory Smith is 23. Actor Jermry Suarez I ("Bernie Mac") is 16. Thought for Today: "Bored people, unless they sleep a lot, are cruel." Renata Adler, American writer. 1.84 3A THURSDAY JULY 6, 2006 %pp - a 0 - - "Copyrighted Material _S c Content - am _AD_ - -1- -do- -- Available from Commercial News Providers" -e - - - - - - - a-.~ -~ - -- - ~ -~ ~ C ~ ---.~ - q%_ 'a -RD -- muv -ow.-.M- om. 41b.m .JM 4h *m M__ pm"ft- b NE w.0.q-.-N -da a ~ m ___- C - a-- M amp Japanese officers lay wreath at cemetery Ceremony symbolizes unity between U.S. and apan AMANDA MIMS For the Chronicle Japanese naval officers presented a memorial wreath as a symbol of unity between the United States and Japan Monday during a ceremony at the Florida National Cemetery. Japanese dignitaries and 300 newly commissioned officers with the Japanese Maritime Training Squa- dron came to the Bushnell veterans cemetery for a brief ceremony to present the wreath. The solemn gathering included the national anthems of the United States and Japan. The service was a "beautiful ges- ture" that honored both the Japanese and Americans whb died in World War II, according to Robert Rowen, chainnan of the Tamnipa committee: that welcomed the Japanese naval unit Though the event did not draw a large crowd, most of those who observed appeared to be pleased. "I think it went very, very well," said World War II veteran and Clear- water resident Bob Cutler, who also serves on the welcoming committee. Cutler, who served in the U.S. Air Force in Europe during the war, said any bitterness of veterans toward the countries the U.S. fought is "silly," because Japan is now one of the United States' strongest allies. However, another World War II vet- eran took a different view. AMANDA MIMS/Sumter County Times The Japanese Maritime Training Squadron placed a wreath at the Florida National Cemetery on Monday in a ceremony to symbolize unity of the United States and Japan. Jack Bratton, of Bushnell, who was outside the cemetery during the cere- mony, said though he isn't against diplomacy, he doesn't believe the cemetery was an appropriate place for the ceremony. For Bratten, physical ailments resulting from serving and being shot in Okinawa are a constant reminder of the war. "I'm reminded of their actions all night every night," he said. "I'm con- stantly reminded- 24 hours a day, seven days a week of what they did." This is the first time Tampa has been a port of call for the squadron's yearly officer training mission. This year's 140-day training cruise began in Tokyo in April and was scheduled for stops in Canada, Mexico, Hondu- ras, Panama and the Dominican Republic by September, according to a Department of Veterans Affairs press release. The trip provides officers with sea- manship training and "an opportuni- ty for them to gain the knowledge and technical skills required to be cadre men and contribute to promoting friendly relationships between Japan and other countries." Amanda Mims is a reporter for the Sumter County Times. RRC says public notice insufficient, delay hearing SLetters held from council MICHEL NORTHSEA For the Chronicle Members of Rainbow River Conservation Inc. have asked that an administrative hearing about Rainbow River Ranch be delayed because a required public notice was not pub- lished. The group also alleges a let- ter to council members was delayed a day, so it was not re- ceived before the June 26 attor- ney-client session about the Rainbow River Ranch devel- opment. RRC member Paul Marraf- fino filed a formal notice with the state's Division of Ad- ministrative Hearings last week, asking the judicial hear- ings with the Department of Community Affairs and city of Dunnellon for the noncompli- ance report issued about the Rainbow River Ranch be post- poned until the public notice issue is settled. In cases of large-scale land uses, Florida Statute requires the legal advertising of the meeting be placed in a newspa- per published five days a week Because of that requirement, city council agreed to advertise in both the Riverland News and Star Banner. According to minutes from the Nov. 14 public hearing, the meeting had been advertised in the Star Banner on Nov. 4 and the Riverland News on Nov. 3. Iawwmm wE ctapcaw - ~ 0 C ]*-. ~.. . ] ] - 1- - 1-- 1- 1 t When Marraffino researched the matter, he found no adver- tisement in the Star Banner within the month of November, and the advertisement in the Riverland News had a map with incorrect information. The ON TH map didn't show a 4-acre private E See all fi waterfront recre- the RainI ation area as Ranch at wanted by the developer, but us/interr showed the area Type this to be "conserva- Quick Dock( tion space," Mar- 0417GM. raffino wrote in a letter he filed with the Florida Department of Administrative Hearings. A map showing the location of a proposed land-use is required to be included with public hearing information. Marraffino then gave his findings to city hall the morn- ing of June 26, so council could review them at their meeting that evening with the city attor- ney The findings E NET were not given to the council mem- lings on bers. Dow River Dunnellon City Manager Ed Eric- h.state.fl son said when he et saw the docu- number in ment Marraffino et: 06- had prepared, he thought it was a legal document and should have gone to the attorney first "There is no reason to cry foul. Nobody is trying to do anything wrong. We just want to do things right and remain neutral," Ericson said. Marraffino's findings were not the only documents given to council members before the Monday meeting. A form letter with 32 signa- tures urging council not to con- tinue mediation with the Department of Community Af- fairs, but to let the state agency's noncompliance report stand was withheld. The packets with the letter were dropped off before the June 26 meeting. Ericson said things got busy and he simply "forgot" to get the packets distributed to the council members' mailboxes. The meeting was the last scheduled attorney-client ses- sion before the July 13 media- tion hearing. Michel Northsea is the editor of the Riverland News. w dksd O me - ---"Copyrighted Material - "-- Syndicated Content - - - -. ~- . - a a. 6. - former Michael Dunnellon Roof High School quarterback, has appeared in "XXX," "Dukes of Hazzard" and "Black Hawk Down." The show will air for six weeks, 1 I -Available from Commercial News Providers" * - - do& tw - . b t 'n k( ( County BRIEFS Officials find kitten; alert canceled On June 17, the Citrus County Health Department asked for help to find the owner of a kitten that was thought to possibly be rabid. On Monday, the health department announced that the owner of the kitten has been found and the kitten and its lit- termate are not rabid. The kitten and its littermate were available from "Family Pet" in Hernando. After the kitten was adopted, the littermate became ill, displaying symptoms consistent with rabies infection. Because of the urgency of the situation, a press release was issued. By the next day, the lit- termate was again acting nor- mal and it remains alive and well. Through the cooperation of the owner of "Family Pet" store in Hernando, the adopted owner was found and that kitten also remains healthy. GOP club to host candidate forum The East Citrus Republican Club will have a candidate forum from 8 a.m. to noon .Saturday at the Hemando Civic Center on Parsons Point Road just east of U.S. 41 in Hernando. Candidates for local and statewide offices have been invited. For information, call Bill Harden at 726-1270. CCC to consider Saddler contract The Citrus County Commis- sion will decide Tuesday whether to hire Charles Saddler III as the next county administrator. County officials have devel- oped a contract that would give Saddler a base salary of $120,000 annually, about . $7,000 more than what former | administratorRichard Wesch eamed. If Saddler is ever terminated, as Wesch was, the contract says the county will pay him a lump sum cash payment equal to six months salary. Teacher joins school board race Rock Crusher Elementary physical education teacher Paul Eamheart has entered the race for the county's school board. Eamheart is running against Michael White and incumbent Louis Miele. The school board is a non- partisan race. TPP division moved to new site The property appraiser's Tangible Personal Property divi- sion has moved to the Crystal River office at the Crystal Square Shopping Center in the government center on U.S. 19 behind American Pro Dive. All calls can be made directly to this division by calling 795- 1087, 795-0200 or 795-7725. For information about attach- ments to mobile homes assessed through the Tangible Division, call 795-5824. The address for all TPP returns and correspondence is: Melanie J. Hensley, CFA, Citrus County Property Appraiser, Tangible Division, 801 U.S. Highway 19 S.E., Crystal River, FL 34429. Effective Thursday, the divi- sion's new fax number will be 795-0097. Local family to be in reality TV show "Raising the Roofs," a show featuring Dunnellon actor Michael Roof and his family, will air for the first time at 10:30 p.m. tonight on channel 43 on Bright House and channel Adelphia. Roof, the 29-year-old Vv CITRUS COUNTY (FL) CHRONICLE 4.A THuRSDAY. TULY 6. 2006 For the RECORD Crystal River Police Arrest John Michael Archibald, 59, 773 NE 9th St., Apt. D, Crystal River, at 2:15 p.m. Monday on a charge of knowingly driving while license sus- pended. Bond was set at $10,000. FWC Arrests Ronald Timothy Castleberry, 36, 9886 N. Cheyenne Drive, Beverly Hills, at 11:59 p.m. Monday on a charge of boating under the influ- ence. Bond was set at $500. James Kuhn, 45, P.O. Box 1791, Crystal River, at 1:24 a.m. Wednesday on a charge of boating under the influence. Bond was set at $500. Shaun Shopland, 34, 3388 N. Chameleon Point, Crystal River, at 11:32 p.m. Tuesday on a charge of boating under the influence. Bond was set at $500. Citrus County Sheriff Domestic battery arrests Betty Jean Jones, 27, Inverness, at 12:40 a.m. Wednesday on a charge of domestic battery. According to the arrest report, Jones threw a fan at a man and cut his lip. No bond was set. Mary Roberts, 34, and Erich Lee Taylor, 33, Hemando, at 12:24 a.m. Wednesday on a charge of domestic battery. According to the arrest report, Roberts and Taylor were mutual combatants, resulting in vari- ous injuries to each other. Additionally, Roberts were charged with resisting/obstructing an officer without violence. No bond was set for the domestic battery arrests, and additional bond of $500 was assessed to Roberts for her other charge. Marcus Doyle Segers, 34, Floral City, at 8:24 p.m. Tuesday on a charge of domestic bat- tery. According to the arrest report, Segers pushed ON THE NET S For more information about arrests. made by the Citrus County Sheriff's Office, go to and click on the link to Daily Reports, then Arrest Reports. a woman on the ground, held her down and squeezed her face. The woman received bruises and lacerations from the incident. Segers denied the charges. No bond was set. Alicia Taylor, 23, Homosassa, at 9:13 p.m. Tuesday on a charge of domestic battery. According to the arrest report, Taylor threw a remote control at a man, striking him in the fore- head. No bond was set. Other arrests Richard James Caterino, 9888 S. Forestline Ave., Inverness, at 1:08 a.m. Tuesday on a charged of marijuana possession. Bond was set at $500. Kathryn Decaro, 29, 1010 Leroy Bellamy Road, Invemess, at 9:32 p.m. Monday on a charge of battery. According to the arrest report, Decaro had punched a woman in the face. She was released on her own recognizance. James Dobson, 21, 1018 Hickory Ave., Inverness, at 11:07 p.m. Tuesday on charges of tampering with a witness/informant/victim and battery. According to the arrest report, Dobson hit a man with a glass of iced tea and slapped a cellu- lar phone out the man's hand when he tried to call law enforcement. Bond was set at $2,500. Joseph Jones, 23, 8022 W. Baja Court, Unit 5, Crystal River, at 8:29 p.m. Monday on a charge knowingly driving while license suspended. Bond was set at $2,000. George Ambrose Munnings, 23, 2356 Cedar Road, Tampa, at 11:42 p.m. Tuesday on a charge of not having a valid driver's license. Bond was set at $250. Christopher Reed, 23, 1111 Mossy Oak Drive, Inverness, at 6:42 a.m. Tuesday on a charge of refusing to take a DUI test. Bond was set at $150. Janice Elaine Reynolds, 44, 412 Woodbine Ave., Rome, Ga., at 2:37 a.m. Tuesday on a charge of knowingly driving while license suspended. Bond was set at $500. Thomas Edward Walton, 42, 38 S. Lee St., Beverly Hills, at 2:08 p.m. on a charge of battery. According to the arrest report, Walton threw a woman on the ground and also threw a drawer at her. Bond was set at $500. Chastity Denise Wixley, 983 Hawk Crest Lane, Inverness, at 9:34 p.m. Tuesday on a charge of resisting/obstructing an officer without violence. Bond was $500. Burglaries MA burglary, reported at 11:47 a.m. Thursday, 'June 29, between midnight Monday, June 19, and 11 a.m. Thursday, June 29, to a residence in the 2300 block of S. Diecidue Drive, Crystal River. A burglary, reported at 2:10 p.m. Thursday, June 29, between 5 p.m. Tuesday, June 27, and 8 a.m. Thursday, June 29, to a construction, site on Grass Street, Homosassa. A burglary, reported at 7:17 p.m. Thursday, June 29, between 5 p.m. and 7 p.m. Thursday, June 29, to a residence on S. Lucille Street, Beverly Hills. A burglary, reported at 7:48 p.m. Thursday, June 29, between 6:30 p.m. and 8 p.m. Thursday, June 29, to a residence in the 7000 block of S. Sonata Avenue, Homosassa. A burglary, reported at 8:15 p.m. Thursday, June 29, between 7:40 p.m. Wednesday, June 28, and 7 a.m. Thursday, June 29, to a con- veyance in a parking lot in the 300 block of E. Hartford Street, Hemando. Thefts A theft, reported at 12:42 p.m. Wednesday, June 28, between 11:30 a.m. and 12:30 p.m. Wednesday, June 28, at a residence in the 1900 block of W. Water Lily Drive, Dunnellon. Homosassa man charged with child abuse Authorities say baby was struck with open hand KHUONG PHAN kphan@chronicleonline.com Chronicle A Homosassa man stands accused of hitting an 8-month- old baby boy, causing bruises to the baby's face and a black eye. According to the Citrus, County Sheriff arrest report, the infant's mother left him alone with Carlos Cruz, 24, while she went out to make a phone call. When she returned, she noticed that the baby had a redness on the left side of his face. When the mother ques-, tioned Cruz, he reportedly told her that the baby was trying to push himself up on carpet, but he fell forward and received a rug burn to his face. The baby was taken to an area pediatrician who con- cluded that the redness was not the result of rug burn, but instead resembled the outline of a hand the report stated. Cruz was brought in for questioning by sheriff's offi- cials and he initially main- tained that the baby ihad gotten a rug burn. When told that his account of the incident didn't check out with a pediatrician's assessment. Cruz reportedly ,recanted his story and stated that he had struck the baby with an open hand. Cruz reportedly said that he had an anger management problem and that the baby did not like,;being flii wand would ]aby ,tiyitily his in o. di h.-, r returned., ruz went on to ,,ay that hq felt Carlos Cruz hurt by ,, the b a b y 's t , i n g told authorities Iby's cryilng he was upset when l eft because baby *aJ9o(,ijth didn't like him. 1nm, because he reportedly believed that the baby di not want to be with him. .. Cruz reportedly told n vesti- gators that he. was greatly angered by the feeling of the baby not wanting Wo b. with him, and thus causedd jti to hit the baby. o. Cruz is charged with child abuse. No bond was set COUEY Continued from Page 1A sexual battery. The state is seeking the death penalty. * Jury selection will take place Monday at the Lake County Courthouse in Tavares to .honor a change of venue request from Couey's defense teart, citing pretrial publicity anid the slim chance of finding 'an unbiased jury in Citrus bCounty. The process to pick 12 jurors and 4 alternate jurors is expected to take at least two days, with testimony beginning POLITICAL the following day. As of Wednesday, 1,873 potential jurors were expected to show up; 1,627 of the initial 3,500 people summoned for jury duty had been excused, according to the Lake County Clerk of Courts office. Besides possibly ruling on the prosecution's request today, Circuit Judge Ric Howard might make other rul- ings. Prosecutors are asking to keep comments Sheriff Jeff Dawsy made about Couey after his arrest, including calling him a "crack head," out of trial testimony. 'Any such statements made ... ** .. : .:, :. .' . ::; * Continued from Page 1A S:A group of townspeople attempted to recall Johannesson, saying she- had not told them or the council about the devel- opment, but the move to remove her failed a week ago when a judge threw out the :petition. Johannesson said she has sent the gov- ernor's office an e-mail asking for guid- ance on what to do next about the lack of a functioning town government, but the gov- ernor has not responded. She said the governor has authorized RESORT Continued from Page 1A While the density is allowed by the comprehensive plan under RV park zoning, Farnsworth said the same issue surfaced a few months ago when the Preservation Pointe luxury RV park project was turned down. Preservation Pointe was pro- posed for the east side of the county, but county commission- ers rejected it, saying the proj- ect was far too intense to be built on the banks of the Tsala Apopka Chain of Lakes. The one difference between Preservation Point and Scissors & Comb ""--'-- Barber Shop -- Best Haircut in Townl Hwy. 19 in the Airport Plaza 873882 by Sheriff Dawsy were based completely on statements made by the defendant to deputies after the defendant was taken into custody in Augusta, Ga.," Ridgway wrote in a motion. Ridgway is also asking that evidence about Mark Lunsford, Jessica's father, be kept from trial. Part of the request deals with his expenditures though the not-for-profit Jessica Marie Lunsford Foundation. Ridgway is also asking Howard to disallow the con- tents of a computer taken from Lunsford after his daughter was reported missing from her the Lbvy County Commission to fund the town's payroll as a loan for now. The two remaining town employees are Paul Shearer of water maintenance and Raymond Fickle, the grounds mainte- nance man. Johannesson said the town's attorney has advised her to stay away from town hall because he has concerns about her safety. She said everyone in town government has been accused of wrongdoing and maligned. "It's really a shame. It's torn this town apart," she said. Those who have resigned in 2006 for various reasons, many related to the con- Nature's Resort is that the lat- ter is an existing RV park established before 1973. It has RV park zoning. The Preservation Pointe develop- ment lacked RV zoning. But Nature's Resort is next door to the famous Halls River Retreat property. A developer attempted to build the four- story Halls River Retreat con- dominium on the property, but the project died in court. The Save the Homosassa River Alliance was the first to file suit against the retreat proj- ect. A judge ruled that the coun- ty's comprehensive plan does- n't allow high-density develop- ments in environmentally sen- sitive areas along the coast. I t home Feb. 24, 2005. According to investigators, a few porno- graphic images of children were found in the computer's delete bin. Prosecutors previously said they were not pursuing charges against Lunsford because there was no proof he was pro- ducing or saving the images, and that they might have been accidentally downloaded. Included in motions he filed recently, Lewan is asking that photos of Lunsford's body not be shown to the jury, saying "the prejudicial effect substan- tially outweighs any probative value ... " troversy: Councilwoman Helen Ciallella (requested by the mayor) Councilwoman Diane Blomgren (health reasons). Councilman Roger Myrick. Councilwoman Mary Pate Assistant Clerk Debra Stines. Deputy Town Clerk Laura Coyles Zoning official Stanley Moore. City Attorney David Lacroix. Johannesson said it was no coincidence Pate submitted her resignation to council members rather than attending Monday's council meeting. She said Pate's absence left the council without a quorum and she had to close down the meeting. The only exception would be properties zoned for higher density uses before the com- prehensive plan was adopted. Those properties have vested rights. Nature's Resort has vested zoning rights as an RV park. The comprehensive plan also says RV parks can have high- density zoning. Ten units to the acre are allowed. Commiss- ioners have indicated they may want to lower the density in the coastal and lakes areas. The comprehensive plan also says the county can weigh impacts to wetlands and con- sider the compatibility of the proposed campground expan- sion; is the spring-fed Halls River the right place for a 600- unit RV and tent camp- ground? ., GET THE WORD OUT Nonprofit organizations are invited to submit news. releas- es about upcoming community events. , ;.'..i '. News releases are subject to editing :'.-' .; i' *. Call. 563-.5660 for details. .. '-n bur.' C I T R U S.*'-C 0 U N T.Y,-" tilONICL Florida's Best Community Newspaper Serving Florida's BeM Commun To start your subscription: ; : Call now for home delivery by our carriers: Citrus County: (352) 563-5655 Marion County: 1-888-852 or visit us on the Web at .html to subscribe. . 13 wks.: $34.6* 6mos.:'59.O* yea *Plus 6% Florida sales to' k "" 10 For home delivery by mal: In Florida: $59.00 for 13 weeks Elsewhere In U.S.: $69.00 for To contact us regarding your service: 563-5655 Call for redellvery: 6 to 11 a.m. Monday through Frida 6:30 to 11 a.m. Saturday and Sund Call with questions: 6 a.m. to 5 p.m. Monday thirugh 6:30 to 11 a.m. Saturday and c nccsales@chronicleonline.c" I want to send Information to the Chronicle, MAIL IT TO US The Chronicle, P.O. Box 1899, Inverness, FL 3 FAX IT TO US Advertising- 563-5665, Newsroom 563-328 E-MAIL IT TO US Advertising. advertising@chronicleonline.con Newsroom: newsdesk@chronicleonllne.com Where to find us: Meadowcrest office Inverness office , .-4 -- -44., N', | i, -- I 1624 N. Meadowcrest Blvd. 1 06 W Main SI... . Crystal River, FL 34429 Inverness, FL 34450 Beverly Hills office: Visitor Truman Boul ,vard 3603 N. Lecanto Highway Beverly Hills, FL : . Who's In charge: Gerry Mull Manager, 563 Jeff Gordon .................................. Business Manager, 564 Deborah Kamlot ................. Human Resources Director, 564 Trina Murphy .......................... Director of Marketing, 56p ............................. Andy Marks, 563 Sound Off ............................................ ..... .. 563 Founded in 1891, The Chronicle is printed in part on recycled neivws Please recycle your newspaper.I '': L chronicle olm lay' 'tfay m ,. -3222 . 8-3225 -3227 3-324'0"0 -3636,W, -3255 -3275 -5655 42908' -2910 3-3225 -5660 -2930 -5660 -3261 M0579 C print.' nitR'A INSIDE iFree - S Hearing Aid Repairs I all makes and models' Crystal River Mall In o..p.=.on0mu.spr...nt coupon 795-1484 i BatterySale l Paddock Mall, Ocala 0 237-1665 I _*.99^ No Cost To You Scooters o and Power Chairs With Medicare And Suppliment If You Qualify (Call For Details) In Home Demonstrations Rental Available Repairs Mr. Mobility Medical, Inc. I 3221 S. FLORIDA (HWY 41) INVERNESS 352-637-6088 11163 SPRING HILL DLR SPRING HILL FLORIDA 34609 352-666-3006 13235 14TH STREET LEESBURG 352-323-8585 BLINDS WE'LL MEET OR BEAT ANY COMPETITORS PRICE* The Savings Are Yours Because The Factory Is Ours! FAST DELIVERY PROFESSIONAL STAFF ,.-~.EUWIND FACTOR LECANTO -TREETOPS PLAZA 1657W. GULFTO LAKE HWY HOURS:MON.-FRI.9AM'-PM S I TOLL FREE 1-877-746-0017 .ening andWkeJandsbyApp1nM 27-00I2WO-I-- S l' S I ILll I THURSDAY, JULY 6, 2006 5A UTRLS IWO LLJ'NIA (PL) UHtONAALt*E - 0 - 0 "Copyrighted Material -no N 0 S. S yndicateduontent -- Available from Commercial News Providers', S -0-- 'M -NM - -- ORB- -Now m- 4- 0 ~ aw 1b. M-ww 1.-No 41. q W b 1 o 4 t- mw C dm- 4b.- q* a.m-. &"No- 0C U IM. 1b am - qbS - W .- 41b -4 -ft -d 4..m .Nm C.~* -~ ~'a- --'a - -- S - "a- CC--a --S a - - - S - '0 - C S *-~ - C ~* -a. C- - S b - 'a-S ~ - - -. qu- C. 'rWY PYLS Ba lance must be paid It full witriln 12 months of purchase. Inlatrs will be assessed from the original S date of purchase on tie average balance unless (1) Mte balance Is paid In full by the and of 12 months. end M2) minimum monthly payments are made. Minimum monthly payments will 1be required in the T amount of 5)f on a fer card, the grater oflST5.00 or 3% of the total amount financed or (l) a portion f tMe amount financed based on the tenarm of the contract (2d ro 48 months). Minimum total purchase of F R 799 required. F anoaitgprovided by outside finance companies. Financing is subject to credit approval N 'Ofer is l or noalvduals, not businesses. Several different financing plans available with different APRs. F O R 1 2 M Current maximum APR up to 27%, the APR may vary in some states not to exceed state maximums AIR CONDITIONERS WHIRLPOOL 5,000 BTU 115-VOLT ".- j AIR CONDITIONER WITH 2-SPEED FAN & ADJUSTABLE THERMOSTAT * Adjustable Air Direction Control $ 9 * Washable Woven Filter $99 SInsta-Mount- Installation. -10 #ACD052PS 9.7 EER "lo" After Coupon 9 ---o WHIRLPOOL 10,000 BTU 115-VOLT AIR I._-__ 1 CONDITIONER WITH ELECTRONIC CONTROLS, 3-COOLING SPEEDS, ..... ADJ. THERMOSTAT & REMOTE * Omni-Flo@ Air Direction Control * Energy Stare Qualified Room '219 Temperature Display. #ACC108PS -22 '10.8 EER ___ -22____ After Coupon 197 WHIRLPOOL 18,000 BTU 230-VOLT AIR CONDITIONER . WITH 3 COOLING SPEEDS AND , ADJUSTABLE THERMOSTAT -- * Multi-Directional Air Flow 04 Control -Washable Woven $349 . Filter Insta-Mount $34 Installation. #ACM184XS .30 ^^^^>'c?-S- E 9.7EER After Coupon 319 W lp ,_ CAMCORDERS JVC SUPER VHS-C & VHS ET CAMCORDER WITH 25x OPTICAL/1000x Q199 DIGITAL HYPER ZOOM AND 2700 ROTATING -20 2.5" LCD MONITOR $lr179 After Coupon U ' CANON MInlDV DIGITAL CAMCORDER WITH 16:9 WIDESCREEN FEATURE, 25x OPTICAL/800x DIGITAL $279 ZOOM & 2.7" ROTATING -30 LCD SCREEN *,w_ Ca.oi After Coupon$249 DVD PLAYERS & COMBOS COMPACT DOLBY 2 CHAN. PROGRESSIVE SCAN DVD PLAYER WITH DVDIVCDI / 2 W. SVCDICDICD-RIRWtJPEG PLAYBACK 29 _------ --- & REMOTE 2-3 After Coupon 26 TOSHIBA DVD PLAYER/4-HEAD HI-FI STEREO VCR COMBO WITH PROGRESSIVE OUT, DVDI 5 DVD-RIRWICDICD-RIRWIVCD/SVCDI/ $9 -- WMA/MP3 PLAYBACK _& REMOTE A10 TOSHIB After Coupon 89 MAJOR APPLIANCES WHITE-WESTINGHOUSE SUPER CAPACITY WASHER WITH 8 CYCLES & 3 WASH/ RINSE TEMPERATURES * 2 AgitateiSpin Speed Combinations * 3 Position Water Level. '279 VWS8323ES79 ______ -30 After Coupon 29 p~ U' -U" . 14 Is .111,1 FRIGIDAIRE 18.2 CU. FT. REFRIG.-FREEZER WITH GALLON DOOR STORAGE * 2 Sliding Snelves 2 Clear Crispers; I With Humidity Control Clear Dairy Door ; Moveable Freezer Shelf. BFRTBB5EW *399 -30 After Coupon 69 WHITE-WESTINGHOUSE 26 CU. FT. SIDE-BY-SIDE WITH CRUSHED/CUBED ICE & WATER DISPENSER & WATER FILTER * 3 Giass Snelas 2 AdJ. Gallon Door Bins * TWO 2-LIIlr Door Bins 2 Clear Crispers * Ciaar Dairy Door Tall Pull Out Freezer Baskei #WRS6R3EW *779 -50 After Coupon 729 BIG SCREEN TVs WITH HD CAPABILITY -SON-y. SONY 55" 16:9 WEGA 3LCD REAR PROJECTION DIGITAL CABLE READY HDTV WITH BUILT-IN HD TUNER, S DOLBY* DIGITAL & SRS* 2199 TruSurround" XT -200 After s1999 Coupon SAMSUNG 52" WIDESCREEN PROJ. HDTV WITH BBE* SOUND, AUTO SELF FOCUS AND UNIVERSAL REMOTE '1199 -100 oAft: $1099 Coupon V f PANASONIC 56" - 16:9 WIDESCREEN PROJECTION HDTV WIDLP" TECHNOLOGY, CableCARD SLOT, BBE* SOUND AND SURROUND -200 Aft7 $7 Counon $1799 LCD TELEV PANASONIC 26" WIDESCREEN LCI WITH 2 HDMI INTERFACES, 3-D CO MANAGEMENT, SURROUND SOUN & PEDESTAL STAND Afcl Coupi SONY 32 WITH AT & PC INP XT, LIGH FUNCTION neimi 13" TV WIREMOTE, ON-SCREEN MENUS, V-CHIP, CLOSED CAPTION AND FRONT A $Q -7 NPUTSerCoupon 2 After Coupon" $-2 19" TV WITH SLEEP TIME CLOSED CAi & REMOTE CONTROL After Coupon 1 VIDEO TOSHIBA 20" TVIVCR COMBO WITH GLOW-KEY REMOTE, OSD, AND FRONT i AIV INPUTS '109 -11 coupon98 AUDIO & HI PIONEER 160W 3-WAY BASS REFLEX BOOKSHELF MMM LOUDSPEAKER " WITH 6 1/4" CONE WOOFER I I #SHF41LR G- I 30W SPKR. Co After Coupon HITACHI 42" 16:9 WIDE SCREEN PLASMA HDTV WITH HD DIGITAL WINDOWTm SPLIT SCREEN *2599 -200 Aft.r $22399 Coupon f . VISIONS i D HDTV i 3LOR $1299 D -.100 m $11994 " 16:9 BRAVIA" LCD HDTV SC DIGITAL TUNER, HDMI $1599 PUTS, SRSO TruSurroundm IT SENSOR & FREEZE -150 )N i After Coupon 1449 SONY 27" FD TRINITRON* WEGAi" FLAT SCREEN DIGITAL HDTV. IOSD, W/ATSC DIGITAL TUNER, $399 1R, DOLBYE DIGITAL, 30 PTION & SPEED SURF' 99 After Coupon $369 -10 SONY 32" WEGA' HDTV.... ,'6,29-*-. i. .A. .7A, T HiW F S D ,AY JULY 6, 2006 *,/ ,:Flr,:,',d.ll:lrllll'r I ,rI Ti Paddle with a Purpose' Saturday Fund will benefit different causes Special to the Chronicle Beginning this Saturday, Aardvark's Florida Kayak Co. will introduce a new program called "Paddle with a P rpbse.": ' From July through December, on each Saturday closest 'to the full moon, all interested paddlers are invit- ed to join in at an open house at the shop, after which the group will depart from Hunter's Spring for a sun- set/moonrise paddle on Kings Bay. The "purpose" will be to raise funds for worthy causes. Thie paddles are free to those with their own canoes/kayaks, but participants are asked to ddpate whatever they wish to the cause of the month. Rental kayaks are available for $20 and Aardvark's will donate 25 percent ofthe rental feet that month's cause. Participants are invited to vote for the cause of the month when they sign up on the form on the company Web site. Whichever gets the most votes, gets the donation for this month and then next month, that group will be off the list until the next go-round. Paddle dates are: Aug. 12, Sept 9, Oct. 7, Nov. 4 and Dec. 2. * More' information and an online registration ccan be found at floridakayakcompany. com/paddlewithapurpose.html. Watercolor dub artists to meet July 14 Group meets at Inverness UMC Special to the Chronicle Artist Jeanne Conrad will be the guest demonstrator of the Citrus Watercolor Club at 1 pm. Friday, July 14, at the United Methodist Church in Inverness, on County Road 581. The public is invited to attend as guests for a $3 dona- tion at the door. ;Conrad is a well-known watercolor artist who has lived in Homosassa since 1991. She is a scuba diver and a volun- teer at Homosassa Springs Wildlife State Park, where she finds and photographs her favorite watercolor subjects - fish, birds and local wildlife. She has been on the Citrus Watercolor Club Board for five years, two years as president. She has taken many watercol- or workshops, most recently with Tom Jones on an Alaskan cruise. Conrad will be present- ing a demonstration that will concentrate on the ways she likes to paint water, as seen from both above and below. Members enjoy opportuni- ties to show and sell their work, take workshops and par- ticipate in monthly sketch- outs, etc. For information about the meeting or becoming a member, call Meredith Keene at 382-8973 or Barbara Fife at (352) 622-9352. The Citrus Watercolor Club meets year-round at 1 p.m. the second Friday monthly at the First United Methodist Church of Inverness on Pleasant Grove Road. Scouting the West Special to the Chronicle Boy Scout Troop 415 of Crystal River traveled to the Grand Canyon area for its summer long-term camping experience.. Boy Scout Troop travel to Nevada, Arizona for camping experience Special to the Chronicle Boy Scout Troop 415 of Crystal River traveled to the Grand Canyon area for its summer long-term camping experi- ence. Flying out of Orlando on June 13, the boys arrived at the Las Vegas airport to begin their journey. During their stay,, the boys toured Hoover Dam, back- packed and camped in Havasupai Canyon, which is part of the Havasupai Indian tribes home, took the Grand Canyon Railroad to the south rim and spent three days on Lake Mead in a houseboat The hike into the canyon was 10 miles long and took the troop five hours to complete. They arrived at the Indian village of Supai where they mailed post cards home that traveled by the only mule train delivery system in the coun- try. While in the canyon they visited four waterfalls, watched wild burros, a dia- mondback rattler, bighorn sheep and antelope. The boys explored a cave and tubed the small rapids formed by Navajo Falls, Havasu Falls, Mooney Falls and Beaver Falls. The temperature in the canyon was averaging 89 during the day The boys explored a cave and tubed the small rapids formed by Navajo Falls, Havasu Falls, Mooney Falls and Beaver Falls. and 66 at night No humidity and mild temperatures along with spectacular views made the stay awesome. The train ride was in refurbished turn-of-the-century Pullman cars of the Grand Canyon Railroad that took the troop 60 miles from Williams, Ariz., to the south rim of the Grand Canyon. The train was even stopped and held up by bandits on the return trip. They picked up their 56-foot house- boat and 24-foot deckboat at Echo Bay resort on Lake Mead. The boys spent three days swimming and exploring the shoreline where the area averaged 113 degrees during the day and 89 at night They were in the water a lot At night, the troop laid on the roof of the house- boat and watched billions of stars and many satellites. The Milky Way was a sight many of those on the trip had never seen in its full glory. The last day of the trip, the troop spent time visiting some of the family oriented sights in Las Vegas. They ate at Tony Romas Rib House, rode the rides at Circus Circus and watched the danc- ing waters at the Bellagio Hotel. A monorail ride from the MGM Grand brought them to Treasure Island, where they saw a pirate show. They returned home on June 24 after 12 days filled with lifelong memories and adventures. Troop 415 is chartered by the United Methodist Men from Crystal River United Methodist Church. For more information about Troop 415, call Scoutmaster Jim Smith at 563-5747. Education NOTES Garden Club honors Homosassa pupil The Riverhaven Garden Club of Homosassa has selected Courtney Dorman, a student at Homosassa Elementary School, as its recipient for the Wekiva Youth Camp Scholarship. The camp is designed for students grades 3 through 8 who are interested in nature and who enjoy and love the outdoors. Courtney will attend Camp Wekiva in July for six days. The camp is sponsored by the Florida Federation of Garden Clubs Inc. and is located near Apopka. Citrus Springs resident earns pharmacy degree Kelly Ann Santiago, of Citrus Springs, graduated from University of the Sciences in Philadelphia, Pa., during a special ceremony on May 23 as part of the school's 185th commencement celebration in Philadelphia. Santiago graduated with a Doctor of Pharmacy degree. She is the daughter of William and Gayle Davis. University of the Sciences in Philadelphia is a private, coeduca- tional institution founded in 1821 as Philadelphia College of Pharmacy, the first college of pharmacy in North America. USP specializes in educating students for rewarding careers through its undergraduate, graduate and doctoral degree pro- grams in the health and related sci- ences. Walker to attend UF science program Crystal River student Mark Walker has been selected to attend a three-day environmental science program at the University of Florida in Gainesville this month. Save the Earth's Environment through Knowledge (SEEK) is a program attended by selected students from high schools around the state. The pro- gram is sponsored by the Florida Federation of Garden Clubs and administered by the University of Florida's Center for Precollegiate Education and Training. During his stay on campus he will take part in hands-on science activities and . field trips focusing on environmen- tal science and pollution. Walker is being sponsored by the Riverhaven Garden Club of Homosassa. Peragine named to Dean's Ust at Stonehill Stonehill College has recently named local student Jessica L. Peragine of Citrus Springs, a stu- dent from the class of 2007, to the Dean's List of the spring 2006 semester. Dean's List status at Stonehill College is awarded solely to those students who have concluded a semester with a GPA of at least 3.5, and have successfully com- pleted all courses for which they were registered. Stonehill is a competitive, coedu- cational Catholic college in Easton, Mass. Established in 1948 by the Congregation of Holy Cross, Stonehill continues the rich Holy Cross tradition of a rigorous liberal arts, pre-professional, and sci- ences education. News NOTES Looking for unique and amazing homes Do you have a unique or amazing home? If you think your home is spectacular and worth a story, tell us about it. Feel free to send in photos. If selected, your home will be featured in an upcoming HomeFront section. Send your submissions including name, phone number and physical address to Cheri Harris at charris@chronicleon- line.com or 1624 N. Meadowcrest Blvd., Crystal River, FL 34429. Hospice needs volunteers for shops Hospice of Citrus County offers volunteer opportunities for cashiers, merchandisers and sorters in the Thrift and Gift Shoppes in Crystal River, Inverness and Homosassa. Volunteers receive a discount on all items, as well as addition- al benefits. If you are interested in becoming a volunteer member of this special team, call Judy - Knowlton, volunteer services manager, at 527-6613 or visit hospiceofcitruscounty.org. Computer Club to meet Friday The Citrus County Computer Club (CCCC) will meet at 7 p.m. Friday at The Shepherd of the Hills Church in Lecanto, on County Road 486, 1/4 mile east of C.R. 491. There will be a short business meeting followed by a round- table discussion. Bring your computer questions. Guests are always welcome. For information, visit ccccfl.com or call Lee Nowicke at 746-5974 or Elaine Quarton at 637-2845. Try out for Nature Coast Soccer League Nature Coast Soccer League is holding tryouts for its U-13 boys' competitive team from 8:30 to 10 a.m. Saturday. Tryouts will be at Beverly Hills Community Park in Beverly Hills. For more information or direc- tions, call Tammy Fagan at (352) 266-5358 or 489-6334 or Eileen Howard at 746-4358. Free diabetes screening available Free diabetes screening will be offered from 9:30 a.m. to 5 p.m. July 10 through 12 at Walgreens, 4029 S. Suncoast Blvd., Homosassa. Other tests will be available for a fee: cholesterol, liver func- tion, h. pylod, thyroid, PSA and blood type. Results will be avail- able on site. For more information, call (800) 713-3301. Family Care Council meets Monday The Area 13 Family Care Council will meet from 10 a.m. to noon Monday at the Wildwood Department of Children and Families office, 1601 W. Gulf Atlantic Highway (State Road 44). All persons interested in issues of those with develop- mental disabilities and their fami- lies are encouraged to attend. For information, call Dominic Christofaro at (352) 489-6279. SPET SPOTUGHT The Chronicle invites readers to submit pho- tos of their pets for the daily Pet Spotlight fea- ture. | Photos need to be in sharp focus. Include a short description of the h pet and owners, includ- : ing names and home- towns. Photos cannot be returned without a self-addressed, stamped Envelope. Group photos i of more than two pets cannot be printed. Send photos and infor- mation to Pet Spotlight, c/o Citrus County Chronicle, 1624 N. Meadowcrest Blvd., Crystal River, FL 34429. * I. Tuition scholarship 'm..! Special to the Chronicle Inverness City Manager Frank DiGlovanni, left, and City Clerk Deborah Davis, right, congratulate Jamie Gajos, cen- ter, for recently earning a two-year, full-tuition scholarship to Tallahassee Community College and a two-year, full- tuition scholarship to Florida State University. Gajos par- ticipated in the Florida Girls State program for 2006 In June, sponsored by the American Legion Auxiliary Dept. of Florida Inc. and was recognized for her outstanding leadership. She was one of five Girls State attendees to receive this prestigious award. STOCKS fl.1DJ THURSDA,,JULYk,0, I.J CIRus COUNTY (FL) CHRONICLE MOST ACTIVE (St OR MORE) Name Vol (00) Last Chg Pfizer 284629 23.68 +.10 GenElec 256179 33,31 -.02 Lucent 231488 2.38 -.05 EMCCp 214738 10.93 -.01 ExxonMbi 197205 62.55 +.40 GAINERS ($2 OR MORE) Name' Last Chg %Chg DuqUght 19.39 +2.95 +17.9 MidwGm 10.65 +1.21 +12.8 CPI 33.71 +3.13 +10.2 Fiat pfA 11.50 +.94 +8.9 Culp Inc 5.70 +.45 +8.6 LOSERS (52 OR MORE) Name Last Chg %Chg Braskem 11.25 -.94 -7.7 USG rtwi 15.52 -1.28 -7.6 TatneftAO 78.30 -6.33 -7.5 Turkcell 11.42 -.92 -7.5 CmcBNJ 32.80 -2.52 -7.1 DIARY Ad anr.cd Declined Unchanged Total issues New Highs New Lows Volume 923 2,422 119 3,464 67 62 2,217,227,040 MOST ACTIVE (s1 OR MORE) Name Vol (00) Last Chg SPDR 629190 127.07 -.73 iShRs2000 370060 71.57 -1.06 SP Engy 160903 57.62 +.26 OilSvHT -93343 151.25 -.45 SemiHTr 73681 32.42 -.92 GAINERS (52 OR MORE) Name Last Chg %Chg CD&L 2.90 +.69 +31.2 Tarpon 2.27 +.40 +21.1 InfoSonics 7.06 +1.08 +18.1 TgtLogis n 4.86 +73 +17.7 NA Galv 6.98 +.93 +15.4 LOSERS (52 OR MORE) Name Last Chg %Chg Celsion rs 2.48 -.42 -14.5 VaalcoE 9 PatientSft 2 LGL Grp 7 InvCapHId 3 Advan.:eda Declined Unchanged Total issues New Highs New Lows Volume DIARY 646 74 1,058 22 21 306,175,560 MOST ACTIVE (51 OR MORE) Name Vol (00) Last Chg Nasd100Tr 919864 38.15 -.85 Microsoft 525410 23.35 -.35 Intel 513724 18.75 -.81 SiriusS 363922 4.48 -.13 SunMicro 327201 4.04 -.16 GAINERS ($2 OR MORE) Name Last Chg %Chg BluDolp 5.79 +1.27 +28.1 StrchMb 3.00 +.50 +19.8 AbleEnr 7.70 +1.26 +19.6 Datalink 6.15 +.97 +18.7 Novogen 11.18 +1.69 +17.8 LOSERS (S2 OR MORE) Name Last Chg %Chg TridMic s 15.96 -3.33 -17.3 Atheros 15.63 -2.71 -14.8 Casslnfos 41.26 -5.85 -12.4 Loudeyers 2.37 -.33 -12.2 Stamps.cm 24.41 -3.10 -11.3 DIARY Ar.uanced Declined Unchanged Total issues New Highs New Lows Volume 96.2 2,084 106 3,152 52 55 1,613,120,697 Hier are the 825 tmIst aoulve stocks on thl tNew York SIoc E .*:hang, 7615 most acIke on [he rJa adeq National Morkotl end 116 most acltve on the American Stock EAnhange. Stocks In bold are Worth at least $6 and onanged 5 per..nril oi more In price Undertllng for 50 most active on 1. r'SE and Nasdaq and 25 most aclive on Amex Tables stow name. price and net charge and one to two additional Ileldsa rotled through the week, as tollowvg. DIv: Current annual dividend rate paid on stock, based on latest quarterly or semiannual declaration, unless otherwise footnoted. Name: Stocks appear alphabetically by tie company lull name inol ils abbreviallon) Names consisting ol rmillals appear at Ihe beginning of each letter's Iait. Last: Price StOCk was trading at when exchange closed ior the day. Chg: Loss or gain lot Ihe day. No c:anr ge lrnhicaled by LaEC Stock Footnotes ,:L FE rqaier ihar, 9'9 eiJ lI.w i te e l ci lB f.1 rademplL.nb P r -w ".M- ;rJ .ITIp.nI a tJ.,* H 52..reR l' I, w ,d Lc. Ir, In 1il 2 ,rrs B,: ,-'.,.mpar' ly f irlrIy ii.t-rt "" '. ' ,:,r. i reAn ,:r i .r ,,,-.crge Em lrr,.ng I'amp la'i' f.3iEpr'.rpas'c r .q Divclainds and cuarr, - ing.i Ir CGar,.ai n l ..iirl h . i rt ,ir.aper,ar,- n pI tmI a r iasilda .-:pll .a a E urlji i'; ,11,11 ' ,qjairi ali',n n r.: Y 3 neaI I u- i-i Inels a r Thi 5ir n e57 I'l,.gh and low fl,'ur 'i .1i.1 .-, "il ti.,rn Ihe E g ,I r 'in ,oi o irr. ,iir.l .i Pi aR i er i Le sLo v.i. i. u s pr Pi- o rern !: pf. P Hkli-.Vr .e,' Intlillrreniz :.i purrria pric, q Ciursd-penl mulual ltud n. PE L .icuI'a e.d rl l HigM I It.n y e:urlrt 31 u upL-,Illd pric... .; Sl . has Li, t rP, a ii :120 pr.:enm r.. t- L- ,'.a ,tnlrli the IEs year Mi Tor;ayJ will b.a ealtled wlirn Irse iltck r icueu ad W n n dr, s. r ,7 i lbuled 'M Warrant Sllovinrg a puI rhaJ rr a .-v.kl u Nsa 2aehh r n i Ur, nit, ' nludiiMg 01ore tran Oi"is i r rtCuilly q Company In bankrruplcy ur isouelamrhip, r.r beln -.:v -.i : organized. und.r tihe bankupt,' y law Appears ir. tricn of the arE . Dividend Footnotes: a Eara diidn.ot waie pa' r ul are roi Il.:Iluaed 1b Annual rule ,plt.3 ,:1- c Llqul ailng Io airi n.r a r&A ount Ouila d .ar parl Ir, last 12 months I Currert urinual rate wh., wa in:'reoed by rriuet cens ar daan no ar .uricarnrrilt I Sutr, ol aimisid3 pualeshoer t3ok apit. no regular ralta I Sum ol dilIdeiai paid in'a year I D.o fojt ler. MdrJivideandwasormllteld r. etsrn.d k Declareadorpaid ns yesar, eaiumulative 43 MtLMCd 2AB- 'J leur, wlt, d .dernd in a, area m Currnnt annual rate which was ascreased by most .," ir7 rcant dividends arn.n-un,eamsr p initial divlarna, srnnual ralt nor known yield rnot '" ' hownr r. Declared or ald Inr, prcding rg12 monlhrs plui sit.xi didiland t Paid in sbtok, . apprclai ca alu re Sle figures are unffical.ulonda -ource:The Associated Press. Sales figures are unofficial. I STOCK S OFLOCAL INTERESTED rName DIv YId PE Last uTyT Inc 1.33 .'T.T Inc 1.33 AmSulh 1.04 8'.' lAm 2,00 Bell..i :.uth 1.16 ,.ap rvBk .65 CIir0 1.96 [,rec,. .27 6ec.,.aJi .50 E ....:.rMbl 1.28 FF'L Ip 1.50 FI aol .60 F,.,dti .40 GnErIl-: 1.00 G-r,,t,,ii 1.00 H-,:.mD) .60 Irnl. .40 er.1 1.20 YTD Chg %Cho -.03 +13.9 -.24 +.2 +.06 +5.9 -.06 +33.5 -.28 -11.8 +.04 +1.0 +.05 +25.4 -.23 +.5 +.40 +11.4 -.08 -.8 -1.15 -.3 -.10 -14.4 -.02 -5.0 +.01 +51.5 -.24 -12.2 -.61 -24.9 -.25 -5.4 Name Div YId PE Last Cha %Chg Lowess .20 .7 16 30.41 -.01 -8.8 McDnlds .67 2.0 17 33.76 -.21 4.1 Microsoft .36 1.5 19 23.35 -.35 -10.7 Motorola .20 1.0 11 19.94 -.33 -11.7 Penney .72 1.1 15 67.56 -.45 +21.5 ProgrssEn2.42 5.6 17 43.40 +.10, -1.2 SearsHIdgs ... ... 23 153.40 -3.46 +32.8 SprintNex .10 .5 24 19.89 -.15 -6.1 TimeWarn .20 1.2 23 17.13 -.13 -1.8 UniFirst .15 .5 17 33.08 -1.46. +6.4 VerizonCml.62 4.9 13 33.29 -.26 +10.5 Wachovia 2.04 3.8 13 53.41 -.83 +1.0 WalMart .67 1.4 17 47.02 -.55 ,+.5 Walgrn .26 .6 28 45.11 -.13 .+1.9 52-Week Net % YTD 52-wk High Low Name Last Chg Chg % Chg % Chg I1 670.19 10,156.46 Dow Jones Industrials 11,151.82 -76.20 -.68 +4.05 +8.58 0 13.67 3,473.33 Dow Jones Transportation 4,921.53 -53.38 -1.07 +17.29 +39.77 438.74 378.95 Dow Jones Utilities 415.69 -2.77 -.66 +2.61 +8.49 8.651.74 7,174.95 NYSE Composite 8,163.94 -77.57 -.94 .+5.29 ,+12.58 2046.65 1,469.16 Amex Index 1,938.14 -7.62 -.39 +10.18 +25.10 2 :35.54 2,025.58 Nasdaq Composite 2,153.34 -37.09 -1.69 -2.36 +4.09 I 3,6.70 1,168.20 S&P500 1,270.91 ,-9.28 -.72 +1.81 +6.36 7'84.62 614.76 Russell 2000 719.85 -10.95 -1.50 +6.93 +11.04 137 42.98 11,630.20 DJ Wilshire 5000 12,835.89 -109.21 -.84 +2.54 +7.51 I NEW YORK STO KE C A G Tkr Name Last Chg ABB ABB Ltd 12.63 -.41 ACE ACE Ltd 49.47 -1.12 ACG ACMInco 7.38 -.04 AES AESCorp u18.86 +.26 AFL AFLAC 46.19 -.62 AG AGCO 25,52 -.48 ATG AGL Res 37.92 -25 AKS AKSteel 13.73 -,32 AMR AMR 26,06 +.46 ASA ASA Ltd 63.85 -2,10 T AT&T Inc 27.90 -.03 SBT AT&T2041 24.59 AUO AUOption 13.76 -.58 AXA AXA 32.91 -.37 ABT AbtLab 43,61 +.03 ANF AberFtc 53.87 -1.03 ABY Abiubig 2.77 -.02 ACN Accenture 28.44 -.05 ADX AdamsEx 13,02 +.01 KAR Adesa 21.97 -.52 AAP AdvAutos 29.50 +.03 EYE AdvMOpt 50.70 -.40 AMD AMD 23.90 -.70 ARO Aerapst 29.17 -.17 AET Aetnas 38.91 -.51 ACS AfiCmpS 51.73 -.05 AGR AgereSys 14.67 -.22 A Agilent 31,33 -.53 AEM Agnicog 33.92 -.15 AHO Ahold 8.49 -.17 APD AirProd 63.83 -.80 AAl AirTran 14.72 -23 ACV AlbertoCul 49.06 +.11 ABSp Albrtsnun 25.17 -.05 AL Alcan 45.94 -1.46 ALA Alcatel 12.63 -.19 AA Alcoa 32.84 -.25 AYE AllgEngy 37.65 +.14 ATI AliegTch 68.61 -.72 AGN Allergan 106.66 -1.24 ALE Allete 47.15 -.16 'ADS AlliData 58.81 -1.30 AWF AllWrld2 11.91 -.06 AB AllBern 60.90 -.30 AW AldWaste 11.00 -.19 ALL Allstate 54.80 -.23 AT Alel 63.40' -.85 ALO: Aphama 23.03 -.70 ,MO:.Aia 73.33 -.74 ABV AmBev 41.24 -2.36 DOX Amdocs 36.61 -.15 WJH AT.nul 61.40 +2.61 AtE A.T,.'e 50.62 -.36 AMX AMovilLs 33.95 -1.38 AEP AEP 34.50 -.10 A AXP Art[. 52.50 -1.01,. r AFR AFr. i T 9.91 +.06 AM AGreet 21.65 +.21 AI G AmlntGplf 59.34 -.23 ASD AmStand 42.78 -.66 4R?, AmSIP3 SI i r -.i A T Arr.T..,, i. 1 i ACF ,T, e,: l 2.' - ' APU A,.-r.l;,u :.'rJ I AMP nAlr,'.- r. S.1 -I'O ABC AnmeriBgs 41.18 -.62. ASO AmSoulh 26.27 -.24 APC Anadarks 46.74 -2.01 ADI AnalogDev 31.83 -.67 AU AnglogldA 47.57 -2.03 BUD Anheusr 45.53 -.03 ANN AnnTaylr .u43.66 -.+.59 AOC AonCorp 34.90 -.10 APA Apache 68.72 -.10 AIV Aptlnv 45.28 +58 ABI ApplBlo 32.32 -.52 WTR AquaAms 22,55 -.63 ILA Aquila 4.18 -.11 ACI ArchCs 42.26 -1.16 ADM ArchDan 42.21 -.82 ASN ArchstnSmu51.86 +,01 ARW ArrowE 32.37 -.28 ARM ArvMeit 16.87 -.13 ASH Ashland 66.16 -.73 AEC AsdEstat u12.59 +,07 AIZ Assurant 48.03 -.33 AZN AstraZen 58.90 -1.17 ATO ATMOS 28.24 +.01 AN AutoNatn 21.13 -.55 ADP AutoData 45.35 -.13 AV Avaya 11.27 -.28 AVL Aviall 47.38 AVT Avnet 19.54 -.75 AVP Avon 30.62 -,37 BBT BB&TCp 41.33 -.49 BHP BHPBiIILt 42.36 -1.55 BSG BISYSIf 13.80 -.22 BJS BJSvcss 37.73 -.01 BMC BMCSft 23.67 -.33 BP BPPLC 70.02 -.34 BRT BRT 25.49 -.20 BHI BakrHu 82.75 -.71 BLL BallCp 36.80 -.16 BFT Ba]yTotF 6.58 -.20 BBD BcoBrads 31.40 -1.18 ITU Bncoltaus 29.10 -1.42 BAC BkofAm 48.87 +.06 BK BkNY 32.49 -.32 BN Banta 45.21 -.37 BRL BarrPhm 46.98 .-.79 ABX BarfickG 30.02 -.48 BOL, BauschLlf 48.60 -.35 BAX Baxter 36.91 +.17 BSC BearSt 140.92 -1.90 BZH BeazrHm 44.77 -1.34 BLS BellSouth u36.19 -.06 BLC Belo 15.56 -.31 BER Berkleys 33.92 -.23 BBY BestBuys 53.49 -1.14 BLI BigLots 16.57 -.30 BKH BkHICp 34.11 -.26 BRF BlkFL08 13.99 -.07 HRB Bloc-HRs 23.83 -.11 BBI Blodckbstr 4.91 -.20 BLU BlueChp 5.75 -.02 BA Boeing 80.17 -1.13 BGP Borders 18.98 -.35 SAM BostBeer 29.13 +.15 BXP BostProp 91.26 -.30 BSX BostonSdcid16.19 -.51 BOW Bowatr 22.34 -.25 EAT Brinker 35.81 -.49 BMY BrMySq 25.22 -.24 BC Brunswick 32.34 -.97 BG BungeLt 50.98 +.47 BNI BudrNSF 7-.68 -.64 CA. CAIr I 20.29 -.24 ,CBG ,:(E ii.. 25,.46 +.35 CB. C 5SBrn ,26.74 -.37 :4,C CmE".e .480.01 -,02. Cri CirA 99.20 -.41 CMS CMSEng 13.01 -.17 CSS CSSOInds 28.47 -.20 CSX CSX 70.79 +.22 CVS CVSCp 30.25 -.35 CVC CbIvsnNYs21.73 +.09 ELY CaIGolf 12.60 -.36 CCJ Cameco gs 40.26 -.89 CAM Camerons 47.96 -.63 CPB CampSp u37,70 -.02 CNQ CdnNRsg 56.04 -.23 COF CapOne 84.28 -1,84 CMOpB CapMpfB 12.71 +.01 CAH CardnlHlth 63.60 -.35 CMX CaremkRx 50.09 -.04 CCL Carnival 41.70 -.37 CRS CarpTech 118.16 -1.21 CAT Caterpillar 73.13 -1.64 CX Ceomex 59.16 -1,34 CD Cendant 16.12 -.42 CNP CenterPnt 12.73 +.18 CTX Centex 50,21 -.63 CERp CnlLtpf 83.60 +.45 CTL CntryTel 37.11 -.04 CHB ChmpE 10.43 +.17 CKP Checkpnt 21,66 -.51 CEM Chelmur 9.11 -.27 CHK ChesEno 30.18 -.56 CVX Chevron 63.88 +1.13 CBI ChtcB&l 25.03 +.48 CHS Chicos d26.14 -.84 CB Chubbs 48,98 -.87 XEC Cimarex 42.76 +.24 CBB CinciBell 4.02 -.09 CC CicCity 26.13 -.72 C Citirp 49.01 +.04 CZN CitzComm 12.86 -.35 CLE ClairesStrs 25.32 -.29 CCU ClearChan 31.26 -.08 CLF ClevCiffss 39.14 -.56 COH Coach 28.79 -.70 CCE CocaCE 2024 -.08 KO CocaC 43,02 -.35 CDE Coeur 4.91 -.08 CL ColgPal 59.77 -.11 CMK Collnltn 8.03 +,10 CMA Comerica 52.64 +.08 CBH CmcBNJ 32.80 -2.52 CMC CmdMtIs 24.67 -.27 RIO CVRDs 23.57 -.86 RIlOp CVRDpfs 20.04 -.91 CSC CompSd 52.72 +2.09 CAG ConAgra 22.13 +.04 COP ConocPhil 67.57 +.75 CNX ConsolEs 47.75 +.65 ED. ConEd 44.62 -.31 STZ ConstelA 25.03 -.33 CAL ClAirB 30.16 +,66 CVG Cnvrgys 19.13 -.63 CTB CooperTire 10,93 -.06 GLW Comi 23.50 -99 CGA Consar 16.15 -.89 CFC CntwdFn 37.98 -.60 CVA CovantaH 16.93 -.43 CVH Coventrys 55.52 -.18 CEI CresRE 18.79 -.14 CCI CrwnCstle 34.53 -.50 CCK CrownHold 16.02 .+11 CMI Cummins 119.29 -2.34 CY CypSem 14.28 -20 .DNP DNPSelet. 1O31 03 "DPLi DPL : 94 ..27. ODHI ODRHorton 23.51 -.34 D DT DTE 40.77 -.19. DCX DaimIrC 48.58 -1.07 DHR Danaher 63.89 -1.11 DRI Darden 39.05 -22 DF DeanFds 35.97 -1.12 DE Deere 81.75 -1.76 DLX Deluxe 14.98 -.04 DNR Danburys 31.95 +.06 DVN DevonE 61.54 +.54 DO DiaOBfs 84.96 -.48 DDS Dillards 31.43 -.61 DTV DirecTV 16.67 -.12 DIS Disney 30,07 +.05 DG DollarG d13.84 -.09 D DomRes 75.05 -.58 DRL DoraFinIf 6.32 -.18 DOV Dover 49.53 -.04 DOW DowChm 38.73 -.74 DD DuPont 41.57 -.27 DUK DukeEgy 29.33 -.24 DRE DukeRly 35.27 -.25 DQUpA DuqpfA 35.50 +.50 DOE DuqUght ul9.39 +2.95 DYN Dynegy 5.23 -.17 ET ETrade 23.04 -.41 EMC EMCCo 10.93 -.01 EOG EOGRes 71.63 +.74 EXP EagteMats 44.66 -1.96 EMN EasnChm 53.98 -.48 EK EKodak 23.52 -23 ECL Ecolab 39.91 -.98 EIX Edisonlnt 38.36 -.63 EP ElPasoCp 15.16 +.12 ELNI Elan 16.36 -.33 EDS EDS 24.13 -.27 EMR,'E* risnB 82.83" -123' EDE E oN.: 20.60 -.21. EEP .,E'.rEfr.. 43.58 -.07, ECA EnCana 52.68, -.92 ELE Ehdesa 31.57 -.74 EAS EgyEast 23.96 -.14 ENI Enerses 11.10 -.20 NPO EnPro 33.70 +.19 ESV ENSCO 45.95 -.89 ETR Entergy 71.46 +.01 EQT EqtRess 33.55 -.17 ENN Eqnn 16.68 +.01 EOP 36.69 -.06 EQR EqtyRsd 45,28 -.05 EXC Exelon 57.55 -.38 XOM ExxonMbl 62.55 +.40 FTI FMCTch 69.18 +.63 FPL FPLGrp 41.24 -.08 FIC Falrlsasc 35,33 -.69 FCS FairchldS 17.37 -.35 FDO FamDlr 23.99 -.08 FNM FannieMIf 49.05 +.06 FDX FedExCp 117.17 -1.12 FSS FedSgn 14.71 -.51 FD FedrDSs 36.24 -.62 FGP Ferrellgs 22.15 -.02 FOE Ferrots 15,77 -.14 FNF FRdlNFn 39,.45 -.84 FIS FidNInfo 35.14 -.65 FAF FstAmCp 40.52 -1.70 FDC FRisData 44.59. -.40 FF FstFnFd 16.01' +.01 FHN FslHorizon 39.94 -.42 FFA TrTFid 17.41 -.13 FE FimsEngy u54.18 -.37 FSH FRishSo 72.76 -.92 FRK FaRock 48.90 -1.15 FLR Ruor 9428 -.40 FL FootLockr 24,57 +.01 F FordM 6.61 -.10 FRX ForestLab 38.76. +:38 .FST ForestOs, 33.768 27 PFO Fortinere 70.06 -.54 BEN FrankRes 84,40 -2.82 FRE FredMacI 57.93 +.43 FCX FMCG 56.70 -1.83 FSL Freescale 28.52 -.68 FSLB FreescB 28.77 -.73 FBR FriedBR 11.08 -.31 FTO FrontOls 32.46 -128 FBN FumBrds 20.13 -.65 GMT GATX 41.97 -.93 GAB GabelliET 8.18 -.04 GME GameStp 38.84 -.93 GCI Gannett 55.91 -.14 GPS Gap 17.03 -.21 GDI GardDens 37.02 -.49 GTW Gateway 2.06 -.01 DNA Genentch 83.61 +.79 BGC GnCable 33.64 -1.55 GD GenDyns 64.97 GE GenEec 3331 -02 GIS GenMills 5195 +08 GM GnMotr 2942 +201 GNW Genworth 34.68 .21 .. . . ... ., 1~ HAN Hanson 60.65 HDI HarleyD 54.55 HMY HarmonyG 16.03 HET HarrahE 69.76 HRS HarrisCorp 41.86 HIG HaerfdFn 84.02 HAS Hasbro 18.08 HE HawalElB 27.64 HCN HICrREIT 34.78 HMA HIIMgt 19.79 HR HihctRlty 32.41 HL HedaM 5.27 HNZ Heinz 41.83 OTE HelnTel 10.89 HP HelmPay 60.24 HES Hesss u54.34 .' . . . .. ., t,, .. '"4 -' - ..2 For more information call (352) 26- 480 or visit arhomes.com Premier Builoing Group. Inc- an Independent ITanchise #CGC03831 GGB Gerdaus 14.92 -.53 GLG Gtrdis 38.63 -.92 GSK GlxoSKh 55.56 -.34 GSF GlobalSFe 58.50 +.08 GFI GokFLd 23.15 -.74 GG Gobouoo 31.02 -28 GDW GoViWFn 73.17 -.94 GS GoldnanS 150.95 -1.50 GR Goodrich 40.01 +.46 GT Good r 10.89 -20 GRP. Grantpe 46.35 +.47 GXOP GIPlahEn 27.70 -.21 GMP GPf -33.98 CFF Gnr.'. 26.00 -.34 TV CTeevw 19,59 -.87 GTK Gtech 34.71 +.02 GSH GuangRy 18.50 -.11 HCA HCAkn 43.26 -.06 HAL Halibft 75.18 +.12 JHS HarnJS 13,33 -.04 PDF HanPtDiv 8.05 -.02 PDT HanPtDv2 10.26 -23 THG Hanoverns 47.47 -.60 HPQ HawletP 32.77 +26 HXL Hexcel 1525 -.10 HIW HighwdPlf 36.07 -.12 HLT Hilon 27.75 -.60 HOC HolyCps u48.11 +21 HD HomeD d35.53 -.24 HON HoawItl 39.71 -.31 HPT HospPT 44.06 -.10 HST HostHols u2229 +.22 HOV HovnanE 29.18 -1.00 HUM Humana 54.10 +.27 IBN ICICIBk 23.54 -1.00 RX IMSHith 26.87 -.14 EWZ IShBrazil 38.47 -1.38 EWH IShHK 13.45 -.16 EWJ IShlapan 13.42 -.46 EWY iShKor 44.05 -1.75 EWT iShTaiwan 12.52 -.39 IYT iShDJTr 88.46 -1.06 IWVV iShSP500 127.31 -.79 UH iShSPMid 75,74 -1.26 IYC iShConsSv 60.16 -.56 UK iShMCGIh 75.90 -1.55 UJ iShMCVal 74.16 -1.10 IYR IShREst 72.50 -.04 UR iShSPSml 61.80 -.70 SFI IStar 38.45 +.16 T"T IlTCorps 49.05 -.31 IDA Idacorp 34.13 -.32 ITW ITWs 46.90 -.61 IMN Imatlon 41.01 -.36 N INCO 65.62 -1.39 IR IngerRds 42.32 -.93 IM IngrmM 17.99 -.46 ICE IntcntlExn 57.99 -1.35 IBM IBM 77.77 -.25 ICO IntCoal n 6.84 -.24 IGT IntlGame 37.00 -.24 IP IntPap 32.64 -.02 IRF IntRect 37.02 -1.73 IPG Interpublic d8.12 -.14 IHR IntslHtIs 9.64 -.36 IRM IronMn 37.13 -.48 JLG JLGs 2124 -.40 JPM JPMorqCh 42.41 -.46 JBL Jabil 25.44 -.38 JNS JanusCap 17.63 -.37 JAH Jarden 30.65 +23 JNJ JohnJn 60.04 -.11 JCI JohnsnCI 84.48 +1.68 KBH KBHome 45.37 -.89 KSU KCSouthn 26.48 -.47 KDN Kaydon 36.82 -.58 K Kelogg 48.40 -25 KWD Kellwood 28.89 +.10 KMG KerrMcGs 69.40 -.06 KEY Keycrp 35.40 -.52 KSE KeySpan 40.33 -.17 KMB KImbCIk 61.24 -.54 KMP KIndME 46.19 -.02 KMI KindMorg 100.04 +.05 KG KIngPhrm 16.95 +.02 KGC Kinrossg 10.99 -.51 KEX KrbyCips 39.46 -.79 KSS Kois 59.18 +.73 KEP KoreaEc 18.98 -24 KFT Kraft 31.14 +.09 KKD KrspKrmlf 820 +21 KR Kroger 21.79 -.07 LLL L-3Com 73.95 -1.17 LPL LG Philips 17.10 -1.18 LRT LLERy 2.74 -.07 LSI LSILog 9.00 -.06 LTC LTCPrp 22.06 -.34 LZB LaZBoy 13.45 -.43 LH LabCp 62.00 -.19 LG Ladede 34.34 -.34 LVS LVSands 75.07 -2.08 LEA LearCoip 22.60 +1.11 LM LeggMason 99.09 -2.09 LEG LeggPlat 23.99 -.73 LEH LehmnBrs 65.45 -1.47 LEN LennarA 44.20 -.06 LXK Lexmnark 55.03 -1.75 AS LbtyASG 5.12 -.03 LLY UllyEi 5622 2 ,' LTD Umiled 25.16 -V LNC LincNat 56.05 -.58 LNN Undsay 27.16 -.30 LGF LionsGtg 8.60 +.08 LMT LockhddM 72.92 +.42 LTR Loewss 35.50 -.37 LPX LaPac d21.37 -.56 LOW Lowess 30,41 -.01 LU Lucent 2.38 -.05 LYO Lyondel 23.08 -.17 MTB M&TBk 116.49 -1.98 MDU MDURes 35.94 -.81 WFR MEMCIf 36.61 -1.33 MCR MCR 8.23 +.01 MTG MGIC 64.41 -.85 MGM MGMMir 40.25 -.58 MAD Madeco 8.97 -.02 MGA Magnal g 72.29 +1.39 MHY MgdHi 5.86 -.01 MTW Mantows 44.87 -.02 MAN Manpwl 64.07 -.60 MFC Manulifgs 32.21 +.26 MRO Marathon 84.91 +1.64 MAR MarIntAs 37.55 -.52 MMC MarshM 26.43 -.33 MSO MStewrt 17.19 +.02 MVL MarvelE 20.01 -.33 MAS Masco 29.48 -.06 MEE MasseyEn 36.06 -.77 MA MasterCd n 47.60 +.30 MSC MaterialSci d8.72 -.30 MAT Mattel 16.31 -.30 MKC McCorm 33.56 -.07 MDR McDermls 45.48 -.77 MCD McDnlds 33.76 -.21 MHP McGrwH 51.34 +1.02 MCK McKesson 46.48 -.39 MFE McAfee 23.72 -.65 MHS MedcoHith 57.12 -.30 MRX Medics d23.38 -.64 MDT MedImic d47.05 +.30 MEL MetonFnc 34.27 -.34 MRK Merck 36.69 +.07 MDG MeridGId 30.99 -1.79 MTH Meitage 46.18 -1.49 MER MenillLyn 70.90 -.26 MET MetLife 51.04 -.64 MIK Michaels u42.32 +.11 MU MicronT 15.00 -.40 MAA MedAApt 56.70 -.20 MDS Midas 18.34 -.02 MWY MidwGm 10.65 +1.21 MZ Milacron d1.06 +.05 MIL Miipore 61.49 -.76 MLS MilsCplf 27.32 -.45 MIR Mirantn 26.23 -.61 MTI MitsuUFJ 13.69 -.55 MT MITtalSI 28.29 -1.60 MBT MobileTel 29.55 -.73 MGI MoneyGnm 31.98 -1.02 MON Monsnto 84.40 -.70 MRH Montpelr 17.69 +.39 MCO Moodys 54.93 -.22 MS MorgStan 63.65 -.37 MSF MSEmMkt 23.05 -.77 MOT Motorola 19.94 -.33 MWA MuellerWn 17.52 +.12 MEN MunienhFd 10.33 +.06 MUR MurphO 56.75 +1.02 MYL MylanLab 19.75 -.24 NCR NCR Cp 36.41 -21 NYX NYSEGpn 68.00 -23 NBR Naborss 33.90 -.30 tC NaCity 3-.01 -311 riG NaFuGas 35.34 t-.16 NGG NatGrid 53.80 -.61 NOV NOilVarco 62.55 -.93 NSM NatSemi 23.52 -.42 NAV Navistarif 23.57 -.69 HYB NewAm 2.15 -.01 NEW NwCentFn 45.07 -1.09 NJR NJRscs 46.52 -44 NYB NYCmtyB 16.30 -.40 NWL NeweHRub 25.88 -.48 NFX NewfldExp 48.89 -.82 NEM NewmtM 55.09 -.43 NR NwpkRsif 6.11 -.10 NWS/ANewsCaA 19.00 -.25 NWS NewsCpB 19.93 -.27 NI NiSource 22.03 +.13 GAS Nicor 41.23 -.16 NKE NikeB 80.05 -1.28 NDN 99Cents 10.56 -.03 NE NobleCorp 76.59 +.75 NBL NobleEns 48.50 +.77 NOK NoldaCp 20.04 -.40 JWN Nordstm 35.76 -.71 NSC NorfikSo 53.73 -.02 NT NortelWllt 2.23 -.08 NFB NoFrkBc 29.86 -.44 NU NoestUt 20.89 -.04 NOC NorthropG 63.59 -.74 NVS Novartis 54.06 -.42 NST NSTAR 28.58 -.12 NUE Nucors 54.01 -1.93 NQF NvFL 13.08 +.01 NIO NvIMO 14.07 -.03 OGE OGEEngyu35.53 +.02 OSI OSIRest d33.85 -.67 OXY OcdPet 104.81 +22 011 Oceaneer 46.05 -1.10 ODP OffcDpt 37.50 -25 OMX OfficeMax 40.30 -.40 ORI OldRepubs21.05 -.43 OLN Olin 17.80 -.49 OCR Omncre 46.61 -1.40 OMC Omnicom 8925 -.87 OKE ONEOK 34.08 -.75 OKS ONEOK P 50.15 +.16 OS OreSt 50.77 -.63 OSK Oshkshs 47.02 +.39 PCG PG&ECp 39.58 -.16 PNC PNC 69.91 -.84 PNM PNMRes 26.08 +.06 PKX POSCO 65.04 -1.84 PPG PPG 65.85 -.47 PPL PPLCps 32.52 -.18 PKD ParkDri 7.05 -.07 PSS PayiShoe 26.51 -.58 BTU PeabdyEs 54.92 -1.41 PGH Pengrthg 24.17 +.10 PVR PennVawi 27.81 +.47 JCP Penney 67.56 -.45 PBY PepBoy 11.14 -.40 POM PepcoHold 23.58 -.13 PBG PepsiBott 32.26 -.41 PEP PepsiCo 60.27 PAS PepsiAmer 22.02 -.17 PBT Prmian 15.55 -.04 PBRIA PelrbsA 77.59 -3.19 PBR Perobrs 87.68 -1.93 PFE Pzmer 23.68 +.10 PD PhelpsDs 80.93 -2.74 PHI PhiLD 36.64 +.82 PHG -PhilipsB 5 30.66 -.85 PNY PiedNG 24.86 +.06 PIR Pier 1 6.79 -.23 PPC PigdrimsPr 25,13 -.44 RCS PimcoStrat 10.58 -.04 PXD PioNtri 46.00 -.66 PBI PinyBw 41.09' -51 PXP PlainsEx 41.80 +120 PCL PlumCrk -35.95: '+.08 PPS PostPrp 46.25 +.61 PX Praxair 54.64 +.32 PCP PrecCasts 58.59 -1.01 PDE Prideitl 31.64 .+.19 PFG PrinFnd u56.20 +.10 PG P..:-.'..T. , I 7 PGN Fr:..sa'E. i t3 IC, PGR Pr,-. jCf: i - PLD f.,l-.), 53 -L PHY F..:.: ti-.. 3.15 PVX ProvETg I3:i -.08 PRU fru r'i "r .-1.06 PEG i-EG ).I '-.51 PSD PugetEngy .' i -.17 PHM PudteHs 28967 -.07 PYM PHYMt 6.80 -.02 PGM PIGM 940 -.08 PPT PPrlT 6.02 -.01 NX uanexs- 42.56 -.74 PWR ,QuantaSn c-16.69 -.41 DGX QstDiag u60e31 +.36 STR Questar 80.35 1.34 KWK QksLvRes 36.95 .,-.72 ZQK QuGksilvr 12.03 -.11 Q QweslCm u8.25 +.05 RHD RHDonI 55.18 +.09 RPM RPM.. -18.05 --31 RTI R'[llnlM 55.62 -1.38 RDN RAi ., 61P 13 RSH RPeU,r,1 atla3 16 RAH R n.x,. ti2.: - RRC FL roj.-"F :; -'A RJF aLiR ..e:: ': --" RYN Foee.r.: tn) -05 RTN a,1no.r.,' iu 14 0 Rnc 2229 -.01 RA e 41.34 ;.-.06 RF Re&onsFn 33.18 -.42 RS ReSItA 83.15, .-.50 RRI ReiantEn 11.86 -.04 REP Repsol 28.43 -22 RVI RetailVent 1--0 -.68 REV Revixn .1 i2 -.01 RAD RBleAid 416 -.03 ROK RodiwlAut 72.53 -1.10 ROH RoHaas 4978 -.78 RDC Rowan 36.57 -.12 RDS/A RoyDShAn 67.69 -.19 RVT Royce- ,19.46 '-.04 RI RubyTues 24.27 -.60 R Ryder 56.76 -124 RYL Ryland au. -.94 SCG KAatA .ut4 -41 SKM St7T-r,. ,'64 -.79 SLM SLMC 52.8 ,.10 I NASD55AQ ATON LMA KE Tkr Name Last Chg ACMR ACMoore 15.54 -.68 ADCT ADCTelr 1621 -.60, AMIS AMIS Hd 9.70 -39 ASML ASMLHId 19.83 -.59 ATYT ATllTech 15.45 +.73 ATMI ATMIInc 24.18 -.95 ATSI ATSMed 2.65 +.08 AVII AVIBio 3.68 -.03 ASTM Astrom 1258 +.01 ABAX Abaxus 21.43 -1.25 ABLE AbleEnr 7.70 +126 LEND AccHme 47.07 -.83 ACPW AcPwr 3.58 +.16 ANVI Adclisns 1120 -.49 ACUS Acosphere 3.61 +.06 ACXM Airdom 23.70 -.27 ADPT Adaptec 4.27 -.15 ADZA AdezaBio 13.92 -.10 ADBE AdobeSv 29.86 -.78 ADLR AdoToCp 24.85 -.51 ADTN Adtan 22.30 -.49 ADIC AdvDgItnf 11.81 ADVNA Advanta 32.96 +.33 ADVNB AdvantB 36.35 +.45 AETH Aether 5.83 -.02 AFFX Affymet d25.50 -.53 AIRN AirspaNet 2.23 -.21 AKAM AkamafT u35.39 -129 AKZOY Akzo 53.63 -1.16 AWGI Alderwde 19.48 -.02 ALDA AMile 23.70 -.85 ALEX DAexBld 42.95 -1.40 ALXN Alexion 36.05 -.19 ALKS Alkern 18.70 -.41 AHCI AlldHbicr 3.27 +.16 ALTH AlosThera u3.99 +.40 MDRX Allkots 17.28 -.47 ALTI AlBarNano 3.39 +.31 ALTR AlteraCpIf 17.13 -.36 ATRS Alli. 18.46 +.27 ALVR Alvadon 5,95 -.28 AMZN Amazon 37.11 -1.50 ABMC AmerBos .00 -.00 ABMCW AmrBliowt .11 ACAS AmnCapSt 33.66 -.318 ACLI ACmnclLntn 59,89 -1.94 AEOS AEagleO 33.77 -.64 AMMD AnoerMed 16.82 -.01 APCC APwCnv 19.18 -34 AMGN Amqan 65.49 -30 AMCS Amnicas 2.80 -.07 AMKR AmkorT 9.19 -.76 AMLN Amylin 49.05 -.20 ANAD Anadlgc 6.34 -A7 ANDS AnadysPh 3.19 -.11 ALOG Anlogic 45.37 -.99 ANLY Analysts 2.13 +.03 ANLT AnItSurv 87 +.14 ANDE Andrsonssa 41.99 -.82 ANDW Andrew 8.79 -.39 ADRX AndrxGp 23.25 -.09 ANPI Asgiotchig 11.82 +.26 AAUK AngloAn a 20.30 -.56 APOL ApolboG 50.75 -1.03 AINV Apoolblnv 18,55 +.01 AAPL ApDIeC 57.00 -.95 APPB Appeboes 19,50 -.29 ADSX ApplDigl 1.88 +.04 AINN Apldnov 3.80 -.06 AMAT ApldMal 16.21 -.32 AMCC AMCC 2.59 -.06 AQNT aQuanrive 24,88 -.81 ARDM Aradighms 1.80 +.40 ARNA ArenaPhm 11.03 -.36 ARIA AriadP 4.40 -.05 ARBA Aribalnc 8.01 -.30 ARMHY ArmHId 6.19 -.16 ARRS Aris 12.68 -25 ARTG ArtTech 2.85 -.14 AZPN AspenTc 12.78 -.71 ASBC AsscdBanc 31.01 -.79 ASYT AsystTch 7.10 -.47 ARDI AtRoad SM -.32 ATAR Atarih .51 -.03 AGIX AhllGnc 13.19 +24 ATHR Atherms 15.63 -2.71 ATNI ABTeles 20.04 -28 ATML Amel 5.28 -.05 VOXX Audvox 13.16 +.30 ABTL Autobytel 3.21 +.10 ADSK Autodesk 34.14 -.80 AVNX Avanex 1.71 -.01 AVNR AvanlrPis 7.40 +.33 AVID AvidTch 33.52 -.51 AVCT AvoctCp 25.65 -.63 AWRE Aware 5.60 -.11 ACLS Axcells 5.81 -.19 BEAV BEAero 22.90 -.20 BEAS BEASvs 13.43 -.03 BIDU Baldun 83.99 -1.90 BLDP BallardPw 6.25 +20 BKUNA Bnkltd 30.36 -.47 BOON BeasonP 1.28 -.04 BECN BeacnRfs 22.16 -.53 BBGI Beasleyo d6.78 +.09 BEBE BeheSts 18.00 -.22 BBBY BedBath d32.P60 -.52 BELM BellM*c 5.01 -24 BOCRX Bioyst 14.61 -.12 BIIB Biogenldc 46.28 -.75 BLTI BloLase 7.71 -.66 BMRN BloMardn 14.47 -.03 BMET Bromel 31.17 -.38 BPUR Blpure 1.26 -.02 BLKB Blckoaud 22.03 -.85 BDCO BluDolp 5.79 +1.27 BOSBE BobEvn 28.67 -1.39 BKHM Bookham 3.23 -.07 BAMM BookMill 17.41 +.03 BORL Bodand 5.09 -.09 BEXP BsdgExp 7.85 -.20 CELL Brightpnts 12.94 -.65 BRCM Broadcms 29.85 -.92 BWNG Bradwig 10.20 -.32 BRCD Brcd Cm 6.11 -.03 BRKS BrooksAull 11.55 -.37 BUCY Bucymss 50.11 -.40 BMHC BdTgMats 26.58 -.70 BOBJ BusnObj 27.15 -.42 CCBL C-COR 7.84 +.19 CBRL CBRCLGp 33.99 -.66 CHINA CDCCpA 4.24 -.16 CDWC CDWCorp 52.76 -1.69 CHRW CHRobns 52.75 -2.04 CMGI CMGI 1.14 -.01 CNET CNET .96 -.21 CSGS CSGSys 24.72 -.04 CTCI CTCom u2324 +.24 CTCM CTCMdan 17.45 -.55 CVTX CVThera 13.51 -.25 CDNS Cadence 16.99 -.42 CCBG CapCtyBk 30.25 -.28 CPST CpstnTrb 2.35 -.01 CECO CareerEd 29.59 -23 CLDN Celadons 22.17 -.24 CELG Celgenes 4721 -25 CEGE CelGens 4.81 -29 CTIC CelThera 1.37 -.02 CEDC CentEurs 24.87 -22 CENX CentAl 3725 -1.78 CEPH Cephi 60.90 +.63 CRDN Ceradyne 53.64 +.95 CERN Cemers 36.64 -.36 CERS CenmCp 7.51 +.15 CHIC ChadRsse 23.77 -.94 CHRS ChrmSh 11.08 -.05 CHTR ChalCm 1.18 +.07 CHRT ChalSemi 8.36 -.38 CHTr Chatern 29.96 -.44 CHKP ChkPontl d17.41 -.54 CKFR ChkFree 48.58 -1.47 CAKE Cheesecake 26.56 -.39 PLCE ChildPIc 58.95 -.32 CBAK ChInaBAK n7.54 -.61 CMED ChinaMedn 20.46 +.16 CHRD Chordnt 3.09 -.11 CHDN ChrchlD 36.51 -.91 CIEN CienaCp 4.52 -.01 CINF CinnFIn u47.47 -.19 CTAS Contas 38.91 -.64 CRUS Cimus 7.72 -.42 CSCO Cisco 19.60 -.40 CTXS ComvrSy 39.85 -.44 CLHB CleanH 39.93 -.21 COGT Cogent 15.26 -.08 CTSH CogTech 66.58 -1.87 COGN Cognosgl 28.56 -.35 CWTR ColdwtrCs 26.70 -.30 CMRO Comaero 9.02 -.17 CMCSA Comcast 32.32 -.43 CMCSK Conmcsp 32.21 -.51 CCBI CmrdCapB 15.77 -.01 CBSS CompsB 55.22 -1.07 CCRT CompCrd '36.82 -1.97 CPWR Compuwre 6.69 -.03 COGO ComtchGr 10.89 -.37 CMVT Comversif 19.93 -.13 CCUR ConcCm 2.39 -.14 CNXT Conexant 2.41 -.01 CNMD Conmed 20.86 -.02 CNOT Conneticslf 11.94 -.02 CONR ConorMd 27.95 +.34 CNVR Covera 6.14 -.27 COCO CorinthC 14.27 -.02 CORS ConsBkhs 26,22 -.12 COSI CoslInc 6,81 +.25 COST Costico u5685 -.73 CRAYD Cray Inc mrs u10.98 +.48 CMOS CredSys d3,33 -.17 CREE Creelnc 23.26 -.45 CTRP Ctrlp.com su55.92 +3.14 CBST CubistPh 24.70 -.33 CMLS CumMed 10.49 -.39 CRGN CuraGan 3.48 -.02 CRIS Curis 1.34 +.02 CYBS CybrSrce 11.64 -.19 CYMI Cymer 45,50 -1.27 CYTR CytRx 1,35 +.02 CYTO Cytogen d2.39 -.09 CYTC Cylyc 25.00 -.57 I1 DOOP DOVPh 220 +.19 DROOY DRDGOLD 1.37 -.07 DADE DadeBehs 40.99 -.19 DAKT Daktdmcss 29,03 -1.01 DANKY Danka 1.18 +.03 DECK DeckOut 38.45 -.61 DLIA dELIAsn 8.15 +.13 DELL Delric 2422 -f. DPTR DtaPIr 16.93 -.98 DNDN Dndreon 5.03 +29 DRTE Dendrle 9.00 -.40 DENN Dennys 3.63 -.03 XRAY Detsy 59.79 -.92 DXCM DexCom 13.34 -.45 DRI DigRiver 40.96 -.60 DTAS Digitas 11.17 -41 DIMEZ DimeBewt 24 +.05' DEIC DIrecdEnd11.8 -.93' DISCA DiscHIdAn 14.54 -20 DSCO DiscvLabs 1.95 -.06 DESO sltEnSy 5.21 +.02 DCEL DobsonCm 7.47 -.20 DLTR DlIrTree 26,49 -.48 HILL DotHill 3.36 +.06 DBRN DressBnts 24.77 -.71 DRRP DuredCp d3.82 +.11 BOOM DynMatls 33.37 -1,08 EBAY eav 28.36 -.84 ECIL ECITel 8.13 +.10 EZEM0 EZEM 13.59 +.07 ELNK EhULink 8.40 -.40 DISHI EdchSlar 30.80 -.26 ECLP Edosys 18.65 +.17 EDUC EduDy 7.00 -.17 EGHT 8x8l Inc 1.03 +.04 ESIO, ElectSci 18,0 -.04 EGLS Ectrgls 3.06 -.08 ERTS Eolect 42.81 -.62 EFII EFII 20.30 -.54 EMKR Emcosre 8.91 -1.14 HLTH Enmdon 12.15 -.19 EMIS EmIsTch 8.44 -.29 ENMC EncrMed 6,30 ,. WIRE EncotW 36,11 -.39 ENCY EncyslveP 7.01 +.01 ENDP EndoPhrm 32.57 -.70 ENER EngyConv 36.09 -.61 ENTG Entegrs d9.28 -.32 ENTU Entrust 321 -.08 ENZN EnzonPhar 7.54 EPIC EpIcorSf 10.50 -.31 EPIX EpIxPhar 4.65 +.43 ERICY EricsnTI 32.60 -.39 EEFT Euronet 37.15 -.82 ESLR EvrgrSIr 12.74 -.23 EXPE Fxpedlan 14.68 -.36 EXPD Expdlntos 53.73 -4.65 ESRX ExpScdips 70.91 -1.15 EXTR ExiNetw 4.13 -.09 EZPW Ezcorp u43.33 +.48 FFIV F5NelO 53.58 -.55 FUR FLIURSys 22.25 -58 FSII FSI Inll 7.02 +.05 FARO FaroTchll 16.48 +.64 FAST Fastenals 39.67 -1.42 FICC Fleldlnv d9.02 -.04 FITB .FithThird 36.47 -.63 FILE RlIeNelh 27.93 -.18 FNSR Rnlsar 3.14 -.12 FINL RnUne 11,94 +.09 FRNS FstAvNet 1025 -661 FNFG FstNiagara 13.80 -.16 FMER FstMent 21.42 -.57 FISV Fisev 45.16 -.07 FLEX Ftexn 10.57 -20 FORG ForgnrNw dL55 -.06 FORM FornFac 43.98 -3.06 FWRD ForidA 41.54 -.12 FOSL Fossilnc 17.76 -.39 FWLT FosteWh 42.77 -.83 FDRY Foundy 10.32 -20 FOXH FoxHolw 2920 +1.55 FRNT FmrAitr 721 -.04 FCEL Fuealel 923 -.32 FULT Fu onFnd 16.04 -.09 FMDAY Flmidia 21 -.01 GMKT GMarketn 15256 -.5 GRMN Gariom 104.25 -221 GMST Gemstar 3.41 -.14 GENR Genaera .56 -.01 GLGC GeneLgc 1.32 -.06 GNBT GenBioto 1.80 +.05 GNSS GenesMcr 11.15 -.36 GNTA Genta 1.60 -.05 GNTX GenIex d13.42 -.29 GNVC GenVec 1.39 -.01 GENZ Genzyme 60.42 -.89 GIGM GigaMed 8.60 -.10 GILD GileadSd 58.99 -.27 GEMS Glenayra 2.47 -.14 GLBL Gtbllnd 17.04 +.12 GKIS GoldKm 13,01 -.37 GOOG Goodse 421.46 -1.74 GTRC GularC d43.39 -1.06 GYMB Gymhbee 33,92 -1.46 HEES H EEqn 30.90 +1.01 HMNF HMNFn u35.07 +.08 HANS Hansens u205.35 +7.14 HARS HarbrFL 37.14 -.11 HUIT Harionic 4.56 -03 HELX HalEsn 41.33 +1.45 HSIC HSchbln 46.81 -.41 HRLY Hedleylf 11.80 +.22 HIT Hitite n 40,87 -.01 HOLX Hologlos 48.59 -.92 HOFF HodznOffn 22.18 +74 HOTT HolToplc 11.17 -.21 HCOK HudsClly 13.48 +.04 HGSI HumGen 10.43 -.22 JBHT HuntB 25.52 -.01 HBAN HunlBnk 23.61 -.13 HTCH HuIchT d24.97 -.51 HYGS Hydrgcs 2.48 -.12 HYSL Hyp6ols 28.10 -.76 IACI lAInlers 25.89 -.55 IBAS iSasis n 8.90 +.10 ICOS ICOS 21.68 -.43 IPAS Pass 5.49 -.12 ICON IconlxBr 15.63 -1.01 IDNX Idenllx 7.31 +.09 ILMN IllumIna 30,54 +.06 IMAX Imax Cp 8,83 -.27 IMCL lmclone 39.57 +1.11 IMCO ImpcoTch 10.53 -.42 INCY Incyte 4,57 +,05 IDEV IndevusPh 5.53 -.04 INSP InfoSpc e 22.95 +.38 INFA Informat 12.84 -.65 INFY 'Inflosys 76.75 -1.78 INSM Insmed 1.41 -.13 ISPH InspPhar 4.95 +.20 IIIN Insteels 23.99 -.64 IDTt IntgDv 13.80 -37 INTO Intel 18.75 -.61 ININ Intactlnt u14.91 +.27 IDCC InterDig u35.31 +.17 IMGC Inlmnags 27.02 -21 ISCA IntSpdw 45.78 -.90 ISSX InntSec 18.31 -.77 ISIL Intesnt 22.71 -.77 LSE IntraLase 17.06 -.08 IN1 Intui 60.41 +21 ISRG IntSurg 118.17 +,82 IRN InvFnSv 44.35 -1.33 IVGN Ilthgon 64.45 -1.65 10T1 lonaton 6.37 -54 ISIS Isis 5.893 ISLE KeCap 25.05 -.38 ISON Isonics h .66 IVAN KnghioeEn 2.39 -.10 JCOM jolG~kls u31.43 -.38 JDSU JDS oUni 2.40 -.09 JKHY JackHeony 19.38 -.51 JAKK JkksPac 20,07 +33 JRCC JamesRiv d26.10 -.98 JAMS Jamesnln 2.92 +.02 JBLU JatBluens 11.94 -.37 JOSB JosphBnks 23,68 -.17 JOYG JoyGhIs 51.48 -1.93 JNPR JnplNtw 15.91 -.27 KLAC KLATnc 40.35 -1.34 KNDL Kendle 34.64 -1.36 KERX KeryxB o 14.18 -.66 NITE KnghtCap .15.24 -12 KNOT Knot Inc. 19.77 -1.28 KOMG Konag 45.19 -1.72 KONG KongZhg 8.20 -.49 KOPN KoplnCp 3.50 -.18 KOSP KosPhr 38.08 +.32 KRON Kranos 36.0 -.23 KLIC Kulrcke 7.44 -.16 KYPH Kyphon 38.11 -.64 LKQX LKQCps 18.77 -.92 LYTS LSIInds 185.76 -1.12 LTXX LTX 7.21 -.09 LRCX LamRsch 46.02 -1,24 LAMR LamarAdv 53.86 -.09 LSTR. Ladstar 48.14 -.78 LSCP Lasrisp 30,87 +.01 LSCC Ltifce 5.88 -.21 LAUR Laureate d42.28 -.41 LWSN LawsnSh 6.44 -.32 LBIX LeadBmds U6.13 -.06 LEAP LeapWIrels 45.92 -1.06 LVLT Loven 4.13 -.05 LBTYA UbGLobAs 21.25 -.13 LBTYK UbGbobCn 20,.65 -.10 LINTA UbMIniAn 17,23 -.02 LCAPA UbMCapAnu84,69 +,08 LIFC Ulecell u32.12 +,20 LPNT LilePH 32,08 -.04 LGND UgandPhn d844 +.34 LNCR Uncare 37.67 -.16 LECO UncEl 60.63 +10 LLTC UnearTch d32.58 -.82 LIOX Uonbrdg 5.36 -.14 LNET LodgEnt 18.28 -.48 LOOK LookSmnIrs 3,.48 +.14 FLSH -SysD 2825 -1.04 MCGC MCGCap 15.56 -.53 MGEE MGE 31.05 -23 MOGN MGIPhr 21.45 -18 MGPI MGPIng 23.91 -09 MROI MROSet 19.91 -.79 MRVC MRVCm 2.97 -.10 MTSC MTS 37.94 -120 MVSN Macvsn 21.81 +.01 MPET Magel 1.65 +.08 MNKD MennKd 21.13 -.12 MATK Mamek 29.16 +.03 MRVL MarvelT 41.31 -353 MATR MalecH 21.17 -.91 MTRX MaeixSv 11.76 +23 MTSN Meltson 9.36 -.38 MXIM Mea 31.27 -.98 MXWL Mmaeat 19.54 +.25 MCDTA McDataA. 3.98 -.12 MKTY MechTch 2.36 +,01 MEDI Medlmun" 26.60 -.43 MEDX Medarex 9,28 -.33 MCCC Mediacm 6.31 -.08 MDCI MedAct 23,66 +.16 MENT MenltGr 12.864 -.40 MRBK MercBhsha 35.32 -.66 MRGE MeroeTct 7.50 +.20 MERX MerixCp 1123 -22 MESA MesAir 9.79 -.30 MEOH Melhanx 21.10 -.13 MCRL Micrel 9.58 -.53 MCHP Mrochp 32.41 -1.31 MSCC MtroSea] 23.61 -.90 MSFT- Micrsoftc 23.35 -.35 MSTR MiBIr 96.530 -2.12 MIKR Mlronn u15.79 +1,57 MLNM MillPhar 9,85 -.14 MLHR MillerHer 26.48 -87 MICC MIllllcomInt 5.02 +1.69 MSPD Mindspeed 2.49 -.13 MSON MisonIx 5.25 -.10 MOLX Molex 33.61 -.42 MNST MnstrWw 40.81 -2.29 MOVE Move Inc 5.06 -33 MOVI MovleGal 5,94 -.02 MFLX MultIFnEIc 32.25 -1,44 MGAM MultImGm 9.90 -32 MYOG Myogen 28.65 -1.28 NABI NABIxBo 5.85 -03 NTGR NETgear 20.50 -.52 NGAS NGASRs 8.70 +.63 EGOV NIC Inc 6.48 NIHD NIIHIdgs 56,31 -1.08 NPSP NPSPhm 4.60 -.15 NTI NTLInc 24A47 -.83 NGEN Nonogen 1,80 -.01 Q AP Nasd0Tr 38.15 -.85 NDAQ Nasdaq 29.75 +.27 NSTK Nostech 15.91 +58 NAHC NatAtIH 8.99 +31 BABY NalusMed 10.72 -.26 NAVR Navane 5,15 03 NKTR NektlarTh 17.92 -61 NEOL NeoPharm 5.51 +.19 NWRE Neowar' 12,94 +.13 UEPS NSetlUEPSn25,46 -1,84 NTES Netease a 22.67 -.03 NFLX Netllx 26,64 -.60 NTAP NetwkAp 34.18 -.94 NENG NtwrEng 1.69 -.15 NBIX Neurcne 10.45 -.37 NTMD NiroMed 466 -.08 NOBH NobtyH 27,05 -20 NWEC NoWestCp 33.88 -.38 NTIRS NorTst 5450 -.78 NFLD NthkldLb 10.62 +.61 NVTL NvifWds 10.51 -.34 NVAX Novavax 4.84 -.15 NOVL Novell 648 -26 NVLS Novlus 2423 -.81 NUHC NuHodz 9.84 -.07 NUAN NuanceCm 9.71 -.64 NTRI NuiiSoys 62.40 +.13 NX0 Nudiltln2t 1.65 -.11 NVDA Nvdas 20.63 -.97 ORLY ORelyA 30.33 -127 OSIP S O Phrm 31.35 -1.45 ODSY OdyseyHIt 17.13 -.47 ODFL OpkDomFs 37.83 -.92 OMNI OmniEnr u1226 +.01 OMCL OmnidlA 13,35 -.41 OVTl OmnVisn 20.73 -.49 ASGN Onassgn 9.44 -.20 ONNN OnSmc ,d 5.80 -.01 ORCC OnlineRes 10.41 +.18 ONXX OnyxPh 15.95 -.58 OPTV OpenTV 3.87 -.07 OPWV OpnwvSy 11.47 -.15 OPSW Opswagm 7.60 -.58 OPMR OptmalAg 13,44 +.04 OXPS P= 24220 -4 ORCL Q ae 1457 -24 OSUR OraSure 9.40 -.09 ORCH OrchldCll 2.78 +.08 OFPX Onhlx 39.698 +54 OTTR OtterTael 27.53 -.19 OSTK Overslk 21.52 -.47 PDU PDL Ba o 18.37 Z28 PETC PETCO 20.44 -.34 PFCB PFChng 7.35 -.21 PMCS PMCSre 9.01 -.24 PRGX PRGSchIz .43 -.01 PWEI PW Eagle 28.64 -1.69 PCAR Pachr 81,26 -1,568 PEIX PacElhan 25.45 +,93 PSUN PacSunwr d17,40 -.42 PKTR Packetr 11.50 -.31 PALM Palmlncs 16.41 +.28 PAAS PanASt 18.38 -.11 PANC Panacos 5,52 -.14 PMTC PannTcrs 12.59 -.32 PRXL Parexelh 28.13 -37 PARL Paduxs 9,36 -,34 PTMK Pathmrk 9.24 -.19 PDCO Paerson 34.45 -.22 PTEN PaSLUTI 27.90 .39 PAYX Paychex 38,28 -.70 PGWC PeasusWn 8,50 -.39 PMTR Pemstar u3.97 +.36 PENN PnnNGm 39.09 +.03 PPCO Penwest 21.69 -.07 PPHM Peregrine 1.58 -.06 PRFT PerfidCent 12.35 -.20 PFGC PerFood 30,17 -27 PESI PermFix 2.35 +.17 PRGO Penigo 16.03 -.17 PETS PenMed 11,12 -.35 HAWK Petrohsawk 12.61 -.15 PETD PeslDevlf 37.75 -.91 PETM PetsMarl 25.16 -.49 PPDI PhnmPdis 35,84 +.19 PLAB Pholtrn 14,56 -89 TUTR PlatoLm 579 -.36 PLXS Plexus 32.86 -1.13 PLUG PlugPower 4,76 -.09 PLCM Polycom 21.84 -.43 POOL Pool Corp 45.19 +1.44 PLAY PAiPlay 9.86 +.03 PWAV Powiwav 9.08 -25 POZN Pozen 6.77 -.19 PRST Prestek 9.65 +.19 TROW PriceTRs 3728 -.74 POLN pRiOne l 29.51 -.96 PRVT EteMed 4.34 -.19 PGNX ProgPh 2420 -.06 PSYS Psycdols 28.52 -19 QLTI OLT 7.09 +.06 ONG QaotXng 11.02 -38 OLG Qloelcs 18.94 -.44 QCOM Qua an 38.17 -129 QTWW QuanFuel. 3.55 +.19 QSFT QuestSflw 12.78 -1.40 RCRC RC2 37.19 -1,66 RCNI RCN 24.99 -21 RFMD RFMicO 6.01 -.05 RSAS RSASec 2722 -.02 RACK RackSys 38.86 -1.38 ROIAK ROneD 7.47 -.17 RMB Rembus 2430 +153 GOLD Randgold 21.71 -.39 RNWK RealNwk 10.47 -.08 RHAT RedHat 22.27 -.93 RBAK Redtack 17,37 -.46 REGN Rngenm 12.86 -.36 RCII RentACt 24.03 -1,30 RBNC RepBtp 12.57 -.06 RIMM RschMotn 69.96 -1.45 ROST RosaStis 26.71 -1,02 RGLD RoyGId 28,08 -,87 SONE SlCorp 4,60 -26 SFLK SAFLINKh .37 -.01 SBAC SBACom 24.98 -.15 SEIC SEIlInv 48.12 +94 SIVB SVBFnGp 45,03 -1,01 SAFC Safeco 562)0 -.11 SLXP SalixPhm 12.71 +.18 SNDK SanDsk 48.48 -2,66 SANM Sanmina 4.71 -.13 SNTS Santemis 6.49 -.06 SAPE Saplent 4,86 -.34 SCHL Scholatl 26.14 +01 SCHW Schwab 15.87 -33 SGMS SdGises 35.79 -.11 SEAC SeaChng 7.16 +06 SHLDL SearsHldgs3,40 -3.46 SOUR SecureCmip 8.12 -32 SCSS SelCnmfrts 23.19 -.71 SIGI SelIns 55,02 -1.32 SMTC Soemtechlf 13,85 -.680 SEPR Sepraor 54,92 -1,29 SHPGY Shire 43,30 -.66 SHFL ShutlMsllf 31,67 -.76 SIRF SIRFTch 31,80 -121 SWIR SienaWr 17.64 +A13 SIFY Sily 10.33 +07 SIGM S maDg 9,12 -.43 SIAL SgmAl 71.79 -80 SGTL SqmaTel 4.12 +25 SIMG Silarnmg 10.50 -.35 SLAB SinLab 33.19 -1,33 SSTI SST 402 -.10 SPIL Slaiwam 5.98 -.12 SSRI SivStdg 20.11 -.60 SIMC Simclar ul3.18 +.63 SINA Sina 2521 -,17 SMDI Sienza 12.92 -.60 SIRI SiiusS 4.48 -.13 RNAI StmaThera 5.60 -40 SKYF SkyFnd 2423 +180 SKYW SkyWest 24,85 -.53 0 0SWKS Sk o 5.44 -.04 SMSI SmUro 15.81 -.78 SSCC Smtmitme 10.82 SOHU Somh.cm 2581 -.61 SONC SoricCps 20.95 -.31 SNWL SncWad 928 -.01 SONS Senus 4.87 -.10 SMBC SouMoBc 1425 +1.25 SORC Srcelrntn 11.64 -.34 SPSN SparsmbAnl.03 +.49 STMP StaunpsMcn 24.41 -3.10 SPLS Staples 23,98 -.52 STSI StaOSden 2.57 +.05 SBUX SatmbuIcs 37,56 -.46 STTS STATS Chp 6.28 +.04 STLD STDyna 64.41 -.50 STEM SemCtels 1.94 -02 SRCL Smicydei 664 -20 STRL Sterons 28.90 42.00 STEI StewEnt 5.41 -.32 STXN Sthlex &53 -.06 FUEL StdAe &00 +.50 SUNW SunMict 4,04 -.16 STKL SunOptla 9.95 +7 SPRT Sappo t5 3.77 SUSQ SqBnc 2.70 -54 SWFT SwiTm 33,12 -.50 SOMR Sycamore 3&97 -.13 SYMC Symantec 15.20 -23 SYMM Syialkic 980 -.07 SYNA Synapfics 20,72 -.91 NPS Synopsoys 1.83 -.39 SYNO Symn* 9,61 -.34 SYNM TlCp 5.77 -28 AMT TAmt 15.16 -.32 THQI THQs 21,30 -.54 TIl TII Ntwk 3.22 -.12 TOPT TOPTanks 6.24 -06 TTWO TakeTwo 10.43 -.17 TALK TalkAmer d6.05 -.20 TARO TearPh 10.09 +.31 TASR TASER 8.11 -22 TECD TechDala 37,82 -.74 TGAL Tegal .37, TKLC ThekSec 1186 -.41 TELK Tednic 186.80 +.14 TLAB Tdrabs 12.98 -S50 TRCA Teica 5.21 -.06 TSRA TessoermT 26,91 -58 TEVA TevsPhnm 32,02 -.54 TRBS TexReg 38.12 -.07 TXRH TexRdhsAs 1323 -,61 TSCM Thtree 13.02 +24 THOR Thctao W 138 -.37 COMS 3Com 5.09 -.15 THLD Tisaf Ph 3.42 -.05 TIBX Tcol 6.80 -21 TWTC TWTeie 14.41 -.70 T1VO TiVoInc 7,04 -.83 TOMO TomOnin 18.85 -.55 TSCO TractSupp 53.42 -.48 TMTA Tmsmeta 1.55f -09 TXCC TnSwOe 2.04 -.03 TZO00 Traveloo 33.74 +329 TZ2X TritZelo 1445 -.15 TRiD TddMics 1.96-333 TRB TrimbleN 4509 .-29 TONT Tddini- 4:16 -26 TRLG ".na-Fi.wj. O16 .21 TRMP TrmrpEntn 19.50 -.78 TRST TrslY 10.88 -.18 TRMK Tnruszt 3062 -.44 TUES TuesMm. :d I.12 -09 TFSM 24l71ealM 8.41 M .49 UAUA UALiL :31.05 +.08 UCWO UCBHKD 146.16 -34 PKIX USrCnot 11.808- -30 UTIW UtRinis 2495 -,51 VUTSI UTormg 7.79 -26 UARM U rIAmif l 4291 +.08 UNTO .."nr.. 11.61 -,43 USEG USEnr 422 -.13 UTHR. UtdTp 57.81 -34 UFPI Unfor -63.13", -.96 URBN U,',m 17: ]7K _.,7 LNUX VASfTwr 4.13' +.01 WOOF VCAAM6' 32.06 -.31 VCK Va reCl i15( -5 VSEA VarianSs '1'it; -135t VSGN Vasogerg .46 -.03 VEXP VeloyEx 1.73 +.33 VRSN Veisig 2234 -689 VRTX Vertth 35,56 -1,01 MVSG VtsaeTrs' 1614' +.19 VION VonPtnI 1,34 -.05 VPHM 'VmPhmn 8.41 -.25 VPRT Vissta 25.07' -91 WPPGY WPPGp 59.35 -1.55 WRSNC Wanac 667 -23 'WRES'War ~R eR 4 r +12 WEBX WebEx 35.75 -S49 WEBM webMelh 9.61 -.23 %vKtri v crA-. e iorcv' r) -.80 VeEre wjVn,.-,nti A')., -.36 W IL Wer.iT 21 ); -07 WTSLA WetSeat 463. -22 WPSC WhedlPIt 18.96 -154 WFMI WholteFds .6377 -1.62 OATS' w vbac 19.40 -,87 WIND *rtRrr 8.70 -,381 WDHD Wsodhd 19,16 -04 WRSP WVclSpcn 3.55 +19 WMGI Wti lIM 21.48 -.10 WYNN Wym n 1234 -1.3 XMSR WMSat 1449 -44 XRIT X-Rie 1124 +04 XLNX Xilit 22.31 -. 49 XRTX Xyratex 25.72 -68 YRCW YRCWi 43 *66 YHOO Yahoo 32.47 83 ZBRA ZebraT 32.58 -1.30 ZVXI Z sers ul935+ ,95 ZHNE" Zta..,Tu. r'r ZION Z &oEcp 7., -1,10 ZOLT Zolkek 29,82 -,12 ZRAN Zomn 2179 -252 ZLMZ Zumez u37,94 -06 I V Make "an investment in peace of mind. Arthur Rutenberg Homes The remainder of Ihe NYSE lisi- ings and all the American Slock Exchange listings can be found on the nexi page. . RA IrMT TR.'T-.A%' TI TI V 6 2006 j', S 3-Yr. EatUo Y ( VaneCIC: MTAL3 0LDf 3-Yr, Eaton Vance CI C: SN1aens NAV Chg %Rtn GovICp 7.11 -.01 +1.2 AIM investments A: NaMOI 11.25 -02 +21.4 BasVaAp 3455 '-.28 + 5 Evergreen A: lap ;13.78 -10 4325 Ast5 lp 14.19 -13 +X8.5 G p 24.41 -.36 +29.9 Evergree B: ap 4,31 ,, +28.9 D dBt 13,98 -.05 NS IntGrow 25,41 -.46 +84A4 MuadB 7,33 -.02 +4 MuBp 7.92 -.01 +8.6 Evergreen C: SelEqtyr 18.89 -.19 +40,1 AstIAll 13.75 -.13 +85,6 AIM Investments B: Evergreen I: 1ap vBt 1730 21 +563 CorBd 10.13 -.04 +3 AIM Investor Cl: SIMunll 9.83 -.01 +45.0 Enrgy 45.90 -11+166.8 Excelsior Funds; SummPp 12,29 -.17 +47,0 Enry 2609 -,21+155.9 Utiles 14.66 -12 +693 HiYieldp 4.47 .. +225 Advance Capital 1: VaResr 4833 -.46 +70.2 Baelanc p 17.93 -.14 +24.9 FPA Funds: Belnc 9,45 -.04 +10.3 Nwlnc 10,82 ... +10.6 Alger Funds B: Federated A: SnICap t 5,43, -11 +71.8 AmLdrA 2355, -.16 +32,4 AillanceBem A: MIdGrSIA 34.61 -.50 +55.3 BasanAp 16.64 -08 +26.6 KaufmAp 5.74 -.06 4529 GbTchAp5A.45 -1.22 +23.5 MUSeCA .44 -02 4.9 SmCpGrA25.43 -.46 +83.7 Federated B: AllanceBem Adv: Silric 8.47 -.03 +19.2 LgCpGrAd 19.77 -26 +26.9 Federated Inst : AllanceBern B: Ka uIln 5.74 -.046 +52. CopBdBp11.38 -.05 +10.2 Fidelity Adv FocT: GIbTcn8r 6060 -1.10 +20.7 "HlCarT 22.51 -.09 +23.3 Groiw[r 23 18 -33 +28.5 NatResT. 48.21 -.33+154.4 SCpGr,' r :,! -.39 +50.1 Fidelity Advisor A: ,js.ov6p66E -.02 0.0 DvlntiAr 22.15 -.46 +82.8 AlllanceBem C: Fidelity Advisor I: SCpI -.38 +50.2 vlndn 22.47 -.4 -.4 +84.5 Allianz Funds C: EqGidn 50.52 -.62 +24.6 GwthCt 19.04 -.19 +30.8 Eqlnln 29.50 -.18 +44.2 TargtCt 16.91 -.30 41.5 IntBdln 10.60 -.03 ,6 Am& Century Adv: Fidelity Advisor T: EqGropn23.92 -.18 42,3 BalncT 16.21 -.13 +20.0 Amer Century Inv: DivintTp 21.93 -.45 +81.5 aancedn12 -.09 +25.7 DiGrTp 12316 -.08 +18.6 Eqlncn 8.18 -.02 +37.5 ynCATp 17.03 -.16 +40.5 FLMuBndnlO.46 -.02 +5.7 EqGrTp 4768 -.59 +225 Growhlsin 2030 -20 +26,6 EqlnT 29.11 -17 42.0 Herigen15.74 -23 +63.4 GvnT 9.66 -03 +2.4 I ncGron 30.83 +393 GIrOppT 31.38.-.43 +24.2 ikri nsrn ile 1 -,38+12021 HilnAd1p 9.72 -.02 137.1 inCrioin 1076 -.20+63.1 lnt iT 10.59 -.02 +4,8 LAS r. 102 -.03+24 .67 MJl0Tp 23.64 25 +61.1 NewOpprnn6.45 -.06 +4453 MuncTp 12.85 -03 +9.5 OneChAgnlL,84 -.12 NS O0aeT 20.92 -.38 +71.1 ReaEsln28958 ,.+1032 SFTRT 9.32 -01 +5.2 SSeletn 325.31 -.42 +87 Fidelity Freedom: Ulftan- 28,03, -.37 +16.3 FF2010n 14.03 -.09 +238 UTin 14,03 -.11 +63,1 FF2020n 1472 '-.13 +42 vi6ui r r, 7,10 ,.04 +43.7 FF2030n 15,09 -.15 +39.4 SAmerican FundsA: FF2040 n 8,88 -.09 +43.,0 O.pAp 18.98 -.18 +1.7 FF2015 n 11.59 -08 NS A lAp 27.17 -09 +36.9 Fidelity Invest: 5.p i, 9 -w10 +27.3 AggrGrrn 17.20 -27 +32.7 ,:k.Ap I'-i, -04 +11,9 AMgrn 16,16 -.08 +17.8 CVApWp i81i -15 +17,5 AMgrGrn 1528 -09 +20.5 C ,'iBA 55 32 +46.8 AMgdnn 12.85 -.04 +20,8 C aWi,4Y i8 s -47 +78.7 Balancn 19.22 -15 +42,5 Eu.wAo p 43jQ -70 +86.9 BlueChGrn41,83 -.40 +18,8 Rir,eAp L3 -,25 +86.0 CAMunn 12,10 -.03 +10,3 *0i0Ap 31 M -.24 +50.9 COaenadan 45.78 -.45+107.7 HI Tp I u -. 803 +29.0 CapApn 26.44 -25 +50,0 i..'o[. saB -.08 +41.4 Cplncrn 8.41 -.02 +33.9 '..i n 1319s -02 +4.2 CinaRgn20.99 -.16 +83.8 CAp 32.-68 -20 +42.4 CngSn 415.12 -1.15 +26,8 iExcoAP 25'43 -.28 +46.7 CTMunrn1l.14 -.02 +68.7 iPerAtp 306-A -.42 +63.4 Conhan 65.89 -.77 +60.3 SNwWIA 42.13 -.44+100,7 CnvSon 23.96 -.13 +39.1 .-iSmCpAp.37.91- -.40 +86.0 Deisn 14.42 -.13 +36.4 -TxExAp, 1224. -.02 +10.3 Desilln 12.08 -.07 +26.6 ; 'Wsl3Ap2 321. -.12 +SU .sEqn 23.75 -.22 +43.9 American Funds B: OM' Di n 34.99 -.60 +86.8 B 1 ;91 1I +24.5 Di hn 29.11 -.19 +20.7 -? CpiEl i55. M +43.4 EmN Mkn 19.96 -.42+147.3 SCpKCrb1i0tA -4 +74.5 Eqlncn. 54.47 -.37 +442 SGrthBt 30.63 -24 +47.5 EQIIn 2320 -.10 +35.7 B'ncoBt: 18.88 -08 +383 ECapAp 24.94 -.41 +88.9 C-ABtI .3275 -0 +39.1 Europe 39.13 -.52+111.6 Washt 2.04' -12 +33.1 Exchn 284,97-1.48 +37.7 Ariel Muala Fds: EpsOrtn 21.54 -22 +53.5 A A .-: 45 4 -.48 +31.9 Fieln -32.46 -32 +23.3 Al "54 -.48 .4. Fdyrn 23.60 -25 +32.1 lsan-Funds: F Fliatern9.91 +.01 +14- 3 --- NA FLMurn 11.21 -.03 +9.6 -AK vn 312.7 -. 77 Fdnanen 26.99 -.24 41.3 SMidCpVaI 19.19: +.. l GNMAn 10.47 -.04 +8.5. Baron Funds: Govlnn 9.82 -.04 +4.7 SAsset 59.54 -78 +71.9 GroCon 63.57 -.85 +4.1 CGroert 48.18 -53 +801 Grolron 34.58 -29 +2.6 Si Cap 213 -.33 +4.0 G O lncl 1031 -09 +25.1 !'Eamsteln Fds: l" Hilhrcrn 3.73 ... +27A1 Intl' r NA Indepnn 20.47 -26 +42.4 S 13.78 -02 +55 InB 10.05 -02 +8.4 *MjnivO 23.99 -55 +70.5 IntGovn 9.82 -.03 +3.2 SiMagf 25.98 -54 +70.61 nDiscn 3.928 -.59 +92.5 %BlakRkA: inSCr 1,28 -.751+15?22 SocArA 34.05 -.42 +583 inMun h. 1 1 -.02 +72 YlkvA- 7 .. +294. Japann 17.00 -.51 +82.1 Legacy. 1412 -.13 +29.5 Jp&Smn 14.29 --+44 ,1 LatAmnn 36.48 --1 u. i.).. G v.,p 187. -17+25.0 LO.,wr. 4;Sin7.7 -37 +69.6 Brandywine Fds: .. M r.r. 82 -118 +29.0 r.n.'.3 13 -36 +1 ,MDMurnlO.60 -.02 +7.6 Brinsuon ndsY: M.Aunn 1161 -03 r.95 o.r. _--ll'i- 6 tL ..7.. a. SMI urn r. 110w 03 i+;21- .eJCoeSt eends:' Te' 522 -47 .600 Capyn" 311. -11-1162 MNImn I 19 -(2 *, 2 Ro tn 3F62 +.:,0191 MA g Ir 10.4 -.04 .I cMulin 29.6 -23 +6.4 Mnindn 12,53 -.3 +10.2 CaSAmos Funds: NJMunrn41123 -.03 +.9 SGrrrp31.07 -.22 +349 NwMtrn 14.17 -.035+392 GrswtAp 534 -83 414 NwMln 3725 -.55 +44.0 Gm6ihCt5130 -79 -Z NYMunn 12.48 -.03 +8.7 Calvert Group: OTCn 36.04 -.65 +32.2 A. I lop 1631 -04 +13.8 OhMunn 11.38 -.02 +8.6 InEqAp 22.73 -M5 +.662 COseah 43.76- -.76 +79.4 * M8CAJ A Pcasn 23.28 -.52 +90.3 Mu ir8 1049 -03 PAMunrn10.58 -.02 +8.5 SoalAp 2842 -16 Ma.8 Puitin .1921 -.10 +21.9 ' ..-.SocBap 1143 -041 .14 ReaEn 3528 -.0i+104.7 SocEqAp 35.57 -37 +23.8 S n 10.08 -.01 +4.3 TxFU 10.42 . 7 STBFn" 8.78 -01 +8.0 T* FLp -16823 -.69 +7.7 SmCapnd n21.39-26 +569. T-. .FvT 15.40 -02 +6.1 SmdCpSrn17.97 -.32 +66.0 "Causeway InlU: SEAsian 23.14 -.14+119.1 1.*ai ui rri8t3 -.24 +85.0 SiScn 2525 -23 +27.1 Ui..Cpp. 8p ;5 -.78+19.7 Stratlron 10.30 -.03 +21.8 SCohen&.Steers: Trend n 5822 -.47 +35.6 RVlSfs 8320 +.08+117.7 uSBIn o1055 -.04 +8.5 Columnia Class A: Utilyn 1.10 -.13 +52.1 A,.T.nl 2659 --3 +74.7 ValStratn316 -.32 +84.9 Columbia Class Z: Value n 78.36 -.73 +69.4` AconZ 292% -44 +76.6 Wdwn 20.32 -28 +582 Y. nr..tmZ 3.22 .130.9 Fidelity Selects: DWS AARP Funds: Airn 45.67 -.57 +77.1 SCapGrr 46.69 .-33 +293 Ba4king n36.01 -.39 +33.7 TConsv'. 11.88+ -.0 +22.0 Biolchn 60.48 -.74 +26.0 GNMA 1428 -.07 +6.1 Brokn 67.80 -.97 +702 GCT.nwrrf -51 8,,4 Chemn 66.83 -.54 481.6 G.c.ir.: 167 -:1) .31-5 Compp 33.81 -.59 +16.1 GrCDAOir i93 l 1 .0 A, Conlndn 24.92 -27 +27.1 In'l]n -.1 9i CsIHon 44.14 -.56 +49.2 NTr,3msn ~c -0] 4.i DfAern 75.88 -.74 +88.8 'ial.' i.:.erl7-,)9 *W"' ovCmn 19.49 -.46 +1.6 DWS Scudder Cl A. Electrn 414 -1.10 +29.3 Co.imApi A0. 6, 50u Enrgyn 52.32 -14.,11. [,irA 4: ii -11 .-6i7 EngSvn 74.78 .I'.14,' DWS Scudder Cl S: Enirn 1064 -:J J ,l) :.r.:i..: 15' 0 -04 .;' FRnSvn -" -r -i.IA'. 41 1 s.'T.U, h'. I.1- n ':,s Foodn 53.65 -.38 +44.2 :Et,M,..i -'u -71 .:1: Goldrn 35.12 -2.37 +98.3 EJrE.I 32i I -V: qi .44 Health n 118.95 -.49 +25.9 -.OiB:j. *340 -. -i .A HolnFn 51.53 -.57 +30.3 IrICMr 4133 -61 &2 i IndM n 48.74 -.44+1082 ,.'TB~rr, X..i, -5- 0-' insurn 66,12 -.62 +423 U.M,:,.Pi- ,: -D ,1.41) Leisrn 70.42-1.05 +47.4 ''.u., :_ ':' .i MedDIn 4847 -.33+115.6 H,'.IkT. i -.3 ,:_is MdEqSysn21.90 -.17 +21.5 t. InTxA.T 10.97 -.01 +82 Mulnmdn 44.80 -.43 +29.4 G... InUFdS t{r- -i ,)5 .5! MNGsn 4133 -.17+152.4 -; ,L..i'Gr,"u .491 -.i. ..46 Papern 29.47 -22 +20.4 ,:, L.Ar'.rE4 '*i119 -l "e. i9O Phantn 10.04 -.08 +22.3 t Mi'.liUu,. -.0i ,103 Reialn 48.89 -.70 +46.1 iIAi 1+3' i3 -u- ,,92 Softwrn 53.91 -.84 +26.5 PacOpsr 17.58 -.20+1002 Techn 60.41 -1.22 +22.5 ShITmBdS 9.87 ... +5.0 Telons 41.88 -.45 +444 Davis Funds A: Trans n 52.17 -.59 +8.0 .. ,NYVenA 34.76 -31 +40.1 UGrn 47.76 -,30 +89.1 . DavIs Funds B: Wirelessn 6.29 -.07+10689 , NYVen8 33.22 -.29 +46.5 Fidelity Spartan: ,. Davis Funds C &Y: Eqlilnvnn45.18 -.33 +35.8. NYVenY 35.18 -21 +81.4 5o01nxlnvrn87.96-.63 +35.7 NYVenC.3343 -20, +46.6 Govlnn 10.58 -.03 +5.4 Delaware Invest A: InvGrBd n 10.12 -.03 +7.8 , TrandAp 22.17 -.42 +34.5 Fidelity Spart Adv: TxUSAp 1122 -.02 +11.7 EqldtAdn4O.19 -.22 N8 Delaware Invest B: 5O0Adrn 87.06 -.64 NS .. DelchB. 327 ... +22.7 First Eagle: ,, SelGrilt 22.88 -39 +31.5 GlnA 45.80 -.8 +78.1 , D mensional Fds: OvereasA25.a.1 -.23 893.2 r EmMldV 25.86 -.46+175.6 First Investors A IntSmVa n 19.24 -24+13359 BIChpA p 21.35 -.15 +26.8 ULSLv0,',si ., -24 +8,4 GoiblAp .... NA uSMroniSt. -.18 +.704 GovlAp 10.45 -.04 +5.0 ,-U.uarr,:-.0t -30 4854 GrolnAp 14.27 -.14 +38.1 usmnva S I', -.35 +96.4 IncoAp 2.98 .. +232 r' IriT,Cur, r.l1i -526+118.5 InvGrAp 926 -.03 +423 ET.ri1inr. t 133 '-.49+124.2 MATFAp 11.57 -.02 +5.4 IntVan 19.84 -.35+111.9 MITFAp 12.03 -.03 +4.9 1ruS5v 2540 i +84.9 MIdCpAp 27.75 -.4 +85.3 DFARiEn ai -0' .iliu NJTFAp 12.62 -.03 +5.2 Dodge&Col NYTFAp 14.04 -.04 +4.8 M, .lar,*u 33. -;.u +42.4 PATFAp 12.64 -.03 +5.1 Irma.- 12 -0i3 ,.. SpStAp 21.72 -.26 +49.6. irit*. ]ii7i0 -$8,i.y.8 TxExAp 9.72 -.03 +43 k'* -4.1 :ii -I1 +82 TotRIAp 14.10 -.10 +24.8 Dreylus: ValueBp 7.09 -.06 +48.2 4,."n -1." -- 4 +24.8 Firsthand Funds: D,, 3 55 -L2. +322 GIbTech 3.83 -.08 +4.4 CL',l r"' -'86 +30.8 TechVal 33.91 -.91 +35.2 OrtuJirs 3-T2 -;' +34.1 FranklTemp Frnk A: F.'Ll 41k'. -M) +64`5 AGEAp 2.04 -.01 +31.9 FLirlr 1r7B -731 +4.8 AdjUSpX 8.85 ., +54 irw..Muir, 174 -04 +7.4 ALTFAp 11.25 -.02 +10.0 Dreyfus Founders: AZTFAp 10.82 -.03 +12.2 OromlnBn1ij43 -09 i22 Ballnvp 66.87 -.50 +78.6 G.TnFpnlii0a ii .2; CallnsAp 1241 -.02 +10.5 Dreyfus Premier: CAIntAp 11.27 -.03 +7.8 CoiEQA1 15i3) -05 +19.9 CaITFAp 7.17 -.01 +13.2 C 46rVip 3156 1 +42.5 CapGrA 11.14 -.15 +22.4 LUHtfAp T iI --1 .S54 COTFAp 11.75- -.02 +11.4. *; 'SirValA 1 I0 --7 i576 CTTFAp 10.86 -.02 +10.5 T'MaGCI Id S5 -05 +18.2 CvtScAp 16.41 -.10 +46.0 Tcr,Grc-A 2')2 46 +17.5 DblTFA 11.66 -.03 +11.1 Ealon Vance CI A: DynTchA 24.97 -.39 +28.1 S Crar.aAp 17j -29 +942 EqlncAp 21.10 -.14 +36.8 AMTFMBI10.57 -.04 +15.9 Fedintp 11.14 -.03 +8.8 G. wlhA 7.82 -.12 +34.1 FedTFAp 11.85 -.02 +12.4 InBosA 635 ... +333 FLTFAp 11.67 -.03 +10.5 tA 12.17 -.15 +34,. FoundAlp 12.97 -.09 NS TraZIvA 7.11 -.01 434 GATFAp 11.83 -.03 +10.2 '.' aton Vance CIS: GoldPrMA31.13 -.76+131.7 FLMBt 10.78 -.02 +4.8 GiwlhAp 37.59 -.18 +42.1 HkihSBt 11.21 -.12 +13.0 HYTFAp 10.67 -.03 +19.2 NaUMBt 11.35 -.02 +21.7 IncomAp 2.47 .. +37,3 I HOSToREADTHEMUTALUDTBE Here are the 1,000 biggest mutual funds listed on Naesdq. Tables snow the fund name, sell price or Net Asset Value (NAV) and dally net change, as well as one total return figures follows: Tues: 4-wk total return (%) Wed: 12-mo total return (%) Thu: 3-yr cumulative total return (%j FrI: 5-yr cumulative total return m%) Name: Name of mutual fund and family NAV: Net asset value. Chg: Net change In price of NAV Total return: Perceni change In NAV for the time period shown, with dividends reinvested It period longer than 1 year. return is cumula- tive. Data based on NAVs reported to Upper by 6 p m. Eastern. Footnotes: e Ex-capital gains distribution. I Previous day's quote. n No-load fund. p Fund assets used to pay distribution costs r - Redemption fee or contingent deferred sales load may apply s - Stock dividend or split. I Both p and r x Ex-cash dividend NA - No Information available NE Dala In question. NN Fund does not wish to be tracKed. NS Fund did not exist at start date. Source: Upper, Inc. and The Associated Press InsTFAp 12.05 -.02 +49.6 NYITFp 10,68 -.02 +5.4 LATFAp 11.31 -.03 +10.6 LMGvScA 9.75 -.02 +2.2 MDTFAp 11.48 -.03 +9.9 MATFAp 11.66 -.02 +9.6 M[TFAp 12.00 -.02 +9.1 MNInsA 11.84 -.03 +8.8 MOTFAp 11.98 -.03 +10.5 NJTFAp 11.87 -.02 +11.4 NYInsAp11332 -.02 +4.9 NYTFAp 11.58 -.02 +.9 NCTFAp 12.03 -.02 +11.1 OhiolAp 12.27 -03 +49.5 ORTFAp 11.59 -.02 +11.6 PATFAp 10.19 -.02 +98,6 ReEScAp2269 -.15 +77.7 RisDvAp 33,90 -.32 +34.5 SMCpGrA 37.77 -.64 +46.8 USGovAp 6.25 -02 +5.9 U8lsAp 12.24 -.07 +549 VATFAp 11.59 -.02 +11.5 Frank/Tmp Frnk Adv: IncmeAd 2.46 ... +381 Frank/Temp Fmk B: IncomB1 p 2,47 -.01 +35.2 IncomeBt 2.46 -.01 +334 Frank/ITemp Frnk C: IncomCt 2.48 -01 +35.0 Frank/Temp Mtl A&B: DiscA 27,55 -25 +73.6 QuaIfdAt 20.67 -.16 +58.7 SheA 24,65 -21 +492 Frank/Temp Temp A: DvMklAp 24,55 -.44+123.4 ForgnAp 1337 -.16 +652 GIBdAp 10.70 -.03 +25.7 GrwthA p 2423 -.29 +57.4 IntxEMp 1723 -24 +70.1 WoddAp 18.65 -21 +624 FrankfTempTmp Adv: GrthAv 2427 -29 +58.6 Frank/rTemp Trap B&C: DevMktC 24.02 -.44+119.0 FognCp 13.16 -.15 +841,6 GE Elfun S&S: S&S PM 44.43 -.30 +28.6 GMO Trust III: EmMkr 21.35 -.61+161.1 For 17.19 -.33 +86,9 InUGrEq 3099 -.64 NS GMO Trust IV: CorePlusBd1026-,02 NS Emirtd 21.61 -.61+161.5 nbItiAVI 33.73 -.67 +92,3 GMO Trust VI: EmgMklsr21.62 -.61 +16.1 USCorEq 13.86 -.10 NS Gabell Funds: Asset 44.30 -.46 +51.6 Gartmore Fds D: Bond 927 -.03 +74 GvtBdD 9,91 -.03 +4.8 GrowthD 3.87 -.08 +26.8 NationwD 19.11 -20 +35.1 TxFrr 10.30 -.03 +9.1 Gateway Funds: Gateway 25.2 -.11 +22.3 Goldman Sachs A: GrIncA 27.18 -.12 +48.5 HYMuAp 1125 -.02 +22.9 MdCVAp 36.53 -.35 +72.3 SmCapA 43.10 -.56 +57.5 Goldman Sachs Inst: HYMuni .1125 -.02 24.3 Guardian Funds:, GBGInGrA 1.37 -.32 469.3 ParAA 3459 -22 +23.5 Harbor Funds: Bond 11.30 -.05 +7.5 CapApns 30.47 --,4333.6 Intlr 54.76 -1.09 +99.5 Hartford Fds A: AdFvAp 15.66 -.13 +19.8 CpAppAp36.88 -.46 +71.4 DiIthAp 19.81 -.11 +42.9 SmlCoAp 21.14 -33 +70.9 Hartford HLS IA: Bond 11.12 -.04 +8.1 CpApp 52.52 -.67 .+75 Div&Gr 21.70 -.12 +453 Adveisers 22.50 -.18 +21.4 Stock 49.54 -.55 +31.0 Hartford HLS IB: CapApp p 5220 -.67 +74.6 Hennessy Funds: CorGrow 20.61 -.37 +71.4 CoiGroll 32.08 -.47 +94.1 HollBalFdn15.79 -.07+14.7 Hotchkls & Wiley: LgCpVlAp2328 -.19 +59.0 MidCpVal 28.67 -27--81.6 ISI Funds: NoAmp 7.12 -.03 +5. IXIS Advisor Cl A: TarEqty 10.62 -.07 +592 JPMorgan A Class: MCpValp 24.59 -24 +58.4 JPMorgan Select: nlEqn 734.83 -.67 +72.1 JPMorgan Sel CIs: IntrdAier 125.34 -20 +51.2 Janus : Balanced 22.67 -.14 +272 CortraMdan 15.96 -.10 +86.9 CoreEq 24.38 -21 +464.9 Enterpr 42.56 -.59 +57.6 FedTE 6.87 -.01 +6.1 FLBndn 9.15 -.03 +6.6 Fund 25.59 -.29 +26.8 GIUfeSdrn1g.71 -.17 +40.9 Gnechr 11.48 -.25 +31.7 Grinc 36.14 -.30 +44.3 Mercury 22.39 -28 +31.5 MdCpVal 23.17 -.18 +84.4 Olympus 31.64 -.41 +28.1 Orion 8.91 -.12 +76.0 Ovseas r 37.22 -.42+132.4 ShTmBd 2.86 .. +6.2 Twenty 49.46 -30 +50.7 Ventur 60.15 -.93 +60.1 WddWr 43.45 -.55 +28.5 JennlaonDryden A: BlendA 17.92 -.20 +49.4 HiYIdAp 5.60 ... +26.2 InsuredA 10.53 -.02 +8.0 U1lityA 15.39 -.16+114.2 JennlsonDryden B: GrowlhB 13.75 -.19 +28,5 HiYldBt 5.59 ... +24.4 InsuredB 10.55 -.02 +53 John Hancock A: BondAp 14.41 -.04 +73 ClasslcVlp25.11 -.11 +503 StrlInAp 6.73 -.01 +16.7 John Hancock B: StrlncB 6.73 -.01 +14.3 John Hancock CI1: LSBalanc ... NS LSGrwth NS Julius Baer Funds: IntlEqlr 40.07 -.61+101.0 IntlEqA 39.29 -.59 +99.4 Legg Mason: Fd OpporTrt 16.61 -.24 +41.1 Splnvp 39.01 -.70 +40.8 ValTrp 65,00 -.65 +293 Legg Mason Insti: ValTrlnst 71.92 -.72 +33,2 Legg Mason Ptrs A: AgGrAp 106.88 -1.28 +39.9 ApprAp 14.70 -.11 +32,1 HilncAl 6863 -.01 +25,1 IsAICGAp 13.66 -24 +66,8 *LgCpGAp21.33 -.29 +14.4 Legg Mason Ptrs B: CaplncBt 17.18 -.08 +36.9 LgCpGBt 19.97 -27 +11.9 Legg Mason Ptrs 1: Grdn I 18.93 -.15 +28.1 Longleaf Partners: Partners 33.50 -.37 +39.3 Int 17.93 -21 +83.1 SmCap 27.74 -.18 +54.9 Loomis Saylss: LSBondl 13.63 -.05 +40.3 LordAbbett A: AlilAp 14.75 -.09 +42.9 BdDebAp 7.71 -.02 +21.5 GIIncAp 6.70 -.04 +8.6 MIdCpAp 21.77 -.19 +57.9 MFS Funds A: MITA 18.61 -.13 +34.4 MIGA 12.64 -.13 +20.8 GrOpA 8.67 -.10 +18.8 HilnA 3.75 -.01 +24.8 MFLA 9.92 -.02 +10.0 ToIRA 15.44 -.09 +26.8 ValueA 24.48 -.14 +49.6 MFS Funds B: MIGB 1151 -.12 +18.4 GaScB 9.18 -.03 +1.6 HItnB 3.76 -.01 +22.0 MulnB 8.44 -.02 +9.8 TOlRB 15.44 -.09 +243 MainStay Funds B: CapApBI 28,47 -30 +22.1 ConvBt 14.08 -.09 +27.1 GovtBt 7.98 -.03 +0.4 HYIdBBt 6.18 -.01 4+32.5 IntEqB 14.14 -.10 +57.2 SmCGBp 15.53 -.23 38.5 TolRtBt 18.97 -.13 +22.5 Mairs & Power: Growth 72,55 -.91 +41,9 Managers Funds: SpdEqn 90.31 -1.34 54.6 Marsico Funds: Focus p 18.07 -.15 +374 Matthews Asian: PacTlger 19.95 -.29+111.1 Merrill Lynch A: GIAIAp 17.97 -.13 +55,3 HeathAp 6.43 -,05 +24.0 NJMunBd 10.53 -.03 +13.8 Merrill Lynch B: BalCapBt 125.58 '-.13 +25.4 BaVBI 32,08 -.17 +40.4 BdHiInc 5.05 -.01 +28.7 CalnsMB 11.32 -.02 +7,4 CrBPB t 11.17 -.04 +3,8 CprTBt 11.33 -04 +4.2 EquityDIv 17.16 -.10 +592 EuroBt 17.79 -.28 +782 FocVaVt 13.17 -.07 +42,8 FndlGBt 17,24 -14 +33,6 FLMBt 10.17 -.03 +113 GIAIBt 17.55 -.14 +51.7 HealhBt 4.73 -.04 +21.1 LatABt' 40.14-1.39+2345 LgCCBp 12.93 -.12 +53.5 MnlnBt 7.66 -.02 +7.4 ShTUSG t 8.99 -.01 +2,7 MuShIT 9.88 ... +2.4 MNt9It 10.34 -.02 +11.8 NIMBI 10.52 -.03 +12.4 NYMBt 10,83 -.02 +8.5 NaRsTB t52.41 -.06+147.6 PacBt 24,40 -.42 +84.1 PAMBt 11.08 -.03 +9.5 ValueOpp 12405 -.29 +54.6 USGov 9.74 -.03 +43.4 UtfTf nt 12.69 -.12 +62.5 WIdInBt 5.93 -.06 +242 Merrill Lynch C: GIAbCt 17.01 -.13 +51.8 Merrill Lynch I: BaW apl 26.48 -13 +29.3 BaVIl 0325 -.17 +44,7 BdHInc 5.05 ... +31,7 CalnsMB 11.31 -.02 +9.0 CrBPI1t 11.17 -.04 +62 CplTM 11.33 -.04 +.8 D.oapp 24.16 -.48+126.7 ,EquOv 17.15 -10 +643 Eumlt 20,83 -.33 +83. FocVall 14,62 07 +47.2 FLMI 10.17 -.03 +13.0 GIAIII 18.04 -.14 +56,.5 Hea1hI 7.01 -.06 +245 L.alAI 4220 -1.46+2452 Mnlnl 7.67 -.02 +.9 MnShlT 9.88 ... 35 Mum 10.03 -.01 +6,1 MNau 10.34 -.02 +143 NaRsTrt 56.00 -60+155.4 Pad 26.69 -.46 +89.8 ValueOpp 27.06 -33 +59.4 USGo 9.74 -.04 +5.8 UITlcrl t12.73 -.12 +863 WIdlo 53.94 -.06 +273 Midas Funds: Midas Fd 4.12 -.08+165.8 Monetta Funds: Moneltan 12.45 -.13 +39.0 Morgah Stanley A: ' DivGthA 27.64 -.19 +30.0 Morgan Stanley B:. GTOIvB 14.78 -.13 +493 GCwthB 13.36 -23 +29.8 ShatB 19.65 -.16 +37.6 MorganStsnley Inst: GIValEqAenl8.43-.39 +50.4 IntEqn 21.89 -28 +66.1 Muhlenk 81.41 -.92+56.3 Under Funds A: IntemtA 18.97 -.47 +25.7 Mutual Series: ABeMcnZ 16.05 -.15 .544 DiscZ 27.84 -25 +75.5 GuaoldZ 20.80 -.16 +80.4 SharsesZ 2433 -21 +50.8 Neuberger&Berm Inv: Focus 34.09 -.46 +382 In r 23.60 -.33+121.5 Partner 2827 -.38 +81.9 Neuberger&Berm 1T: Genesis 49.41 -.42 +66.6 Nicholas Group: Hinio In 2.12 ... +24.4 Nichn 57.48 -.51 +35.7 Northern Funds: SmrCpIdxn1129 -.17 +60.5 TelRlyn 11.02 -.18 +18.8 Nuveen Cl R: InMunR 10.57 -.02 49.1 Oak Assoc Fds: WhOSG n30D -.54 +43 Oakmark Funds I: Eqtyncrn25.83 -.12.+37.6 Globaln 25.12 .-26 +72.4 InPirn 25.30 -.32 +685 Oakmnarkrn42.19 -.29 +26.1 Selecirn 33.38 -.30 +28.8 Old Mutual Adv II: Tc&ComZn11.77 -.27 +30.3 Oppenheimer A: AMTFMu 9.96 -.03 +23.6 AMTFrNY 12.72 -.04 +20.3 CAMunAp11.28 -.03 +29.0 CapApAp 42.59 -.51 +26.7 CaplncAp11.95 -.07 +28.9 ChlncAp 9.20 -.02 +24.8 DvMktAp 36.55 -.66+164.7 Discp 45.90 -.71 +27.6 EquityA 10.41 -.12 +342 GlbAp 68.62 -11.02 +74.1 GIbOppA 38.,80 -.30+108.9 Gold p 2960 -.63+150.,7 HiYdAp 9.23 -.01 +25.6 InlBdAp 5.61 -.04 +33.7 UdTmMu 15.66 -.02 +21.8 MnSIFdA 38.34 -.25 +35.7 MIdCapA 18.51 -.32 +4,3.6 PAMunlAp 12.63 -.03 +25.0 StrlnAp 4.07 -.02 +22.6 USGvp 9.19 -.04 +85.3 Oppenheimer B: AMTFMu 9.92 -.03 +20.7 AMTFrNY 12.72 -.04 +17.5 CplncBt 11.82 -.07 +25.6 ChlncBt 9.19 -.02 +22.1 EqutyB 9.95 -.11 +30.6 HiYIdBI 9.08 -.01 +22.6 SdincBI 4.08 -.02 +19.9 Oppenhelm Quest: QBatA 17.78 -.14 +27.7 Oppenheimer Roch: RoMuAp 18.11 -.05 +25.0 RcNtMuA 1235 -.03 +38.0 PIMCO Admin PIMS: ToIRtAd 10.12 -05 +8.8 PIMCO Instl PIMS: AIIAssel 12.31 -.09 +25,8 ComodRR 14.69 -05 +65,9 HiYld 9.51 -.01 +2.5,0 LowDu 9.80 -.02 +4.5 RealRet 10.78 -11 +18.0 RealRInl 10.63 ,-06 +13.3 ToIRt 10.12 -.05 +7.6 PIMCO Funds A: ReaIRIAp 10.63 -06 +11.8 TotRIA 10.12 -.05 +8,1 PIMCO Funds D: , TRtnp 10.12 -.05 +6.5 PhoenlxFunde A: Bolare 14.73 -.09 +21.4 CapGrA 1438 -.18 +12.9 InlA, 1235 -.18 +7626 Pioneer Funds A: 8alanAp 9.79 -.07 +142 BondAp 8,85 -.04 +9.4 EqlncAp 30,83 -.18 +505 EurSelEqA 38.09 -.46 +82.8 GrohAp 12.10 -.16 +10.1 MdCpGrA 14.87 -.18 +27.6 MOCVAp 23.48 -.20 +58,0 PisnFdAp46,04 -32 +42.4 TxFreAp 11.43 -.02 +13,2 ValueAp 18.05 -.14 +41.9 Pioneer Funds B:, Pioneer Funds C: HIYIdCt 10.87 -.06 +213 Price Funds: Balance 19.73 -.14 +31.8 BIChlpn 32.20 -.35 +28,1 CABondn 10.78 -.03 49.4 CapAppn 20.67 -.11 +44.7 DIvGron 23.22 -.18 +34,9 EmEurp 26.27 +28+185.9 Eqlnon 26.92 -.15 +43.1 Eqlndexn 34.11 -.25 +34.8 Europen 18.59 -.37 +68.4 FLIntmn 10.54 -.02 +4,6 GNMAn 9.13 -.03 +5.9 Growth 28.55 -31 +33.7 Gr&Inn 20.53 -.16 +33.0 HthSdcn 24.71 -.22 +41.8 HiYieldn 6,80 ... +26.3 ForEqn 17.94 -.39 +63.6 IntlBoidn 9.42 -.07 +14.5 InIDisn 45.42 -.56+135.3 InoStkn 15.23 -.32 +62.5 Japenn 11.03 -.29+103.1 LatAmn 29.698-1.02+235,8 MDShrdn 6.09 ... +2.9 MDBondn 10,44 -.02 +8.3 MIdCapn 4,352 -.75 +17.7 MCapVal n2439 -.25 +65.2 NAmern 31.24 -.38 +29.3 NAsian 12,18 -.11+105.4 New Era n 46,76 -.42+137.9 N Hoizn 32,07 -.48 +59.3 Nincn 8.63 -.04 +.6 NYBondn11.09 -.02 +8.8 PSInn 15.05 -10 +27.4 RealEstn 22.38 +.01+112.6 Scnecn 18.26 -37 +17.8 ShIBdn 4,63 -01 +4.6 SmCpStkn34.54 -45 ,+892 SmCapValn40.42 -.44 +78.2 SpecGrn 18.73 -22 +51,6 Specnn 11.66 -.04 +1.0 TFIncn 9.78 -.03 +102 TxFrHn 11,83 -.02 +18.8 TFIntmn 10,90 -.02 +5.9 TxFrSIn 527 -.01 +3.8 USTInIn 5.11 -.02 -0.3 USTLgn 1093 -.08 +.0 VABondn 11.39 -.02 +9.0 Valuen 24.59 -.18 +51.7 Putnam Funds A: AmGvAp' 864 -.03 +1.9 AZTE 9.04 -.02 48,5 CIscEqAp 13.44 -.10 +30.7 Cornp 1.05 -.08 +36.7 DiscGr 18.77 -24 431.6 DvrhnAp 9.72 -.02 +21.0 EuEq 25.30 -.45 +76.4 FLTxA 9.00 -.02 +3.4 GeoAp 13.83 -.11 +23.7 GI-vAp 11,92 -.07 +12.3 GEqtp 9.78 -.10 +525 GdnAp 20.17 -.17 +35.8 fthAp 59,66 -.43 +212 HiYdAp 7.84 ..'+29.2 HYAdAp 6.02 ... +31.3 IncmAp U54 -.02 +6.0 IrEqp 21.45 -.47 +67.6 IntGrhnp 14.63 -24 +84.4 InvAp 162 -.16 +40.4 MIFxp 8.03 -.02 +7.8 MNlTxp .83 -.02 +5 NJTxAp 9.04 -.01 +8.6 NwOpAp 45.43 -.61 +36,7 OTCAp 8.298 -11 4+3.0 PATE 89 -.02 +490 TxExAp 8.61 -.02 +10.0 TFhAp 1454 -.04 +7.2 TFHYA 12.86 -02 +17.9 USGvAp 12.69 -.04 +5.7 UtilAp 11.38 -.08 +81.3 VstlAp 10.75 -.16 +52.9 VoyAp 16,57 -25 +16.8 Putnam FundsB: CapAprt 1924 -26 +37.4 OscEqB 13.34 -.10 +27.9 DiscGr 1722 -22 +28.6 DvrinBt 9.64'-.02 +18%3 EqInct 17.30 -.06 +38 EuEq 24,41 -.43 +725 FLTxBt 9.00 -.01 +6.3 GeoBt 17.86 -.10 +21.0 GIhicBt 11.88 -.07 +93.8 GbEqit 8.2 -.09 +49.1 GINtRst 30.10 -.07+129.8 GdnBt 19.88 -.17 +32.77 HihBt 53.58 -.38 +19.5' HIdBI O 7.80 .. +26.4 HYAdBI 5.94 ... +28.3 InomBS 3.49 -.03 +3.7 InGtint 14.36 -23 +803 Inop 13.91 -.21 +70.1 InvBt 12.48 -.15 +37.2 NJTxBA 9.03 -.02 +6.5 NwOpBt 40.58 -.55 +33.7 NwValp 18.2 -.13 +45.1 NYIuBI 3.47 -.02 +6.6 OTCBt 728 -.09 +35.1 TxExBt 8.81 -.02 +7.8 TFHYBt 12.88 -.02 +15.6 TFRnBt 14.56 -.03 5.1 USGvBt. 12.62 -.05 43 UBiBt 11.33 -.07 +47.9 VstaBI 9.33 -.14 +495 VoyBt 14.45 -21 +143 RS Funds: RSNIRsp 36.32 -.42+1622 Value 25.49 -20 +98.0 RiverSource A: DEI 12.85 -.08 +78.6 HiYdTEA 429 -01 +728 LgCpEqp 5.36 -.04+24.2 Royce Funds: LwPiSkSvr 16.91 -21 +66.3 MionCap 17.80 -.09 +82.0 PennMul r 11.35 -.14 +732 PremMer 17.55 -22 +80.2 TotRelr 13.14 -.14 +84.4 Russell Funds S: DkIEqSx 45.98 -.44 +39.5 InllSecS 73,33 -1.28 +77,6 QuanEqSx 38.79 -.37 +35.5 Rydex Advisor: .' OTC0 n 9.91 -.21 +20,8 SEI Portfolios: CoreFxAn 9.98 -.04 +7.0 InTlEqAn 13.38 -.19 +78.4 LgCGroAn19.47 -.20 +26.1 LgCValAn2230 -.11 +50.9 STI Classic: CpAppAp 11.64 -.12 +12.9 CpApCp 10.92 -.11 +11,3 LCpVIEqA 13.82 -.07 +46.9 QuGrSk 122.99 -.23 +14.7 TxSnGdlp 24.69 -.25 +.183 Salomon Brothers: BalancBp 13.05 -.06 +17.5 Oppord 5.10 -.47 +55.8 Schwab Funds: IlOOOnvr 37.25 -.29 +37.5 S&PInv 19.71 -.14 +34.8 S&PSel 19.79 -.14 +35.6 SmCplnv 24.36 -.32 +57.2 YIdPIsSI 9.65 .. +10.0 Selected Funds: AmShD 41,61 -.37 NS AmShS p 41.56 -.36 +47.7 Sellgman Group: FrantrAp 13.30 -.22 43.5 FronOtl 11.59 -.19 +435.5 GIbSmA 17,92 -.20 +87.5 GIbTchA 13,88 -.25 +35.8 HYdBA p 3.25 .... +20.5 Sentinel Group: ComS A p 30.83 -.21 +42.9 Sequoia n154.30-2.73+26.6 Sit Funds: LrgCpGr 37.58 -.30 +38,9 St FarmAssoc: Gwth 52.14 -42 +39.2 Stratton Funds: Dividend 36,80 -.06 +64,4 Multi-Cap 44.45 -.52 +80.6 SmCap 47.20 -.48 +93.8 SunAmerlca Funds: USGvBt 3.95 -.05 +0.7 SunAlserica Focus: FLgCpAp 17.58 -21 +13.5 TCW Funds: SOlEqty] 18.62 -,33 +25.6 TIAA-CREF Funds: BdPlus 9.78 -.04 +5.9 Eqlndex 9,23 -.08 +39.6 Grolam 13.05 -,12 +352 GroEq 9,26 -.13 +21.0 HIYIdBd 8,91 .. +232 IntlEq 13.17 -.21 +84,8 MgdAIo 11.46 -.10 +2123 ShiTrBd 10.18 -.01 +4,2 SocChEq 9,90 -.09 +394 TxExBd 10,46 -.03 +7.8 Tamarack Funds: EntSmCp ... ... NA Value 40.05 -.21 +39.2 Templston Instit: EmMSp 19.94 -.35+125.4 ForEqS 23.72 -.29 +87.6 Third Avenue Fda: Inlir 22.03 -.19+110.2 RIEstVIr 32.12 -.14 +83.8 Value 57.50 -.53 +85.4 Thornburg Fda: IntValAp 25.65 -.28 +91.0 Thrlvent Fds A: H-IYd 4.96 -.01 +26.1 Income 8.30 -.03 +8.6 LgCpStk 26.64 -.18 +25.7 TA IDEX A: JanGrowp25.07 -26 +34.2 0. '. hE * 5., .a. h .q i.e. AM 10 GCGIobp 26.72 -.32 +33.6 TrCHYBp 8.95 -.01 +20.8 TAFIxInp 9.06 -.03 +8.7 Turner Funds: SmlCpGrn26.89 -.61 +57.3 Tweedy Browne: GlobVal 27.68 -.19 +72.8 US Global Investors: AIAmns 27.67 -25 +45.6 GIbRs 17.36 -.18+291.0 GIdShr 15.76 -.17+2012 USChina 8.71 -.06+1173 WdPrcMn 2927 -.32+254.0 USAA Group: AgvGt 30.79 -27 +339 CABd 10.89 -.03 +10.65 CmssStr 26.46 -23 +35.7 GNMA 9.24 -.04 4+5.7 GrTxSSr 1427 -.06 +25.1 GrWlh 1421 -.14 +27.4 GrSInc 18.38 -.18 +35.5 Inctlk 15.80 -.08 +43.7 Inoo 11.78 -04 +7.0 Intl 25.82 -.33 +77.1 NYBd 11.70 -.02 +10,5 PrecMM 2735 -.75+1532 SciTech 1029 -.18 +36.1 ShtTBnd 8.76 -.01 +6A4 SmnCpStIk'14.27 -.14 +83.2 "0E8t 12.89 -.03 +96 TxELT 13.71 -.03 +12.0 TiESh 10.54 -01 +454 VABd 11.34 -.02 +9.4 WIdGr 19.35 -.19 +60.6 Value Line Fd: Lev Gn 23.12 -30 +32.5 Van Kamp Funds A: CATFAp 18.07 -.04 +192 CmslAp 17.81 -.11 +45.8 CpBdAp 6.37 -.03 9.3 EGAp 41.15 -.52 +25.8 EqhBcAp 3.64 -.05 436.4 Echn 383.38-1.85 +362 GinAp 2D.70 -.15 +47.7 HabAp 14.75 -.08 +27. iHYMdA 3.46 23.7 HYMuAp 10.90 -.02 +22.6 onTFAp 18.14 -.03 +9.4 MunlAp 14.45 -.03 +10.4 PATFAp 17.05 -03 +10.0 Sktelnc13.26 -.03 +19a US l.eA13.20 -05 +7.1 UdAp 19.44 -.17 +54.1 Van Kamp Funds B: EGBSt 34.94 -.44 +22 EBlIepBt 11.74 -.16 +19.4 EqhcBt 8,50 -.05 +33.4 HYutBI 1050 -.02 +195 MuAl 1443 -.03 +79 PATFBo 1388 -.03 +7.5 SEiMnlkc 13.25 -03 +17.3 US IW e 13.15 -.04 +4A4 UiB 1939 -.16 +850.7 Vanguard Admiral: CpOpAdn7838 -1.09 +68,7 Enigyn 123.49 -57+176.5 ExiAdmln72.06 -1.16 4542 ExldAnn3558 -.43 65.8 50oAdrEn117.09 -.84 4835 GNMAAdn931 -04 +7.0 lthCrn 58.43 -.48 +43.4 -HYlCpn 6.02 .. +2.3 HIYAdmfnl3.61 -.1 +12.9 ITBdAdrnl9.87 -.05 +4.6 IhGrAdn n7261 -1.54 +79.0 ITAdrdn 13.04 -.03 +72 UdTrAdn 10.61 -01 +45 MCU)Arn8325 -94 +702 fnCamrn70.19 -.74 +56.8 STsyAdrn10.19 -.02 +4A4 ShTrAdn 1550 ... +419 STIMdn 10.42 -.01 +6.8 NSmCAl n31.31 -23 +7.7 Nl'BAdain 9.69 -04 46.1 TS0AdLnn30.73 -25 +41. WeoslAdmn51.02 -.18 +17.6 WeakAfmn5354-M0 +36.7 Whdsorn 59.66 -47 +4&8 WdsilAdn57.51 -28 +81.0 Vanguard Fds: AsstAn 25.87 -.18 435.0 CALTn 11.43 -.03 +9.8 CapOin 33.91 -.47 +66.2 Comirtn 13.88 -.09 8+37.6 DdGmon 12.83 -.07 439.0 Ena en 65.74 -30+176.0 EqTgcn 23.91 -.13 43.8 Exuin 7736 -125 +542 FLLTn 1135 -.02 483 GNMAn 9.91 -.04 6.8 GbkEqn 21.17 -31 +802 Groincn 3220 -24 4+87 GthEqn 1034 -.14+30.7 HYCorpn .02 .- +199 gthCrien138.40-1.13 +43 atlaPmn 11.63 -.05 +11.9 InlExpIn 19.91 -.31+127.1 RnllEGrn 22,80 -.49 +775 IntlValn 3827 -.77 +96.0 TIGraded 9.38 -.04 +5.7 ITTsryn 10.48 -.04 +3.0 LfConn 15.54 -.08 +23.4 UfeGron 21.56 -20 +42.2 Ufelncn 13.33 -.05 +14.6 UlModn 18.68 -.15 +32.4 LTIGrden 8.68 -.06 +8.6 LTsoryn 10,59 -.08 +8.2 Moign 17.85 -.21 439.2 MuHYn 1.61 -.01 +12.7 MulnsLgn 12.32 -.03 +9.3 Mulsnt 13.04 -.03 +7.0 MuLtdn 10.61 -.01 +4,3 MuLongn 10.98 -.03 +8,8 MuShrtn 15,50 ... +4.7 NJLTn 11.51 -.03 +7.9 NYLTn 10.95 -.03 +8.1 OHLTEnl1.71 -.02 +8.6 PALTn 11.06 -.02 4852 PrecMtssrn29.08 -.76+189.8 Pnmcprn 67.56 -.71 +88.1 SelValurn19.34 -.14 +64.6 STARn 19.68 -.16 +34.7 STiGradenlO.42 -.01 +6.5 STFedn 10.14 -.02 +43 StalEqn 23.10 -.27 66.9 TgtRe20l5n11.58-.10 NS TgtRe2025n11.98-.1i1 NS USGron 16.80 -.20 +25.4 USValuen 13.67 -.08 +42.2 Wellslyn 21.08 -.08 +17,3 Welltnn 31.00 -.17 +436.2 Wndsrn 17,68 -.14 +46.3 Wndslln 32.40 -.16 +50.5 Vanguard Idx Fda: 5600 n 117.08 -.85 435.5 Balanced n19.84 -.13 +26.5 EMktn 20.13 -.53+132.4 Europen 31.25 -.47 4+84.5 Extend n 35.94 -.43 +65.2 Growth 27.10 -30 +25.0 TBridn 9,87 -.05 +44 LgCaplxn 22.83 -.17 NS MolCapn 18.34 -.21 +69.7 Pacllfcn 11.54 -.31 +83.4 REITrn 22.35 ... +95,4 SmCapn 30.29 -.38 +87.1 SmIlCpVIn15.66 -.16 +72.6 STBndn 9.75 -.02 +3.9 TotBndOn 9.69 -.04 +5.8 Tolilnlln 15.49 -.31 +88.8 TotSlkn 30.72 -26 +41.2 Value n 23.53 -.10 +82.1 Vanguard Instl Fda: Instldxn 116.16 -,84 +36.0 InsPIn 110.17 -.83 +38.1 TollBdldxn48,94 -.19 '+8.1 InsTStPIus n27,66 -,22 +42.4 MIdCplsin 1840 -.21 +70.5. TBIltn 9.69 -.04 +8.2 TSinsIn 30.73 -,25 +42.0 Victory Funds: DvSSIA 17.18 -.14 +44,4 Waddell & Reed Adv: CortlnvA 6868 -.05 +43.8 Wasatch: SmCpGr 36.38 -.58 +34.5 Welts Funds: Value 36.58 -.37 +30.1 Wells Fargo Adv: CmSikZ 22.91 -.18 +825 Opptylnv 45.61 -.53 +490 Western Asset: CorePlus 10.08 -.05 +11.7 Core 10.84 -.05 +7.6 William Blair N: GrowthN 11.58 -.12 +352 IntlGlhN 26.53 -57 +88.0 Yacktman Funds: Fundp 1520 -.09 +22.1 --W- am an- mm- -w seim e-t -- fmm m anp om -m ri(@ m -m itcmm- SI as s-m- mw asa Si(- ft___ %.amt-m an' ab am -no in~md amm pi- MANW-..No to 0embM-. re~mmwmm mp ligo -..o MMMR seftw -=-a.a M 4 4 $16. 4. t stimmqo esi -qm- ew edea *ft -OP 4 4b Q~bpG.w 1 0 0 _____omew 0 wwwwo ub so m*o*o.4 OthGNIO WSI TES S10 - .sMope am -wn, ees -0O 4=0o Odo -4 o--aso- --* -Qo ML m w 4 S m m4D Dovw qo 0 tl 411W4W0 1*0m w 11" enww amft-fm ON* 0*00' _wIo-n bto e U -. D u N Di O- *-.-D 1 a To 4D 4011" 4bA0AVAON" me ge) ftO mIwiIi1 biII~I =qpSynicaedConentftANOP ty 1INNO SIft a- W J wwmiuwm Sow w 0 SAvailable from Commercial News Providers" jun -. . I *- baw a mm so a rdI - sahi O a 0 pum -O 0-4 00 the m m e 411OVM 0dw0 *f refim l ____ =zwe 4Ummof. - soam% 4 fis.ofd w D-4 maMmm - a ammo tom an- do w NN& wp 0* 0 _ 4 0 MM I M 0 ~~4m Yesterday Pvs Day Australia 1.3504 1.3461 Brazil 2 1955 2 1659 Bnriain 1 8347 1.8416 Canada 1 1110 1.1111 China 7.9955 7.9982 Euro .7854 7814 Honq Kong 7.7722 7.7672 Hunqary 221.30 219.13 India 45920 45920 Indns.a 9115.00 914500 Israel 4 4064 4 4085 Japan 115.71 11468 Jordan 7086 .7086 Malaysia 36485 36600 Mexico 111890 11.0975 Paksian 59.98 59.98 Poland 318 313 Russia 269170 26.8710 SDR .6745 6760 Singapore 1 5859 1.5850 Slovak Rep 30.21 29.99 So Arinca 7 1900 70330 So Korea 94640 944.60 Sweden 72110 771685 Switzerlnd a 1.2316 1.2240 -a.wan 3237 3224 UAE 36728 36706 Bnhish Dound expressed in U S dollars All others show dollar in foreign currer.cy FUTURES Exch Contract Settle Chg Lt Sweet Crude NYMX Aug068 7519 +1.26 Corn CBOT May08 319 -2 Wheat CBOT Dec 08 480 +4 Soybeans CBOT Nov08 675 -31/2 Cattle CME Aug06 86.85 50 Pork Bellies CME Aug 06 9290 -.75 Sugar(world) NVBT Oct06 17.02 40 piange Juice NYBT Sep06 17330 +4 30 SPOT Yesterday Pvs Day Gold (troy oz. spot $627.30 $578.30 Silver troy z. spot) $11 335 510.148 Copper (pound) 3.494b $3 433US NMER = r ,w 'ork Me.,caniie DEcrarn..e CBOT = Cricago Board o Trade CMER = Cr.icago Mercantile Evrnar.ge NCSE = f r* Tore Coionr..Sugar Cocoa Exchange NCTTI lew Yore Cotton Excnarge. Tkr Name Last Chg STM STMicro 15.96 -29 SWY Safeway 25.55 -23 JOE SUoe .45.98 -.87 STJ SUude 31.81 -1.18 STA StPaulTrav 44,47 -.56 SKS SIkss 15.99 -.25 CRM Salesforce 26.13 -.43 EDF SalEMinc2 12.46 -.14 SJT SJuanB 38.70 +.04 SLE SaraLSee 16.17 -.04 SGP SchergI 18.96 -521 SLB Schmbs 64.87 -.48 STX SeagateT 22.75 +.22 SRE SempraEn 45.93 -32 SXT Senslent 20.46 -.36 SGR ShawGp 26.57 -.74 SHU Shurs 63.95 +.54 SID SidlNso 32.13 -.68 SRP SlenPac 13.52 -,15 SLW SivWhtn g 9,68 -.18 SPG SimonProp 84.53 +.49 SIX SIxFlags 5.58 -.10 AOS SrllhAO 46.52 -1.16 SiT Smthlnts 44,80 -.56 SR Soleclm 3.34 -.06 SJI SoJerind 27.41 -.09 SO SouthnCo 32.36 +,07 PCU SthtnCopp 91,34 -1.20 LUV SstA 16.160 +.13 SWN SwnEngys 30.54 -1.01 SOy SovrgnBcp 2.68 +.22 S SrintNox 19.8 -.15 SXI Standex 30.13 +.39 HOT SarwdHtin61,40 -.11 STT SteateSIr 57.48 -.79 STS Stlekse 16.35 +.05 STE Stars 22.93 -.09 GLD sTGold 62.50 +.32 SYK Styker 42,45 -.19 RGR StumiRug 6.12 +12 SPH SubPpne 31.64 -.08 SUI SunCmts 32.95 -.17 SU Suncorg 84.17 +.81 SUN Sunocds 69.03 +.14 STI SunTrst 76.19 -.54 SPN SupEnrgy 32.92 -.61 SWJ SupnaS u 30.42 -.40 SY Sybase 19.80 -17 SN Synovus 26.76 -.23 SYY S o 30.60 +.07 TCB TlFFd 25.77 -.78 BNK TDBknorath 28.80 -.55 TE TECO 15.11 +.06 TSU TIMPartc 28.41 -.98 TJX TJX 22.23 -.39 TXU TXUCpa 59.67 -1.08 TSM Tsai8em l .9 -.30 TLM TallsmEgs 17,97 -.20 TGT Targetl 48.27 -.36 TNE TelNorL. 12.62 -.34 NZT TecNZ 19.70 --.34 TMX TelMexL 20.90 -.75 TPX TempurP 14.40 +.5 TS TeneAsa 39.11 -1.84 THC TeneltHIth d6.53 -.37 TPP Teppco 35.18 -.21 TER Teradyn 13.70 -.54 TRA Term 6.40 -.02 TNH TerraNitro 21,25 -.20 TSO Tesoro 76.03 +.69 TTI TeimTs 30.37 +.11 TXN Texoht 29.92 -.79 TXT TexAo 92M -.42 TGX Theragen 3.47 +.06 TMO "leTnnoEl 36.16 -26 TNB ThmiBel 50.67 -.99 THO Thorind 48.51 -.10 MMM 3MCo 80.55 -.57 TOW Tdw 48.89 -.82 TIF Tifany 32.58 -.62 THI THorlongn 25.55 -20 TWX TimeWam 17.13 -.13 TKR lImken 33.50 -.79 TIE TdenMts 33.12 -157 THE Todco 40.09 +.33 TOD ToddShp 23.12 +,02 TOL TollBros d25.23 -.43 TRU TorhiEn 8.20 -14 TMK TIrhmrk 61.03 -22 TO TorBkeg 52.50 -1.02 TOT Total SAs 85.54 -72 TSS ToSalys 19.08 -.68 RIG Transocn 81.30 +10 TO Tredgar 15,86 -.50 TY TdCong 19.45 -.17 TRB Tribune 32.43 -.10 TRN Tdnsty s 38.84 -.74 TRZ TrizecPr 28,66 -.03 TYC Tycolnti 27.55 -.06 TSN Tyson 14.45 -.40 YSI U-Store-t 18.94 -.23 UIL UILHIdwi 33.94 -.65 LCC USAirwynu53.50 +1,49 USU USEC 11.89 +.09 USG USG 55.91 -,82 SU USTInc 45,84 +1.05 UBB UUnlao 66.49 -2.71 UNF UnlRrst 33.08 -1.46 UN UnilevNVs 22.41 -.28 UNP UnlonPac 92.12 -.11 UIS Unisys 6.36 -.05 UDR UDomR 28.42 +.12 UMC UtdMicao 3.Q5 -.14 UPS UPSB 82.47 -.46 URI UtdRentals 31.12 -52 USB USBmancrp 31,02 -.12 X USSteel 68,84 -136 UTX UldTech 63.85 -,14 UNH UItdhllh -45,11 +.10 UVN Unlvlslon 33.58 -.35 UNM UnumProv 17.68 -.46 VRX VaeeanPh 16,85 -25 VLO ValeroEs 66.48 -.42 VCG VaoCmra 1147 -12 VAR VaanMed 46.77 -.72 WC Vecden 27.19 -24 VTS VedDiGC 52.91 -.23 VZ VaeizonCm 3329 -26 VIAB ViacomBn 35.54 -.62 VSH Vshay 15.67 -48 VC Visteon 7.44 +134 VIV VivoPart 2.31 -.14 VOO Vodafone 21.71 +,04 VG Vonagen d8.27 -33 VNO Vomado U98.80 -.19 VCP Votorantim 15.56 -70 WCI WCICmts 19.17 -.58 WNC Wabash 15.20 -29 WB Wachovia 53.41 -.83 WOR WaddslR 20,06 -.70 WMT WalMart 47.02 -.55 WAG Waigm 45.11 -.13 WLT Welterind 5546 -.45 WMG WamerM h 29.25 -.03 WM WAMutl 4588 -.41 WMI WsteMlnc 3484 -.80 WPI WatsnPh 23.55 -.18 WFT Weaflnts 51.00 -.04 WRI WetnRIt 38,94 +22 WLM Welmn 3.89 +.02 WLP WelPoint 7256 -1.02 WFC WellsFigo 66,88 -.56 WEN Wedys 58,64 +39 WCC Wesco ln 66.60 -1.85 WR WeslarEn 21.91 +.04 WIW WAstTIP2 1125 -06 WDC WDIgi 19.52 -,44 WGR WslnGsRsu59.92 +,04 WON WestwOne 7.58 -.13 WY WayeR 60 ,81 -1.04 WHR Whi 81,90 -,32 WI. Wll gPet 41.56 -,59 WTU W1 15.18 -.12 WMB WmsCos 2339 -,34 WSM WmsSon d3352 -57 WGO Winbgo 3033.55 -.34 WEC WtscE 39.88 71 WOR Wfthgl 21,08 -.66 WWY Wlgleys 4.25 -.26 WYE Wyeth 44,50, +,10 XL XL.Cap 6 81,82 -.21 XLpX XLeCap 7un 2385 -08 Yesterday Pvs Day Prime Rate 8.25 8.00 Discount Rate 6.25 6.00 Federal Funds Rate 5.25 5.0625 Treasuries 3-month 4.90 4.89 6-month 5.12 5.10 5-year 5,18 5.24 10-year 5.22 5.25 30-year 5.27 5.29 AMER5ICAATOCK EXCHANGE Tkr Name Last Chg FAX AbdAsPec 5,94 -.0 AAC Ableaucn .33 AE AdmRso 34.47 -8 ANX Advenbx 3.38 -.0 ALT Alleon d.16 . AMV AmedVest 4.39 +,0: AOB AmOrBo n 5.53 -.1 SIL ApexSllv 15.56 +,2 AGT ApoloGg .48 -.0 BGO BemaGold 5.14 -.0 BMD BIrchMtg 5.05 -.1: BBC Bodisenn 14.29 +.6 BVX BovieMed u7.09 -.5 CDV CD&L 2.90 +.6 CBJ Camblorg 2.78 -.0 CAU CanyonRes 1.07 -.0 CNY CarverBcp 17.30 CEF CFCdag 8.92 +.04 LNG ChenlereEn 37.38 -.4 CGR ClaudoRg 1.34 JCS ComSysilf 10,654 DVW CovadCmn 1.93 DB DBCmdtyn 2577 DIA Aim 111,47 EIV EVInMu2 14.01 EGO EkdorGldg 4.96 ECF FleswthFd 7:89 ERS EmplreRs 16.36 E2M EuroZan 2.57 XPO Express-1 ul.31 FVD FTrVLDv 14.97 FPU RaPUfla 13.03 GAX GalaxyEnh .86 GSX ascoEngy 4.47 GTE GlobeTel .1.14 GSS GoldStrg 2.95 GW GreyWolf 7.62 HEC Harken .68 -.03 HOM HomeSol +.18 ISO ISCOIntl -.12 EWA IShAsia +,35 EWO IShAustria -.20 EWC IShCenada -.72 EWG TShGe29 +.01 E1F IShMe7-T +2805 SLV IShSllern -.07 EEM IShEmMkt +1.12 LQD IShGSCpB +.23 ILF IShSPLA -.06 TLT ISh200TB -.07 IEF ISh7-0ITO +.28 SHY IShl-3TB +,03 EFA ISh EAFE -.07 IWD SR1000\ -.09 IWF IShR16F -,08 IWN IShR2000\ +.01 NWO IShR2000C 6.65 +30 IWM ISM .30 -02 IFO Info 20.63 -.26 INS In 3122 -.3 liP In 23,81 -.18 HHH InMtn 22.72 -.56 KFX KFX 38.00 -1.30 GDX MK 14,55 +,75 MED Meo 93,00 -298 MRM Me 02.24 -65 MDF Metb 36.56 -5,09 MNG Mire 83.24 -34 MPE Mpo 79.68 -29 NGA NA 79.33 -07 NTO NOr .84.48 -1.25 NX N11 72.25 -.71 N No 73.21 -. 01 02 50.21 -.50 OIH ... 72.08 -.92 PRZ Pai 73.40 -1.23 CUP Per e200071,57 -1.06 PPH lonics 7.06 +1.08 POC h 200 -.02 PBW 3 .95 -,06 PHO M 525 -1.36 PZA Inc 1532 -.34 QEE Goldnu39.34 -,85 RKH last 19,49 +,65 RTK mac 9,80 -,05 RTH tss 19 A 6 Hh 2.85 -.01 SA nar 3.78 -.02 SMH ver 1.86 +01 SWB lalv u&98 +93 SEY mg 4,88 -.11 MDY Ma 3.87 404 XLB Gld 13.16 -.46 XLV eeh 1.10 -.01 XLP HT 15125 -45 XLY arelf 2,01 -01 aE. opg 523 +,14 XLF PhmHTr 70.49 -04 PionDrl 15.05 -32 PwSCInEn 19.01 -23 PSWIrn 18.56 -.14 Plena 1,70 +,07 Qnstae .40 +401 f 146.16 -1,17 etechd 4,71 -.11 RelsHT 09.42 -88 Se9bGldgul2,48 +23 SmHI 2 3,42 -92 SmlthWes 8.70 -12 SPDR 127.07 -.73 SP Mid 138.13 -&42 SPMats 3.09 -.39 SPHthC 30.27 -.03 SPCnSt 8413 -20 SPConsumn3313 -.31 SPEnv 57.62 4.26 SPF Fd 32.41 -.31 I EWYRKSTOKECANG TjiuRsDAY, JuLy 6, 2006 9A BUSINESS C C TT Fl) CHRONICLE 0 "Men can do all things if they will." Leon Battista Aiberti or the past decade, county government and resi- dents have declared water quality as the No. 1 priori- ty. However, the unwillingness of both to adequately invest in water quality has seen improve- ments proceed at a snail's pace at the cost of continued degrada- tion of our rivers and lakes. This sad commentary is the root cause of the recurring tur- bulence that has plagued county government efforts to bring cen- tral water and sewer to the Chassahowitzka community's environmentally and politically troubled waters. The most recent turbulence was spawned by the costs that Chassahowitzka residents will have to bear for a central water system. Previously divided about the project, county commission- .ers voted unani- imously to impose a THE I special property tax assessment of Chassah $6,361.88 that has water syst residents reeling. Additionally, OUR OP1 Chassahowitzka Compi residents will have is nee to pay for discon- necting their pri- YOUR OPIN vate wells and hook- chromncleor ing up to the main comment ab water line. Also, Chroncle once the sewer line is in place, they will be faced with a yet-undetermined assess- ment and the cost of closing their septic tanks. This is too burdensome for any resident or community to bear, especially one of the county's poorest communities. Further, the notion that any resident's home could be lost by defaulting on a burdensome water-quality assessment is unacceptable. It's also unacceptable for the long- term health of the Chassahowitzka River and its residents to have the water and sewer project muddied by this most recent turbulence. Accordingly, compromise is needed. With Chassahowitzka resi- dents not entirely responsible for the pollution of the river that led to calls for central water and sewer and water-quality Waiting for light So Now what's wrong with our traffic light system? A good while back, the Chronicle told us of a new automatic traffic light sys- tem that senses cars wait- ing for a green light. Now they seem to be in disre- CALL pair. They just switch from 563 one side to the other 563 whether there's cars there or not. People stand in line wasting their gas while no cars are accessing the roads. Too bad we wasted all:those thousands of dol- lars. Maybe we need some more expertise in the highest echelon. Too much info The New York Times should be prosecuted for endangering the safe- ty of the United States. There is no reason the public needs to know all details of all security plans. What it did was inform the terrorists. That mullet wrapper gets worse every day. improvements benefiting all county residents, county com- missioners need to find a way to ease the financial burden. While Commissioner Gary Bartell's suggestions to extend financing to 20 years, secure a state loan at half the current rate, allow landowners outside the special district to buy in and eliminate the county's surcharge would help, more needs to be done. County commissioners should rethink their aversion to using property taxes for water quality projects, especially given the county's ,33 percent 2005 tax windfall. Also, Commissioner Jim Fowler's suggestion of cap- ping the size of special assess- ments as a means for assuring that no residents are taxed out of their homes should be reconsid- ered. And maybe SSE: it's time to revisit a I E half-cent sales tax owitzka increase for water em costs. quality. Chassahowitzka DINION: residents also need omise to be willing to find d ed. middle ground. A starting point VION: Go to would be to bridle hne.comrn to their misplaced out today's anger at Com- editorial. missioner Bartell and unfair ques- tioning of his motives. As the commission's point, man for water quality, he has diligently striven to save the project and to ease its financial burden by working closely with the coun- ty's legislative delegation to secure funding grants. A decade ago, county residents defeated a half-cent sales tax increase for water quality. Had the tax been approved, many of the improvements would be in place today at far less cost to res- idents. Instead, our rivers and lakes continue to degrade as water quality costs escalate. Every resident should embrace Commissioner Bartell's objec- tive to take care of the environ- ment in this county and leave it as good as we found it. After all, isn't our environment the reason we chose to call Citrus County home?. IUND Short shooter i .4 S).4 If that kid's legs are too short for heir to play pool, then she doesn't belong near the pool table. Some- one was old enough to take p the photo of the girls crawl- ing across the pool table at the Boys & Girls Club. Why 0579 did that person think that 07 would make a great photo? Lack of responsibility and consideration for the equip- ment, because it's free, by parents and supervisors. Stay or go This is in regards to "Summer meetings" in June 26's Sound Off, about these people from up North who are so upset because they're not here for the meetings. Well, if they can afford two homes, then the monies really shouldn't matter. And if they can't, they need to pick a state that they want as theirs and quit complaining. *b-hd m~gd bi wif Tr -.7 0-. -o. 0 - -0 - 0 CITRUS TROUBLED WATERS Water project engulfed in turbulence -lob~- 4bb- Mo- 11 .o -. o - -dubqbgop. -ommmu 0 db a 4 w __w __ -pa aw~ 41- MD. 41so-p. p - - mm- -p-u- 1 - -~ -~ ~ - 40P.- -tl m Gob -w 0 -bm 4 qu- Nft * 40- 40 m- m 140- --Nm 4000 4 dll- mm lp- Ift m- -ma- .- -aw - qm -om dom w dmm Amm aw 4m ____ ft- B --- 0 40 00 p- oe. fmw - O w o AW -IW momm 0 b 4 qm- -p p a4 oe 4d 0 go-O 4o- o mw-np - m b- 1mw ---Go _____ - -. 0 ___ W om 41M - b -- quo 40- _b a .-00- - 41. 4.0- 4- h - 4m -- shp qI 1M -mo obd 19p w-up __ __0 - 4b 40. o .09BN m-qm 4bp a mm.-q --dm a4= P Wtw- 4Mp o om40mn 4__ b mb ___ -p up- "a am = -qm- -100 4101p o __4m lop" sw- fo -m4b -wf -D mmeemmmdoms4 4o -w b dh ws-mfo w- qm- a 4p oboeup- w __ -__goq s 0p 4WSO 4 0 0 4 -OW- =NNW-9--MO- 0- ~- %MW -= bBdf wmml - WANO0 __________ O W 000 P M Wqb -40 4 m opo- mo 4- vmp PEW -msomos m op- ft* -m -dm % w "Ilo RW-= .0 a -.o 4t ap4 40.- -mm mob db 0M qosw 0 wm 4bm- mom*.. Copyrighted Material copAN E w w4apom 41b______ U m- ynaica ea onren 40M ftNo- ib _& fto Available from Com-mercial News Provides" LETTERS ) to Business not closing After the publication of the article about Welch Appliances in the Sunday, July 2, Chronicle regarding the frustration with escalating insurance costs and its impact on our' business, we received many calls of concern, We want to assure all of our valued customers that we have no intention of closing our doors anytime soon. As with past struggles,. we, along with many other small Citrus County busi- nesses, are doing our best to work through the problems of rising over- head costs. It's with heartfelt desire and deter- mination that we plan to serve the needs of Citrus County for many years to come, and want to extend our appreciation to all of our dedicated customers who have expressed con- cern for our situation. Our family feels truly blessed to be living in such a wonderful community that still cares so deeply about its neighbors and businesses. If you have any questions, please feel to give me a call at 726-1911. Lori McKettrick Secretary/ Treasurer, Welch Cabinets & Appliances, Inc. Flying the flag I see the Senate has again failed to pass a flag desecration amendment; a OPINIONS INVITEDicleonuine.com. wise move on their part, even if they don't realize it. As I understand the amendment, all it does is allow the legislative branch to make laws ban- ning the desecration of the flag. If this amendment passed and became part of the Constitution, from then on they would have to spend all their time drafting laws to define what an illegal use of the flag is. First, they must define what an the Editor -.. .. .. American flag is. Can a American flag be made by slave labor in Communist China? Is that-Amertian?, Is it permissible to burn that Communist rag to protest China's policies? Is a plastic representation a flag? How about a picture? If President Bush can sign his name to a flag, can I put a peace sym- bol on one? Will the law say that only presidents can write on the flag? Or presidents and New York firefight- ers? Or president, New York firefight- ers and USO celebrities? And the list goes on... Perhaps an American flag is what the Chronicle showed so well in the June 26 issue on page 15A, as a slob- ber rag for a Newfoundland dog. Granted, it is a statue and the rag is not itself a flag, but it's composed of many small flags. Is each little flag a separate infraction? Is a do-rag, cloth- ing patch, flip-flops or a country and western shirt the proper use of the flag of the United States of America? If our senators ever even thought about this issue, they would see that there are more problems with this amendment than the desecration of the Constitution is worth. In this instance, desecration of the Constitution is a far greater offense then supposed desecration of 'th flag. Oscar R. Fick Jr.. IOA THURSDAY JULY 6, 2006 __ - - - - - - - - p ~ - ~- - -~ _____ - ~ m hi t( r m e IN n1 ib CITRUS COUNTY (FL) CHRONICLE . "Copyrighted Material .Syndicated Content la froi m ea Ner Providars" Available from Commercial News Providers Ampq ,TP, . .n ....... m w ,mp. Mm, , Citrus County Welcomes Metabolic Weight Loss! Come Join our Open House on Thursday, July 6 10 am- 6 pm Citrus Hills Lodge/ Best Western 350 W. Norvell Bryant H oy, Hernando I Am Living Proof that Metabolic Works! I've Lost 52 Ibs. mEa3BOLiC RESEARCH CENTER Call for a reservation Today! (352) 237-8787 Come .ui m in (he t (i ls i i lls edgew Ieletr n on thursdaii all For A Reservation & Receive1 LS2500 Off Enrollment 9 Dr. Hiremath Care for kids You have trusted me with your children's health care for several years and I look forward to continuing to care for them for many years to come. A CITRUS COUNTY OFFICE WILL BE OPENING WITHIN THE NEXT FEW MONTHS. 4p p PA ......... .. .. Uday Hiremath. MD Board Certified Pediatrics 11707 N. Williams St. Suite 1 Dunnellon 352-746-3338 ,/. LI 1*1 S.So Nide to Come Hom-ITo Frorn vtrdowlovwdi heatmeri.i.- .:.. : finiture to floor covrinos .. Wdo itdli . Experts hcecorc smcAtons S'| ' for.a,,ecr..anta.r':. .. .. i $ 00OFF INTERIORS by Decoratina Der' 564-9001 M m,=t Act now to register your 11 to 13 year old child for this medicniy accurate program that teaches babysiners how to handle emergencies %hen caring tbr youngerr children. Call Marketing & Public Relations at 795.8344 for details. Enrollment is limited to 12 students. Call today! Saturday, August 19 s .EN 1 RI S 9f_'lIl N Sundvasi t llld 9 a.m. to 4 p.nm. ,,, Ri,,r, F, ;.-28 www v.'.srTc .com The Five Star Edition of the Carrier Infinity' System is the world's first self- monitoring residential air conditioning system. Designed and programmed to run a daily diagnostic check, it actually adjusts itself to maintain maximum efficiency. Get a $600 rebate when you call Bay Area, ; I----)t-i your Carrier Factory Authorized Dealer and Ask About replace your old air conditioner with a new, two-speed Five Star Edition of the Infinity-m HYH[RIM EPA r System plus Purone and the best limited warranties* in the business. Includes Aeroseal duct sealing of your ductwork with up to $600 off the regular price. This offer is goly available through Bay Area and only good through August 31, 2006. Smart air conditioner. Smart deal. AIR CONDITIONING A & HEATING AERDtt .r Certified Duct Sealing 100% Satisfaction Guaranteed 25 % Minimum Cooling & Heating Cost Savings 10 Year Factory Parts & Labor Guarantee 10 Year Rust Through Guarantee 10 Year Lightning Protection Guarantee 30 Times More Moisture Removal Citrus 795.- 20 ,:D L Marion 489 - rLevy 447 - Hernando 688 - 4WM~IK1 kr~r~osIa~~y & t i~Q~i ttW~dI~tbfl I. ttatbwL ~ii~ ~pa4~ve*tM ~ ~ato~i5 - DANO'S NANOSNAN The world's first Nano-digital Hearing Aid intercepts noise and eliminates squealing (feedback). Dan Gardner Inc. Audiology Clinic 700 SE 5th Ave. Crystal River S795m5377 I I r4oft --------------- I TufumDAY, jux.y 6, 2006 IIA 1T IAOrNicjT .. :h - i"i - 0 % All- IIL- -A. Here 12A THURSDAY " JULY 6, 2006 " ww chronicleonline com Nat ion orldt A y' 4~fr$g~ ~ wants uanwIIern6 Ut: S S- 4- -.M. ___ to doe am as am Mexico ..- - -- aV w AAW do f 0* * . a . Fna Laydied a"N LAY4 AHno 4at "Copyrighted Material Syndicated Content a Available from Commercial News =... .i. S:u. .iiiiiilpf ** ..*,:" = -iip SS n* ... gpuK IIII." -- .. :: .: p :::m . .::. :m::-.... ::. .m :. :EE. a S .... .. .. ...: m lil. ... i..:mi ..... *:E *. l l h i .:.. *it .- J ullu- ... ** : :.,m -I. .... : .jj~~f::m: ...-:. . emmam mh af t 0 mea* t ISM a *il ea a t hilman e1 e w o ..... ... . * (i0 *:" o fl efl a o--- t4 mw S:: ml. rI : : ::...: ..h..r SI a A vi.ders" a qwe- -mf .a W .. n.. ::: NW .ow -- A. def iwa -. ', ft..... g. 4l::. *-ul i : : .:. , C ....."lt ia ,gi" " i--- --.. .,*Ki -4-1- .ige. ad nI I||I Wa mm. a O1 amoiMmI l4m* do& ag a a alwo0 a ~ m e IIaII S wmm V d a -m o agitmomgo a4mm -m a S @ eb .... .. .Amrra Uw nm dd lmIdAk mA thl hnvr tk- I -he A _ rw^^ 46pw^ .... *.. " .... ,l.aF:" N . ac. a MW osmme 4mul m 0m a.. S llll Mae* e ow * !-- VHI alu 4. o oo 4 '...' ,, I * Si t,4 *, *~~ J'~~#6?E .7 4 t . /4 Rays-Red Sox Crawford has a big night. PAGE 2B &M H R .S [# AV JULY 6, 2006 wWv r,"rorir :]i.I.i.lhr, L.:,IT| 0IIII~mp" *lb awme 4 amlgo No mnao - in- ,u' -- Cupfi t-- "*: U . "Copyrighted Material Syndicated Content Available from Commercial News Providers .'- ... =.. U- "^^* ^ ^ T . .^^^^^ m r- LA^iiI^ -K,1 w AR - - ,*%oom*40 4 ow:ow...m * ,,b -G U 4 4b MW.k- S- P. m w Ab-w -IN HIAP & 0 aff 4-:. ---. k-. -k qw M:.0. *-4. G. 4*-N QW -M am:a 41P - Late surge lifts Inverness CATHY KAPULKA/Chmnicd Crystal River's Dallas Baldner is safe at home as Inverness catcher Ryan Dolan, left, and pitcher Brandon Brooks, right, try to make a play in the top of the first inning. 9-10 year-old ANDY MARKS amarks@chronicleonline.com Chronicle As the sun went down, the Inverness bats heated up. Wednesday at Central Ridge Park, the Inverness 9- 10 baseball All-Stars erupted for eight runs in their final two innings to score an 11-7 win over Crystal River that clinched the Pool B title. Inverness (3-0) advances to the Friday's District 15 Championship game against Greater Hudson (2-1), which beat West Hernando 4-1 Wednesday to edge Central team explodes in Citrus (2-1) and Dunnellon (2- 1) in a tie-breaker at the top of Pool A. Inverness had to overcome a sluggish start. Walks and errors were wholly responsi- ble for a three-run, first- inning rally for Crystal River, but Inverness answered with three runs of its own in the bottom of the frame. Ryan Dolan's two-run single was the biggest blow, while Dylan Bender also singled in a run. From there, Inverness pitcher Brandon Brooks caught fire. His team's first 10 defensive outs all came by strikeout and he finished 11-7 victory over Crystal River with a complete-game three- hitter and 13 whiffs. After Kyle Kidd's RBI single in the top of the second gave Crystal River a 4-3 lead, Brooks spanned the next four full innings without allowing a run. And the Inverness offense rallied behind him. "Our bats just came alive," manager James Brooks said. "These kids never gave up." Inverness exploded for four runs in the third inning, on run scoring hits from Bender and Tyler Beagan and a two-run double from Cody Bogart, and again in the fifth with Hunter McPherson's two-run double leading the way 9-10 Softball Dunnellon 7, Inverness 1 Tiara Thomas singled, doubled and scored three times and Lily Parrish pitched a no-hitter with eight strikeouts as Dunnellon's 9- 10 All-Stars cruised past Inverness to claim the Pool B title. Inverness (2-0) now faces Pool A winner Crystal River (2-0) at 6.30 p.m. Friday foi the District 15 title. Please see SUiL.GEPage 3B Fast start is good enough Inverness senior softball tops Kennedy Park JON-MICHAEL SORACCHI jmsoracchi@chronicleonline.com Chronicle The Inverness senior soft- ball team was forced to wait .Wednesday. night ..for their opponents to arrive to Whispering Pines. After the game got underway nearly 20 minutes past the original starting time, Inverness jumped on Kennedy Park, scoring all the runs they would need in the first two innings en route to a 12-5 win. The win gives Inverness a 3- 0 record in the District 15 all- star tournament and knocked KennedyPark to 2-1. With Crystal. Kennedy Park ..Rive. having given juniors - up more than 'battle 40 runs in its rness first three PAGE2B Inverness owns the tiebreaker after giving up just five over the same frame. Inverness controls its own: destiny and can seal the District 15 tournament by beat- ing Shady Hills when the two teams face each other at 8 tonight "Everything was perfect for the first two innings," said Inverness manager Gwen Martone. Ashley Smith went 2-for-3 with a double, triple and two; RBIs while Jen Baum had a two-rimun double and pitched Lwo solid innings of relief. Brittany Eldridge picked up Please see SOFrTBALL/Page 3B Ftdr sutim, inM Wmbkm Am WrmI "Copyrighted Material Syndicated Content Available from Commercial News Providers" S, .. ,.... .. 'j-. .-S BR NE" '*::i888E- t~ .rt,.s, S cSXCiA=Co Y (FL)JC C JUL ,,, l ll- AL( (rawford dazks RI win ~, ~, 9 - - a-... , * ~ a aO: . -* *.. "a., ** - ONION..' , 'In - *- i.. : w" -Wm .' n - ,'Copyrighted Material Syndicated Content .~ w .,. ...,.. .- - Mob.-a Available from Commercial News Providers" NLt U u h qw bafttlk hratk m in uuhut ~~Mo. a .i~in - id ---- S ........... 11"A w1 . iII1 e Bmlb .~ ..*~4 1: .. -. ~, ~-, - ". '". *m. .*.rn W"1' crystal River overtakes Inverness, 10-6 r Dytnven0s C.J. RISAK Sicjrisak@chronicleonline.com Chronicle i" Things looked good for 'i nerness, at least for a couple of innings. But in the third, it 9l11 started to come apart. '37 Leading 3-0 and seemingly in Zgontrol after two, Inverness allowed Crystal River to take corn mand in the third, supple- gmenting its rally with two errors and two walks, all lead- ihg to a five-run surge that ulti- mately took Crystal River to a 10-6 triumph in the deciding game in Pool B District 15 Junior Baseball at Bicentennial Park " Crystal River now advances to the championship game, meeting Pool A winner Dunnellon at 6:30 p.m. Friday at Central Ridge Park. f "These guys are always com- ing back," said Crystal River coach Rufus Miniard. "They never get down. And we're a fast team, we're going to run -the bases." -' Crystal River showed its aggressive tendencies on the basepaths in the third inning, which started with a pair of walks. With runners on first ,ind .hii rd. an errant throw to first allowed both to score, making it a 3-2 game. Alton Pierce's single scored the tying run, and another error on Corey Rabold's grounder plat- ed the go-ahead run. Cody Ewing, who had relieved Rabold on the mound in the second inning, followed with a run-scoring double, making it 5-3. Inverness would never catch up. Mathew Malik singled in two runs in the first and Thomas Hibbard singled in another in the second to pro- vide the 3-0 lead, and Inverness got another run in the fourth without the benefit of a hit when Scotty Roush walked (Robert Laflamme ran for him). A stolen base and wild pitch moved him to third and Matt Archambault's ground out scored him. But Crystal River wasn't through. Ewing's second dou- ble of the game put runners at second and third with no one out and a throwing error scored both, making it 7-4. Crystal River scored three more in the seventh, errors and base running again playing a key role, and then withstood a late Inverness rally. Hibbard's second run-scoring hit deliv- ered the first and an error brought in the second, but with the bases loaded a runner was picked off third and two fly outs ended the threat. Ewing pitched the final 5 1/3 innings for the pitching win, allowing three runs (two earned). Major Baseball Crystal River 7, Greater Hudson 1 Crystal River uncovered its long- ball attack and it was more than enough to claim the win over Greater Hudson and force a tie at the top of Pool C. Hudson, Crystal River and Inverness are all 2-1, forcing a tiebreaker to see who advances to the championship. Crystal River struck for four runs in the first, a ground out scoring the first and a solo homer by Donnie Dewees plating the sec- ond. Ross Obstfeld clubbed a two- run homer in the second to make it 6-0; he would finish with three hits in the game. Tyler Humphreys was the win- ning pitcher. Dunnellon 5, Lady Lake 4 Dunnellon gave up the go-ahead 'run in the top of the sixth, then scored twice in the bottom of the seventh to escape with the win and earn a 1-1 split in Pool B. A single by Daniel DiBernardino and a walk to Dillon Wiggins set the table in the bottom of the sixth for Davin Sanders, who followed with a one-out double that scored .both. Dillan DeWitt got the pitching win in relief. Major Softball South Sumter 14, Inverness 13 Inverness scored eight runs in the first inning, but it wasn't enough as South Sumter rallied to get the win in Pool A. South Sumter scored two in the first and six more in the second to make it a 9-8 game; it was tied at 10-10 entering the sixth, when Inverness struck for three runs. South Sumter rallied, however, pushing across four runs of its own in the bottom of the seventh. In other Major Softball, Central Citrus rolled past Shady Hills 17- 2. Junior Softball Inverness 8, Central Citrus/Crystal River 6 A three-run comeback in the seventh inning allowed Inverness to upend Central Citrus/Crystal River., Rae.Richie, Amanda Budd and Kayla Helt scored runs in the deci- sive seventh inning to give CR/CC the triumph. MLB SCOREBOARD Boston New York Toronto Baltimore Tampa Bay Detroit Chicago Minnesota Cleveland Kansas City Oakland Texas Seattle Los Angeles New York Philadelphia Florida Atlanta Washington St. Louis Cincinnati Houston Milwaukee Chicago Pittsburgh AMERICAN LEAGUE East Division W L Pct GB L10, 50 32 .610 -, z-6-4 47 35 .573 3 5-5 47 37 .560 4 6-4 39 47 .453 13 4-6 38 47 .44713% 5-5 Central Division W L Pct GB L10 57 28 .671 z-7-3 55 29 .655 1% 6-4 46 36 .561 9% z-9-1 39 44 .470 17 6-4 28 54 .341 27% z-6-4 West Division W L Pct GB L10 44 40 .524 z-4-6 43 42 .506 1%2 3-7 42 43 .494 2% z-6-4 39 44 .470 4% z-6-4 NATIONAL LEAGUE East Division W L Pct GB L10 50 34 .595 z-4-6 38 45 .458 11% 3-7 36 45 .444 12% z-5-5 37 48 .43513Y2 z-6-4 37 49 .430. 14 z-5-5 Central Division W L Pct GB L10 45 38 .542 3-7 44 40 .524 1% 4-6 42 43 .494 4 z-5-5 42 43 .494 4 5-5 31 53 .36914% 3-7 29 57 1.33717-% 3-7 West Division W L Pct GB L10 San Diego 44 40 .52 Colorado 43 40 .51 Los Angeles 43 40 .51 San Francisco ,43 41 .51 Arizona' 40 44 .47 z-first game was a win. AMERICAN LEAGUE. Minnesota at Kansas City, late. L.A. Angels at Seattle, late. Thursday's Games N.Y. Yankees (R.Johnson 9-7) at Cleveland (Lee 8-5), 7:05 p.m. Boston (Wakefield 6-8) at Tampa Bay (Shields 4-1), 7:15 p.m. Baltimore (Ortiz 0-5) at Chicago White Sox (Vazquez 8-4), 8:05 p.m. Toronto (Taubenheim 1-4) at Kansas City (Redman 5-4), 8:10 p.m. LA. Angels (Escobar 6-9) at Oakland (Loaiza 3-5), 10:05 p.m. Friday's Games, Baltimore at Cleveland 7 05 p m N Y Yankees at Tampa Bay 7 15 p.m. Toronto at Kansas City. 8 10 p m Minnesota at Texas. 8 35 pm Boston at Chicago Whinne Sox, 8 35 p.m. Detroit at Seattle, 10.05 p m L.A. Angels at Oakland, 10:05 p.m. Devil Rays 5, Red Sox 2 BOSTON Yukilis lb Loretta 2b DOrtiz dh MRmrz If Nixon rf Varitek c Lowell 3b Crisp cf Cora ss TAMPA BAY ab rhbi ab r hbi 2 00 1 JLugoss 3 2 1 0 4000 Crwfrd If 3 1 22 3 01 0 Baloeil cf 4 022 4 000 Huff3b 4 0 00 3 00 0 ToPerz3b 0 000 4 11 1 Cantu 2b 4 0 1 0 4 110 Gomes dh 2 1 1 0 4000 Norton dh 2 000 1 01 0 Bmyan rf 1 1 0 0 Wggntn lb 3 0 0 0 Paul c 3 0 1 0 Totals 292 42 Totals 29 5 8 4 Boston 010 010 000- 2 Tampa Bay 130 100 00x- 5 Crawford reached first on catcher's inter- ference. E-Varitek (3). DP-Boston 3, Tampa Bay 1. LOB-Boston 6, Tampa Bay 6. 2B-Lowell (30), Gomes (16). HR-Varitek (9). SB-Crawford 3 (32). SF-YouKills IP H RERBBSO " Boston JJohnson L,3-10 4 7 5 4 4 3 Tavarez 3 1 0 0 1 0 Hansen 1 0 0 0 0 3 Tampa Bay Corcoran W,3-0 62-3 4 2 2 2 2 Harville 2-3 0 0 0 0 0 Switzer 2-3 00 0 1, 1 MeadowsS,4 1 0 0 0 0 0 Switzer pitched to I batter in the 9th. HBP-b/ Corcoran (Corai bt Corcoran (Youkilis). WP-Meadows. Yankees 11, Indians 3 NEW YORK CLEVELAND ab rhbi" "' ab" r hbi Damoncf 1 000 Szmore of 4000 Crosbycf 4 111 Blliard2b 4 0 1 0 Jeterss 4 12 1 JhPltass 4 000 Giambi dh 500 0 Hafner dh 3 1 1 0 ARod 3b 5 11 1 VMrtnz c 3 0 1 0 Posada c 5 12 2 Brssrd 1b 4 1 1 2 BWIImsrf 511 0 Boone3b 3 010 APhilps lb 421 0 HIndswIf 3 1 1 1 MeCbrIf 4 23 5 Inglettlf 0 00 0 Cairo2b 4,22 1 Gutirrzrf .3 000 Totals 24111131311 Totals 31 3 6 3 New York 010 800 020- 11 Cleveland 001 200 000- 3 ,E-Boone 3 (14).. DP-New York 2. LOB-New York 4, Cleveland 3. 2B- Posada (13), BWlliams (15), MeCabrera (8), Hafner (17). 3B-Cairo (2). HR- MeCabrera (3), Broussard (11), Hollandsworth (6). SB-Jeter 2 (18), ARodriguez (9), APhillips (3), Cairo 2 (9). SF-Jeter. IP H RERBBSO New York MussinaW,10-3 6 5 3 3 1 4 KWilson 2 0 0 0 0 1 MRivera 1 1 0 0 0 0 Cleveland Byrd L,6-6 32-3 10 9 4 0 2 RBetancourt 31-3 1 0 0 0 5 FCabrera 1 2 2 2 0 1 Mota 1 0 0 0 0 1 HBP-by Mussina (Hafner). Tigers 10, Athletics 4 DETROIT OAKLAND ab rhbi ab rhbi Grndsn of 422 0 Ellis2b 5 0 1 0 Planco 2b 5 11 1 Kendall c 4 01 0 IRdrgz c 5231 Mlhuseph 1 00 0 Thmes If 4000 Crosby ss 5 01 0' CGIllenss s522 1 Thmascdh 2 0 1 0 Monroedh 4 22 2 APerezdh 0'00 0 AGmez rf 4 01 1 Payton rf 4 0 0 0 Shitn lb 3 01 2 Kielty If 4 2 3 1 Inge 3b 4 111 Kotsay cf 4 1 1 1 Scutaro 3b 4 1 1 2 DJnson lb 3 0 1 0 Totals 3810139 Totals 36 410 4 4 5-5 8 z-7-3 8 /2 z-5-5 2 1 6-4 76 4 4-6 Home 27.10 26-17 29-17 24-21, Home 26-14. 31-12 30-10 22-20 16-21. Home* 23-19 23-24 23.21 19-23 Home 24-16 19-24 18-20 18.22 19-21 Home 26-17 20-22 27-19 27-17 14-25, 20-24k iHome 23-24. 21-19 ,265-16; 23-20 19-23. Away Intr 23-22 16-2 21-18 10-8 18-20 99-9 15-26 9-9 1 Away Intr 31-14 15-3 24-17214-4 16-26 16-2 17-24,8-10 12-330:8 10-8 Away;,nV 21-21 p,-b0 20-18 .741. 19-22 14-4 20-21 7-11 Away Intr 26-18 6-9 19-2, 5-1.; 182.5 ,9-9.; 19-26,5,-1, .-0 18-28 ii, Away Intr 19-21,5-10 24-18 6-9' 15-.24 7-11 15.26 6-9 :17-28 4-11; 9-33 3-12 Away, Intr - 21-16 7-8 , 22-21 11-4 , 18-44:5-10 4 20-21, 8-7 4 21-21.4-11 NATIONAL LEAGUE ' Tuesday's Games aO Washington 6. Florida 4 N.Y. Mets 7, Pittsburgh 6 - Houston 7, Cnicago Cubs 2 I Milwaukee 5. Cincinnati 2 Philadelphia 6, San Diego 5 St. Louis 6 "tlanta 3 Colorado 6, San Francisco 1 - L.A. Dodgers 11. Arizona 3 Wednesday's Games Florida 18, Washington 9 -I San Diego 6, Philadelph-a 3 (3T I;- N.Y Metf 5 Pittsburgh 0 .o - Atlanta 14, St Louis 4 Chicago Cubs 1, Housiton 0 Cincinnati at Milwaukee late " Sari Francisco at Colorado, late. "' Arizona at L A Dodgers, late -: Thursday's Games Florida (Sanchez 1-0) at Washingfoq (Hernandez 6-8), 1:05 p.m. : 4 San Diego (Park 5-4) at Phiiadelpnia (Madson 8-5), 7 05 p m . Pittsburgh (Gorzelanny 0-0) at NY?' Mets (Trachsel 7-4), 7:10 p.m. Cincinnati (Mays 0-5) at Atlanta iHuoson 6-8) 7 35 pm .. Chicago Cubs iMaddux 7-8j at Miiwaukee (Capuano 9-4), 8:05 p.m. A -!Oi, St. Louis (Ponson 4-3) at Houston (Buchholz 5-6), 8:05 p m San Francisco (Cain 6-6) at L A. Dodgers (Hendrickson 4-9) 10 10 pm Friday's Games San Diego at Washington. 7 05 p m Pittsburgh at Philadelphia, 7 05 p m ' Florina at NY Mets 7 10pm -i Cincnnatl at Atlanta, 7 35 p m - Cnicago Cubs at Miwaukee 8 05 p m St Louis at Houston 8 05 p m Arzona at Colorado 05 o m' ' San Frarcioso at LA Dodgers 10!4Op'm, Detroit 024 112 000-10 Oakland 000 301 000- 4 E-Kendall (2). DP-Detroit 1, Oakland 2. LOB-Detroit 5, Oakland 8. 2B- Granderson (20), IRoariguez 2 (16), Monroe (16), Kendall'(9) Crosby (111. Kielty (10), Kotsay (13), DJohnsbn (d12) HR-Monroe (12), Inge (17),oKielt43) , Scutaro (1). SB-CGuiilen (12) AGomez (4). .. - ;IP. iH RERBBSO; Detroit .. Rogers W 11-3 52-3 8 .a4oi434 2 4 N Colon S,1 31-3 2 0* ONJ1 Oakland ..: s Saarlops L,3-5 41-3 9 8 8 0 2 Flores 12-3 4 2 2 31,, Sauerbeck 1 0 0 0 1I,.O, Gaudin 1 0 0 0 ,' .1' Halsey 1 0 -0-0. .-0 - Sauerbeck pitched to 1 Darler in the 8it Rangers 9, Blue Jays 3 TORONTO TEXAS e- ab rh i ab r h 1A Cllnoto If 3 '.2 2 Mathws cf 5 2h2 6 Jhnson If 2 00 0 DeRosa rf 4 0 1 4 Zaunc 401 0 MYong ss 4 1 1 2 VWeliscf 400 1 Tyeira lb 4 1 2 0 Glaus 3b 3 00 0 Blalock 3b '4 2 2 2 Ovrbay lb 4 01 0 Kinsler2Do 4 1 3 1 HInbmdh 4 00 0 Mencndh 4 1 2 1 Hinske rf 3 01 0 WIrsnl f 3 0 00 JMcDIdph 1 00 0 Bralasc' 4 1 1 2 AHil ss 3 1 1 0 Mottola ph 1 010' 'i Adams 2b 4 11 0' ' Totals 363 83 Tofils 36 914 9 Toronto 001 020 :000-' 3 Texas 032-001- 12x--" 9 ' E-MYoung 181 DP-Toronto 2 LOB-? Torbnto 7; Texas 4 2B-Mottola'(1) Matthews 2(29) xer29 Blalock (16 Mench 2 (14);. HR-Catalanotto'(6); MYbung (6), Blalock (12), Kinsler (,7)i Barajas (7). IP H RERBBSO , Toronto .. :.:, , Janssen L,6-7 31-3 ::7, -5 5 ,0 1i Tallet 12-3 3 1 1 1 2. Schoeneweis 2 2 1 1,.>0 &O, Speier 1 2 2 2 0 1 Texas ., '.;I I Padilla W,8-5 62-3 6. 3 3 1 10 Many 0 0 0 0 0 0 FCorderoS.6 21-3 2 0 0 0 2 White Sox 4, Orioles 2 BALTIMORE CHICAGO ab rh bi ab r n bl BRbrts2b 4 00 0 Pdsdnklf 3 1 1 6 Faheylf 3 02 1 Cintron 2b 4 1 1 1 JvLopzph 1 00 0 Thomedh 4 1 2 0 ERgrslf 0 00 0 Knerko ib 2 00 1 Mora 3b 4 11 0 Dyerf 2 1 2 0 Tejada ss 401 0 Przyns c 4 0 1 1 Conine 1b 401 1 Crede 3b 2 000 CPttson cf 4 01 0 Mckwk cf 3 0 1 1 RaHrdz c 4 01 0 BrAdrscf 0 0 00 Millar dh 4 1210 Unbe ss 4 0 1 0 Matos rf 3 00 0 1 Totals 352 9 2 Totals 28 4 9 4 Baltimore 000 001 001- 2 Chicago 400 000 00x- 4 DP-Baltimore 3. LOB-Baltimore 6; Chicago 8. 28-Fahey 2 (4) Conine 112'. Millar 2 (11), Dye (14) SB-Podsednik (27), Mackowlak t11 CS-CPatterson (6f Podsednik (12). SF-Konerko IP H, RERBBS9 DCabrera L.4-6 62-3 8 4 Birkins 1-3 0 0 Hawkins 1 1 0 Chicago Garland W,8-3 71-3 6"' 1 Thornton 1-3 0 0 JenksS,26 11-3 3 1 HBP-b, DCabrera (Credes 4 6 6- 0 0 0- 00 0 o 7 77.7 -CITRUS 6U`N'TY' 2 R '14r Tiis3v- Tymy 2006 a SPORTS ,,.w now ob qm * 4bmwmw 4 m amomm ft 4modb *mom 400M 4m 4mmoth *Maw .:,. ... i d UK,:. :_* ........... ........... . . ....... .. .: ,' ." ... THURSDAY, JULY 6, 2006 3B 7,LIRu5 UUUP r(FL) CHRNIC~KLE BASEBALL NL Boxes Mets 5, Pirates 0 PITTSBURGH NEW YORK ab rhbi ab r hbi JBtsta cf 3 01 0 Reyes ss 4 1 1 0 JWIson ss 4 000 L Duca c 4 1 1 1 Casey Ib 4 02 0 Beltran cf 2 1 0 0 Bay If 4 000 CDIgdo lb 3 00 0 FSnchz 3b 3000 CFloyd If 2 1 0 0 Bumitzrf .4000 Vlentin2b 3 1 1 2 Castillo2b 4020 Chavezrf 3 01 1 Palino c 4020 Wdwrd 3b 3 0 0 0 KWells p 1000 OHrndz p 2 0 00 McLth ph 1 000 Mrrero ph 1 0 00 Grabowp 000 0 Brdford p 00000 Randa ph 1 000 DSnchz p 0 0 00 Totals 330 7 0 Totals 27 5 4 4 Plttsburg 000 000 000- 0 New York 500 000 OOx- 5 DP-Pittsburgh 1. LOB-Pittsburgh 9, New York 2. 2B-Valentin (13). 3B-Reyes (12). CS-Chavez (1). S-KWells. IP H RERBBSO Pittsburgh KWellsL,0-4 6 4 5 5 3 3 Grabow 2 0 0 0 0 2 New York OHrnazW.5-8 7 4 0 0 2 7 Bradford 1 1 0 0 0 1 DSanchez 1 2 0 0 0 0 HBP-by KWells (CFIoyd). WP- KWells. T-2:26. A-40,360 (57,333). Padres 6, Phillies 3 SAN DIEGO PHILA ab rhbi ab r hbi DRbrtsif 4 00 0 Rollinsss 3 1 1 0 Cmeron cf' 4 11 0 Utley 2b 4 0 1 1 BGiles rf 4000 BAbreurf 3 000 PiazzaB c 403 1 Howard 1b 4 000 EYong pr 0 10 0 Burrell If 3 0 0 0 Hffmanp 0 000 Rhodes p 0 00 0 AGnzlz 1b 3 000 Gordon p 0 00 0 Bard c 0 100 Rwand cf 4 1 20 KGreen ss 422 3 DaBell 3b 4 02 0 Castilla 3b 4 01 0 Ruiz c 3 00 0 Brfield2b 4 01 0 Mthson p 2 0 1 0 Peavyp 3 11 2 Vctrno If 2 1 1 0 Lnbmk p 0 00 0 BIIhom lb 1 000 Totals 356 9 6 Totals 32 3 8 1 San Diego 000 120 003- 6 Philadelphia 010 000 020- 3 E-Piazza (3). DP-San Diego 2, Philadelphia. 1. LOB-San Diego 3, Philadelphia 6. 2B-Cameron (13), Piazza (12), Utley (20), Rowand (14), DaBell (14). 3B-Rowand (3). HR-KGreene (11), Peavy (1). SB-Barfield (10), Utley (9). IP H RERBBSO San Diego Peavy Linebrink W,6-2 Hoffman S,21. Philadelphia Mathieson Rhodes L,0-3 Gordon 6 3 3 3 9 1 0 0 1 0 1 0 0 0 0 8 6 3 3 1-3 1 2 2 2-3 2 1 1 Peavy pitched to 2 batters in the 8th. WP-Rhodes. PB-Piazza. r T-2:34. A-40,230 (43,647). : Marlins 18, Nationals 9 FLORIDA WASHINGTON 1 ab rhbi 'ab r hbi HaRmzss 4 32 1 ASrano If 5 1 3 0 Amzgass 10 0Vidro2b 4 232 Uggla2b 6444 Zmrmn3b 4230 MiCbr3b 5 22 4 NJhnsn lb 4 2 1 1 Tranorc 1 00 0 Ward rf 5 0 11 WInhm If 6243 Clayton ss 4 1 2 3 Helms lb ,513.3 Schndr c 3 0 1 1 Hrmida rf, 4 10 0 Stantonp 0 000 Pinto p 0 000 LeCroy ph ,1 01 1 Olivoc 5 22 1 Mjwskip '0 0 0 0 Abrcrm cf,, 420 1 MrAnd ph 1 0 0 00 nRp.tit'P, .:.,b1i 1" Byrd cf.: 2 0 0 0 Borchd rf 1 00 0 SRivra p 0 0 0 0 Bray p 0 000 Fick c 2 00 0 O'Cnrr p 0 00 0 Brgmn p 1 00 0 DJcksn cf 2 1 00 Totals 46181918 Totals 38 915 9 Florida. 340 080 300- 18 ,;Washington 400 001 400- 9 1 E-Vidrd (5). DP-Florida 3, Washington 1. LOB-Florida 5, Washington 7. 2B- Uggla.2 (.14), Willingham (16), Helms (5), ASorano 2 (19), Vidro (14), Zimmerman (25). Clayton (22). 3B-Helms (2). HR- MiCabrera' (14), Willingham (10). CS- Zimmerman (6). SF-Clayton. IP H RERBBSO Florida PetitW,1-1 6 11 5 5 0 2 PintoS,1 3 4 4 4 4 6 Washington O'ConnorL;3-6 1 4 5 5 1 2 Berginann '. .3 3 2 2 0 5 SRivera 1-3 8 8 7 1 0 Bray 12-3 0 0 0 0 0 Otanton .. 1 3 3 3 1 2 Majewski 2 1 0 0 0 1 O'Connor pitched to 2 batters in the 2nd. HBP-by Bergmann (Helms). WP- O'Connor. ; T-3:18. A-18,441 (46,382). Cubs 1, Astros 0 CHICAGO HOUSTON ab rh bi ab r hbi Pierre.cf 4000 Biggio 2b 5 030 Pagan If 4000 Burke cf 4 02 0 DeLeel b 3 01 0 Ensbrg 3b 2 00 0 JJones rf 4010 Brkmn lb 4 000 i ARrag 3b(; 4pl,0 0 PrWIsn if 3.0.0 0 Barrettc 3,12 0 Lanerf 4 0 1 0 TWalkr2b 401 1 Brntlettss 4 00 0 Dmpstrp 0 00 0 Asmusc 3 0 1 0 NPerezss 403 0OPImroph 0 000 Mrshallp. 0000 Tveras pr 0 000 Howry p 0 00 0 Oswalt p 3 00 0 Nevin.ph 1 000 Lamb ph 1 00 0 Cedeno ss 0 00 0 Totals 311 8 1 Totals 33 0 7 0 Chicago 000 010 000- 1 Houston 000 000 000- 0 E-ARamirez (4). DP-Houston 1. LOB-Chicago 8, Houston 12. 2B-Barrett (10), TWalker.(13), Biggio (26), Lane (9). CS-DeLee (4). S-Marshall 3, Burke. IP H RERBBSO Chicago Marshall W,5-7,. 7 6 0 0 3 2 Howry 1 0 0 0 0 1 ,'pempsterS,13 1 1 0 0 1 1 Houston Oswalt L,6-5 9 8 1 1 2 6 ;, HBP-by Marshall (Ensberg). n T-2:43. A-31,952 (40,976). Braves 14, Cardinals 4 ST. LOUIS ATLANTA S ab rhbi ab r hbi Eckstinss 2 01 0 MGiles2b 3 3 1 1 Miles 2b 3 00 0 Yates p 0 0 0 0 Tguchilf 5 01 0 Diaz If 1 0 1 0 pujols 1b 4000 Rnteriass 6 332 FIora p '0000 CJones3b 3 22.3 olehn3b 4 22 1 Btemit3b 0 000 GBnnttc 0 00 0 AJonescf 4 1 1 1 4Ecrcn if 3 02 0 McBrid p 0 0 0 0 Kinney p 0 00 0 Pmto p 0 0 0 0 Spiezio 3b 1 01 0 McCnn c 5 1 1 2 Edmnd cf 1 00 1 Frncur rf 4 1 1 1 YMol6ha c 4 11 0 LaRche lb 4 1 3 1 Luna 2b 4 11 2 Lngrhn If 4 1 2 1 Suppan p 1 00 0 James p 3 0 0 0 TJhnsn p 1 00 0 Thrmn ph 1 1 1 1 S Hanckp 0 00 0 Orr2b 1 000 Duncanrf 2 01 0 Totals 35410 4 Totals 391416 13 St. Louis 000 121 000- 4 Atlanta 500 621 00x- 14 E-JEncarnacion (4). DP-Atlanta 1. LOB-St. Louis 7, Atlanta 9. 2B-Taguchi ,(12), Rolen (26), YMolina (15), CJones f't. T On the AIRWAVES TODAY'S SPORTS BASEBALL 1 p.m. (FSNFL) MLB Baseball Florida Marlins at Washington Nationals. From RFK Stadium in Washington, D.C. (Live) 7 p.m. (66 PAX) MLB Baseball Boston Red Sox at Tampa Bay Devil Rays. From Tropicana Field in St. Petersburg (Live) 7:30 p.m. (TBS) MLB Baseball Cincinnati Reds atAtlanta Braves. From Turner Field in Atlanta. (Live) (CC) 8 p.m. (ESPN) MLB Baseball St. Louis Cardinals at Houston Astros. From Minute Maid Park in Houston. (Live) BICYCLING 8:30 a.m. (OUTDOOR) Cycling Tour de France Stage 5. (Live) GOLF 10 a.m. (GOLF) European PGA Golf Smurfit European Open - First Round. From Kildare, Ireland. (Live) 2 p.m. (ESPN) Golf U.S. Senior Open First Round. From Prairie Dunes Country Club in Hutchinson, Kan. (Live) (CC) 4 p.m. (USA) PGA Golf Cialis Western Open First Round. From Cog Hill Golf and Country Club in Lemont, III. (Live) 8:30 p.m. (GOLF) Golf HSBC Women's World Match Play Championship Day 1. From Gladstone, N.J. (Same-day Tape) TENNIS 8 a.m. (ESPN2) Tennis Wimbledon Women's Semifinals. From the All-England Lawn Tennis and Croquet Club in Wimbledon, England. (Live) (CC) 12 p.m. (2 NBC) (8 NBC) Tennis Wimbledon Women's Semifinals. From the All-England Lawn Tennis and Croquet Club in Wimbledon, England. (Same-day Tape) (CC) (16), McCann (14). 3B-Renteria (1). HI-R-Rolen (13), Luna (4), Thorman (1). SF-Edmonds, LaRoche. IP H RERBBSO St. Louis Suppan L,6-5 31-3 9 10 9 TJohnson 1 4 3 3 Hancock 12-3 1 1 1 Kinney 1 0 0 C Flores 1 2 0 C Atlanta James W,3-0 6 8 4 4 Yates 1 0 0 C McBride 1 1 0 C Paronto 1 1 0 C HBP-by TJohnson (AJones). T-2:52. A-28,705 (50,091). 92 1 3 33 0 1 0 1 2 S 0 2 League Leaders American League GAB R H Pct. Mauer Min 72271 45106.391 ISuzuki Sea 85361 66128.355 Jeter NYY 77309 55106.343 Matthews Tex 73311 44103.331 Rios Tor 72270 46 89.330 Nixon Bos 75247 47 81.328 Pierzynski ChW 72267 32 87.326 Cano NYY 69271 34 88.325 Crawford TB 78314 54102.325 Dye ChW 74261 52 84.322 BATTING-Mauer, Minnesota, .391; ISuzuki, Seattle, .355;Uaz, New York, 65. HITS-ISuzuki, Seattle, 128; MYoung, Texas, 114; Tejada, Baltimore, 108; Mauer, Minnesota, .106;; YBetancourt,. Seattle, 4; Granderson, Detroit, 4; Matthews, Texas, 4; Ibanez, Seattle,; BRo, Los GAB R H Pct. Garciaparra LAD 63247 50 89.360 FSanchez Pit ;82282 47101.358 MICabrera Fla. 81297 63103.347 Holliday Col 81318 59108.340 Rolen StL 72265 55 89.336 Carroll Col 69234 44 77.329 BPhillips Cin. 75261 41 84.322 Wright NYM 82319 53102.320 Berkman Hou 79287 46 91.317 Eckstein StL 79330 47104.315 BATTING-Garciaparra, Los Angeles, .360; FSanchez, Pittsburgh, .358; MiCabrera, Florida, .347; Holliday, Colorado, .340; Rolen, St. Louis, .336; Carroll, Colorado, .329; BPhillips, Cincinnati, .322. RUNS-Reyes, 'New York, 73; Utley, Philadelphia, 67; HaRamirez, Florida, 65; MiCabrera, Florida, 63; Weeks, Milwaukee, 62; Rollins, Philadelphia, 62; Beltran, New York, 61. RBI-Berkman, Houston, 76; Pujols, St. Louis, 73; Howard, Philadelphia, 71; CaLee, Milwaukee, 69; Wright, New York, 68; AJones, Atlanta, 68; Beltran, New York, 65. HITS-Reyes, New York, 109; Holliday, Colorado, 108;. TRIPLES-Reyes, New York, 12; DRoberts, San Diego, 8; SFinley, San Francisco, 8; Sullivan, Colorado, 7; Lofton, Los Angeles, 7; Pierre, Chicago, 6. HOME RUNS-Howard, Philadelphia, 28; Pujols, St. Louis, 28; Dunn, Cincinnati,; DRoberts, San Diego, 19; Freel, Cincinnati, 18; Rollins, Philadelphia, 18. PITCHING (10 Declsions)-TGlavine, New York, 11-2, .846, 3.43; Penny, Los Angeles, 9-2, .818, 2.94; Webb, Arizona, 9- 3, .750,; Tumbow, Milwaukee, 23; Hoffman, San Diego, 21; Gordon, Philadelphia, 21; Lidge, Houston, 20; BWagner, New York, 16; Fuentes, Colorado, 15; Borowski, Florida, 15. TENNIS Wimbledon Results Wednesday At The All England Lawn Tennis & Croquet Club Wimbledon, England Purse: $18.87 million (Grand Slam) Surface: Grass-Outdoor .. .. Silgles ... . Men ? Quarterfinals Roger Federer (1), Switzerland, def. Mario Ancic (7), Croatia, 6-4, 6-4, 6-4. Jonas Bjorkman, Sweden, def. Radek Stepanek (14), Czech Republic, 7-6 (3), 4- 6, 6-7 (5), 7-6 (7), 6-4. Marcos Baghdatis (18), Cyprus, def. Lleyton Hewitt (6), Australia, 6-1, 5-7, 7-6 (5), 6-2. Doubles Men Quarterfinals Mark Knowles, Bahamas, and Daniel Nestor (3), Canada, def. Simon Aspelin, Sweden, and Todd Perry (8), Australia, 5-7, 6-3, 6-7 (5), 6-3, 23-21. Martin Damm, Czech Republic, and Leander Paes (7), India,'def. Paul Hanley, Australia, and Kevin Ullyett (4), Zimbabwe, 7-6 (8), 6-7 (5), 6-7 (5), 7-6 (7), 6-2. Women Quarterfinals Cara Black, Zimbabwe, and Rennae Stubbs (2), Australia, def. Kveta Peschke, Czech Republic, and Francesca Schiavone (9), Italy, 1-6, 7-6 (5), 6-2. Liezel Huber, South Africa and Martina Navratilova (7), United States, vs. Yan Zi and Zheng Jie (4), China, 6-4, 4-6, susp., darkness. Anna-Lena Groenefeld, Germany, and Meghann Shaughnessy (5), United States, lead Yuliana Fedak and Tatiana Perebiynis, Ukraine, 7-6 (3), 2-4, susp., darkness. Eleni Daniieidou, Greece, and Anabel Medina Garrigues (10), Spain, lead Virginia Ruano Pascual, Spain, and Paola Suarez, Argentina, 7-6 (4), '2-2, susp., darkness. SOCCER 2006 World Cup SECOND ROUND Saturday, June 24 At Munich, Germany Germany 2, Sweden 0 At Leipzig, Germany Argentina 2, Mexico 1, extra time Sunday, June 25 At Stuttgart, Germany England 1, Ecuador 0 At Nuremberg, Germany Portugal 1, Netherlands 0 Monday, June 26 At Kalsersalautern, Germany Italy 1, Australia 0 At Cologne, Germany Ukraine 0, Switzerland.0, Ukraine won 3- 0 on penalty kicks Tuesday, June 27 At Dortmund, Germany Brazil 3, Ghana 0 At Hanover, Germany France 3, Spain 1 QUARTERFINALS Friday, June 30 At Berlin Germany 1, Argentina 1, Germany won 4-2 on penalty kicks At Hamburg, Germany Italy 3, Ukraine 0 Saturday, July 1 At Gelsenklrchen, Germany Portugal 0, England 0, Portugal won 3-1 on penalty kicks At Frankfurt, Germany France 1, Brazil 0 SEMIFINALS Tuesday July 4 At Dortmund, Germany Italy 2, Germany 0, extra time Wednesday, July 5 At Munich, Germany France 1, Portugal 0 THIRD PLACE Saturday, July 8 At Stuttgart, Germany Portugal vs. Germany, 3 p.m. CHAMPIONSHIP Sunday, July 9 At Berlin France vs. Italy, 2 p.m. TRANSACTIONS BASEBALL American League BALTIMORE ORIOLES-Signed 3B Billy Rowell. con- tract of RHP Kris Wilson from Columbus, National League ST. LOUIS CARDINALS-Acquired RHP Jeff Weaver from the Los Angeles Angels for OF Terry Evans. SAN DIEGO PADRES-Reinstated OF Dave Roberts from the 15-day DL. Placed OF Ben Johnson on the 15-day DL. International League NORFOLK TIDES-Recalled RHP Ivan Maldonado from Binghamton of the EL and RHP, Travis Hope from St. Lucie of the FSL. PAWTUCKET RED SOX-Recalled OF Matt Van Der Bosch from Portland of the EL. American Association COASTAL BEND AVIATORS-Released LHP Lavelle Morgan. FORT WORTH CATS-Agreed to terms with RHP Dan Valentin. Can-Am League BROCKTON ROX-Agreed to terms with INF Brian Trupiano. NASHUA PRIDE-Agreed to terms with RHP Josh Stevens, QUEBEC CAPITALES-Agreed to terms with OF Nestor Smith. SUSSEX SKYHAWKS-Agreed to terms with LHPlldiael Greenhouse. Golden Baseball League GBL-Approved the trade of San Diego OF Jose Canseco to Long Beach for P Yoankis Turino. FULLERTON FLYERS-Acquired RHP John Grijalva from Washington of the Frontier League for future considerations. Agreed to terms with C Buddy Morales. Northern League GARY SOUTHSHORE RAILCATS- Agreed to terms with OF Todd Martin. JOLIET JACKHAMMERS-Traded OF J.D. Foust to Kansas City for a player to be named. Traded OF Mike Goss to San Diego of the Golden League for a player to be named. Traded C Greg Stevens to Pensacola of the American Association for a player to be named. Agreed to terms with OF Maikel Jova. BASKETBALL National Basketball Association CHICAGO BULLS-Named Jim Paxson consultant. LOS ANGELES LAKERS-Signed G Jordan Farmar. NEW ORLEANS HORNETS-Signed C Hilton Armstrong and F Cedric Simmons. Waived G Moochie Norris. NEW YORK KNICKS-Signed F Renaldo Balkman and G Mardy Collins. Women's National Basketball Association CHARLOTTE 49ERS-Named Edwina Johnson director of basketball operations. FOOTBALL National Football League ARIZONA CARDINALS-Signed LB Brandon Johnson and WR Todd Watkins to three-year contracts. CHICAGO BEARS-Signed S Danieal Manning and DT Dusty Dvoracek to four- year contracts. HOCKEY National Hockey League ANAHEIM DUCKS-Signed F Andy McDonald to a three-year contract.pem and F Matthew Bamaby. LOS ANGELES KINGS-Acquir-L G Dan Cloutier from Vancouver for a1007 second-round draft pick and a conditional 2009 draft pick. MINNESOTA WILD-Signed RW Marian Gaborik to a three-year contract and D Paul Albers, LW Ryan Hamilton and D Mike Madill to entry-level contracts. NEW YORK ISLANDERS-Re-signed D Joel Bouchard to a one-year gntract. Agreed to terms with C Andy Hilbert on a one-year contract. NEW YORK RANGERS-Signed D Karel Rachunek, F Matt Cullen and G Stephen Valiquette. Agreed to terms with D Daniel Girardi. PHILADELPHIA FLYERS-Re-signed G Antero Niittymaki to a one-year contract. PHOENIX COYOTES-Signed RW Georges Laraque to a two-year contract. American Hockey League HARTFORD WOLF PACK-Signed G Miika Wiikman. ECHL IDAHO STEELHEADS-Re-signed F Marty Flichel to a one-year contract. SOUTH CAROLINA STINGRAYS-Re- signed C Evan Schwabe. COLLEGE NEW MEXICO BOWL-Named Jeff Siembieda executive director. ANDERSON, S.C.-Named Jeff Brookman men's assistant basketball coach,. BINGHAMTON-Named Sean Clark swimming and diving coach and Pat Popolizio wrestling coach. BRADLEY-Named Monica Marlowe assistant volleyball coach and Adam Andrusyszyn operations intern. CALIFORNIA-Named Jim Bartko sen- ior associate athletic director for develop- ment. CAMERON-Named Ryan McAdams assistant men's basketball coach. DREXEL-Promoted Rebecca Gigli and Laura White to associate directors of ath- letics. EASTERN MICHIGAN-Named Chip Wilde men's assistant basketball coach. GEORGIA-Named Michelle Green assistant softball coach. GEORGIA STATE-Named Mark Macon men's assistant basketball coach. INDIANA, PA.-Named Nick Sirlanni wide receivers coach and Holly Sartor women's assistant basketball coach. INDIANA-SOUTH BEND-Named Steve Bruce women's basketball coach. IOWA STATE-Named Jay Ronayne gymnastics coach. MISSISSIPPI-Announced that men's basketball player David Huertas will trans- fer to the school from Florida. NORTH FLORIDA-Named Mike Summey men's assistant basketball coach and Anthony Candelino men's volunteer assistant basketball coach. NORTHEASTERN-Named Sherri Brown women's assistant basketball coach. NORTHERN ILLINOIS-Promoted Sean Harrlngton from men's director of basket- ball operations to men's assistant basket- ball coach. PORTLAND STATE-Named Steven Ascher men's and women's tennis coach. TEMPLE-Named Tom Deahn director of football operations. WASHINGTON & JEFFERSON- Named Kate Scattergood women's lacrosse coach and Paul Skrok men's and women's tennis coach. S URG E Dunnellon to the Pool A champi- SURGE, onship. David Bouton added a pair of Continued from Page 1B singles and an RBI, while Katlyn Hicks and Cody Underwood each Junior Baseball singled in a run. Dunnellon 6, David Miller worked the first West Hefiando 4 three innings to get the pitching Ronnie DaWson belted a two-run win for Dunnellon (3-0), which will double and pitched four.scoreless meet Crystal River on Friday for innings for a save to lead the District 15 championship. broft a- in.v s -a lop 0 0 firm am stpi MA Ui -a to m m I rigm omm U 'x-- Ato qw p 04OPM40.4b UP -D am 0&-. MOPq-gp- -w CAW. .0 0 -00 A 0 -- aw 41-am -" am mo 0 0.ft O-M. 4b imm =04OO mw 40 0m 1 0 410 0 0 & W .0.6 'P-3. WMEMM _w 0 0* 4D Ou 400 w dW 1- 0 &I 4 C 0 4 M 040 0 mWW w fsm- mS C sno nw -* le- "Copyrighted Material nEP Syndicated Content brO * se -- SAvailable from Commercial News of hi' - ly a- bl- - le t o* Ssome I to a 10e Continued from Pa 1B semuh - her third win of the tourna- ing three perfect innings start the game before Kennedy Park got to her in fourth inning. sogame eby striking omut the side, Stepanekss who was cheered on continued fro st Pae nd1B her third win of the tourna- ment in as manygame, pitcher ierra ing three perfect underhangs to start the game before Kennedy Park got to her in fourth inning. After Eldridge started the North stole second and third game byRodgers stoleng e sidecone, Inverness headed to the plate in the bottom of the first and didge'st have to swing the bats very often. Kennedy Park pitcher Cierra Brown, using an underhand collecft tosed from the pitcher's cir- cle, walked Brittany North and Kimberly Rodgers to start the contest oNorth stoleasecondandthird while Rodgers stolen furthsecond and Inverness plated its first run when mNorth came home on Eldridge's fielder's choice for a 1-0 lead.y Smith for a 12-0 lead After Rodgers scored on an error, Jen Baum came up and collected the first hit of thew game on a two-run double to left centerfield that scoredat Marissa Maggiore and Candace Smith and Inverness headed into the top of the sec-." ond with a 5-0 lead. The team would further expand the margin by using across seven more runs in the second inning, using six walks and hits by Candace and Ashley Smith for a 12-0 lead after two.i Ashley Smith's hit, a itwo-run double, gave Inverness its last two runs. 'Ashgle to leChawSmith had two greatHenry Henry stole a pairnight" Martone said of bases her catcher. "She's a great player and she's got a good arm from behind the plate." Inverness, however, would be done scoring and Kennedy Park, after looking hapless the first two innings, would apply some pressure in the fourth After retiring the side for three straight innings, Eldridge gave up a leadoff sin- gle to Chawna Henry. Henry stole a pair of bases. 1 Providers" ewie and scored with one out on Keeria McKenzie walked to load the bases and after a bases-clearing single to te Whle Inverness remained "We had a mental break- Federer's goiurg toh win." and scored with one out on Jakara Willis' infield that tngle delay to the leadrt ofo 12-1the game, Keeria cKenzie walked to load the bases and, after Inverness got the inningess team waitc- ond outnd wJosinda Stanley rouped a bases-clearing single to t wall in right field and Kennedy Park cut the lead to the 12-5.park, While Inverness explained in control of the game through- outh the play of the team is't decidedly less inspired in the last four innings. its enormous leWe had a mental bre. k- down in the fourth minni," Martone said of her squad. Martone noted that the delay to the start of the game,, in which the Inverness team wait- ed around without warinn ing up forroughlyn, now 20 minutes, was disappointing. It'helpeds frustrating because you train them to get to the park, have them stretchandte, who alsget ready," Martone explained. "Then the other n team i3-3 tie here." Inverness collected just f(ye hitse'rut used 14 walprettys and five Kennedy Park errors to build its enormous lead. 11-yearold basebdb team," said Dunnellon manager son Durnellon got home runs roin a Connor Hannah and Hunter Brumby and four innings of serv- iceable pitching from Ed Conte to clinch Pool B of the District 15 tournament. Dunnellon, now 2-0 after pasting Crystal River 17-1 earlier in the week, will face Pool A winner Inverness at 6:30 p.m. Friday at. Whispering Pines. scored two runs while Conte helped out his own cause with a leadoff triple in the bottom of the" third. The hit by Conte, who also i scored a pair of runs, led off a four- run inning that broke open a 3-3 tie and allowed Dunnellon to break away from Greater Hudson (1-1)' 'We're a pretty good-hitting ' team," said Dunnellon manager Tony Hannah. "Once we get going, we can score some runs in a hurry." J S t"Dr-e'Tr'c f'-.-. /17T ) .. v.. 45 THURSDAY, JULY (2, 20062 rAA Pain and tpm -mua ad. m a.- a ow 0 .-no S - a.. a. -a. .1 a. ow--d * * a. a. a a.- a -- a. 'a. - ~ -- = S1- ---- Copyrighted Material Syndicated Content SAvailable from Commercial News - ampabo-- a. - a .q a..... .. a. -4 40. dpw - Q a 40M dw A-4ft41. - a. - -a. a - 4b -. .M -a aa. ' a. a a. - - a. -~ a. a. a a. - a.- a. -- a. a. - - ma.- a. *-a.~a.. a. -a.. - a.- a.- - S - a. a. a.. - a.. -- -a. - - a - - a a. * a -a. -. - - a. a. tip -a.- a.- -a. - a- - - S am . a a W. 4 -lo 0% .. a.vop ag --Odom 4b -law .0 0. - ~--g m -MM & a.0m, 0 Pmur ral -b-~ II'V d- q- low-* a. - - a. a.--a a a *- 0- * a.- - -a. - a.-- -- a. -e S - a. a- o m- -.0mmmm 4 M-00 -- .ann Ma. a t~ m a.-&-=maim a -o 4ft- adm a m.=*4D a so.* tw *ap ft MEa.. a.- -80 A~RA mEs ink mI awa Ysty - a. a. - a. a a. a. a -a. a. -a. a. a - a. - - a. a - * - a - - - a. - * -~ a. b-S a. a. - S - -a. - a. a *a a. a.- a. a. a - a. - a a.~. a. - - -~ - a - - ~- a. a. - - a. S - -a ____ -Copyrighted aterial- - "Mea- "C Syndicated Content - Available from Commercial News Providers" WIN JOH DEEE 503, 0 HOSEPWER,2WD RAN FULLSIZE DIEEL UILIT TRATOR ALUE AT. $13,49 PRIZE a. 0 4 f- a 41b da--a. --M .4 ab... -.000o -- b. gap0 - O. S - a - a.- a. a - a. - - a. a a.- a - a. - a '~ * a a.- S - a a - S4 -* MOR.PIZS O IN DON'T WAIT! GET TO GREENSOUTH EQUIPMENT TODAY! SGR EU at,HFL 2157 NE JACKSONVILLE ROA.................(352 51-238 G R E E N S U T H OMAINESVILLE, FL 9120 NW 13th STREET ........... (352) 367-2632 C lam U T CHIERAND.FL 107 SOUTHWEST 4TH AVENUE ............... (352)493-4121 RPM........._NEWBER_ NI Nh lFL 633 NW 250TH STREET .................... (352) 472-2112 ASHMGS, IFL 100 SOUTH DANCY STREET.................... (904) 692-1538 Equipm ent, Inc. ORANGEPARK, 611 BLANDING BLVD............... ) 272-2272 DEERE SEASON HOURS TULLAHASSEE, FL 2890 INDUSTRIAL PLAZA DRIVE........ (850) 877-5522 M-F: 7:30am-O:00pm Sat: 7:30-4:00pm Sun: Closed T1HOMASILLE, GA 12793US 19SOUTH ........... (229)226-4881 greenoutllequ!pmant.com CAIRO, GA 2025 US HWY 84 EAST ....... .. (229) 377-3383 D74BUBDo802-GSE3X10070oCCC-00133798 renf, TAKE A TEST DRIVE AND REGISTER BY JULY 28H1" ---I Cmus CouNTY (M CHRONiCLE S 1,~ r.-, m ..... o - o [ I -V 5B T- Hi tIRSDAY JULY 6, 2006 Outdoor tREFSE. Vessel Safety Check Mega Weeks 5']'TheS. Coast Guard Auxiliary has announced its annual Vessel Safety Check Mega Weeks, which Iill run. through July 9. A Vessel. Safety Check (VSC) is a,free, check of any recreational S< Avessel pttending any of a number CG Auxiliary safety or boating skills. courses. They will also discuss issues relating to Maritime Domain Awareness and the specifics of the America's Waterway Watch pro- gram ; S : The dates, times and locations of Vessel Safety Check stations will be available from your local USCG Auxiliary Flotilla. In addition, schedule information can be bbtajned at many local marine retailers, and marinas. You may also contact a vessel examiner directly by signing on at and clicking the "I Want A VSC" button. 'Power Squadron boat safety classes T4TheCrystal River Power Squadron will conduct a four- S evening boating safety course called "Boat Smart" from 7 to 9 p.i. Monday and Thursdays, August 14, 17, 21 and 24 at the Squadron building at 845 N.E. Third Ave., Crystal River. This course is designed to meet the minimum requirements stipu- 1lted S regulations, equipment require- ments, rules of the waterway, boat 'handling, trailer handling, basic ;knots, marine radio procedures, ;aids to navigation and emergency :procedures. The course is free, but 'here 'Fishilig workshop with Bud Andrews at Whispering Pines Park ,Recreation Building. ',. Bus Andrews World Champion ,of Largemouth Bass Catches was inducted into the National Fresh S- ied fishing trip to be given away. Also receive the many handouts and samples Bud has at every ' c- ass. .. : , The workshop is from 9 to 11 a.m. on the third Friday monthly. :The registration fee is $20. 'Register for class at the adminis- ,tration office in Whispering Pines Park, 8 a.m. to 5 p.m., Monday- f Friday. For further information, call :the administration office at 726- ?3913. "Copyrighted Material "-- --- Syndicated Content -- -W-4-W- - Available from Commercial News Providers" - M -m:::: U -~ - -" - Theft a downside in paradise S someone stole my crabs. I have no idea who, of course, but someone stole them. right out of the pot. Is it possible they simply - escaped? Well, anything's pos- sible, so I suppose they could have, in theory But I've been using crab pots since I was a teen and had my own bait business, and I've never seen a crab get out of a pot, except for the undersized ones that vamoose out the escape ring, and these were not under- sized. Let me back up a bit and explain what happened. Sometimes. when I know I'll be going fishing two days in a row. or maybe t 0o out of'thr'ee days, not back-to-back, I take a crab pot with me, let it soak overnight and pick it up on the way back from the second day's trip. That's what I did last week We went out on Wednesday, Theresa and I, and I knew I'd be going again. So we took the pot, baited it, and dropped it offT on the way to where we were going to fish. A few hours later, we passed it on the way in, and I pulled it to be sure the bait was secure, and to take the accumulated grass off the float line. There were three crabs in it, all keeping size and all males. The minimum size only applies to crabs caught com- mercially, but I impose my own personal limit, and I never keep females, even if there are no visible eggs. I tell you this so you'll understand why I checked the crabs, even though I was going to leave them in the pot. It's automatic, see a crab and check its gen- der. I cleared some grass off the pot, checked to be sure the latch on the side was engaged and dropped the pot back into the water. "That's a good sign, isn't it? said Theresa. "I mean, if there's three after only a few hours..." "Yeah," I said, "ought to have eight or more by the time I pull it" If you're wonder- ing why I didn't take the crabs at R.G. that time, it's T14 because I didn't LI want to cook and pick just three, then have to do it again the next day with the rest I might as well have taken them, because someone else did. When I did pull the pot after my next trip, there were three crabs in it, but not the same three. One was too small in fact, it made it out through the escape ring as I put the pot in the boat and one of,. the other two was a female, so there's ;hmidt no question they HT weren't the same ES three that were in there the first time I pulled it, In addition, I had two fish skeletons on the bottom of the trap, one secured and one not, and the one that hadn't been wired down was gone. It must have fallen out when the thief dumped out the crabs, I sup- posed. Now, to put things in per- spective, those crabs weren't going to feed the masses. Eight or ten crabs, you generally get enough meat off one crab to make one crab cake, so we could have made a half-dozen cakes, and put the rest of the meat in a nice crab salad. But nobody was going to starve because of the missing crabs. In that sense, it wasn't a big deal, but the intended pur- .Please see SCHMIDT/Page 6B A% c IO r u ,l ou V I y Tide charts Chassahowitzka High/L THURS 3 12 am 7,6 2 03 p m FRI 429 am 7/7 2 55 p m. ow 9.A 11 Crystal River High/L 6 am 1:33 a.m. 26pm 1224pm Low Homosassa High/Low Withlacoochee High/Low 7-08 am 2 24 arm. 8-45 am 10:11 am. 4-56 am 8-48 pm 1 15 p.m. 10 25 p.m 6 36 pm 10 52 a.m 2:50 a m. 8:14 am 3.41 a.m. 9 51 a.m 12.37 a.rn -- 1.16 p.m. 9-45 p m. 2.07 pm 11-22 p.m 11-03 p.m. SA 5-31 a m. 12-23 am 7/8 3.46 p m 11 53 pm. suN 6.23 am 1 14 a m .19 4 36 pm 12-47 pm 3 52 a.m 2 07 prm 444 am 2.57 p m. 9 15 am 443am. 10 36 p m. 2-58 p.m 1009am. 535am 1123pm 348pm. 6 02 am 7:33 p m 1052 a.m 1:39 a m. 703am -- 11-54 pm. 8 24 p.m 12-13 am 231am 7.57 am. 1146pm 1244pm 9-11 p.m MOn 7-08 a.m 2:01 am 5 29 a.m 10 58 am. 6 20 a.m. 1:00 a.m. 3.16 a m. 8.46 a m. 7no 5.24 pm 136pm. 345 p.m -- 4.36 pm 12 35 p.m 1:32 p m. 9:55 pm. TUES 7 48 am 245am 6 09 a.m. 12.07 amn. 7 00 a.m. 1-44 a.m. 356 am 932am. 7/11 613pm 2.22 pm 434pm 11:44 am 525pm. 121 p.m 221 p.m 10.38 p.m WED 8 25 am 328 am 7/12 7 02 pm 3 09 pm 6-46 a.m 523pm 12 50 am 7 37 a.m. 2 27 am 4:33 am 1231 prm. 6-14 p m. 2.08 p.m 3 10pm 10-19 a.m 11.19 p.m. Tide readings taken from mouths of rivers Outdoor BRIEFS Biologists need help with tarpon St. Petersburg Biologists at the Florida Fish and Wildlife Conservation Commission's tFW. There are three Coast Guard Auxiliary'Flotillas in the imrilediate area. Yankeetown, Crystal Riv? wh. !=i- l= :::" ***=:*::*, ,,.: .. : r A Sc G N R .......... uy.. x6 2C n 9 a ov * ,NM g -pk 'op 4 IOMM- " Co ritecdMaterial Syn'i catediContent Available from'Commercial News Providers" -. = SCHMIDT Continued from Page 5B purpose of the crabs is not the point The point is that some- one who could well have caught their own crabs after all, they had to have a boat to get to the pot, why not drop their own? chose instead to steal someone else's. That's the bad side of humanity and, fortunately, such lowlifes are the minority. Most people are honest and ethical. It's scallop season now, and there will be people who catch their limit, take the scallops to shore and then go back out to grab a second, limit, maybe even a third, who knows? r What we do know for sure is that people do something like that and we know it because, from time to time, one of them gets caught doing it That's stealing, too, every bit as much as taking crabs from someone else's pot is stealing, but the lawbreakers don't see it that way. 'I can't go tomorrow,' they'll say, 'but, if I did, I could get another two gallons, so what's the difference? I'm just getting tomorrow's scallops today, but it's still only four gallons for the two days.' Right. It's another of humanity's failings, the inability to see how today's actions affect tomorrow's resources. By tak- ing more than their fair share (do they really think officials, when they set limits, don't take into account the fact that peo- ple don't go scalloping every day?) they're ensuring that next year's spawn will be reduced, thereby reducing the number of scallops available for harvest Unfortunately, there will always be lawbreakers, always be the selfish ones, the uncar- ing ones, the greedy ones. All we can do is grin and bear it and put up with them. One -. - thing we know, the majority of us, is we follow the rules. ItCs a good feeling, isn't, it? Tight Lines to you. .G. Schmiidt, Chronicle out- doors columnist, can be ,-' reached at schmidt@isgroup.net * U- "Copyrighted Material Syndicated Content Available from Commercial News Providers" 1.UJIb~lIULLIUII UL d PcI~IIIieU dL. Tiger NOW OPEN FRIDAY AND SATURDAY TILL 8 PM FOR YOUR EARLY DINING PLEASURE 4. ITW Teietheare OTB Parimutuel Racing from all major racetracks. Night Racing Wednesday Saturday. Pro and College Sports., 11:00 AM Daily Except Tuesday Adm $ 1. Free after 6 pm. ~ 11TW Teletheatre (352 237-4144 Across from Ocala Airport on S 60th Avenue I I Cmus Comy (A) Umomcu, 6B TkiURSDAY, JuLy 6, 2006 SPORTS *:* sS- a. .::. P-.tirlo-W Thalook 6, i t-A Drinkhouse How much does the label on a wine bottle affect the way we think it tastes' F A- .3 C JULY 6, 2006 P'.- COrM.rii ii-iir: :JT Tasty enterprise ,/. I !' 'ii '*1 ~ii * ~I 3 Ii~ Iii "I JULIANNE MUNN bonnyblu@earthlink.net Chronicle Chef Patrick Binme believes he has the formula to chart success at his new Patrick's Restaurant & Lounge a couple of miles south of Homosassa Springs. He also has plenty of help from his family to ensure a long run in the business. Patrick and Teresa Byrne of Spring Hill are the new owners of the former Yanni's, a popular Greek, steak and seafood eatery near Sugarmill Woods on U.S. 19. The couple said they were trained all their lives in all aspects of the restaurant business and for a long time sought a place of their own when Yanni's became available. The spacious establishment filled the bill and they opened about a month ago with a new menu (keeping several of the Yanni's favorites). Chef Patrick is friendly and enthusiastic about his culinary skills, saying he learned his trade at country clubs and casual and fine dining restau- rants from a mentor who is "considered one of the top chefs on Long Island." He is particularly proud of his Stutffed New York Strip Steak (stuffed with mushrooms and crabmeat) and Grouper Caribbean (smothered with a lobster: shrimp and crabmeat sauce). But that's just a small sample of the ambitious menu that includes "Patrick's Family Recipe" Rack of Lamb. prime rib and filet mignon, as well as a variety of seafood, pork, veal, lamb, chicken and pasta entrees. Though not strictly homemade, the chef said his bread is freshly baked on the premises daily and served warm, and all the soups and other dishes are created from scratch. "Sometimes you can tell the quality of a restaurant by its soups and breads." he noted. Several Greek-style dishes remain on the Though not strictly homemade, the chef said his bread is freshly baked on the premises daily and served warm, and all the soups and other dishes are created from scratch. menu, including Moussaka and Spinach Pie (Spanakopita). Starters range from Escargot to Fried Calamari to Jumbo Shrimp Cocktail and much more. The help-yourself salad bar is available with dinners for those who wish to begin with the homemade soups, salad makings and peel-and- eat shrimp. Diners are encouraged to ponder the dessert tray, covered with tempting treats such as Snicker Cheesecake, a towering Lemon Torte, Strawberry and Marble Cheesecakes. Apple Pie, Chocolate Cherry Cake and Carrot Cake. The separate lounge at the rear of the dining area is newly remodeled and open for business, with lunch being served in the lounge starting at 11 a.m. Wine, beer and cocktails are available in the restaurant as well. Helping out in the restaurant are the Byrne children, Megan, 16, Tyler, 13, and Eddie. 9. Teresa Byrne said she expects the family will eventually relocate to Citrus County. Patrick's is open from 3 to 9 p.m Tuesday through Saturday; from 11:30 a.m. to 8 p.m. Sunday; and closed Mondays. The restaurant is at 7431 S. Suncoast Blvd., Homosassa. For infor- mation call 6214551. Following are several of Chef Patrick's person- al favorite recipes: RACK OF L (New Zealand if possible) Slice 1-inch slits into top o going all the way though the n spoon ground garlic, 1,2 teasp 1,2 teaspoon ground oregano per to taste with 1 ounce olive and into slits. Roast at 400 degrees for 10I heat to 325 degrees and roa utes, When removed from o lemon juice over top ofrack CHICKEN SAI (Quick and easy) N 1 skinless, boneless chicken ounces, grilled until done. E 1/2 cup chopped tomatoes 0 1/8 cup chopped scallions E 1/4 cup shredded cheddar 0 1/4 cup shredded Montere Preheat oven to 425 degree a sheet pan and top pre-grille toes, scallions and cheeses. E 5 minutes until cheese is mel STUFFED S' 8 1 12-ounce New York strip medium rare or desired tel served medium rare). Let utes. Sautee desired amount of meat in olive oil or butter until mushrooms are tender garlic, pinch of salt and pep wine. L2 cup beef bouillon minute. Slice steak and stuff with top with remaining juices. BRIAN LaPETERICnronrcle rick Byrne, chef and d favorites AMB if rack of lamb (not neat). Mix of L2 tea- oon minced onion. , and salt and pep- Soil. Run over meat minutes, then lower st another 10 min- yen, squeeze fresh Serve. NTA FE en breast, 6 to 8 I' cheese y jack cheese 's. Place chicken on ed breast with toma- fake approximately Cited. TEAK steak, charbroiled mperature (Best rest 2 to 3 min- Smushrooms. crab- (your preference). . Add 1 tablespoon pper, L'4 cup white n base. Simmer 1 sauteed items and ,, Julianne Munn EASY Summer can be sweet F lorida fruit how good it is! And this is prime season for all of your favorites. But how about some fruit that you might not have tried, or at least not tried very often? Fresh guavas and papayas are available all year 'round and are so versatile they enhance all sorts of dish- es, from salads and entrees to desserts. Today, Over Easy offers a 101 class in guava and papaya for your enjoyment, plus a couple of recipes, courtesy of the Florida Agriculture Com- mission. "People associate the exotic. romantic taste of tropical fruits with good times," FAC Commissioner Charles H. Bronson said in a press release. "Serving fresh Florida guava and papaya makes any meal or get-together more fes- tive." If you've never tried these juicy, eye-catching fruits, then you've been missing out. Pear- shaped and wonderfully large, papayas are prized for their silky, buttery-soft flesh and delicately sweet, musky flavor The flesh varies in color from yellow to orange-pink to rose and is so tender it can be scooped out and eaten with a spoon The central city' is filled with round, black edible seeds with a peppery taste often likened to watercress or nasturtiums. Guavas are small round, oval, or pear-shaped fruits with thin yellow skin that may be blushed with pink. The flesh may be white, salmon- colored, or even rose-red and tastes a little like strawberries with a hint of lemon. The thin rind is fully edible. Fresh guavas and papayas used to be difficult to find in American grocery stores, but now they are readily available. Florida is a major U.S. suppli- er of tropical fruits. More than 20 varieties are commercially grown in the state, and plant researchers and scientists are busy developing more vari- eties that are well suited to Florida's unique soil and cli- mate. "Growers and scientists are working to meet an increasing demand for tropical fruits in Florida and around the nation," Bronson said. "As peo- ple are becoming more health conscious, they are eating more fresh produce, and they are looking for variety. Tropical fruits have been enjoyed around the world for generations, but many people Please see EASY/Page 2C I 9"7 .. .. .. .,. Chicken Santa Fe, French onion soup and Australian Steak a New York strip stuffed with mushrooms and crabmeat made by Pati owner of Patrick's Restaurant in Homosassa. New restaurant in Homosassa offers variety ofintaesting entire& a some CrItus CouNIY (FL) CHRONICLE 2C THURSDAY, JULY 6, 2006 UU Homemade hominy hits the spot ~~~Af maianmnhtk oak LOVINA EICHER Special to the Chronicle We are having rain off and on today, which makes it difficult to hang the wash out on the lines. So in between the showers, the clothes have been drying. I don't like to have clothes that are almost dry get wet again. I should've maybe waited until tomorrow to wash the clothes. With the storms and all the rain we had last night I thought it might be nicer outside today, but it's still showery The children and I picked up my sisters Verena and Susan yesterday morning and then headed over to sis- ter Emma's house to help clean. Emma will be holding church services at their house in the near future. We cleaned out closets and washed walls, ceilings and windows in several bed- rooms. Closets are time-consuming to clean. Around 4:30 p.m. we decided to start home; but saw that a storm was brewing in the north- west We waited at Emma's awhile longer and the storm seemed to just blow over so we start- ed cov- ered buggy, but it was still scary to realize what could happen. We sure were relieved once we arrived home. My husband Joe had been wor- ried that we might be in the storm and opened the pole barn door for us to pull into. When we arrived home several branches were off our trees and my corn was flattened. It is starting to stand up again today. The rest of the garden also looks battered. Sunday we were surprised to see Joe's dad and his uncle Solomon from Sugarcreek, Ohio, drive in to visit We made them stay and have dinner with us. Solomon stayed a couple of days and he and Joe's dad came here each day to hang siding on our new house. We sure appreciated their help. There is a little more siding still to do, but that will be a big job to have completed and over with. The boys sure enjoyed being outside with grandpa and Uncle Solomon. Our blocks came for our chimney on Saturday Joe, Elizabeth and I carried some to every level in the house. What a tiring job! Our porch railing should come this week. I'll be C~~ The Amish Cook: Lovina Eicher relieved once the railing is on. The children like to play on the porch and I am always afraid they'll fall off. Our porch goes out over our walk-out basement so it's a little higher. We ate quite a few meals on the new porch already. It is so nice and breezy under there. I can't wait until we can get a porch swing to hang up. A reader requested a recipe for hominy. Try this one. HOMEMADE HOMINY 1 quart shelled corn N 2 tablespoons baking soda 2 quarts water Wash corn thoroughly, add soda and water and soak overnight In the morning bring to a boil in, the same water the corn soaked in. Cook for 3 hours or until hulls loosen. Add more water as necessary during cooking. Drain off water and wash corn in clear water rubbing vigorously until all hulls are removed. Bring to a boil again in clear water and drain off water. Repeat again. Add 1 teaspoon salt to each quart of hominy. Use an enamel or stain- less steel kettle for cooking the corn. Makes 10 to 12 servings. Lovina Eicher is Old Order Amish. She handLwritescom. 4w 1M 11. om m tt.m l l I I - - m- II- Vr f- - - ... .. ,, l, ,, ,, ,,,,,,,, -- - --- --- -0- Synicte C ne td- -m-*- el Nvial r) o m rilNw rvdemo s"- 4 0-0 0ow - 0 * e . Syn dicated ContenteMati a ava VFromWAWIlq Comerca w Pies" .. -- a Available from Commercial News Providers". vx 4m o o 40 4 0 1b *Nq 4ME- w amp QW- 40 41b 41 -Wb4 *FMO~i 4wm d 40 o *0 4u*mp- ..-sw - dap-m w ~ -V 410 do a do po -m p 40 41W * 4- -mo mos d - e -0 - -mp mw loo - a-l mGm am of -wa dm the I am own0 M-IP i, -go mw-.m 0-%no - 40ko- mm -so4 p- .m -4MI m 0 0mm ft am40 w* -nd do 4m -m am so a o we4 o mjv m owlsom om o a 4b ___ ____ gnw mmeM- o a p b 4 domm-EEC 40 o 4m di 4w 40 wwo- mo Q mm4-gm -mm w N- Mfm EASY Continued from Page 1C in this country are just now dis- covering how delicious and nutritious they can be." Loaded with fiber, vitamins, minerals and antioxidants, papaya is one of the healthiest fruits you can eat It provides folate, potassium, and a whop- pipg 150,percent of your rec- ommended daily allowance of vitamin C. Papaya is filling without being fattening, so it's great for people who are work- ing to control their weight: A cup of chopped fresh papaya has just 55 calories and is free of sodium and cholesterol. Guava is another nutritional powerhouse, packed with fiber, vitamin A, and five times more vitamin C than is found in an orange. Guava is one of the few fruits containing lycopene, a potent antioxidant that helps lower the risk of heart disease and certain cancers. A cup of chopped fresh guava has only 84 calories. When shopping for papayas, look for 'fairly large, yellow- skinned fruit that yields slight- ly to gentle palm pressure. Stored at room temperature, papayas that are still a little firm and green will ripen and be ready to eat in a couple of days. Avoid papayas that are too soft or with bruised or shriveled skin. When selecting guavas, look for fruit that is free of cuts and bruises. Ripe guavas emit a strong, sweet, fruity fragrance and the shells will give to a gen- tle squeeze. To ripen firm guavas, let them sit on the kitchen counter for a day or two. Keep in mind that guavas, are thin-skinned and delicate ' and should be handled with care. Ripe guavas and papayas can be stored in a plastic bag in the refrigerator, but if you want to enjoy the best flavor, limit their time in the fridge as much as you can. Rinse under cool running water before eating or preparing. And just how do you eat a papaya or guava? First up is the papaya: Cut it in half lengthwise, scooping out the peppery seeds. You can add the seeds to fruit salad or your favorite creamy salad dressing for a little extra zing. Eat the flesh with a spoon or cut it into slices; it tastes great plain or sprinkled with lemon or lime- juice. If you want to get a little bit fancier, you can add ripe papaya to salsas, smoothies, milkshakes and marinades. Green papaya can be baked in the oven and eaten like winter squash. Fresh guavas can be eaten out of hand or sliced into fruit salads. Widely available in supermarkets, canned guava shells and guava paste are common ingredients in desserts. In Cuban cooking, guava shells are often served stuffed with sweetened cream cheese and guava paste is used to fill turnovers. Guava juice is a popular ingredient in fruit punches and guava jelly tastes terrific on an English muffin or toast PEPPERED PAPAYA, AND SHRIMP PATTIES 4 tablespoons butter, divided 1 small onion, chopped small Small red pepper, chopped small 1 teaspoon garlic, minced N 1 to 2 jalapeno peppers, finely chopped 2 eggs 0 1 pound shrimp, pureed E 3 to 4 cups breadcrumbs [ 1 Florida papaya, peeled, seeded, chopped salt and pepper to taste 2 teaspoons Florida lime- juice 0 2 teaspoons Dijon mus- tard 1 tablespoon cilantro, chopped 1/2 cup flour Saut6 onion, red pepper, gar- lic, and jalapenos in 2 table- THE R'MI ) ASSIST OTHE BEe$NPPORlW OF BlERVI ,E -oft ;r!q,%M';PROVIDSER^ A :''JIL N.=LP ANDT CV N SUORTKS 1. * S. ..WATCH the 19 a lethoi the comfort 6fyr homm ., ':from 9 a.m r^rp-qloca ca6l channel 16. .' Y MAKE a lax ded iledg ling (352)795-4919 signifying runners that you appAtheur p efforts on behalf of ti. ~~:', : ;-/ :cha l-eA d. , .YOU CAN JOIN US in celebraf Key rs return during the Com niity S-Celebration at the Key Ce.. er.Lecantb campus from 9 a.m. to 2 p m YOU CAN COME RELISH a t lunch wh |qnjoymg other festivities su1s hotair balloon rides, listeg-and-danci to mus caniquevbhicles ua jnotowyclea, caxrn4NrdIh ol.pIQ urp ae4 YOU c... ..".othe: .. :'.i, that ae partricipA.tg i'aithe tephytcaiteuf c c eo Annual *.O o an uFnoba .'urnament an d pftbaU' duraitnngt | U N M RLI t 'lt n | '- no ote e te ou.-, 130 HeIgn.s AA" ,' l t'". i : CI ... - ..;. ,' A. i:t.,. r t,*."'. .. .c-iiiE, '. '". ',-'2-,"% ,~ ~ ~ ~ ~ ~~4 Ouu.,.'.uO i -.-,.,, ,-: .',t.,., ., ;,*r... ''. spoons of butter. Remove from heat and cool slightly. In a bowl, mix together onion mix- ture, eggs, shrimp, bread- crumbs, papaya, salt pepper, limejuice, mustard, and cilantro. Form mixture into patties approximately 3 inches across and 1 inch thick Pour flour on plate and lightly coat patties. Melt remaining table- spoons of butter in skillet and fry patties over medium heat for 3 to 4 minutes on each side,_ or until golden and crispy. Makes 15 cakes. TROPICAL FRUIT MEDLEY 1 Florida papaya, seeded and sliced E 1 Florida mango, chopped 4 red bananas, sliced M 1/2 pound lychees, peeled and seeded 0 Juice of 2 Florida passion fruit w1 large Florida annona, pulped and strained, reserve juice Mix together fruits and top with strained juice from pas- sion fruit and annona. Stir gen- tly and serve. Yield: 4 servings NOTE: Annona--Native throughout the West Indies and north to Florida. A predomi- nant species in the Everglades. Check with your favorite super- market produce department Julianne Munn is'foobd editor for the Citrus County.. Chronicle. Her e-mail address is bonnyblu@earthlink. vop* a Vrn taTmh pal, 09047 7rFOO o 41h.dw - ..MEN.Ndo"w 4101- Power of suggestion can rule our taste buds, too R member .. back in the i| 1970s when people were invited - to take the Pepsi Challenge? k ' The contest pit- , ted Pepsi against \ Coke in a blind tast- ing, and Pepsi always seemed to Ron Dri win. So why was 'WIF Pepsi willing to take & s\ a chance on. a "blind" sampling of their stuff? Did they know something the public didn't? : One. scientist at the Baylor College of Medicine wanted to understand what was going on. So while the volunteers drank, he scanned their brains with an MRI machine. One part of the brain, called the "puta- men" (thought to process nkhouse NES UCH reward) was five times more active when they sipped the Pepsi, compared to Coke. Now here, as they say, is the rub. When the scientist repeat- ed the experiment, he told them this time what they were actually drinking. Most now preferred the Coke. Their brain scans showed increased activity in the part that shapes cognitive power. In other words, knowing the brand name dictated prefer- ence. So what are the implica- tions when it comes to wine tasting? When we don't taste blind, try as we may, total objectivity is highly unlikely. What we know about a particu- -*-a.-** - - 40 40-t d 4%- Q4b- 4 4op 4w 4 0 S om .o QW- mIlo dp 4D 0 1W-. t-O "Copyrighted Material - S. Syndicated Content -.-- Available from Commercial News Providers" lo mota omm- 40go b- -Odm 4110 a w p oqda- M-ft-lo 4" -m W om -lsmi om om 401 40400 w M - .lmdw- q _ - b 10dp o - .- o 4 o 4 - ft4RW- oba. a -m a ~- 4 qmm%4w um f. 400 lar label is going to influence judgment. Bet the house on it! Wine critics are better at evaluating quality than Tom, Dick or Mary because they are experienced and generally consistent, but these traits can't be measured scientifically. Look at wine ratings another way. Give a bottle to six differ- ent laboratories for chemical analysis, and chances are good they will measure up the same or very close, by closely identi- fying the myriad of ingredients that influence flavor and aroma. Lab techniques don't lie. Now hand this same bottle to a group of professional critics, and I guarantee there will be a range of differences, especially if they know nothing about what they are tasting other than color, not the location or the variety, and most particu- larly not the price. Or try this again with a group who has little or no wine expe- rience and see where the scores lie. All over the board, too, I would guess. The question is, can we trust anyone except our own palates when it comes to taste? The answer is, maybe, because peo- ple do possess different "flavor worlds." There are three scien- tifically proven groups on the number of papillaee" or taste buds on the tongue, divided into,. as you might guess, "super-tasters" who perceive all tastes as intense, "non- tasters" who innately lack taste skills, arid the "middle" bunch who seem to make up about half the population. When wine makers test their products on focus groups ART CENTER OF CITRUS COUNTY Art Center Theatre Prgses A Don't Miss Thi WONihiu CUi Porter Mukall July 7- all: 35Z-746-7606 Box Ofice Hours: Tueiday through Saturday 1-4 pm 2644 N. Annapols Avermne Hernmando, FL 34442 CI-IRpiNiqli to find out what pleases the public 'most, they are just checking a big cross-section of humanity's taste buds. This is a smart way to do business, a statistical sampling of prefer- ences. The wine is then made (and, yes, today's vintners can make it any way you like) with broad-based public approval in mind. The full-blown issue of how the brain works on our experi- ence of appreciating wine is complex. 'Put- it to bed with these words: Drink what tastes good to you personally, and to heck with what anyone else thinks. By the way, it's warm, and Bev and I recently found an exceptionally nice summer- time sipper, a California sauvi- gnon blanc: Wildhurst Reserve '04 at about $9. Rate it deli- cious. ---------D Oak Ridge resident Ron ' Drinkhouse was a buyer and seller of wines in his native Connecticut He welcomes inquiries, and can be reached via e-mail at ronoct9@aol.com or via telephone at (352) 489-8952. area will be returning td school without the proper school supplies. Please Homosassa .I A .. ... . .. r.... M music help us fill our studios with school supplies for needy children. Bus locations dates times Outback Steakhouse Inverness Friday, July 7, 21, 28 3 p.m. 9 p.m. K-Mart 1660 N. US 41 Inverness Saturday, July 15 10 a.m. -2 p.m. -rmr iim iiim.. ......... .. .. American Pro Dive Center U.S. 19 Crystal River Saturday, July 22 Wal-Mart 2851 E. Gulf4o-Lake Hwy, Inverness Saturday July 28 11 a.m. 3 p.m. I Sponsored by: Chronicle, WRGO Fun 102.7, Bay News 9, Crystal River Mall and Outback Steakhouse *1 I For more information call 795-1027 Homosassa Monroe Precious Cargo Preschool ' Homosassa Nick Nicholas Ford Inverness Sylvan Leomlng Center SInverness Reactors Association Lecanto Easy Wheels Hernando Cellular Depot Crystal River Wicks-R-Us Homosassa FORMS AVAILABLE * The Chronicle has forms available for wedding and engage- ment announcements, anniversaries, birth announcements and first birthdays. * Call Linda Johnson at 563-5660 for copies. With Cheese, Please Cheese goes with everything. Hamburgers. Crackers. Or a glass of vintage wine. To get the most of your cheese selections, follow these pointers. * To achieve full flavor, remove cheese from the refrigerator one hour before eating or serving. (But be sure not to leave. .____________.______ '. ..'-I i i' /? J', Wa-Mart 3826 S. Suncoast Blvd Homosassa Saturday, July 8 10 a.m 2 p.m. K-Mart Crystal River Mall Saturday, July 29 10 a.m.-3 p.m. I 676619 STOP , THURSDAY, JuLy 6, 2006 3C CITRUS COUNTY(FL) CHRONICLE FOOD IF jjE qq THURSDAY, JULY 6, 2006 ~ THURSDAY EVENING JULY 6, 2006 A:Adelphia,Cltrus B: Bright House D: Adelphla,Dunnellon I Adelphla, Inglis A B D 1 6:00 6:30 7:00 7:30 8:00 8:30 9:00 9:30 10:0010:3011:0011:30 fWESH- 19 19 1News 457 NBC News Entertainme Access My Name Is The Office The Office The Office Windfall "Money News Wimbledon NBC 19 19 19 nt l Hollywood Earl '14' '14' 001896 '14' M 1308 '14' 87032 Changers" (N) 14, S' 2024709 Udate N BBC World Business The NewsHour With Jim A Gulf Antiques Antiques Roadshow The Queen at 80 'PG' [L Soundstage "Garbage" ' 13 3 News 'G' Rpt. Lehrer [ 6815 Coast Roadshow "Tampa, FL" 'G' 2099 (DVS) 5186 ( (N) 'PG' 78235 iUFTn BBC News Business The NewsHour With Jim Antiques Antiques This Old This Old America's Scenic Rail Being Tavis Smile "P 5 5 5 5 4099 Rpt. Lehrer (N) 89438 Roadshow Roadshow House'G' House 'G' Journeys- -Served 89065 WFL 8 News 7709 NBC News Entertainme Extra N) My Name Is The Office The Office The Office Windfall "Money News Wimbledon 8 8 8 8 nt 'PG' B Earl '14' '14' B 4148 '14' 55983 '14' 50902 Changers (N) 14, S' [B B617885 Update (N) -WFTV a News B1 ABC WId Jeopardyl Wheel of Master of Champions (N) Grey's Anatomy (In Grey's Anatomy (In News Nightline W 1 20 20 20 20 4273 News 'G' 0 1457 Fortune 'G' 'PG' (1 29070 Stereo) '14' 0[ 16506 Stereo) '14' (M 19693 2492631 88845371 wfp| M 10 10 0 10News 2815 CBS Wheel of Jeopardyl Big Brother 7: All-Stars Rock Star: Supernova (N) CSI: Crime Scene News Late Show 10 10 10 10 Evening Fortune 'G' 'G', 2051 (,N [27612 14148 Investigation '14, L,V' 2490273 News CM 22032 Geraldo at The Bernie That '70s That 70s So You Think You Can News 0[ 71457 News The Bernie W D1 13 13 Large'PG' Mac Show Show'14, Show'14, Dance'PG. DL' 061070 3073877 Mac Show WCJB News 54235 ABC WId Entertainme Inside Master of Champions (N) Grey's Anatomy (In Grey's Anatomy (In News, Nightline BC 11 11 News nt Edition 'PG' 'PG' 9 38322 Stereo) '14' 9 58186 Stereo) '14' 0 51273 7894780 54138341 c Richard and Lindsay Dr. Mission Van Irnpe Gods News Life Today Worship The 700 Club 'PG' 0, Christians & Purpose for 2 2 2 2 Roberts 'G' [l 2166544 Lindstrom Feeding Pres i'G' 4337544 Center 1393235 Jews Life wFs News 49341 ABC WId Inside The Insider Master of Champions (N) Grey's Anatomy (In Grey's Anatomy (In News Nightline ABC 1 11 News Edition 'PG' 36877 'PG' 0 14780 Stereo) '14' Z 34544 Stereo) '14' cc 37631 4407803 77266612 WMOR Will & Grace Frasier 'PG' Will & Grace Access Movie: "The Almost Perfect Bank Robbery" Fear Factor (In Stereo) Access Cheaters Wi 12 12 12 12 '14' 86934. '14, D' Hollywood (1999) Brooke Shields, Dylan Walsh.'PG' 56780 'PG' [975815 Hollywood 86693 Sex and the Every- Every- Seinfeld Smallville "Lockdown" Supernatural "Asylum"' Yes, Dear Yes, Dear Seinfeld Sex and the IND 6 6 6 6 City '14, Raymond Raymond 'PG' 'PQ LV' 7259780 '14. L.V B 7279544 'PG' 'PG, L' 'PG, L' City '14, TO The -Malcolm in The Friends 'PG' Hates Chris Love, Inc: Eve 'PG, Cuts '14, The King of The King of South Park South Park INDG 4 4 4 4 Simpsons the Middle Simpsons B 8885 'PG, DL' 3,9 D,L'J D,L' Queens 'G' Queens '14' 25780 '14'82235 News 94964 Creative County Deborah Patchwork Teen 2 Teen Full Throttle 49490 RaceScene Travel and News 36438 County FAE 16 16 16 16 Cony Court Ray 70896 _Golf Court WOGX Seinfeld Seinfeld King of the The That '70s That '70s So You Think You Can News (In Stereo) Geraldo at Home FOX g 13 13 'PG'] 'PQ L' 9 Hill 'PG' Simpsons Show '14, Show '14, Dance 'PG DL' 1'34902 30231 "1Large (N) Improvemen IWAx 12 2121Variety 9167 The 700 Club 'PG' 9 Tim Gilligan Variety 7099 Faith This Is Your IVariety Praise the Lord 48693 ' IND 21 21 21 558341 ':' 2631 1. Builders Day 'G' 29032 WVEA Noticias 62 Noticiero Peregrina (N) 457780 La.Fea Mas Bella (N) Barrera de Amor (N) Aqul y Ahora 456051 Noticias 62 Noticiero UrNI 1 15 15 15 475061 Univisi6n .... 473728 453964 _- 726322 iUnivisli 'x America's Most Talented MLB Baseball Boston Red Sox at Tampa Bay Devil Rays. From Tropicana Field Diagnosis Murder Paid Paid PAX B 17 Kids 'G' 68612 n St. PetersbrQ Fla.(Live535099 Confession" 'PG V Program Proaram 54 1 48 Amecan Justice "Bad Cold Case Files 'PG' 1 he First 48 "Pack of The First 48 Double Dallas SWAT '14' [ Cold Case Fi es 'PG' Al A& 54 48 54 54 Medicine" 'PG' 483322 514631 Lies" '14' 9 590051 homicide. '14' 0 510815 513902 378051 A-MC c 55164 55 55Movie: ***x "Fargo" (1996, Suspense) Frances Movie: "Broken Trail" (2006, Western) Robert Duvall, Thomas Haden Church, Greta Scacchi. A cowboy 55 64 55 55 McDormand. Steve Buscemi. 955964 and his nephew save five girlsfrom prostitution.'14, .,V'377780 i 52 35 2 2 52c2 The Crocodile Hunter The Most Extreme K9 Boot Camp "K9 Patrol: The Best of the Best" Animal Cops San K9 Boot Camp 'G' 00 2 35 52 52 Diaries 'G' 09 2168902 "Survivors" 'G' 1396322 Canine and human soldiers. 'G' 1316186 Francisco PG' 0[ 6759544 BRAO 78 Celebrity Poker The West Wing Queer Eye for the Movie: * "The Lost Boys" (1987, Horror) America's Got Talent '14' Showdown '14, L' B "Hartsfield's Landing" Straight Guy '14' 288612 Jason Patric. Corey Haim. 0 298099 ( 628341 27 61 27 27 Movie: *** "Rolling Reno 9111 Dog Bites Daily Show Colbert Mind of South Park Mind of Reno 9111 Daily Show Colbert ( 27 61 27 27 Kansas"16709 '14' 89544 Man'14 IReport Mencia '14, 'MA, L' Mencia '14, '14' 41803 Report To98 45 98 9 p20 Comedy Dukes of Hazzard Inside the Real Coyote Movie: "Grease" (1978) John Travolta. Disparate sum- Comedy S_98 45 98 98 C Countdn Club 16186 'Swamp Molly"'G' 58148 Ugly 67896 mer lovers meet again as high-school seniors. 207544 Club 91525 Teresa de los Andes Daily Mass: Our Lady of Life on the Rock 'G' Parable The Holy Back Stage St. Thomas Web of Faith 'G' 6143693 S96 65 96 96 3923235 the Angels 'G' 7302544 7388964 ,7863709 1Rosary 'G' S29 5 29 7th Heaven "...And a Nice 7th Heaven (In Stereo) Movie: * "Willy Wonka and the Chocolate Whose Whose The 700 Club 'PG' 00 29 52 29 29 Chianti" 'G' 667322 'G' 9 204877 Factory" (1971) Gene Wilder. 217341 Line? Line? 561709' 3ii 6I 0 30 10 Kin of the That 70s That '70s Movie: **0 "Shallow Hal" (2001, Romance-C.omedy) Always Always Always Always 30 60 30 30 H PG, V Shdw'PG, Show 'PG, Gwyneth Paltrow, Jack Black, Jason Alexander. 2875815 Sunny Sunny Sunny Sunny 23 57, 23 3 Generation If Walls Small Space House Open reDesign 'G' Divine Landscaper House House Design Small Space 23 57 23 23 Renovation Could JHunters'G' House 4263254 Design'G' sa Hunters 'G' Hunters 'G' Remix'G _ ST 51 25 51 51 Modern Marvels Modern Marvels "Edison Cities of the Underworld Decoding the Past 'PG' American Eats "Hot The Revolution Daring (HIST. 51 25 51 .51 "Bathroom Tech" 'G' Tech" 'PG'7384148 'PG'B 07393896 [ 7373032 Dogs" 'PG'B 07383419 stroke. 'PG' [06158525 24 38 24 24 Golden Girls Golden Girls Movie: "Cheater's Club" (2006, Drama) [ 578099 Movie: "Caught In the Act" (2004 Drama) Lauren Will & Grace Will& Grace I I I 24 38 24 24 Holly, Max Martini. 'PGa D,L,S' (0229186 'PG' PG' FNIC MRK 28362 Ned's Danny .Fairly Jimmy SpongeBob Romeo! 'Y7 Full House Fresh Fresh Roseanne Roseanne The Cosby ( 28 36 28 28 School Phantom 'Y' OddParents Neutron 1 979419 'G' 872167 Prince Prince 'PG' 756780 'PG' 877612 Show 'G' SCF 31~ 59 c 31 31 Stargate SG-1 (In Stereo) Movie: "In the Dead of Space" (2000, Science Movie: *** "Close Encounters of the Third Kind" (1977, Science ( i) 31 5931 31 'PG' 00 1518457 Fiction) Michael Par&. 8000051 Fiction) Richard Dreyfuss, Francois Truffaut, Ten Garr. 1428419 SIK 3 37 3 3 World's Wildest Police CSI: Crime Scene CSI: Crime Scene UFC Unleashed 956475 The Raising the TNAiMPACTI (N) (In 37 43 37 37 Videos 'PG' 9 902849 Investigation 'PQ L,V Investigation 'PG, L,V ,Dudesons Roofs Stereo) '14, D,L,V' [ 49 2349 Seinfeld Seinfeld Every- MLB Baseball Cincinnati Reds at Atlanta Braves. From Turner Field in Atlanta. Movie: ** "Dickle Roberts: Formea 4 49 23 49 49 'PG'796273 'PG, D' Raymond (Subject to Blackout) (Live) 6 841051., Child Star" (2003) 8540728 Movie: *** "Touch of Evil" (1958) Chariton Movie: *** "Lassie' Come Home" Movie: **** "National Velvet" (1944, Drama) Mickey _T__ 53 Heston Orson Welles. 9 7267709 (1943) 00 (DVS) 8512525 1Rooney, Elizabeth Taylor. B[ (DVS) 11362983 ( 53 3 4 3 1 How It's How It's Shots Fired: Officer The Real Miami Cops Supermax "The SHU' Sensing Murder (N) 'PG, Shots Fired: Officer ___) 53 34 53 53 Made 'G' Made 'G' Down] 'PG' 596235 'PG' 0 505983 'PG' 592419 V 595506 Downl 'PG 383983 While You Were Out 'G' Now See Thisl'PG' 0 99 Most Bizarre "Stunt Overhaulin' Fixing up a Wrecks to Riches 'G' [B 99 Most Bizarre "Stunt S50 46 50 50 302065 1556439 Disasters" '14, V 251047 1967 Galaxie. 'G' 651803 401380 Disasters' '14, V 958493 48 33 48 48 Law & Order "DNR"14, Without a Trace "The Movie: *** "The Mummy" (1999) Brendan Fraser. A mummy Movie: *** "The Mummy" (1999) i 48 33 48 48 L. B (DVS) 102047 Line '14, L,V' [ 851821- seeks revenge for a 3,000-year-old curse. 786070 Brendan Fraser. 774235 A Inside the World's Disney Cruise Line 'G' [M Travel Advisory: Safe at Drew Carey's Sporting World's Best Mega Travel Advisory: Safe at (TRAV) 9 54 9 9 Mightiest Bank 'G' [M 6846877 Sea 'PG' 00 6855525 Adventures 'PG 6835761 Structures 'G' 6845148 Sea 'PG' 0 1282254 S M327532 32 Green Acres The Leave It to Andy Griffith Little House on the Andy Griffith Sanford and Sanford and Good Times Three's Benson 'G' 32 75 32 32 'G' Munsters Beaver 'G' Prairie'G' 00 1307438 ISon'PG' Son 'PG' 'PG' Company 5116631 47 32 47 aw & Order: Criminal Law & Order: Criminal Law & Order Special Monk Monk has amnesia. Monk "Mr. Monk Gets House "Poison' (In 47 32 47 47 ntent'Legion '14" Intent '14' 9 154273 Victims Unit '14 130693 'PG' 0[ 150457 Jury Duty" 'PG' 153544 Stereo) '14, L' U 929709 .18 18 8 18 Home Home America's Funniest Home Shocking Behavior: Shocking Behavior. WGN News at Nine (In Sex and the Becker'PG, WG .18 18 18 18mprovemen Improvemen Videos'PG' 266490 Caught on Tape '14. V Caught on Tape 2 '14, Stereo) 00 265761 City '14,. DL 990070 THURSDAY EVENING JULY 6, 2006 A: Adelphia,Ctrus B: Bright House D: Adelphla,Dunnellon I: Adelphia, Inglis ABDTI 6:00 6:30 7:00 7:30 8:00 8:30 9:00 9:30 10:00 10:30 11:00 11:30 46 40 46 46That's So Zack&Cody Philofthe That's So Movie; *** "Tazan"(1999, Musical) Voices of Emperor American Zack & CodyThats So S40 46 46 Raven 'G' Future 'G' Raven 'G' Tony Goldwyn. [ 291186Dgn Raven 'G 68 M*A*S*H M*A*S*H Walker, Texas Ranger '4, Walker., Texas Ranger 'P Movie: "DesoionCanyon" (2006, Western) Patrick M*A*S*H MW*A*S*H HALL) 68 'PG'7676186 'PG'7667438 V l 1389032 V' vS l 398780 : Dut , S il each. PGV 1308167 'PG' 'PG'5114273 SMovie: "Alien vs Predator" (204, Science. uie L .i Lucy Loue Cook- Cathouse: The Series 'MA' __"__ _' "!Madagascz Fiction) SanaaLathan. Z 999864381 f--. 'MA'-,'' ^ ,'- MA' Tourgasm 1.1743341 Movie: **** "Dodgeball:A True Movie: *** "Spir.Man 2" (2004, Action) Tobey Maguire, Moie: **** 'Robots"(2005) Voices Hollywood (A F _A UnderdogStory' 5902438 Kirsten Dunst (In Stereo) 9 60866803 of Ewan McGregor.463728 Sex S 97 6 07 907 Wh Can't I Room Sucker Free (In Stereo) Making the Making the Makin the Run's House Pirp M Next'PG' Real World- R6alWorld- ) 97 66 97 97 Beou'P Raiders(N) 202419 Band3'PG' Band 'PG' Band 3 N)) (N)'PGL' Ride(N) 956728 Rd Rd 71 Madness of Henry Vill National Geographic's Most Amazing Moments 'PG' Blackbeard: Terror at Sea'G' 8967254 Geographic's Most 71 'PG' 6936099 1998780 Amazing Moments -E 62 ~ "Jackie Chan's First Movie: ** "K-9" (1989) James Belushi, Mel Harris. Movie *** "TheDe 1977)Jacqueline Bisset, Movie ** "Sheena" .PLX- 62 Sike" B 95916186 (In Stereo) 90 24399896 Nick Nolte.(In Stereo)001427_2081425983 "(NBC 43 42 43 43 Mad Money 2937902 On the Money 9190902 Town Hall 9176322 Mad Money 9196186 The Idea With Donny On the Money 3186728 40 29 40 40 Lou Dobbs Tonight 09 The Situation Room Paula Zahn Now 0. Larry King Live [ 125761 Anderson Cooper 360 0[ 405419 ______ 24 745916 136877 145525 25 55 25 25 Forensic Forensic Cops'PQ L' Cops'PG. Hot Pursuit Hot Pursuit The World's Worst Drivers The Investigators'14 Hollywood Hollywood ) 25 55 25 25 Files'PG' Fes PC' 6868051 L,V 8200815 6884099 .16863506 '14, V 9181254 9184341'ro Juste'14, Justice'PGe PAN 39 50 39 39 Today in Washington 7758051 The Capitol The dome, rotunda and crypt of the U.S. Capitol. 267186 Capital News Today (p 4 37 4A 4 Special Report (Live) cc The Fox Report With The O'Reilly Factor (Live) Hannity & Colmes (Live) On the RecordiMth Greta The O'Reilly Factor S44 37 44 44 503525 Shepard Smith 19 0 B4019877 0- 4022341 Van Susteren. 8024631 N 42 41- 42U42 The Abrams Report Hardball [ 4039631 Countdown With Keith Scarborough Country Rita Cosby Live & Direct The Situation With Tucker S42 41 42 1516099 e Olbermann 4015051 4035815 4038902 Carlson ESPN 33 27 33 33 SportsCenter (Live) 09110099 NFLLive MLB Baseball Teams to BeAnnounced. (Subjectto Blackout) (Live) 'PG' 317544 portsCenter (Live) I EPN l34 28 M 4 34 Mike and Eating 2006 Hot Dog Eating Today at Wimbledon Marquee match from Wimbledon. Baseball Tonight (Live) Quite Frankly With 2Mike Contest Contest 6862815 (N) 06842051 6861186 Stephen A. Smith 1275964 L 35 39 3 35 In Focus on The Sports Ship Shape In Focus on PartyPoker.netAussie Best Damn Sports Show In Focus on Best Damn Sports Show Final Score S35 39 35 35 FSN(N) List TV'G' FSN Millions 837902 Period 824438 FSN Period 544235 1 1 36 1 F"Flor ida Saltwater Florida Fishing Report (Live) 502902 Sport Sprtsman Saltwater Fins and Ship Shape Florida Fishing Report _. 36 31 FlodaSport. Exp. F i i Fishing Adv. Joumal' G' Skins TVG' 552032 he P'lusCode number printed next to each, pro- PlusCode number. cable channels with the guide channel numbers using gram is for use with the Gemstar VCR P.lus+. Gee^^ fr h4^B^^ V^BB^ BB t^^^ h4B^ w ^^^B ^^^ ^ WJUF-FM 90.1 WHGN-FM 91.9 WXCV-FM 95.3 WXOF-FM 96.3 WRQO-FM 102.7 National Public Radio Religious Adult Contemporary Adult Mix Oldies J!W#M41 A I p I WIFL-FM 104.3 WJQB-FM 106.3 WFJV-FM 103.3 WRZN-AM 720 Adult Mix Oldies '50s, '60s, '70s Adult Standards aa 'm-w" 4wl. *o ~. -a -a &~ 6 ____ aa A AA A~& 060 I -n w-a f-w %mm fm q- q- m a- 40 mlbf-410%I-a ,mmopIft -9 4p O-W 40== - aam 40 fo M 4-o w om 4 4D h WN A -alom a goal qm ob ND -we adP =o 40 ml an *4MM doopq gmw 1b ep amm w-q 4mcm 0 41 -om S . 0 4. m S... 4 S i . "None ago am Gom sm 4 4000 anno 1. =M em 40 apW a 4 -" -w ANN awo Mow a- w - p - U - * * *0 * * * e *0 00 .0 0 0 00 0. *0 e0 0 0 0 0 00 0000 0 *e 0* 0 * 0 * .000 00o00 * me h 411W'om SP 4 0.7 II 'f'~ m a moo -=me- a I-1 -a a - .0 -4 - I a -a 4 -- a ~- 0 dipa I- .a. 1-4 a I- -- I- --- a 1- ~ -a a - 'a -a a- -a a- - a. I ~--a - 1 -~- - - - a '~ ~ - I- a a 4 1- - - - - 1 e - Need ' Dear Friend: The dynamic between a .0 omos .11ow -m -Noib 60- mw -. ho All upa- a Q a 4OMilOM Wall~- am41M apqt -a 4DGols- -na ua, A 44m, al40W--aOW a- WMP -W l 4 spp 0 4MI. -110 4m d~an, Oln, __ aND 41 a a1 Mmum umo --=Mom ftdMAM 410M - 0 G 40alarm a 4 -s pa aMO 411 0 ,Available ft !* aSyndicated Content- "Op quo 40 0 U ~am "Copyrighted Material In fta wr 4 - ,Syndicated Content" rom Commercial News 'Provi 4m-a-- 4-1 - a Mo-*-a a- -a 0 -b-- ho aW - a- -- U mother, nope anyone wno is imneresieu win give Dennis says I should be content it a try . === = :,Local RADIO; 0 II I I I CnRus Coumy (H) Ci-iRONICLE IF-JrITZrATIMVT A 1b-* 0- 1 & m * * i CITRus COUNTY (FL) CHRONICLE ,,'we &1;d 4b - d- - -' 40- op 4w 4WD qw 4DS aVI gas oo * w * _ 1{ ; -M w all Q "Copyrighted Material "''. Synd icated ContentI Available from CommercialsNews Providers" b TD ..-^^ ^ doomfom ;flu,^^ -^^^ a Lamw~~,. ~ 4Ud~ ~-w featI'^ k~v. ki 4LI p I 4mm dl ~~gtk 0 0 0 mO 0 t w oeff n -lr 04 0 0 &M m-.s o 'a Citrus Cinemas 6 Inverness Box Office 637-3377 "The Devil Wears Prada" (PG-13) 12:50 p.m., 4:10 p.m., 7:40 p.m., 10:40 p.m. "Superman Returns" (PG- 13) 12:15 p.m., 3:45 p.m., 7:15 p m, 10:45 p.m. Digital. No pass- es or super savers. "Click" (PG-13) 12:40 p.m., 4:15 p.m., 7:45 p.m., 10:30 p.m. "Fast & the Furious 3" PG- 13) 1 p.m., 4:30 p.m., 7:50 p.m., 10:35 p m. "Nacho Libre" (PG) 1:05 p.m., 4:25 p.m., 8 p.m., 10:20 p.m. . "Cars" (G) 12:30 p.m., 4 p.m., 7:30 p.m., 10:25 p.m. Crystal River Mall 9; 564-6864 "The Devil Wears Prada" (PG-13) 12:20' p.m., 2:55 p.m., 5:30 p.m., 8:05 p.m., 10:50 p.m. Digital. "Superman Returns" (PG- 13) 12:15 p.m., 12:45 p.m., 3:45 p.m., 4:1,5 p.m., 7:15 p.m., 7:45 p.m., 10:45 p.m. Digital No pass- es or super savers. "Click" (PG-13) 11:40 a.m., 12:10 p.m., 2:20 p.m., 2:50 p.m., 4:55 p.m., 5:25 p.m., 7:30 p.m., 8 p.m., 10:10 p.m., 10:40 p.m. Digital. , "Fast & the Furious 3" (PG- 13) 11:50 a.m., 2:35 p.m., 5 p.m., 7:20 p.m., 9:50 p.m. "The Lake House" (PG) 12:05 p.m., 2:45 p.m., 5:20 p.m., 7:40 p.m., 10:15 p.m. "Nacho Libre" (PG) Noon, 2:15 p.m., 4:30 p.m., 7 p.m., 10 p.m. Digital. "Cars" (G) 11:45 a.m., 2:25 p.m., 5:10 p.m., 7:50 p.m., 10:30 p.m. Digital. Times subject to change; call ahead, A -m m p tD p SA 4 SD Today's HOROSCOPE Your Birthday: In the year ahead, try to both expand ,and consolidate contacts you have in the business world. These connections could develop into some- thing profitable for you. Cancer (June 21-July 22) Trying to foist your ideas or commands upon others invites rejection. Unless you take the necessary time to explain your pur- poses, you can't expect others to go along with you. Leo (July 23-Aug. 22) Unless you put your imag- ination and ingenuity to work in order to simplify difficult tasks, you'll continue to do things the hard way. Virgo (Aug. 23-Sept. 22) You're the type of per- son who will find some time to relax and enjoy yourself when your sanity tells you to. But you might not be able to let go of things that should be treated lightly. Libra (Sept. 23-Oct. 23) Unless you stop and take the time to channel your efforts toward specific objectives, you are likely to waste a lot of time and energy doing a lot of things that will count for little. Scorpio (Oct. 24-Nov. 22) Plans may not go as smoothly as you'd like, so, when this happens, try to take things in stride Instead of becoming too irritated. Sagittarius (Nov. 23-Dec. 21) You may be in for a pleasant surprise, especially where personal busi- ness is concerned. A seemingly negative situation may suddenly sprout new opportunities. Capricorn (Dec. 22-Jan. 19) Be sure not to let anybody down by holding up your end of an agree- ment, especially if the other guy is doing everything he said he would. Aquarius (Jah. 20-Feb. 19) Know that you have a remarkable ability to turn a losing situation into some- thing quite profitable. Don't hesitate to put this gift to the test, if and when it becomes necessary. Pisces (Feb. 20-March 20) Persons who may prove to be a bit too difficult for others to get along with should be putty in your hands, thanks to your charm. Aries (March 21-April 19) You might find it diffi- cult to let others know just who and what you are. If you take a little time to think things through, you'll come up with a great way to do so. Taurus (April 20-May 20) Impatience and rest- lessness is your archenemy, especially if you are trying to get a quick commitment from someone whose help you need. The "yes" will come when you stop pushing. Gemini (May 21-June 20) -A joint endeavor could turn out to be quite costly for you, especially if you allow it to be directed by another Instead of yourself, *f 2 A amft 'I -41 1 01 I Today MOVIES --I COMICS THURSDAY, JuLy 6, 2006 SC 4billolb Mj 10 - 4b Im !, AE TRb"Y, JULY V,v CC OH To place an ad, call 563-5966 Classifieds ... *?^*-u^^ .^H IBS --.' , . . a:Z7 Classifieds In Print and Online All The Time Clrca/ -L -A""Retarat &-"mrde 1 ma Va II -....mmI IMaterial "Copyrighted Material J Syndicated Content Available from Commercial News Providers" L 0o . Attractive 70's Widow needs male ballroom dancing partner, If qualified & Interested call (352) 489-3472 Black Male, 51 Seeks soulmate Race unimportant Kids welcomed Crystal River (352) 228-2660 LONELY LADY 51 yr. old large yet proportioned lady in search of some one. who would lke to spend time with a friend or companion, Race unimportant, Call me at 352-400-5037 RELOCATING TO CITRUS COUNTY Classy and charming . lady, 50, loves antiques and horses. Seeking non-smoking, caring, romantic male for marriage. (941) 441-7044 B*- FREE SERVICES* Cars/Trucks/Metal Removed FREE. No title OK 352-476-4392 Andy S..Tax Deductible Re-eiot 2 Buff Orpintton Roosters, Bring your own container to pick up. (352) 447-3022 Auto Undertakers Junk Coar Warted (352) 795-junk (3456) COMMUNITY SERVICE The Patr. Srellie if ao.aiiac4e ior people rno need o ;erve rrelr c'mrrunit, *.ervice (352) 527-6500 or I (352) 746-9084 Leave Message Free adorable Puppies to good homes. (352) 465-0684 #1 employment source! ClM ssfie 0 FREE GROUP COUNSELING Depression/ Anxiety (352) 637-3196 or 628-3831 FREE KITTENS 3 black/white 1 grey/ white 1 tiger stripes. Litter box trained. Call (352) 726-1164 FREE REMOVAL OF Mowers, motorcycles, RV's.Cars. ATV's, Jet skis, 3 wheelers, 628-2084 FREE STEEL DOOR with window, 32x79 (352) 637-6310, leave msg FULL SIZE BED SET Like new, no frame S 6039 E. Rush MAGIC CHEF WASHING MACHINE, currently not working, must pick up (352) 503-3686-lv msg SWIMMING 18' BOXER, M. brindle w/ white patch mid-chest; last seen 6/29 on C-40; has heart cond & needs meds. REWARDI (352) 447-3296 COCKER SPANIEL Female, gold; REWARD. near Nobleton by River. 7/1 (352) 793-2721 CORGI, F, bik/tan/wht 7/3, area or Heinanco Noazarre Chur.cn (352) 302-2398 Gold Bracelet-REWARD Dunnellon Vic. Bank, Walmart, etc. Sentimental value. (352) 489-4270 ITALIAN GREYHOUND Wht & Fawn; 9 lbs., Vic. of Eden Gardens, Glory Pt. 7/2 REWARD (352) 560-7023 Lg.COCKER MIX (Older) Golden/red; Vic, of Spartan Ave. 7/3 352-428-0147/684-1158 LOST BR/LHAIRED CHIHUAHUA Near 486/Trucks Rd. Child's B-day gift. Please call 352-228-2168. SIAMESE CAT Female seal pt, blue eyes, micro-chlp; Vic of Floral City 6/24. (352) 344-1483 SM. GREEN PARROT Leisure Acres, Lecanto A/I P fl....-.. BASbEll DuO Vic, of 41 In Hernando, FDivorces IBankruptcy, Nor WCmI.Y Su L f ARRESTED? ACCUSED? ACCIDENT VICTIM?. HURT?Talk to a lawyer NOW. Call 24 Hours. Personal Injury and Criminal Defense. A-A-A Attorney Referral Service (888)733-5342, 'Protect Your Rights, FCAN ATTEND COLLEGE ONLINE from home *Medical, *Business, 'Paralegal, *Computers 'Criminal Justice. Job placement assistance. Computer provided. Financial aid If quall- fled. (866) 858-2121 wwwOnlineTldewater Tech.com FCAN *CHRONICLE* INV. OFFICE 106 W. MAIN ST. Courthouse Sq.next WHEEL OF A DEAL I FOR ONLY $6.00 Pick oui caiised .i Torrporiuoatlr' e1 Into our F.Mw Tuesday Wheels Section. (352)563-5966 ----- Il MR CITRUS COUNTY REALTY ALAN NUSSO 3.9% Listings INVESTORS BUYERS AGENT BUSINESS BROKER (352) 422-6956 ANUSSO.COM I Will do Medical Care. Dr's appt.erraods, respite, overnight. Uc, w/ref. (352) 795-2909 IS STRESS RUINING YOUR RELATIONSHIPS? Buy and Read DIANETICS by L. Ron Hubbard Call (813) 872-0722 or send $8.00 to Dlanetics, 3102 N. Habana Ave., Trrpao FL .33,0- FCAN FRIENDS NRA DINNER/AUCTION 7/20/06, Tickets $35.00 352-302-3876 352-422-2946 CPR, F.A., AED HIV, BBP, 02 Classes Offered many times per month, Call for Info, (352) 628-9538 age "Copyrighted Material Available from Commercial News Provides" Available from Commercial News Providers" 0 2 a % s - CLOSER/ RECEPTIONIST Title Insurance Co. Starting pay: $9hr no exp-$12 w/exp. 2 locations, Fax resume to: 628-6052 EXP A/R CLERK Title work experience preferred. 5 day week, 8am-5pm Good payl Good Benefitsl Fax Resume to: (352) 726-4966 JOBS GALOREIII EMPLOYMENT.NET LEGAL SECRETARY POSITION With Inverness Law Firm. Experience preferable. Salary Commensurate w/ experience. Send Resume to: 452 Pleasant Grave Rd. Inverness, Fl 34452 BARBER, STYLIST, NAIL TECH (352) 628-4888/ (407) 484-1579 c ed *S Have clients for youl (352) 628-47 4 TECHS. 637-3556 Booth rentals preferred. Administrative Asst. Recruiting Dept We a e seeking a dynamic administrative individual to support our Recruiting Department. Microsoft Office Is required;, The desired candidate must be a leamn ploiier creola.e aeroil ' oriented, self-orou motivated, organized and be able to multi-task, Compeintitie pay & Asbenefits. Email or fax resume to Fax 352-382-0212 ndvblton@ therapymgmt.com CITRUS ORTHOPEDIC & JOINT INSTITUTE DR PETRELLA'S OFFICE BILLING SPECIALIST \ EXP'D ONLY Excellent Salary, o Pension, Group Health Incentives, ' Medical office Fax resume to: 352-746-4748 or email tina@cltrusortho.nef CPR, F.A., AED, HIV, BBP, 02 Classes Offered many times per month. Call for Info, (352) 628-9538 Cypress Cove SCare Center Our In-house Rehab Dept Is looking to S ill the following .positions: Full Time: PT/OT/COTA PRN/WEEKENDS: PT and PTA Great Benefits Package. Competitive S Salaries. To oln our team call: (352) 795-8832 EEO/DFWP finaftmtusmrfgiv S-j ~ini -l - DIETARY POSITION AVAILABLE Must be able to work flexible hours, am, pm shifts, some cooking exp, helpful but wil EXPERIENCED ONLY SURGEON'S OFFICE PT LPN Front Desk/ Biller Hours are negotiable Fax Resume to Nettle 352-746-0333 FT OPERATING ROOM NURSE Been working weekends for years???? Tired of Call and Working Holidays??? Due to our continued Growth, the HEALTHSOUTH CITRUS SURGERY CENTER Is now accepting applications from qualified RN's with OR experience, to Join our outpatient surgi- cal team. We cur- rently have a full time position with excel- lent benefits. No weekends or holidays and flexible scheduling. Please mall resume to: IMMEDIATE OPENING FULLT TIME BILLING AGENT Needed for Doctors office. OBGYN Exp a PLUS. Fax Resume to: (352) 794-0877 LPN 7-3 & 3-11 RN Weekend Supervisor Your Experience counts Crystal River Health and Rehab Center 136 NE 12th Ave. Crystal River, FL 34429 (352)795-5044 HR/ Connie DFWP/EOE Medical Billing Specialist The preferred candidate will have 2+ yrs. medical billing exp., strong data entry and good communication skills, Medicare billing, electronic, paper claims processing and DDE a plus, We offer competitive compensation and benefits Including medical, dental, life holldo poa and .ocohior. roime if you are Interested In Joining a growing company, please send your resume for consideration to: Director of Recruiting P.O. Box 1214 Homosassa Springs, FL 34447 Fax (352) 382-0212 Or email Vbolton@ therapymgmt.com Nurses Cypress Creek Juvenile Offender Correctional Center, a residential program for 96 high and maximum risk males committed to the Dept. of Juvenile Justice Is recruiting RN and LPN, Full time and part time positions available Apply In person at Cypress Creek 2855 W Woodland Ridge Dr. . Lecanto, FL 34461 Or fax resume to 352-527-2235 Drug Free Workplace /EEO PHARMACY TECH NEEDED Coleman, FL Area. Fax Resume: (315) 388-4142; E-mail: chacker twcnv.rr.com; or Call: (800)841-1990 PHYSICAL THERAPIST Wanted for Well- established business. Fax resume to:. (352) 726-2106 P/T BARTENDER/ COCKTAIL WAITRESS Call Mon-Wed Btwn 3 & 5,PM Inverness Elks Lodge 726-2027 SERVERS Prestigious country club in Lecanto now hiring. Fine dining or country club exp. preferred. Exc. hrly. rate. P/T and F/T (benefits) available. Apply Black Diamond HR, Rock Crusher RV Park, Rock Crusher Rd. Crystal River APPOINTMENT SETTERS NEEDED Write your own pay check $$$$$$$ Exp. preferred Call 352-628-0254 LICENSED 220/218 AGENT Needed for busy Agency. Must be energetic, self motivated, sales oriented & a team player. Salary based on exper + comm. Call (352) 400-1112 PEST CONTROL SALES Exp. Preferred. Average S225.00 per lead. LOTS OF LEADSi1ill Apply in person 6421 W Hom.osaa-. ir (352) 628-5700 ESTIMATOR/ SALES PERSON Motivated, organized & exp. pref'd, Apply In person: Michaels Floor Covering, Lecanto (352) 341-0813 RETAIL CLERK Bu;., rhop, Ir. Be. hiiimDunnelion need self-motivated, resp., quick learner. Cust Svc Skills & H20 Analysis. Pool Exp. a plus. Fax Resume to: 352-746-4574 or call: 352-746-7444 C5i-NiaiE SALESPERSON NEEDED Commission Only Foi ,Tore rinorrTotic.r, Contact PeiL ,4 352-564-2915 WHEEL - OF A DEAL SFOR ONLY $6.00 SPick your classified I* rpc.:ration m a up pinto -ur NEW Tuesday Wheels (3 Section, I (352)563-5966 $$$$$$$$$$$$$$"$ LCT WANTS YOU!! Immediate processing for OTR drivers, solos or teams, CDLA/Haz iequ;ed Great 99-04 equipment Call Now 800-362-0159 24 hours LPN5 S20/HR. Interim Health Care (352) 637-3111 RECEPTIONIST Needed for Chlro, Office, Apply In person: Hwy 44 CR or call (352) 795-8911 -"--- -*" F/T RN/LPN Needed fora Physicians office. Benefits Include: SInsurance/401K, Competitive salary. Fax Resume to: (352) 746-6333 L--E-l We are Currently Hiring PT Dietary Aides Nights Apply In Person SURREY PLACE 2730 W Marc Knighton Ct (352) 746-9500 g-- or results Includes benefit package. Pope John Paul II Catholic School, Lecanto, Fl. (352) 746-2020 or email resume to Inaleap@plo2.net EXPERIENCED CONTRACTOR SCHEDULER For manufactured home dealer. F/T, M-F. Fax Resume to: (352)795-3123 LIC. REAL ESTATE AGENTS NEEDED Exc. pay plan. Florida Realty & Auction (352) 220-0801 FRAMERS/SHEETERS $$$ Local $$$ 352-302-3362 On Top of the World Communities Construction S Labor Full-Time positions. Must have a willingness to work & a valid FL Driver's license Grounds & Golf Course Maintenance Workers Full & Part-time positions available. Carpenter Full-Time carpenter. needed to work with our in-house service department Applications available-at Main Gate SW99g Street Road -Ocala .i Ca "Rndyour-place in the world" mw "DHP/IEOE YOUTH MINISTER Thriving, growing, Episcopal Church In dwntwn Inverness, FL, seeking a P/T Youth Minister. Call for job description: (352) 726-3153 On Top of the World Communities Experienced Coffee Shop Counter Attendants Your experience will earn you a lead position in our beautiful new facility. Lead and line personnel needed. Earn top wages and benefits! Applications at Customer Service Center 8447 SW 99th Street Road Ocala or send resume to: humanres@mfi.n et Come "Find your place In the world" 67T D"We/EOE. BAKERY HELP & PKG & DELIVERY EARLY MORNINGS Apply Monday Friday before 10am at 211 N. Pine Ave., lnv. *BARTENDERS *COOKS -SERVERS Exp, preferred. High volume environment, COACH'S Pubatery 114WMain St, Inv, 11582 N,. Williams St., Dunnellon EOE manaagemnt.com EOE COOKS NEEDED Dlllon's Inn 589 S E Hwy 19 Crystal River ' .FRY COOK *HOSTESS/CASHIER Applications now being accepted at between lpm-2pm: Cockadoodles Cafe 206 W. Tompins St. Inverness LINE COOK & KITCHEN PREP Charlie's Fishhouse Restaurant Apply In Person Downtown Crystal River RESTAURANT RUBY TUESDAY In INVERNESS Is OPENING SOON and Is seeking accomplished COOKS, SERVERS, HOSTS & HOSTESSES We offer flexible schedules, a fun working environment and Day One benefitsI Management applications are always accepted Apply In person at: 2235 E. Gulf to Lake Hwy. tuesdav.com EOE TUESA 81" 1 L 1, S TR U s'r s 1) 1 N" 0 1z C E PROBATES 795-9666 ('1'NSUk1' I'MA, N1 %I I FREE ASSISTANCE for innocent victims of crime. Leave details, 352-628-6481 or odvocate4victims &aol.com DECLASSIFIED Cmus CouNTY (FL) CHRoNicLE 6C TiiuRsDAY. TuLy 6. 2006 il We need experienced new & used automotive sales, body repair & detail personnel that are willing to work at one of the Best Dealerships in Florida. Make great money, with all the benefits (401k, group insurance, paid vacation, holidays & Sundays off) Applications Wilbe accepted 2901 West Hwy. 44 Invern anytime from 8amr until Spm Mon. through trig Ask for a Manager and change your life forever with a new start WE ARE A DRUG FREE WORKPLACE The Center for the Intrepid will guarantee that our nation's heroes will receive the best possible medical treatment physical rehabilitation, advanced skills training and overall care available. i CrORus COUNTY (FL) CHRONICLE A/C LEAD INSTALLER FOR CHANGE OUTS & SERVICE Needed Immediately Pay commensurate w/experience (352) 628-02540 A/C MECHANIC 5+ yrs exp, Installs, change-outs, duct work. Clean license, (352) 344-0636 AC SERVICE TECH MIn. 3 yrs exp. w/valid D/L Exc pay & benefits APPLY WITHIN: CURRIER COOLING & HEATING * 4855 Suncoast Blvd. HOMOSASSA (352) 628-4645 AUTO DETAILERS P... ort Richey,. Brooksyllle. Inverness, & Croslal Pler rear Dr LIC & bacvgr-,urn,. creck req DFiP (352)302-2863 j Block Masons, Mason Tender & General Laborers AMut r,.ae owr. ransp.,rrarlor, Call (352) 302-8999 BUSY BODY SHOP Ir. neea of amlitiou'j Auto Refinish Technician Only Quality Craftsman need apply. (352) 628-4878 C."A Trades /Skills Tr ades c.n /Skills I W-7 Trades c.n /Skills I . I r--l Cabinet Co. In Sumtervllle Needs: CABINET DESIGNER Layout counter tops, pricing etc, 20/20 knowledge. Take charge personality. (352) 793-2396 CARPENTER Exp, needed. Must trans. (352) 794-7606- seirvlces.com CARPENTERS & FRAMERS Established company. Good benefits. Contact Adam 352-274-2914 DRIVER Dump Truck/Transport 2 yrs. rmn, exp, (352) 799-5724 ELECTRICAL Maronda Systems Is seeking Residential Electricians, for the Ocala Area, Must have experience as well as own truck and tools, Top Pay and benefits Please, contact Ron @ (352)266-1802 EXP. Aluminum Installers White Aluminum Products (352) 746-3312 EXP. PAINTERS Needed for local work, 352-341-3553, 726-6761 EXP'D HEAVY EQUIPMENT MECHANIC FOR MINING COMPANY Excellent Pay & Benefits 800-387-9477 M-F, 9AM-4PM EXPD LAWN CUTTER & LINE TRIMMER Must have own transp. (352) 794-4128 DRYWALL HANGERS Needed Immediately. (352) 447-1022 Exp'd Plasterers, Non-Experienced Laborers Wanted Steady work and paid vacation & benefits, Transportation a must, No drop offs, 527-4224, leave message. F/T DRIVER Class B (352) 302-3915 F/T MECHANIC Needed, good pay, start Immediately, (352) 746-4693 or 257-3438 FINISH BOX TRACTOR OPERATOR Call 0 (352) 465-0963 FRAMERS NEEDED Must have own transportation 564-9213 DRIVERS * IMMEDIATE OPENING 30 + year manufacturing Co. Is looking for qualified drivers w/valild Class "A" CDL and 2 years minimum experience.We offer a competitive bereflt package of Medical Insurance, 401K, Paid Vacation & Holiday & Short Term Disability. Apply In person at: Great Southern Woods 194 C.R.527-A, Lake Panasoffkee or Call Terry at (888) 238-3771 * A/C Tune up w/ Free permanent filter + termite/Pest Control Insp.w/ Free Termite monitors Onlyh iS 95 for 0off, (352) 628-5700 cddc636870 KEN'S MULTIPLE SERVICE Pressure Wa:rng General l.ainrerarCe Lavwns Hauling Cleanup, Free et 601-2342 60 r "FT Bucket :1 JOE'S a Tree Service P f ere6 Stumrp Grirdin,. : I ."] 1VP6; *r .etr ,..k I S" LI & Ir. 228-1354 A TREE SURGEON UcAlr, E~p a. rrien.1', Sser.. Lowest rates free er -time. 352-860-1452 AFFORDABLE, - I DEPENDABLE, HAULING CLEANUP, i -rair Tree: Brui'r, I I pll Furn Ccr,:l SDeOriS. & Grage I 352-697-1126 All Tractor & Dirt Service Lant Clearing, Tree Ser. Haullng Bu;rinoi3glrng SDrklewar, 302-6955 D &R TREE SERVICE All phases of tree work, no Job to big or too DOUBLE J STUMP GRINDING, Mowing, Hauling,Cleanup, SMulch, Dirt. 302-8852 D's Landscape & Expert Tree Svce Pelsonalized design. Cleanups & Bobcat. work'. F-ll/r'ck & foa 352-563-0272. FJM LLC Lanascope Tractor & Tree Service. ', Bushiog, debris clean up, stump grinding, tree trim, land clearing, any size Job, 352-400-2790 P AUL'S TREE & . I CRANE SERVICE I ServIng All Areas. Trees Topped, Removed. ' I FREE ESTIMATES. SLlcensea .I In:uJea .. (..)58 1 s FJMI I LLC Landscape Tree M&C CLEAN UPS & BOB CAT SERV Trash & Brush removal, const. debris, Free est. (352) 400-5340 R WRIGHT TREE SERVICE, tree removal, stump grind, trim, Ins.& Uc #0256879 352-341-6827 + WHISENANT* Full TREE SERVICES Full, Equipped ii nlns (352) 503-3805 , COMPUTER TECH MEDICS Hardware & Software Internet Specialists (352) 628-6688 PC Itoubleshooters We cleon oplimIze PC h Call ro In home appt. Ask for Mark (352) 219-7215 (352) 586-1728 --- ------ #1 Mr. Fix it Ia loiallIl t N o10 Dig ,:.r smr ll Call 220-9326/382-3647 I VChris Satchell Painting & Wallcovering.All work 2 full coats.25 yrs. Exp. Exc. Ref. Llc#001721/ Ins. (352) 795-6533 All Phaze Construction Q.,uaiir, politlinrgS ie. poIr. Fou, ii,. nr 255"c 352-586-1026 637-3632 CHEAP/CHEAP/CHEAP DP Pressure Cleaning & Painting. Licensed & nrured 637-3765 George Swedllge Painting- Int./Ext. Pressure Cleaning- Free est. 794-0400 /628-2245 Henry Trochez Painting Press. wash, affordable. Prof. job. Lic#30555 Insured (352) 302-4928 MICHAEL DAVIDSON * 20+ yrs. exp. Painting contractor/ handyman. Uc.3567 (352) 746-7965 POOL BOY SERVICES I Total Pool Care I I Acrylic Decking 352-464-3967 1 .: INTERIOR/EXTERIOR & ODD JOBS. 30 yrs J. Hupchick Uc./Ins. (352) 726-9998 A BOATERS FRIEND Cliff's Outboard Repair 30+ yrs Exp. Reas. Rates (352) 746-2284 Affordable Boat Maint. & Repair; Mechanical, Electrical, Custom Rig. John (352) 746-4521 PHIL'S MOBILE MARINE SMl Make: & Models All Work Guaranteed 795-3674,220-9435 QUALITY OUTBOARD REPAIRS; Full & dock side service. Morrill Marine (352) 628-3331 AT YOUR HOME Res. mower & small engine repair; Uc#99990001273 Bob, 352-220-4244 MOWER REPAIR Hernando, Pick up & Delivery, Don Mead (352) 400-1483 BATHTUB REGLAZING Old tubs & ugly ceramic tile Is restored to new cond. All colors 30 yrs exp. Reasonable rates, 4 hr min. Cert. Home Health & Hospice care (352) 344-2436 I Will do Medical Care. Dr's appt, errands, respite, overnight, L.c, w/ref. (352) 795-2909 Child Sitting In my Home, Age 0 to 6, Flexible days & hours, Reasonable Rates (352) 795-6997 VChris Satchell Painting & Wallcovering.AII work 2 full coats.25 yrs. Exp. Exc. Ref. Llc#OOI721/ Ins. (352) 795-6533 AAA HOME CLEANING Start @ $12/hr Deep Cleaning Svc Avail; Weekends Avail, Call Summer @352-257-9091 CLEAN BREEZE FREE ESTIMATES 9 yrs. exp. dc./Ins. Dependable/Reliable Sarah@(352)726-7604 DAILEY'S CLEANING Family owned. Comm/Res. w/ref. Teresa (352) 503-3296 HOMES'& WINDOWS years. Kathy (352) i 465-7334 The Window Man Free Est., Com./residential, new construction Uc. & Ins. (352) 228-7295 Additions/REMODELING New construction Bathrooms/KItchens Uc. & Ins. CBC 058484 (352) 344-1620 BEAUTIFUL RESULTS WILL CONSTRUCTION Uc/Ins #CBC1252474 Adds/Remod 628-2291 1326872 FL RESCREEN 352-563-0104/257-1011 One panel or complete Pool cage rescreen, Superscreen w/lOyr. fact. warr. Fam.owned & operated for 29 yrs. FREEDOM RESCREEN Pool Cages, Window Scrns, etc. Will beat all estimates. Llc# 2815. (352) 795-2332 Screen rms,Carports, vinyl & acrylic windows, roof. overs & storm panels, garage screen doors, siding, soffit fascia, Llc#2708 (352) 628-0562 FREEESTIATES! Henry Trochez Painting Press. wash, affordable. Prof. lob. Lic#30555 Insured (352) 302-4928 KEN'S MULTIPLE SERVICE Pressure Washing, General Maintenance. Lawns, Hauling, , Cleanups. Free est.' 601-2342 PICARD'S PRESSURE CLEANING & PAINTING Roofs w/no pressure, I,,,, wm heatvs.o2n5\ O \ #1 IN HOME REPAIRS, paint, press.wash, clean roof&gutters, clean up. 10169757 344-4409 r - I do It alll No job too big or small. Call 220-9326/382-3647 I Uc#99990255609 V CALL ME FOR Small home repairs the big contractors don't want. I'll return your call. Uc# 25995 (352) 613-5427' A HIGHER POWER Ceiling fans, Ughts, etc. Uc #999)99022251 422-4308/344-1466 A# I L&LHOUSEHOLD REPAIRS. Ho lob too smioll 7aOi am. Uc #3008 (352) 341-1440 AAA HOME REPAIRS I.Ilalr.t & repair prob- *emrrSwimming Pool Rescreen99990000162 352-746-7395 S AFFORDABLE, S DEPENDABLE I HAULING CLEANUP. PROMPT SERVICE I I Iro.r.. Trees, Brush, I app Furr, Const, N SDebris & Garaes 352-697-1126g Andrew Joehl Handyman. General MalntenancelRepairs Pressure & cleaning, Lawns; gutters, No job too small Reliable, Ins Q2n25ZJ 352-465-9201 REPAIR MAINN. INC. Offering ar cefull rangof services.LIc.0257615/insc WaIl & Ceiling Repairs pFrlming irn i ceillr.g-. Framing. 30 yrs. exp. 344-1952 CBC058263 F-- A+ TECHNOLOGIES Plasma TV's Installed. Stereo, phone, cable & more (352) 746-0141 CITRUS ELECTRIC All electrical work. Uc & Ins ER13013233 352-527-7414/220-8171 FULL ELECTRIC SERVICE Remodeling. Lighting. New Installl Uc & Insur 12767(352) 257-2276 I 1 Mr. Fix It I do It alll NO Job too big or small. Call 220-9326/382-3647 Uc#99990255609 ,,- --,-- -- -, l All of Cithrus Hauling/ Moving Items delivered, clean ups.Everything from A to Z 628-67M AFFORDABLE, | DEPENDABLE, HAULING CLEANUP, I PROMPT SERVICE I T rash, Trees, Brush, I Appl. Furn, Const, SDebris & Garages | 352-697A1126, Always Ready, Hauling. llght moving, power wosring & painting. dc & Ins. (352) 522-0520 (352) 220-9223 Apple Fum.'& Trash Removal, Moving? YOU CALL ...I'LL HAUL Lqrry270-3589, 726-7022 C.J.'S TRUCK/TRAILER Low $$$/Same day serve Furn., appi, trash, brush, 726-2264 201-1422 J&J Moving & Hauling" Clean Ouls, Relocations Odd Jobs, Yard Work (352) 628-9370 KEN'S MULTIPLE SERVICE Pressure Washing, General [.,loinernance, LOwrf,c. Hauling. Cleanups. Free est,. 601-2342 , M&C CLEAN UPS & BOB CAT SERV Trash & Brush removal, const. debris, Free est, (352) 400-5340 WE MOVE SHEDS 564-0000 CARPET FACTORYDiract Restretch,clean, repair Vinyl, Tile, Wood, (352) 341-0909 Shop at home All kinds of fences JAMES LYNCH FENCE Free estimates, (352) 527-3431 A 5 STAR COMPANY Go Owens Fencona. All types.Free estimates Comm/Res.'628-4002 ALUM~INUMi Siding,Soffit & Fascia, Skirting,Roofovers, Carports, Screen Rooms, Decks, Windows, Doors, Additions . AB LUTIELYB EST PRICES Free Estimates. All Types 20 yrs exp. AC#27453 (352) 795-7095, Dallas BEACH FENCE Free est., Uc.#0258336 (352) 628-1190 813-763-3856 Cell OAKHILL FENCE Specializing In Farm Fence. Uc /free esl (352) 302-8226 IRRIGATION- New Systems & Repairs Ins Uc 3000 D/ L Evans (352) 637-5825 1. #1 IN ROOFINGI HOME IMPROVEMENT SERVICES ROOFING SPECIALISTS New roof within 15 days guaranteed. (Weather permitting) free root asfmafes 1-877-481-ROOF (7663) t In busInress for 22 year ICf#CCC058227 #1 In Serv. Hise Roofing New const. reroofs & lepair 25 -/rs aXp leak spec 1CCC1327059 (352) 344-2442 'J.T.Neely Roofing Reroofs, new roofs & repairs (352) 637-6616 Uc. CCC055011 John Gordon Roofing Reas, Rates. Free est. Proud to Serve You, ccc1325492. 795-7003/800-233-5358 RE ROOF SPECIAL 2i square. 3.195 12/riWa"rr PC0067,i 39 All Tractor & Dirt Service Land Clearing, Tree Ser. Hauling. Bushhogging Driveways 302-6955 Bannv Dye's Concrete Concrete Work All types ULc, & Insured, RX1677, (352) 628-3337 Concrete Slabs Driveways, patios, boat shed & RV Slabs, etc. Pavers, Ins, CRC1326431 Mario (352) 746-9613 CONCRETE WORK. SIDEWALKS, patios, driveways, slabs, Free estimates, Uc, #2000, Ins, 795-4798." r POOL BOY SERVICES I Total Pool Care I Aclc Decking I S352-464-3967 e El ImmiI I II BIANCHI CONCRETE Driveway-Patio- Walks. Concrete Speclalists -Uct2579 /Ins. 746-1004 ROBBINS CONCRETE Concrete Slabs & Pumping cct 149 352-302-0345,302-0263 ROB'S MASONRY S& CONCRETE Slabs, driveways & tear outs Uc.1476 726-6554 Addiihons/REMODELING New construction Bathrooms/Kitchens Uc Ilns CBC 058484 (352) 344-1620 --- --- AFFORDABLE, | DEPENDABLE, | HAULING CLEANUP, PROMPT SERVICE Trash, Trees, Brush, Apple. Fumr, Const,e Debris & Garages | S352-697-1126 BEAUTIFUL RESULTS WILL CONSTRUCTION Uc/ins #CBC1252474 Adds/Remoad 628-2291 Call Tacumsa Contracting for quality additions, remodels & repairs. Free Estimates CBC1253431 (352) 489-2581 DUKE & DUKE, INC. Remodeling additions ULc. 9 CGC058923 Insured. 341-2675 Wall & Ceiling Repairs Drywall. Teoturing, Painting. irnyl ceiling, Framing, 30 yrs. exp, 344-1952 CBCO0Z263 Ston VanDykes Backhoe Service. Landclearing. Pond Digging & DItcning (352) 302-7234 (352) 344-4288 r-----, 1 AFFORDABLE, DEPENDABLE, * HAULING CLEANUP, I PROMPT SERVICE I S Tra Trees. Bruzr.r. "ppi Fuir Cornt, SDean: & Garoage. S352-697-1126 *----- -U All Tractor & Dirt Service Land Clearing. Tree Set Hauling Bushhogging Drive ways 302-6955 DONALD KERNZ'S M H dermoltion, landclearing & Const. debris (352) 634-0329 Excavation & Site Dev. BJL Enterprises Uc #CGC062186 (352) 634-4650 FJM LLC Landscape. Tracor & Tree Service Bushhog. debris clean up. srump grinding, .ee rim, land clearing. arny size jo. 352-400-2790 HAMM'S BUSHHOG SERVICE. Pasture Mowing, lots, acreage. Licensed & Insured (352) 400-5233 HD ENVIRONMENTAL HeoVy Mowing, Pa- rure, Clearnng (352) 422-2591 M&C CLEAN UPS & BOB CAT SERV Trat'. & Brunr. remov.ol. conl aebns r.--- .. n, '" nn Bjn CERAMIC TILE INSTALLER BILL'S LANDSCAPING Bathroom remodeling, MJlor,, PlaoE,S oO. handicap bathrooms. Cleanup, LIc/lns. #2441 795-7241 (352) 628-4258 CUTTING EDGE Ceramic D's Landscape & Expert Tile. Lic 42713, inrurea Tree Svce Peroroiized Free Esltrnofes desugn Clsonups & i Sod 352-563-0272 RAM Lardscaplrig & lawn care. Specializing In Pruning, Call Me Wall & Ceiling Repairs (32)637-6588 Drywall, Texturing, ROBERT LANDSCAPING Painting, Vinyl ceilings, & LAWN MAINTENANCE Framing, 30 yrs. exp, *+ Bushhogglng avall.,+ 344-1952 CBC058263 (352) 427-4623 Lv. mes. 1---- *SOD SOD SOD* ' ill BANG'S LANDSCAPING " H 'Sod, Trees, Shrubs = erice(352 341-3032 FILL, ROCK, CLAY. ETC.'I - Al' 2v9s of Dirt SorvI Call Mike 352-564-1411 E hh I Mobile 239-470-0572 2i Soll & Mulch. Lc. Ins,(352)302-7096 Maids on Call We Make House Calls B Residential & Commercial Cleaning Call for a free quote Phone: (352) 726.8077 6O4066 LIc:'# 99990003051 Advanced-Lawncare & More. Lawn Care $10 & upl Clean ups, No job . too big ot small Uc, Ins, 352-220-6325/220-9533 AFFORDABLE, 1 DEPENDABLE, ', , HAULING CLEANUP, PROMPT SERVICE Trash, Trees, Brush, | Appi Furn, Const, Debril & Garages 352-697-1126 kmmmmm =E I, 10% vOloc ,Church'~s& BEAT THE HEAT - Let me mow your lawn Very Reas roles. Satilac non guar Free est. 352-257-5658 Iob's Pro Lawn Care Reiiaole.Qjaoihv, work. Periae ntial/Comm Uc./Ins. 352-613-4250 DISCOUNT Lawn Service Mowing & trimming CliRUS COUIJTr (352) 527-1836 DOUBLE J STUMP GRINDING, Mowing, Hauling,Cleanup, Mulch, DId. 302-8852 LAWN LADY Residential Comm. Mowing, Mulch, trimming & cleanup 257-1522 or 563-5746 TONY'S QUALITY LAWN CARE. Now accepting New Customers. 352-628-6022, 228-2410 Tyson's Lawn Service mowing, mulch, pwr wahing. yard cleanup Free est. (352) 682-9643 MAVEN POOL MAINT. Start enjoying your pool agalnl Crnem. & full ervice avail Uc (352)726-1674 POOL BOY SERVICES I Total Pool Care I I Acrylic Decking 1 352-464-3967 WATER PUMP SERVICE & Repairs on all makes & model. Uc An/time. 344-2556. Richard PHOTOGRAPHY CITRUS PHOTO Weddings & Events (352) 422-6956 MR CITRUS COUNTY REALTY 0 RAINDANCER0 6" Seamless Gutter 7" Commercial Copper & Aluminum Best Job Uc. & Ins. 352-860-0714 iUsons' Enterprises Seal Coating Striping Parking Lots Driveways nrelgious Ask about our special discounts and warranty 352-726-3440 K' I 'I 11a vCIl-IN13S FRAMERS WANTED Experience pref'd. Start Immed, steady work, Citrus Spr Area, Call Ian at (352) 257-2152 LAWN CARE Male or female; (352) 621-0623 MASONS $20 hr. & LABORERS 352-529-0305 Mechanic Wanted Must be experienced In diesel and must have tools. Apply at SMG, Crystal River 795-7170, ask for Steve. MIG WELDER S15HR/Piece work, . Locai references. 2541 W Dunnellon Rd NEW KIA DEALER ACCEPTING APPLICATIONS AUTOMOTIVE TECHNICIANS 1850SE HWY 19 Crystal River, F PLUMBING PUNCHOUT ASSISTANT Needed for the Ocala Area for the Plumbing Dept, Good pay and benefits. Must own truck and tools. Experience and/or knowledge in plumbing would be helpful. Call Robert for more Information (352)680-0672 ext. 101 PLASTERERS, LABORERS & LATHERERS 352-302-8653 352-220-1724 Plywood Sheeters & Laborers Needed in Dunnellon area. (352) 266-6940 Road Construction Company Seeking Experienced Party Chief Instrument Person & Rodman Preferably with GPS experience. Competitive pay & benefits. Call (352) 797-3537 EOE/DFWP *SERVICE TECH *WRECKER OPERATOR For Busy Shop, Benefits offered. Serious Inquires Only Apply In person at: Scally's Lube & Go, 12059 N Florida Ave. (next to Front Porch Restaurant), Dunnellon, 489-6823 SURVEYING FIELD CREW & DRAFTSMAN Experienced for a growing land surveying company. Benefits, Pay based upon experience. Fax Resume: (352) 347-7277 Or call for appt: (352)427-8820 RESIDENTIAL/ COMMERCIAL ELECTRICIANS Needed. Min, 5 yrs exp. Competitive pay, Co. benefits. Call for Application (352) 726-2907 TILE INSTALLER NEEDED Must have tools and transportation. Steady Work. Please Contact Terry @ 352-601-2932. TOWER HAND ,Bldg Communication Towers, Travel, Good Pay & Benefits. OT, DFWP. Valid Driver's License. Steady Work. Will Train 352-694-8017 Mon-Frl WOD RAER W "Copyrighted Matenaj I Syndicated Contenit Available from Commercial News Providers" I ____ mmmow $$$$$$$$$ Dietary Aide Apply In person to Crystal River Health & Rehab 136 N.E. 12th Ave. Crystal River (352) 795-5044 DFWP/EOE T-.- A ,Qar- 7c CIASSI]ErlEDS A/C LEAD INSTALLER FOR CHANGE OUTS & SERVICE Needed Immediately Pay commensurate w/ experience 4 (352) 628-02544 .e Th,40 HcamwLfrc.wt A COOL TRAVEL Job Now hiring (18-24 positions). Guys/Gals to work and travel entire USA, Paid training, transportation, lodging furnished, Call today, Start today. (877)646-5050 FCAN APPOINTMENT SETTERS NEEDED Write your own pay check $$$$$$$ E&p preferred Call 352-o28-025-1 qmm"m adlim "Now I INFORMATION I EG~eneal GelerIj c=HL c Hl BELLA OASIS NOW HIRING FRONT DESK Apply In person 4076 S. Suncoast Blvd. No phone calls. te p e aromotive our world first.y Every Day CrlifR)NIan- han doos, be CAREER SEEKERS Like the sun? * a- Do you mind getting your hands dirty? We have what you are looking forl Visit Boulerice Roofing & Supply Corner of Cardinal & Lewdinger, Homosassa blSLMCA C- NEDE CITnws COUNrTY (FL) CIUINICIu BAKERY HELP & PKG & DELIVERY EARLY MORNINGS Apply Monday Friday before 10am at 211 N. Pine Ave., Inv. CAREGIVERS S&S Resource & Services Is seeking persons to work with developmentally disabled. Call (352) 637-3635 DRIVER CLASS A CDL Roof Truss plant, full time, local only, Apply: 2591 W Hwy. 488, Dunnellon 352-465-0968 ELECTRICIANS Wanted. Trim & Rough, Must have Residential Exp. and, be able to work alone, Must have valid drivers license & own transportation to and from work. Holiday pay, IRA, health Insurance. Apply In person only. H.E. Smith Co. 1895 W Gulf to Lake Hwy, Lecanto *NO PHONE CALLS. EXP'D LAWN MAINTENANCE Crystal River, F/T, No record, Must have trans, & valid DL. (352) 220-2374 FRONT DESK Hotel experience required. Great benefits, Full time. Apply In person: BEST WESTERN 614 NW Hwy 19, Crystal River. FURNITURE DELIVERY PERSON Must have box truck driver experience. (352) 860-1963 GOLF COURSE CART ATTENDANT Apply In person. D/F/W/P EOE El Diablo Golf & Country Club No Phone Calls GOLF COURSE MAINTENANCE ' Prestigious country club In Lecanto now 'hiring entry level and exp. golf course maintenance personnel. FT, exc. benefits. Join our teamll Call 746-0404 HOUSEKEEPERS Good Benefits Apply In person at: Best Western Crystal River Independent Sales No Investment req'd, Comm. paid wkly. Unique product. No exp. (352) 476-2464 JOBS GALOREIII EMPLOYMENT.NET LANDSCAPE MAINTENANCE HELP Valid DL Needed (352) 621-0466 Lawn Care Seeking long term exp. help. Must work Mon. thru Fri. Start at $8.50/ hr. Increase in 30 days. (352) 628-3734 LAWN CARE / LANDSCAPE GROWING COMPANY Valid Drivers LUc. & reliable transp a must. Exp pref'd, but will train hard worker, FT or PT (352) 621-4777 LAWN CREW Immediate Openings Dependable w/valid Fl. Driver's Uc, (352) 621-3509 MORTGAGE BROKER. Become a Mortgage Broker. We give you state required course, training, and put you to work. CINTRON FINANCIAL GROUP (352) 398-1313 P/T LAWN SERVICE HELP 352-344-8672/425-8703 Production Workers Excellent Benefitsl FULL-TIME POSITIONS Must possess HS diploma/ GED, basic math & reading skills, ability to lift up to 50 Ibs. and know how to use a tape measure accurately. Applicants will be tested. Starting rate Is $10.10/hr. w/ralse after 60-day Introductory period. Complete benefits package: medical. dental,.vislon, 401(k)I. tuition reimbursement profit sharing, paid vacation & morel Accepting applications 06/12/06 through 07/14/06. Apply In person, Mon-Fri. 9am-4pm or fax your resume to: 352-748-7252. EOE/AAP (Nq Phone Calls Please) Dietrich Metal Framing 721 Industrial Dr. Wlldwood, FL. 34785 EOE/AAP/M/F/D/V U PEST CONTROL SALES Exp. Preferred. p225.00 per lead. LOTS OF LEADSIIIII Apply In person 6421 W. Homosassa Tr.(352) 628-5700 PEST CONTROL TECHNICIAN F/T, clean DL record, Exper pref'd. Will train, Salary w/benefits, APPLY IN PERSON: CITRUS PEST MGMT. 6 N. Melbourne St. Beverly Hills, FL Roll Off Truck Driver Good Pay, Fax Resume To: 352-568-0110 Citrus & Sumter Co.'s ROUTE DRIVER Good driving record. Class B w/tanker endorsement. Must be willing to work nights. Construction site, Delivery exp. helpful. $10/hour. Apply In person; Job Site Services, Inc./SanI-Pot Portable Toilets, 425 S. Croft Ave., Inverness. No phone calls please SALESPERSON NEEDED Commission Only For more Information Contact Pete @ 352-564-2915 Upscale Lawn & Landscaping Personnel Seeking dependable, hard workers. Driver's lic. req'd, Call (352) 527-9037 WE BUY HOUSES CaSh........Fast I 352-637-2973 lhomesold.com WINDOW & DOOR INSTALLATION Helper Wanted for Window and door Installation. No exp,. necessary. Valid Fl. Drivers Lid. a must. DFWP (352) 746-1431 Sales Associate P/T or F/T. see store for app. SHERWIN WILLIAMS 2410 SR 44 W Inverness SNACK COUNTER Help for nights & week- ends, Over 18. Previous exp. a plus, Apply In person Manatee Lanes, Cystal River. DFWP N 6*nlomn -C" ADVERTISING COMPANY NEEDS Sales &/or Sales Managers for Restaurant placed display ads, Up to 50% commission, car & cell phone allowance. Quality telemarketing leads provided. Some travel. (800) 752-4309 FCAN ADVERTISING NOTICE: This newspaper does not knowingly accept ads that are not bonaflde employment offerings. Please use caution when responding to employment ads. AMERICA'S DRIVING ACADEMY Start your driving career Offering courses in CDL A One tuition feel Many payment options No registration feel (888) 808-5947 Info@amerlcasdrivlng academy;com FCAN CAR HAULING CAREER Southeast regiana $1,100+/weekl Great home time! Company paid benefits Paid training for drivers with minimum 1 year OTR experience DRIVERS: Expanding Fleet offering Regional/ OTR runs. Excellent benefits, weekend hometime, outstanding pay package, Lease purchase on '07 Peaerniits COLA required NATIONAL CARRIERS (888) 707-7729 www. nationalcarriers.com FCAN de~i 6l&r P;f.e.Citrus. id~4 t othrcarrier, .-~4"produicff", 'w! an Ssigned' -0. dgilte o 4 fig, 'Rx iaw Leader OoWc-V' -inprovetn pcustemer ;~rr~er I. ~it ~Idl W, e~a'l 4pre.-. OthoY -~ k , 5,j FA., -:-.2 . WE'RE RAISING PAY FOR FLORIDA REGIONAL DRIVERS Home every weekend Home during the week Solid weekly mllesi 95% no touch Preplanned frelghtl $.43 per mile, hometime, money & morel PROFESSIONAL VENDING ROUTE All drinks, sizes and brands. Great equipment, great support Financing available With $6K down. Tom: (954) 971-9301, #BO2002-037 FCAN 95% CASHOUT Mobile home refl's. Greatest mobile home rates. First time buyers welcome. SFR, Investor & Rehab financing. Apply online: www. BestLendingHints.com (800) 990-9573 FCAN 30 X 30 X 9 (2:12 Pitch) 2- Roll-up Doors, 1 Walk Door, 2 Gable Vents, I Window w/4" concrete slab; INSTALLEDIIl $16,695: 25 X 30 X 9 (3:12 Pitch) With Roof Overhang 2- Roll-up Doors, 1 Walk Door, 2 Gable Vents, I Window w/ 4" concrete slab; INSTALLEDII $17,195 Meets 120 MPH Wind Code 20' to 35' Wide Unlimited Length "Stamped" Florida Engineered Plans METAL SYSTEMS PLUS, LLC 1-877-951-2300 + Sales Tax & Co. Fees w m.metalsvstems WE MOVE SHEDS 564-0000 ANTIQUE LAMPS (1)'Brass Lamp (1) Wrought Iron Lamp $75 each (352) 527-2769 VICTORIAN TAPESTRY CHAIR * Exc, cond. $275; FRENCH END TABLE (Gold Leaf) $95 (352) 746-6963 A Me ANTIQUE WHITE PEDESTAL TABLE w/4 CHAIRS; fairly new, 225 LANE BEIGE LEATHER RECLINER, $15Q (352) 527-8603 Bicycle, 1960's Schwlnn deluxe twin, Excel. cond, All original, $200.00 (352) 503-3466 VITA-MIX 2200, Vintage comm, blender, works, $30, FRANCISCAN APPLE dinnerware, 16 assorted pcs,, $50 352-746-3069 after 3pm SPA W/ Therapy Jets. 110 volt, water fall, never used $1895. (352) 597-3140 A/C & HEAT PUMP SYSTEMS. 13th SEER & UP. New Units at Wholesale Prices ->2 Ton $780.00 --* 2-'/ton $814.00 -* 3 Ton $882.00 oInstallation kits; -Prof. Installation; *Pool Heat Pumps Also Available Free Dellveryl Lic.iCAC 057914 Call 746-4394 ABC Briscoe Appliance, Sales Service & Parts. New location (352) 344-2928 AC CENTRAL SYSTEMS All types and sizes new w/ warranty price larliring at $575 Toll Free 866-746-8513 ADMIRAL MEGA 22 Washer/Dryer S2u1/pr (352) 637-6779 ALL APPLIANCES. New & Used, Scratch Dent. Warr. Wa-ri. aryv'-r stoves; refrig. etc. Serv Buy/Sell 352-220-6047 APPLIANCE CENTER Used Refrigerators, Stoves, Washers, Dryers. NEW AND USED PARTS Dryer Vent Cleanina Visa, M/C., A/E. Checks 352-795-8882 Chest Freezer, Kenmore, white, runs great, $100. Microwave, Panasonic, black, good cond. $50: 352-860-1744 G.E. REFRIGERATOR 21 cu. ft. $100; Small REFRIGERATOR $25 (352) 527-0989 GE REFRIGERATOR 20 o Cubi. F- fiosTfree **/IC r.-aker, Bque. ike re, tondor., 1:O0 (352)-341-4117 HOIPOINT REFRIGERATOR 2 cu rt Uke New! $100; . STOVE HOOD $20 (352) 527-0989 JENN-AIR ELECTRIC COOK TOP, ceramic glass surface, like new. $175 OBO- (352) 628-6335 KENMORE ELECTRIC RANGE White w/black accents $75 (352) 344-0233 MAGNAVOX TV, 19", $50; COFFEEMAKER. 12 cup proagrammoablE. .i5 (352) 262-4009 RANGE, Fridgidaire. Electric, bisque. SWork go.od (352) 382-4845 Washer & Dryer Set Fridgidaire, large capacity, white, like new. 1'year old. $550/cash. (352) 522-1969 Washer & Dryer. Maytag. heavy duty, S"igril aimor.,J, go.:,j VrW lEf) each 352-860-1744 WHIRLPOOL REFRIGERATOR 2' Cu r, '1.lie Ice *V.:ier rnru n .:.or $125.00 Call 352-637-4385 GENERAL ESTATE AUCTION *THURS. JULY 6- : 4000 S. Fla. Ave. Hwy. 41-S, Invemess PREVIEW: 1 PM SALE: 5 PM '94 Ford 350 Diesel, '87 F-250, Alum. jon bheal ."l,.od *-10'?, .lot mra.a-hinre 2 I.ou.:e r..illr: .of I, j.er,..Ia fum r. '-orltenr HUGE ie.vir,Ciollc-r.-r. ;/5rj.00* btol fobri Bu/ a rru.:' & fill ll See Web:www. dudleysauction.cam A352) 637-9588 A1667 AU2246 12%BP 2%Disc ca/ck ALL NEWI 10" RYOBI Bench saw, 16" Variable spd. Scroll saw; & Bench Grinder All for $110. (352) 464-1508 BOSTILCH Nail Gun $250 SEARS 1 hp comp. $100 (352) 637-5959 Holbart 235A Welder, complete $250,00 Milwaukee Drill $125.00 (352) 586-6484 METAL SHOP DESK W/CHAIR $60 FILE CABINET $10 (352) 382-2318 Oxy/Acy Set. Complete $250,00 Craftsman Tap/Die Set $75,00 (352) 798 1726 Paint Sprayer-Spra, iec' E'p .25.5 .v., luL r.,:e A gun L'ran,- r,.. Pola. 5 5,c :ell .- 2.0C 080 746-3228 Radial Aim Saw S Ridgid,12' $450. (352) 746-9868 Reese Gooseneck $85.00 : Brand new Stelson Hat .or. soo-50 0 (352) 586-6484 RYQBI WOOD SAW $100; SKILL SAW $50 , (352) 637-5959 - Table Saw & Radial Arm Saw Both $100 42" PLASMA SCREEN TV le'. Itan 1-,r i ola (352) 601-3397 52" Big Screen TV Mitsubishi .: -- $500.. ' C, itrus Springs. (352) 489-4129. LG. CERWIN-VEGA - SPEAKERS In Cabinets -$150 .- (352) 422-5707 Interior/Exterior doors Inlen.:,i r Piriungr 3. Exterior.Prehung 6' Panels: $85. Mirrors $10. Next to Citrus County Speed way:' (352) 637-6500 METAL ROOFING SAVE $$$ Buy Direct from .lar.uiac rurer. 20 colorsI-' in stcc wvtr- all , accessoles. Quick turp a(0undl Delivery.^.i av6ildble.Tebll free. (888) 393-Gi5 PC U DIESTLER COMPUTERS - ir.inet ser,.ce. jew Ja;aa ,31errw, DpaO/zz upgrades. ViLa/ MCord 637-5469. Mac G-3 Desktop. DSL S&Dial-up'red,r2 :2 printers, many extrass' Lots of inslalled i software 1650 OBCO (352) 249-3263 PENTIUM COMPUTER Monitor, keyboard &- rrou.e Internei ready S75 (352) 726-3856 DUMP TRUCK 82 i-600 3?0, 2-' morcr., S41'14 bed. runjr, geal S3 000 ob . (352) 621-0891 Hardee Rotary Cutter. 5ft, 3pt, new blades/ drv shft, some deck rust, 32; Huskee Rototiller. ?r.p. Ie." cut. dual direct hrnes. u.ed lx ,41 3 (352) 628-6363 7 PC. PATIO SET V.fhiea. gias.-I.p table ' 60r / d42" w/motchI ing ,ling lounge .:r.air 5300 (352) 382-1515 2 Queen Anne cherry wood end tables, $40. ea. Mirror Dresser chest, maple, french proven- tial, good cond, $275. (352527-1986 4 kitchen chairs. $25 for all. Carpet,-,$70 (352) 628-1408 5 DRAWER DRESSER $75; 2 LONG TWIN BEDS- w/matt, spring, & framer Gd Shoap- .0'a ' Or i '50/olatr (352) 726-9659 5 Pc. Bedroom Set all JrOOa 2 t.ir, bed'J $400. (352) 564-6833 9 PC. DINING ROOM SET Pecan, table w/6 chairs, hutch &crnr curio. .350. LAZY BOY RECLINER $50. (352) 382-1327 ' 2006 MICROFIBER SOFA & LOVESEAT lmTtrr,5S Futrnitjie. SOar recli'is orn boltr, d . t.elge i i 1i farrrT, (352) 726-6254 6' OAK DINING ROOM TABLE W/LEAF Claw leer. 6 chai,' (352) 613-5252 ANTIQUE DRESSER. 2 drawer w/round mirror, .Gd, shape $125; Power Patl2000 $100(352)726-9659 BED: $185, New Queen. No Flipped Pillow Top Set, 5 yrs warr, King Set $225. Delivery 352-597-311 BED: $559 10iOo lmenor/ Foonm 'el Seer, or / 20/r Warr IJleer U:ea PReloll Cosil 51459 Can Dell er , 352-398-7202 Ger e IP c= Hell dII --'Copyrighted Material - -- Syndicated Content j.. Available from Commercial News Providers" S1677376 .. .. CrrRUS COUNTY (FL) CHRONICLE SAlmost New Burgundy ,Leather Chair & Otto- man. Cost $850, sell $350. (352) 382-5702 BEDS BEDS BEDS 'The factory outlet storel For TOP National Brands ' Fr.50%/70% off Retaill " Twin $119* sFull $159 )ueen $199 / King $249 , Please call 795-6006 ' BLACK LEATHER CLUB CHAIR Excellent condition $150 OBO S(352) 794-0201 BOOKCASE Sm. Wood $10 DOUBLE BED- mattress & boxspring $20 (352) 795-3394 BROYHILL.SECTIONAL 6OFA, La-Z-Boy recliner, '3 tables,.lamp, All for $500, (352) 341-2747 SBUNK BED SET .Lt. wood/built-in desk & '.book shelves. $175, (352) 628-7360 *Chairs (2) Trioma: ..,lle '.vili- er.a lable '.iJu 0 uI S Computer Desk, $100:00 5. (352) 382-1524 CHERRY DINING ROOM Table w/2 leaves,.4 chairs, lighted China Cabinet. Exc. cond. $650 (352) 726-8348 COFFEE TABLE, very Ig & heavy, octagon, glass top, dark wood, wicker underneath $100 OBO CHANDELIER S5OBO (352) 527-2769 Coffee table/ 2 ends, glass w/metal, Just. bought, $200; Kitchen Round 52" glass tble. w/rmetal, 4 chairs, new. $400. (352) 634-0865 COUCH, CHAIR & OTTOMAN, rra.lcr.ing set, loose pillows; patterned, almost new Pd $3Q00/Asking'$1200 (352) 637-5525 DINETTE SET w/4 SWIVEL CHAIRS c:;'2 ZENITH 27" TV 'S7- (352) 726-0040 DINING ROOM SET Table & China Cabinet, 4 Chairs, It oak colored, -great cond, $450 firm (352) 382-7307 DININGROOM TABLE w/2 CHAIRS, drop leaf, $40; SLEEPER SOFA, $40, (352) 262-4009 "DRESSER w/9 drawers & mirror $35 ROLL AWAY BED $20 (352) 795-3394 ENTERTAINMENT CENTER 1Oar rnl,)n .:ipc igrca. Bolds 27? T.' pa' I ifo 7,40 firm (352) 563-5175 Granafather clock., Ridgeway, beautiful, $1200,00 - (352) 637-4072 Light oak night stand 2.draWers $20. (352)527-1986 LIving Room and Dining Room set with 2 bar stools. Laura Ashley- lecihel o, ser coG.rnCe rlew l J i Flot (352) 628-2826 .Mattress King Pillow TopSer Never uted ST11r 'Fn plqsrlc Coxto,'er "Si 1O0 Muust ;ell $3/5 Del Po:s (352) 465-8741 MATTRESS Qu .: pillow toprTet. NeveruseddJ Ttil in pla;r,. 'CosT o.er .9 Sac 3T r. Du0 poss: (352) 465-8741 MOVING. BEDROOM: SUITE, COUCH &.odds & ends of turn. Stackable washer/dryer, 637-2107 OAK COMPUTER RETURN DESK SWmao.:nring file cabinet, cherry stain,, sacrifice, $375 (352)527-9982 Oak Entertainment Center 505 0BOG (352) 341-2453 or (352) 201-9928 PRE OWNED FURNITURE I.irle laacie Pricei, NU 2 U FURNITURE Homaosassa 621-7788 Preowned Mattress Sets nrrom iw.r. n70 Fujl J.0 Sr, 50 (g ';" 628-0808 QUEEN ANN SOFA SET Sofa & lovesedt, good condition $375; dresser & ,Tnor .25 795-6128 RATTAN DINING SET g1la' tlo IIOle AJ cnoir; server, exc. cond. i,5 (352) 341-0847. Scaling Downi Must Sell Trundle Beds $150. Treadmill 51000. (352) 746-7992 .Scaling Downi Must Sell Wood writing Desk $65. Wicker cabinet $35. (352) 746-7992 l-',-SMALL DESK w/HUTCH "1', S V T.V.TABLE ,(all wood). $30 (352) 447-2629 . SOFA BED, gold print, 2 cushions, hardly used, $150. SMW (352) 382-3679 SOFA Excellent, custom upholstered, Uke new cond. Pastel tapestry v. .:iaut-.; bacL grc.urJd ,,5C' (352) 527-8953 Sola. loveseat r chair. *JOr, (71, Beautiful Hutch ,.. lr. (352) 628-2743 STUDENT LOFT BED SIC.e; & TClo,:L D',eu ur,.3derrCe.lr. mo.nre.r not lnh:, E ,.- rcI $210 OBO (352) 344-0233 Table, Je .l'or.. oak w,, l eaf crar. s.1 malnlrnr ,:, boar stools, excel, cond. $325. obo (352) 746-6144 The'Path's Graduates, Sifigle Mothers, Needs your furniture. Dining tables, dressers & beds are needed, Call (352) 527-6500' MR CITRUS COUNTY REALTY ALAN NUSSO 3.9% Listings INVESTORS BUYERS AGENT BUSINESS BROKER (352) 422-6956 ANUSSO.CQM Twin Sz. Mattress Boxspring & frame $70. Futon Oak Frame Bed 70" W $80. All new Cond. Homosassa (352) 601-2171 UNIQUEl BAMBOO/ RATTAN 6-pc Bedroom Suite, glass tops, king bed, sacrifice $6,50 (352) 795-9950 60" X-MARK Laser Z, zero turn, $2,500 (352) 637-5595 or 634-4237 Chipper Mulcher 10HP, 1 ytr old, used 2 hrs. cost $650. sell $450 (352) 208-0131 Craftsman Dethatcher 40" Tines $20. New condition Homosassa (352) 601-2171 FREE REMOVAL OF MoWers, motorcycles, RV's, Cars. ATV:s, jet skis, 3 wheelers. 628-2084 MTD RIDING MOWER 17.5 hp,42" cut $400 '. (352) 746-7357 Riding Lawn Mower, Simplicity; twin blade electric start 31" cut, exc cond., $375. (352) 613-7663 SEARS DELUXE 24 hp, 42", auto, used < 40 hrs, undr 3 yr. transferrable home warr. New $2,200/Sell $1,500 (352)270-1775 SNAPPER rear sn.rire rialng moner 30 Cult good conl.aron rnew blade 14- 795.3812 / 1422-4873 2 RED MAPLE TREES in pots. 5.5 ft. $15 both (352) 795-6693 2- 8' Golden Rain Trees' In containers, reddy to plant. Citrus Springs. $10.00 each., (352) 489-3120 Landscaping Plants & Herbs, Contractors Welcome. Wholesale .prices.(352) 586-2590 BEVERLY HILLS ESTATE SALE *FRI. JULY 7. S70 Sugarmaple Lane SALE:, 8 AM House, contents, '02 Buick Century, All for sale, One dayl See Web:www. dudleysauctlon.com (352) 637-9588 Beverly Hills Fri. & Sat. 9-3 Moving Sale furn., etc. 3889 N. Passion Flower Way BEVERLY HILLS Movfog Fri & Sat'8-1 New Items 2nd davl 6142 N. Lecanto Hwy. (behind St. Paul's Luth) FLORAL,.CiTY 25 Homes' Trails End Neighborhood Salel Fri. July 7, 8am, follow signs off 48 'FLORAL CITY Wed.-Sat.8-2.25 yrs. of stuff. 9960 E Bushnell Rd. Fri/Sat, 8A-12N; Hshld items, boat/mtr + boating supp, tablesaw 622 N. Pompeo Ave. Dunkenfeld to Mllwe to Pompeo HOMOSASSA Fri. & Sat. 8am-? Misc. 83'' W Earl L. oo Homosassa Gardens INVERNESS Huge garage sale, Thurs -r.ru Sur, on',.? 02 E. Pcinr .-* WC-3O L,' INVERNESS Moving Sale, Rain/shine Thurs. Fri. Sat. Tools, Christmas, VCR, lamps, treamill, bar stools, Qu. bedding 319 Hemlock St., (off S.Apopka) LECANTO Fri. & Sat. 8-? ' 2961 W. Laurel St. r BURN BAKRRLS X $10 Each Call Mon-Fri 8-5 860-2545. 2 Interior Mobile Home Doors w/ hardware 80" .. W 2 New,. i $70. (352) 628-4216 2 PINK TABLE LAMPS, $10 each .2 Wood End Tables, $7 each. (352) 563-0435 5 PC. DINING SET Natural light oak, tabletop & chair bottoms, backs & legs forest green, $125 (352) 344-8328, Iv. msg 18 quart toaster oven plus 3 separate trays. Hitachi automatic bread maker, 5 cup coffee maker, $100 takes all. All like new (352) 637-6310 :100 DVD'S, mostly new releases, $4-$6 each. Call for Information (352)601-339720 CANOPY, you take down, $90 3 chairs chrome, brown vinyl, $20 (352) 341-0787 30" TAPPAN self cleaning gas range, $125 8,000 BTU HEAT/AIR window unit, $125 (352) 726-3093 3'/ Ton AC unit $350. 4 Wheeler, needs work $500. (352) 563-1444 5-PC. DINETTE SET Table, 4 chairs, Early American, (wood), very good cond,, $90 (352) 344-8328, Iv. msg 7-PC DINING SET Maple, table, 6 chairs, solid wood, 2 are captains chairs, 2 leafs, very nice, $200 (352) 344-8328, iv. msg A Wishing Well or Picnic Table built to suit you for size & shape. Call Fred (352) 726-1316 A-I WISHING WELLS & PADDED CORNICES Made to order & In stock (352) 341-3071 BLACK METAL FUTON , w/mattress, $50; GE 4- BURNER STOVE, self- cleaning oven, electric, exc cond, $90 352-746-9155 After 5pm BOOKS *BOOKS BOOKS 50 hardcovers, 250 paperbacks, nature, science, novels $85 110 VHS movie videos $65 (352) 563-0022 BRIGGS & STRATTON 5550 GENERATOR Purchased in. 2005, never used, asking $600 (352) 746-7012 CARPET FACTORY Direct Restretch,clean, repair Vinyl, Tile, Wood, (352). '341-0909 Shop at home COFFEE & 2 END TABLES, Glass top & bottom, teardrop shaped w/ cement bases, $200 36" TUBE TV w/STAND, $200 (352) 489-6124 CRAFTSMAN HAND TOOLS, $40 for set; QUEEN-SIZE AIR MATTRESS w/PUMP, $35 (352) 262-4009 Door, entrance & storm 32" x 76" For mobile home. $90.00 for both. Lawnmower, Mur- ray push. runs good $20.00 (352) 795-7844 FULL SIZE BED Excellent shape, $125, Twin mattress and box spring $25. (352) 726-8258 GAS EDGER 3 wheel, 3.0HP, Craftsman, very *good cond., $75 (352) 344-8328, Iv. msg GE Range Oven, vented hood, almond $85 Storm door, pre hung white, alum., 32" x 78" $40. (352) 795-6736 Generator, Generac, 4000XL, good cond, "$200. (352)'465-1287 GEOSAT 2 MOBILE GPS 1 yr old w/software & PC cable; NEW $1200/ ASKING $395 (352) 795-4993 Hoover Steam Vac, carpet cleaner, 5 rotating brushes like new $130. (352) 795-6736 INTEX EASY SET POOL 1'8', pump & ladder Incl. chemicals & set-up DVD. $150 0BO (352) 344-0233 KENMORE WASHER, white, $85 cash KITCHEN TABLE; 1 up.-olaerca cnoir: S'- 65Ca:r. 7 (352) 344-2752 Laminator 27' EZ Lar. good cond., $400. Canon Image PROGRAM W7250 Large format printer, (24" rolls) Needs Ink cartridge and new print head, good cond, spare motherboard and motor, $500. 352-860-1744 LIVING ROOM SET $250, 10' KAYAK $250 SMW (352)382-4889 MARVIN DOORS Vinyl clad/out, wood/ In. New In box. $1,100 'S.S. Dbl Wall 10 gal. THERMOS. $125 (352) 795-9230 PA System 'Crate, 600 watts, incl. PA head, stand & 2 speakers $550. - (352) 746-9868 Peavey Pro Speakers ea. with 12" & horn excel. cond. $250. (352) 628-7251 (352) 586-8503 PFALTZGRAFF DISHES Yorktowne Pattern Extra-large set w/lots of extras; $150 (352) 746-5878 PRESSURE WASHER 1500 PSI, very good cond. $65. TABLE SAW, $35 (352) 465-1266 ROAD WARRIOR BMX FOLDING BIKE. 20", 5 spd, yellow, .good cond, $135 (352) 344-5036 SEARS X-CARGO Closed luggage cardrier, for car roof.$45. (352) 795-8777 SMALL WHITE KITCHEN, TABLE $15 . WASHER ood cond. (352) 795-3394 . Installed and delivery avallable.352-302-3363 TRAMPOLINE (352) 637-0320 Van or Truck Back Seat, or sleeper velour, like new $195. (352) 628-7251 352-586-8503 WOLFF TANNING BEDS Buy Direct and Sayel Full body units from $22 a monthly FREE Color Catalog CALL TODAY!I (800) 842-1305 www. np.etstan.com FQCAN Woven Cotton King sz. bedspread, white, $15 Coffeemaker, Green, 12 cup, new, $15. (352) 563-0435 Rascal Scooter 4 Wheels, Elec, Seat $250.00 3 Wheel Sharp Rider $225,00 (352) 628-9625 1931 Epiphone Guitar, $550 OBO; 60's Kustom PA w/Speakers, $350 OBO (352) 212-8346 CONSOLE PIANO $450 Free Delivery In Citrus 1352) 628-3046 Wurlitzer 3 Manual Oryan w/bench, . 43/2" wide, $150. Call (352) 637-6424, after 4pm WURLITZER PIANO Upright Mahagony finish $500 OBO (352) 628-0862 PROFORM TREADMILL 285T, $125. (352) 210-0871 GOLF CLUBS R.H. 3-PW, ir. er- p .ur r c"r .a ,-:'. c'.,co, ar"I.":t '-..:t3".i , : (352) 860-0288 ,(352) 634-4592 cell Golf Clubs, Calloway Copies, 3-SW with it. wt. steel shafts, 4 metal' woods/graphite shafts, have maintained since new. $75.00' 382-5715 NRA Certified Instructor Concealed Weapons Permits & Safety Classes Home (352) 794-0446 , Cell (352) 270-0183 I POOL TABLE, Gorgeous, 8', 1" Slate,' new In crate, $1395,. 352-597-3519 POOL TABLE, new felt, .lole r.e.., :ue ball roc; t'" 230 CBC-, (352) 476-3061 RARE 26" NEWPORT Incline chainless bike, 3 speed shaft drive, like S re,..' .:.rid Sac:,iflce i ~8 (352) 344-5933 WE BUY GUNS On site Gun Smithing (352) 726-5238 (352) 220-4386 16' HD FLATBED Trailer, tandem axle. Loaded with fence posts. $400. (352) 637-0475 16' VALLEY LIVESTOCK TRAILER, 2001, rubber mats, exc cond, $3,895 (352) 522-0522-Iv msg 80" Wide, Master Tow Dollie, w, surge break 2 yrs; old $1,200. " (352) 465-5012. BUY, SELL, TRADE, PARTS, REPAIRS, CUST..BUILD Moved to 6532 W Gulf to Lake Hwy. Crys. Rvr. EQUIPMENT CAR TRAILER 18'X7' dovetail, brakes, HD ramps, $2200 (352).637-0475 HEAVY DUTY CAR TRAILER W/ SPull outramps$, 1150, (352) 465-0721 LAWN UTILITY TRAILER 6x12 tandem w/sides and ramp, 6 mos old, $1,1000,BO (352) 527-0805 TRAILER AXLES 2 3500 1b axles. 88" y ide, ipi;ng. .t350 (352)726-3795 leave mess. TRAILER Homemade trailer 6x12, frame.lides. $450. (352) 726-3795 Leave mess. Utility Trailer 5' x 8' w/ramo $675.00 SWING, usea only 3 mos. swings front to back & side tp side. $40. (352) 746-9813 OLD WOOD BASEBALL BATS Any condition. Baseball gloves & team NOTICE Pets for Sale In the State of Florida per stature 828.29 all dogs or cats offered for sale are required to be at least 8 weeks of age with a health certificate per Florida Statute. 2 Toy Chlas, 2 yrs old, All shots, spayed & neutered,$150 ea/$250 both (352) 527-2958 AQUARIUM 40 Gallon, $50 Incl.; stand, qcces., fish (352) 344-8663 BIRDCAGE Large, White . $90. Call:. (352) 527-3726 for Info Blue Pit Bull Puppies $150 each 352-476-4473 FEATHERLITE 1999,. Trailer, GN, 3 horse w/ tack RM, 7' 6" Tall'.. C- lra, 21 .. ':" ', ;352) 637-4144 Humanitarians, of Florida Low Cost Spay &, Neuter by Appt. Cat Neutered $20 Cat Soaved $25 Dog Neutered & S ed start at $35 (352) 563-2370_ PaIr. of Quaker Parrots '$150: Bird Cages $15. ea (352) 613-3490 (leave message) 2 HORSE IAILEK 1975, 16'/7' high; front/ rear ramps, 2 axle, $1,300 B00 (352) 614-0684 HORSE SITTING AT YOUR BARN Long or short term. (352) 613-6644 6 - S '* 1/1 Furn or Unfurn 1/1 Furn, computer & scr.rm, carport No pets/ Smoking (352) 628-4441 2/2 DWMH Homosassa No pets, rent w/option to buy, 1st/last/sec $650 (352) 422-2665 Crystal River Big 2/1, CHA, fenced yard;S500 mo, $1,500 move In. (352) 726-9386 FLORAL CITY 3/1, DW, $600/mo + Ist/last/sec, no pets, no smoking (352) 422-5199 HERNANDO 2/2/CP nice, quiet + Lk. View, DR, LR; LQ. Enc. Porch CHA, W/D, Ig shade yd, nice turn, $650/mo, 1st/ last+ sec (813) 230-9750 HOMOSASSA 2/1 $50/mo, + 1st, last, sec., no pets (352) 628-4002 Homosassa 2/1 on 5 acres. Partially turn, $450./mo ]st &last water inc(352)464-2384 HOMOSASSA 2/1 Shed, scrn.prch. 1 pet, a, n,.: (352) 564-0856 HOMOSASSA 3/2 $700. mo. + utl., 1st, last, set. 207-651-0923 HOMOSASSA 3/2 2 ac. no pets, $650, 1st, last & sec 352-302-9217 HOMOSASSA/LECANTO 3/2 on 21/2 ac. $700/mo, + sec. dep. NO PETS Don Crigger Real Estate (352) 746-4056 INVERNESS 2/1-'/, carport, $495. Also Pretty Park Model 1/1, washer/dryer, Irg. porch, carport, $495, Leeson's 55+476-4964 INVERNESS 3/2, Ig. scrn rm, no pets $675 Ist/last/$500 sec. 352-344-3444/464-3995 INVERNESS Lakefront 55+ Park. Fishing piers, affordable living 1 o 2 BR. Screen porches, appliances. Leeson's 352-637-4170 INVERNESS Small 2/1 $425/mo + 1st & $600 sec; credit refs 352-422-5661/344-3882 2/2 DWMH Homosassa No pets, rent w/option to buy. 1st/last/sec $650 (352) 422-2665 2/2, 16x60 w/ appliances, Satellite & more, lived in 3 years, Must be Moved $24,000. (352) 637-4144 AMERICAN HOMES Southern Energy Homes of Merrtt 352-628-0041 BANK OWNED REPO"SI 'Never lived In Starting @ $40.000 - Only a few left Payments from $349.00 per month Call for locations 352-621-9182 Lease w/Option to Buy New remodel, good' nghbrhd. Immed occ. 2/2, CHA. $41,000 (352)'726-9386 Over 3,000 Homes and Properties listed at homefroht.com PALM HARBOR HOMES Factory Model Center LARGEST IN AMERICAI Modular, Mobile and Stilt Homes. Call for FREE Color Brochuresi (800) 622-2832 FCAN HERNANDO-Lakefront 3/2/CP, Porch, dock, $650/mo, 1st, last + sec Fum. (813) 230-9750 INVERNESS-Nicely decorated lake front, 2/1, FLrm, dock, in adult subd, $525/mo. (352) 726-5292 or (727) 492-1442 T atrfon HOMOSASSA 55+ DW, 2/2/crprt on pond; scn. pch., Ig. until. rm. Nice communltyl $32,000 (352)442-2116 A MUSTSEEII Office, FP, new kit., new appl,, new hardwood. 'floors, new carpet, new huge multi level deck, $925, mo, + taxes & ins.(352),201-1033 or (814) 547-2809, 2/2, DW; on 3/4 Acre, nice neighborhood, cul-de-sac. $79,900. Call to see - (352) 621-0759 3/2/1 POOL, Cinnamon Ridge-Lg. Lot- new carpet,roof & central A/C $91,000 352-212-1827 3/2/24 x 20 att. scrnd prch & Ig. shop w/gar, w/W/D & ]/2 BA; Extra ig,,lot. DW'on slab; boat strg, 8& dump station. New stove, fridge,, carpet, vinyl $129,900 352-270-0613/201-0798 4/2 Owner Financing @ $0 Down $825 mon. Totally remodelled; new appls., beautiful Ig. front deck, great nelghbor- hood.(352) 270-2015 '98, DW, 4/2/2, 3/4 acre scrn, rm., large front deck, many other extras, $129,000. (352) 621-5034 2 bath on 1/2 acre. Great location, the best construction, too many options to list, Seller, motivated, $2,000 down, $587,47 per mo,, Call for more Info 352-621-9181 CRYSTAL/HOMOSASSA 5 Lots, Paved; 1 rental By owner $16K-$28K. (352) 503-4142 FLORAL CITY 3 BR Fixer-upper, $29,900. (352) 344-1845 HERNANDO, quiet area off 491, large 1 BR on good size lot, scr. porch, work shop, shed, solid construction, furn, & 'ready to live In. Good deal for $29,900 352-746-3069 after 3pm Homesassa 4/2 on I acre, _. f-.- I :. rl i ' r I,:,li Q ,j II.:. ell $79,900. REDUCED TO $71,900. (352) 624-1987 INVERNESS-DEERWOOD 1+ dividableacw/'94 3/2 DW,'upgrades, Ig carport, 2 decks, new 15x30 wkshp. ExtrIoaie $149,900. (352)586-1920 LAND/HOME , 1/2 acre homesite in country setting. 3 bedroom, 2 bath under warranty, driveway, deck, appliance package. Must See $579.68 per month W.A.C. Call 352-621-9183 Lease w/Option to Buy Handyman Spec, good nghbrhd, w/1.25Ac In Crystal Rvr, $44,000 (352) 726-9386 Must Sell, $32,000. ablI (Isabel Terr.) Won't Last! Call: (352) 302-8147 OPEN HOUSE 7/13 5-8 3/2/2, DW, 1 ac, XXL Pool, Jacuzzi, gazebo; 2 decks, pond,carports, Must sell $120,000. (352) 563-5559 OWNER MUST SELLI Land & Home 3 bedroom, 2 bath full appliance pkg. Quite lot with nice oak trees. 5 yr. warranty. Owner will assist with down payment Only $684.41 per mo. W.A.C. Call for more details 352-621-0119 ---^^----^^^1---.* 14 x 60, 2/1%BA, w/ glassed in porch, recently renovated Ir.ernmes mobile park. . 344-1002 or 302-2824 DW 2/1 In gated 55. Pk tJewvFl rm w/i-C.inew hot wtr heater & appll's, carport, strg. rm w/ W&D, lot rent $228.91. $36,500: (352) 637-4230 DW, 2/2.14x 10 scrn. porch, new roof & AC, attach. carport In nice community. Asking $29,700.(810) 614-8170 (352) 522-0049 DW, CORNER LOT in Adult Park, Ready to move In 2/2, carport, + extra driveway, new enclosed sitting room. (352) 860-0170 DW, Steel, 3/2,55+ Park, carport, both sides, Ig. scm. porch, attach. shed, $25,000. (352) 697-2030 FOREST VIEW ESTATES 3/2/carport, 55+ com. 1,675 sf. enclosed prch w/AC, PRICED WELL BELOW MARKET $59,900 obo (352) 795-1001 FORT COOPER MHP 14x60. 2/1-1/2, fumrn., 2 screen porches, car- port, painted outside 2006, new hot water -tank & dishwasher. Immaculate. $19,900 352-860-0461/726-5789 M/H S/W INVERNESS 1/1 .C/H/A 55+,' .Low lot rent., Asking $6,500. Call (352) 560-3246, New 2006, 14 x.56, 2/1, Inverness park, ready for occupancy, 344-1002 or 302-2824, Nice S/W 2/1 turn. scrn rm. shed, xtras, $22,900 Roomy 2/2 D/W crprt shed, $22,000. In quiet secure 55+ pk. Close to shopping. 352-6285977 STONERIDGE LANDING Active 55+ Gated, Community; Clubhouse & heated pool; new &' used homes, (352) 637-1400/ 1-800-779-1226 W. SUMTER CO. 12X50.SW, 1/1, 10X24 room add,; roof over & 2 sheds. NIcly landscpd; water access; nice prk $12,500(352) 793-4602 Over 3,000 Homes and Properties listed at homefront.comi SUGARMILL RENTALS Homes, villas, Duplex,, 2-43BR, w/orw/out 'pool. Long-term, short-term, & lease to purchase available. *ADonna Palmer* Caodwell Banker Next *Generation Realty* (352)382-2700 or (352) 464-4538 HOMOSASSA 3/2/2, Brand New, apple. Included, $850 + dep. (941) 928-5067 ,New 3 bedroom, Crystal Palms Apts. 1 & 2 Bdrm Easy Terms. Crystal River. 564-0882 CRYSTAL RIVER 2/1. lst ien yqen ._. $650/mo: 352-%W-BT - = 'WHEEL - SO A DEAL I FOR ONLY $6.00 I Pick your classified transportation ad up into ourNEW Tuesday Wheels Section, " (352) 563-5966 CRYSTAL RIVER Planraonia .'llage .or. 2 dof iq n or2 -1200J q rt (352) 795-4301 FOR LEASE Offices/ Warehouse approx. 1500 finished space, approx. 2300 warehouse, located- 641 E. Gulf to Lake Hwy Lecanto (352) 344-0975 INVERNESS., 4 offices/Business suite, approx. 1,000 sq.ft. 425 S. Croft Ave., S (352)341-0500 ,CITRUS HILLS 2/2, fully furn;, pool & tennis. Short, seasonal ,or long term. Privately owned & malnt.. 352-527-8002/476-4242 CITRUS HILLS Furnished, 2BR. 2Y BA Townhouse $800/mo. 3524697-0801 SUGARMILL WOODS Villa 22/2/1 on Glf Crs, Great neighborhood, many extras, $850/mo. 1st, Ist+sec 352-382504 INVERNESS CITY LIMITS 2/1, garage, very Ig on 1 acre, quiet & private, W/D hookup, water, very clean, $695/mo' (352) 422-3217,1 HOMOSASSA 1 rm, effic. $575/mo W/D, Wtr, elec. cbl. ncl. $200 dep. 352-382-4429 wDally/Weekly 10 Monthly rw Effidcency s* Seasonal $725-$1800/mo. Maintenance Services Available Assurance Property Management 352-726-0662 -"-; Beautiful, NEW 4/2/2 >2,300 li lr,ng r.ilr.jle rrm Prk'.v, ,' 55, mrn to Tampa. Many extrasl Pn.'1 comm golf & 2 C C. .virrTminrg FSBO $239,900 or lease $1.200/mo; Trn-key (386) 569-6777 3/2/2 Citrus springs RENT TO OWN Brand new home $6000 down &8 945/mo. Call (407) 227-2821 S AFFORDABLE Homas: 1/1. $400; 2/2/1 Villa $725; NEW 3/2/2 $825; 4/2/2 $1100 CIT. SPGS. 3/2/2 $895 River Links Realty 628-1616/800-488-5184 BEVERLY HILLS 2/1 CH, Fla rr. E675 rrn-.:, (352).341-8451 BEVERLY HILLS 2/1/1 Stove, Ref, W/D, lanal, ceillng fans $695/mo. lst/L/SD 352-425-4522 BEVERLY HILLS 2/2, C/H/A, FL rm, new tile & carpet, $700 + sec. (352) 212-4494 BEVERLY HILLS 3/1/1, tile & carpet thru-out, 36 Washing ton St. $825/mo. 1st, last, sec.352-746-5969 BEVERLY HILLS 4/2 & 2/1 (352) 464-2514 Brentwood of Terra Vista, 2/2, 5/5 $925mo, Please Call: (352) 341-3330 For more Info. or visit the web at: itrusvlllages rentals.cam THURSDAY. TvsY 6, 2006 90 CAffordableouses Springs Property Management & Investment Group, Inc. Licensed R.E. Broker >- Property & Comm. Assoc. Mgmt. Is our only Business )- Res,& Vac. Rental Specialists >) Condo & Home owner Assoc. Mgmt. Rabble Anderson LCAM, Realtor 352-628-5600 Infoforoperty managmentrouD. mor C.R., 1 BR for single senior person, NS/No Alcohol or pets, good refs (352) 795-4384 CRYSTAL RIVER 2 Bdrm. Furnished $600. m. (352) 563-9857 CRYSTAL RIVER Historic Downtown,. Unique Locatlori,1 BR Luxury Suites. Daily, wkiy, monthly 795-1795 landlnals.com CRYSTAL RIVER Newly Renovated 1 bedrm efficiencies w/ fully equip kitchens. No contracts necessary., Next to park/ KIr.g, Bai Starting @ S199wk (Includes all utilities & Full Service Housekeeping) (352) 586-1813 Crystal Palms Apts. 1 & 2 Bdrm Easy Terms. Crystal River. 564-0882 HERNANDO 2/1, very clean $525 +1st, last & sec 352-527-0033 or Iv. msg. SINVERNESS 1/1 Clean, quiet area. Non smoking $385+; e st, last. sec. 352-464-4211 INVERNESS CITY LIMITS 2/1., garage, very Ig on 1 acre, quiet & private. very clean, i695/rao Affordable Cit. Springs RENT TO OWN New const. 3/2/2, low down pay, $1,075/mo. Call (352) 629-3777 CITRUS SPRINGS 3/2/2 Brand hew w/ vaulted ceilings, plant shelves, covered, screened lanai, close to the golf course.... $1,000/month or less Many homes pet friendly. Free app feel aAction Prop Mgt-Uc RE Broker 352-465-1158 or 866-220.1146 Ren1QLnet CITRUS SPRINGS, 2'1.51 jj ,le- arrea .,I- r-i..u m'oiure trees, scrnd lanai. $685/mo. lst/last/sec. 352-527-3953/208-0220 DUNNELLON 2/1 Rainbow Lakes Est., $725/mo. I yf lease (239)438-8085 DUNNELLON 3/1.5/crpt, Ig. eat-in kit., near shopping,. $795/. mo. Ist/lost/sec. 352-527-3953/208-0220 HOMOSASSA 3/2/2, Brand New, apple. Included, $850 + dep. (941) 928-5067 If you can rent You Can Own Let us show you how. Self- employed, all credit Issues, bankruptcy OK Associated Mortgage 352-344-0571. com INVERNESS 2 x-lg. 2/2/1 fenced, Appll. $825+ 1st. Ist.sec.. 954-650-7884 Inverness New LAKESIDE HOME, 1 small pet OK, no smoking $1.100/mo. (352) 201-0350 Iv. msg. CITRUS SPRINGS & SUGARMILL WOODS Brand New 3 & 4 Bedroom Homes on. nice home sites..' Homes Incl. spacious open living areas w/luxurious details. Affordable rental Mercedes Homes Really Inc. 877-245-6675 RENTALS ' Large Variety of Rentals Available County wide. Many with purchase options. Great American Realty (352) 637-3800 STOP PAYING RENTI You may be able to buy7 You'll never know if you don't.fry l Let me help you. Deb Infantine EXIT REALTY LEADERS (352) 302-8046 CITRUS HINLLS Brentwood Gated 3/2/2./ .'all Imed rr,m perry. oksa 5i ISl' (352)746-4134 STONE RIDGE LANDING SAdult gated . Community,'.. Immaculate. 2-bed/1-bath. Scm., Room, Carport. Fully Furni hed. ju.i moe I r, 3 i .000 mrortr.-morntrh 352-637-2973 BEVERLY HILLS Lrg 2/2/1, Fi Rm, new appl., newly painted $750.mo 352-746-3700 BRENTWOOD 2BR, 2BA, 2 CGar., a $900. mo 352 697-0801 .CITRUS HILLS Unfurnished Homes & Furnished Condos Greenbriar Rentals, Inc. (352) 746-5921 CITRUS SPRGS. New 3/2/2 1,608 sf/u/a, Tile Only $975/mo Or rent QjbuJd (772)621-7927 CITRUS SPRINGS 2/1, W&D, $650 1st, last & Sec. (352) 563-5304 CITRUS SPRINGS 4/2/2, W/D $995/mo. No pets(352)465-3371 CITRUS SPRINGS Avail N1o.,' ciar.2,1', $700, mo. 1st last & sec. r. io pei (352)464-4680 (808) 285-0793 CITRUS SPRINGS Beautiful new homes starting at 3/2/2 In Exc., Comm, near school & golf courses, Starting at $995. mo. 561-213-8229 CITRUS SPRINGS For Rent/ Rent to Own New 4/2/2,$1200mo., (847) 812-9621 Kelly CRYSTAL RIVER 3/2 Nice, clean, $900 mo (352) 795-6299 CRYSTAL RIVER 3/2/2, in Connell Heights. Ist/last/sec $900/mo.(352) 527-0785 DUNNELON RLE . 2/1/crpt. CH/A; no pets $675/mo Ist/last/sec, (352) 489-1977 Homosassa 3/1 New Interior, just off 19, 1st.; st, dep. $750./mo. (352) 621-0750 HOMOSASSA 3/2 Nice area of homes, near community park, $900. (352) 621-3949 HOMOSASSA 3/2/2, Brand New, appl. included, $850 + dep; (941) 928-5067 HOMOSASSA Brand new executive luxury home for rent on Southern Woods golf course, 2,700 sq ft, 3/3/2, rich trim, $1.,950/mo, (813)390-7109. If you can rent You Can Own Let us show you how. Self- employed, all credit Issues, bankruptcy OK Associated Mortgage 352-344-0571. cam If you can rent You Can Own Let us: show you how. Self- employed, all credit Issues, bankruptcy OK Associated Mortgage 352-344-0571 -. corn : INV. HIGHLANDS 3/2/2. near downtown, * city wtr. Credit app req. no pen &0mo i5t. lair & sec 352-249-4451 INVERNESS 3/1.5/2 Gospel slar'.d A.C hie W/D. Pers, o. S950/mor (352)267-3111 INVERNESS 3/2/2, Highlands Call for appt. (786) 423-0478 or (352) 637-1142 INVERNESS CITY LIMITS 2/1, garage, very Ig on. 1 acre, quiet & private. W/D hookup, water, very clean, $695/mo (352) 422-3217 INVERNESS Inverness 3/2/2 fncd yard, 1650 sq.ft, FR opens to LR, split plan, renovated, near school $1050/mo (407) 375-6187 PINE RIDGE 3/2/2 1800 -q. ii or, I acre. 1,I 0 rr,o unlitlie (352) 527-2441 RAINBOW LAKES EST 4/2/2 ,r, in e Fine quiet neigh.,1orriooa. *995/m.o ist/irast/sc 352-527-3953/208-0220 Sugarmill Woods 3/2/2 Pool $1300/mo. Incl. lawn & pool maint. Bonus for gd tenancy (352) 382-3202 or cell (352) 220-3821 *Bad Credit/No Credit *Lower Rates *Purchase/ Refinanc.e *Fast Closings Free Call 888-443-4733 r LNEYOEND P Private Investor, I i Hard Equity, No L Credit. No up Front I I Fees. Real Estdte Collateral Call Steve S(352) 503-3320 (352) 540-1523 CL.ASSI]FI)EDES Affordable CIt. Springs RENT TO OWN New const. 3/2/2, low down pay. $1,075/mo. Call (352) 629-3777 BEVERLY HILLS G.C, Villa 2 or 3/2/2, 1395 sq. ft., fairway view. $185,000 terms (352) 527-9381 CITRUS SPRINGS 3/2/2, almost new, Quiet area: $1,000/mo. Poss. Lease/purch. (352) 746-7023 CITRUS SPRINGS 4/2/2 New Home, 2264 sq.ft. For sale or rent by owner. Near schools & community center. Pay no closing costs. Call (954) 325-6041 * F.3.,l hc..im c.rdp l.. t.,r I X.u l lu t S:, II ull IrcI Crystal River area. $125/wk (352) 628-9106-lv msg ROOM, BATH & SHOWER Priv.. entrance, all utill- ties + cable turn, $110 wk (352) 726-2243 CRYSTAL RIVER Furn., 1 BR, W/F, dock, 352-634-0129 CRYSTAL RIVER Historic Downtown, Unique Location, 1BR Luxury Suites. Daily, Wkly, Mthly 795-1795 landings.com CRYSTAL RIVER . In the City. 14x20 to 14x40. For more info call: (352) 464-1086 2/17/1 Citrus Springs,. Central Heat & Air, $112,500.(352) 302-905 cuwtaoy o criilren under l8 rnis newspaper will nol kn.'vingiy accept any adjeritorg for real e.iale wraich is in vtiolaor oi the low Our reader are; reieb, ir, f.rmea mat all dwellings a. 1 rierled Ir r i,:; newspaper ore aoil- able on an equal opportunity boi.c. To complain of discrimination call HIJD toll-free at i -80-66-97 797. Tre toii-frlee leephor number for the hearing iTpoiied i1 MR CITRUS COUNTY REALTY SALAN NUSSO 3.9% Listings INVESTORS BUYERS AGENT BUSINESS BROKER (352) 422-6956 ANUSSO.COM LAND AUCTION 200 Props must be sold Low down/E-Z Finhancing. Free catalog (800) 937-1603 WWW, LANDAUCTION.COM N.R.LL. East. LLC Auction Business License: AB2509, MarK Bulezluk Auctioneer Ucense: Aq3448, Jeffrey Johnston Auctioneer License: AU3449. StaceyMauck Auctioneer LUcense: AU3447: FCAN Waterfront Auction Gulf Acccess 352-726-7533 Reliance Realty Sat.10-4 & Sun 8-12 2/2/2, 1,360 sq, ft, Bev. Hills $150.000 3094 N. Satinflower Pt. ACROPOLIS MORTGAGE 3/2/2 fum-Near 3 Sisters, Decka'ge, MUST SEEI $2250/mo, all utilnc S352-258-6000/697-0983 CRYSTAL RIVER waterfront home 3 bed-, rooms, deep water no bridges, large dock,,. 1000o00 per monthCall 352-795-2558 after 5 FLORAL CITY 1/1 Waterfront Loft, scrnd patio, Ig, lot w/mature trees; non smok; util.Inc, $625/mo Ist/lost/sec. (813)241-7117 KrIstI Infverness New LAKESIDE HOME, 1 small pet OK, no smoking $1100/mo. (352) 201-0350 Iv. msg, INVERNESS -ON LAKE 3/2/2, Deck, dock No pets. $900/mo. (908) 322-6529 INVERNESS, new 3/2/2, fully furn or unfurn, $975 + utils, City sewage & water; refs req d (484),357-710 ROOMMATE WANTED, Non smoker $115 wkly includes utilities, cable & laundry facility. Plus dep. Inverness area (352) 476-1094 ROOMMATE WANTED: Single male looking to share house on 1 ac, in Homosassa $150/wk, Inct, until, food, laundry; $500 dep 352-503-3108 310C THURSDAY JULY 6 2006 s *, "The MaxI" for details. Ing. R. Max Simms, LLC, New paint, carpet & tile, GRI, AHWD REDUCED TO $199.900 Broker Associate. Avail now 352-637-9220 (352) 527-1655 BY OWNER 2/2/2, Sktk R 319 Hemlock LGM A, C (off S.Apopka) Spilt plan, Inside Laundry, IT ,te te security system, roof new '06. Newer Trane 2/1/1+ w/1634 SF under A/C, 12x14 util. bldg. roof, Ig LR & FM, new w/elect. Appliances appls/fans/crpt/blinds Included. Reduced thruout, brick front, Asking $152,500 shed in bkyd, $112.000 Call (352) 726-6544 or 56 S. Lucille St. (352) 422-1987 cell (352) 746-0834 Adjoining lot available 3/2/CP, pool, FP, BY OWNER 4/2 shed, fenced yard, 2,048 sq. ft.,beautlful . new flooring, fully scrnd pool, fruit trees remodeled, $139K OBO 1130 W Bucknell Ave. 46 S. Monroe St. REDUCEDIII $157,400 (352) 422-3872 (352) 637-5937 ATTENTION Ship For Sale By Owner Program Participantsl 6079 E. Daly.Lane Don't miss out on this 2/2/1, new carpet & tile rare opportunity 2/1/1, fenced back yard, Priced to sell $109,900 like new, $149,900. Agt/ownr 352-613-2238 44) 253( 2-7772 m BEST DEAL IN NEWER Need a mortgage SECTIONI 3/11/2/2, new & banks won't help? roof in 2005, C/H/A, Self-employed, glassed Fl. rm. $142,000. all credit Issues '352-726-2628 Bankruptcy OK. Parsley Real Estate Inc. Associate Mortgage 352-344-0571 BEVERLY HILLS. ESTATE SALE corm FRI. JULY 7* 70 Sugarmaple Lane SALE: 8 AM House, contents, '02 Buick Century, All for sale. One dayl (2) HOMES CBS, 2/2, See Web:www. 1,200 sqft, ea. 1 AC, dudleysauction.com mol., country setting, (352)637-9588 $295,000, (352) 726-1909 BEVERLY HILLS APTS FO SALE 9 UNITS G.C Villa 2 or 3/2/2, /1APTS. ryLE 9 R, 1395 sq. ft., fairway 2/I, Crystal River, view, $185,000 terms $450,000. By Owner view.5 00 t38erms 352-634-4076 (352) 527-9381 CRYSTAL/HOMOSASSA * * 5 Lots, Paved; 1 rental By owner $16K-$28K. 3.9%/2.9% 3 .9%/2.9% (352) 503-4142 Full Service Listing Why Pay More??? No Hidden Fees 25+Yrs. Experience Call & compare 2/1, split plan, 1,440 $150+Million SOLDIII sq. ft. M.O.L., 1/3 oc. Please Call adj. to G.C., on for Details, cul-de-sac. FR w/frpl, Listings & Home Immac. conditional Market Analysis $165,900(352)489-8605 RON & KARNA NEIIZ 3/2/2 BRAND NEW BROKERS/REALTORS Avail. NOW on 1/4 acre CITRUS REALTY GROUP or 1/2 acre lot. Owner (352)795-0060. Finan. Avail. $179-199k 3 I Call (407) 227-2821 Upgraded 2/2/1, Newer 3/2/2 Citrus S rings apple cabinets, RENT TO OWN bathroom, fixtures, & Brand new home carpet. New screen $6000 down & $945/mo. troom.n new 43,900r Call (407) 227-2821 than new 352)746-$10461 3/2/2 Formal din. & liv. rm.,. g breakfast nook 12 x 20 scrnm. lanal, 12 x 24 shed, o e Gorgeous 3/3/3 Bonnie Peterson custom golf course Realtor pool home. Master suite, ig eat-in Ktch. Your Satisfaction Is Under appraisal at my Futurel $289,500. MUST SELLI 352-875-4760 (352) 794-0888 (352) 586-6921 * ** R Exit Realty Leaders of FOR SALE BY OWNER Crystal RIver LIKE NEW 4/2/2 1/4+ Acre corner lot. Kitchenald SS Appl,' Security System, Screened Lanai & more. $233k 352-465-1193/536-0733 ** * * S=3.9%/2.9% -E PFull Service Listing 2 or 3/2/2+ On 1.4ac. EP Why Pay More??? in mstr. bdrm. oond. w/ No Hidden Fees waterfall. Jacuzz 2100sf 25+Yrs. Experience Cal & compare home.com Gourmet kit $150+Milllon SOLDIII $325,000352-746-3330 Please Call for Details, 3/2/2, 1 acre, wooded Listings & Home lot, 2400 sq. ft., gas F.P., Market Analysis den, & more $259,000. 4792 W. Custer Dr. RON & KARNA NEITZ (352) 527-9692 BROKERS/REALTORS - Don't Horse Around CITRUS REALTY GROUP rse roun(352)795-0060. Call Diana Willms A Pine Ridge Resident 9/29% REALTOR 3.9/2.9% 352-422-0540 Full Service Usting dwillmsl@tampa boy.rr.com Why Pay Mare??? No Hidden Fees Craven Realty, Inc 25+Yrs. Expedence 352-726-1515 Call & Compare For Sale By Owner 2/2/2 $150+Milllon SOLDIII 1800 sq. ft., 1.25 acres, fenced backyard. Please Call for Details, $215,000. Listings & Home (352)634-4304/266-2814 Market Analysis FOR SALE RON & KARNA NEITZ BY OWNER BROKERS/REALTORS 3/2/2, bit 2004, 2160 sf CITRUS REALTY GROUP 1.6 acres Ceramic, (352)795-0060. Lanai w/ Hot Tub, upgraded kitchen, ' storage shed, fence. Her a Corner of Bridger & Amarillo $369,000. Call i 1 352-746-0805 ARBOR LAKES, FSBO 3/2/2 expanded Need a mortgage Sanibel Model, 1/4 ac & banks won't help?, corner lot, 1908 sqft, liv Self-employed, area, $269,900. Call for all credit Issues Info: (352) 344-5845 Bankruptcy OK. Associate Mortgage 1 352-344-0571. co o e (2) BRAND NEW 3/2/2 4 4 Many upgrades. S$199,000 &$219,000 Di3.9%/2.vorce Sale 3.9%/2.9% (404) 610-4324 Full Service Listing (2) HOMES CBS, 2/2, 1,200. sq.ft. ea. 1 AC, Why Pay More??? mol., country setting, No Hidden Fees $295,000. 25+Yrs. Experience (352) 726-1909 Calll&loSmpare (2) HOMES CBS, 2/2, $150+Mlllon SOLDIII 12 sq.ft ea. 1 AC, D mol., country setting, Please Call for Details, $295,000. Listings & Home (352) 726-1909 Market Analysis 2/2 Plo RON & KARNA NEITZ Sunrise Lake Est, of or, BROKERS/REALTORS 3rd BR, gas FP, fncd yd, CITRUS REALTY GROUP Irr sys, scr lanal, 3110 S. S(352)795-0060. Eagle Ter., $225,000 (352) 344-3110 S3/2 New Desianer Home Elegance & inviting floor plan $274,900 3/2/2 CBH Split Plan on a a3 lots In S. Highlands, scr lanai, Ig K w/nook, WIC, 10x12 shed, part fncd, 1mt fm town, $165.000 owners.com #TPW7260 930 Maple Ave. (352) 637-7189 3/2/2/2 On 1-/8 AC @Counhv h ne Cily@ New 1900+ Homes for Sale roof, In Citrus County. Call soffiffasdca&custom cutter- Why Pay Rent When you can own? Several Options Available. New Home Buyers Dream. (352) 697-2849 Brad Potts Jr Horses Welcome- 5 Beautiful Acres Fenced & GQted, Also Includes a 3bed 2bath 28x48 M.H. off Citrus Ave, $179,900 Call (352) 746-5912 Need a mortgage & banks won't help? Self-employed, all credit Issues Bankruptcy OK. Associate Mortgage 352-344-0571. ,com QUIET LOCATION, totally updated, Ig deck, wd floors, freshly painted, ready to move In, block home, 2/1, $119,900 (321) 271-7800 GolfCommunity- Huge 2/2/2 + Office, Formal L/R, D/R, Ig. Family room & bonus room. Over 2050sq.ft. under air. Completely updated & ready to move In. Priced below market for quick sale. Asking $210,000,00 point In & out, $195,000 3108 S. Telllco Ter. 352-637-0041/464-2363 Need a mortgage & banks won't help?. Self-employed, all credit Issues Bankruptcy OK. Associate Mortgage 352-344-0571. corm Classfied ad 6 lines, 30 days $49.95 Call 726-1441 563-5966 Non-Refundable Private Party .Only (Some Peslactlons May appf.4) UPSCALE EXEC. POOL HOME, 4BR, 4 full baths, 2-1/2 acres, 30x40 detached garage, great in-law set up, (352) 344-0078 WINDERMERE HOME Custom built 2001 Windermere home; 3/2/2, tiled and enclosed lanai; Oversized tiled garden tub with jets; Inside laundry room, solid oak cabinets; alarm system; Many other extrosll $269k. (352) 637-2627 List with me & get free home warranty. No transaction fees (352) 586-9072 :=721. Nature Coast RIVERHAVEN FSBO 3/2/2 ranch home, w/ appis, new 30 yr roof, gas fireplace, well maintained, $239.000 (352) 628-5316 Spotted Dog Real Estate (352) 628-9191 c*o****** W- Beautiful, NEW 4/2/2, >2,300 living. Minutes frm Prkwy.. 55 mln. to Tampa. Many extras Privt. comm., golf & 2 C.C., swimming, FSBO $239,900 or lease $1,200/mo. Iuun-kev (386) 569-6777 "Fixer Upper" 3/2/2 w/ Pool & FP Over 2,100 sq. ft, $187;500 (352) 228-0555 3/2/2 2.872 sq. ft. under roof, w/pool. Too Many options to list Big corner lot $265,900 (352) 382-5301 GORGEOUS POOL HOME BY SWEETWATER IN THE ENCLAVE WALLED COMMUNITY 2746 sq ft. in model home condition $385,000. 352-382-3879. (2) HOMES CBS, 2/2, 1,200 sqft, ea.. 1 AC, rol., country setting, 1$295,000, (352) 726-1909 *CHARMING HOME* Near Rock Crusher Ac.'Lot, 3/2 Ranch, $174,500 For photos & into: coasthomefront.com Listing #112483685 352-628-1564/586-7465 5 STEPS FOR IMPROVING YOUR CREDIT SCORE Online Emall debble@debble Or Over The Phone 352-795-2441 DEBBIE RECTOR Realty One homesnow.com 3/2/2 BRAND NEW Avail. NOW on 1/4 acre or 1/2 acre lot. Owner Finan. Avail. $179-199k Call (407) 227-2821 C4* Cirs Co Call Me PHYLLIS STRICKLAND (352) 613-3503 EXIT REALTY LEADERS CB 3/2/1.5'- 5 ac. Priced below appeals. @ $349,900 See @ forsalebvowner.com #20587883. (352) 726-5535 CRYSTAL MANOR, 2.4A crnr lot, 3500sqft, 2-story cntry style wrap-around deck, 3/2.5, DR, Grt Rm w/20ft ceiling, FP. New appis, many upgrades, separate garage apt, built In '99. $4000 Owner (352) 220-8310 Fixer Upper Bargains, These homes need work, lowest prices. Call for a free list. Free recorded message 1-800-208-9258 ID#1048 E.RA.American Really & Investments e2 For Sale By Owner 3/2, (352) 563-9857 4 C. 3/2 DW on y4ac. Nice, $69,000 2/11/2 SW on 1/4 ac. Can't beat this price, $55,000 (352) 628-0731 3/2 DW on I ac. Like new w/many extras, must see at $119.900. (352) 628-0731 3/2/2 BRAND NEW SWEETWATER HOME Corner lot, 1 blk from marina; Gasparilla Cay (352)634-4793. (888) 839-3504 ext 700 CLASSIFIED HOME FOR SALE On Your Lot, $110,900. 3/2/1, w/ Laundry Atkinson Construction 352-637-4138 LIc.# CBC059685 Over 3,000 Homes and Properties listed at homefront.com 55+ Community $79,000, 1st floor, furn. 2/2 w/screened lanal, great Inverness location 352-465-2372, Iv. msg. or cell 352-613-3627. CITRUS HILLS MEADOWVIEW 2/2/1 VILLA, New roof, siding, AC, only $149,900. Owner (352) 746-0658 CRYSTAL RIVER CONDO Ground floor, 1/1, move In cond. Great loca- tionlI Beautiful 1/3 AC. lot, 14th hole Plantation SG.C; Priced below others on G.C.I 83K (352) 220-1388 Over 3,000 Homes and Properties listed at homefront.com PLANTATION GC Panoramic View 3/2/2 split plan, Great Rm- Kit, FP, (352) 257-4260 $275K SKYVIEW, 3/2/2, great views, peaceful setting Energy effic., waterfall w/ pond, southern exp. $379.k (352) 746-7512 Beware of Mortgage Companies They could charge you up to $10,000 In closing fees. Be educated before you buy with our FREE CD and workbook:; Gulde.org or (888) 706-3885. Automated request line. FCAN COOL WESTERN NC MOUNTAINS- Escape the heat, hurricanes and high prices, Homes, cabins, lots acreage, investments. Prudential Great Smokys Realty, Downtown Bryson City. Call (877) 476-6597 FCAN GEORGIA/ NORTH CAROLINA Captivating mountain views, lakes, rivers, - waterfalls. Homesites starting @ $39,900. Log home kits @ $39,900,. Limited availability. Call *,i, Sp6cIOI36 inr Helping FAMILIES Acquire A Quality-Low-Priced Building Lot. 1-800-476-5373 ask for C.R. Bankson at ERA American Realty & Investments cr.bankson@era.com FOR FREE PACKAGE of Lots & Maps Call 800 # Above Lv. Name & Address PINE RIDGE Pine Ridge Blvd. I acre, Beautiful lotil $87,900 (352) 746-1636 Hillside Villas Terra Vista, in Skyview Golf Course Comm. Outstanding activity center & tennis courts $78,000 (561) 310-9846 DUNNELLON AREA Land Use; Commercial ZonIng-Multl-75X140 $25,000 (877) 357-4455 .CITRUS SPRINGS 10 Lots Available By Owner $26,900, 352 291-9223/561-358-0562 r-'- homeslte, $119,900, Located minutes from downtown Jacksonville, FL. Private gated community. Miles of bridle trails, rec. area, fishing & boating. Call: (877) JRC-LAND Florida Land & Ranches, LLC FCAN Real Estate for Sale, Houses, Land, Water-front. National Forest Frontage, Piedmont of NC. Iron Horse Properties, (800) 997-2248, auctlon.com, NCAL #3936 FCAN RIVERFRONT LAND SALE 20 acres $39,900. Beautiful Tug Hill setting Great Trout/Salmon fishing, canoeing, direct snowmobile trail access G'teed bulldablel EZ Termsi (800) 260-4756. www. mooseriveriand.com CITRUS COUNTY (FL) CHRONICLE 3/2/1 VILLA + DEN Privately funded dock; upgrades, extras, community pool & tennis. $214,500 (352) 637-6831 Crystal River Home w/ great location and fantastic view on open water, minutes To Gulf. Seawall and docks with boat lift. Call owner (352) 274-5413 Crystal River, 2 Story Waterfront,2 kit. 2 cov- ered boat slips, 5 BR, 3BA, over 3,200 sq. ft. $899,000. on canal to Kings Bay 352-563-9857 Homosassa Riverfront Below appraisal 3/21/2/2 Pool, spa, dock, booths. Call Linda 813-299-4135 Florida Executive Realty LET OUR OFFICE GUIDE YOU! Plantation Realty. Inc. 1352) 795-0784 Cell 422-7925 Lisa VanDeboe Broker (R)/Owner See all of the listings In Citrus County at realtivnc.com Over 3,000 Homes and, Properties listed at homefront.com RIVERSIDE GARDEN 3/1/1, w/1/I Guest House; new appliances; scrnd prch, shed, coy pond, boat-house, sea- wall. $280,000 352-341-1539/476-5238. RON EGNOT 352-287-9219 CHAPARRAL 1988,21'w/ traller.Twin 90 hp Evlnrudes, cuddy cabin; needs minor work. Gps Inc. $4,900 (352) 726-2693 SSales Storage Service Sweetwater & Tuscany Pontoons Hurricane Deckboats Polar Kraft Jon Boats Polar Offshore & Bay Boats Hwy. 19, Crystal River |^alaS 02, CITRUS SPRINGS Cheapest Res. Lot below market, $24,899. Owner must sell now. 888-363-1668, TCHT RE CITRUS SPRINGS 20,LOTS avail, by owner, Incl's Corner & oversized. Most have util. $25,500 ea, 407-617-1005 CRYSTAL MANOR 1,27 acre homesite 10211 W. Killarney. $46,500 (561)262-8077 CRYSTAL/HOMOSASSA 5 Lots, Paved; 1 rental By owner $16K-$28K, (352) 503-4142 HOMOSASSA AREA Mobile home lot; Odd shape lot. $8,000 (877)357-4455 Toll free Inverness over acrece 9645 Baymeadows, beautiful, live oaks, underground utilities, deed restricted, $69,000. Call (703) 408-7990 OAKWOOD VILLAGE 2 side-by-slde, 935,941 W. Colbert, 132x 111 total MOL, sell together $29,900. (352) 746-6624 Off Forest Dr. Inverness, . 75 X 1.17 Some trees, borders condo. $20,000. 423-247-2525 PINE RIDGE Pine Ridge Blvd. 1 acre, Beautiful lotll $87,900 (352) 746-1636 15 ACRE FLORIDA RANCH ESTATE Only. $69,9001 Short Drive to the Gulf of Mexico Just minutes from 1-10. Won't last Call Nowl (866) 950-5263 Ext 650 FCAN ABANDONED FARMI 5 acres $19,900, Meadow, woods, view, pondl Near major lakes and State Landl Quiet town road w/electl Owner terms (888) 877-9488 ALABAMA WATERFRONT ACREAGE 2 hours from atlanta & the Coast. Gated with exceptional amenities, Including boat slips. 1/2 to 3 acres from the $40's. Near great historic town. Call (866) 882-1107 FCAN ASHEVILLE, NC AREA Acreage 1 to 8 acre parcels. Gated community on 4 miles of riverfront. Superb . planned amenities. Exceptional mountain and river sites. Preview Phase I1 nowl (866) 292-5762 FCAN BUYERS MARKET COASTAL NORTH CAROLINA 95-100% LTV Financing. Call CCL Inc. Realty (800) 682-9951 FCAN CENTRAL TENNESSEE ACREAGE Amazing rolling vista views. 1 to 5 acre parcels from the $40's. Planned clubhouse, nature trails. 1 hr. to Chattanooga, 2 hrs to Nashville. (866) 292-5769 FCAN GRAND OPENINGII LAKE LURE MOUNTAIN WATERFRONT COMMUNITY 25-minutes from Ashevillel DEEP WATER PARCEL 1.38 acres overlooking Lake Barkley. 90 min to Nashville, minutes to tLand Between the Lakes. Just $47,000. Won't last! Owner (866) 292-5769gulde.com/ L. FCAN MAINE OCEANFRONT BARGAIN 4+ Acres 220' waterfront only $149,900 5+ acres, ocean access only $34,900, Enjoy spectacular 4+ acre oceanfront parcel w/over 220' of private shoreline. Or relax on yur 5+ acre ocean access lot w/deeded access to gorgeous private sandy beach, Surveyed, soil tested, paved rd, In gated community, Great Owner financing, Call L&S Realty (207) 781-3343 coastalmaineland.com FCAN NEW TO MARKET Lakefront & Equestrian parcels 7+ acres, equestrian parcel, $209,900 8+ acres, Direct lakefront, $269,900 2+.acres, Horseback riding, hiking, ATV's, hunting. Perfect family ranch or retreat, electricity. 100% financing. NALC (866) 365-2825 FCAN WNC MOUNTAINS 2.06 ACRES w/hardwood trees. Financing availa- ble only $31,995. Private lake and river access. This one won't last. Call today (800) 699-1289 or lure.com FCAN CRYSTAL RIVER Waterfront Lots, Deep' water canal, just off main river, no bridges, new sea-wall $364,900 (561)358-0562 WATERFRONT LOT Indian Waters Ready-to-Build Motivated, $249,900 FSBO (352) 563-6424 WATERFRONT Over One Beautiful Acre in Floral City right off Hwy. 41. Only $79,900. Call: (352) 302-3126 1984 15HP Mariner, runs good, Jach-plate, new water pump, tune up$750. obo (352) 564-1324 MERCURY OUTBOARD 9.8 hp, never been in water, asking $800 (352) 533-3024 or (813) 299-6014 MOTOR GUIDE TROLLING MTR 12V, Stealth, 41 lb. thrust, foot control. Used very little. $250 (352) 344-5667 '04 ODYSSEY Pontoon Boat 21 ft. w/60hp Johnson 4strk, excel cond, livewell, fish finder, cover & trail- er, only l00hrs, $14,800. obo(352) 382-7557 12' ALUMINUM BOATS One-$250 Second-$350 (352) 465-7402 14' V HULL W/flat floor, 35HP Evinrude motor w/trailer. $1200/obo (352) 560-7274 17/2 ft BAYLINER 40th Anniv Ed, 1996 1/0, w/trailer, low hrs, very, nice, $4200 OBO (352) 637-4785 20' KEY LARGO LEGACY'Dek Bbat 1998, w/115hp Johnson & trir, good cond, $6100 (352) 560-7598 20' OPEN GARVEY Center console. '92- 90 HP Evinrude, pwr trim, dbl axle gaiv. trailer, $2200 (352)628-4754 24' HURRICANE 1994 Fundeck, 200HP Johnson, fish pkg. Bimini, covers, sink, head, ship to shore, trIr. & more. Exc. cond, $8995/obo. 352-220-5054/628-6736 MARINE soet Seles & Seie : Large Selection of Clean Preowned Boats . We need Them! S We sell Them! no ff.'s HW'y 1 .' Crystal Ri. '85 22' C/C CRUISER S200hp OMC motor & trlr TURN KEY & GOI $5,000 OBQ (352) 795-9030 Aluminum 14' Boat with Trailer, 8hp Suzuki motor, $800,00. (352) 563-1263 BASSTRACKER 18', 150HPMerc., electric trolling motor. Alum, float on trailer. $5900. (352) 341-4352 BAYLINER CAPRI '86, 16', exc cond. 85 hp w/troiler & depth finder $5,500 OBO (352) 628-0862 Carolina Skiff '02,. 16 ft. J Series, 40HP merc. '04, tiller, trolling motor, depth finder, B&S galv, trailer '04, $4,500. (352) 447-3414 CAROLINA SKIFF 16FT, '97 boat, '04 mtr warranty till 2009 30 hrs on mtr. FF/GPS, $6,000 (352) 476-7252 Carolina Skiff '95, J14.03 Johnson 25 electric start, good tri., & access. $2200.00 (352) 563-0640 CENTURY 2201 Bay Boat, '00, econ & quiet, fuel Inj Yam 150 w/hyd steering, trr, low hrs, 17.Z500 795-1320 CHRYSLER 1974, 14',115 Evinrude, $1,500 (352) 220-1159 COBIA '90, 19' 7", hew Interior, V6, mercy eng. runs great. Steal It for $6,500. (352) 621-0750 G-3 Bass Boat '00, 18'/2ft., 90, horse Yamaha eng. $8,000. Crystal Manor (352) 795-5260 Gheenee 13' 2002, with 1989 Rocket Int. Trailer, $900. (352) 489-8409, $9,500 OBO (352) 795-4002 KAYAKS (2) 10Oft. Splash, sit on top w/ paddles, deckplate, dry port, deck straps $439. new, $300. ea. (352) 637-9544 KEY LARGO '98 Boat mtr. & gal. trir. 17', Cntr cnsl, fiberglass,; 75 hp Mariner. Extrasil $6,400 (352) 465-3443 MARATHON 1988, 22', rebuilt, 165hp Merc 10, good fami- ly/fishing boat, cabin head fridge, full canvas & canopy tandem axal tilt trailer, marine radio, depth finder, $4750 Neg. (352) 489-8050 NEW Pontoon Boat Trailer CLEARANCE SALE 18-20FT galv. w/ jack stand, 2-yr warr. Reg. price $1,749-- Our Clearance Price $1,495 While They Last 352-527-3555 Other Boat Trailer' Models Avail. NITRO 18' Bay Boat 2005,90 Merc, <10 hrs, trailing mtr, front swivel seat, GPS, F.F, mar. radio, compass, top. ILLNESS FORCES SALE. Like new, w/trlr, gar. kept. $17,000 (352) 382-3035 PHIL'S MOBILE MARINE All Makes & Models All Work Guaranteed 795-3674, 220-9435 POLAR 18FT 2005, custom top, CD, radio, 90 Yamaha 4 stroke, trailer, all like new $14,500. (352) 267-5364 PONTOON 18FT, 40HP Yamaha, P.T. very nice runs good, extras, $3,200 trade plus cash (352) 637-3983 PONTOON BOAT 24ft. Waco Alum., 70 HP John., 1979 w/hydrqu- lic tip/tilt, double axle trailer w/ spare tire $3,300. (352) 489-5954 PROLINE '01, 20FT. DC, bimini, live well, electronics; 150 merc. 75 hrs..,8ft beam, trailer, $19,500; (352) 344-3181 Regal 2120 Destiny ,',at -:. .'.-.' 22,rc. i.,.3.jd .sd E. .- .r.:. $27,500. OBO 746-3228 SCOUT, '96, 20ft Open fish, 175 Yamdha, float-on trir w/brakes, garage-kept, all bells & whistles, low hrs, $13,900 352-527-1077/476-3548 SEADOO SPORTSTER '03, 14V2 ft w'/trr, single eng, 130hp, 50mph+ very low hrs, exc cond, Bim top, cvr, garaged. .$7,800 (352) 341-0403 Sullivan Alum. 14' Flats boat, 25hp Yamaha, incl. trailer. & extras. $2800. (352) 503-3466 SUNDOWNER '99 17' w/'00 40hp llerc, live well, PT, can email pics, 2S000obo 352-533-3024 or 813-299-6014 VIKING 19' Deck Boat, need transom, 140 Suzuki, runs good, galv. trailer, $2,900. obo, 628-7904 r WHEEL OF A DEAL FOR ONLY $6.00 I Pick your classified transportation ad up into our NEW I Tuesday Wheels I Section. (352) 563-5966 J Out of Town co c= Land IlBoats 1st Choice Realty Waterfront Auction Gulf Acccess July 21 352-726-7533 Reliance Realty WE BUY HOUSES Ca$h........ Fast 352-637-2973 lhomesold.com ib-won--- 20+ ACRES, Hi & Dry, 488, wooded, equestri- an track $295,000. abo (352) 795-7617 CRYSTAL HILLS MINI- FARMS, 2.5 wooded acres, easy access, $75,000 (727) 692-3519 Crystal River Mini Farm Area, 2.5 Acre Lot well, septic, impact paid, $55k, agent own 352-795-5070, 586-9349 CRYSTAL RIVER-5 ACRES Near Plantation/Public Boat Ramp, S159K (352) 586-9113 HEATHERWOOD 1 acre corner lot, partially fenced, $40,000 (352) 726-2539 LOOKING TO BUILD YOUR HOME IN CITRUS COUNTY? CONTACT US. s AIRSTREAM 2001, 39' Land Yacht XL 390 Exc. cond. 330 cat diesel, 7.5W gen, every avail option, leather, corian 17k mi. $135,000 also avail 2004 Suzuki m Grand Vitara 4x4 tow car w/ avail, tow equip (352) 503-3103 (352) 442-5033 Holiday Rambler 36 5th Wheel, good cond,, king & queen size bed, air, stereo, etc. $6500.,' negotiable 628-9230 PRAIRIE SCHOONER 36FT, 5th wheel, load- ed, washer/dryer, must see to appreciate $6,800 (352) 634-4237 Search 100's of Local Autos Online at wheels.com THOR, Columbus '93,32'. 454 Chevy eng., 44 K. 5K gen, 2 AC's. lots storg, Immac.Must Seel $16,900 (352) 746-6963 TOYOTA DOLPHIN MOTORHOME, 1983 Runs exc, good Interior, new tires, $3,500 OBO (352) 465-9018 lyuu+ nomes for aale In Citrus County. Call "The Maxl" for details. R. Max Simms, LLC, GRI,. AHWD. Broker Associate. (352) 527-1655 2/1 w/large I car gar. In NW Citrus Co, 11,040 sq. ft. liv. area, fl rm. fenced yd, Ig. closets. Nice nelghborhoodl $115,000(352) 795-7180 3/1, Rent or own $4,000. take over payment or $800 rent 1st. last & sec. (352) 302-1434 CRYSTAL MANOR 3/2/2 Brand New Home, 2640 SF, 11/4 ac, upgrades CITRUS COIIN'T' (FL) CHRONICLE WILDWOOD '05, 29' w/slide awning, A extra clean; $17,500 OBO (352) 726-3053 30' JAYCO Designer Series, 5th wheel, 1988, new wtr. heater, exc. cond. $5,500. (352) 302-2352 HOLIDAY RAMBLER '92, Alumalite. 26' 5 wheel, many extras, ex- cel, cond. $6,500. obo (352) 382-2272 ROADRUNNER 2003, 18', sips, 4, many extras, Used twice, $7,000.obo (352) 746-3073 WILDERNESS 2004 Advantage 5th whl, 36' 3 slides, asking $27,900/ obo. (352) 270-3349 Car Tow Dolly Lights & Spare wheel $550. Citrus Springs (352) 489-4129 GEOSAT 2 MOBILE GPS I yr old w/software & PC cable; NEW $1200/ ASKING $395 (352) 795-4993 JEEP RIMS & TIRES 4 Matching, $300 (352) 628-3720 PIPE RACK Fits full-size Ford $75 (352) 382-5661 REESE 5TH WHEEL HITCH 15,000 Ib, all hardware, barely used, $400 (352) 621-4864 STEHL TOW DOLLY Elec, Brakes & control. $1,000 (352) 564-2541 ACURA INTEGRA 1996, Totally custom,' $7,500 or trade for pick-up 352-302-1199/628-7485 BIG SALE "Everybody Rides" Cars-Trucks-Vans 909US 44/US19-Airport 564-1212/ 400-2108 Consignment USA BUICK CENTURY '88 Wagon, great cond. Inside/ outside. $995. (352) 628-7624 .Buick Grand Nat'I.. '87, 140K, many.new ; parts, not running, needs exh, no time to fix 4LKOBO 352-628-7418 Buick LeSabre 1994, Custom, 4 door, 96k, loaded, excel. cond. cold a/c $1,900. (352) 302-9801 BUICK REGAL LS ;03 Silver metallic, 60K ml Excellent condition $8,200 OBO (352) 726-3727 CADILLAC 1990, DeVille, Red w/ wht leather, low ml, like new, $5,000. (352) 873-4631 Cadillac Deville 1991, A/C, V-8, Michelin Tires, CD, Fair cond. $2000. OBO (352) 621-7639 CADILLAC STS 2005, 12.500K, fact. warr., moon roof, V-6, loaded; Wht. diamond S$31,000(352) 564-6815 CHEVROLET '1999, Red Corvette, 67K, auto, $17,900 obo (352) 489-9402 FORD ESCORT SE 2001,4 dr., auto, AC, 34K, good cond., Gas misery $5,100 (352) 382-3109 FORD FOCUS '02 ZX5, 35k mi, Leather, 5CD changer, $9500/ obo. 352-344-9928 or 352-422-6902 FORD TAURUS 1995, special edition, 84k, cold ac, runs great $3,000 obo (352) 220-6460 Ford Taurus 1995, V-6, auto. all power; cold air, 93k, $2100. OBO (352) 382-4209 HONDA CIVIC 1991, DOHC, V-Tech Mtr, GSR rims, low miles, runs greatly $2,000 OBO (352) 257-2024 HONDA CIVIC 2001 2dr Coupe EX, new cond, new Fire Eng Red paint, 86K ml, $10,500 352-795-2347/302-4490 JAGUAR X, 2003 Silver, 4dr, blk leather, sunrf, phone, lggdd, 15K mi, $20,500 OBO (352) 344-2833 LINC TOWNCAR 1997, white, sunroof, keyless entry, CD player Asking $4,900 OBO (352) 795-8801 MERCURY SABLE 1999, 4 dr, Silver, Cold AC, Excellent Condition $4,500 OBOI (352) 302-4311 MITSUBISHI Eclipse GT,'02, pkg. upgrade 41K, V-6, sunroof, leath- er, CD, Immaculatel $11,900 (352) 628-0333 MITSUBSHI ECLIPSE 1996, red, 5 spd, sun- roof, AC, PW, $3200/ obo (352) 746-3073 NISSAN '04, 350Z, 5 spd. auto., bose stereo, touring coupe, silver, 25k ml., $25,500. obo 352-726-6779, 400-0462 NISSAN ALTIMA, '93 Runs Good EZ on Gas $1,200080 (352) 262-4009 CORVETTE '80 Midnight Blue, $9000/ abo, (352) 746-3073 NISSAN SENTRA LE 1994, 2 dr., 5 spd, tinted windows, cust. wheels, 120K, blue; good cond. $1,700 (352)476-4343 Pontiac Grand Prix 2001,4 dr, maroon, 119k highway miles, new brakes, $5995. (352) 860-0302 Search 100's of Local Autos Online at wheels.com ;11f*. ,' n r - TOYOTA CAMRY '95, XLE, Ice cold AC/new tires; looks/ drives exc. all opts/pwr $4,500.(352) 422-5685 TOYOTA CAMRY LE 1999, Garaged/mint, All power; Must sacriticel $7,500 352-634-0517/628-5904 '"" WHEEL - OF A DEAL I FOR ONLY $6.00 Pick your classified transportation ad up into our NEW I Tuesday Wheels Section. I (352) 563-5966 L -- - Your Donation of A Vehicle Supports Single, Homeless Mothers & Is Tax Deductible Donate your vehicle TO THE PATH (Rescue Mission for Men Women & Children) dt (352) 527-6500 CHEVY SHORTBED '62 Stepslde, pearl, fac- tory roller motor, 360HP 700R, 4wh.disc. $8100 (352) 465-0721 Corvette 1980 White, Blue Int., leather seats, a/c, p/w, cruise, 350 auto., t-tops, 77k, gar. keptexcel. shape, $11,500. 302-1204 JEEP CJ-7 1979 Classic, 304 V-8, hardtop, mostly orig. Needs TLC, good restoration project. Vehicle runs $3,000 obo (352) 726-8390 "Everybody /des" Cars-Trucks-Vans 909US 44/US19-Airport 564-1212/400-2108 Consignment USA CHEVY 1981 P30 Step Van (UPS type) Alum body, comp rblt Drive anywhere. $3,995 (352) 422-3217 CHEVY C-10 1983, 30K on rebuilt 350, asking $1,000 OBO (352) 527-1291 . CHEVY SILVERADO '88, blk. stepside, SB, new V8, auto. AC, PW, nice truck, $3250/part. trade, (352) 527-6529 DODGE '99, Ram 2500, quad cab, tow package, 95k ml. $8,750. (352) 795-1301 DODGE POWER Ram Pickup, 1989, LE 250, 3/4 ton, V-8, sil- ver/blue, ice cold air, deluxe wheels, gd tires, radial, battery, runs great, $1300, (352) 465-3679 DODGE RAM '98,1500, Ext. cab, 90k excel. cond. $6,500. 352-795-4129 FORD 1998 Ranger 4 speed runs great, $2,500 Call (352) 726-6550 FORD 2004 Explorer Sport Trac,30,000mi, $15,850. L/M (352) 249-3290 FORD F-250 1992, needs work $750 (352) 220-1159 FORD RANGER '97, newly rebuilt mtr, 5 Spd. Toolbox, 104K mi. Asking $2900. (352) 422-5972 GENERAL ESTATE AUCTION *THURS. JULY 6. 4000 S. Fla. Ave. Hwy. 41-S, Inverness PREVIEW: 1 PM SALE: 5 PM '94 Ford 350 Diesel, '87 F-250, Alum, Jon boat, wood stove, slot machine, 2 house fulls of household turn., contents. HUGE sewing collection w/500+ bolts fabric. Buy a truck & fill Itll See Web:www. dudleysauctlon.com AJ352) 637-9588 A1667 AU2246 12%BP 2%Disc ca/ck NISSAN FRONTIER EX CAB, 2004, very low mileage, PW/PS/P door locks, $13,900 (352) 795-0538 Search 100's of Local Autos Online at wheels.com 2004 HYUNDAI SANTA FE WHITE W/BLK LTHR BRA. 21,000mi, 4WD, V6 3.5L AUTO, Fully Loaded, All Power Options, Sliding Sun Roof, Alloy Whis. Call (352) 726-2942, 1 Owner, Asking $16K Exc. Cond. Long Warranty. FORD EXPLORER 2001, XLS, 4WD, New Tires, Runs Good, 95K, $9,200 obo, 352-726-3243 or 400-5164 JEEP 2001, Grand Cherokee Limited, 1 owner, Inferno red, beautiful, 54K, 4.7 liter, must sell, $12,500080. (352) 527-4355 lcm Cars 143-0706 THCRN PUBLIC NOTICE NOTICE OF SALE The following vehicles) will be sold at public auc- tion, Free of all prior liens, per FL Stat 713.78 at 10:00 AM on JULY 17, 2006 at All Prestige Automotive Inc & r--l 150-0706 THCRN PUBUC NOTICE NOTICE IS HEREBY GIVEN by the City Council of the City of Crystal River, Florida that a PUBULIC HEARING will be held to consider, on final reading, the following pro- posed Ordinance #06-0-15, Amending Payment of Fees and Bills Required for Sewer and Water Utility Charges, at 7:00 p.m., on Monday, July 10, 2006 In the Council Chambers at City Hall, 123 NW Highway 19, Crystal River, Florida. The Ordinance, in its entirety, may be Inspected at the office of the City Clerk during reg- ular working hours. AN ORDINANCE AMENDING THE CODE OF ORDINANCES OF THE CITY OF CRYSTAL RIVER, FLORIDA, CHAPTER 16, "WATER AND SEWER SERVICES," SECTION 16-7;' PROVID- ING REVISED PAYING OF FEES AND BILLS REQUIRED FOR THE CITY OF CRYSTAL RIVER WATER AND SEWER UTILITY SERVICES, BOTH INSIDE AND OUTSIDE CITY LIMITS; AND PROVIDING FOR. Published one (1) time In the Citrus County Chronicle, July 6, 2006. 139-0706 THCRN Notice of Sale GMAC Mortgage vs. John E. Sites, et al PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT IN AND FOR CITRUS COUNTY, FLORIDA CIVIL ACTION CASE NO. 2006-CA-1045 DIVISION GMAC MORTGAGE CORPORATION, Plaintiff. vs. JOHN E. SITES, et al, Defendant(s), NOTICE OF RESCHEDULED FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to a Final Judgment of Mortgage Foreclosure dated May 17, 2006 and en- tered In Case NO. 2006-CA-1045 of the Circuit Court of the FIFTH Judicial Circuit In and for CITRUS County, Flori- da wherein GMAC MORTGAGE CORPORATION, Is the Plaintiff and JOHN E, SITES: TENANT #1 N/K/A MICHELE HAYNES are the Defendants, I will sell to the highest and best bidder for cash at JURY ASSEMBLY ROOM IN THE NEW ADDITION TO THE NEW CITRUS COUNTY COURTHOUSE, 110 NORTH APOPKA AVENUE, INVER- NESS, CITRUS COUNTY, FLORIDA at 11:00AM, on the 13th day of July, 2006, the following described property as set forth In said Final Judgment: LOT 12, BLOCK A, OF ECHO HILLS, ACCORDING TO THE PLAT THEREOF, AS RECORDED IN PLAT BOOK 4, PAGE 79, OF THE PUBLIC RECORDS OF CITRUS COUNTY, FLORIDA. A/K/A 1216 NE 7th Avenue, Crystal River, FL 34429 WITNESS MY HAND and the seal of this Court on June 16,2006, Betty Strifler Clerk of the Circuit Court By: /s/ Judy Ramsey Deputy Clerk Published two (2) times In the Citrus County Chronicle, June 29 and July 6, 2006, F06003370 JEEP WRANGLER X 2005 SILVER w/blk soft top, only 10,500 ml, V6 Auto, 4WD, AC, AM/FM/CD, 7 spkrs, CC, Prem Whis, Tow Pkg, side steps, fog Its & more. Well kept in garage. Asking $18K or best offer. Call (352) 422-2038 JIMMY, 1998 PW/PL, orig 59K, auto, cold AC, exc cond, $6,000 (352) 628-3609 or (352) 422-3648 Search 100's of Local Autos Online at wheels.com II I' '86 FORD BRONCO Eddie Bauer, runs great, 'cold AC, R134A, PW/PL, cruise control, clean, 100K, $.500.01Q3 Johnny @ 352-746-7498 Search 100's of Local Autos Online at wheels.com, I I II %I It ,. - CHEVY 1981 P30 Step Van (UPS type) Alum body, comp rbit Drive anywhere, $3,995 (352) 422-3217 CHEVY(Handi-cap) 1993, 69K, hydraulic lift for wheelchair or scooter. $6,500 (352)746-4604 Lv. mess DODGE RAM 1990 Great Deal at $950. (352) 795-2399 Dodge Van 1987, new tires, runs good. $1500. (352) 563-1263 FORD '96 Conversion Van, new tires runs good $1,800. , (352) 601-2396 GMC SAVANNAH 1999 One ton ext, car- go van. Superb cond 190K hwy. ml. $5000 (352) 270-3132 HONDA ODYSSEY EXL, 2002, 57K mi, leather, new tires, show room cond, $15,500 (352) 746-3988 MAZDA MINI-VAN '97, 4dr, dual air, tow pkg, orig owner, exc cond, 33K ml, $4,800 (352) 628-0126 MR CITRUS COUNTY REALTY 1 145-0713 THCRN Notice of Foreclosure Sale Wells Fargo Bank, N.A. vs. Pedro M, Paez PUBLIC NOTICE IN THE CIRCUIT COURT OF THE 5TH JUDICIAL CIRCUIT, IN AND FOR CITRUS COUNTY, FLORIDA GENERAL JURISDICTION DIVISION CASE NO,: 06-CA-1184 WELLS FARGO BANK, N.A. PLAINTIFF VS. PEDRO M. PAEZ IF LIVING, AND IF DEAD, THE UNKNOWN SPOUSE, HEIRS, DEVISEES, GRANTEES, ASSIGNEES, UENORS, CREDITORS, TRUSTEES AND ALL OTHER PARTIES CLAIMING AN INTEREST BY, THROUGH, UNDER OR AGAINST PEDRO M. PAEZ; CARIDAD PAEZ IF LIVING, AND IF DEAD, THE UNKNOWN SPOUSE, HEIRS, DEVISEES, GRANTEES, ASSIGNEES, LIENORS, CREDITORS, TRUSTEES AND ALL OTHER PARTIES CLAIMING AN INTEREST BY, THROUGH, UNDER OR AGAINST CARIDAD PAEZ; PINE RIDGE PROPERTY OWNERS ASSOCIATION, INC.; JOHN DOE AND JANE DOE AS UNKNOWN TENANTS IN POSSES- SION DEFENDANTS) NOTICE OF FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to a Summary Final Judgment of Foreclosure dated May 30, 2006 entered In Civil Case No, 06-CA-1184 of the Circuit Court of the 5TH Judicial Circuit In and for CITRUS County, INVER- NESS, Florida, I will sell to the highest and best bidder for cash at IN THE JURY ASSEMBLY ROOM IN THE NEW ADDI- TION TO THE NEW CITRUS at the CITRUS County Court- house located at 110 N. APOPKA AVE. In INVERNESS, Florida, at 11:00 a.m. on the 20th day of July, 2006 the following described property as set forth In said Sum- mary Final Judgment, to-wit: LOT 6, BLOCK 53, OF PINE RIDGE, UNIT THREE, ACCORD- ING TO THE PLAT THEREOF, AS RECORDED IN PLAT BOOK 8, PAGES 51 THROUGH 67, OF THE PUBLIC RECORDS OF ATV + ATC USED PARTS Buy-Sell-Trade ATV, ATC, Go-carts 12-5pm Dave's USA (352) 628-2084 Suzuki RM 85 03, excel cond, runs perfect, $1,400,00 (352) 302-9801 TGB HORNET ATV 2005, 90hp, hardly used, electric start $995 (352) 503-3491 2001 YAMAHA V-STAR 1100 7368 mi, fully dressed with saddlebags, wind- shield, lo boy shotgun pipes, jet kit, perfect cond, must sell $6,000 (352) 527-4690 BMW R100T 1982, loaded, 43K, runs $3,500 (352) 220-1159 H D 2003 Ann. Edit., Electra Glide Classic w/tour pack, 20K, am/fm/CD, just serviced w/new tires, $14,500 (352) 341-4888 Honda Of Crystal River '07's In StockI '81 CB750 Honda $1299.00 '01 750 Shadow $3599.00 '06 GB900 New $7825.00 05 GL 1800 Goldwing We Buy Used Bikesl 352-795-4832 Honda Rebel 1985, 250cc, saddle bags, pipes, great shape. $100,OBO (352) 563-2918 KAWASKI '97, ZG1200, Voyager, red, 2 helmets, Touring bike 22,882ml. $5,000. (352) 726-4992 Search 100's of Local Autos Online at wheels.com SUZUKI INTRUDER '02, 1400 Blk & SIvr Intruder VS. 2000 miles, Garage kept, windshield & saddlebags Sumter County $5,900 (813)679-6344 SUZUKI SV 650 2002, less than 5K ml, garage-kept, as new, $4,000 (352) 563-5766 SUZUKI VL INTRUDER 2002, 825 cc, like new. mileage 1700. Lots of extras. $4,650 (352) 726-8790 WHEEL , S OF A DEAL FOR ONLY $6.00 Pick your classified transportation ad up Into our MEW Tuesday Wheels 3 Section. (352) 563-5966 ^-----1 Tropical Window Tinting, 1612 Suncoast Blvd. Homosassa, FL 34448, phone 352-795-3456 No Titles, as is, cash only. ..CHEVY 1997 VIN # 1GIJC1245V7165583 Published one (1) time In the Citrus County Chroni- cle, July 6. 2006. poratIon. Plaintiff and CYNTHIA V. IOERGER. Defendant, I will set to the highest bidder for cash on the 20th day of July, 2006, at 11:00 a.m., the following described property as set forth In said Default Final Judgment ly- ing and being situate In Citrus County, Florida, to wit: The Southwest 1/4 of the Southeast 1/4 lying Westerly of the right of way of U.S. Highway 41 In Section 3, Town- ship 20 South, Range 20 East, Citrus County, Florida, less and except both the North 600 feet and the South 10 feel thereof; and the Southeast 1/4 of the Southwest 1/4 of Section 3, Township 20 South, Range 20 East, Citrus County, Florida, less and except both the North 600 feet and the South 10 feet thereof:. DATED this 30th day of June. 2006, BETTY STRIFLER CLERK OF THE CIRCUIT COURT 151-0706 THCRN PUBLIC NOTICE Miscellaneous No. 1402173 UNDER THE REGISTRATION OF TITLES LAW OFFICE OF TITLES P.O. BOX 494 KINGSTON April 11, 2006 WHEREAS I have been satisfied by Statutory Declara- tion that the duplicate Certificate of Title for ALL THAT parcel of land part of MOUNT PLEASANT In the parish of SAINT ELIZABETH containing by estimation Two and a half acres more or less and butting Northerly on the Brumar Parochial Road Southerly on land belonging to. Guy Kanvanan Easterly on land belonging to Cabert Simpson and Westerly on the Brumar Parochial Road and being the land registered at Volume 1298 Folio 772 In the names of GEORGE HENRY and CAROLL E HENRY HAS BEEN LOST: - I HEREBY GIVE NOTICE that I Intend at or after the expi- ration of fourteen days after the last appearance of this advertisement to cancel the said Certificate of Title and to register a new Certificate In duplicate In place thereof. /s/ J. Walker Acting Senior Deputy Registrar of Titles Published one (1) time in the Citrus County Chronicle, July 6, 2006. 140-0706 THCRN Notice of Foreclosure Sale Vanderbilt Mortgage and Finance vs. Anthony Whitaker, et al PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT IN AND FOR CITRUS COUNTY, FLORIDA CIVIL ACTION CASE NO.; 2006-CA-000898 DIVISION: VANDERBILT MORTGAGE AND FINANCE, INC., Plaintiff, vs. ANTHONY WHITAKER, et al, Defendant(s). NOTICE OF FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to a Final Judgment of Mortgage Foreclosure dated June 07, 2006 and en- tered In Case NO. 2006-CA-000898 of the Circuit Court of the FIFTH Judicial Circuit In and for CITRUS County, Florida wherein VANDERBILT MORTGAGE AND FINANCE, INC., Is the Plaintiff and ANTHONY WHITAKER; JOYCE K. JAEGER; ANY AND ALL UNKNOWN PARTIES CLAIMING BY, THROUGH, UNDER, AND AGAINST THE HEREIN NAMED INDIVIDUAL DEFENDANTS) WHO ARE NOT KNOWN TO BE DEAD OR ALIVE, WHETHER SAID UN- KNOWN PARTIES MAY CLAIM AN INTEREST AS SPOUSES, HEIRS. DEVISEES. OR OTHER CLAIMANTS; STATE OF FLOR- IDA DEPARTMENT OF REVENUE: TENANT #1 N/K/A EV- ERETT W, DUNTON are the Defendants, I will sell to the highest and best bidder for cash at JURY ASSEMBLY ROOM IN THE NEW ADDITION TO THE NEW CITRUS COUNTY COURTHOUSE, 110 NORTH APOPKA AVENUE, INVERNESS, CITRUS COUNTY, FLORIDA at 11:00AM, on the 13th day of July, 2006, the following described property as set forth In said Final Judgment: LOT 94, OF GREEN ACRES, UNIT NO. 8, AS PER THE PLAT THEREOF AS RECORDED IN PLAT BOOK 11. A/K/A 2642 South Woodbine Avenue, Homosassa Springs, FL 34448 WITNESS MY HAND and the seal of this Court on June 21st. 2006 Betty Strifler Clerk of the Circuit Court By: /s/ K. Rubel Deputy Clerk Published two (2) times In the Citrus County Chronicle, June 29 and July 6, 2006. F06002785 144-0713 THCRN Notice of Foreclosure Sale Deutsche, JR,JR IF LIVING, AND IF DEAD, THE UN- KNOWN SPOUSE, HEIRS, DEVISEES, GRANTEES, ASSIGN- EES, LIENORS, CREDITORS, TRUSTEES AND ALL OTHER PAR- TIES CLAIMING AN INTEREST BY, THROUGH, UNDER OR AGAINST ROBERT R. BEATIY, JR.; LINDA BEATTY A/K/A UNDA L. CASTRO; JOHN DOE AND JANE DOE AS UN- KNOWN TENANTS IN POSSESSION DEFENDANTS) NOTICE OF FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to a Summary Final Judgment of Foreclosure dated June 22, 2006 entered In Civil Case No, 2004-CA-4365 of the Circuit Court of the 5TH Judicial Circuit In and for CITRUS County, Inver- ness, Florida, I will sell to the highest and best bidder for cash at IN THE JURY ASSEMBLY ROOM IN THE NEW ADDI- TION TO THE NEW CITRUS COUNTY COURTHOUSE at the CITRUS County Courthouse located at 110 N. Apopka Avenue In Inverness. Florida, at 11:00 a.m. on the 20th day of July, 2006 the following described property as set forth in said Summary Final Judgment, to-wit: COR- NER DIS- TANCE OF 278.46 FEET, THENCE S 46" 13' 20" E A DIS- TANCEA14612077A AND FLA14612077B. Dated this 23rd day of June, 2006. /s/ BETTY STRIFLER Clerk of the Clrcuit, vla Florida Relay Service, Published two (2) times In the Citrus County Chronicle. July 6 and 13,2006,. CITRUS COUNTY, FLORIDA. Dated this 31 6 and 13, 2006. 146-0713 THCRN Notice of Sale Novastar Mortgage vs. Eric Link #1 and #2, et. al, Defendantss. NOTICE OF FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to a Final Summary Judgment of Foreclosure dated May 17, 2006. entered In Civil Case No.: 2006-CA-1438 of the Circuit Court of the Fifth Judicial Circuit in and for Citrus County, Flori- da, wherein NOVASTAR MORTGAGE, INC., a Virginia Corporation, Plaintiff, and ERIC LINK, UNKNOWN SPOUSE OF ERIC LINK, UNKNOWN TENANTS) IN POSSES- SION #1 and #2, et. al., are Defendants. I will sell to the highest bidder for cash In the Jury as- sembly room In the new addition to the new Citrus County Courthouse, 110 North Apopka Avenue, Inver- ness, FL 34450, at 11:00 a.m., on the 20th day of July, 2006, the following described real property as set forth In said Final Summary Judgment, to wit: LOT 6, BLOCK 199, OF CITRUS SPRINGS UNIT THREE, A SUBDIVISION, ACCORDING TO THE PLAT THEREOF, AS RE- CORDED IN PLAT BOOK 5, AT PAGES 116-129, OF THE PUBLIC RECORDS OF CITRUS COUNTY, FLORIDA. WITNESS my hand and the seal of the court on May 22, 2006. BETTY STRIFLER CLERK OF THE COURT (COURT SEAL) By: /s/ Judy Ramsey Deputy Clerk Published two (2) times In the Citrus County Chronicle, July 6 and 13, 2006. 147-0713 THCRN Notice of Sale Green Tree Servicing LLC vs. Edward M. Stone, et al PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT OF THE STATE OF FLORIDA, IN AND FOR CITRUS COUNTY CIVIL DIVISION CASE NO. 2006-CA-1216 GREEN TREE SERVICING LLC, AS SUCCESSOR SERVICE FOR GREENPOINT CREDIT, LLC, Plaintiff, vs, EDWARD M. STONE; THE UNKNOWN SPOUSE OF EDWARD M. STONE; IF LIVING, INCLUDING ANY UNKNOWN SPOUSE OF SAID DEFENDANTSS, IF REMARRIED, AND IF DECEASED, THE RESPECTIVE UNKNOWN HEIRS, DEVISEES, GRANTEES, ASSIGNEES, CREDITORS, LENORS, AND TRUSTEES, AND ALL OTHER PERSONS CLAIMING BY, THROUGH, UNDER OR AGAINST THE NAMED DEFENDANTSS); BANK OF AMERICA, N.A. (USA); MINI-FARMS PROPERTY OWNERS' ASSOCIATION, INC.; PREMIUM ASSET RECOVERY CORPORATION; WHETHER DISSOLVED OR PRESENTLY EXISTING, TOGETHER WITH ANY GRANTEES, ASSIGNEES, CREDITORS, LIENORS, OR TRUSTEES OF SAID DEFENDANTS) AND ALL OTHER PERSONS CLAIMING BY, THROUGH, UNDER, OR AGAINST DEFENDANTSS); UNKNOWN TENANT #1; UNKNOWN TENANT #2; Defendants) -,- ,- ,-: PARCEL NO. 49, MINI-FARMS UNIT NO. 9, LEGALLY DE- SCRIBED AS FOLLOWS: BEGIN AT THE SOUTHWEST CORNER OF THE WEST 1/2 OF THE SOUTHWEST 1/4 OF THE NORTHWEST 1/4 OF THE NORTHEAST 1/4 OF SECTION 31, TOWNSHIP 17 SOUTH RANGE 18 EAST, CITRUS COUNTY, FLORIDA, THENCE N 89 DEG. 13' 02" E ALONG THE SOUTH LINE OF SAID WEST 1/2 OF THE SOUTHWEST 1/4 OF THE NORTHWEST 1/4 OF THE NORTHEAST 1/4 A DISTANCE OF 345.30 FEET TO THE SOUTHEAST CORNER OF SAID WEST 1/2 OF THE SOUTH- WEST 1/4 OF THE NORTHWEST 1/4 OF THE NORTHEAST 1/4, THENCE N 0 DEG. 22' 05" W ALONG THE EAST LINE OF SAID WEST 1/2 OF THE SOUTHWEST 1/4 OF THE NORTH- WEST 1/4 OF THE NORTHEAST 1/4 AND A NORTHERLY PROJECTION THEREOF, A DISTANCE OF 675.41 FEET TO A POINT THAT IS 25 FEET FROM, MEASURED AT A RIGHT AN- GLE TO, THE SOUTH RIGHT-OF-WAY LINE OF THE FLORIDA POWER CORPORATION POWER EASEMENT, THENCE S 89 DEG. 53' 31" W, PARALLEL TO SAID RIGHT-OF-WAY LINE DISTANCE OF 346.85 FEET TO A POINT ON THE WEST LINE OF THE NORTHEAST 1/4 OF THE SAID SECTION 31, THENCE S 0 DEG. 30' 07" E ALONG SAID WEST LINE A DISTANCE OF 679.51 FEET TO THE POINT OF BEGINNING. SUBJECT TO AN EASEMENT ACROSS THE NORTH 25 FEET THEREOF FOR ROAD RIGHT-OF-WAY. To include a: 1996 MERI VIN FLHMBC68639692A 71192652 1996 MERI VIN FLHMBC68639692B 71192653 1996 MERI VIN FLHMBC68639692C 71192654 A/K/A 5480 W. Amman St. Dunnellon, FL 34432 at public sale. Citrus County Courthouse. The Jury As- sembly Room at 11:00 AM, on July 20, 2006. DATED THIS 22ND DAY OF MAY.uly 6 and 13, 2006. 148-0713 THCRN Notice of Foreclosure Sale Malnstreet Funding Corp. vs. Cynthia V. loerger PUBLIC NOTICE S IN THE CIRCUIT COURT OF THE 5TH JUDICIAL CIRCUIT IN AND FOR CITRUS COUNTY, FLORIDA CASE NO, 05-CA-2969 MAINSTREET FUNDING CORP., a Florida corporation, Plaintiff. vs. CYNTHIA V. IOERGER, et al Defendant,- By: /s/ Sonla Prylepa Deputy Clerk Published two (2) times In the Citrus County Chronicle, July 6 and 13, 2006. 149-0706 THCRN PUBLIC NOTICE THE CITRUS COUNTY CODE REVIEW AND APPEALS BOARD WILL CONDUCT A MEETING ON JULY 12, 2006 AT 2:00 P.M., AT THE LECANTO GOVERNMENT BUILDING, 3600 W. SOVEREIGN PATH, RM 280 LECANTO, FLORIDA 34461 SCHEDULED FOR DISCUSSION: 1. SLAB ELEVATION REQUIREMENTS 2. SITE DRAINAGE 3. FILL LIMITATIONS IN FLOODPLAIN 4. TEMPORARY POWER FOR WELLS 5. POCKET DOORS/REQUIRED OUTLETS AT LEAST TWO DAYS BEFORE THE MEETING. IF YOU ARE HEARING OR SPEECH IMPAIR- ED, USE THE TDD TELEPHONE (352-341-6580) OR LECANTO GOVERNMENT BUILDING (352-527-5312). Published one (1) time In the Citrus County Chronicle, July 6, 2006. 142-0720 THCRN Notice of Action Edna MIkel, et al. vs. Estrella S. Cortes, et al. PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT, IN AND FOR CITRUS COUNTY FLORIDA CIVIL ACTION NO: 2006-CA-2667 EDNA MIKEL JAMES A. MIKEL, PLAINTIFFS vs. ESTRELLA S. CORTES, PEDRO CORTES, WOLFGANG HUELDER MARY ANN KELLEY VANDERBILT, ET AL MARGARET M. GRAF MARY ANN KELLEY MATTHEW J. KELLEY MARK L KELLEY JOHN C. KELLEY THOMAS. MULLNIX OMNI VENTURES, INC, DEFENDANTS. NOTICE OF ACTION TO DEFENDANTS: ESTRELLA S. CORTES, PEDRO CORTES, WOLFGANG HUELDER, MARY ANN KELLEY VANDERBILT, ET AL, MARGARET M. GRAF, MARY ANN KELLEY, MAT- THEW J. KELLEY, MARK L KELLEY, JOHN C. KELLEY, THOM- AS. MULUNIX AND OMNI VENTURES, INC, INCLUDING ANY UNKNOWN SPOUSE OF SAID DEFENDANTSS, IF REMARRIED AND IF DECEASED, THE RESPECTIVE UNKNOWN HEIRS, DEVISEES, GRANTEES, ASSIGNEES, CREDITORS, LEINORS, AND TRUSTEES, AND ALL OTHER PERSONS CLAIMING BY, THROUGH, UNDER OR AGAINST THE NAMED DEFENDANTS. TO: ESTRELLA S. CORTES TO: PEDRO CORTES and all others claiming by, through or under them and to all others whom It may concern': YOU ARE NOTIFIED of an action to quiet and confirm ti- tle on the following property In Citrus County Florida: CITRUS SPRINGS UNIT 22 LOT 17 BLK 1552 DESCR IN OR BK 557 PG 1589, public records of Citrus County Florida. TO: WOLFGANG HUELDER r.a ar oTh -er. claiming by, rr.rough o1 .jrae tr.m. and to all others whom It may concern: YOU ARE NOTIFIED of an action to quiet and confirm ti- tle on the following property In Citrus County Florida: CITRUS SPRINGS UNIT 23 LOT 37 BLK 761 DESCR IN OR BK 585 PG 113, public records of Citrus County Florida, TO: MARY ANN KELLEY VANDERBILT, ET AL TO: MARGARET M. GRAF TO: MARY ANN KELLEY . TO: MATTHEW J. KELLEY TO: MARK L. KELLEY TO: JOHN C. KELLEY and all others claiming by. through or under them and to all others whom It may concern: YOU ARE NOTIFIED of an action to quiet and confirm ti- tie on the following property In Citrus County Florida: CITRUS SPRINGS UNIT 8 PB 6 PG 43 LOT 20 BLK 752 DESC IN OR BK 652 PG 724, public record of Citrus County, Florida. TO: THOMAS F. MORGAN TO: SHARON E. MORGAN and all others claiming by, through or under them and to all others whom It may concern: YOU ARE NOTIFIED of an action to quiet and confirm ti- tie on the following property In Citrus County Florida: KENSINGTON ESTS UNIT 2 PB 11 PG 66 LOT 15 BLK J, pub- 11c records of Citrus County, Florida. TO: FRANK P. BARRY TO: CHARLOTTE S. BARRY and all others claiming by, through or under them and to all others whom It may concern: YOU ARE NOTIFIED of an action to quiet and confirm ti- tie on the following property in Citrus County Florida: CITRUS SPRINGS UNIT 3 LOT 14 BLK 218 DESC IN OR BKI A25 PG 391, public record of Citrus County, Florida. TO: HAYDEE CARRASQUILLO and all others claiming by, through or under them and to all others whom It may concern: YOU ARE NOTIFIED of an action to quiet and confirm ti- tie on the following property In Citrus County Florida: CITRUS SPRINGS UNIT 3 PLAT BK 5 PG 116 LOT 5 BLK 310 DESC IN OR BK 534 PG 1340, publIc record of Citus County, Florida. TO: HANS-JORG DICK and all others claiming by. through or under them and to all others whom It may concern: YOU ARE NOTIFIED of an action to quiet and confirm fi- tle on the following property In Citrus County Florida: CITRUS SPRINGS UNIT 8 LOT 28 BLK 760 DESC IN OR BK 553 PG 1740, public record of Citrus County, Florida. TO: LASZLO FERENC SANTIK and all others claiming by. through or under them and to all others whom It may concern: YOU ARE NOTIFIED of an action to quiet and confirm ti- tie on the following property In Citrus County Florida: CITRUS SPRINGS UNIT 1 LOT 42 BLK 40 DESC IN OR BK 389 PG 118, public record of Citrus County, Florida. YOU ARE NOTIFIED of an action to quiet and confirm ti- tie on the following property In Citrus County Florida: CITRUS SPRINGS UNIT I LOT 43 BLK 40 DESC IN OR BK 389 PG 119, public record of Citrus County, Florida. TO: ANTAL SANTIK and all others claiming by, through or under them and to all others whom It may concern: YOU ARE NOTIFIED of an action to quiet and confirm ti- tle on the following property In Citrus County Florida: CITRUS SPRINGS UNIT I LOT 44 BLK 40 DESC IN OR BK A49 PG 556, public record of Citrus County, Rorda. TO: ALINE L, REED TO: DIANA R. MULLNIX TO: OMNI VENTURES, INC and all others claiming by, through or under them and to all others whom it may concern: YOU ARE NOTIFIED of an action to quiet and confirm ti- tle on the following property In Citrus County Florida: CITRUS SPRINGS UNIT 9 LOT 13 BLK 654 DESC IN OR BK 619 PG 505, public record of Cit July 31, 2006, and the original with the Clerk of this Court either before service on the Plaintiff or Immediately thereaf- ter, otherwise a default will be entered against you for the relief demanded in the complaint or motion. Witness my hand and seal of this Court on this 23rd day of June. 2006. BETTY STRIFLER CLERK OF.THE CIRCUIT COURT (CIRCUIT COURT SEAL) By: /s/ M. A. Michel Deputy Clerk Published four (4) times In the Citrus County Chronicle, June 29, July 6,13 and 20,2006. jui.y 6, CITrrUS COUNTY (FL) CiHRONICLE .6 - - ,s an e THURSDAY, JULY 6I, 20 --- Coach Kerwin Bell "NO PAYMENTS UNTIL V vVEIMBIER 4TH!" 2006 SONATA 2006 TAURUS 1 3,45 0 11,625 $237 PER MONTH* $205 PER MONTH* 2006 ALTIMA 2006 CAMRY 2005 DAKOTA ..,,,,,,,=ate ..iB~t i^^ t.a ^^e i o .- _.... LJ; 11 5,650 81 6,125 *12,675 $276 PER MONTH* $284 PER MONTH* $223 PER MONTH* 2005 EXPLORER 2004 RAM 816,450 $289 PER MONTH* 2004 CARAVAN -ino 13,875 244 PER MONTH* V. ..... 0 MIL1 FIND OUT EXACTLY WHAT YOUR CAR. IS WORTH, NO MATTER WHERE YOU PLAN TO BUY! CALL THE INSTANT APPRAISAL LINE 800- 42-3008 2003 CAMRY 2003 MUSTANG ^'-y- -^-t ^ ~- *Vow*y^ 2002 CIVIC $13,875 .244 PER MONTH* 2004 TAHOE $18,475 1327 PER MONTH* 2002 ACCORD 2002 CADILLAC $12,575 221 PER MONTH* 2001 FRONTIER ,jj.^^m^ ^ --lf~ki 11,050 $195 PER MONTH* 2001 MAXIMA $9,225 $162 PER MONTH* 2000 ALTIMA 5 $156 PER MONTH* 2000 F150 15,550 $274 PER MONTH* 1999 RANGER 17,675 '10,950. 16,825 57,875 15,875 OCALA OpE XCALA _NISSAN 1 REE A2200 SR 200 *(352)622-4111 (800)342-3008 ALL INVENTORY PRE-TITLED AND SUBJECT TO AVAILABILITY. ALL PRICES PLUS TAX, TAG AND 195 DEALER FEE. PRICES SHOWN WITH $1,000 CASH OR TRADE EQUITY, PICTURES FOR ILLUSTRATION PURPOSES ONLY. *PAYMENTS FOR 6 YRS @ 8% APRP, W.A.C, L4 877404 dm *fr. Contact Us | Permissions | Preferences | Technical Aspects | Statistics | Internal | Privacy Policy © 2004 - 2010 University of Florida George A. Smathers Libraries.All rights reserved. Acceptable Use, Copyright, and Disclaimer Statement Last updated October 10, 2010 - - mvs
http://ufdc.ufl.edu/UF00028315/00552
CC-MAIN-2017-30
refinedweb
68,898
78.65
I want to enforce constraints the parameter values for Scala methods at compile-time. For example: case class Foo(numberOfFoo: Int, ...) numberOfFoo Int val n: Int = ... val f: Foo = Foo(n) n > 0 n <= 0 Option[Foo] Foo Foo.numberOfFoo != n case class Foo(bar: Bar) {val n = bar size} Another way of doing this is by using the shapeless library, and using Nat. The limitation is that you will need to instantiate those Foo entities at compile time basically, with known constants. import shapeless.ops.nat_ import shapeless.nat._ case class Foo[T <: Nat](numberOfFoo: Int)(implicit ev: GT[T, _0] object Foo { // The problem is this won't work. def apply[T <: Nat](n: Int): Foo[T] = Foo(Nat(n)) } This will work only if used like this: Foo(_1) Where _1 comes from shapeless.nat._. If you drill down into the implementation, the 0 part happens to be enforced even without you meaning to by shapeless: if (n < 0) c.abort(c.enclosingPosition, s"A Nat cannot represent $n") Stick to simpler things This is however quite cumbersome, because whichever approach you take, it will rely on a macro, and macros cannot really work unless the value is known at compile time. This can become very limiting, if the simplest delegation method no longer works. In practice, it may be more efficient to go around this kind of approach and use the normal ways. Whether you use shapeless or the refined library mentioned above, the story doesn't change, so for a normal use case it's probably cleaner to do runtime validation.
https://codedump.io/share/9TLIUcfOTiUk/1/how-can-i-enforce-compile-time-constraints-on-values-for-scala-methods
CC-MAIN-2017-13
refinedweb
268
62.58
This is my user page. I'm going to use it to build docs I need that may then be worth moving elsewhere. To begin with... Dates and Times Python has two modules that relate to dates and times (that I know of so far): - datetime - time These are reasonably well documented in the online material, but I have not so far found a page or site that pulls all the information about these modules together in one place so one can understand how they relate to each other. This section is an attempt at that. First, an overview of the modules. datetime The datetime module defines five classes: - date - a date (year, month, day) - time - a time within a day (hour, minute, second) - datetime - combines a datetime.date and datetime.time - timedelta - different between two datetime objects - tzinfo - "abstract base class for time zone info objects" [1] time The time module defines one class: - time - access to system time with some formatting support I found myself confused by a couple of aspects of these modules: - datetime.time and time.time are completely different despite sharing a name. - 'datetime' is the name of both a module and a class. From time.time, we can get the system time. We can then pass that information into an object of one of the datetime classes for more sophisticated formatting and date/time arithmetic. Some examples: What time is it? >>> import time >>> now = time.time() >>> now 1194011556.6974411 >>> int(now) 1194011556 >>> import datetime >>> today = datetime.datetime.now() >>> today datetime.datetime(2007, 11, 2, 10, 33, 35, 713125) >>> print today 2007-11-02 10:33:35.713125 How about in human-friendly format? >>> import time >>> time.asctime() 'Fri Nov 2 09:55:28 2007' I don't like that format. How can I roll my own? >>> import time >>> time.strftime("%Y/%m/%d %H:%M:%S") '2007/11/02 09:58:30' The various format specifiers are described in the documentation for the time module at. What was the date 24 hours ago? >>> import time >>> now = time.time() >>> now = now - 24 * 60 * 60 >>> time.strftime("%Y/%m/%d %H:%M:%S", time.localtime(now)) '2007/11/01 10:00:32' I have a string representing a date/time. How do I turn it into something I can do computations on? >>> import time >>>>> time.strptime(then_str, "%d %B %Y %H:%M") (2000, 3, 7, 4, 38, 0, 1, 67, -1) >>> (y, m, d, h, min, sec, wd, julian, dst) = time.strptime(then_str, "%d %B %Y %H:%M") >>> x = [] >>> x = time.strptime(then_str, "%d %B %Y %H:%M") >>> x (2000, 3, 7, 4, 38, 0, 1, 67, -1) ... How do I turn the tuple into a timestamp (number of seconds since the epoch)? ... >>> time.mktime(x) 952421880.0 How do I turn a timestamp into a datetime object? >>> import time >>> import datetime >>> d = datetime.datetime.fromtimestamp(time.time()) >>> d datetime.datetime(2007, 11, 2, 10, 25, 35, 947082) How long between date/time A and date/time B? >>> import time >>> import datetime >>> atup = (2000, 3, 7, 0, 0, 0, 0, 0, 0) >>> btup = (2000, 12, 15, 0, 0, 0, 0, 0, 0) >>> diff = time.mktime(btup) - time.mktime(atup) >>> diff 24451200.0 >>> # or, using datetime.... >>> a = datetime.datetime.fromtimestamp(time.mktime(atup)) >>> b = datetime.datetime.fromtimestamp(time.mktime(btup)) >>> c = b - a >>> c datetime.timedelta(283) >>> print c 283 days, 0:00:00 What was the date or timestamp of last Friday? >>> import time >>> now = time.time() >>> tup = time.localtime() >>> then = now - 24*60*60((7 + tup[6] - 4 - 1)%7 + 1) >>> # or, using datetime >>> import datetime >>> today = datetime.datetime.now() >>> today datetime.datetime(2007, 11, 2, 11, 27, 50, 37655) >>> diff = datetime.timedelta((7 + today.weekday() - 4 - 1)%7 + 1, 0, 0) >>> last_friday = today - diff >>> last_friday datetime.datetime(2007, 10, 26, 11, 27, 50, 37655) In general, to compute the date of last Z, - today - (7 + weekday - Z - 1) % 7 + 1 To compute the date of next Z, - today + (7 + Z - weekday - 1) % 7 + 1 This assumes that Monday = 0, Tuesday = 1, ..., Sunday = 6, as is the case in python. Note that the computation must be carried out in units of days. Can I give the datetime module a less cumbersome alias? >>> import datetime as dt References [1] $ pydoc datetime.tzinfo Printing to stderr print >> sys.stderr, 'entering function' glob.glob vs os.listdir glob.glob doesn't get . files, os.listdir does Run a command and grab its output (or you can write to it) f = os.popen(command, 'r') output = f.readlines() g = os.popen(command, 'w') g.write('foobar') output and input (fout, fin) = popen2.popen2(command) with stderr (fout_plus_err, fin) = popen2.popen4(command) get the current machine's hostname import socket host = socket.gethostname() print host
https://wiki.python.org/moin/TomBarron
CC-MAIN-2017-47
refinedweb
795
70.19
IRC log of ws-desc on 2007-03-15 Timestamps are in UTC. 14:57:27 [RRSAgent] RRSAgent has joined #ws-desc 14:57:27 [RRSAgent] logging to 14:57:49 [Allen] Allen has joined #ws-desc 14:58:25 [TonyR] TonyR has joined #ws-desc 14:59:28 [JacekK] JacekK has joined #ws-desc 15:00:01 [TonyR] zakim, who is on the phone? 15:00:01 [Zakim] sorry, TonyR, I don't know what conference this is 15:00:03 [Zakim] On IRC I see JacekK, TonyR, Allen, RRSAgent, Zakim, Jonathan, charlton, plh 15:00:14 [TonyR] zakim, this is wsdwg 15:00:14 [Zakim] ok, TonyR; that matches WS_DescWG()11:00AM 15:00:25 [TonyR] zakim, who is on the phone? 15:00:25 [Zakim] On the phone I see ??P35 15:00:32 [TonyR] zakim, ?? is me 15:00:32 [Zakim] +TonyR; got it 15:01:21 [Zakim] +Jonathan_Marsh 15:01:23 [Zakim] -Jonathan_Marsh 15:01:24 [Zakim] +Jonathan_Marsh 15:01:49 [Zakim] +JacekK 15:02:05 [Zakim] +??P1 15:02:09 [Allen] zakim, ??P1 is Allen 15:02:11 [Zakim] +Roberto 15:02:15 [Zakim] +Allen; got it 15:03:02 [Zakim] +Tom_Jordahl 15:03:04 [Zakim] +Plh 15:03:22 [TomJ] TomJ has joined #ws-desc 15:07:55 [Allen] SCRIBE: Allen 15:08:09 [Allen] Topic: Approval of 3/1 minutes 15:08:42 [Zakim] +??P8 15:08:45 [Allen] Minutes approved. 15:09:34 [JacekK] zakim, who's making noise? 15:09:44 [Zakim] JacekK, listening for 10 seconds I heard sound from the following: Jonathan_Marsh (65%) 15:10:10 [Allen] Topic: Administrivia 15:10:25 [Allen] JM: Implementors call is no more. 15:11:49 [Ram] Ram has joined #ws-desc 15:11:57 [Allen] Topic: Implementation status and plan 15:12:12 [Zakim] -Roberto 15:12:26 [Allen] Topic: Publicaton status 15:13:22 [Zakim] +Roberto 15:13:50 [Zakim] +Canon 15:14:10 [Allen] Phillipe: Can only make editorial changes without negotiation. 15:14:33 [jjm] jjm has joined #ws-desc 15:14:33 [Allen] JM: JJ changes before or after PR? 15:14:33 [plh] s/Phillipe/Philippe? 15:17:39 [Zakim] +??P14 15:18:23 [Allen] JJ: Most proposed changes are typos that would be of interest to the reader. Some may be issues that can be changed later. 15:18:46 [Roberto] Roberto has joined #ws-desc 15:19:22 [Zakim] -Roberto 15:19:48 [Allen] JM: Now test suite and document don't match so we need to regenerate the document. 15:19:55 [Zakim] + +1.415.268.aaaa 15:20:01 [Allen] Philippe: I"m ok with that but don't break anything. 15:20:45 [Allen] JM: Some of the changes are a bit too big, like moving a section, but most changes should be incorporated. 15:23:31 [Allen] JJ: Could use help on fixing spaces between element. 15:24:06 [Allen] JM: I will take a look at this. 15:24:16 [charlton] charlton has joined #ws-desc 15:25:07 [Allen] JM: Back to Administrivia, we now have a bugzilla bug list set up. 15:25:51 [Zakim] +Gilbert_Pilz 15:25:56 [Allen] JM: More substantial issues should be put into bugzilla. 15:27:00 [gpilz] gpilz has joined #ws-desc 15:28:11 [Jonathan] ACTION: JJM to incorporate minor editorial fixes. 15:28:17 [Jonathan] ACTION: Jonathan to solve the space issue 15:28:24 [Jonathan] ACTION: JJM to file or publish larger bugs 15:29:31 [Jonathan] ACTION: Philippe to look at namespace. 15:31:47 [youenn] youenn has joined #ws-desc 15:31:58 [Allen] JM: Another editorial change, remove reference to hash character, which is not allowed. 15:32:20 [Jonathan] ACTION: Jonathan to remove "or a #" 15:36:04 [Allen] JM: Another editorial, incorrect treatment of "?" and "/" in URIs. 15:36:32 [Allen] Youenn: Do you think readability of URIs is important? 15:39:01 [Allen] Youenn: I'm in favor of leaving the spec the way it is, but it is not that important. 15:41:22 [Allen] JM: I don't see a great value in encoding "?" in query parameters. 15:41:44 [Allen] Youenn: URIs with "?" encoded and not encoded are not equivalent. 15:44:47 [Allen] JM: No changes to spec, change expected values in test suite. 15:47:42 [Zakim] -JacekK 15:48:03 [JacekK] trying 15:48:18 [JacekK] will take a moment 15:49:57 [Zakim] +JacekK 15:53:56 [Allen] JM RDF mapping ready to go, part 1 and part 2 will be generated with fixes noted above. 15:54:33 [Allen] JJM: Need to remove ed notes about features at risk. 15:55:23 [Allen] JJM: In 6.1 first paragraph, second sentence is unclear. 15:57:01 [Allen] JJM: In 4.2 "ascribed", is this correct? 16:03:26 [jjm] /me Error: Reference to undefined entity 'prefix'. 16:05:01 [Allen] Topic: MTOM Description 16:05:11 [Allen] JJM: This can be retired. 16:05:56 [Allen] JM: Do we need a telcon next week? 16:06:17 [Allen] PLH: If the directors call goes back we may, but not otherwise. 16:06:37 [plh] s/back/bad/ 16:08:35 [Allen] JM: Next call will be when there is enough stuff for an agenda, reserve 3/29, 4/19. 16:09:53 [Zakim] -Tom_Jordahl 16:09:54 [Zakim] -??P8 16:09:55 [Zakim] -Plh 16:09:55 [TomJ] TomJ has left #ws-desc 16:09:55 [Allen] Meeting adjourned. 16:09:56 [Zakim] -Roberto 16:09:57 [Zakim] -Jonathan_Marsh 16:09:58 [Zakim] -TonyR 16:10:00 [Zakim] -??P14 16:10:02 [Zakim] -JacekK 16:10:03 [Zakim] -Canon 16:10:05 [Zakim] -Gilbert_Pilz 16:10:07 [Zakim] -Allen 16:10:07 [TonyR] TonyR has left #ws-desc 16:10:08 [Zakim] WS_DescWG()11:00AM has ended 16:10:10 [Zakim] Attendees were TonyR, Jonathan_Marsh, JacekK, Roberto, Allen, Tom_Jordahl, Plh, Canon, +1.415.268.aaaa, Gilbert_Pilz 16:16:49 [Jonathan] rrsagent, set log public 16:16:54 [Jonathan] rrsagent, draft minutes 16:16:54 [RRSAgent] I have made the request to generate Jonathan 16:17:17 [Jonathan] rrsagent, set log world 16:17:20 [Jonathan] rrsagent, draft minutes 16:17:20 [RRSAgent] I have made the request to generate Jonathan 16:17:37 [Jonathan] Meeting: WS Description WG telcon 16:17:43 [Jonathan] Chair: Jonathan 16:17:55 [Jonathan] rrsagent, draft minutes 16:17:55 [RRSAgent] I have made the request to generate Jonathan 17:16:51 [charlton] charlton has joined #ws-desc 17:21:20 [charltonb] charltonb has joined #ws-desc 17:25:04 [Zakim] Zakim has left #ws-desc 17:51:05 [Jonathan] rrsagent, bye 17:51:05 [RRSAgent] I see 5 open action items saved in : 17:51:05 [RRSAgent] ACTION: JJM to incorporate minor editorial fixes. [1] 17:51:05 [RRSAgent] recorded in 17:51:05 [RRSAgent] ACTION: Jonathan to solve the space issue [2] 17:51:05 [RRSAgent] recorded in 17:51:05 [RRSAgent] ACTION: JJM to file or publish larger bugs [3] 17:51:05 [RRSAgent] recorded in 17:51:05 [RRSAgent] ACTION: Philippe to look at namespace. [4] 17:51:05 [RRSAgent] recorded in 17:51:05 [RRSAgent] ACTION: Jonathan to remove "or a #" [5] 17:51:05 [RRSAgent] recorded in
http://www.w3.org/2007/03/15-ws-desc-irc
CC-MAIN-2016-40
refinedweb
1,224
71.04
Chris> Skip Montanaro wrote: >> map() is a single function that doesn't return control to the >> interpreter until it's work is done. List comprehensions are >> essentially just syntactic sugar for the equivalent for loop. Chris> This is exactly my question: why is it implimented this way? Chris> Because it was easy: A fine answer Chris> or Chris> Because it is important for hte design that it work exactly that Chris> the same way: which I don't understand at all. It wasn't important for the design to work exactly like for loops, but given Python's semantics it is hard to see how to have done it some other way. Also, it was certainly the easiest route. >> In theory, an optimizer could identify and replace some list >> comprehensions with calls to map, Chris> This is what I have in mind. >> but they wouldn't be quite equivalent. In the examples above, there >> is no guarantee that the definition of the str function doesn't >> change during the execution of either the for loop or the list >> comprehension (think multiple threads of execution ;-). The call to >> map, on the other hand, binds str once before map is called. Chris> Again, is this a design decision? that the expression in a list Chris> comprehension shuld be able to be changes mid-comprehension? In Chris> another thread to boot? This sounds like a the worst of confusing Chris> and unpredictable behaviour to me!!! No, this is Python's principle of least astonishment at work. Python's language is dynamic all over the place. Placing arbitrary restrictions on those semantics because they happen to occur between "[" and "]" would have been wrong. Chris> If it's OK from a design standpoint to require that the function Chris> in a map is bound once, it seems pretty reasonable to have the Chris> same requirement for a list comprehension. In fact, it seems like Chris> a darn good idea! The fact that the current implimentation Chris> doesn't enforce it is a pretty poor design justification...or am Chris> I missing something? map() is like any other function written in C. It does its thing, then returns. It would be impossible for map() to check back to see if the name "str" was rebound during its execution. All it knows is that it is passed a callable object. It has no idea what that object was bound to in the calling scope. It calls it once for each element of its various argument lists. That would be true if map() was written in Python as well. >> But there is no guarantee that the list you are operating on isn't >> modified by another thread during execution. Chris> but there should be !! Why here and not elsewhere in the language? I'm afraid you're tilting at windmills. >> It's not a matter of lack of interest as much as a desire to keep the >> semantics of Python and lack of time. Chris> My point is that I imagine most sequences used in Python are, in Chris> fact, homogenous, but there is no way to know this, and it could Chris> make a huge difference in performance. Look at NumPy. I simply Chris> could not use Python without NumPy. You're more than welcome to write a PEP. One approach might be to propose that the array object be "brought into the fold" as a builtin object and modifications be made to the virtual machine so that homogeneity can be assumed when operating on arrays. >> Here are some efforts I'm aware of. Note that there are lots of ways >> performance can be addressed, not just by constraining types. Chris> Certainly. And when any kind of type constraining is suggested, Chris> what a lot of people say is that what we REALLY need is an Chris> all-powerful type infering engine...talk about time to impliment Chris> issues! I think one problem Python develpment does suffer from is Chris> that nothing gets done that isn't reasonably doable with a fairly Chris> small amount of work, but some things are simply too big to get Chris> done: like a type infering engine. I don't think you need any sophisticated type inferencing engine. That's one way to do things, but not the only way. >> *. Chris> wouldn't homogenouos sequences be a big help for this? Yes, they could be, but it wouldn't be necessary to get some useful speedups. The prototype I saw compiled a specialized version of a function based on its input types. For instance, you might have: def f(a,b): return (a+b)**2 Psyco (as I understand it) would compile a version of f that assumed that a and b were ints, assuming it saw at runtime that f was being called with two ints. After that, it might redirect the execution to the special version of f if a two-int call was made, but revert to the old version if not. It can go even further though, at least in theory. Suppose Psyco observed that f was often called with a == 1 and b == 4. In that case it might build a specialized version of f that simply returns 25. Psyco could also presumably take advantage of homogeneity. It would just be a "simple matter of programming". >> * Static typing SIG () - I'm not >> familiar with this SIGs work, so you'll have to browse the archives. Chris> This is a pretty quiet SIG these days. I know a while ago Guido Chris> said that there would probably be some kin dof static typing in Chris> Py3k, but mostly for compile time type checking, not Chris> performance. I hanv't heard much since then, and it looks to be Chris> further off. Personally, I think a little static type Chris> declarations could help Py2C and the like a lot. Sure, but then it wouldn't be Python. ;-) Of course the presence of types in the language wouldn't preclude using that information to improve performance. >> * Python2C (Bill Tutt, Greg Stein) - A "module compiler" that generates >> a C version of a Python module. Chris> I've been keeping my eye on this one, but it seems to be sleeping Chris> at the moment... someone please correct me if I'm wrong. Chris> Homogenouos sequences would be very handy here as well. Yes, I believe it has been fairly stable for awhile. I doubt that Bill or Greg would turn away patches that improve it. ;-) >> * Various peephole optimizers - I wrote one a few years ago. There's >> also Michael Hudson's bytecodehacks project (on Sourceforge). The >> xfreeze bytecode freezer (part of the standard distribution?) also >> does some peepholing. Chris> Hmm, I have no idea what peepholing is.. I'll have to check that Chris> out when I get the time. Basically, you identify patterns in the instruction sequence and replace them with more efficient instruction sequences. Here's a paper I wrote for SPAM-7: I updated as many of the links in the paper as I could do easily. Some are still broken though. -- Skip Montanaro (skip at pobox.com)
https://mail.python.org/pipermail/python-list/2001-September/104001.html
CC-MAIN-2016-40
refinedweb
1,191
73.47
Today, I will continue my introduction to programming at compile time. The last post started with template metaprogramming. Here is where I pick up today and finish. Here is the big picture, before I dive in. Only to remind you, the rules of the C++ Core Guidelines were my starting point: constexpr We are just at the bottom of the triangle. In the last post C++ Core Guidelines: Rules for Template Metaprogramming, I present a short template metaprogram that removed the constness from its arguments. template<typename T> // (2) struct removeConst{ typedef T type; // (5) }; template<typename T> // (4) struct removeConst<const T> { typedef T type; // (5) }; int main(){ std::is_same<int, removeConst<int>::type>::value; // true (1) std::is_same<int, removeConst<const int>::type>::value; // true (3) } What can we learn from this example? Now, it becomes funny. At runtime, we use data and functions. At compile time we use metadata and metafunctions. Quite easy, it's called meta because we do metaprogramming, but what is metadata or a metafunction? Here is the first definition. Let me elaborate more on the terms metadata and metafunction. Metadata includes three entities: As I already mentioned, I use only types and integrals in my examples to Template Metaprogramming. Of course, this sounds strange. Types are used in template metaprogramming to simulate functions. Base on my definition of metafunctions, constexpr functions which can be executed at compile time, are also metafunctions, but this is my topic for a later post. Here are two types, you already know from my last post C++ Core Guidelines: Rules for Template Metaprogramming: Factorial and RemoveConst. template <> struct Factorial<1>{ static int const value = 1; }; template<typename T > struct removeConst<const T> { typedef T type; }; The first metafunction returns a value and the second a type. The name value and type are just naming conventions for the return values. If a metafunction returns a value, it is called value; if it returns a type, it is called type. The type traits library to which I come in my next post follows exactly this naming convention I think it is quite enlightening to compare functions with metafunctions. The following function power and the meta function Power calculate pow(2, 10) at runtime and compile time. // power.cpp #include <iostream> int power(int m, int n){ // (1) int r = 1; for(int k=1; k<=n; ++k) r*= m; return r; // (3) } template<int m, int n> // (2) struct Power{ static int const value = m * Power<m, n-1>::value; // (4) }; template<int m> // (2) struct Power<m, 0>{ // (2) static int const value = 1; // (4) }; int main(){ std::cout << std::endl; std::cout << "power(2, 10)= " << power(2, 10) << std::endl; // (A) std::cout << "Power<2,10>::value= " << Power<2, 10>::value << std::endl; // (B) std::cout << std::endl; } Here are the first differences: I will continue this comparison when I come to constexpr functions. Anyway, here is the output of the program. This was easy! Right? power is executed at runtime and Power at compile time, but what is happening here? // powerHybrid.cpp #include <iostream> template<int n> int power(int m){ return m * power<n-1>(m); } template<> int power<1>(int m){ return m; } template<> int power<0>(int m){ return 1; } int main(){ std::cout << std::endl; std::cout << "power<10>(2): " << power<10>(2) << std::endl; // (1) std::cout << std::endl; auto power2 = power<2>; // (2) for (int i = 0; i <= 10; ++i){ std::cout << "power2(" << i << ")= " << power2(i) << std::endl; // (3) } std::cout << std::endl; } The call power<10>(2) inline (1) uses sharp and round brackets and calculates 2 to the power of 10. This mean, 10 is the compile time and 2 the runtime argument. To say indifferently: power is a function and a metafunction. Now, I can instantiate the class template for 2 and give it the name power2 (line 2). CppInsight shows me that the compiler is instantiating power for 2. Just the function argument is not bound. The function argument is a runtime argument and can, therefore, be used in a for loop (line 3). In the next post, I make a jump to the next level of the triangle and write about the type-traits library. Template metaprogramming is available in C++ since C++98, but the type-traits since C++11. You may already assume it. The type-traits library is just a cultivated form of template metaprogram 625 Yesterday 7029 Week 40949 Month 107615 All 7375455 Currently are 140 guests and no members online Kubik-Rubik Joomla! Extensions Read more... Read more...
https://modernescpp.com/index.php/c-core-guidelines-programming-at-compile-time
CC-MAIN-2021-43
refinedweb
767
61.97
Five Months Without Hungarian Notation And I'm Loving It About five months ago, I expressed a growing concern that my coding methodology at the time was forcing me to create contradictions within my naming conventions. As such, I decided to completely dump my pseudo Hungarian notation for a while and adopt a more traditional, headless-camel-case approach to see how it felt. That was back in June; now, in November, I have to admit that I am really liking it. Consistency is just so freakin' sexy, and adopting headless-camel-case across the board has made things extremely consistent. abhor camel casing as much as Hungarian notation, at least insofar as it was used by Microsoft. Look at some old WINAPI code and you'll see lovely variable names like this: lpsz_name lpsz means long pointer to a zero-terminated string. When I was doing C++ programming, I adopted something one of the authors I liked recommended: Use underscores. I know that is verboten in the CF/Java world. loop_index is so much nicer to me than loopIndex or LoopIndex. Another annoyance was when coders would shorten variable names by basically removing the vowels. Ugh. Ben, I prefer the name 'nerdCaps', but if you're calling it headless camel case I fixed your picture... ...maybe I've been playing too much Left4Dead2? :) I had to click the link. I just had to.... Atta boy. I've been a HUGE fan of headlessCamelCase since I discovered it right at the beginning of my career. It's just so readable and fluid to type. Pretty much the only time I don't use it ( and use underscores instead ) is in certain types of dynamic and generated code where a physical delimiter simplifies parsing and stitching. nerdCaps FTW fuhSho. spot in a bowl of spaghetti :) */ @Adam +1000 for your pic! LOL Love the pic @Adam. Personally, I prefer headless Camel Case. For the most part I stopped identifying my variables with prefixes (ie. str int boo) when I started with CF. @Steve, Yeah, shortening variable names is insane! I have seen developers shorten a variable by removing ONE vowel. Really? Really? Is that necessary? @Adam, Ha ha ha ha, classic! Great PS job. Did you use the healing brush? @Brian, I used to be a huge fan of prefixing with data types (ie. strName, intCount). But, after a few months of rocking out "name" and "count", it's been really good times. The only problem I have is when I have variable names that are different only by data type. For example, when I convert a response string to binary for use with CFContent, I start to have to pick names like: - response - binaryResponse ... but in cases like that, I suppose it's one of the few times that the data type IS actually relevant. >. My mentor started me on headlessCamelCase and I've never felt the need to deviate. It Just Works.™ @Brad, Yeah, I remember learning that; although, I remember the actual explanation of Hungarian notation being a bit too conceptual for me. Either way, been liking what I am doing now. @Andrew, I hear you. I use the following and love it: my.namespace.MyComponents.functionMethodsOrUDF() CONSTANT_VALUES_OR_PROPERTIES One thing I always try is to CamelCaseBuiltInColdFusionFunctions() so others can tell the difference and don't spend time looking through inherited components just because they forgot a built in function existed. Where I work we have a rule, no abbreviations for anything and names that have meaning; it is funny how quickly you can get used to functions and variables that GoOnForeverButClearlyIdentifyWhatTheyAreFor. Makes code like a book that almost eliminates the need for comments. At fisrt I hated it but mostly because the rule was laid down by the .NET team, but after a while I got used to it. @Marcel, Yeah, I always err on the side of longer but more readable variable names. As for the camel casing of CF methods and the headless camel casing of custom items, I get around this by always scoping my custom methods (ex. this.doSomething()). -- what a mess. Variables should be named pretty well so that they already hint to the data type, without having to put goofy abbreviations in front of the variable name. For example, my boolean / bit variables are always named something such as "isActive", "isPublished", etc, where reading them essentially asks a question and makes it instantly obvious that they are true/false boolean variables. @Budd, I also enjoy putting "is" or "has" before boolean-style values. It just feels good. +1 for headless camel case ... been using it for years. Worked for awhile with the underscore in file names, but it's just not easy to type. Working on a code for several hours a day means always moving the hands up to get the _, and I'd rather not ... Just like you, Ben, I strongly dislike the tblTableName ... I *know* it's a table already, thanks. And same for Boolean vars: 'active' could be a column holding activity types or something, but isActive always feels 'right' to hold the Boolean. Ah, the joys of personal preference ;) I used CamelCase and headlessCamelCase back when I worked on SQL Server - the former for table names, the latter for column names. So I used it in ColdFusion as well just for consistency's sake. But now that I work primarily on Oracle, I find the underscore indispensable (Oracle table- and column names are generally stored as all caps so underscores are necessary), and my variable names are mostly all_lowercase_with_underscores. I can't stand Hungarian notation at all. @Dcs, Can you expand on why you use "_" in Oracle? I ask mostly because SQL is the one place where I feel most emotionally tied to using "_". I cannot explain it more than well, it's the way I learned to do it (not that that has anything to do with right vs. wrong). I know when I fully adopt headless Camel Case across the board, table names / column names are going to be the one place where it feels the most awkward. Luckily, with ColdFusion 9's ORM integration, table column names == object properties, which will force me to use standard naming (and not emotionally fall back on "_" usage). We use "_" in Oracle since all object names (including table names and column names) are all-uppercase by default (unless you wrap double-quotes around them). For example, if I do: create table FooBar (etc.) in Oracle, then a table named "FOOBAR" is created. Now, in some cases this might be OK. But when you have table names made up of 3-4 words then the underscores really help. Compare LOREMIPSUMDOLORSIT to LOREM_IPSUM_DOLOR_SIT - one of those is definitely easier to read. Now, you could create lowercase or CamelCase tables in Oracle if you use quotes: create table "FooBar" (etc.) Here a table named "FooBar" is created. The problem with this is that you must always use quotes when referencing the table: SELECT * FROM "FooBar" and that can get a bit tiresome IMHO. SQL Server doesn't have this issue, but I tend to use underscores there as well to ensure portability. @Dcs, Really??? That's is kind of crazy! I am, of course, referring to Oracle's man-handling of names. I wonder what the philosophy behind that is. In that context, however, using underscores makes a lot of sense. @Ben Nadel, There's also the fun that Oracle puts a limit on the length of table and column (and other object) names: 30 characters. Now, I'm not a big fan of giant names to any object, but I do prefer descritpive titles over arcane abbreviations. Especially in mapping tables, you can't always pull off TABLE_A_TO_TABLE_B, if the table names are long, and the same with index names, like FK_TABLE_A_TABLE_B. Not an issue unless you're on Oracle, but can make design for multi-RDBMS platforms a real pain. @Ben, Yes, it is a bit crazy. And, of course, if you want to find anything out about a table in Oracle by querying Oracle's system views, you have to put the table name in all-uppercase (since comparisons in SQL queries are case-sensitive)! @Jason, The 30-character limit is really absurd in this day and age. Historically I've used the dollar sign ($) for mapping tables to shorten their names, e.g. TABLE_A$TABLE_B. This works on SQL Server as well as Oracle. @Dcs, @Jason, Is Oracle still a main stream database system? I don't ask that as a joke - I've never used it. I've really only ever heard of MS SQL and MySQL. Maybe one or two others. I've heard or Oracle, of course, but I rarely talk to people who use it. Does it have a selling point for a particular set of use cases? @Ben Nadel, Yes, yes, yes, very widely used! Large enterprises that spent $2-$3 million on Oracle years ago and continue to pay Oracle DBAs to babysit the thing will allow only Oracle to be used going forward ... they have to make that investment look like it's worth it. Gets more difficult when Enterprise SQL Server can be installed for well under $100k ... @Jason, Ha ha, gotcha. Well, Oracle does have some features that SQL Server lacks. For example, although SQL Server seems to have gotten around the silly 8060-byte limit for table rows, pages are still always 8K and extents are 8 pages or 64K, while in Oracle you can specify larger extents to ensure contiguous storage for large objects, meaning fewer chained rows. I think SQL Server and MySQL tend to have more prominence in the CF world since a hosted solution will probably use one or the other. @Dcs, Good point re: hosting. I wonder if there are any shared hosting solutions that offer Oracle? But even in the corporate world, the cost of bringing up a Windows Server box with a $5,000 SQL Server license makes it very attractive. I have also found over the years that SQL Server does a great job of handling all the thread requests that a web application throws at it, while I have yet to meet an Oracle DBA that understood what needed to happen to get Oracle to handle the open/close of many requests per second. I know Oracle syntax and a lot of tricks to help it out, like doing massive queries and then managing all the data processing in my middleware, but the tuning stuff was always a nightmare. @Jason, Everything you write is perfectly true, and SQL Server has some nice tools built into it that make administering it a pretty easy task (in most cases). However Oracle does have its advantages even apart from the tired old excuse of making an investment look like it's worth it. I will say that from a developer's point of view SQL Server has made some great strides; the difference between 6.5 and SQL Server 2008 is staggering, while the same can't really be said for the difference between Oracle 7.3 and 11g. Again, this is from a developer's point of view; a DBA might have different ideas (especially since one can more-or-less run SQL Server without a DBA; the same can't be said of Oracle). @Ben, I believe there are some shared hosting solutions available for Oracle, but not nearly so many as for SQL Server and MySQL. One solution that is readily available is Oracle XE (eXpress Edition) - if you have a hosted Windows or Linux VPS you could download it for free and install it there. @dcs, @dcs, Absolutely true on the tools. I was lucky enough to get introduced to SQL at version 7 and by the time we were ready for implementation, we were on 2000, with a very nice toolset. I know I definitely dodged a bullet on 6.5 and earlier. All I know on Oracle, is that several clients each running 1 website apiece on CF could rarely get those sites to stop pegging the DB server, while we had SQL boxes running upwards of 50-60 databases for as many or more applications without a hiccup. I know that's not Oracle's fault per se, but it does speak to something about the architectures and their preferences for web connections, or so I've been told by several Oracle DBAs who thought I was nuts to suggest that a web application makes several requests to the database per minute. Nothing against it, not a MS fanboy, but it just always gave us headaches that Oracle just didn't. All of which is OT, of course ... sorry, Ben! That should be "that SQL Server just didn't" ... end of a long day ... Sorry I'm so late to the game, though this is a very interesting topic. Everyone brings to this table their experiences and conclusions as to what makes the most sense. I'd like to share mine, as they culminate in what is sometimes a struggle with respect to case enforcement in programming environments. Having spent five years apiece in both Oracle and M$ SQL Server shops, I believe anyone having spent time in the former will likely say that underscores are used in their database_object_names. This has the tendency of really screwing with your code style in programming languages if the prevalent style in that language is CamelCase or headlessCamelCase. One thing that bothers me when attempting any variation of the CamelCase strategy is an environment that does not enforce case, such as ColdFusion or SQL Server. In my experience, this lack of enforcement leads straight toward inconsistency in implementation. Across our many SQL Server database servers, I may see these (or more) variations on a theme: TblObjectName tblObjectName tblObjectNAme tblobjectname TBLOBJECTNAME I'm not kidding. Of course, this speaks to a lack of team cohesion. I agree, however in long term scenarios the lack of explicit enforcement has in my experience always lead to this end. Anyone having worked in a case enforced language or environment is bound to find this frustrating at best. With that in mind, early on I developed a lowercase_underscore_strategy across the board with very few notable exceptions. Specifically, with method and argument names in ColdFusion, I stuck with headlessCamelCase for method and argument names. This was an attempt to follow ColdFusion's methodology. Note that native ColdFusion function names are CamelCase, and I did headless on purpose to signify that a function was custom vs. native. Unfortuantely, I find ColdFusion itself to be inconsistent with respect to things like abbreviations. Take for instance these functions: IsXML vs. IsXmlAttribute. Argument capitalization is also inconsistent. While most arguments that are logically two or more words are headlessCamelCase, some are listed in the documentation as all lowercase. The mustunderstand argument for the AddSOAPRequestHeader function is one such example. The documentation itself proves in the case inconsistency point... Maddening! Whatever methodology is employed, I would simply encourage consistency. I find that, almost unequivocally, folks that have dealt with enforced case fall in the camp of solutions that end up enforcing that consistency in some way. I've seen countless arguments for CamelCase or headlessCamelCase in that it is more readable. I don't understand this, as the human brain is very well trained to detect "words" with_something_like_an_underscore_as_a_delimiter. WhatAboutSomethingLikeCapitalLettersAsADelimiter? This works okay until you come across single letter words, or a lowercase l followed by an uppercase L. Edge cases? Perhaps, but over the long term, one method is 100% consistent to my eyes while the other is not. This angle almost always ends up like a vi vs. emacs debate, so I should probably stop. ;) The developer / DBA / performance discussion is interesting. I've taken on both roles in many RDBMS, and the bottom line from my point of view is: Oracle is made for hardcore developers to tweak and tune and SQL Server is made to run out of the box. Consequently, Oracle is far more "tuneable" in my opinion, while SQL Server in the end encourages one to spend more on hardware. Who is right? Both depending on your point of view, level of in-house expertise, budgets, etc. The only serious recommendation I can make is this: Ensure that whatever methodology is employed has some built-in way of enforcing consistency across the board. When going through the CFWheels documentation, they define camelCase vs. PascalCase. When I first started programming, it was in QBasic, which was not case-sensitive. I taught myself (poorly, mind you) and I didn't use Hungarian Notation of any sort. It got frustrating because I had limited clues to the type of each variable. I went to college to learn software development and learned about Systems Hungarian. This was helpful for someone who had a history of problems recognizing variable types by looking at the names. Having just read the article on Apps Hungarian vs. Systems Hungarian, I'm definitely going to start using Apps Hungarian in the future. Having a consistent notation is like having consistent icons: as long as you have a map somewhere, it's a lot more efficient than spelling out the meaning. You don't need to spell out "Save" when you can give the person the image of a disk, "Print" when you can give the person the image of a printer, or "Email" when you can give the person the image of an envelope. Similarly, you can use "hs" for HTML-safe string instead of spelling out "HtmlSafe" and "rs" for user-provided strings instead of spelling out "RequestString". As for Hungarian Notation of database objects, I found a middle ground. I won't prefix most tables, but I will prefix a view (since there are limitations on those) and I will prefix the intermediary table of a many-to-many relationship. I might have a table called "People", a lookup called "lkup_Parents_Children" (always using the plural), and a view called "view_Oldest_Child". I use the underscores because a MySQL installation on Windows will convert all table names to lowercase. (Each table definition is stored in a FRM file and Windows filenames are not case-sensitive.) @Paul, As you may or maynot be able to tell from my code, I like a good, descriptive name ... and white space :D Joking aside, though, I think there are times were some sort of prefix / suffix does go a long way to help clarify what something. Taking the database, as an example, if a table has *just* foreign keys in it, I will typically name it with the relevant names and "_jn" for "join". So, if I had the table "user" and the table "friend" and I had to join them, I would created: friend_user_jn Of course, if I had to "upgrade" the type of table to more of an entity table, then I would rename it with something more appropriate. For example, if I wanted to not just model users and friend, but rather "friendship", I would create a different table: friengship: id, userID, friendID, startedAt, endedAt. And, while I haven't used Views in a while, I used to prefix them with "v" as "v_user" ... or was is suffix... hmm, I can't remember :)
http://www.bennadel.com/blog/1760-five-months-without-hungarian-notation-and-i-m-loving-it.htm?_rewrite
CC-MAIN-2015-35
refinedweb
3,234
62.88
I have a custom subclass of UIButton: import UIKit @IBDesignable class MyButton: UIButton { var array : [String]? } import UIKit @IBDesignable class MyButton<T>: UIButton { var array : [T]? } MyButton<String> MyButton<Int> Command /Applications/Xcode6-Beta4.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/bin/swift failed with exit code 254 Interface Builder "talks" to your code through the ObjC runtime. As such, IB can can access only features of your code that are representable in the ObjC runtime. ObjC doesn't do generics, so there's not a way for IB to tell the runtime which specialization of your generic class to use. (And a Swift generic class can't be instantiated without a specialization, so you get an error trying to instantiate a MyButton instead of a MyButton<WhateverConcreteType>.) (You can recognize the ObjC runtime at work in IB when you break other things: Attempting to use a pure Swift class with outlets/actions in a nib/storyboard gives runtime errors about ObjC introspection. Leaving an outlet connected whose corresponding code declaration has changed or gone away gives runtime errors about KVC. Et cetera.) To ignore the runtime issues and put it in a slightly different way... let's go back to what IB needs to know. Remember that the nib loading system is what instantiates anything in a storyboard at runtime. So even if the parts of your class that take a generic type parameter aren't @IBInspectable, the nib still needs to know what specialization of your generic class to load. So, for IB to let you use generic classes for views, IB would have to have a place for you to identify which specialization of your class the nib should use. It doesn't — but that'd make a great feature request. In the meantime, if it's still helpful for your MyButton class to involve some generic storage, perhaps you could look into having MyButton reference another class that includes generic storage. (It'd have to do so in such a way that the type of said storage isn't known at compile time, though — otherwise the type parameters of that other class would have to propagate back to MyButton.)
https://codedump.io/share/kffLQMzwTYP6/1/use-a-generic-class-as-a-custom-view-in-interface-builder
CC-MAIN-2017-13
refinedweb
363
51.38
Device and Network Interfaces - Prolific PL2303 USB to serial converter driver #include <fcntl.h> #include <sys/termio.h> usbsprl@unit The usbsprl driver is a loadable STREAMS and USBA (Solaris USB architecture) compliant client driver that provides basic asynchronous communication support for Prolific PL2303 USB-to-serial converters. Supported devices include PL2303H, PL2303HX and PL2303X. Serial device streams are built with appropriate modules that are pushed atop the usbsprl driver by the autopush(1M) facility. The usbsprlpr a modem disconnect event, as defined in termio(7I). The usbsprl driver supports the standard set of termio(7I) ioctl calls. Input and output line speeds can be set to the following baud rates: 75, 150, 300, 600, 1200, 1800, 2400, 4800, 9600, 19200, 38400, 57600, 115200, 230400 or 460800.prl<instance num>): Error Message... previou: <device path><usbsprl<instance number>): message... Data was lost.
https://docs.oracle.com/cd/E23823_01/html/816-5177/usbsprl-7d.html
CC-MAIN-2018-09
refinedweb
142
51.14
0 So I was thinking that there would be a simple Pythonic way to delete a directory structure. My app creates and deletes user accounts, which may contain any number of subdirectories and files. Hence, I wanted to do something like: os.rmdir(user_directory) BUT...that throws an error when user_directory is non-empty. So then I looked at os.removedirs(), but it recurses *up* the tree, which means that I would have to find the bottom. So I ended up rolling my own: def remove_recurse(path): """equivalent to rm -rf path""" for i in os.listdir(path): full_path = path + "/" + i if os.path.isdir(full_path): remove_recurse(full_path) else: os.remove(full_path) os.rmdir(path) which I believe to be correct. But why is such a function not a part of the os module ... or is it? Thanks, Jeff Cagle
https://www.daniweb.com/programming/software-development/threads/51856/deleting-directory-structures
CC-MAIN-2018-26
refinedweb
140
70.29
I’m happy to announce that Qt 5.2 Beta is now available. Lots of things have happened since Qt 5.1. Apart from new platforms, we have also added a significant amount of new functionality and done large improvements under the hood. Qt Everywhere With Qt 5.2 we are introducing the production-ready ports of Qt on Android and iOS. A lot of. This is also a big plus for our existing Qt users. It makes it fast and easy to bring your existing desktop or embedded application to mobile, by simply recompiling it. Enhanced Internals — More Power and Flexibility Qt 5.2 introduces a new Scene Graph renderer. This new renderer improves the graphics performance of Qt Quick even further, freeing up more CPU time for the application and using the GPU in a much more efficient way. The former JavaScript engine, V8, which was used internally by Qt Quick, has been replaced with a completely new, Qt-specific engine. This new engine is now designed from scratch for the use case of QML and Qt Quick. It internally operates directly with Qt data types, avoiding many costly conversions. It has both a JIT and an interpreter which greatly extends the range of platforms and operating systems it can support. The interpreter also allows us to use the engine on iOS and comply with iOS AppStore policies. New Modules and Nice Goodies Some of the main new features of Qt 5.2 include: - Qt Bluetooth: supported on Linux with Bluez 4.x and Blackberry - Qt NFC: supported on Blackberry - Qt Positioning: supported on all platforms using NMEA data, and using GeoClue on Linux - Qt Windows Extras: Integrate with native code on Windows - Qt Mac Extras: Integrate with native code on Mac OS X - Qt Android Extras: Integrate with native code on Android - Improved time zone and locale support with QTimeZone and QCollator - Enhancements to multiple Qt Widgets and a new one, the QKeySequenceEdit class - Animations for QML that can not be blocked by high loads on the main thread - Some new features and mobile specific controls for Qt Quick Controls - Accessibility is now fully supported on all desktop platforms and basic support on Android. For a more detailed list of all new features in Qt 5.2 please have a look at the New Features page in the Qt Project wiki. Qt Creator 3.0 Qt 5.2 will ship together with a new release of Qt Creator, Qt Creator 3.0. The beta for Qt Creator 3.0 has also been released today and is part of the Qt 5.2 beta binary packages. The new Qt Creator will feature improved Android support, experimental iOS support, a cleanup in the Creator plugin APIs and improved support for lldb. Qt 5.2 Beta now comes with binary installers for Windows, Mac and Linux. You can get Qt 5.2 Beta from the Qt Project download area for open source users, and in the Qt Enterprise Customer Portal for existing Qt Enterprise customers. Awesome! Congrats, actually for iOS I was amazed that everything goes inside Qt without a need to open xCode (even deploying to device) Though there’s no way to add screenshots, select orientation … Etc Also I have a question, is there a C++ APIs for the new renderer engine (as we currently use QGraphicsView and it’s very hard kinda to make a port of our huge C++ code to QML) I second everything Ahmed says! 😉 Ahmed: No benefits for QGraphicsView, I’m afraid. The new scene graph renderer is an internal update to Qt Quick 2.0. There are no public API access points to it. All existing code making use of either Qt Quick 2.0’s QML or the QSGXxx C++ classes will get it automatically. Thank you, excatly am looking for the new C++ APIs of the QSceneGraph, is there any sample or documentation of the classes, can you please point me out to an example displaying an image on the screen using the new QSceneGraph C++ APIs if possible In the meantime we are happy with QGraphicsView performance but am willing to migrate still. Great news! This release is definitely more exciting than the Qt 5.1(5.1 was good too but this one brings so many great changes). Also, Digia, you’ve obtained some additional community points for becoming a Patron of KDE. 🙂 Hey, Sounds great that you’re working on android part. I love android and being in qt with android feels great. I hate java as it is a memory blogging language. But i am not satisfied with one thing i.e your tutorial. I went for how to build Qt for android and i followed all the steps but still i am getting error and this is something i cant even ask for, to you, cause help is available to the commercial customer only. No hurts feeling but you should update your documentation. You can ask for help on the interest mailinglist, on the forums on qt-project.org, on IRC, or on whatever other websites that you like (qt-forum, stack overflow, etc.). And if you are sure that you found a problem on the examples, you can first, try to fix it yourself and contribute to the project, or if it’s out of your capabilites, report a bug. You don’t need to be a Digia customer (or KDAB’s or ICS’s, or…) to do that. We are currently updating the documentation, so it would be really helpful if you would create bug. Or, at least add a link to the tutorial that did not work for you, so that we can check what might be wrong with it. Thanks for the reply. I will definitely post the error and will try to fix the bugs if possible. Thanks Good news! So does this mean that Qt apps can be made available on the Mac and iOS app stores? What about QML applications? @Nahill: Yes, you can. Mac App Store has worked sunce Qt 4.8 and there also are Qt 5.1 based apps already in the iOS App Store. Congrats guys ! Very nice! Congratulations to the development team. Do you have news about Qt3D? I am in the process of choosing a new 3D scene graph framework. Would be grat to choose Qt3D but diffucult without any concrete information about release date and specification. (Otherwise I will probably go with Coin3D+Qt) There will be Visual Studio 2013 support, or at least an official installer for Qt 5.2? Please read Fantastic release. Thank you all! Wow, awesome!! thank you for your works!! it’s a really amazing job..! We invested a lot of time in QtQuick controls, and from 5.1 almost nothing was implemented. Where is the touch controls ? The promised treeview ?? I am afraid there was never promised a TreeView to be delivered already for 5.2 and the focus has been on improving the functionality of existing controls. That said, you might want to take a look at this thread for ideas on how to work around it. As for touch controls, there have already been several improvements to make the existing controls work better with touch in 5.2 and we plan to make a more extensive touch example in time for the final release to demonstrate what is already possible with custom styling and touch. I remember to have read about the treeview being bundle with the Qt 5.2 release too…shame that it’s not there 🙁 . I’m quite sure that the reason is due to some sort of technical problem or incomplete solution. Can you write a blog about it Jens? On the place where i work, i daily use XAML that support treeview with custom controls. Why not using the same approach with QML? The installer itself benefits from NSHighResolutionCapable and probably should be built with a newer version with Qt. The button text is not aligned correctly on OS 10.9 (Mavericks). Lots of button icons and documentation screenshots are still low resolution. Any idea when those will ever be updated for HiDPI displays? For the installer part we are looking after those at the moment. Trying to get those fixed for 5.2 final. Wonder if the that button text issues is the same as described for Qt 4.8 here Great release, it’s really comfortable to work with and everything works out of the box! I have just tried a simple Android app with Quick Controls without any issue. By the way, is it still planned to remove the QtWidgets dependency by default for Android builds? With this beta, QtWidget is still necessary when creating a simple app, making it a few Mb larger than necessary. Thank you guys! You’re awesome!! I’m not able to deploy the template Android App. The Qt Creator deploy process is stuck in this step: 16:02:54: Package deploy: Running command ‘/Applications/EclipseAndroid/sdk/platform-tools/adb -s 017cec7be39db2be pull /system/lib/libc.so /Users/jose/Desktop/build-android-test-Android_for_armeabi_GCC_4_8_Qt_5_2_0-Debug/libc.so’. OS X Mavericks, Nexus 4 Guys, really cool news! What about Android’s “SplashScreen issue”? Does it work in this release? I expected in 5.2 beta some replacement for setUnifiedTitleAndToolbarOnMac. QtMacExtras is there now, but no any way to make toolbar native looking. What to do with it? Also qtcreator became very-very slow, switching betwiin files and just changing focus out and back to creator takes about 1-2 min, But i can add it to bug tracker. But concerning unufied toolbar there is already report and it’s closed because there was said new QtMacExtras should solve this problem but it doesn’t. I’d also like to know how to use the unifiedTitleAndToolbarOnMac on OS X. Any workaround exists? +1 Where is our Mac native toolbar? Without it Mac desktop applications just don’t grok. I once tried to compile the QMacNativeToolBar (which was incredible difficult to track down – several links to its original Git location are now broken – a recent google research showed me this which might help to locate the code again:), but it did not compile on OS X 10.8.5 (I tried to spot the issue, but it was not apparent within a few minutes, so I gave up: it claimed that some symbol was not defined, when in fact I think it was, however in Objective-C++ code which I am not 100% sure of). Anyway, an easy-to-use-Qt-solution-as-we-know-it for a “native Mac toolbar” would be VERY welcomed and is highly desired 🙂 Assuming that this is the official repository from Qt 5.2 will eventually be built: There is a file called qmacnativetoolbar.mm after all – seems like just the docs about “Mac Extras” do not mention it yet 😉 Hey, Qt guys! Are you here? Is anybody going say something to response to this message or bug tracker ticket: We can’t ship our commercial product with qt 5 having commercial qt 5.0, 5.1 and 5.2 because mac users don’t like not native look, and setUnifiedTitleAndToolbarOnMac is very important to achieve native look. Could we at least know when this task be solved? Nice work! However, for now it seems that Android deployment was easier in 5.1.1 for my project. I have 2 executable sub-projects and several shared library and plugin sub-projects in my project tree and the new deployment system doesn’t handle that as well as the alpha did. I hope the new system gets fixed/improved to support more complex setups. Hello Hese, did you ever met problems with your project structure when deploying on Android? I do work on a project with three subprojects A, B and C. A uses B as plugin and B uses C as plugin. Runs fine as desktop version but makes problems on Android, where A is not able to find B. For now I got the project working by adding shared libraries that need to be autoloaded to the ANDROID_EXTRA_LIBS variable in pro-file. For the plugins (that should not be autoloaded) I removed the “TEMPLATE = lib” for android target so that the new deployment system picks them up to the apk. Hello Hese, thank you very much for the hint. Do you use the resource system in one of your library projects? One of my libraries contains qml files which should be accesible from the other projects. I make them available via the resource system and define a präfix in the resources.qrc file. Unfortunatley this präfix can not be found at runtime. Best regards I’m not sure if here is the place for your question, but I’ll give you an answer anyway: I think you need Q_INIT_RESOURCE if your library is static. Look at the Q_INIT_RESOURCE section on this page. Hello, just downloaded qt-mac-opensource-5.2.0-beta1-ios-x86_64-offline.dmg to start with iOS Development with Qt. Is there any information regarding configuration of qt creator (compiler, kits, devices). A tutorial like ‘Hello World’ would be great! Thanks a lot Hello Jens, The kit creation should be more or less automatic in Qt Creator on Mac OS X if you have Xcode installed. However, you will need to configure the test devices using Xcode. You should be able to deploy both Qt Widgets -based projects and Qt Quick projects to iOS devices. We currently have the following instructions for creating device connections in the Qt Creator Manual: I suppose we could add a tutorial, but I’m not sure what iOS specific information it would need to contain, after the development environment is set up. The current tutorials are here: You can also access these topics in the help file delivered with the beta package. If you find errors in the docs or would like some information added, please create JIRA reports. Leena Hello Leena, thank you very much for your reply to my post. What I would like best is getting information about starting with iOS developement with Qt. It would help a lot to have an example and some information about what is possible and what does not work at the moment (QtQuick 2 ?). After having done the first steps the examples given are surely a great help. BTW: In the article about connecting devices it is not mentioned that the iOS support is to be turned on in the plugins settings of Qt Creator. As a beginner this took me a while to figure out. Thanks again for your reply and best regards, Jens Great work guys! Really looking forward to the release 🙂 Cheers, Chris from V-Play Great news,Qt5.2 inspire me! Still no MinGW 4.8.1 version? We decided to stay with MinGW-builds x32-4.8.0-release-posix-dwarf-rev2 for Qt 5.2 . That’s the exact toolchain we used for 5.1, and is also what is in the online installer. The toolchains are unfortunately not binary compatible (that is, you can’t run an app compiled with above toolchain with a newer, e.g. 4.8.1 based one), so using a newer toolchain for 5.2 would have forced us to ship it in addition to the 4.8.0 one, forced anyone to recompile etc. Anyhow, the mingw-builds project is regularly providing qt 5 builds with the latest toolchains. Does this mean that MinGW won’t be updated unti Qt 6 🙂 No. It just means that we won’t update for 5.2, and re-consider for 5.3: For 5.2 the patches to gcc and in the MinGW headers just didn’t seem to outweigh the costs. openssl support for android, yay! 🙂 What about Windows Phone 8? Great news! 🙂 About QtBluetooth, is there any plan to support Android? I saw that there’s some code for it lying in the Necessitas repository, but there are no changes since 2011… There are plans yes: It won’t be done for Qt 5.2 though. I’m working on a Qt 5 application where scripting will be a key feature and I’ve been using QtScript so far. With the new Qt-specific-engine, do I have to be concerned about the future of the QtScript module when it comes to enable scripting inside my application? My app makes heavy use of OpenGL and makes no use of QML so far (we plan to add it later, but will not happen soon…). I think this is not the right place to ask about this, but the original article by Lars Knoll does not accept comments anymore. The Right Place(tm) to ask these kind of questions would be – among others – the mailing list qt-interest@qt-project.org. 😉 Hi, I Just downloaded qt5.2 I, have tested my application with errors in qwebkit. Qwebkit does not work in qt5.2? or is a beta bug? thanks I’m having a difficult time with the workflow for Qt 5.2 Beta as it relates to targeting iOS. I have XCode 4.5.1 with Command Line tools installed. I have configured my iPhone device in Xcode as mentioned int he link provided by Leena, but I don’t see any auto-generated Kits for iOS apearing in my Qt Creator 3.0.0 Beta Build Preferences, and I don’t see my device recognized under Devices when it is plugged in. Hello, it worked for me after manually adding the Qt versions in the build settings, exp. /Qt5.2.0/5.2.0-beta1/ios_x86/bin/qmake for ios simulator. After doing so and connecting a device you should see the device, kits and other related items in Qt Creator. Jens, thanks for that tip! I am able to now build my QtQuick2 app for iOS Simulator. It even launches the Xcode iOS Simulator, but it looks something went wrong with the deployment step. Starting remote process. Support/iPhone Simulator/6.1/Applications/734CBA63-0648-4255-8CFB-7C4BBDB414D5/Resources/qml/MyApp/MyApp.qml:9:1: module “QtQuick” is not installed import QtQuick 2.0 ^ It can’t find QtQuick2. (!) I tried creating a project from scratch, and I also observed the same problem. If you have an idea about how to get around this, let me know. If not, I’ll post about this issue to the Interest list. Thanks for your advice so far! Hi Steven, unfortunately this is bug. This bug is known. You can get more information about it here As far as I figured out there exists no (easy, documented) workaround. Maybe someone who reads this can help? Regards, Jens Thanks for the bug info, Jens! Does QtMacExtras contain the function to set the dock icon menu? That is an exported function in Qt 4, but we’ve been told to expect it in QtMacExtras and is blocking the porting of an app I develop to Qt 5. Will there be a prebuilt version for BlackBerry? You have done fantastic work with this new version! I’m especially amazed by the work put into easing development for Android and iOS. As for Android, I have been testing Qt3D, and it has been working very well with Qt5.1. With the Qt5.2 beta release I’m getting hit very often with Android’s garbage collection during the building of 3D meshes. For instance, if I add 5-6 QML Sphere objects to a standard Viewport, I will get plenty of lines in the application output stating something along the lines of “GC_CONCURRENT freed x % …”. This causes the application to load very slowly, until all meshes are built. If there is any changes to the meshes during the run of the application, similar GC_CONCURRENT lines reappear and the performance drops again. Has something changed that causes less memory to be available on Android with this release? If not, is there anything I can do to track down this issue before filing a proper bug report? Qt 5.X still remains unusable for our enterprise application until is fixed 🙁 along with non-frozen global object during initial QQMLEngine construction These were not problems when QML was based around QDeclarativeEngine as it used native QtScript. I would really like to see more features in QtWidgets and QtGui. The desktop is not dead..
https://blog.qt.io/blog/2013/10/23/qt-5-2-beta-available/
CC-MAIN-2019-30
refinedweb
3,417
74.19
Details Description It would be useful to be able to register handlers after SolrCore has been initialized initialized. It is also useful to be able to ask what handlers are registered and to where. This patch adds the following functions to SolrCore: SolrRequestHandler registerRequestHandler(String handlerName, SolrRequestHandler handler); Collection<SolrRequestHandler> getRequestHandlers(Class<? extends SolrRequestHandler> clazz); It also guarantees that request handlers will be initialized with an argument saying what path it is registered to. RequestHandlerBase gets a bean for the registered path. While discussing this, Yonik suggested making it possible to defer initialization of some handlers that will be infrequently used. I added the 'LazyRequestHandlerWrapper' (if taking this out makes the patch any easier to commit - it can get its own issue) check: Issue Links Activity - All - Work Log - History - Activity - Transitions changed this so that LazyRequestHandlerWrapper is not a public class. That seems cleaner as it is not something that should be used directly Updated in response to Hoss' comments: 1. gets rid of the get by class thing 2. adds Map<> getRequestHandlers() 3. gets rid of the extra param to init() two outstanding questions from the email discussion... 1) yonik seemed to be concerned about synchronization issues involved with geting a request handler by name now that they can be registered dynamicly on the fly ... flarify that. 2) if we want request handlers to be able to find out what nam(es) they are registered with (now that anyone can call core.registerRequestHandler I might give the exact same identicle instance multiple names) they should be able to do that from the init method ... since we aren't changing the API of the init method, we should probably make sure that registering a handler causes... handler = clazz.newInstance(); this.register( name, handler ); handler.init( args ); ...to happen in that order. i would even argue that when registering multiple handlers (ie: from the config) we may want the psuedocode to be... foreach (handlerconfig){ handler = clazz.newInstance(); this.register( name, handler ); } foreach (key in registry){ lookup(key).init( args ); } ...so that all handlernames are defined before any init methods are called. #2, smart! yes This update loads handlers in the style suggested by Hoss. It makes sure everything is instanciated and registered before calling init() on any handlres registered in solrconfig.xml It calls init() on handlers in the order they were defined. The only open issue is if SolrCore.getRequestHandler() should be synchronized. I can't think of any potential problems if it isn't but i could be missing something. I'll let whoever commits this decide if it should be synchronized or not. w.r.t. synchronization of getRequestHandler(), I was just thinking ahead to when registerRequestHandler() may be called after the constructor for SolrCore. Registration before initialization is interesting, but again, this only works easily if registerRequestHandler() is restricted to the SolrCore constructor. If this were to change in the future, it would expose un-initialized handlers to requests. The API in this patch lets you call SolrCofe.registerRequestHandler( path, handler ) at any point. If you use this api, you are responsible to make sure the handler is initalized – this may or may not require calling init( NamedList ) depending on the handler implementation. The "Registration before initialization" is only save for SolrCore to use within its constructor. RequestHandlers.registerHandlers( NodeList nodes ) - is package private and only called from the SolrCore constructor. I still don't see how synchronization becomes an issue - unless someone is trying a bizarro use case where someone registers a handler within SolrRequestHandler.handleRequest() and expects that exactly the next request use the newly registered handler. In my use case, I have a custom filter that extends SolrRequestDispatcher. This filter initializes solr normally, then inspects what was registered and automatically sets up the rest of the environment. If you modify the map in one thread and read from it in another thread, that requires synchronization to work correctly (even if it's a different entry being accessed). But what is the failure mode? Suppose, in thread A, I call: SolrCore.getSolrCore().registerRequestHandler( "/path/to/handler", handler ); then 5 seconds later in thread D, I call: SolrCore.getSolrCore().getRequestHandler( "/path/to/handler" ) Can we be sure the new handler will be returned? Is there any chance of anything exploding? Is it only in the microseconds around touching the map that things are undefined? If it is a graceful error (null or whatever was there before), i don't think this case needs to be synchronized. If it is something else could happen, it should be. > But what is the failure mode? Any number of modes of failure.... it's very tough to predict them (I think you'd have to be Doug Lea 1) thread #1 does map.put("/path/to/handler", handler) thread #2 iterates over the map and gets a ConcurrentModificationException 2) thread #1 does map.put("/path/to/handler", handler) thread #2 does map.put("/path/to/handler2", handler2) a) If they hash to the same bucket, one could overwrite the other b) one or both could cause resize() to be invoked... ouch! many different modes of failure there 3) thread #1 does map.put("/path/to/handler", handler) causing resize to be called() thread #2 does a map.get("/myexistinghandler") and it gets back null I'd agree with you if the only mode of failure was to get back null for the current object being put in the map (since it's a race between threads anyway, null is a valid view - one should synchronize externally in that case anyway). But, any insert can mess up all other reads. synchronized it is! Rather then synchronizing each function call, I'm using a synchonized map: private final Map<String, SolrRequestHandler> handlers = Collections.synchronizedMap( new HashMap<String,SolrRequestHandler>() ); related note i'm typing before i forget... in SOLR-81 i tried to call SolrCore.getSolrCore.getDataDir() in the init method of a requestHandler and got an infinite loop. I can't remember if this type of situation would be prevented by this patch or not ... if it isn't that doesn't mean this patch shouldn't be committed, it just means we should probably open a separate bug to try and detect/prevent/error in that situation. yes, that situation is handled by this patch. This was one of my primary reasons for writing it! This patch lets you do call SolrCore.getCore() and inspect the schema/index/whatever. Without it, you need to do some sort of lazy loading after the first request. A couple of comments... - For lazy loading, you don't even want to load the class if it's not used (loaded classes take up resources, and there may be optional jars that will cause errors). - it really seems like init() must be called before any calls to handleRequest. To ensure this, I don't think we can do the registration inbetween. This isn't just a hypothetical problem... think about when a new web page is published that causes a new type of request to start hitting an existing Solr server... 10s to 100s of requests per second for a new hander all of a sudden. The likelihood becomes very high that another request will cause handleRequest() to be called before or concurrently with init(). > - For lazy loading, you don't even want to load the class if it's not used (loaded classes take up > resources, and there may be optional jars that will cause errors). Ok - I'm a little nervous about that because I like things to fail loudly at startup rather then wait to tell you they were configured incorrectly. ( SOLR-179) But if you are using lazy loading, that is probably the behavior you would expect. I'll change it so that the LazyRequestHandlerWrapper stores the string value for the class name rather then the Class itself. > > - it really seems like init() must be called before any calls to handleRequest. > yes, init() must be called before any call to handleRequest() - absolutely Correct me if I have the lifecycle wrong, but I think it is ok: 1. SolrDispatchFilter.init() calls SolrCore.getSolrCore() 2. SolrCore.getSolrCore() calls SolrCore constructor 3. SolrCore constructor initalizes schema, listeners, index and writers 4. then calls reqHandlers.initHandlersFromConfig( SolrConfig.config ) this function: a. creates each handler for solrconfig.xml and registers it b. calls init() on each handler - (since register was called first, each handler knows what else exists, but it may or may not be initialized) 5. initialize searcher / updateHandler 6. SolrDispatchFilter.init() finishes and solr starts accepting requests. All handlers call init() before they could possibly receive any requests. No requests can hit solr during the limbo period (a-b), It is only in the "unstable" state in the SolrCore constructor - I think the benefits of handlers knowing what else is registered during their init() method is worth the slightly awkward construction. The public interface: SolrCore.register( String handlerName, SolrRequestHandler handler ) assumes that the handler is properly initialized. As soon as this is called it can immediately start accepting requests. I will make the javadoc more clear on this point. The only potentially dangerous function is (4) initHandlersFromConfig. This is a package private function that defiantly should not be called anywhere else. Calling this function twice is not normal, if someone does it, they are asking for trouble. 1. Changed the LazyRequestHandlerWrapper to hang on to a string rather then a class and does not access the class until it is needed. (saves memory, but delays errors) 2. Added more explicit documentation initHandlersFromConfig still registers all handlers before initializing them - i am confident this is ok unless it is called outside of the solr core constructor. > (saves memory, but delays errors) Delays errors can also be a feature (if things need to be configured first, or jars need to be dropped in the right spot, etc). I think getWrappedHandler() needs to by synchronized or else - multiple instances could be instantiated - an instantiated instance could be handed back to a different thread before or during the handler's init() - general spookiness even after init() finishes due to lack of synchronization (initialized data won't necessarily be seen correctly in a different thread) One line change adding synchronized to: public synchronized SolrRequestHandler getWrappedHandler() thanks yonik - - - - - - - - - - >> (saves memory, but delays errors) > Delays errors can also be a feature (if things need to be configured first, or jars need to be dropped in the right spot, etc). > I'm convinced. With SOLR-179 you can configure things to stop after errors - if you want some things to stop while otheres continue, you can make them lazy loaded. Committed. Thanks Ryan! If you all are more comfortable with Collection<SolrRequestHandler> getRequestHandlers() then: Collection<SolrRequestHandler> getRequestHandlers(Class<? extends SolrRequestHandler> clazz) that is an easy change. Likewise we can postpone the Lazy bit if it makes anything easier. I included tests for everything i think is testable about these changes, and added nice javadocs.
https://issues.apache.org/jira/browse/SOLR-182?focusedCommentId=12478561&page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel
CC-MAIN-2015-40
refinedweb
1,832
56.05
WSTP C FUNCTION WSPutString() This feature is not supported on the Wolfram Cloud. This feature is not supported on the Wolfram Cloud. DetailsDetails - A raw backslash in the string must be sent as two characters '∖∖'. - Special characters can be sent only using the format returned by WSGetString(). - The encoding normally used is the same as for WSGetString(). - WSPutString() returns 0 in the event of an error, and a nonzero value if the function succeeds. - Use WSError() to retrieve the error code if WSPutString() fails. - WSPutString() is declared in the WSTP header file wstp.h. ExamplesExamplesopen allclose all Basic Examples (1)Basic Examples (1) #include "wstp.h" /* send a string representing an expression to a Mathematica kernel for evaluation */ void f(WSINK lp) { /* construct the packet to be sent to the kernel */ WSPutFunction(lp, "EvaluatePacket", 1); WSPutFunction(lp, "ToExpression", 1); WSPutString(lp, (const char *)"3+4/Sqrt[19.2]"); WSEndPacket(lp); /* send the packet */ if(! WSFlush(lp)) { /* unable to flush an outgoing data buffered in lp */ } }
http://reference.wolfram.com/language/ref/c/WSPutString.html
CC-MAIN-2015-06
refinedweb
165
58.58
- Silverlight - .NET - C# Elements - C# Constructs - C# Data Access - C# Security/Debug - C# Code - C# Videos - Windows Phone - About Object and String Comparisons C# String Intern Pool "This video demonstrates and how strings and objects are stored in memory, how the string intern pool works, and the immutability of strings ." Four code sections are animated in Visual Studio 2012 and the Output, Watch, and two Memory windows are monitored. The Demonstration The four code segments used in this demonstration are: - Objects: Reference vs Value Comparisons C# is similar to Java when comparing objects. The == operator compares the addresses of the objects in the heap. So when two objects (o1 and o2) are created and each given the value of 5, the (o1 == o2) returns False. The .Equals method is used to compare the contents of the objects. The comparison o1.Equals(o2) returns True when the content of the objects are the same. - For C#, when comparing objects - The == operator performs a reference comparison. - The .Equals method performs a value comparison. - Strings: Reference vs Value Comparisons However, C# is unlike Java when comparing strings in that the == operator compares the contents of strings. So when two strings (s1 and s2) are created and each given the value of 5, the (s1 == s2) returns True. The .Equals method is also used to compare the contents of the strings. The ReferenceEquals method is used to perform a reference comparison between strings, e.g. ReferenceEquals(s1, s2). - For C#, when comparing strings - The == operator performs a value comparison. - The .Equals method performs a value comparison. - The .ReferenceEquals method performs a reference comparison. - String Intern Pool The String Intern Pool is a reference table to unique literal strings which is maintained by the Common Language Runtime. Strings are only put into the pool at compile time or when the Intern method is used. The demonstration shows that simply changing the string literal at run time to equal a literal value already stored in the pool does not cause the string to point to the interned string. For this to happen the Intern method must be used. The Intern method searches the string pool for a value equal to a specified string. If the string value is found, its reference address in the string pool is returned. If the string value is not found, the string value is added to the intern pool and that new reference address is returned. C# String Intern Pool - Immutable Strings When a string literal is created at compile time the string resides in the String Intern Pool. At runtime, each time the string literal is changed, a new string containing the changed value is created in the heap. This can consume a large amount of memory when strings are changed frequently, such as inside a loop. In these situations the StringBuilder class should be used. A StringBuilder object is mutable and maintains a buffer to accommodate expansions to the string. C# Immutable Strings Strings in C# and Java The difference between Strings in C# and Java is explained in the MSDN Data Types (C# vs. Java) page as follows:. C# Code Used in Demonstration Video using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace ObjectandStringTests { class ObjectandStringTests { static void Main(string[] args) { #region objects // For Objects: == is a reference comparison. // For Objects: .Equals is a value comparison. Console.WriteLine("O ------------------"); int i = 5; object o1 = i, o2 = i; Console.WriteLine("Result is: {0}", (o1 == o2)); // False (Reference Comparison) Console.WriteLine("Result is: {0}", o1.Equals(o2)); // True (Value Comparison) Console.WriteLine("Result is: {0}", ReferenceEquals(o1, o2)); // False (Reference Comparison) Console.WriteLine("O ------------------\n"); #endregion objects #region strings // For Strings: == is a value comparison. // For Strings: .Equals is a value comparison. Console.WriteLine("S ------------------"); string s1 = "kevin", s2 = "kevin"; Console.WriteLine("Result is: {0}", (s1 == s2)); // True (Value Comparison) Console.WriteLine("Result is: {0}", s1.Equals(s2)); // True (Use for String Value Comparison) Console.WriteLine("Result is: {0}", ReferenceEquals(s1, s2)); // True ! (String Intern Pooling) Console.WriteLine("S ------------------\n"); #endregion strings #region intern ! Console.WriteLine("I ------------------\n"); #endregion interning #region immutable // Strings are immutable, they can not be changed. Console.WriteLine("M ------------------"); string s6 = "kevin"; string s7 = "kevin"; Console.WriteLine("Result is: {0}", ReferenceEquals(s6, s7)); // True s7 += "H"; // s7 is now a new string with different reference Console.WriteLine("Result is: {0}", ReferenceEquals(s6, s7)); // False Console.WriteLine("M ------------------\n"); #endregion immutable } } } Reference Articles - Data Types (C# vs. Java) - Microsoft Developer Network. - String.Intern Method - Microsoft Developer Network. - Why strings are immutable and what are the implications of it? - Code Project. - StringBuilder Class - Microsoft Developer Network. - Using the StringBuilder Class - Microsoft Developer Network. - C# string vs StringBuilder - Microsoft chanel 9. - String Class - Microsoft Developer Network. - Best Practices for Using Strings in the .NET Framework - Microsoft Developer Network. - string (C# Reference) - Microsoft Developer Network.
http://www.kcshadow.net/wpdeveloper/?q=refandvalcompare
CC-MAIN-2018-22
refinedweb
813
59.8
XProc is a markup language that describes processing pipelines composed of discrete steps that apply operations on XML documents. If a specification's importance is related to the quality of individuals working on it, then XProc is significant, indeed. The W3C XML Processing Model WG is packed with pragmatic XML practitioners and superstars as well as grizzled veterans of past XML-related efforts: Erik Bruchez, Andrew Fang, Paul Grosso, Rui Lopes, Murray Maloney, Alex Milowski, Michael Sperberg-McQueen, Jeni Tennison, Henry Thompson, Richard Tobin, Alessandro Vernet, Norman Walsh (Chair), and Mohamed Zergaoui, to name a few. XProc is not the first W3C attempt to establish an XML processing pipelines standard. In 2002, as part of the XML Processing Model Workshop, there was the "XML Pipeline Definition Language Submission," submitted by Sun Microsystems, Alis Technologies, Arbortext, Cisco Systems, Fujitsu, Markup Technology, and Oracle. This submission was published on 28 February 2002 as "XML Pipeline Definition Language Version 1.0." In 2004, a W3C Note attempted to set out requirements for an XML processing model: "XML Processing Model Requirements," W3C Working Group Note 05 April 2004. In 2005, another W3C member submission was proposed: "XML Pipeline Language (XPL) Version 1.0" (draft), submitted by Orbeon, Inc., on 11 March and published on 11 April. I haven't seen any specific studies citing the need for XProc, so I here proffer a few of my own unabashedly biased opinions: - XProc’s declarative format, combined with the simplicity of thinking in terms of pipelines, will mean that non-technical people can be involved in writing and maintaining processing workflows. - XProc, in many configurations, is amenable to streaming, whereas other approaches to control XML processes are not (for example, XSLT). - XProc steps focus on performing specific operations, which over time should experience greater optimization (in an XProc processor used by many) versus one-off code that you or I write (used by few). - XProc's standard step library and extensibility mechanisms position XProc to be an all-encompassing solution. - Structured data (such as XProc markup) is typically easier to reuse than structured code. - One of XProc's inspirations is UNIX® pipelines, which hopefully all can agree is a good thing! Not surprisingly, XProc will probably gain considerable favor amongst those groups who work and generate XML documents. You can also imagine that people with business workflows and XML documents flowing through them might be excited by the possibility of modeling their workflows with XProc pipelines, and then running them on their XML documents. XProc is comprised of a small vocabulary divided into three categories: core elements, ancillary elements, and a standard step library. The core elements provide modern computing language constructs, such as conditional and iterative processing and try/catch error mechanisms: <p:for-each>: Iterative processing statement <p:choose>: Case logic statement (similar to XSLT <xsl:choose>) <p:group>: Groups a series of steps into a named sub-pipeline <p:try>: Provides a try/catch mechanism to handle dynamic errors <p:viewport>: Applies a sub-pipeline process to subtrees contained in a single XML document The elements used in the declaration and definition of steps provide the basis for XProc extensibility and reusability: <p:library>: Contains step declarations to provide reusable step libraries <p:declare-step>: Defines a step and its functional signature, typically in a <p:library>element <p:import>: Brings in through a Uniform Resource Identifier (URI) any declared pipelines or library to the current pipeline XProc ancillary elements are mainly children nodes of XProc steps and handle tasks such as step bindings, making it easy to configure a step. These elements consist of: - Inputs and outputs: These elements define ports that can bind to the inputs or outputs of other steps and define the flow of XML documents. In addition, you can define XML documents inline (directly in the XProc document) or bring in documents through an external URI. - Options: Options are the primary mechanism for configuring steps, with the <p:with-option>element or as a name-value attribute on the step instance. Note that options are part of the functional signature of a step, and their names are invariant. - Variables: Variables are used with compound steps and define XPath variables for use within a compound step sub-pipeline. - Parameters: Unlike options and variables, parameters have names that are computed at run time and are not related to any functional signature, as defined by <p:declare-step>. Perhaps the most significant aspect to XProc is the 30-40 steps defined in a standard XProc library, which are split into a set of required and optional steps. The real power of XProc is embodied in its standard library of required and optional steps, which perform a wide variety of tasks, such as: - XSLT, XQuery, XInclude processing - Schema validation (DTD, RelaxNG, Schematron, XML schema) - XML update operations, such as inserting or deleting XML elements and attributes - XML storage and retrieval - Wrap, unwrap, escape, and unescape XML - HTTP requests - Execute native commands Here is a brief overview of each step contained in the XProc standard library: - Required steps: <p:add-attribute>: Add an attribute to a set of matching elements. <p:add-xml-base>: Add or correct xml:baseattributes on elements. <p:compare>: Compare two documents for equivalence. <p:count>: Count the number of documents in source input. <p:delete>: Delete items specified by a match pattern from the source input. <p:directory-list>: Enumerate the directory listing into the result output. <p:error>: Generate a dynamic error. <p:escape-markup>: Escape source input. <p:http-request>: Interact with resources identified by Internationalized Resource Identifiers (IRIs) over HTTP. <p:identity>: Make an exact copy of an input source to the result output. <p:insert>: Insert an XML selection into the source input. <p:label-elements>: Create a label for each matched element, and store the value of the label in an attribute. <p:load>: Load an XML resource that an IRI specifies and provide it as result output. <p:make-absolute-uris>: Make the value of an element or attribute in the source input an absolute IRI value in the result output . <p:namespace-rename>: Rename the namespace declarations. <p:pack>: Merge two document sequences. <p:parameters>: Make available a set of parameters as a c:param-setXML document in the result output. <p:rename>: Rename elements, attributes, or processing instruction. <p:replace>: Replace matching elements. <p:set-attributes>: Set attributes on matching elements. <p:sink>: Accept source input and generate no result output. <p:split-sequence>: Divide a single sequence into two. <p:store>: Store a serialized version of its source input to a URI. <p:string-replace>:Perform string replacement on the source input. <p:unescape-markup>: Unescape the source input. <p:unwrap>: Replace matched elements with their children. <p:wrap>: Wrap matching nodes in the source document with a new parent element. <p:wrap-sequence>: Produce a new sequence of documents. <p:xinclude>: Apply XInclude processing to the input source. <p:xslt>: Apply an XSLT version 1.0 or XSLT version 2.0 style sheet input source. - Optional steps: <p:exec>: Apply an external command to the input source. <p:hash>: Generate a message digest or a digital fingerprint for some value. <p:uuid>: Generate a Universally Unique Identifier (UUID). <p:validate-with-relax-ng>: Validate the input XML with RelaxNG schema. <p:validate-with-schematron>: Validate the input XML with Schematron schema. <p:validate-with-xml-schema>: Validate the input XML with XML schema. <p:www-form-urldecode>: Decode the x-www-form-urlencoded string into a set of XProc parameters. <p:www-form-urlencode>: Encode a set of XProc parameter values as an x-www-form-urlencoded string. <p:xquery>: Apply an XQuery version 1.0 query. <p:xsl-formatter>: Render an XSL version 1.1 document (as in XSL-FO). It is easy to create new steps from existing pipelines. If you want, you can even create third-party libraries with extension steps that augment the XProc processor itself. Note: As the specification process is ongoing, the standard library is one area that continues to experience a bit of volatility. I suggest referring to up-to-date definitions in the current WD (see Resources) for specific details. Listing 1 illustrates an XProc pipeline with a single step that applies an XSLT operation to an XML document. Listing 1. Simple implicit pipeline XProc pipelines accept zero or more XML documents as their input and produce zero or more XML documents as output. The XProc code in Listing 1 consists of a <p:pipeline> top-level element, a <p:xslt> step, and not much else. An XML document that comes into the standard input of the XProc processor is handed off to the <p:xslt> step, which then applies an XSLT process using mystylesheet.xslt (where mystylesheet is defined by the <p:input>/ <p:document> element) on the XML document. With only a single step, its results are placed onto the result port for the entire pipeline, which (incidentally) typically outputs the XML document to standard output. Figure 1 shows this process, outlining where the XML document flows from source and result ports. Figure 1. Logic flow for a simple pipeline These connections between ports are known as step bindings, and they control the flow of XML document processing. These bindings can be implicitly or explicitly defined. In the Listing 1 example, bindings were implicit, with process flow dictated by XProc's natural defaulting mechanisms. Listing 2 shows a functionally equivalent pipeline with explicit step bindings. Listing 2. Simple explicit pipeline In Listing 1, I used <p:pipeline>, which implicitly declared a source input and result output port. Using <p:declare-step> now means that I have to explicitly define these ports as well as declare step bindings between sequential sibling steps. These bindings and ports are summarized below: - Top-level my-source input port will receive any standard input. - Top-level my-result output port will receive the results of the step1 result port and place them on the standard output. - The step1 source input is bound to the my-source input port. It's difficult to illustrate step bindings between steps using a pipeline with a single step; so, I created a nontrivial example in which I show several XProc steps and logic structures. Listing 3 presents a more representative XProc example containing multiple steps along with some conditional logic steps. Listing 3. Complex pipeline This pipeline roughly translates to the following: - Input stdin XML documents. - Apply <xinclude>processing (step1). - Choose (step2) between using an newer (step2a1) or older (step2b1) schema and validate. - Extract each (step3) HTML <div>element, applying a string replace operation (step3a1). - Wrap up (step4) the final sequence of <div>elements with a <document>element. - Output the XML documents to stdout. Steps can have other input or output ports defined that work with non-XML documents, but only XML documents (as in XML infoset) can flow between primary input and output ports. I used all three kinds of XProc steps in this example. Step types are represented as rectangles in the workflow diagram that Figure 2 shows. Figure 2. Logic flow for a complex pipeline The p:pipeline compound step The largest rectangle represents the whole <p:pipeline>, which can itself be invoked as a step. Because it contains a sub-pipeline, it is a compound step. The p:choose multi-container step The <p:choose> step has two sub-pipelines, which makes it a multi-container step. It chooses which sub-pipeline to follow based on the evaluation of a <p:when> XPath expression. The p:for-each compound step The <p:for-each> step contains a single sub-pipeline consisting of one step, so it's a compound step. Most XProc steps are atomic steps. These steps apply a specific operation to an XML document, examples of which are <p:xinclude>, <p:validate->, <p:string-replace>, and <p:wrap>. Considerations in the development of XProc Throughout the XProc specification process, the WG had to navigate several issues: - Namespaces: XProc works with XML documents, which means for many operations, a processor has to keep track of namespaces in documents. For example, consider the XProc p:unwrapstep; which removes the top-level element of a document. If this step removes a top-level element that happens to have the namespace xmlnsdeclaration, you must ensure that XProc applies a fixup to ensure that the stripped namespace declaration is copied to child elements in the resultant XML documents, mindful that you don't overwrite any other valid namespace declaration. The WD contains a non-normative "Section E. Guidance on Namespace Fixup" that attempts to outline what a processor must handle. - XSLT and XPath versions: The timing of the XProc effort means that it finds itself in the middle of an adoption cycle between versions of XPath and XSLT. I think that when we start to use XProc, we will see how well XProc navigated the thorny issue of supporting multiple versions of XPath and XSLT. - Options, variables, and parameters: Too much seems to be going on with options, variables, and parameters. I think many people might agree with me that a single entity might serve just as adequately. - Streaming: I feel that the WG might have given this requirement too much weight in their earlier decisions on XProc. Considering that the preponderance of XML technologies that XProc will control are themselves not 100% up to standardized streaming, it seems like early optimization to me, especially in a world where MapReduce and parallelization techniques seem to be gaining in prominence. As with any W3C specification, XProc underwent a lot of changes in terms of syntax and semantics (see Resources). The latest WD, dated 1 May 2008, is evolutionary as it irons out the details from the churn of the previous draft's decision to allow both version 1 and version 2 of XPath and XSLT. The current WD is also revolutionary in that the spec was completely rewritten to disentangle some of the various notions that the <p:option> element had become. For example, <p:option> is now used only in the functional signature of a step (only in <p:declare-step>), with <p:with-option>used in the step instance itself, when setting an option's value. In addition, the <p:variable/> element was added to hold computed values, especially for use with compound steps. The most interesting change with options, parameters, and variables is the removal of the value attribute; values are now the result of evaluating an XPath expression defined by a select attribute. Listing 4 illustrates how this works, using p:with-option as an example. Listing 4. Example of p:with-option use with an XPath expression Defining simple values for options, using an XPath expression, becomes tedious [for example, the need to use nested double (") and single (') quotation marks]. The syntactic shorthand (see Listing 5) was retained as the preferred method whereby options can be defined with name-value attributes on the step element itself. Listing 5. Setting an option with syntactic shorthand All these changes make the specification much clearer, but at the expense of a larger XProc vocabulary ( <p:variable>, <p:with-option>, <p:with-param>, and so on). One last significant change to mention is that you now must use <p:declare-step/> consistently to declare new steps. This change adds a slight cognitive load to users who now have to think about an instance of a step versus its declaration (in a library or pipeline). Overloading too many concepts onto the idea of what a single step element is in XProc might be potentially constraining. I think that the WG splitting up concepts now was a pragmatic decision. It's important for XML technologists to remind themselves that some families and phylum of developers do not work with XML. When someone from these groups asks, "Why do I need XProc?," my first response is usually that XProc is designed to be platform neutral, meaning that XProc can run everywhere a compliant XProc processor can run. However, if you already work with XML documents and technologies, XProc is probably something you have emulated with other approaches (XSLT, Apache Ant, Apache Cocoon site maps, Jelly, and so on), and you will be happy to see the arrival of XProc processors. Note: No implementations of XProc are production-ready, but several are in development. See Resources for more information. With XML seeping into every aspect and tier of computing, having a single, easy-to-understand processing approach like XProc to orchestrate one's expanding XML ecosystem might be a disruptive technology. The XProc Standard library, combined with the extensibility of writing your own third-party step libraries, provides a powerful facade over existing and future XML processors. Thus, rather than fit your workflows around the vagaries of any specific technology, you can now honestly define your processing as a series of operations on XML documents. XProc is expected to go into a second Last Call sometime in the coming months, which seems to indicate that you might see a W3C recommendation before the end of 2008. Learn - XML Pipeline Definition Language Version 1.0: W3C Note 28 February 2002: Read the note submitted by Sun Microsystems, Alis Technologies, Arbortext, Cisco Systems, Fujitsu, Markup Technology, and Oracle. - XML Processing Model Requirements: W3C Working Group Note 05 April 2004: Peruse the W3C WG Note from 05 April 2004. - XML Pipeline Language (XPL) Version 1.0 (Draft): Review the W3C Member Submission submitted by Orbeon on 11 March 2005 and published on 11 April 2005. - XProc: An XML Pipeline Language: Explore this W3C XProc Editors Draft (the W3C working draft dated 01 May 2008). - XProc: Section E. Guidance on Namespace Fixup: Review the non-normative list of suggestions for implementors to follow to reduce the need to fix up namespaces. - XProc: An XML Pipeline Language (with revision marks): Peruse the W3C Working Draft with differences dated 8 May 2008. - XML Processing Model Requirements and Use Cases: Read the W3C XProc requirements and use cases document dated 11 April 2006. - XML Pipeline Language (XPL) Version 1.0 (Draft): Check out this draft of the early W3C member submission of an XML pipeline language. - - List of XProc implementations: See XProc implementations currently undergoing development. - Smallx: Explore Smallx. It is, according to its developers, "a library and set of tools that is being developed to process XML infosets. It has two distinct features in that the infoset implementation allows streaming of documents and that processing of infosets can be accomplished using a concept called pipelines." - Sxpipe: Try Simple XML Pipelines (sxpipe) to build a simple processing model for XML documents and choose the order in which components are evaluated. - Apache Ant: Get more information about and download this Java™-based build tool. - Apache Cocoon: Download and get more information on this Web development framework built around the concepts of separation of concerns. - Jelly: Get the tool to turn your XML code into executable files. - IBM trial software for product evaluation: Build your next project with trial software available for download directly from developerWorks, including application development tools and middleware products from DB2®, Lotus®, Rational®, Tivoli®, and WebSphere®. Discuss - XProc Public Comment : Check out the W3C XProc public comments mailing list or view the archives. -<< Jim Fuller has been a professional developer for 15 years, working with several blue-chip software companies in both his native USA and the UK. He has co-written a few technology-related books and regularly speaks and writes articles focusing on XML technologies. He is a founding committee member for XML Prague and was in the gang responsible for EXSLT. He spends his free time playing with XML databases and XQuery. Jim is technical director for a few companies (FlameDigital, Webcomposite s.r.o.) and can be reached at jim.fuller@webcomposite.com.
http://www.ibm.com/developerworks/library/x-xproc/
crawl-002
refinedweb
3,312
53.1
Download presentation 1 B280F Introduction to Financial Management Lecture 6 Capital-Budgeting Decision Criteria By Charles Chiu, PhD, CFA 2 What is Capital Budgeting? The list of planned investment projects. Capital budgeting is the process of analyzing alternative long term investments and making long-term investment decisions. 3 About Capital Budgeting Decisions Outcome is uncertain. Large amounts of money are usually involved. Investment involves a long-term commitment. Decision may be difficult or impossible to reverse. Capital budgeting: Analyzing alternative long- term investments and deciding which assets to acquire or sell. 4 Types of Investment Decisions Selection decisions concerning proposed projects such as investments in long-term assets. i.e., property, plant, and equipment, or resource commitments in the form of new product development, market research, re-funding of long-term debt, and introduction of a computer. Replacement decisions such as replacement of existing facilities with new facilities. 5 Limited Investment Funds I will choose the project with the most profitable return on available funds. ? Plant Expansion New Equipment Office Renovation Limited Investment Funds 6 Decision Process Develop and rank all investment projects Authorize projects based on: Government regulation Production efficiency Capacity requirements NPV 4 7 Nonfinancial Considerations Employee working conditions Environmental concerns Corporate image Employee morale Product quality 8 How do we decide if a capital investment project should be accepted or rejected? 9 Decision-making Criteria in Capital Budgeting The ideal evaluation method should: include all cash flows that occur during the life of the project, consider the time value of money, and incorporate the required rate of return on the project. 10 Decision-making Criteria in Capital Budgeting Payback Period Discounted Payback Period Net Present Value (NPV) Profitability Index (PI) Internal Rate of Return (IRR) Modified Internal Rate of Return (MIRR) 11 Decision Rule All of these techniques attempt to compare the costs and benefits of a project The over-riding rule of capital budgeting is to accept all projects for which the cost is less than, or equal to, the benefit: Accept if: Cost £ Benefit Reject if: Cost > Benefit 12 Payback Period How long will it take for the project to generate enough cash to pay for itself? The payback period measures the length of time to recover the amount of initial investment. It is computed by dividing the initial investment by the cash inflows through increased revenues or cost savings. 13 Example initial investment cost $18,000 Assume: Cost of investment $18,000 Annual free cash flows $ 3,000 Payback period = initial investment cost $18,000 increased revenues or cost savings $ 3,000 = = 6 years Decision rule: Choose the project with the shorter payback period, because the shorter the payback period, the less risky the project, and the greater the liquidity. 14 Consider two projects whose free cash inflows are not even Consider two projects whose free cash inflows are not even. Assume each project costs $1,000. When cash inflows are not even, the payback period has to be found by trial and error. 15 The payback period of project A is 4 years. ($1,000 = $100 + $200 + $300 + $400 ) The payback period of project B is: ($1000 = $500 + $400 + $100) or The payback period of project B is 2.33 years. $100 $300 = 0.33 years. Project B is the project of choice in this case, since it has the shorter payback period. 16 Advantages Shortcomings It deals with cash flows rather than accounting profits and therefore focuses on the true timing of the project’s benefits and costs. It is simple to compute and easy to understand. It can be used as a rough screening device, eliminating projects whose returns do not materialize until later years. Shortcomings It ignores the time value of money. It does not consider any required rate of return It ignores the impact of cash inflows received after the payback period 17 Discounted Payback Period Discounts the cash flows at the firm’s required rate of return. Payback period is calculated using these discounted net cash flows. 18 Discounted Payback Period 1 2 3 4 5 (500) Discounted Year Cash Flow CF (14%) year 280.70 years 88.33 years 19 Net Present Value Net present value (NPV) is the excess of the present value (PV) of cash inflows generated by the project over the amount of the initial outlay (IO): Advantages It recognizes the time value of money. It is easy to compute whether the cash flows form an annuity or vary from period to period 20 Computation Choose a discount rate – the minimum required rate of return. Calculate the present value of cash inflows. Calculate the present value of cash outflows. NPV = - 21 Decision Rule General decision rule . . . 22 Foundation of the NPV Approach The market value of the firm is based on the present value of the cash flows it is expected to generate. Additional investments are “good” if the present value of the incremental expected cash inflows exceeds their cost. Thus, “good” projects are those which increase firm value - or, good projects are those projects that have positive NPVs! Conclusion - Invest only in projects with non-negative NPV. 23 Sources of NPV Economies of Scale Cost Advantages Product differentiation Distribution Advantage Regulatory Protection 24 Profitability Index (Benefit/Cost Ratio) The profitability index is the ratio of the total PV of future cash inflows to the initial investment This index is used as a means of ranking projects in descending order of attractiveness. Decision rule: If the profitability index is greater than or equal to 1.00, then accept the project. 25 Internal Rate of Return Internal rate of return (IRR) is defined as the rate of interest that equates I with the PV of future cash inflows. At IRR: NPV = 0 Decision rule: Accept the project if the IRR is greater than or equal to the required rate of return or hurdle rate. Otherwise, reject it. 26 1 2 3 (500) 200 100 (200) 400 300 0 1 2 3 4 5 Advantage Shortcoming IRR is a good decision-making tool as long as cash flows are conventional. ( ) Shortcoming If there are multiple sign changes in the cash flow stream, we could get multiple IRRs. ( ) (500) (200) 27 Mutually Exclusive Investments A project is said to be mutually exclusive if the acceptance of one project automatically excludes the acceptance of one or more other projects. In the case where one must choose between mutually exclusive investments, the NPV and IRR methods may result in contradictory indications. 28 Contradictions May Occur When Projects that have different life expectancies. Projects that have different sizes of investment. Projects whose cash flows differ over time. For example, the cash flows of one project increase over time, while those of another decrease. 29 Causes for Contradiction The contradictions result from different assumptions with respect to the reinvestment rate on cash flows from the projects. The NPV method discounts all cash flows at the cost of capital, thus implicitly assuming that these cash flows can be reinvested at this rate. The IRR method implies a reinvestment rate at IRR. Thus, the implied reinvestment rate will differ from project to project. The NPV method generally gives correct ranking, since the cost of capital is a more realistic reinvestment rate. 30 Modified Internal Rate of Return (MIRR) IRR assumes that all cash flows are reinvested at the IRR. MIRR provides a rate of return measure that assumes cash flows are reinvested at the required rate of return. 31 MIRR Steps Calculate the PV of the cash outflows. Using the required rate of return. Calculate the FV of the cash inflows at the last year of the project’s time line. This is called the terminal value (TV). MIRR: the discount rate that equates the PV of the cash outflows with the PV of the terminal value, ie, that makes: PVoutflows = PVinflows 32 Example Suppose we are considering investing in an asset that yields $1000 in year one, $1100 in year two, $1500 in year three and $3200 in year four. If your required rate of return is 12%, and the asset costs $5000, determine the IRR and MIRR. $4000 = $1000/(1+IRR) + $1100/(1+IRR)2 + $1500/(1+IRR)3 + $3200/(1+IRR)4 IRR = 20.09% 33 To find the Modified IRR $4000 = [$1000(1.12)3 + $1100(1.12)2 + $1500(1.12) + $3200]/(1 + MIRR)4 $4000 = [$ $ $1680 +$3200] /(1 + MIRR)4 $4000(1 + MIRR)4 = $7665 (1 + MIRR) = MIRR = 17.66% 34 Importance of Capital Budgeting Capital budgeting is probably the most important issues in corporate finance Identifying investment opportunities which offer more value to the firm than their cost - the value of the future cash flows need to be greater than the investment required estimating the size, timing and risk of future cash flows is the most challenging aspect of capital budgeting Similar presentations © 2019 SlidePlayer.com Inc.
http://slideplayer.com/slide/3824386/
CC-MAIN-2019-35
refinedweb
1,481
51.68
Key Takeaways - The Java Shell or JShell is an official Read-Evaluate-Print-Loop, or REPL as it's commonly called, introduced with Java 9. - JShell provides an interactive shell for quickly prototyping, debugging, and learning Java and Java APIs, all without the need for a public static void mainor the need to compile your code before executing it. - JShell just got a whole lot less verbose (and more practical) with the advent of the ' var' keyword in Java 10 - In this article, we’ll take a comprehensive look at JShell, understanding all its commands, its uses, and how to use it most effectively. - JShell is extremely good at providing immediate feedback. It might not seem like much but all those little things (like compiling or running unit tests in my IDE) really do add up over time. What is JShell? The Java Shell or JShell is an official Read-Evaluate-Print-Loop, or REPL as it's commonly called, introduced with Java 9. It provides an interactive shell for quickly prototyping, debugging, and learning Java and Java APIs, all without the need for a public static void main or the need to compile your code before executing it. And as an added plus, using JShell just got a whole lot less verbose (and more practical) with the advent of the var keyword in Java 10! Getting Started Note: We'll be using Java 10 in this guide to take advantage of the var keyword, so make sure you have at least Java 10 installed to follow along throughout this guided tour. JShell is easily started by typing jshell at the command-line. You'll be presented with a welcome message and shell waiting for you to input commands or any valid Java expression. $ jshell | Welcome to JShell -- Version 10.0.2 | For an introduction type: /help intro Let's execute our first command. At the shell prompt, type var greeting = "hello" and press <enter>. You should see output like below jshell> var greeting = "hello" greeting ==> "hello" You'll notice that it echos the value of greeting, confirming that the value is now equal to hello. You may have also noticed that you didn't need to end the expression with a semicolon. A small but nice feature! In order to complete our greeting, we need an audience. Type var audience = and press <enter>. This time, JShell recognizes that you're not finished with your expression and allows you to continue on the next line. Finish your expression by typing "world" followed by <enter>. Just like before, JShell echoes the value confirming that it's been set. jshell> var audience = ...> "world" audience ==> "world" Tab Completion One of the first things you'll notice is the nicely integrated tab completion. Let's concatenate our greeting and audience Strings into a new variable called saying. Start by typing var saying = gr and then press <tab>. You'll see that the greeting variable is automatically completed. Do the same with the audience variable and press enter to see the result of the concatenation. jshell> var saying = gr<tab> + aud<tab> saying ==> "helloworld" valid possible methods that start with to jshell> saying.to<tab> toCharArray() toLowerCase( toString() toUpperCase( Methods with potential arguments are shown with an open parenthesis whereas methods that take no arguments are shown with closed parenthesis. Errors If you happen to make a a mistake or enter an invalid expression, method, or command, JShell provides you with immediate feedback by displaying an error and underlining the problem. jshell> saying.subString(0,1) | Error: | cannot find symbol | symbol: method subString(int,int) | saying.subString(0,1) | ^--------------^ Method Signatures Let's finish calling the toUpperCase( method but hold off on adding any additional arguments or ending it with a parenthesis. Instead, press <tab> an additional time. This time, you'll see all the available method signatures for the toUpperCase method; one with a Locale argument and one without any arguments. jshell> saying.toUpperCase( Signatures: String String.toUpperCase(Locale locale) String String.toUpperCase() <press tab again to see documentation> Documentation (JavaDoc) If you press <tab> for a third time, you'll see the JavaDoc documentation for the toUpperCase(Locale) method jshell> saying.toUpperCase( String String.toUpperCase(Locale locale) Converts all of the characters in this String to upper case ... (shortened for brevity) Continue pressing <tab> to cycle through all of the available method signatures and their associated documentation. Imports Instead of just hello world, let's expand our example to other audiences like the Universe or Galaxy. Start by creating a List called audiences with three different audiences: world, universe and galaxy. You can do this with a single snippet using the List's constructor and the static factory method List.of introduced in Java 9. jshell> var audiences = new ArrayList<>(List.of("world", "universe", "galaxy")) audiences ==> [world, universe, galaxy] Notice that you didn't have to refer to ArrayList using it's Fully Qualified Class Name (FQCN), nor did you have to import the java.util package! That's because, by default, JShell automatically starts with a number of predefined imports to save you the hassle importing commonly used packages or having to type the FQCN. Below is a list of the default imports java.io.* java.math.* java.net.* java.nio.file.* java.util.* java.util.concurrent.* java.util.function.* java.util.prefs.* java.util.regex.* java.util.stream.* As you'd expect, you can also define your own imports if needed, by typing import <pkg_name> where <pkg_name> is a valid package on the classpath. Methods Now let's define a method called getRandomAudience to pick one of our audiences at random. The method will take a List<String> of audiences and return a random audience from the list. You can start defining your method right at the command line, as if you were defining a method as part of a class, however, there's no need to define a class! jshell> public String getRandomAudience(List<String> audiences) { ...> return audiences.get(new Random().nextInt(audiences.size())); ...> } | created method getRandomAudience(List<String>) If everything goes right, JShell will echo that it successfully created the method for you and it's available for use. Let's try out the method by calling it and passing our list of audiences. Call it a few times to ensure you get different results each time. jshell> getRandomAudience(audiences) $7 ==> "world" jshell> getRandomAudience(audiences) $8 ==> "universe" jshell> getRandomAudience(audiences) $9 ==> "galaxy" One interesting thing to note is that in the method body, you can reference any previously defined variables as well as yet-to-be-defined variables (more on this shortly).you can reference any previously defined variables as well as yet-to-be-defined variables (more on this shortly). Let's create another version of the getRandomAudience method that takes no arguments and directly uses our audiences list within the body of the method. jshell> public String getRandomAudience() { ...> return audiences.get(new Random().nextInt(audiences.size())); ...> } | created method getRandomAudience() Again, let's try it out a few times jshell> getRandomAudience() $10 ==> "galaxy" jshell> getRandomAudience() $11 ==> "world" jshell> getRandomAudience() $12 ==> "galaxy" As I mentioned before, methods can also utilize yet-to-be-defined variables. Let's define a new method called getSeparator that returns a value we can use to separate words. However, this time we'll reference an undefined variable called wordSeparator. jshell> public String getSeparator() { ...> return wordSeparator; ...> } | created method getSeparator(), however, it cannot be invoked until variable wordSeparator is declared Notice that JShell creates our getSeparator method but tells us that it can't be used until we declare or define the wordSeparator variable. Any attempts to call it will result in a similar error message. jshell> getSeparator() | attempted to call method getSeparator() which cannot be invoked until variable wordSeparator is declared Simply define the wordSeparator variable as a space and try calling it again. jshell> var wordSeparator = " " wordSeparator ==> " " jshell> getSeparator() $13 ==> " " One important thing to note is that you cannot create "top-level" static methods. If you do so, you'll receive a warning message telling you that the static keyword was ignored. jshell> public static String foobar(String arg) { ...> return arg; ...> } | Warning: | Modifier 'static' not permitted in top-level declarations, ignored | public static void foobar(String arg) { | ^-----------^ Scratch Variables In addition to variables which you explicitly declare and define, JShell automatically creates variables for any unassigned expressions. You may have already noticed these variables, called scratch variables, when calling the getSeparator and getRandomAudience methods from the previous section. Scratch variables follow a common pattern, starting with a dollar sign, and an incrementally increasing number. You can refer to them just as you would any other variable. For instance, let's call the getRandomAudience method again and utilize the result as an argument to System.out.println jshell> getRandomAudience() $14 ==> "galaxy" jshell> System.out.println($14) galaxy Classes You create classes in JShell just like create methods, typing them, line-by-line until the class is complete. JShell then notifies you that it created the class. jshell> public class Foo { ...> private String bar; ...> public String getBar() { ...> return this.bar; ...> } ...> } | created class Foo Creating classes (and methods) in JShell can be painful. There's no formatting and making an error can be frustrating since you won't know you've made an error until you complete the class. For a better way to create classes, check out the /open command in the section on JShell Commands. External Libraries By now, having learned the basics of JShell, you're likely wondering how you can use JShell with external libraries (jars) such as an internal company library or a common library like Apache Commons. Luckily, it's quite easy to do. You simply start JShell with a --class-path argument. The argument utilizes the standard classpath format with separators. $ jshell --class-path /path/to/foo.jar JShell Commands Up to this point, we've only utilized Java expressions, but JShell also comes with a number of built in commands. Let's switch gears and explore the available commands in JShell. To see the list of all possible commands, type /help at the prompt. Note that tab completion also works on commands. jshell> /help | Type a Java language expression, statement, or declaration. | Or type one of the following commands: | /list [<name or id>|-all|-start] | list the source you have typed | /edit <name or id> | edit a source entry | /drop <name or id> | delete a source entry (shortened for brevity) If you want to learn more about a particular command you can type /help <command>, replacing <command> with the name of the command. jshell> /help list | | /list | ===== | | Show the snippets, prefaced with their snippet IDs. Let's take a look at some of the most useful commands The List Command The /list command outputs all of the previously typed snippets, with a unique identifier called the snippet ID. jshell> /list 1 : var greeting = "hello"; 2 : var audience = "world"; 3 : var saying = greeting + audience; 4 : saying.toUpperCase() By default, the output does not contain any snippets which resulted in an error. Only valid statements or expressions are shown. To see all previously typed code, including errors, you can pass the -all argument to the /list command. s1 : import java.io.*; s2 : import java.math.*; s3 : import java.net.*; (shortened for brevity) s10 : import java.util.stream.*; 1 : var greeting = "hello"; 2 : var audience = "world"; 3 : var saying = greeting + audience; 4 : saying.toUpperCase() e1 : var thisIsAnError The output will contain any startup code (more on this later) as well as any valid or invalid snippets. JShell concatenates a prefix to each snippet ID depending on the type of snippet it is. Here's a quick way to determine the meaning of each: s: Snippet IDs beginning with an s are startup code. e: Snippet IDs beginning with an e are snippets which resulted in an error. - Snippet IDs without a prefix are valid snippets. The Vars, Methods, Types, Imports, and Reset Commands JShell comes with a number of commands that help you examine the current state, or context, of your shell. They're all appropriately named and straightforward but we'll include them here to be thorough. You use the /vars to examine all declared variables and their values. jshell> /vars | String greeting = "hello" | String audience = "world" | String saying = "helloworld" You use the /methods command to list all declared methods and their signatures. jshell> /methods | String getRandomAudience(List<String>) | String getRandomAudience() You use the /types command to list all type declarations. jshell> /types | class Foo You use the /imports command to list all of the currently declared imports. jshell> /imports | import java.io.* | import java.math.* | import java.net.* (shortened for brevity) And lastly, you use the /reset command to reset and clear all state including variables, methods, and types. jshell> /reset | Resetting state. jshell> /vars (no variables exist after reset) The Edit Command /edit is utilized to edit previously typed snippets. The edit command works on all types of snippets including valid, invalid, and startup snippets. It's particularly useful for editing multi-line snippets which resulted in an error, preventing you from having to re-type everything. Earlier in this article, when the greeting and audience variables were concatenated into the saying variable, a space between "hello" and "world" was missed. You can fix that by typing /edit and then the snippet ID to edit. The JShell Edit Pad will pop up and allow you to make any needed modifications. You can also use the name of the variable instead of the snippet id. jshell> /edit 3 (... new JShell Edit Pad window opens ...) jshell> /edit saying (... new JShell Edit Pad window opens ...) Once you're finished with your edits, you can click on the Accept button and JShell will re-evaluate the edited snippet. If the re-evaluated snippet doesn't contain any errors, your edited snippet will be assigned a new snippet ID. You can also edit multiple snippets at once by passing a range or multiple IDs to the /edit command. jshell> /edit 1-4 (... new JShell Edit Pad window opens with snippets 1 through 4 ...) jshell> /edit 1 3-4 (... new JShell Edit Pad window opens with snippets 1 and 3 through 4 ...) The Drop Command /drop is utilized to delete any previous snippet. Instead of editing a line, you can also choose to completely delete it using the /drop command. It works in the same way the edit command does where you can use a snippet ID, a variable, a range, or a combination of the former as arguments. jshell> /drop 3 | dropped variable $3 jshell> /drop saying | dropped variable saying jshell> /drop 3-4 | dropped variable saying | dropped variable $4 The Save Command /save allows you to save the output of previously typed snippets to a file. In addition to the filename to save the output to, the /save command also takes additional arguments to indicate which snippets IDs to save. It utilizes the same form as the /edit and /drop commands and comes before the filename argument. If you don't include any snippet IDs, all previously typed snippets are saved. jshell> /save output.txt jshell> /save 3-4 output.txt The combination of the /save and /open command (below) can be useful for saving the current session and restoring it at a later time. To save your current session, including all errors, call the /save command with the -all argument. jshell> /save -all my_jshell_session.txt The Open Command The /open command opens any previously saved output and re-evaluates it (including errors!) jshell> /open my_jshell_session.txt JShell also comes with a few pre-defined "file names" that you can use for convenience. DEFAULT- a file containing the default import snippets PRINTING- a file containing a number of pre-defined print methods JAVASE- a file containing imports for all of the Java SE packages () For instance, if you don't want to have to use System.out.println every time to print something, you can open the PRINTING file which defines a number of shortcut methods, one of which is called jshell> /open PRINTING jshell> print("hello") hello Common and Effective Uses In order to get the most out of JShell, you should understand some of its common and most effective uses. JShell is an extremely useful tool for - Learning and improving your knowledge of the Java Language - Exploring or discovering new APIs both inside and outside of the JDK - Quickly prototyping an idea or concept Using JShell for Learning We all have areas of Java that we could improve upon. Whether it be Generics or the multi-threading, JShell can be a very effective tool for learning. What makes JShell such a great tool for learning is that it provides you with an constant feedback loop. You enter a command and it tells you the result. It's as simple as that. And although it's simple, it's effective. It allows you to "move fast and break things", as the saying goes. Using JShell for Discovery and Exploration The Java Language is continually evolving and adding new APIs (at an even faster rate than has been witnessed in the past). For instance, consider the Streams API introduced in Java 8. This was a significant addition to the JDK. There's a LOT to explore. But by no means was the Streams API complete in Java 8. The Streams API is an API that's continually evolving and both Java 9 and Java 10 have added new features and functionality. Consider using JShell next time you want to explore new features in Java. Quickly Prototyping with JShell We've all had situations where we needed to prototype an idea. In those cases, you usually find yourself creating a new test project, writing a JUnit test, or writing a simple Java class with a main method. It's a bit of a ceremony and in reality, it's a bit cumbersome! JShell can be a very effective tool for testing out new ideas. Instead of writing a unit test or a simple Java class with a main method, you can utilize JShell, either directly at the command-line or via the /open command and a pre-written file. With JShell, some of the things you don't need to do are: - Compile your code - Name classes and files the same - Have multiple source files or nested / inner-classes And, in the end, all of this equates to faster "idea translation". Tips for Using JShell Command-line Tips JShell utilizes JLine2 to power the command-line. It's a Java equivalent of GNU ReadLine that allows you to edit or navigate commands typed on your command-line. All modern shells such as Bash use it (it's also why you can't type CTRL-V to paste into a shell). That means that JShell has some pretty powerful "shortcuts". Here are some of the commonly used ones: CTRL-A- Move the cursor to the start of the current line CTRL-E- Move the cursor to the end of the current line ALT-F- Move forward a word ALT-B- Move backwards a word CTRL-K- Cut forwards to the end of line CTRL-U- Cut backwards to the first of the line CTRL-W- Cut the word before the cursor to the clipboard CTRL-Y- Paste the last item from the clipboard CTRL-R- Search backwards through history CTRL-S- Search forwards through history Classpath Tips When you're loading external libraries, having to type out the full classpath can be burdensome. You can instead change to the current directory of where all your external libraries are located and start jshell from that directory, utilizing an asterisk (surrounded by quotes) to include all jars. This works on all OSes. $ jshell --class-path "*" The same command also works with paths. This also works on all OSes. $ jshell --class-path "libs/*" Another nice tip: if you've already typed a number of commands but forgot to set the classpath when you started JShell, you can also utilize the /env command to set the classpath. jshell> /env --class-path foo.jar | Setting new options and restoring state. Time-saving Tips You can save yourself a lot of time by maintaining a dedicated directory of commonly used libraries, commands, or snippets for JShell. For starters, you can fork my example repo at Github In that repo, you'll find several folders: - imports - libs - startups - utils Let's take a look at each. Imports This directory contains predefined, commonly used imports. You'll find as you use JShell more and more that it becomes quite painful to have to retype a bunch of import statements when you want to use or experiment with a particular external library. Instead, you can save all the necessary import statements into a file and then utilize the /open command to bring them in. The level of granularity at which you define your import files is up to you. You can choose to define them on a per-library basis (e.g. guava-imports) or a per project basis (e.g. my-project-imports), or whatever works best for you. jshell> /open imports/guava-imports jshell> /imports (shortened for brevity) | import java.util.stream.* | import com.google.common.collect.* Libs This directory is pretty self-explanatory and contains any and all external libraries that you might use with JShell. You can choose to organize your libraries in whatever fashion makes the most sense, whether it's all in one directory or on a per-project basis. Whatever your organization strategy is, having all your external libraries organized in an easily loadable way will save you time in the end, as we saw in the Classpath Tips section. Startups You can utilize this directory to store any startup or initialization code. This is a feature that's directly supported by JShell with the --startup parameter. $ jshell --startup startups/custom-startup ##################### Loaded Custom Startup ##################### | Welcome to JShell -- Version 10.0.2 | For an introduction type: /help intro jshell> These files are similar, in nature, to the type of files located in the imports directory but they go beyond just imports. These files are meant to contain any necessary commands, imports, snippets, methods, classes, etc needed to initialize your JShell environment. If you're familiar with Bash, startup files are a lot like your .bash_profile file. Utils We all know how verbose Java can be. This directory, as it's aptly named, is meant to contain any utility or "shortcut code", that will make your time spent with JShell more enjoyable. The type of files you would store here are very similar to the special PRINTING file that comes with JShell, which defines a number of shortcut methods for printing text. For example, if you're working with large numbers a lot, you'll quickly get tired of having to type new BigInteger for every number you want to add, multiple, subtract, etc. You can, instead, create a util file that contains helper or shortcut methods to reduce the verbosity. jshell> /open big-integer-utils jshell> var result = add(bi("123456789987654321"),bi("111111111111111111")) result ==> 234567901098765432 My Journey with JShell Admittedly, when I first heard about JShell, I didn't think much of it. I had already used REPLs from other languages and thought of it more as a "toy" than a tool. However, the more I played with it and used it, the more I realized its utility and how it could be useful to me. For me, I find JShell most helpful for learning new language features, improving my understanding of existing features, debugging code, and experimenting with new libraries. One thing I've learned throughout my career in development, is that anything I can do to shorten my feedback loop, the better. It's how I operate and learn best. And I've found that JShell is extremely good at shortening that feedback loop. It might not seem like much but all those little things (like compiling or running unit tests in my IDE) really do add up over time. I hope you'll discover the utility of JShell and enjoy it as much as I do! I would love to hear your comments, thoughts, or experiences with JShell. Please do reach out! About the Author Dustin Schultz is a Pluralsight Author, a Principal Software Engineer, and a technology evangelist at heart. He has a true passion for software engineering with over 15 years of experience developing enterprise applications for corporations and startups. He holds a Bachelors and a Masters degree in Computer Science and loves learning. You can learn more about him on his blog. Community comments Using JShell as script by Hans-Peter Störr / Re: Using JShell as script by Dustin Schultz / Using JShell as script by Hans-Peter Störr / Your message is awaiting moderation. Thank you for participating in the discussion. Thank you for your nice article! One question. JShell seems to me a nice way to write some tools of small to medium complexity (where the source comfortably fits into one file). Do you have some recommendations how to use it this way? Unfortunately that doesn't seem to be a use case Oracle envisioned, so it seems to be surprisingly difficult to start jshell from the script file itself (what normally the shebang line does), and it seems horrifyingly difficult to pass arguments to the script - I've found only completely weird solutions so far: stackoverflow.com/a/54244508/21499 :-( Re: Using JShell as script by Dustin Schultz / Your message is awaiting moderation. Thank you for participating in the discussion. I think you nailed it: "that doesn't seem to be a use case Oracle envisioned". Here's a little more insight: mail.openjdk.java.net/pipermail/kulla-dev/2016-...
https://www.infoq.com/articles/jshell-java-repl/
CC-MAIN-2020-16
refinedweb
4,300
62.78
Mocking, Patching, Stubbing: all that Stuff What Approach to Mocking in Tests do You Take? Follow my exploration of living a spiritual life and finding the kingdom at Unpolished Musings. Contents Testing and Mocking I've been thinking about mocking. We do a lot of testing in Resolver. Resolver is a client application, but we also have a server product. We do unit testing, functional testing and some through the web testing with Selenium. This doesn't make me an expert on testing of course, you need experience on a wide range of projects in lots of different situations before you can claim that. Luckily Resolver has people with a lot more testing experience than me. Coincidentally our latest hire, Glenn Jones, has just come from a job programming in C++, Java and a VB like scripting languages for a cellphone testing platform. That's a very different kind of testing. Doing a lot of unit testing with a dynamic language, we end up doing a lot of 'mocking'. That is creating small objects with a specific interface to mimic a production object. We mock to decouple tests from other parts of our production code, to test with .NET objects that may be hard to construct [1], and to be able to make assertions about how the unit under test interacts with other objects. To give you a concrete example, suppose we have a method that recives an object and closes it. We want to be able to tell whether our method (the closer) has called close on the object we pass in. We might write a unit test like this: class MockSomething(object): closed = False def close(self): self.closed = True real = ProductionClass() mock = MockSomething() real.closer(mock) self.assertTrue(mock.closed, "closer didn't close something") If we have a method that calls another method on the same class, then we might patch out that method with something that will let us know that it has been called. We might write a unit test like this: called = [] def patch(): called.append(True) real = ProductionClass() real.something = patch real.method() self.assertEquals(called, [True], "method didn't call something") Because our patch function can't assign to a variable in the scope of the test method, we have to use the 'list trick' to track that something was called. This is a little ugly, and instead we could patch out something with a callable object (a Listener perhaps) that will track if it has been called. The test would then look like: real = ProductionClass() real.something = Listener() real.method() self.assertTrue(real.something.called, "method didn't call something") So the listener class we used above is really a 'mock method'. Martin Fowler would prefer that I didn't call these objects mocks, but instead call them stubs: Mocking Libraries Respectfully I disagree with him, MockSomething is a mock object dammit! Instead Martin describes a mocking pattern which is implemented in various mocking libraries for Java, Python and probably other languages. The pattern is that you first record your expectations on the mock, then you replay and verify that the expectations were met. A new Python library called mocker is a classic implementation of this. An example from the docs: >>> mock = mocker.proxy(greeting) >>> mock.hello("Jeff") >>> mocker.result("Hello Jeff!") >>> mock.hello("Jim") >>> mocker.passthrough() >>> mocker.replay() >>> mock.hello("Jim") 'Hi Jim!' >>> mock.hello("Jeff") 'Hello Jeff!' The object under test is the Greeting class. The mock wraps the greeting class, you record a series of actions and then call replay. If the subsequent actions don't meet the actions you recorded then you will get an AssertionError. At Resolver we don't use a mocking library. There are two reasons for this. The first is that mocks (I mean stubs...) are so damn easy to write! The second is that the general consensus amongst the Resolver developers is that the 'record -> replay' pattern is backwards and less intuitive than the more 'normal' action and assertion pattern. In fact, what I call the 'action -> assert' pattern is more properly 'setup -> action -> assertion'. For any one unit (function / method / class), we will probaby have several tests - each testing a specific aspect of behavior. For example these might be testing normal behaviour, corner cases, and error conditions (etc). Each one will be a separate test. So for each test we setup the initial conditions, perform the actions and then make an assertion about the behaviour. The pattern described by Martin merges the initial setup with 'defining the expectations' - which I think makes it less clear what you are actually testing. It is nice to be able to say - for these conditions we expect this action to behave in this way. The 'setup - > action -> assertions' pattern makes this all explicit, whereas 'expectations -> verification' makes it less clear (in my opinion). Additionally let's look at a simple testing example that doesn't require any mocks. You want to test that calling set_property with an argument sets the right attribute: real = ProductionClass() value = object() real.set_property(value) self.assertEquals(real.property, value, "set_property didn't work") A lot of your tests are going to look like this. You perform an action and then assert that the action did the right thing. If we use a mocking library for some of our tests then we will end up with a mix of testing patterns. This aside, I still find the 'replay' pattern less readable - and test readability is important. (In Behavior Driven Development, an offshoot of Test Driven Development, your tests are a specification of your code.) A further issue is that when recording expectations you will have to (usually) record every step. For individual tests, it may only be one detail that you are interested in. You should only make assertions that are specific to the test rather than having to record every step. So at Resolver we are still writing an awful lot of trivial mocks. Is there a simple mocking library that could help us? minimock comes the closest. It follows the right pattern, but is designed for use with doctest, which we don't use. The Mock Module As is the way with Python, it turns out that you can create the start of something useful in less that fifty lines of code. I've created a new mocking library (just what the world needs - hey at least it isn't a web framework). It doesn't make the assertions for you, but records how it is used: so that you can make assertions afterwards. The core class is Mock. It is callable and records arguments it is called with. It provides __getattr__, so that accessing arbitrary attribtues / methods will also return a Mock object (the same object every time for the same attribute). Calls to methods are recorded on the parent object and the child. __setattr__ isn't provided, so that you can set arbitrary attributes if you need to. Lets look at a couple of examples: Mock Patching Methods Mock is callable. If it is called then it sets a called attribute to True. This example tests that calling method results in a call to something: real = ProductionClass() real.something = Mock() real.method() self.assertTrue(real.something.called, "method didn't call something") If you want to catch the arguments then there is other information exposed:. Mock for Method Calls on an Object real = ProductionClass() mock = Mock() real.closer(mock) self.assertTrue(mock.close.called, "closer didn't close something") We don't have to do any work to provide the 'close' method on our mock. Accessing close ceates it. So, if 'close' hasn't already been called then accessing it in the test will create it - but called will be False. As close is a mock object is has all the attributes from the previous example. Limiting Available Methods The disadvantage of the approach above is that all method access creates a new mock. This means that you can't tell if any methods were called that shouldn't have been. There are two ways round this. The first is by restricting the methods available on your mock. real = ProductionClass() methods = ['close'] mock = Mock(methods) # methods=methods is equivalent real.closer(mock) self.assertTrue(mock.close.called, "closer didn't close something") If closer calls any methods on mock other than close, then an AttributeError will be raised. Tracking all Method Calls An alternative way to verify that only the expected methods have been accessed is to use the method_calls attribute of the mock. This records all calls to child attributes of the mock - and also to their children. This is useful if you have a mock where you expect an attribtue method to be called. You could access the attribute directly, but method_calls provides a convenient way of looking at all method calls: >>> mock.method() >>> mock.Property.method(10, x=53) >>> mock.method_calls [('method', (), {}), ('Property.method', (10,), {'x': 53})] >>> If you make an assertion about method_calls and any unexpected methods have been called, then the assertion will fail. Limitations There are various disadvantages and things that this class doesn't (yet) do. - It doesn't wrap objects. If you need to pass calls through to the real object and record them then you can't yet do that. - You can specify return values, but they are fixed values. You may want to provide a factory function to provide a sequence of return values for example. - Mock has several attributes. This makes it unsuitable for mocking objects that use these attribute names. A way round this would be to provide start and stop (or similar) methods that hide these attributes when needed. - It doesn't provide any facilities for patching on classes (rather than instances), modules or built-ins. These are all patching that has to be undone after the test is complete because otherwise the patch would persist. At Resolver we use a decorator pattern for this kind of patching which is very useful. With Resolver's permission I will make these available too. For buying techie books, science fiction, computer hardware or the latest gadgets: visit The Voidspace Amazon Store. Last edited Tue Aug 2 00:51:34 2011. Counter...
http://www.voidspace.org.uk/python/articles/mocking.shtml
CC-MAIN-2017-04
refinedweb
1,706
65.01
web components to list (and send) events in a matrix chat room (npm). usageusage <script type="module" src=""></script> <matrix-room-element By default, a "public matrix room", will only show the room's sate (title, alias, topic...). If you want to show the events of the room, add the show-context="true" attribute, on the matrix-room-element. examplesexamples - see example in ./index.html - see implementation on profile pages (view source code) installation/importinstallation/import The project is distributed within this git repository, and is also published as a NPM package (see .gitlab-ci.yml file). from a CDN (that imports from NPM)from a CDN (that imports from NPM) - First import the script in javascript (module) file. import('') - Reference the <matrix-room-element>in your HTML file <matrix-room-element<matrix-room-element/> - Use the DOM elements to style the component(s) with CSS with NPMwith NPM With npm: npm i --save @sctlib/matrix-room-element. import '@sctlib/matrix-room-element/index.js' Then you can use the Custom elements in your HTML. ElementsElements All elements can accept attributes that define its behavior. All calls to Matrix APIs need a user to be authenticated. If no user is authenticated a "guest user" is automatically created for the user. For missing attributes and documents, check the files in ./js, for each component. It should be consice and clear enough to get an idea of what each component can do <matrix-room-element> Displays the content of a matrix room. profile-id (required) string='' The id or alias of a matrix room, prefixed with #, and it should also include the server part :server.tld of the room. event-id string='' A matrix ID of an event. Specifying an event-id, will only display this event in the room. It is not necessary to specify show-context, to only show one event. Adding show-context will render the "load before" (in time) and "load after" (in time), buttons, at the top/bottom of the element's event list. origin string='' The origin is the base URL (as in new URL('')), used to create links to content on the matrix element Example: show-event-info boolean=false Should each event show some information, such as the date of the event. show-event-actions boolean=false Should each event show some actions, such as a share, redact/edit event (if the user is logged in and the sender of the event). show-context boolean=false Should we show the room's context? show-send-event boolean=false Should the element show a form to send events to the room. It will only show if there is a logged in user (see matrix-login element), and if the user has joined the room. It renders a <matrix-send-event>, setup for sending into this room, as the logged in user. send-event-types array=['m.room.message'] A list of events the matrix-send-event is allowed to send. show-space-children boolean=false Should the element also display Matrix spaces that are children of the space specified in the profile-id. flag-sanitizer boolean=false Only set to true if the browser/platform has support for the window.Sanitizer api. - Docs: - Sanitizer polyfill: See the index.html file on how to import one. context-limit number=10 If show-context is true, how much element are fetched by the context API when lcicking the "load before/after" context button. filter object={types, not_types, ...} Filters ( types and not_types), as specified in Matrix EventFilter API, for the /messsages and /context endpoints. By default, it is set to: { types: ['m.room.message', 'org.libli.room.message.track'], not_types: [ 'm.room.redaction', 'm.room.member', 'libli.widget', 'im.vector.modular.widgets', 'im.vector.modular.widgets.libli.widget', 'm.reaction', 'm.room.history_visibility', 'm.room.power_levels', 'm.room.name', 'm.room.topic', 'm.space.child', 'm.room.avatar', ] } <matrix-event> <matrix-auth> <matrix-login> <matrix-logout> <matrix-joined-rooms> <matrix-join-room> <matrix-send-event> <matrix-create-room> <matrix-edit-room> DevelopmentDevelopment The project does not need any development tools, as it is vanilla Javascript, HTML and CSS. The same way, no build tools are needed, and the proejct is deployed and used unminified. The easiest way to explore the project, is to: - clone repo - open index.htmlin a browser Alternativelly, for development convenience: yarnto install the development dependenceis yarn developto start the local developemnt server Development notesDevelopment notes The project does not use the Matrix official SDK, but a custom one available in the file ./js/api.js. productionproduction CI/CD is defined in .gitlab.ci gitlab pagegitlab page The gitlab page is auto deployed when pushin on main, from the pages job npm package @sctlib/matrix-room-element - bump package.json version, e.g: 0.0.1 - publish a new gitlab tag (in GUI), v0.0.1 - check the CI/CD pipelines for the publishjob docsdocs - - -- how to post in a room (with element.io)how to post in a room (with element.io) - create a matrix user account, or log into your existing one (using any matrix client). Your account can be on the server matrix.org, or any other (thanks to decentralization through federation) - create a public chat room, and give your room an alias of the form: #my-room:my-server.com (look in the room settings, you can also have many aliases, and also invite/restrict cooperators to your channel) - update the room settings, so that only "moderators" can post mesages (make it fit your multi/single user(s) cooperation usage). - In the room's settings, set: "Who can read history?" to "Anyone". Now, new messages will be available on libli's visitors. - start posting/uploading images in the chat room
https://www.npmjs.com/package/@sctlib/matrix-room-element
CC-MAIN-2022-33
refinedweb
959
56.05
Table Of Contents Kivy Basics¶ Installation of the Kivy environment¶ Kivy depends on many Python libraries, such as pygame, gstreamer, PIL, Cairo, and more. They are not all required, but depending on the platform you’re working on, they can be a pain to install. For Windows and MacOS X, we provide a portable package that you can just unzip and use. Have a look at one of these pages for detailed installation instructions: Alternatively, instructions for the development version can be found here: installation Create an application¶ Creating a kivy application is as simple as: sub-classing the Appclass implementing its build()method so it returns a Widgetinstance (the root of your widget tree) instantiating this class, and calling its run()method. Here is an example of a minimal application: import kivy kivy.require('1.0.6') # replace with your current kivy version ! from kivy.app import App from kivy.uix.label import Label class MyApp(App): def build(self): return Label(text='Hello world') if __name__ == '__main__': MyApp().run() You can save this to a text file, main.py for example, and run it. Kivy App Life Cycle¶ First off, let’s get familiar with the Kivy app life cycle. As you can see above, for all intents and purposes, our entry point into our App is the run() method, and in our case that is “MyApp().run()”. We will get back to this, but let’s start from the third line: from kivy.app import App It’s required that the base Class of your App inherits from the App class. It’s present in the kivy_installation_dir/kivy/app.py. Note Go ahead and open up that file if you want to delve deeper into what the Kivy App class does. We encourage you to open the code and read through it. Kivy is based on Python and uses Sphinx for documentation, so the documentation for each class is in the actual file. Similarly on line 5: from kivy.uix.label import Label One important thing to note here is the way packages/classes are laid out. The uix module is the section that holds the user interface elements like layouts and widgets. Moving on to line 8: class MyApp(App): This is where we are defining the Base Class of our Kivy App. You should only ever need to change the name of your app MyApp in this line. Further on to line 10: def build(self): As highlighted by the image above, show casing the Kivy App Life Cycle, this is the function where you should initialize and return your Root Widget. This is what we do on line 11: return Label(text='Hello world') Here we initialize a Label with text ‘Hello World’ and return its instance. This Label will be the Root Widget of this App. Note Python uses indentation to denote code blocks, therefore take note that in the code provided above, at line 12 the class and function definition ends. Now on to the portion that will make our app run at line 14 and 15: if __name__ == '__main__': MyApp().run() Here the class MyApp is initialized and its run() method called. This initializes and starts our Kivy application. Running the application¶ To run the application, follow the instructions for your operating system: For Windows, Linux, OS X, or the RPi. From the terminal where you installed Kivy simply run: python main.py For Android or iOS, your application needs some complementary files to be able to run. See Create a package for Android or See Create a package for IOS for further reference. A window should open, showing a single Label (with the Text ‘Hello World’) that covers the entire window’s area. That’s all there is to it. Customize the application¶ Lets extend this application a bit, say a simple UserName/Password page. from kivy.app import App from kivy.uix.gridlayout import GridLayout from kivy.uix.label import Label from kivy.uix.textinput import TextInput class LoginScreen(GridLayout): def __init__(self, **kwargs): super(LoginScreen, self).__init__(**kwargs) self.cols = 2 self.add_widget(Label(text='User Name')) self.username = TextInput(multiline=False) self.add_widget(self.username) self.add_widget(Label(text='password')) self.password = TextInput(password=True, multiline=False) self.add_widget(self.password) class MyApp(App): def build(self): return LoginScreen() if __name__ == '__main__': MyApp().run() At line 2 we import a Gridlayout: from kivy.uix.gridlayout import GridLayout This class is used as a Base for our Root Widget (LoginScreen) defined at line 7: class LoginScreen(GridLayout): At line 9 in the class LoginScreen, we override the method __init__() so as to add widgets and to define their behavior: def __init__(self, **kwargs): super(LoginScreen, self).__init__(**kwargs) One should not forget to call super in order to implement the functionality of the original class being overloaded. Also note that it is good practice not to omit the **kwargs while calling super, as they are sometimes used internally. Moving on to Line 11 and beyond: self.cols = 2 self.add_widget(Label(text='User Name')) self.username = TextInput(multiline=False) self.add_widget(self.username) self.add_widget(Label(text='password')) self.password = TextInput(password=True, multiline=False) self.add_widget(self.password) We ask the GridLayout to manage its children in two columns and add a Label and a TextInput for the username and password. Running the above code will give you a window that should look like this: Try re-sizing the window and you will see that the widgets on screen adjust themselves according to the size of the window without you having to do anything. This is because widgets use size hinting by default. The code above doesn’t handle the input from the user, does no validation or anything else. We will delve deeper into this and Widget size and positioning in the coming sections.
https://kivy.org/doc/master/guide/basic.html
CC-MAIN-2021-39
refinedweb
978
56.76
This discussing brings back the still pending issue of having a generic if/unless on all tasks/types to name just an example... failonerror, if/unless, ant:type, and some other attributes most likely, control 'aspects' of the build, that should be dealt with in a single place! Now that Ant is namespace-aware, and can make use of the reserved ant: namespace (I know it's not the prefix but the namespace name that matters...), and now that the way was opened with ant:type, then it is probably time to also add ant:if, ant:unless, ant:failonerror, etc... These meta-attributes could be used on any XML elements of the build file, and the attributes equivalent to them in the few tasks where they're hand-written could be deprecated. Seems to me Ant has all the elements to do AOP without the need to use AspectJ. Just my usual $.02 of course ;-) --DD > -----Original Message----- > From: Stefan Bodewig [mailto:bodewig@apache.org] > Sent: Tuesday, July 08, 2003 2:41 AM > To: dev@ant.apache.org > Subject: Re: [Patch] keep-alive feature > > Well, we've already introduced one magic attribute with the > polymorphism patch (will introduce). I'd rather turn the various > failonerror attributes into a single magic fail-on-error, which would > be handled by Task. --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscribe@ant.apache.org For additional commands, e-mail: dev-help@ant.apache.org
http://mail-archives.apache.org/mod_mbox/ant-dev/200307.mbox/%3CD44A54C298394F4E967EC8538B1E00F10248C45F@lgchexch002.lgc.com%3E
CC-MAIN-2014-23
refinedweb
239
64
I wrote this article about a year ago for an online magazine. It is based on concepts that were true in .NET 1.1 and should be updated. If you are using .NET 2.0 then you need to further research thread pooling and attachments, I included some links to help. Most of these tips apply to .NET 1.1 and 2.0. ——————————————————————————- When I first started writing web services a few years ago I noticed that they were often fairly slow. If you are writing web services using the same techniques that you wrote other types of distributed applications then your web services will be slow too. So here are some thoughts on making them fast and powerful. In short, making them fire breathing web services. The first step in building fire breathing web services is to make sure that you really should be using web services. ASP.NET web services uses XML serialization, do not forget how it works and what its characteristics are. Serialization and network communications are some of the most important bottlenecks in a high performance system. Use both sparingly and give thought to minimizing both wherever possible. The base functionality for your client request is provided in the WebClientProtocol base class. This is extended in the System.Web.Services.Protocols.HttpwebClientProtocol namespace. A client uses the System.Net classes to generate proxy classes to provide the web services access. Depending on your need the client will be one of three flavors. These are the HttpGetClientProtocol, HttpPostClientProtocol or SoapHttpClientProtocol proxy classes. These classes take the XML request serialize it into a SOAP message. ASP.NET clients use the same thread pool for encoding and transmission as do ASP.NET web services. So if you have both on the same computer, in addition to wasting time, you have a double hit on the local resources. The maxconnection setting in your machine.config file excludes local client calls so local calls can steal more resources from remote client calls. Make sure that you change the maxconnection setting in the machine.config file from 2 to something higher. I suggest experimenting starting with 10 connections for each processor in the server and heading up form there. You may find the number between 13 and 16. As you increase them the CPU utilization will increase. Shoot for 70 percent utilization as a maximum. As your users and application grow run periodic tests to ensure you are allocating the optimal level of connections. This is one of the key things to remember, whatever goes over your communication channel has to be serialized and formed into SOAP (or some other type of) messages and then transported and unserialized. Many client/server developers do not give consideration to what is going over the wire and with web services, your bad habits show through. Network round trips and unnecessarily large messages will hurt performance. Try to keep messages as small as possible and consider if compression is warranted. When IIS receives an HTTP request for an ASMX page it utilizes the aspnet_isapi.dll ISAPI extension. There is an ASP.NET worker process created and entered in a processing pipeline which is controlled by the HttpRuntime object which passes it to the HttpApplication object and the HttpModule objects specified in your section of the Web.config file or the Machine.config file. After execution of the modules in the pipeline, the asmx extension is verified with the WebServiceHandlerFactory handler to create a handler instance. This instance of the WebServiceHandler is what is responsible for processing web service requests. The HTTP handler uses reflection to generate method invocations from the SOAP message. Web services are usually either messaging oriented or RPC (objects and methods) oriented. Use primitive types at all times if you can. Methods should be stateless and should be combined. Create methods that take multiple parameters and perform multiple functions to reduce round trips. Try to avoid state. I personally think state is overused. Make sure that you consider the scalability costs of state management. Be wary of excessive state management. Methods should not be stateful. If you need state and are willing to trade off performance for scalability then you can pass state back in forth in your calls instead of managing it server side. Validate up front. As a rule, validate data at the earliest possible point. If you cannot validate at the user input then validate it before your message is created. Do not waste round trips on invalid data formats. A good option is to validate against a schema stored on the server. You can use XmlValidatingReader to download an XSD and validate client side before sending off the message. Your parameters should be formatted using the default literal format except where you have interoperability with non.NET web services. In that case you will need SOAP formatting. Bulk data can be transferred by returning in the SOAP message the URL of a file to download. This can save a ton of time serializing, compressing, etc large data transfers. You can also use chunking of fixed size byte arrays. SOAP attachments can be WS-attachments, Base 64 encoded or SOAP Message Transmission Optimization Mechanism (MTOM). If you are subject to sudden bursts in traffic then you would experience a performance lag during a traffic burst as the application suddenly needs to create more threads to handle the increase. If you are using .NET framework 1.1 or newer then you can set SetMinThreads method of the ThreadPool class. I hope these thoughts are helpful and I hope to see fire coming from your next web service.
https://blogs.msdn.microsoft.com/mzammuto/2005/11/28/building-fire-breathing-web-services/
CC-MAIN-2016-50
refinedweb
937
58.89
Created on 04-13-2020 01:25 PM - last edited on 04-14-2020 12:55 AM by VidyaSargur Hi Team Can you please advise if i need to read avro files on the CCA-175 exam environment,will the below work import com.databricks.spark.avro._ val avroDF = sqlContext.read.avro("/user/test/emp-avro") Hi there, You are welcome to watch the updated exam preparation video, as well as read through the required skills on the related exam webpage here: Thank you. Created 04-20-2020 12:57 PM Hi, The video posted on certification site does not mention any information related to avro files. Let me rephrase the question. Do we need to explicitly include avro packages when we launch pyspark (or spark-shell, in case of scala) using "--packages org.apache.spark:spark-avro_2. ... " option ? Appreciate your response as we are unable to find an answer for this anywhere. Thanks Hi there, All information is mentioned in the video and in the related exam webpage in order to successfully pass this certification exam. You are welcome to check out the required skills section again. Thank you for your understanding. Created 09-01-2020 11:48 PM Simple & valid question but no chance of a simple answer. Just copy and paste the FAQ. Great job Cloudera bots!
https://community.cloudera.com/t5/Support-Questions/CCA-175-Environment-avro-libraries/m-p/293862
CC-MAIN-2020-40
refinedweb
221
64.91
I wrote this program back in May that makes use of networking. It's a smallish program that is comprised of 2 parts, a client and a server. The server just receives information from a single client. The client is just a form in which you input an address. If you open the client without opening the server first, it doesn't work. It just says "NO CONNECTION TO SERVER" when you try to add a record. Which is what it's supposed to do. Anyway, for some reason, every time I open the server program, I get a BindException. I have this handled by a try-catch block, so it throws an error message of my own design "PORT ALREADY IN USE. EXITING." then it exits. I arbitrarily chose port 10,000 to handle the transmission of data, and port 9,000 to handle task IDs (I had to use a separate socket so that the server would know what to do with the information it was given). I chose these because as far as I know they aren't reserved by any regular TCP/IP protocols. Also, this program worked fine 5 months ago. What's the deal? Here's the code for the server portion if you think you can find anything relevant in there. Code java: public class P_AddressServer { //Text area to log activity. private JTextArea jtaServerLog = new JTextArea(); //Socket for listening for objects. private Socket listeningSocket; //Integer input stream from client to get task ID. private DataInputStream getTaskID; //Object input and ouput streams from and to client. private ObjectInputStream inputFromClient; private ObjectOutputStream outputToClient; //Integer to store flags indicating what the client wants. private int userTask; //ID of current record. private int currentRecord = 0; //Linked list to store the address objects. LinkedList<Address> mailingList = new LinkedList<Address>(); P_AddressServer() { //Make the JFrame. makeWindow(); //Sockets for listening for addresses and the task ID numbers. ServerSocket serverSocket = null; ServerSocket serverTaskSocket = null; try { //Open socket to client. Listen on port 10000 serverSocket = new ServerSocket(10000); //Open socket to listen for the task ID. serverTaskSocket = new ServerSocket(9000); //Wait for input. while(true) { //Begin listening. listeningSocket = serverSocket.accept(); Socket taskListeningSocket = serverTaskSocket.accept(); //Input stream for receiving the task's ID. getTaskID = new DataInputStream(taskListeningSocket.getInputStream()); //Get the task ID. userTask = getTaskID.readInt(); //Process server task based on user's task choice. if(userTask == Address.ADD) serverSideAdd(); else serverSideSingleItem(userTask); } } catch (BindException e) { JOptionPane.showMessageDialog(null, "PORT ALREADY IN USE. EXITING."); System.exit(0); } catch (IOException e) { // TODO Auto-generated catch block e.printStackTrace(); } finally { try { serverSocket.close(); serverTaskSocket.close(); } catch (IOException e1) { // TODO Auto-generated catch block e1.printStackTrace(); } } } //Method to construct the GUI frame. private void makeWindow() { //Create main frame. JFrame logWindow = new JFrame("Server activity log."); //Lock out user editing of server log. jtaServerLog.setEditable(false); //Log date and time of startup. jtaServerLog.append("SERVER STARTED AT: "); jtaServerLog.append(new Date().toString()); //Add elements to JFrame. logWindow.add(new JScrollPane(jtaServerLog)); //Set attributes of frame. logWindow.setVisible(true); logWindow.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); logWindow.setSize(600,350); } //Method to add addresses to linked list and server log. private void serverSideAdd() throws IOException { //Create input and output streams. inputFromClient = new ObjectInputStream(listeningSocket.getInputStream()); try { //Current record is last item in list. currentRecord = mailingList.size(); Address newAddress = (Address)inputFromClient.readObject(); //Identify if this is the first address, and set the flag if it is. if(mailingList.isEmpty()) newAddress.isFirst = true; //Log address information to the server. addStuffToLog(newAddress.name); addStuffToLog(newAddress.street); addStuffToLog(newAddress.city); addStuffToLog(newAddress.state); addStuffToLog(newAddress.zip); //Add address from client to the linked list. mailingList.add(newAddress); //Move pointer of the last item. mailingList.get(currentRecord).isLast = true; //Next to last item is no longer the last item. //Disregard if this is the first item (size = 1, currentRecord = 0). if(mailingList.size() > 1) mailingList.get(currentRecord - 1).isLast = false; } catch(ClassNotFoundException e) { JOptionPane.showMessageDialog(null, "ADDRESS CLASS NOT FOUND. EXITING."); System.exit(0); } finally { //Close the input stream from the client. Reopen when needed next time. inputFromClient.close(); } } //End of serverSideAdd method. //Method to send single address from the list to the client. private void serverSideSingleItem(int userTask) throws IOException { //Open data stream to send record information to client. outputToClient = new ObjectOutputStream(listeningSocket.getOutputStream()); switch(userTask) { //Current record is the first record. case Address.FIRST: currentRecord = 0; break; //Current record is one more than the previous. case Address.NEXT: currentRecord++; break; //Current record is one less than the previous. case Address.PREVIOUS: currentRecord--; break; //Current record is one less than the size of the whole list case Address.LAST: currentRecord = mailingList.size() - 1; break; //Just quit if somehow an integer other than one of our 4 constants got in. default: System.exit(0); break; } /* Check current record. If it was record 0 when user entered this method, and user hit the Previous button, set it back to 0 by incrementing. If it was the last record and user hit Next, set it to the ID of the last by decrementing. Set the respective flags to indicate if they are the first or last. In this way, hitting previous on the first record will show the first record and hitting next on the last record will show the last record. */ if(currentRecord == -1) currentRecord++; if(currentRecord == mailingList.size()) currentRecord--; //Send current record. outputToClient.writeObject(mailingList.get(currentRecord)); } //Method to add strings to the server log. private void addStuffToLog(String addThis) { jtaServerLog.append("\n" +addThis); } //Program entry point. Simply creates new server object. public static void main(String[] args) { new P_AddressServer(); } }
http://www.javaprogrammingforums.com/%20java-networking/32897-socket-program-worked-past-no-longer-working-cannot-open-socket-printingthethread.html
CC-MAIN-2015-06
refinedweb
922
53.17
I learned a lot about digital gardens from Joel Hooks and decided to build my own after watching this panel. The main reason I decided to make my own digital garden was the pressure I kept putting on myself to produce perfect polished content. Instead of creating more content and learning, I left my articles unpublished. If you want to read more about digital gardens and learn more about my reasoning check out my other post, "What is a digital garden?". Why Gatsby? Ever since I first learned Gatsby I enjoyed working with it and have made multiple personal websites. It worked great for me and I was able to set everything up pretty quickly. One fun thing that Gatsby utilizes is GraphQL. We can use Gatsby and GraphQL to create pages for our garden from Markdown files. Now I don't need to have a backend setup and when I want to create a new post, all I have to do is create a Markdown file in my content/posts folder. I don't think GraphQL knowledge is required for this but if you want to learn a bit more about my favorite technology check out this post, "What is GraphQL"! I know Next.js is a popular option but personally it seemed to have too many bells and whistles for what I was doing. I also already knew Gatsby so no need to try and use a new technology. That being said, if you want to use Next feel free, but this post will be going through the Gatsby docs. I'll be treating this post like a walkthrough so hopefully I explain everything well enough for you to follow along. With that being said here's a link to the github repo where you can find all the code written in this article. Also feel free to reach out to me on Twitter if you have any questions. Part 1 Walkthrough Following along with the Part 1 Gatsby tutorial, after installing all the necessary stuff, I'm going to run the gatsby new command. Of course I didn't have the Gatsby CLI already installed so I needed to use sudo npm i -g gatsby-cli. We are off to a great start. Following along the command prompt initiated by gatsby new What would you like to call your site? - digital garden What would you like to name the folder where your site will be created - I hit enter which corresponds to "Coding_Projects/digital-garden" Will you be using a CMS? - No (or I'll add it later) Would you like to install a styling system? - No (or I'll add it later) Would you like to install additional features with other plugins? - Use the arrow keys to navigate to "Add Markdown and MDX support", hit space to select, use the arrow keys to navigate to "Done" and then hit Enter Enter one more time to get finalize the creation! Hopefully if everything went well you, after you run npm start and open up localhost you should see something like this! First thing I did was clean up a lot of this code that I didn't need. Now the code in index.js looks like: import * as React from "react";const IndexPage = () => {return (<main><title>Digital Garden Starter</title><h1>Welcome to my Digital Garden!</h1></main>);};export default IndexPage; Now we have a quick home page but what about creating other pages? We can create other pages quickly by creating a component inside the src/pages directory. So we'll create a new file src/pages/articles.js and Gatsby will automatically create a page at "/articles" that displays this component. import * as React from "react";const ArticlesPage = () => {return (<main><title>Articles</title><h1>Feel free to peruse all the articles in my garden!</h1></main>);};export default ArticlesPage; After saving this new page we can navigate to localhost:8000/articles and see our component! Because we have two pages now and want to have a light/dark mode toggle later we can just create a navigation bar now to easily switch between pages. I like to keep my components organized so I'll create a src/components folder and then create the file for Navbar.js. import * as React from "react";import { Link } from "gatsby";const Navbar = () => {return (<nav><Link to="/">Home</Link><Link to="/articles">Articles</Link></nav>);};export default Navbar; The biggest thing to point out in our Navbar component is the Link component we are using from Gatsby. The Link component that Gatsby gives us is very similar to an <a>. The to prop is similar to the href attribute on <a> tags. But one of the benefits to using the Link component is that it gives us a performance boost. When one of these Link tags is in view the resources for that specific page are requested. Then when you navigate to that page it loads much faster than if the resources were requested on click. Link components are used for linking between pages within your site. That's why they are perfect for the Navbar, but if I wanted to link to say MDN docs we would still want to use an <a> tag. After we've built the Navbar component and imported it into index.js we should see a beautiful nav bar that lets us easily navigate to the articles page. If we click the "Articles" link we should be routed to localhost:8000/articles. Because we just imported the Navbar into our index.js and not our articles.js page we no longer see the Navbar. We could import the Navbar component into the articles page but this can quickly get tedious as we start to have more pages or more components that are repeated throughout pages like a footer. So we'll create a custom Layout component that will be responsible for displaying components that are shared throughout multiple pages. import * as React from "react";import Navbar from "./Navbar";const Layout = ({ pageTitle, children }) => {return (<div><title>{pageTitle}</title><Navbar /><main>{children}</main></div>);};export default Layout; In the Layout component we can take advantage of the children props in order to wrap our pages. Now we can import this Layout component into our pages to see the Navbar on all the pages and any other repeat components we end up adding to Layout import * as React from "react";import Layout from "../components/Layout";const ArticlesPage = () => {return (<Layout pageTitle="Articles"><h1>Feel free to peruse all the articles in my garden!</h1></Layout>);};export default ArticlesPage; One of the great reasons of creating a digital garden with Gatsby is we can create all our content in Markdown and keep it in our local filesystem and access that data through GraphQL and gatsby plugins. We can write GraphQL queries inside specific components to query data we want to use. When Gatsby builds the site, it will find all those GraphQL queries, run them, and pass that data into the the component. We can create an articles folder at the top of the directory to hold our of the content we are going to create. To access these files we will need to use the Gatsby plugin, gatsby-source-filesystem npm install gatsby-source-filesystem plugins: [{resolve: "gatsby-source-filesystem",options: {name: "articles",path: `${__dirname}/articles`,},},], Now we have the plugin and we've pointed it to the folder with all our content. Now we just need to write a GraphQL query to access the data. query MyQuery {allFile {nodes {name}}} Pulling data into page components is a bit different than pulling data into regular building block components like a Layout component. When we want to access GraphQL data in a page component we create a variable that holds the GraphQL query and then when Gatsby builds the site, it will run that query and pass the data into the page component as a prop called data import * as React from "react";import Layout from "../components/Layout";import { graphql } from "gatsby";const ArticlesPage = ({ data }) => {console.log(data);return (<Layout pageTitle="Articles"><h1>Feel free to peruse all the articles in my garden!</h1><ul>{data.allFile.nodes.map((node) => (<li key={node.name}>{node.name}</li>))}</ul></Layout>);};export const query = graphql`query {allFile {nodes {name}}}`;export default ArticlesPage; Note If you're following along with this article, make sure you restart your server. I ran into an error saying I couldn't .map() over undefined and I assume that's because there was no data because the GraphQL query is run on build. The plugin gatsby-source-filesystem allows us to query the names of our files but it can't give us the content of those particular files. For that we will need another plugin called gatsby-plugin-mdx. Source plugins like gatsby-source-filesystem allow you to query data about the file, but not inside the file. For that we will need a transformer plugin. In order to display the information inside our MDX articles we need to go through a couple of steps. - Configure the gatsby-plugin-mdx, similar to how we had to configure the gatsby-source-filesystem - Update the GraphQL query we added to ArticlesPageto use allMdxinstead of allFile - Use the MDXRenderercomponent to display the content inside our MDX articles When we started this projected we set up "Add Markdown and MDX support" option. So the first step is already all set up for us. If you missed that step you can: npm install gatsby-plugin-mdx @mdx-js/mdx @mdx-js/react and add gatsby-plugin-mdx to the plugins array in gatsby-config.js. Now that we have the plugin set up we have access to allMdx and mdx fields in our GraphQL queries. query MyQuery {allMdx(sort: {fields: frontmatter___date, order: DESC}) {nodes {frontmatter {date(formatString: "MMMM D, YYYY")title}idbody}}} Above you'll see the new query that we want to run. Instead of allFile we will use the allMdx field to access properties that are inside our mdx files. Like in most blogs we will sort the artiles based on the most recent one. We can do that with the sort function and accessing the date we set in the frontmatter of the articles. The nodes field is used to get each mdx post and from there we can return the data we want. Like all the information in the frontmatter, the id of the article that we will use for things like keys, and the body of the post that we will pass to MDXRenderer to display the content. <Layout pageTitle="Articles"><h1>Feel free to peruse all the articles in my garden!</h1>{data.allMdx.nodes.map((node) => (<article key={node.id}><h2>{node.frontmatter.title}</h2><p>Posted: {node.frontmatter.date}</p></article>))}</Layout> Because we changed the graphql query to use allMdx we will want to update what we are returning in ArticlesPage. We can now utilize all that new data to display more information than just the file name we were displaying before. Now we just need to display the actual content that's inside the mdx files with MDXRenderer. const ArticlesPage = ({ data }) => {return (<Layout pageTitle="Articles"><h1>Feel free to peruse all the articles in my garden!</h1>{data.allMdx.nodes.map((node) => (<article key={node.id}><h2>{node.frontmatter.title}</h2><p>Posted: {node.frontmatter.date}</p><MDXRenderer>{node.body}</MDXRenderer></article>))}</Layout>);}; Once we add <MDXRenderer>{node.body}</MDXRenderer> we should see the content of our articles! We have all our articles and all their content displayed on one page and while this is okay, it can quickly grow messy. One thing we can do is dynamically create an individual page for each of our articles. We can use one page component to create multiple pages. We will utilize Gatsby's File System Route API, which lets us "create routes dynamically by naming your page files with special syntax". This template file will live in src/pages/{mdx.slug}.js. The curly braces are important and indicate the dynamic portion of the route! When determining the naming structure we want to think about what type of node to create pages from and which field from that node should we use as the URL. We haven't used this field yet but within the allMDX query there's a field called slug. This slug field gives us a nice URL and corresponds to the file name of our posts. I called one of the files first-post.mdx, so the corresponding URL will be /first-post. Inside our template page: import * as React from 'react'import Layout from '../components/layout'const BlogPost = () => {return (<Layout pageTitle="Super Cool Blog Posts"><p>My blog post contents will go here (eventually).</p></Layout>)}export default BlogPost Right now we will hard code everything but eventually all this information will be dynamic and specific to the current article page you're on. But if you go to /first-post you should see our page template! Alright time to add that dynamic information to the template. For this we will use another GraphQL query to query article information through their specific ids. query MyQuery($id: String) {mdx(id: {eq: $id}) {frontmatter {titledate(formatString: "MMMM D, YYYY")}body}} Once we add this query to our template file we can display the data similar to what we did in the ArticlesPage. Here's what the {mdx.slug}.js component should look like: import * as React from "react";import Layout from "../../components/layout";import { graphql } from "gatsby";import { MDXRenderer } from "gatsby-plugin-mdx";const Article = ({ data }) => {return (<Layout pageTitle={data.mdx.frontmatter.title}><p>{data.mdx.frontmatter.date}</p><MDXRenderer>{data.mdx.body}</MDXRenderer></Layout>);};export const query = graphql`query ($id: String) {mdx(id: { eq: $id }) {frontmatter {titledate(formatString: "MMMM D, YYYY")}body}}`;export default Article; Because we are displaying the information of the article in the specific route we don't need to display everything in the /articles route anymore. This page should instead be responsible for showing the names of all the articles and linking to those specific article pages. import * as React from "react";import Layout from "../../components/Layout";import { graphql, Link } from "gatsby";const ArticlesPage = ({ data }) => {return (<Layout pageTitle="Articles"><h1>Feel free to peruse all the articles in my garden!</h1>{data.allMdx.nodes.map((node) => (<article key={node.id}><h2><Link to={`/articles/${node.slug}`}>{node.frontmatter.title}</Link></h2><p>Posted: {node.frontmatter.date}</p></article>))}</Layout>);};export const query = graphql`query {allMdx(sort: { fields: frontmatter___date, order: DESC }) {nodes {frontmatter {date(formatString: "MMMM D, YYYY")title}idslug}}}`;export default ArticlesPage; Since we aren't going to display the content of the article on this page we can remove MDXRenderer, as well as replace body with slug in our GraphQL query. Similar to the Navbar we can use Gatsby's Link component to link to pages that are within our site, like articles.
https://www.jenkens.dev/blog/how-i-built-my-digital-garden/
CC-MAIN-2022-27
refinedweb
2,500
53.31
table of contents NAME¶ sasl_server_step - Cyrus SASL documentation SYNOPSIS¶ #include <sasl/sasl.h> int sasl_server_step(sasl_conn_t *conn, const char *clientin, unsigned clientinlen, const char ** serverout, unsigned * serveroutlen); DESCRIPTION¶ - int sasl_server_step(sasl_conn_t *conn, - const char *clientin, - unsigned clientinlen, - const char ** serverout, - unsigned * serveroutlen); - – set by the library and should be sent to the client. - serveroutlen – length of serverout. RETURN VALUE¶ SASL callback functions should return SASL return codes. See sasl.h for a complete list. SASL_CONTINUE indicates success and that there are more steps needed in the authentication. SASL_OK indicates that the authentication is complete. Other return codes indicate errors and should either be handled or the authentication session should be quit. SEE ALSO¶ RFC 4422,:saslman:sasl(3), sasl_server_init(3), sasl_server_new(3), sasl_server_start(3), sasl_errors(3) AUTHOR¶ The Cyrus Team 1993-2022, The Cyrus Team
https://manpages.debian.org/bullseye/libsasl2-dev/sasl_server_step.3.en.html
CC-MAIN-2022-27
refinedweb
135
57.67
The Storage Team Blog about file services and storage features in Windows and Windows Server. I see this question fairly often in the DFS_FRS newsgroup. A customer will be setting up a new namespace and wonders whether he needs to move a bunch of shares under the root folder. The answer is simple: don’t use the root folder for storage. Keep your shares elsewhere and create folders in the namespace (aka links) that point to those shares. The Distributed File System service will create its own structures under the root, but there is no need for you to store files and folders there. --Jill Okay, you've said that there is no need to store files and folders there. My question is, is there a reason NOT to store files and folders there. We are designing a DFS architecture where we plan to create a domain DFS root for each user... the root share will be their home directory... in a subdirectory, we will create DFS links to other shares that the user has access to. One of the advantages to having the users home directory files and folders stored directly in that DFS root folder is that we hope to use Windows 2003 R2 folder based quotas and we would like the quota to be reflected in the clients explorer window (if the quota is associated with a subdirectory of the share, explorer doesn't reflect the available free space accurately). One drawback to storing files/folders in the root is the fact that you can't take individual root targets offline (i.e., disable their referrals), whereas you can take individual link targets offline. Also, the R2 DFS Mgmt snap-in does not offer a way to replicate the root folders of a namespace. You have to do this manually by setting up a replication group w/replicated folders that correspond to the root folders. Finally, if you ever plan to add a link to that root, you should not name it the same name as an existing subfolder under the root. This limitation exists because DFS creates a subfolder under the root that corresponds to the link name. This subfolder is actually a reparse point that, when accessed remotely, redirects users to the remote target. I believe if a folder with the link name already exists, DFS will rename that existing folder (by appending text) and then create a new folder using the link name.
http://blogs.technet.com/b/filecab/archive/2006/05/24/429363.aspx
CC-MAIN-2014-15
refinedweb
409
67.99
Join devRant Search - "kubernetes" - Like one of those jobs that demand 12 years of experience with Kubernetes (which was released 6 years ago)7 - - Finish my Raspberry Pi Zero Cluster... complete with kubernetes, etc. ... I still don't know what I'm going to run on this. suggestions in the comments welcome.27 -)?12 - -"15 -.61 - --- - - We are moving to kubernetes. Nothing much has changed except we now get to say it works on my cluster. instead of it work on my machine.1 - - Dear recruiters, if you are looking for - Java,Python, PHP - React,Angular - PostgreSQL, Redis, MongoDB - AWS, S3, EC2, ECS, EKS - *nix system administration - Git and CI with TDD - Docker, Kubernetes That's not a Full Stack Developer That’s an entire IT department Yours truly #stolen9 - - Me: “I’ve done Kubernetes before what could possibly go wro-“ (cni0 breaks IPv4 routing serverside by containerd) Me:1 - - I was sleeping next to my wife and suddenly I raised my hand and shouted "gaaaa", when she asked what is wrong, I replied "Kubernetes is misbehaving" without waking up4 - - Used to pay $5/mo on a small instance for my personal site. Then I discovered Kubernetes and realized my site didn't scale! No canary deployments! So I upgraded and pay $200/mo now. Took weeks to configure. Millions of people can now read my resume. Damn, it's never looked better8 - Excited for the following upcoming product releases: Dark Mode GitHub Dark Mode Jira Dark Mode Kubernetes Dark Mode Kafka Streams Dark Mode WebEx13 - Is it me or doing forty minutes standup meetings every morning is a complete waste of everyone's time? I don't need to explain what is Kubernetes and how to install it to my boss...8 - .14 - IBM job requirements: - 12+ years kubernetes experience - kubernetes is 6 years old IBM, never change cheered me up - I went to this conference to see what’s new in MSSQL 2019, kubernetes container on azure and see what Microsoft has done to embrace open source community. Speaker is from Microsoft, brings a Mac to the conference which I’m kool wit it, but shortly after he started, Word crash at launch, PowerPoint freezes when switch between pages, azure cli can’t login properly. And he goes ”this is awkward. “6 - I lost sleep because of Kubernetes... Rancher you fucking cuck you didn't tell me ahead of time OpenEBS can't RWX YA FOKIN WANKER FUCKING DAFT CUNT PIECE OF SHITE BLOODY BELLEND - I think my server got hacked, yesterday I made a new server on scaleway for the sake of testing I made a user called dev, with password dev. Forgot to change password before I went to bed. Logged in today to find that load is 5x.x and this (image) in my crontab Note to self: You are a disgrace, who the hell uses 'dev' as password for ssh on port 22 -_-21 - - fren: do you have a date this valentines? me: nah fam fren: what u doin rn me: [Insert technical explanation of Kubernetes here] fren: [goes offline]2 - - -. - Inherited a simple marketplace website that matches job seekers and hospitals in healthcare. Typically, all you need for this sort of thing is a web server, a database with search But the precious devs decided to go micro-services in a container and db per service fashion. They ended up with over 50 docker containers with 50ish databases. It was a nightmare to scale or maintain! With 50 database for for a simple web application that clearly needs to share data, integration testing was impossible, data loss became common, very hard to pin down, debugging was a nightmare, and also dangerous to change a service’s schema as dependencies were all tangled up. The obvious thing was to scale down the infrastructure, so we could scale up properly, in a resource driven manner, rather than following the trend. We made plans, but the CTO seemed worried about yet another architectural changes, so he invested in more infrastructure services, kubernetes, zipkin, prometheus etc without any idea what problems those infra services would solve - got 4 raspberry pi's with docker next to me. What's the best way to orchestrate them? Kubernetes, docker swarm, other?19 - "Expenses Graph of That Time I Tried Running Kubernetes On A Cloud Service" -2019, artist unknown (colorized) If you look closely, you can get an impression of the moment of "screw this, I'll look at it some other time".4 - To those able to join us in the Netherlands: So you want some devrant goodies? We are having a (IMO) cool event soon. "Collab - Digital Agency meets Cloud Provider" We will go into various topics regarding; automation, CI, cloud, experiences and maybe a few things about clusters / kubernetes. Everyone is happy to join us for 2 talks, beers (and maybe pizza!). Last but not least we are able to give a way various goodies including stuff from DevRant ;) You can order the free tickets at... I hope to see some devrant people there and make sure to hit me up if you will attend! ps. if you have question, just ask away!13 -.15 - Currently learning Kubernetes Cluster. Wow so much to learn. Much easier to setup any app for a Cluster. Only building the Image takes time 🙄 Containers are the future ✌🏻6 - - -. - Nothing beats beeing allowed to pick when i come in for work. Also today is pretty chill. Building is halv empty and i only have to write a lil documentation for kubernetes :D - - I updated my online profiles to reflect that I am a certified kubernetes administrator, and the calls from recruiters wont stop. - - one thing I don't get from Kubernetes if a group of containers are called pods, and pods are containers, and containers in Kubernetes are also inside containers, therefore, its a clusterfuck of containers?1 - Updated our rancher setup today and it just completely fucked the server, kubernetes stopped working, rancher stopped working. Guess who's going to install kubernetes manually next week? ;-- - -. - I am literally tasked with debugging why we have a 1.98 seconds lag on our site running on kubernetes. Smh4 - - -. - - - - Everyone rides on k8s today.... But in the end it's just like Docker Swarm and Compose combined. I don't know if Google is playing Elon Musk anymore.2 - I hope it fucking work this time, kubernetes has been on my damn list since last summer, gave up on my 2Mbits internet so I took a scaleway server with 200mbits let's hope I get it to work this time!19 - - Learn: Docker, kubernetes, ceph, s3, and aws in general. Not really dev per se, but still worthy technical goals.1 - - I like the Kubernetes open source project. Big project that has been fairly good at smoothing things out and pushing the project forward. - Installed centos 7, docker, standalone kubernetes on dev machine in 20 minutes. Spend 8 hours starting fucking dashboard service, still no fucking luck, no fucking logs, nothing. Fucking pending states without fucking explanation. All the fucking pods are running fine except one fucking dashboard. I want to see the fucking dashboard. Fucking shit fuck. Probably as always if I clean the machine and reinstall everything it would start normally, without fucking problem. Debugging fucking containers is so much pain in the ass, fuck. I think it’s enough for today -. - Give me a second to get my todo list. - get a office/server room built - setup a home kubernetes cluster - create an open-source ActivityPub whatsapp clone - unify existing ActivityPub implementations where an account on one can be used on others - finish dockerssh - create an irc bridge for signal messenger. - find a way to fully provision linux workstations fully unattended2 - - - - I've been to 4 kubernetes related tech talks and they've all been the fucking same. No depth, no new cool things, no little tricks or demonstrations, just the plain old boring shit I've seen a thousand times. I've worked with it and love it for big projects, but going to conventions to hear someone talk about it is completely meaningless. Perhaps it's because I only learn by doing. And before anyone says 'then don\'t go', I usually go with either friends or a colleagues and want to show my face, and have some drinks and snacks. This was my techtalk.5 - About two weeks ago, at my workplace, I learnt about Django deployment in Nginx server with Docker and Kubernetes on Google Cloud Console.2 - - I'd like to Dockerize our Node.js webapp at work, though I've never worked with any form of containerization software. Has anyone got any good resources for learning it? Should I also be learning Kubernetes?10 - Anyone try Kubernetes yet? It looks really promising! Looking to learn about deploying microservices at scale... - My works funny man. Over 12 years we've built out a crazy amount of services utilizing several languages, paradigms and deployment methods. Apparently we use to have a massive dev team or something but as of now its like barely 9 (that might include QA so like 6). We have a deployment repo that manages the entanglement of everything on a kubernetes cluster. There you will be forced to work with python, bash scripts, ruby, some lua, and node.js. And of course alot of yaml files. Move along to one of our many extensions or servers and you will find yourself needing to know angular 1.x, angular 9.x (right big jump), angular 7.x, Php (no frameworks), node.js (express spaghetti code, likely written when it first got hot), ruby on rails, meteor.js. Sense theres very few of us and we're over customer engineering (fixing bugs primarily to prevent churn), that means Im crossing each of these domains and needing to understand each enough to understand a mess of code that on average 9+ developers have had their hands on. Im exhausted. Even coming from an agency environment this is still brutal.1 - I mean. People love Docker and Kubernetes? Really? I mean, I agree it's good. I'm just wishing if people demanded for better and simple software and not complicated stuff. Idk10 - Devrant app cant even open ten rants in a row without crashing. Oh of course you have android inside Kubernetes running on top of arch Linux on your phone and it works fine, please fuck off.18 - /** Null until this web socket is connected. Used for writes, pings, and close timeouts. */ private ScheduledExecutorService executor; Dear boys and girls. If you ever do this again and release this as a public library (even better - an official client of your solution, e.g. kuber-fucking-netes), I will get my way into dR's gateway servers, trace down your IP in nginx's logs, find your location, probably use some means to get your first and last name (you prolly have a domain registered under your IP anyways...), buy a ticket to your town, get to your home and wait for night to fall. Once it's dark and you're asleep, I'll make sure to leave a real nice, warm and extraordinarily smelly turd on your doorstep (I'll also make sure the process of manufacturing that gem is as noisy as it gets - you just have to bend the right way, and....). Gents. If you really, REALLY want to make writes asynchronous, at least provide a way to either get a notification once the write is synchronized, or allow the user to handle the threads/executors himself! - Any devs out there worked building Golang microservices for a production environment? I don’t have a specific question really. Just wondering who is out there on a similar path! I’m building using Golang, Google Cloud, Docker, Kunernetes, and Terraform currently on a personal product bound for production!1 - - - - - "shiny shiny" time... Lets standup a kubernetes cluster and then find a problem to solve! #BuzzWordDrivenDev2 - Ehhh Yes I've won a few coding contests. Yes I've emulated clusters using Docker and Kubernetes. Doesn't mean that I can simulate machine learning over network like taking knife out of butter2 - Hey devRant! University student here. I’m trying to learn how to build scalable applications. I figured what better way to learn, than to ask this community! So, some questions: 1. What is a good stack for scalability 2. Regarding microservices, when and where should you use node, .net, and go 3. I hear much talk about docker and kubernetes... how would you use these concerning microservices Thanks!7 - - I’ve been writing a node.js service that automates kubernete commands so users aren’t having to constantly call for newly generated pod names and then container names and so on so forth. For instance it would ask you if you want to delete a pod, Exec into a container, fetch logs on a pod. It would list all namespace, pods and containers for those pods for you to pick from by just providing a corresponding number. With this kind of service assist anybody who is constantly having to restart, delete, fetch logs and delete with Kubernetes?4 - - - - IBM job 12 plus experience in Kubernetes. irony: Kubernetes is a 6 year old project.... actual listing: - Be me >run kubeadm join phase control-plane-prepare >get error: {Large Error} {Missing conf file...} Please use 'kubeadm join phase control-plane-prepare' to generate {conf file} >mfw I called you to generate that file. Could you please do your job - - What it looks like in a tutorial:... or... What it looks like on my machine:... k8s vs. me 3 :: 012 - - - "This service runs outside of k8s so it can only be accessed from other services in prod" Yay... Don't you love it when things can't be run outside of prod... - - - When a CS student asks me (business IT student) how he can get kubernetes to work in PHP. (No, I did not swap those two) *facepalm* - - Do any of you have any good resources at hand on good ways of managing Docker deploys? I don't want to use something as overkill as Kubernetes. In the end I want to be able to spin up the application on a $5 DigitalOcean droplet if need be. I need to figure out a good way of managing, deploying and rolling back a live application. Perhaps just using docker-compose is the way to go. Though I want your ideas. Thanks8 - Do you have a good use case to start learning kubernetes using the 300$ Google cloud startup bonus? I need to build up knowledge because my work doesn't do it, so it could be either docker, or kubernetes. Both has to be done in a cloud platform because I have to do this in my spare time... So do you have use cases and tasks for someone who's completely new to kubernetes? Or should I start with docker?5 -. - - I fucking hate the Nginx Ingress Controller for Kubernetes. Fucking piece of shit. You fucking can't do a fucking simple rewrite and proxy pass???? Fucccck!1 - spends almost 5 weeks trying to get CI/CD to work with Kubernetes (including installing Kubernetes itself). Decides that he might go see if Nomad is a better thing for him... Man, if only I discover stuff sooner...3 - Time for an exam about Cloud computing and deploying Microservices to the cloud using kubernetes, followed by another exam about Usage of scientific C libraries. This feels both so disconnected for being part of the same degree.2 - Attended KubeCon this week in San Diego. Was amazing great speakers great ppl all around. Its amazing to see an open source community get together to share. I was not expecting there were goin to be more than 12k attendees!! - - - I just setup Jenkins locally for the first time to do some CI/CD for a project using docker. Then I upgraded the container to the latest version of Jenkins. I am liking it so far but haven’t really setup anything significant yet. Any of you ranters have experience with Jenkins? - would you recommend it. Pros/cons? - what resources did you use to setup and expand your pipelines? - any experience with Google Cloud Platform and Jenkins. These are kind of open ended questions to start a discussion on the topic. Jenkins will be used at least for deploying the front end built in React. I may also use it for deployment if the Golang API but that uses Kubernetes at the moment. -.3 - - Just a quick rant to express my distaste that the AWS ALB ingress controller for Kubernetes doesnt expose any useful metrics. I just wanna know the target response latency is that too much to ask?1 - Any hardcore vim users out there? In need of help with tabs/panes. I tried some google-fu, but not much help. I have a kubernetes helper, where I can run a command like :Vikube, and it'll open the result in a new tab. Is there any way I can open the result in a splitpane instead? I've found some ways, but not any good ways :/4 - - - - - Is the current humble book bundle of any use? Dev ops by Packt. Lots of docker and kubernetes stuff. -...) - - I'm all for the awesome stuff Microsoft is doing on the Azure stack, but it's laughable how their subscription management system on their portal is more complicated than spawning Kubernetes clusters and load balancers via terminal. I mean c'mon!!!3 - - - DigitalOcean, really just because of the pricing. I will say though that kubernetes in Google cloud is much better than what DO offers, so if cost wasn't an issue I'd probably prefer it - - A better half of the day wasted. Why? Because fabric8 k8s client probably has a bug, where it fails to deliver the last part of the exec() output. Or the whole output, if it's short enough. brilliant... Aaaaaand we're going back to the official k8s client with ~10 parameters in their methods. Fucking awesome. - Started openshift to make send some of apps to cloud, damn it is too annoying. Everything is like 4x time consuming and hard, documentation really lacks, you google some errors? well answer is in red hat site and you can only see that if you are paid subscriber, issues in github are closed randomly(generally like we are going to fix this so no open issues??-written in 2017). If i had any other chance i would take it, like instantly. - - + Taste Dartlang and Flutter + Do something with WebXR and/or WebAssembly + Start some lil projects + Learn more about Kubernetes and monitoring services - My first public github Repository: Kubernetes on RaspberryPi4 based on Manjaro ARM64 I am a little bit proud. Even if the Readme is not yet finished and rook.io (ceph) has to be added.1 - - - I’ve been assigned a Kubernetes task and I must say I really hate this shite. I’d rather code than be doing this 😑😶😑3 - - Spent two hours trying to work out why a Kubernetes pod wouldn't apply it's database migration when it works in every other environment. Turns out the database instance was powered off. Piss biscuits. - - So I was very bored this week and deceided to get my head wrapped around Kubernetes and the hype around it. After trying to get a cluster run on my old contano servers I almost lose my nerve and just went for DigitalOcean. Holy shit I am impressed by the service. 30 seconds TTL DNS, hourly rate billing and spinning a scaleable cluster in only minutes. I fell in love1 - Hello guys, is it good for every use-case to have a own ecs / kubernetes cluster? It thinks yes, whats your opinion? Greets Jonathan - - I have two coworkers that discuss every day for hours about anything. Past month they were discussing about Docker Swarm x Kubernetes and it’s impossible to work without headphones and loud music. - k8s is so good orchestrating its shit, yet it can't handle a node rolling update with deployments having one replica and a PDB of unavailable=0, Dude... make a gooddamn exception, surge a damn pod for draining the node. - -! - Whyyyy whyyy can a billion dollar company be the last regarding Kubernetes as a service!! EKS has such a fat ass, damn slow to bootstrap and a pain to manage the lifecycle, while all other clouds even the small ones have figured it out. Can't just get it.6 - - Top Tags
https://devrant.com/search?term=kubernetes
CC-MAIN-2020-45
refinedweb
3,456
73.07
Discovering System.Linq.Expressions I’m officially a fan: System.Linq.Expressions is one of the coolest namespaces. I’ve been working on a simple workflow engine as an example codebase for exploring different aspects of object oriented programming (inheritance, encapsulation, polymorphism, design patterns, etc.) for training purposes. As a side note, I’ve found that it’s actually very difficult to describe good object oriented code; I can just kind of feel it when I’m writing it and I know it when I see it…but it’s really, really hard to describe. I was asked by an associate consultant why it mattered. Why bother with good object oriented design? For me (at least), more than anything, it’s about organization of code, readability, maintainability, and usability. Good object oriented code makes it easy to think about the models and how the interactions between the different moving parts are executed. But that’s a bigger topic for a different post. Back on topic 😀 The basic design scenario that I was trying to solve in this case is that the simple workflow engine (SWE) would have the capability of hydrating a workflow template instance from an XML definition file (much like WF does with .xoml files, but on a much more basic level, of course). I thought this would be a good exercise for teaching purposes as it would cover various aspects of reflection. Somewhere along the line, inspired by a comment by Richard Deeming (see bullet #4) on Rick Strahl’s DataContextFactory implementation, I decided to see if I could do it using expression trees instead. Here is a sample XML template definition: Here are the classes which this XML deserializes to: I’ve done something similar in a workflow engine that I put together for Zorch Software before the days of WF. Back then I used reflection to assemble a workflow instance from an XML template as well. (In that case, the engine supported state machine workflows; for this training sample, I thought that just sequential was good enough) Here is the invocation code to get a new instance of a workflow from a workflow template definition: The basics are that the factory has to create an instance by iterating through each WorkflowTemplateAction and creating a concrete WorkflowAction instance and set property values using the WorkflowTemplateParameter associated with the WorkflowTemplateAction. Here is the implementation of the factory method (cool stuff in bold): The outer for loop iterates the actions to create and the inner for loop collects the properties to set on the action. Object creation and initializaiton is done in one shot using Expression.Lambda. For reference, here is the target class for the XML in the sample above: Admittedly, I didn’t expect this to work…I had a hell of a time figuring out how to create the expression to set the property values. A fascinating approach. Good read over the morning Ice Coffee. (Found it via Dew Drop)
http://charliedigital.com/2009/06/12/discovering-system-linq-expressions/
CC-MAIN-2018-47
refinedweb
495
50.46
3.2-stable review patch. If anyone has any objections, please let me know.------------------Content-Length: 5974Lines: 176From: Hugh Dickins <hughd@google.com>commit 85046579bde15e532983438f86b36856e358f417 upstream.scan_mapping_unevictable_pages() is used to make SysV SHM_LOCKed pagesevictable again once the shared memory is unlocked. It does this withpagevec_lookup()s across the whole object (which might occupy most ofmemory), and takes 300ms to unlock 7GB here. A cond_resched() everyPAGEVEC_SIZE pages would be good.However, KOSAKI-san points out that this is called under shmem.c'sinfo->lock, and it's also under shm.c's shm_lock(), both spinlocks.There is no strong reason for that: we need to take these pages off theunevictable list soonish, but those locks are not required for it.So move the call to scan_mapping_unevictable_pages() from shmem.c'sunlock handling up to shm.c's unlock handling. Remove the recentlyadded barrier, not needed now we have spin_unlock() before the scan.Use get_file(), with subsequent fput(), to make sure we have a referenceto mapping throughout scan_mapping_unevictable_pages(): that's somethingthat was previously guaranteed by the shm_lock().Remove shmctl's lru_add_drain_all(): we don't fault in pages at SHM_LOCKtime, and we lazily discover them to be Unevictable later, so it servesno purpose for SHM_LOCK; and serves no purpose for SHM_UNLOCK, sincepages still on pagevec are not marked Unevictable.The original code avoided redundant rescans by checking VM_LOCKED flagat its level: now avoid them by checking shp's SHM_LOCKED.The original code called scan_mapping_unevictable_pages() on a lockedarea at shm_destroy() time: perhaps we once had accounting cross-checkswhich required that, but not now, so skip the overhead and just let: Andrew Morton <akpm@linux-foundation.org>Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>Signed-off-by: Greg Kroah-Hartman <gregkh@suse.de>--- ipc/shm.c | 37 ++++++++++++++++++++++--------------- mm/shmem.c | 7 ------- mm/vmscan.c | 12 +++++++++++- 3 files changed, 33 insertions(+), 23 deletions(-)--- a/ipc/shm.c+++ b/ipc/shm.c@@ -870,9 +870,7 @@ SYSCALL_DEFINE3(shmctl, int, shmid, int, case SHM_LOCK: case SHM_UNLOCK: {- struct file *uninitialized_var(shm_file);-- lru_add_drain_all(); /* drain pagevecs to lru lists */+ struct file *shm_file; shp = shm_lock_check(ns, shmid); if (IS_ERR(shp)) {@@ -895,22 +893,31 @@ SYSCALL_DEFINE3(shmctl, int, shmid, int, err = security_shm_shmctl(shp, cmd); if (err) goto out_unlock;- - if(cmd==SHM_LOCK) {++ shm_file = shp->shm_file;+ if (is_file_hugepages(shm_file))+ goto out_unlock;++ if (cmd == SHM_LOCK) { struct user_struct *user = current_user();- if (!is_file_hugepages(shp->shm_file)) {- err = shmem_lock(shp->shm_file, 1, user);- if (!err && !(shp->shm_perm.mode & SHM_LOCKED)){- shp->shm_perm.mode |= SHM_LOCKED;- shp->mlock_user = user;- }+ err = shmem_lock(shm_file, 1, user);+ if (!err && !(shp->shm_perm.mode & SHM_LOCKED)) {+ shp->shm_perm.mode |= SHM_LOCKED;+ shp->mlock_user = user; }- } else if (!is_file_hugepages(shp->shm_file)) {- shmem_lock(shp->shm_file, 0, shp->mlock_user);- shp->shm_perm.mode &= ~SHM_LOCKED;- shp->mlock_user = NULL;+ goto out_unlock; }++ /* SHM_UNLOCK */+ if (!(shp->shm_perm.mode & SHM_LOCKED))+ goto out_unlock;+ shmem_lock(shm_file, 0, shp->mlock_user);+ shp->shm_perm.mode &= ~SHM_LOCKED;+ shp->mlock_user = NULL;+ get_file(shm_file); shm_unlock(shp);+ scan_mapping_unevictable_pages(shm_file->f_mapping);+ fput(shm_file); goto out; } case IPC_RMID:--- a/mm/shmem.c+++ b/mm/shmem.c@@ -1068,13 +1068,6 @@ int shmem_lock(struct file *file, int lo user_shm_unlock(inode->i_size, user); info->flags &= ~VM_LOCKED; mapping_clear_unevictable(file->f_mapping);- /*- * Ensure that a racing putback_lru_page() can see- * the pages of this mapping are evictable when we- * skip them due to !PageLRU during the scan.- */- smp_mb__after_clear_bit();- scan_mapping_unevictable_pages(file->f_mapping); } retval = 0; --- a/mm/vmscan.c+++ b/mm/vmscan.c@@ -3353,6 +3353,7 @@ int page_evictable(struct page *page, st return 1; } +#ifdef CONFIG_SHMEM /** * check_move_unevictable_page - check page for evictability and move to appropriate zone lru list * @page: page to check evictability and move to appropriate lru list@@ -3363,6 +3364,8 @@ int page_evictable(struct page *page, st * * Restrictions: zone->lru_lock must be held, page must be on LRU and must * have PageUnevictable set.+ *+ * This function is only used for SysV IPC SHM_UNLOCK. */ static void check_move_unevictable_page(struct page *page, struct zone *zone) {@@ -3396,6 +3399,8 @@ retry: * * Scan all pages in mapping. Check unevictable pages for * evictability and move them to the appropriate zone lru list.+ *+ * This function is only used for SysV IPC SHM_UNLOCK. */ void scan_mapping_unevictable_pages(struct address_space *mapping) {@@ -3441,9 +3446,14 @@ void scan_mapping_unevictable_pages(stru pagevec_release(&pvec); count_vm_events(UNEVICTABLE_PGSCANNED, pg_scanned);+ cond_resched(); }- }+#else+void scan_mapping_unevictable_pages(struct address_space *mapping)+{+}+#endif /* CONFIG_SHMEM */ static void warn_scan_unevictable_pages(void) {
http://lkml.org/lkml/2012/1/23/622
CC-MAIN-2016-07
refinedweb
689
50.33
On Fri, Mar 1, 2013 at 7:37 AM, Eric Snow <ericsnowcurrently at gmail.com> wrote: >. (catching up after moving house, haven't read the whole thread) PEP 422 would make it useful to also add a "namespace" meta argument to type.__prepare__ to give it a namespace instance to return. Then, all uses of such a OrderedDict based metaclass can be replaced by: class MyClass(namespace=OrderedDict()): @classmethod def __init_class__(cls): # The class namespace is the one we passed in! You could pass in a factory function instead, but I think that's a net loss for readability (you would lose the trailing "()" from the empty namespace case, but have to add "lambda:" or "functools.partial" to the prepopulated namespace case) Even if type wasn't modified, you could create your own metaclass that accepted a namespace and returned it: class UseNamespace(type): def __prepare__(cls, namespace): return namespace class MyClass(metaclass=UseNamespace, namespace=OrderedDict()) @classmethod def __init_class__(cls): # The class namespace is the one we passed in! I prefer the approach of adding the "namespace" argument to PEP 422, though, since it makes __init_class__ a far more powerful and compelling idea, and between them the two ideas should cover every metaclass use case that *only* customises creation rather than ongoing behaviour. I actually had this idea a week or so ago, but packaging discussions and moving meant I had postponed writing it up and posting it. Cheers, Nick. -- Nick Coghlan | ncoghlan at gmail.com | Brisbane, Australia
https://mail.python.org/pipermail/python-ideas/2013-March/019725.html
CC-MAIN-2018-26
refinedweb
248
56.49
This is the mail archive of the cygwin@cygwin.com mailing list for the Cygwin project. Check out this solution from the mailing list archives: Alan Thompson At 10:09 PM 7/31/2003 -0600, Marcus G. Daniels wrote: >I'm having a problem getting DLLs compiled with Cygwin to load into Sun JDK 1.4.1. In the past this has worked, so I hope this is fixable without too much work. > >Here's an example. Take a simple Java Native Interface method like this: > >$ cat jniTest.c >void Java_Test_test () { printf ("test\n");} > >And compile it like so: > >gcc -shared -o jniTest.dll jniTest.c > >Also needed is the Java-side file: > >public class Test { > public native void test (); > public static void main (String args[]) { > Test test = new Test (); > System.out.println ("loading jniTest"); > System.loadLibrary ("jniTest"); > System.out.println ("calling native method"); > test.test (); > System.out.println ("success"); > } >} > >Compiled it like so from a Cygwin terminal (replace /cygdrive/i/j2sdk1.4.1_02 as appropriate): > >$ /cygdrive/i/j2sdk1.4.1_02/bin/javac Test.java > >Now run it, you should see it print "loading jniTest", but nothing more. > >$ CLASSPATH=. /cygdrive/i/j2sdk1.4.1_02/bin/java Test > >In contrast, relink the DLL, but not using "-mno-cygwin": > >$ gcc -mno-cygwin -shared -o jniTest.dll jniTest.c >$ CLASSPATH=. /cygdrive/i/j2sdk1.4.1_02/bin/java Test > >Now it should print: > >loading jniTest >calling native method >test >success > > > > >-- >Unsubscribe info: >Problem reports: >Documentation: >FAQ: > -- Unsubscribe info: Problem reports: Documentation: FAQ:
https://cygwin.com/ml/cygwin/2003-08/msg00046.html
CC-MAIN-2020-10
refinedweb
248
59.6
This is the first of two post that will illustrate how to write and read messages from Azure service bus queues. The second post will actually illustrate how to read these messages using Node.js. What I like about this post is that it only took a few minutes to complete. This post is here to support an MSDN article that I am writing with Steven Edouard. Creating the Service Bus Namespace and Queue The assumption here of course is that you have opened an account with Windows Azure. The first order of business is to actually create the service. You will need to go to the Azure portal click on the service bus , then New in the lower left corner. Figure 1: Creating a new service bus queue Select Queue , Custom Create . Figure 2: Selecting Custom Create You will need to provide a queue name and you will need to create a namespace name. Figure 3: Configuring the service bus queue We will accept the default values here. Figure 4: Specifying the queue name and namespace You can see the created namespace in the portal once it is complete. Figure 5: Validating the creation of a service bus queue In the figure above you can click on connection information . Specifically, you will need the connection string . The connection string will be pasted into the app . config file of a Visual Studio project we are about to download. Figure 6: Viewing connection information Downloading the Sample Here is the sample to illustrate how to write and read to Azure Service Bus Queues. This is the download link: Figure 7: Downloading the Service Bus Sample Modifying the Sample The modifications will be quite simple. The only thing that we will need to do is modify the connection string in app.config Figure 8: Viewing the solution App.config You can see below that we have modified the connection string . You will need to paste in the connection string you obtained from the portal . Figure 9: Viewing and modifying App.config Viewing the Code Let's take a brief look at the actual code that reads and writes to the message queue. Creating, Writing to, an Reading from the message queue Running the Sample Screen below shows messages that are being written to the message queue. Figure 10: Viewing queue creating and message sending As the program progresses, it will actually display the messages that are read from the message queue . In a future post we will show how to do this from node.JS Figure 11: Viewing messages in the queue When messages are read from the message queue , they are removed . Because we want these messages to remain in the queue so that our node.JS program can read them, you should think about commenting out the code that reads messages from the queue . Alternatively, you can use the Peek () method to read messages, but not remove them from the queue. Can you please help me , how to send these messages to an email id Please Replay I think there's a bug in your Sending logic. It is not going to retry sending the message in 2 seconds if it is a Transient error, it will always break out of the while loop. Please move the break inside the try block. Other than that, a very helpful post. Thanks!
https://blogs.msdn.microsoft.com/brunoterkaly/2014/08/07/learn-how-to-create-a-queue-place-and-read-a-message-using-azure-service-bus-queues-in-5-minutes/
CC-MAIN-2019-35
refinedweb
560
71.95
AWS Developer Blog Chalice – 1.0.0 GA Release We’re excited to announce the 1.0.0 GA (Generally Available) release of Chalice! Chalice is an open source serverless microframework that enables you to create and maintain application backends with a variety of AWS resources. These include: - AWS Lambda - Amazon API Gateway - AWS Identity and Access Management (IAM) - Amazon Cognito - Amazon CloudWatch - Amazon CloudWatch Events - AWS CloudFormation - AWS CodeBuild - AWS CodeCommit - AWS CodePipeline Chalice 1.0.0 is now generally available and ready for production use. If you want, to give it a try you can download it from PyPi. You can install it with pip as follows. pip install --upgrade chalice We follow Semantic Versioning, and are dedicated to maintaining backwards compatibility for each major version. Getting started with Chalice You can get started with Chalice and deploy a fully functional API in just a few minutes by following our getting started guide. You can find the complete documentation at readthedocs. Notable Chalice features Chalice provides many features to help build serverless applications on AWS. Here we provide an overview of a select few. Building an API backend The core of Chalice is the ability to annotate Python functions with a simple decorator that allows Chalice to deploy this function to AWS Lambda, and link it to a route in API Gateway. The following is a fully functional Chalice application, with a single linked route. from chalice import Chalice app = Chalice(app_name="helloworld") @app.route("/") def hello_world(): return {"hello": "world"} This application can be deployed easily by running the command chalice deploy. Chalice takes care of all the machinery around bundling up the application code, deploying that code to Lambda, setting up an API Gateway Rest API with all the routes specified in your code, and linking up the Rest API to the Lambda function. Chalice will print out something like the following while it deploys the application. Initial creation of lambda function. Creating role Creating deployment package. Initiating first time deployment... Deploying to: dev Once complete, you can send requests to endpoint it printed out at the end. $ curl {"hello": "world"} Dependency packaging App packaging can be difficult in the Python world. Chalice will try to download or build all of your project requirements that are specified in a special requirements.txt file and add them to the code bundle that is uploaded to Lambda. Chalice will also try to build and deploy dependencies that have C extensions. Pure Lambda functions Pure Lambda functions enable you to deploy functions that are not tied to API Gateway. This is useful if you want to take advantage of the Chalice deployment and packaging features, but don’t need to call it over a REST API. @app.lambda_function() def custom_lambda_function(event, context): # Anything you want here. return {} Scheduled events Scheduled events let you mark a handler function to be called on some time interval using Amazon CloudWatch Events. It’s easy to add a scheduled job to be run using a Chalice scheduled event handler, as follows: @app.schedule(Rate(12, unit=Rate.HOURS)) def handler(event): backup_logs() Automatic policy generation Automatic policy generation means that Chalice can scan your code for AWS calls, and generate an IAM policy with the minimal set of permissions your Lambda function needs to run. You can disable this feature and provide your own IAM policy if you need more control over exactly what permissions the Lambda function should have. Authorizers Chalice can handle a lot of common authorization workflows for you by providing hooks into both IAM authorization and Amazon Cognito user pools. If you want more control over your authorization methods, you can use a custom authorizer. This lets you call a Lambda function that runs custom code from your Chalice application to determine whether a request is authorized. Continuous integration You can use Chalice to build a continuous integration pipeline. This works by creating an AWS CodeCommit repository for your project code to live in, and an AWS CodePipeline that watches the repository for changes and kicks off a build in AWS CodeBuild whenever there are changes. You can configure the AWS CodeBuild stage to run tests on your code, and automatically deploy code to production if the tests all pass. The pipeline resources are all created and managed with an AWS CloudFormation template that Chalice will generate for you. Upgrade notes If you’re already a Chalice user, there are a few changes to be aware of when upgrading to version 1.0.0. Parameters to route handling functions are now keyword arguments instead of positional arguments. In the following code, captured parts of the URI will be assigned to the argument with a matching name, rather than in the order they appear. @route('/user/{first_name}/{last_name}') def name_builder(last_name, first_name): return '%s %s' % (first_name, last_name) This means that code in which the variable names don’t match the URI will now be broken. For example the following code will not work because the parameter and URI capture group don’t work. @route('/user/{user_id}') def get_user(user_number): return get_user(user_number) Support for policy.json has been removed. It now must be suffixed with the stage name, for example, policy-dev.json. Let us know what you think We would love to hear your feedback. Feel free to leave comments or suggestions on our GitHub page. Resources - Chalice GitHub repository: - Chalice documentation homepage: - Serverless Applications with Chalice talk:
https://aws.amazon.com/jp/blogs/developer/chalice-1-0-0-ga-release/
CC-MAIN-2019-43
refinedweb
908
54.42
Threaded discussions with NavFrames From Wikiversity In this learning project, we build a flexible operational model of a w:threaded discussion system with wikitext and NavFrames (see also: w:WP:NAVFRAME). I invite everybody to join. [edit] Summary As I know it, in mediawiki, every edit can alter only one page. The first conceptual question the programmer asks himself is: how can we make the parent node/thread/comment aware of a new sub-node/sub-thread/reply? We achieve this by putting various replies to a previous comment on separate sections on a page[1], each transcludes all[2] its replies, each transcluding all its replies.... Each has a customised[3] reply button, an "external link" to an editing page for the subnode. The editing page is in turn "w:preloaded" with the same wikitext, and so the cycle continues. So the key is in the preload page. [4] The relevant wikitexts consist of two lines (the link and the transclusion): |}}}}} The "{{{subst|}}}" are for "optional substitution", to allow archiving and exporting, as explained in #Collapsing a thread. Note that, as it turns out, e.g., the page Wikiversity:Threaded_discussions_with_NavFrames_with_subst/20070522105803 contains only the replies to what we think of as "comment/node number 20070522105803". "Node 20070522105803" itself is actually a section in its parent page. Thus we have provided a special:whatlinkshere link for each node to aid "naviagation towards the root thread". [[Special:Whatlinkshere/{{<includeonly>subst:</includeonly>NAMESPACE}}:{{<includeonly>subst:</includeonly>PAGENAME}}|What links here]] [edit] Grafting threads Sometimes two threads/discussions started out indepentdently would converge. Our model is adept in handling such a situation. We can graft two threads by simply adding a transclusion. In order to keep the thread "alive and in order", it is advisble not to simply cut and paste somebody else's comment/section/thread into another page(but it is all right to cut an paste your own comment/sectionthread). We have provided the preloads /graft and /grafteasy (which calls /grafteasy1). What they do is simply to add a comment which amounts to that "some other thread should be relevant to us here", and transcluding the "some other thread", and the structrure becomes as if that "some other thread" is (unknowingly) a reply to the local discussion. Schematicaly: (starting from left) -------*----*--- /-----*----*/ * \--------*--------------------* \ "grafting" \ /-----*----*------------* * \--------*-- [edit] Collapsing a thread Since a thread consists of many wikipages, it is not feasible to export all of them to another wiki. Here we use the optional substitution technique to collapse all the threads into one page. The relevant wikitext on the thread, which generally reads {{ {{{subst|}}}namespace:basepagename/revisiontimestamp|subst={{{subst|}}} }} is produced by {{{{{subst|}}}{{<includeonly>subst:</includeonly>NAMESPACE}}:{{<includeonly>subst:</includeonly>BASEPAGENAME}}/{{<includeonly>subst:</includeonly>REVISIONTIMESTAMP}}|subst={{{subst|}}}}} in the proload page. [edit] Testing Experiments has been carried out at betawikiversity:wikiversity:td,betawikiversity:wikiversity:tda,betawikiversity:wikiversity:tdb , betawikiversity:wikiversity:tdc , meta:meta:Threaded discussions with NavFrames, here WV:THREADNAV, wikiversity:Threaded discussions with NavFrames with subst with depth and w:zh-yue:user talk:hillgentleman/preload. [edit] Reading a threaded discussion By its nature, threaded discussion does not require archiving, and no thread is truely dead. One can read/monitor a threaded discussion by starting at any page/node. For example, in [[user:hillgentleman] may choose to transclude any one node amongst the subpages of his talk page. We here have chosen to use w:NAVFRAME for displaying the threads. (I do not know any simpler trick that works - for example, transclusion and indentation do not work together. ) The relevant wikitexts are <div class="NavFrame" style="text-align: left;"> <div class="NavHead" style="text-align: center;"> [[{{<includeonly>subst:</includeonly>NAMESPACE}}:{{<includeonly>subst:</includeonly>BASEPAGENAME}}/{{<includeonly>subst:</includeonly>REVISIONTIMESTAMP}}|{{<includeonly>subst:</includeonly>REVISIONTIMESTAMP}}]]</div> <div class="NavContent"> Here the m:magic word REVISIONTIMESTAMP, substituted, produces a time stamp which look like this: 20070522193137, which gives a unique index for each thread. However, we may forgo the transclusion and just keep a link. Then each page displays only one node. And we would need a "what links here" link, once again, for navigation towards the root thread. [edit] More discussions See [edit] Further developments - Make it more robust and easier to use - JAVA script: it is inconvenient that one needs to open many NavFrames to get to a deep thread, every time. It would be convenient to have an "open all subthreads" (is it possible?) or at least "open all NavFrames on this page" button. - Is it possible to make functional the table of content links to hidden sections ? (asked JWSchmidt on the talk page) - Add colours to differentiate the levels. Red-->Blue-->Green-->yellow may suffice. - To make new threads more prominent - Alternatively, we may put all the new threads in such categories as category:threads on yyyymmdd, and have a page New and recent threads to monitor them. - To separate the data (comment) and the structure (nested transclusions). That will probably require two clicks of the "save" button for every comment. - Without drastic change, we may go as far as putting the display elements into {{threadnav foot}}, which is called by {{threadnav footer}}, and {{threadnav head}}, which is called by {{threadnav header}}. Note also that the preload here is preloadwithtemplates. See the demonstration in [1]. In this manner, the display mode is easily switched by modifying the template - or one may add a parameter in the template for an automatic switch. Only the comment and the bare bone structure are kept in the main text. This provides us with more flexibility; and it becomes easy to make the threads machine-readable (by blanking out all the display elements). - One stumbling block so far is: the only "communication" from a node to a subnode is in the pagename, during page creation. I don't think it is possible to add a paremeter on the preload. Therefore the only thing that a subtnode "knows" about its parent node is its own pagename, which comes from the revisiontimestamp of the parent node. For example, it doesn't actually know where exactly its parent node is. That is why we need the "what links here" link. - This problem may be solved, albeit inelegantly, with adding "&autosummary=..." to the query; however, this only works if javascript is turned on, and it does not work for ip-users, and hence it is not feasible (or, if you like, not comopatible with the meta:foundation issues. - It is very plausible that, in a heated discussion, two comments would have the same timestamp. There are several ways to solve this problem. In order to give each a unique code/subpagename for identification, we may append the usernames to the revisiontimestamp. The simplest way - using three tilds ~~~ would require m:stringFunctions to remove the brackets. Or we may ask the author to add a his text signature or initials. In each case we need a seperate preload, perhaps named as "/preloadwithauthorsignature". - Extenion:Tree view ([2]) is very suitable for displaying threads. Can we use it? It should be straightforward to write a script to organise the thread-summaries into a tree {{#tree| *1. **1.1 **1.11 **1.2 *2. ... }} [edit] Notes - ↑ in fact, a subpage like this: full page name/revision time stamp - ↑ Or, in the model "with depth", only up to a set depth - ↑ indexed by the magic word REVISIONTIMESTAMP - ↑ We have here: - wikiversity:Threaded discussions with NavFrames with subst/preload (the most developed) - wikiversity:Threaded discussions with NavFrames with subst with depth/preload - wikiversity:Threaded discussions with NavFrames with subst/preloadeasy which calls - wikiversity:Threaded discussions with NavFrames with subst/graft (for #Grafting threads) - wikiversity:Threaded discussions with NavFrames with subst/grafteasy which calls
http://en.wikiversity.org/wiki/THREADNAV
crawl-002
refinedweb
1,275
53.31
tempnam() Create a name for a temporary file Synopsis: #include <stdio.h> char* tempnam( const char* dir, const char* pfx ); Arguments: - dir - NULL, or the directory to use in the pathname. - pfx - NULL, or a prefix to use in the pathname.If pfx isn't NULL, the string it points to must be no more than 5 bytes long. Library: libc Use the -l c option to qcc to link against this library. This library is usually included automatically. Description: The tempnam() function generates a pathname for use as a temporary file. The pathname is in the directory specified by dir and has the prefix specified in pfx. If dir is NULL, the pathname is prefixed with the first accessible directory contained in: - the temporary file directory P_tmpdir (defined in <stdio.h>) - the TMPDIR environment variable - the _PATH_TMP constant (defined in <paths.h>). If all of these paths are inaccessible, tempnam() attempts to use /tmp and then the current working directory. The tempnam() function generates up to TMP_MAX unique file names before it starts to recycle them. Returns: A pointer to the generated file name, which you should deallocate with the free() function when the application no longer needs it, or NULL if an error occurs. Errors: - ENOMEM - There's insufficient memory available to create the pathname. Classification: Caveats: The tempnam() functions creates only pathnames; the application must create and remove the files. It's possible for another thread or process to create a file with the same name between the time the pathname is created and the file is opened.
https://developer.blackberry.com/playbook/native/reference/com.qnx.doc.neutrino.lib_ref/topic/t/tempnam.html
CC-MAIN-2020-34
refinedweb
261
63.8
I had a massive argument with my brother the other day over an IT issue close to my heart. I had to be careful because he is a member of the Metropolitan Police, part of the Domestic Violence Policy Unit. To clarify, his department is responsible for the policy of policing domestic violence. What he was saying was that he, and the entire metropolitan police force, use Microsoft Word, all the police departments and stations he deals with do as well, as do all organizations he needs to interact with outside the police including the name drop-able big-wig departments in the UK government. He said they had "standardized" on Microsoft Office formats and did not see a problem with that, nor did he see my objections. The police are by no means the only ones. My mother receives documents from theater organizations in .doc and .xls formats, as do I from local organizations. The local Cambridge and Cambridgeshire governments post documents on their web sites using them. I understand how people can see it as a standard. Except it is not. These formats have never been submitted to a standards body, on the contrary Microsoft have done all they can to keep them closed. The only reason why myself, my mother and others who do not use Microsoft Office can read them is due to the fact technicians spent hours in front of binary dumps of the files getting inside the head of the Microsoft developers and reverse engineering the specification: a scenario that is hardly the basis of global interaction. Technicians reverse engineering binary dumps of Microsoft's closed formats is hardly the basis of global interaction All this is being replaced by new XML based formats. The Story so far Open Document Format - or ODF - now ISO/IEC 26300:2006 – was designed to be an open standard anyone could use for office document interchange based on recognized existing standards and conventions (1). Microsoft refused to have anything to do with it, instead pushing their own new format - Office Open XML - or OOXML. Microsoft initially placed restrictions on the use of their format. When the Commonwealth of Massachusetts' IT Division would not entertain storing documents using a format with IP restrictions, and other governments and organizations were following that example, Microsoft opened the IP using Non Assertive Contracts (2). Microsoft then submitted this format to ECMA for standard approval, however the format is not based on existing recognized standards, and it's main objections are to create an "XML"ization of their closed existing formats so that documents can be converted to these more than produce genuine interoperability with other programs(3). Microsoft achieved ECMA accreditation, which is no surprise as one of ECMA's roles in this universe is to approve standards for submission to ISO for rapid adoption(4), and sure enough, OOXML was submitted to ISO for fast track approval. However, this is when things started to go wrong for Microsoft. People noticed that OOXML's standard was bogus. National standards bodies were lobbied accordingly, and an unprecedented twenty members raised comments, fourteen were decidedly negative and only one supported it positively. ECMA had a month to reply to the above contradictions and comments, so they duly submitted a report to the JTC1 on the 28th February 2007. OOXML Contradictions, objections, arguments, problems and comparisons to ODF The object of a format standard is to facilitate and promote genuine interoperability and choice. No standard can be one hundred percent perfect, the issues are too numerous for that.. Objection 1 – OOXML duplicates and overlaps with ODF It is pointless to have OOXML when ODF already exists as a standard for office document interoperability. Argument against #1 – No problems having multiple standards for the same thing Standards already exist that overlap, such as HTML, PDF/A and ODF for exchanging office documents, CGM and SVG for vector graphics, JPEG and PNG for image formats, RELAX NG and DTD for XML schema definitions and and TIFF/IT and PDF/X for publishable graphics. My problem with that The examples given are not relevant to OOXML's duplication of functionality with ODF. To take each in turn: HTML, PDF/A and ODF are used for very different purposes. HTML to store marked up textual content, though not in any predefined format. PDF/A to reproduce an unchangeable paper representation of a document, and ODF to interchange editable documents for later publication. To say their collective use is for "exchanging office documents" is as crazy as saying a car, plane and ship are all similar because their use is to "get from A to B". To say that HTML, PDF/A and ODF are the same because their collective use is for "exchanging office documents" is as crazy as saying a car, plane and ship are all similar because their use is to "get from A to B" JPEG is used for storing and transmitting photographic type images, while PNG is more suited to logos and charts: they are designed for very different types of content. The DTD standard was created in the 1980s. RELAX NG in the 2000s. DTD was becoming dated and could not handle the more complicated schema formats correctly so a new updated standard was needed. Not by any means an ideal situation, but one that is irrelevant to OOXML and ODF. The TIFF standard, although, did what it was designed to do which was to create a standard reliable format for pre-press data. It (currently) simply handles transfers of bitmap data. PDF/X is a more versatile format created later and addresses some shortcomings in TIFF, including image compression, late editing and others providing for data transfer in different scenarios. Although these have similar functionality the difference with these is that they have nothing to do with maintaining compatibility with a specific vendor's product, as is the case of OOXML. In conclusion, although multiple format standards for the same content exist, they are hardly desirable, and are rare. Often they actually represent important differences in content, as in many of the examples given, and where this is not the case the reason is often that technology has moved on since the first standard was originally created, and that it is still kept for legacy reasons. ODF caters for editable office document exchange in the modern world. OOXML was submitted long after ODF's acceptance. On that score it is superfluous. Counter argument #2:. My problem with this This argument is incompatible with the real world: Microsoft Office document rendering varies between different versions of Microsoft Office, it also varies between the same version if different printers and/or fonts are installed, all making the above argument moot. Editable document format interchange is never going to be precise in rendering as there are too many uncontrollable variables, and no standard can control all of them, nor do I believe any should. There are other types of formats for precise rendering, such as PDF, mentioned above. Documents that require exact duplication should use that rather than an editable document format. Also, the point that OOXML's purpose is to represent the closed formats of a single vendor makes me wonder how that qualifies it for a standard in the first place. Standards are for interoperability and choice; basing one solely on a single product is counter-productive. Counter argument #3: ODF and OOXML cannot be merged but canco these two. My problem with this The two paragraphs above cancel each other out. Having analyzed the two formats myself I agree that they cannot be merged, my point is that OOXML should not be a standard. It is obvious to me that the best solution is to interchange and store the document using ODF and for the office application itself to "translate" it when loading and saving. Microsoft should interchange and store the document using ODF and for the office application itself to "translate" it when loading and saving it Objection: OOXML contradicts existing standards including ODF OOXML contradicts existing standards, in particular ODF (ISO/IEC 26300:2006), Representation of Dates and Times ( ISO 8601:2004), Codes for the representation of names of languages (ISO 639) and Computer Graphics Metafile (ISO/IEC 8632). Counter argument There is no formal definition of the word "contradiction" in a "Standard Format" scenario. If two formats can co-exist on the same machine and there are translators that have been written to interchange the two formats then a contradiction cannot exist. My problem with that The point of a format standard is that data interchange of that type should use it. The only exception to that would be if the world has moved on since the idea of standard's was conceived and it is inadequate. The existing ISO standards involving dates and times, language codes and computer graphics can cope with all the data of those types an office document program generates, and therefore should be used. Not doing so is a contradiction involving those standards; it is as simple as that. Also, if translators exist between OOXML and ODF then as ODF is an existing standard OOXML must contradict it. Objection: Thirty days is too short to review a document over six thousand pages long The OOXML specification is over six thousand pages long. Thirty days represents two hundred pages a day. It is impossible to adequately review the document in that scenario. Counter arguments - The term "contradiction" is not defined so it is adequate to simply consider an overview of the standard in relation to other standards. - The first draft of the OOXML standard was available in May 2006, seven months before the review period. Comments and contribution have been welcome from anyone since then.. - As part of the "fast track" proposal ECMA produced a fourteen page summary to facilitate understanding the OOXML standard. My problems with that - It is near impossible to review a six thousand page document in thirty days regardless of what the definition of "contradiction" is. - To review a standard you need the correct draft. It is pointless reviewing earlier ones as you do not know what may have changed. - To review a standard properly you need to read it, not just a fourteen page summary. Objection: OOXML has inconsistencies with existing ISO standards OOXML uses means of storing and transferring data that is inconsistent with existing standards. Namely Paper Sizes (ISO 216), Language Codes (ISO 639) and Color names (ISO/IEC 15445 (HTML)). There is an issue with the representations of dates and times (ISO 8601). This standard specifies the use of the Gregorian calendar, but OOXML treats 1900 as a leap year, which it was not, and cannot represent dates prior to 31 December 1899. This is because OOXML spreadsheets (SpreadsheetML) represents all dates as a decimal number either from 31st December 1899 or 1st January 1904 depending on the "Date System" set rather than the format specified by the aforementioned standard. ISO 8879 states that SGML tag names should be human readable and minimum emphasis placed on terseness, whereas OOXML not only uses short, abbreviated and also cryptic names it uses them in an inconsistent manner within itself, for instance, "scrgbClr". "algn", "dir" and "w" are not clear in meaning. References are also made to "Enhanced Metafiles" and "Windows Metafiles". These are some of Microsoft's closed formats and have no place in a supposedly open standard. The Computer Graphics Metafile format (ISO 8632) should be used for that. The OOXML standard is inconsistent within itself, as well as with recognized methods, of the representations of percentage values, which can be represented as a decimal integer - (Magnification Settings - 2.15.1.95), an enumeration of codes made up of a percentage integer prefixed with "pct" - (Shading Patterns - 2.18.85), as a code made up of an integer being the real percentage multiplied by 500 (Table Width Units - 2.18.97) and a real percentage multiplied by 1000 (Generic Percentage Unit - 5.1.12.41). Which one depends what part of the OOXML specification is being dealt with. Counter arguments #1: OOXML Page Sizes Page Sizes: The ISO 216 page sizes are represented in OOXML, as well as others. OOXML simply uses a number to represent each page size and what number represents which size is documented there. My problem with this XML is not meant to be cryptic. If a page size is Letter, A4 or C4, then it makes sense for the attribute value to be "Letter", "A4" or "C4", not "1", "9" and "30". Counter arguments #2: OOXML Language Codes Language Codes: OOXML gives the implementer a choice. Either the ISO 639/ISO 3166 combination can be used or a special two byte hexadecimal value as specified in the document. My problem with that If a standard is there, and it does the job, then it should be used. Putting these "optional alternatives" in is pointless and only detracts from adoption. The ISO 639 and 3166 codes should be used alone, the Microsoft specific hexadecimal codes should be dropped. Counter arguments #3: Color Names OOXML uses its own abbreviations for color modifications, "dk" for "dark", "lt" for "light" and "med" for "medium". It also uses it's own description of colors such as "darkRed" (OOXML) for "maroon" (ISO 15445) and "darkCyan" (OOXML) for "teal" (ISO15445); these are more meaningful. My problem with this These OOXML specific names are only more meaningful in the opinion of its authors. The purpose of standards is that if everyone uses them it will make the world a more meaningful place. Unilaterally defining alternative and/or redefining the actual colours in a standard that is supposedly open is a contradiction. Should the writers of Microsoft Office, or any other software authors, feel that "Dark Red" is more meaningful to their users than "Maroon" (for example) then there is nothing stopping them from calling it that in the application itself (though I would have thought inadvisable), it is just the standard (ISO 15445) should be adhered to in the interchangeable file. Counter argument #4:. My problems with this What a mess! There is no call nor need to support specific legacy applications that way. This is supposed to be a format for document interchange. Old unmodified legacy instances of Lotus 123 and Microsoft Excel will not be able to read it anyway. Catering to them in this way is pointless. There is no call nor need to support specific legacy applications in an open document standard by incorrectly making 1900 a leap year It would be a lot simpler just to specify the dates as ISO 8601 – for example: 28th February 2007 can be represented as "2007-02-28". No silly numbers from an arbitrary date, nice and simple. It should be up to the application to parse it and convert it to an internalnumber. Counter argument #5:. My problem with this OOXML is supposed to be a standard for document interchange that uses XML. One of the advantages of XML is that descriptive tag and attribute names can be used: this makes understanding and implementation of the standard easier. Using short and/or inconsistent abbreviations is not applicable to an open standard. As for comparing it to the HTML standard, there are two points to note. Firstly, that HTML was created and deployed before XML standards really matured. The standard that then ensued was thus not to the quality as perhaps it should be. Second is that the old version of HTML had about thirty tags or so making it relatively easy to remember them all despite their cryptic nature, whereas OOXML has several hundred making the sane naming of tags all the more important. Counter arguments #6: Inclusion of closed Enhanced and WindowsMetafiles This is mentioned on two occasions: the first - "Embedded Object Alternate Image Request Types"(6.2.3.17) the OOXML format mentions these formats in enumeration lists, any formats can be included. The specification does not limit embedded graphic types to those formats. The second - "Clipboard Format types" (6.4.3.1) – simply specifies suggested action taken by the application in certain circumstances and again does not limit the document's embedded graphic format types. My problem with this The enumeration list mentioned on the first instance (6.2.3.17 ) includes: Bitmaps, Enhanced Meta Files (EMF) and (any other) Picture format. The question I have is why single out Bitmaps and EMFs? This looks like they are trying to cater to specific applications, which is not the point of a standard. The treatment of those types should be the same for "Any other picture format" and the attribute should be dropped. The second instance should not be specified in an open document standard at all. The precise behavior of a particular application for particular (closed) formats is unique to it and not really transferable. Document standards are for interoperability of the documents itself, not a determination of how any particular application behaves: should this be needed for Microsoft Office then it should be stored in a more generic, application defined, "config" type field that does not infringe on other applications. Microsoft should store their unique quirks in a generic "config"tag or similar rather than on the main name-space Counter arguments #7: Percentage inconsistencies Where the percentages are actual values they have been converted to integers to allow for efficient parsing. Fractions of a percentage are catered for by multiplying the actual percent by a number. For the Shading Pattern (2.18.85) the enumerated code represents specific patterns where a value that can be used in calculations is irrelevant. My problem with this Computers can be used for calculations. They are good at that. The overhead for converting a percentage value of "27.32" into an internal integer value of I feel is simply the icing on the cake of contradictions. I admit that I can in fact find no ISO standard that specifies that percentages should be represented as a number whose range of 0 to 100 represents none to all; I think the reason for this is because the whole population of the world from infant school students to retirement home residents from Indiana to India use percentages that way: that is everyone and everything except OOXML. I do not see why percentages should not be represented as, well, percentages. I can see why the "Shading Pattern Codes" (2.18.85) should be a name rather than a value. However, should a more descriptive code be required in that circumstance then it should be something like "shadingPercent10" rather than "pct10" to keep it consistent with the other names of shading patterns. Objection: references to undocumented behavior in closed Microsoftproducts There are a number of tags in OOXML that are references to undocumented behavior in closed proprietary products, notably previous versions of Microsoft Office. These include "footnoteLayoutLikeWW8" (Emulate Word 6.x/95/97 Footnote Placement – 2.15.3.26) and useWord2002TableStyleRules (Emulate Word 2002 Table Style Rules -2.15.3.63). These reference closed proprietary products, and the behavior of some cannot be imitated unless the product is somehow obtained, and some of these products are no longer sold or supported by the vendor (notably the "footnoteLayoutLikeWW8" tag). Counter argument These are relatively few when compared to the large number of fully documented tags in OOXML, also it is not necessary for the implementor of the standard to cater for these. They are settings specific to those applications so those applications can behave in a consistent manner between saving and loading. It is worth noting that ODF and OpenOffice.org set this to "underlinelink" or "displayfieldcode". My problem with this On the face of that argument it sounds like a school child's lament of "Well they did it over there so why shout at me for doing it here". However the reality is different: no open office document standard can be perfect and cater for every application's quirk and scenario, but these applications need to store their own unique meta information and sometimes unspecified peculiarities for consistency between sessions. To this end, OOXML have chosen to select few applications – namely the ones in Microsoft Office and some WordPerfect formatting which Microsoft supports, place the features in the main name-space specification and then ignore all other applications. ODF on the other hand provides a mechanism for any application to add their unique quirks without breaking the standard. It does these by placing the "quirk" in a "config" attribute value defined by the application, not a name, and placing the setting in the body of thattag. In both the above it is important to remember that an open office document standard cannot, nor should not, reproduce the rendered document exactly. It is impossible because not only do documents render differently between versions of the application but between the same version running on separate machines of the same operating system. This is just as true for the Microsoft Office programs as it is for anyone else's: to duplicate rendered documents standards such as PDF should be used. In short, OOXML's method of dealing with the problem in effect locks out all applications that are not Microsoft Office, whereas ODF's method keeps the standard vendor neutral and usable by any office suite. OOXML's method of dealing with the problem in effect locks out all applications that are not Microsoft Office, whereas ODF's method keeps the standard vendor neutral and usable by any officesuite A misconception about ODF and OOXML There is a misconception about ODF and OOXML in existence which was highlighted in an e-mail interview between Mary Jo Foley of ZDNet and Tom Robertson of Microsoft. In it Tom Robertson wrote: The discussions around Open XML and ODF are a proxy for product competition in the marketplace. Ultimately, this attention and focus on the needs of those who use office productivity software is a good thing for all concerned, but the attention being paid relates back to the commercial opportunities for MS Office, IBM's Workplace (Open Client), and OpenOffice commercial offerings from Sun and others. For us, the move to an XML-based file format is an important aspect of Office 2007. I will not comment if I think he was intentionally lying when he wrote "The discussions around Open XML and ODF are a proxy for product competition in the marketplace". Certainly this is not true. The purpose of an open format is about about choice and interchangeability. There is nothing stopping Microsoft from placing an ODF file "save" and "open" facility in their Office suite(5). They have many other formats so why not ODF? They claim they have translators between the two formats so therefore there cannot be any technical difficulties: any quirks of Microsoft Office can be placed in the "config" tag mentioned above. After all, OpenOffice can open Microsoft .doc, .xls and .ppt files and save them as ODF with reasonable reliability and reverse the process, and it is not as though Microsoft do not have the resources to do the same in their product. Conclusion Going back to my argument with my brother. Microsoft have a large section of the market sewn up and the standard method of transferring documents there is by using their closed office formats. I believe they enjoy that position, and despite noises from their PR department, they would like to keep control of the document interchange format by whatever means possible in order to keep their monopolistic lead in the market place. I do not believe Microsoft are really interested in open standards, but just paying lip service to them. The history of the OOXML and ODF "discussions" supports this theory. OOXML is not as open as it's name applies: it ignores existing standards and it only fully caters for Microsoft Office programs making it near impossible for a competing product to use. By Microsoft's own admission it is simply an "XMLization" of existing closed .doc, .xls and .ppt formats. It should not be adopted by ISO, and certainly not "fast tracked". ODF is genuinely open. There is no reason why Microsoft cannot use it. Adoption of ODF will benefit everyone who is not trying to maintain a near monopoly in the Office Production Suite domain. One thing my brother perhaps should ponder considering his profession: improperly maintaining monopolistic practices and situations are usually considered illegal. Notes Note 1: Form the OASIS document Open by Design -: 2: Precise history is documented at. Note 3: IN Microsoft's open letter "Interoperability, Choice and Open XML" found at it states: "OpenXML was designed from the start to be capable of faithfully representing the pre-existing corpus of word-processing documents, presentations, and spreadsheets that are encoded in binary formats defined by Microsoft Corporation". Note 4: From ECMA'a web site -: "Ecma is the inventor and main practitioner of the concept of "fast tracking" of specifications drafted in international standards format through the process in Global Standards Bodies like the ISO." Note 5: From the ZDNet interview mentioned in the article Tom Robertson wrote "Office 2007 enables people to choose from many formats, and now the Open XML Translator has enabled read and write capabilities for ODF as well". ISO 8601 I may be misunderstanding ISO 8601, as I've only touched upon it in the past, but the example given in this article "2007-28-02"simply looks like a reversed USA date format. If I remember rightly this would be written 2007-02-28 in ISO 8601. re ISO 8601 You are correct. It is a "typo", sorry. The reason for this is... ...that a single-instance sort, upon the date field alone, will yield a chronological ordering of documents or items--without confusion. Simultaneous date field hits are resolved by time field ordering within any given date. This is a logical foundation for file name prefixes. Two thumbs up Excellent discussion of the topic. This is of tremendous help when trying to educate people about the concerns the free software community has with OOXML. Wow! Too much time on your hands. Who cares, as you said people without Microsoft Word can read the format anyway. It's become a standard because everyone uses it, a "standards body" is only needed when this doesn't happen and everyone has different formats. It used to be Wordperfect, if someone comes along with something better and everyone starts buying it something new can be the standard. Sure we could go to ODF and then the millions of people using old Microsoft Word would have problems. There are much better discussions to have. Get the Sun ODF plug-in for MS Office Get the Sun ODF plug-in for MS Office, and you can save MS Office documents in a format that everyone can read for all time. Try reading some of the older MS Office and MS Write formats with current MS Office products and you have problems. Set Microsoft Office to save as ODF as default, and MS Office users can kiss goodbye to forced upgrade cycles through planned incompatibility in file formats. That is why Microsoft and it's trolls are so violently opposed to ODF, and why Microsoft uses XML to wrap proprietary, undocumented binary blobs that makes it impossible for anybody except Microsoft to properly implement OOXML. The truth is that come the next version of Microsoft Office after 2007, Microsoft yet another new set of incompatible binary blobs, to create yet another OOXML format incompatible with the current one to force a user upgrade. That is after all the whole basis of Microsoft's business model, and the reason why Microsoft is refusing point blank to implement ODF filters in MS Office. I accept your argument that Microsoft through it's abusing control of bundling office suite software into OEM Windows has eliminated competitors like Wordperfect to achieve a market monopoly. Hovever I cannot see how this can be used as an argument for OOXML to be made a ISO standard. What is the point after all in an ISO "standard" that only one company (which already has products compliant products) can implement, other than to confuse the public into not adopting a genuine vendor neutral and universally adoptable standard, namely ODF? I mean why does OOXML need to be given an ISO number if only Microsoft can implement it? Even the name Office Open XML is expressly chosen to confuse people with the OpenOffice suite which is one of many products implementing the ODF standard. Forget the Sun plugin I downloaded it and it does not work with MS Office 2007 and it is useless without MS Office anyways. In stead use the Office Open XML plugin for OpenOffice created by Novell: (also provides OOXML support on linux I presume) or the opensource translator made for Microsoft: The Wraith MCAN Plugin? You Must Be Joking! The MCAN plugin (Microsoft, Clever Age, Novell) is not useful. The quality of the conversion is such that you are almost better off hand-typing the document in the other office product. Or even better, using the old binary Microsoft formats that are handled 85 to 95% accurately by OpenOffice.org. Among the things not supported: named styles, so most of your formatting changes are lost. Sorry but it does matter Sorry, but it does matter! Why? Documents are not only interchanged at this point in time. They are stored, archived and retrieved. In order to retrieve an archived document you must have software that is the original or compatible. However, commercial vendors and their proprietary formats tend to drop compatibility, once they have eliminated a competitive product. That means you can't access your document any more. Why is that different with an open standard? Well, because it is not a secrete and you are legally able to write any conversion to a new format that may have superseded it. And surely when many applications support the same (agreed upon) format then chances are much higher that compatible software will survive. Why is that important? Imagine you need the document in your divorce or to proof your inheritance. Image it is a document that proofs your claim to a piece of land or that you are innocent of a crime? K<o> Busy, documenting OpenOffice.org with screencasts Wow! You have too little time to save your life! Say, if you buy a freezer and start using it. However, the freezer is so designed that once you put your food inside you cannot transfer it to another freezer of a different make, because its incompatible anymore. Would you accept that? Why then do you want to lock your data/intellectual thought/hardwork/whatever in a document format (eg., MS Word's .doc fromat) that would be reliably readble only by a single vendor's product (eg., MS Word)? Even worse, imagine if you would need the exact same model in the freezer example, as is often the case with documents–you often need the same exact version of the software for complete reliablity. 39 days I don't know why you complain about reviewing the standard in 30 days when the timeline for a fast track submission is 6 months. More than 6 months A fasttracking proces in ISO takes a minimum of 8,5 months and most likely close to a year. The even faster PAS proces in ISO standardisation used by OASIS for ODF is about 2 months shorter. The Wraith I think you misunderstand the 30 days... The 30 days is to decide _IF_ MS-Office XML will be placed on fast-track in the first place, not the fast-track process itself. Those opposed to the ECMA MS-Office XML as an ISO standard only have the 30 days to review the 6000 pages before deciding on whether or not to fast-track it in ISO, and to detail their reasons. The argument at this point is not even if ISO should ultimately approve it, just whether they should fast-track it. I personally do not want to see the ECMA standard fast-tracked by ISO, and ultimately hope it fails to get ISO approval at all. The only reason you guys The only reason you guys rail against the standards process is because the only lame argument is that the format used by the most people is not technically a standard. lol. intellectual dishonesty. OH MY GOD I am anonymous, and I have no idea who you are, either. This reminds me of the amazing effort on Wikipedia. You know the guy who mapped all the timelines as they winked in and out of existence through the course of all the Back to the Future movies? Yeah. That. Wow. Just so much concentrated stuff here! A the usual ODF good, OOXML bad article How about highlighting the horrors in ODF as well. The standard as a whole is basically a dump of OOo internals, in important areas it's dangerously weak, like the fact that the entire Spreadsheet spec is depending on your method of counting 4-10 pages. Nobody can implement a spreadsheet from that.. nobody. ODF is a horrible standard, compared to it OOXML even with it's own horror looks like a work of art. But that just goes to show the type of honesty found in the ODF camp, proponents are entirely unwilling to acknowledge shortcomings of their standard while all to willing to point out flaws in opposing standards. Instead we should seek to build one truly good standard, an extensively described standard because neither is currently good enough, though as a long time Linux user I hate to admit that in this case Microsoft hit way closer to the mark than we did. They did an extensive standard, suitably verbose but with ugly spots.. I'd take ugly over missing - at least I can implement ugly, there is no way I can sanely implement missing stuff without doing guesswork which will lead to errors and thus bad user experiences, broken documents and assorted pain. For the usual OOXML advocate I will rise to this comment - I assume you are not a troll. I have some familiarity with the internals of OOo, and more than some familiarity with the ODF spec. I can assure you there is no way ODF is an internal dump of OOo. Remember OOo's "native" format was originally "SXW" files, but they adopted ODF after it was developped with others. Although there are about ten pages EXCLUSIVELY devoted to spreadsheets in the ODF spec there are hundreds of pages relevant to spreadsheets. The entire table, formatting, styles, charting, base settings and the bulk of the other functionality are shared with other parts of the office specification and are not included in those "10 pages". The entire thing fits together well and is well planned. No one claims that ODF is perfect, as can be deduced that ODF version 1,1 is on it's way, however it is based on sane XML and existing standards. OOXML is not, nor do Microsoft pretend that it is. They justify their peculiar XML naming structure as required for "performance", and they almost admit that THAT IS an XML-ization of the .doc,.xls and .ppt files. In fact they promote that as an advantage for tham. Interoperability is not on their main agenda. I have analysed ODFand OOXML, and although ODF is not perfect I believe it is a "truly good standard". It is vendor neutral and well thought out. I am not a Microsoft hater, nor do I think users of MS Office should switch. I believe microsoft should stop playing the bully and adopt ODF for document interoperability. As I said in the article, it is not as though they cannot do so... Yours Eddy Hah! Another Bill Gates crony.... [QUOTE]ODF is a horrible standard, compared to it OOXML...[/QUOTE] You've just proven you don't even know how to spell XML. You're the last person in the world to comment on the quality on an XML format. What's next This is indeed an excellent summary of the issues, including the legitimate contradictions and the ECMA whitewashing of same. What I would like to know is, what now? Will the substance of this article be used to formulate an appropriate reply to ECMA by parties with the appropriate position and influence? If not, I fear that even a well-thought-out argument like this one will ultimately go no where. So, what *is* next? Will you be working to proactively lobby your government and, through international proxies, others to reply to the ECMA spin? What a zealot style arguments you do. Most of your arguments are lame because you hate Microsoft. You are letting the hate cloud your judgement. I loved your really stupid argument: ODF lets any application define meta tags and stuff them in the document whereas Microsoft uses only for few applications. Well go figure who is better. To me as long as i don't use those special applications, all documents created with OOXML are better. OTOH ODF applications may create 100s of different incompatible ODF documents. And then your argument on why there shouldn't be two standard. My question is why not? Why is there not a single OS? Why is there not a single application itself? Why not have two standards that compete to be better? Why you want standards monopoly? Most of your arguments i find are pretty bad. I wouldn't go in the details of each as i will let other readers see that through. Btw If you are trying to promote ODF then you are doing a dis-service to them. If you were a lawyer, i am sure people would have stripped you off your degree. First take your biases away and then argue... Corporate politics Now put your corporate hat on, and think about how you would influence the market. Certainly Microsoft, like any other corporation has to think this way. - If I control the data format, I control a key point: nobody can be 100% compatible with me, and I only need to introduce the fear that your documents will break if you use the non-native software. Plus, I can rely on a steady income stream as I force people to upgrade their software to maintain compatibility with their - As a consequence of the first point, I will do everything I can to keep the data format under my control. It's ABSOLUTELY key to my future revenue. (And remember in this case, the MS future revenue is $ billions.) - I will not open the document format as standard. That would damage my future revenue. However.. - If I am forced by the market to open the data format, I'll work very hard to make sure that the open format is closely tied to my product. It's not quite the same as having complete control, but if the standard is tied to my product then I can establish variations in later products which break the standard, but become the de-facto standard over time. And voila, I'm back where I started! You won't be able to use the standard without my software. - If a competitor standard is available, I will not implement it. Or, if forced to implement by the market, I'll implement it in a broken way. Under no circumstances do I want a document format which is not under my control to take hold in the market. (Remember that future revenue?) I won't ever support the most current version of a standard. - If a competitor standard is available and taking hold in the market, I'll do all the mudslinging I can. (Oh wait, look at the previous comment!) - I will whereever possible look for ways to break standards. That includes outputting badly formatted documents; incorporating bugs in my software which crash my software when the format is used; or which corrupts the data subtly. To underscore your last To underscore your last point: Microsoft and standards: Expert Testimony of Ronald Alepin in Comes v. Microsoft - Embrace, Extend, Extinguish (There was a wealth of very enlightening material on the web site for the trial. The web site is down but the exhibits are still around.) My favorite bit from Exhibit 3096 ("Evangelism is war"), from a company-internal presentation to Microsoft evangelists: "We must earn the support of ISV's ... We work hard to help our ISV's succeed! ... So, We're Just Here to Help Developers, Right? ... We're Here to Help Microsoft! Microsoft pays our wages. Microsoft provides our stock options. Microsoft pays our expenses. We're Here to Help Microsoft By helping those developers That can best help Microsoft Achieve Microsoft's objectives. Did anyone miss the point here?" It might be the case that by standardizing OOXML, Microsoft doesn't try to help its customers or the developers of free software Office alternatives as much as it tries to help Microsoft. That's the concern. Maybe Microsoft's intentions are all good this time (yeah, right!), but it might not be clever to trust in that. I'd suggest trying to understand an argument before opposing it ...as otherwise one sounds like just the sort of zealot one is attempting to paint one's opponent as. With regard to the application-specific config tags, for instance -- these are intended for application-specific configuration, ie. information tangenial to the document content itself. The content is still readable and renderable by all compliant implementations -- but if an application is designed such that some piece of user configuration is stored with the document, it's free to do that. Further, any vendor interested in reading another vendor's app-specific configuration (should they in fact have a comparable switch) is of course free to do so. As for your "why not?" regarding multiple standards, one might as well ask what the point to standardization is at all. Why not let competing railroads use incompatible widths for their tracks? Why would you want railroad track width monopoly? If any of 'yall folks arguing the Microsoft position are in the Austin area, I wouldn't mind getting together for coffee some time; I really would like a chance to meet and chat with you face-to-face. I'm charles at dyfis dot net. Re: What a zealot style arguments Your argument is whimsical and emotional at best. Its very clear you are in bias of Microsoft's side yourself. You took the easy way out saying "i will let other readers see that through", which translates to "I'll let someone else provide the evidence", when you clearly have NONE. At best, you went on a personal attack with "If you were a lawyer, i am sure people would have stripped you off your degree." That's just typical behaviour of someone who has NO CLUE of either OOXML or ODF standards. I bet, that you are using MS Office 2007, and you have fallen in love with the interface. Let me give you an example why its a bad idea to have 2 standards. If you do engineering, you have to study both the Metric and Imperial systems for length, weight, etc. That is, in Australia, UK, etc, we use kilograms, metres, etc. In USA and anyone else who uses the Imperial system, they use pounds, miles, inches, etc. So what happens when you do a group project from people around the world? You get an accident or a potential problem waiting to happen because not everyone is clear on which standard they should be using. And this confusion DOES happen in real life, not just in theory. NASA has experienced this very issue, and it has resulted in a loss of a few million dollars of US taxpayer money...Flushed down the toilet. So you want the entire world to waste time and money converting docs back and forth between two standards? (Time IS money) You speak of "standards monopoly", when the only company that is trying to avoid an international standard that is ODF, is the very company that is known for monopolistic practices! That's right, MICROSOFT. They developed OOXML because they knew they'll lose control! They could've adopted ODF, and NO ONE was forcing them not to. They chose NOT to accept ODF on their own accord. Why? Because the whole point is about control. CONTROL = PROFIT. Microsoft controls documents standards in an effort to corner everyone to use MS Office. They will NEVER release ALL the details of their document formats, and you will be forever needing MS Office to achieve 100% accuracy in reading doc. This is why when you try to open a doc file in OpenOffice, Abiword, etc, you will always get some issue with the layout. Microsoft knows that the average user will never accept other office applications when it cannot read their files correctly. This is how they keep their dominance. They make it so that you need them, and there's the feeling that you cannot leave them. The point of ODF is to allow EVERYONE (including Microsoft) to agree on one document standard that the WHOLE WORLD can adopt. It frees everyone the need to specifically use MS Office. They can use whatever office suite or application they choose. And that's the point. NO ONE is tied down to Windows and MS Office. NO ONE is cornered into paying for a copy (license) of MS Office. (which is what MS does NOT want). This is a point you've COMPLETELY fail to understand. I can tell its completely over your head. YOU ARE doing are MAJOR dis-service for OOXML by putting YOUR personal opinion into it. Your personal opinion has NOTHING to do with the document standards. OOXML isn't a completely open standard. It has proprietary or vendor specific functions that you need to know in order to get it 100%, if you were to implement a word processing application yourself. Such functions include: Section: 2.15.3.6 autoSpaceLikeWord95 (Emulate Word 95 Full-Width Character Spacing) Section: 2.15.3.26 footnoteLayoutLikeWW8 (Emulate Word 6.x/95/97 Footnote Placement) Section: 2.15.3.32 mwSmallCaps (Emulate Word 5.x for the Macintosh Small Caps Formatting) Section: 2.15.3.51 suppressTopSpacingWP (Emulate WordPerfect 5.x Line Spacing) So don't pull this nonsense about bias. Its bloody obvious who's bias here. Microsoft talks about "interoperability", but do they really do it on their own accord? OR is this all a farce because the EU's anti-trust case is pushing them into it? Seriously, if MS wants interoperability, all they had to do is completely open their formats. Then there will be NO NEED for both ODF and OOXML in the first place! They won't, because the ultimate goal for them is to profit on a massive scale. To profit, you need to control and corner your customers into playing your game, under your rules. In the tv show, 24, Jack Bauer calls this kind of thing: "leverage". And that's the key issue. OOXML only exists because ODF exists. ODF exists, because Microsoft won't COMPLETELY open their existing formats to the world. This is all because they want you to be completely dependent on a specific application or product they happen to be selling...That is, MS Office. What a zealot style arguments Why not have two standards that compete to be better? Why you want standards monopoly? Why a Standard Monopoly? There is absolutly no reason not to have a standard monopoly. Monopolies are good when held by standards, but they are terrible when held by companies like MSFT. If there is a standard that has the monopoly, if anyone wants to make a program to break that standard, that program will fail in the market. If a single company has a monopoly, only that single company can make programs. Why not 2 Competing Standards? If standard monopolies are good, competing standards are bad. What is a standard? A way of doing things agreed upon by all. With that in mind, there can be no such a thing as "competinng standards", unless one is declared the winner and the other exterminated. Having 2 standards only leads to one of two things: confusion and/or wasted development resources (which will come with an increased number of sickening insects). Gee, there are two standard ways to implement the feature I want to code, which do I implement. Or do I need to implement both? Extermination is exactly what MSFT wants to do with ODF. It has no intentions of competing with it. If OpenXML becomes a "standard", it will win this fight not because of technnical merits but beause of installed base. If MSFT looses in this fight, many governments (worst case) worldwide will no lonnger be able to use their format, which will mean that people will want to use ODT atleast for comunication with their government, which will mean that they will be introduced to a differrent format than theirs, which will mean that they'll demand good support for itt of their office suit, which will mean that cuite a few will choose (rather than be forced to choose) the ODT format, which will mean that MSFT will loose their hard-stolen monopoly powers, which is something that they definetly do not want. So which are we going to have, a standard office suite format, or the current propietary non-standard? "anti-<favored one>" and "<favored one>-hating" arguments, I've found in a lifetime of defending what I believe in, are signs that someone has not done their homework. Could you please define what you mean when you say "because you hate Microsoft"? What part of Microsoft are you defending? What behaviour of Microsoft are you defending? Who are you defending in Microsoft's "hallowed halls"? What division? What part of Microsoft do you claim is under attack? For what reason? In short, I find your arguments unconvincing and shallow. For my part, I remember only too well the constant refrain of anguish in computer mags every time Microsoft released a new MS Office version, as people found, much to their dismay, that old, well-loved (or at least -tolerated) file formats, etc, were not fully supported in the new versions, and the people complaining had lost some important part of their documents' formatting. And that was from people who used MS Office professionally. Given such a track record, I think it wise to look such a gift horse in the mouth - it's not guaranteed to have any teeth. Stupid ...apart from the fact that, being an open standard, it's fully documented, therefore relatively straightforward to apply. D'OH! MS OOXML I agree that open standards are best, but ODF has major shortcomings in it's spreadsheet format. MS XML has won it's raison d'etre fair and square. ODF will have to improve it's spreadsheet before they can truly make MS irrelevant. Archival Documents Nice article. I learned quite a bit from it. One thing that could be addressed more is the need for interoperability over time, not just interoperability from one currently-available application to another but to posterity's available applications. You hint at this with your mention of reliance on undocumented internals of older (and currently unsupported) applications. When looking to the future this becomes more important as more and more vital data is stored electronically. yeahhh wow, what a great article, i agree with everything you said, MS scumbags are trying to keep the monopoly on the office apps by making up their own standards, there shouldn't be more than one way for doing something, as if there are, none of them is a "standard", if a new standard is needed, then the previous standard should be improved to accommodate the needs, to the MS-fanboy above: its called a "standard" for a reason you moron, its not designed to compete against microsoft standard wannabes, MS is anti OPEN anything, not integrating the ODF into their office apps is a clear proof of that. dates and times The 1900/1904 distinction is needed. These dates get used in spreadsheets. People actually put dates into spreadsheets AS INTEGER VALUES. No joke. There are business-critical spreadsheets that compare dates against literal integer values. I mean "123456" and such. The 1900/1904 distinction changes the numbers in use. Spreadsheets are wrong if the wrong values get used. Dates and times conversions There is no reason for the date to be stored as an integer in the saved tranferable file. The conversion between dates and numbers - however they are entered or what formula is used - should be done in the applications themselves. A date should be saved to file and transferred as a date regardless of how it is created and manipulated in the application itself. Eddy Dates and times conversions You could justify the use of an integer format if the aim was to make your dates independent of any particular calendar system. I don't know whether the concept of a Julian day number has ever made it into an ISO standard, but it is an important and well established one. Of course, what's much more difficult to justify is a time scale which is almost but not /quite/ linear, with a discontinuity chosen to suit the agenda of a particular company with monopolistic tendencies. Date conversion is not evident There is no realiable way to convert simple numeric date types into complex ISO dates. Numeric dates have severly limitations in interpretation. However this makes them very usefull for calculations. You can actually use date information fields in normal spreadsheets to multiply with. For this use ISO dates are useless. Hoever converting from numeric to ISO and back requires interpretation of the context of the spreadsheet. This is in general beyond the scope of spreadsheets. We will have to wait and see what the ODf implementations and the OpenFormula's committee comes up with. Suggesting that numeric dates can be converted to ISO dates and back is however not evident and no 100% reliable measure for conversion them in spreadsheets has been found. This means that spreadsheets for 100% reliablity should also use a complex internal date format that is equivilent wiht ISO dates and also that they not be 100% reliable with legacy spreadsheets. The whole date issue is much more complex than beats the eye. I am amazed that serious ICT expert think that using ISO dates in spreadsheet is a good solution. A much better solution would have been to use ANSI's date1600 format in both ODF and OOXML spreadsheets and then have the date1900 and date1904 formats only for deprecated legacy use in OOXML. The Wraith Date conversionss..... No there isn't I have been a programmer and a programs designer for more than ten years. It is fairly easy to show combinations of date files you can't reliably convert to ISO dates. You suggest Excel can but I often have to tell Excel to display certain fields as date format manually. The fact that you think there is 100% reliable conversion possible shows that you still do not fully understand complexity. Oh yes there .... ISO 8601:2004 represents dates as YYYY-MM-DD. This is unambiguous. Eddy Prove it Care to give an example or two of dates that can't be converted? An example I'll try I have several numeric fields in that are in a single hidden reference column but formatted as dates. They contain values 39083.00; 7; 12; 28; 30; 31; 365; 366. Only the first one is really ment as a date the others are just poorly formatted as a date when the whole column was formatted Somewhere else on the visible spreadsheet part are other date formatted fields that are a combination of these fields based on whether you want monthly or weekly paychecks. How to store these fields in your ISO format and get the same results the original spreadsheet did? Weird coding? It seems you have written non-portable macro code that uses a feature almost exclusive to Excel. As a programmer I would suggest the cells should be "formatted" correctly to reflect what they contain. I would suggest this has nothing to do with interoperability but coding practices. Eddy no macro It appears you agree that the suggested spreadsheet cannot be reliably converted using iso dates. The suggested example has nothing to do with macro's but is an example of poor formattting by the spreadsheet user. For 15 years all kind of spreadsheet users of have at will mixed numeric and date fields and combine them into formula's and references. The basic problem in conversion of spreadsheets with numeric date fields to iso date field is that there is no reliable way to determine if a numeric vualue is ment to be a real date or just a numeric value. A real user can probably easily determine that because such a field might have a big label above it stating "Employed since" but an automatic program cannot interprete that kind of extra info. Aren't this numerical values? I fail to see the problem. The values are interpreted as dates at runtime and stored "as is" in the file as numeric data. No need to convert to or from dates, they aren't dates, they are just treated like ones when loaded. That is exactly what OOXML suggests you do !!! Wow, you are exactly describing the exact properties of the date1900 formats in OOXML. Storing them in a file as numeric, no need to convert and interpreting as date them on runtime. Amazing... That is exactly what OOXML suggests you do. You just gone from someone against that date format now describing it as a solution. Not at all Except for the first one, they look like date differentials or definitions to me (a week's worth of days, a year's worth of months, etc), so without a baseline date (which I presume the first one is), they can't (shouldn't) result in dates. They could just as easily be a bunch's worth of bananas, or a carton's worth of eggs, so, yes, since they're not dates, they should be stored as numbers, and converted to a date if/when they need to be made permanent. The first one, however, should be stored as an ISO date (whatever that date's value is; I don't know or care, but I would know if it were ISO). Numeric date They look like is a good description. I picked numbers that might have some meaning to people. However a conversion program cannot distingish between numbers in that way. Also we stil have no idea how ODF will solve things like subtracting dates which can have different time-zones, how ODF will deal with iso 8601 periods in formula's and lots more. I think that when ODF finally shows up with a formula's languages they will probably have reduced the ISO date format to a subset that can be represented by numerics completly dropping timezones and periods and anything that gives iso dates more value as a format above a numeric format. Else it just would be to hard to implement for every software builder. A ISO date is just a complex representation of a continuous timeline. A numeric date is a simple representation of a continuous timeline. For use in spreadsheets, ISO dates are overly complex and will need to be toned down dramatically so they are not much more than a formatted numeric date. ... No, a conversion program can't recognize the meaning of different numbers, which is the entire problem of using the 1900/1904-based integer in the first place! If the timezone is specified in the ISO date, there's no problem whatsoever with any manipulation, and if not, well, a user has the same problem anyway when entering dates: are they entering the current timezone? Universal? Something else? Not a unique problem. I think that you underestimate software builders, and overestimate the difficulty of implementing ISO 8601, but time will tell. ISO format would be a good choice if... Using the ISO 8601 format would be a valid ch=oice is there was a need for the more advanced features this format has. So if there is a requirement for timezones or datetimeperiods to be stored in spreadsheets cell (and I must say I have never seen anybody even remotely suggest such a requirement) then the ISO format would be a good choice. But at the moment date storage requirements suggest that a low level numeric date field is still a logical choice. Also in the OOXML spec a subset of ISO 8601 dates for spreadsheet cell storage would be be easy to add in a future version (allthough not nescesarily easy to implement). The Wraith We say about open format... Sorry for my english :[ Convert datetime to numeric is very easy, and nobody has question about this. But all discussion about converting numeric to datetime. I have done one test in OpenOffice Calc: set cell A1 = 1980.01.01, set cell A2 = 1 and A3 = A1+A2. After that, I have formated cell A3 to DateTime (dd.mm.yyyy) and have got display result = 02.01.1980. Then save file and have seen that OpenOffice write into file. What do I see? First cell have value = 1980.01.01, next cell = 1 and last cell have formula. It is very clear. But if first cell have value like Open XML that I have seen value = 29221. And if I don't correct use base date (1900 or 1904) I will have error, but I never have error with OpenOffice format. When we use open format we must know how convert value to date Sergey Bitmaps, Enhanced Meta Files (EMF) and (any other) This is how GDI+ (gdiplus) works. An EMF can be old-style plain GDI, pure GDI+ (embedded in "comment" blocks in the EMF!), or a hybrid that can be rendered via either GDI or GDI+. So within an EMF, you have comments. Within the comments, spanning them in fact because comment size is limited to 8 kB, there is an EMF+. The EMF+ is composed of many records. One type of record is the "Object". There are different types of Object, including "Image". An Image Object can be a Bitmap, EMF, or other. Note the recursion. The Image Object containing an EMF may in turn contain an EMF+. Also, the "other" could be HTML (IE7) or OOXML or Windows Media Player data or whatever. Obviously this can and will be abused; the plan is clear. That said, a document format ought to allow embedding anything and everything. One might even embed OpenDocument, LaTeX, *roff, XCF (Gimp), Adobe Illustrator, or Postscript data. Enhanced/Windows Metafiles and Bitmaps Actually ODF also supports OLE embedding and linking ODF has created a special object for OLE linkings and embedding. You refer in OOXML to just a type value but on the other hand you think creating a special embedding method for it in ODF is ok ? This is much weirder in ODF as they are supposed to only create interoperable documents and it now has OLE linking and embedding in it's specifications which is not on available on all platforms. Both support it, but... Both ODF and OOXML support OLE linking/embedding - OOXML however specifically treats MS proprietary closed formats as special. Eddy That is an embarrassing That is an embarrassing reply. Firstly because ODF also has special embedding for Sun's java applets as well so it is not just something from MS that get special treatment in ODF. Secondly because OLE linking and embedding is not limited to embedding of propriety Microsoft formats or closed formats what you are suggesting. You can also OLE embed ODF files in OOXML and OLE embed OOXML in ODF. Thirdly you mention a special enumeration type for OLE embedding as an issue/problem in the OOXML spec but when it comes to ODF special exemptions in the specs it is suddenly ok ??? It look like watching at the different specs with a double standard. To embarrassed... See this comment. Eddy To be or not to be... standard "I understand how people can see it as a standard. Except it is not." Standards: De facto or De jure. Office's format may not be the de jure standard since it hasn't been established by law but like it or not due to its high market penetration it is a de facto standard or standard in "practice". Which one is best? That's open to argument but tt is important that people recognize the difference before really make assertions about which is more legitimate. Standards: De facto or De jure. Except that Microsoft keep changing the "de facto standard" so you have to keep upgrading you copy of Office. :-( I find it very amusing... ... that 95% of the arguments for OOXML simply trumpet the same arguments, always put forth without evidence by various Microsoft shills and PR guys. Have people really lost the ability to think? Lot of opinion, little content Your document is one big container of opinions that have little to do with reality. Where were you when ODF was ratified trough ISO. ODF standard is not ideal either. An example. You state: Why is there a special enumeration type for meta files or bitmaps. So why has ODF special embedding objects for java applets and other embedding for other objects ?? So why is ODF as an interoperable format not supporting ISO 216 standard paper sizes but has it in stead flexible printer paper sizes which are not really interoperable unless they happen to conform to a standard which means that standardization is implementation defined in stead of format defined. You are also suggesting that a converting stringtype percentage to a numeric is hardly more demanding than converting a decimal number. firstly you should understand that a decimal point is hardly a standard. I use a decimal comma. For a name that requires stringlike verification anyways thatis not a problem but for a value it is actually is. Storing decimal numerics without a decimal point is actually more standard than using a decimal point or a decimal comma. You state that Microsoft should store their unique quirks in a generic "config" tag or similar rather than on the main name-space. Reading your article I will now state that if they would have done you would now have written about the evil Microsoft hiding Office setting in config setting that are actually completly non interoperable by design. ODF's config setting items are a huge implementation nightmare. Only an ODF fan would suggest they are a solution. Even the custom tags in OOXML are far better as at least they require custom schema validation and are unique because of the XML custom namespace use. Your oppinions are noted but seems like you based it purely on onesides very limited research and knowledge of format issues with OOXML while you seem to support ODF which has also lot's of it's own issues. A big issue of ODF is that this standard made for interoperability does not know any two interoperable implementations yet. Is OOOXML an ideal standard ? No. But actually fasttracking standards never are because they are standarsds derived from existing technology. It is easy to hammer on OOXML for it's compatibility issues which aren't always the optimal solutions but frankly this whole article feels like you would not have minded the same issues if they just would have been in a format that was used by OpenOffice !!!! The Wraith Content and Opinion The Wraith: Thank you very much for your comments. I agree with you that ODF is not perfect, I never claimed it was, but after examining both ODF and OOXML I would say ODF was miles ahead as a candidate for a standard, in fact I think OOXML does not meet the basic criteria to become one. I agree with you on the ISO 216 and ODF - it should support it instead of just storing the page widths and heights despite it is easy for an application to extrapolate the ISO 216 name from the sizes. What ODF should not be changed to do is make up it's own non-standard cryptic page names which is what OOXML has done. As for your arguments on the "config" tag I think you have missed the point of it. Microsodt Office has unique configuration settings only relevant to it, so does OpenOffice.org, so does KWord, so does AbiWord, so does Lotus Notes, so do every other office suite in existance. At the moment I can create a file in KWord then load it in OpenOffice.org and then in AbiWord. Each presents and can manipulate the content satisfactorily and pass it on. Although some configuration option changes were not transferred because they were unique to the previous application does not effect interoperability. To limit the "config" options to those of one application simply is limmiting the format to that one application locking out use by all others, some would say that is Microsoft's goal. For instance, when using OOXML it is possible to specify formatting quirks unique to MS Word 2003, but not possible to state the ones unique to KOffice. That means that MS-Word can save and load the file without problems, but Koffice cannot as settings would be lost in the interim making the format impossible to use with Koffice. However, both Koffice and Word can use ODF satisfactorily (or could if MS were not so negative about it). Although unique application settings could be lost when passing the document from a user of MS-Word and KOffice, and I agree that is not perfect, it is a million miles better than simply ignoring KOffice and all other non Microsoft office programs exist. Hopefully in the future applications can store and pass on "config" settings not applicable to it in a manner similar to the "about:config" screen in Firefox. However, the lack of this in current applications is the fault of the applications, not the format. Most configuration settings define some precise operation and rendering quirks. Operation quirks are not relevant to inter-operability and to transfer a precise representation of a rendered document you should use a standard like PDF, not an editable document format, which is really for work-in-progress transfers. As for accusing me of criticizing Microsoft if they tried to improve relationships with other office suite vendors, you have me very wrong. I would be singing their praises if they did that, but unfortunately they are not. As for the JAVA Applet point. JAVA is not an ISO standard, however it is on the verge of becoming an open source project and is run by the Java Community through the Java Community Process and it's APIs are published, also the APPLET tag was taken straight out of HTML4. Although this does not make the APPLET tag ideal again it is a million miles better than including closed proprietary formats in what is supposed to be an open specification. Am I one-sided? Maybe I am, but that is AFTER I analyzed both ODF and OOXML specs. I came to each spec with an open mind. ODF is not perfect as a standard, but OOXML is unacceptable as one. ODF IS interoperable, and being used as such. OOXML limits functionality to that of Microsoft Office. It would be nice if Microsoft joins the rest of the world in supporting ODF properly, such us including it in the Save/Open dialogs and being able to make it the default format, then these arguments and articles will all become moot and we can move on happily exchanging documents with EVERYBODY. Eddy ODF petition Could I point out that there is a petition here, set up by me, to persuade the UK government to standadise on ODF I prefer seeing the whites of their eyes Charles, I wish I was in Austin, we'd be having that cup of coffee today. I doubt we'd convince one another of anything, but I've found it difficult to locate people willing to debate these issues in person. Cheers, Doug ODF and long term access Excellent article. My one comment is that your brother should consider long term access to his documents. Has he ever tried opening Word documents from a few years ago? Only an open standard remains accessible into the forseeable future... even if the software to load your document is no longer available, the fact that the standard is open ensures that you could (in a worst case scenario) consider writing custom code to load your old document. Referral from Groklaw I was referred to this page via Groklaw on saturday. I also commented on Groklaw. However Groklaw removed just about all of my comments from this page: It is sad that anti-OOXML sentiments leads to removing of comments on what once was an open site. The same for comments made on the grokdoc objections discussion page (points 22-31) which are ignored because they are not in line with groklaw's anti-ooxml policy. I notice that many of the objections mentioned by opponents of ooxml (including a lot by the national bodies and on this site) refer to the objections found on the Grokdoc/Groklaw discussions. It should be worth mentioning that those objections are based on a policy of removing ony opposing oppinions. The Wraith. (quite shocked by Groklaw's comments removal policies...) Detailed URLs For anyone following along at home: Here is a diff of the edits Mr. Wraith, (trading under the name HAI at grokdoc, apparently), added: EOOXML_Objections_Clearinghouse&diff=6706&oldid=6699 and here is the edit in which they were removed: diff=6719&oldid=6716 As far as I can tell in reading the history, NO comments by HAI/The Wraith were removed from any Talk pages, contrary to what e claims above, however, comments were removed from the EOOXML Objections Clearinghouse page, per the claim that they were not objections to EOOXML, which they wern't -- they were discussions about the objections, which were addressed and discussed on the talk page. I can't comment on the claimed removal of comments at groklaw.net, as it lacks a public history review function. -- An otherwise uninvolved reader. Groklaw, not grokdoc Most of my comments were made in this article and sever articles in the weeks before that: Of course you won't find them anymore as they were removed. Try adding in a article positif on OOXML or nagatif on ODF and it is gone in a few minutes The Wraith. It seems like you had violated Groklaw's posting policy That's why the blog host trapped you; if you are indeed the same Anonymous person referred to in this response to a similar lament there. Honest opinion is always welcome on Groklaw. Not so dishonesty, personal attacks or bad language. All this is made perfectly clear on the very page where postings are authored, and it has been the subject of countless discussions over the years. Fact is, since we are only guests we have to abide by the house rules. I never saw your many postings, I think; according to PJ, not many others ever did either. -Roland I think honest opinion is I think honest opinion is only welcome on Groklaw if it supports the views of the site. The Wraith Standards Debate For those of you arguing the need for a SINGLE, OPEN STANDARD, how would you be arguing this point, or doing anything on the WWW, without a single, open standard, called TCP/IP. That's right. Single OPEN standards create growth, collaboration, entertainment, financial opportunities, education, and so many wonderful things (porn included). Without standardizing on a SINGLE, OPEN STANDARD, we would not be communicating. Novell would speak IPX, Microsoft would speak non-routable NetBUI, and the only people on the Internet would be the Net BSD folks. So stop bringing up petty arguments for why 'there should be more than one standard', 'de-facto standard', or 'who cares if Microsoft uses proprietary extensions' crap. If you feel there should be more than one 'standard', turn on NetBUI (you will have to add it, unless you are running Vista, because Microsft stopped supporting it, just like all the other MS de-facto standards you buy), and get off of our SINGLE, OPEN STANDARDs based TCP/IP network. Brick Date formats The date formats reminded me immediately of "Office Space" movie. IOW, I think, EOOXML is good for industry: we would need to hire more people to convert year from "two digits" to something human readable! Date format issue not about readability What has human readabiltiy to do with storage of dates in an spreadsheet file in a zip package. Showing a date to a user in a spreadsheet is determined by the included formatting and the implementing application. Actyally we still have to wait and see how ODF inplementations will deal with showing dates according to their timezones. Will spreadsheets convert to the timezone of the reader or show the date in the timezone of the maker ? How will those spreadsheets deal with files created in ne timezone and editted in another timezone. Remember that in spreadsheets in general dates are generalle inserted without with a timezone so that it is up to the implementation to apply a timezone. Enjoy the hell that is ISO dates when using spreadsheets globally within a company. At most ISO 8601 should be an alternative storage format for dates in spreadsheet cells. However the complexity of such a format is startling and people do not understand that it is MUCH MUCH more difficult for spreadsheets interpretation than a numeric format. Having build a small spreadsheet once the idea of ISO dates alone is just giving me headaches If MS buys into ODF, the games REALLY begin [anonymous *coward*? no, just too lazy to remember yet another login . . .] If MS should abandon OOXML and adopt ODF, we know from experience how they work with standards. As they did with HTML. They soon tack on their own "enhancements" that only run under Windows (as they did with Java as well). Surely the standards folks won't mind if MS just throws in an *extension* saying if this document is opened under MS Office you'll see the formatting, but if you open it in OOo you'll just see plain text? Throw in enough enhancements, "certify" enough MS techs in corporate IT departments so they get a real warm and fuzzy feeling about implementing the MS Office extras, and MS can develop widespread reliance on its "enhancements" to ODF. We wouldn't want standards to stand in the way of great new features, would we? Even if the EU really held MS's feet to the fire and forced them to fully disclose the details of the enhancements, MS would make them complicated enough that they could keep rolling out new ones faster than open source folks could implement them. Open source folks have the competive disadvantage that they are developing in an open, transparent system, where MS engineers can immediately pick up on anything valuable in progress and duplicate or enhance it, releasing it simultaneously, and make it interoperate better with their own (under this scenario) ODF enhancements. But MS, even if forced to eventually disclose the code or APIs of such ODF enhancements, does all its development behind closed doors, making it as hard as possible for open source folks to develop equivalents until late, when MS is already preparing to release the next version of the enhancement. So MS can continue to parasitize the works of open source developers, while keeping the world tithing on what it develops. A cycle that will continue until people really add up the costs of using that next incremental goodie from MS. Open XML - A confusing name Open XML is a confusing name. XML is a standard and it is already open. true or not? EOOXML is simply cryptic. None of the two names indicate the usefulness of the standard, unlike ODF (Open Document Format). There is no needs to put XML in the name just because the format use it. Why not simply call it OOD (Office Open Document) or better MS-OOD (Microsoft Own Our Documents)? It is true that the other naming convension aren't meaningful either (IEEE-1394, ISO-639), but they are related to the standardization process and they are used because they implicitly say they are a standard and where to get the description. Standard names Actually ODF used to be called Open Office XML format when it started it's life in the OASIS technical committee. However they changed the name that related to much to OpenOffice to match the fictive name (Open Document format) mentioned in some government report on standard for documents (not sure if it was an EU or a US report though). The Wraith ODF/ODA I suspect the "fictive" name was "ODA" (which IIRC had several expansions during the decade around 1990. Seems to me one was "Open Document Architecture". There was a big standards fight between ODA and SGML (which itself might be considered a predecessor of XML), which was effectively won by SGML and the ODA community essentially dissolved. DeepOne Take a look at the compatiblity tab in word options Take a look at the compatiblity tab in word options. All of the options like footnoteLayoutLikeWW8 are because Word need to store these options. Visit Take a stand. Support ODF. Visit . Thank you Ed, I read your soliloquy with interest. However, I find myself torn. In general, I believe standards are good. However, I have found what I consider counter-examples... Cases in which standards, rigidly observed, render the subject of the standard more complex, burdensome, and opaque than necessary. None of my examples target Office products, so I beg your indulgence... In the programming world there are language standards. One of those standards is ISO/IEC 7185 Pascal. Per the section 6.8.3.5 "Case-statements" states "One of the case-constants shall be equal to the value of the case-index upon entry to the case-statement; otherwise, it shall be an error." Various Pascal vendors have --in my opinion-- properly violated the standard by providing a vender-supplied-violation to section 6.8.3.5, namely a "catch-all" statement (usually implemented as otherwise or else). Alas, there is no syntactic standard for the "catch-all". Therefore, porting code from one compiler implementing a "catch-all" to another implementing a "catch-all" requires some minor text changes. On the other hand, writing code that strictly adheres to the standard results in code which in my experience (a) is more complex, (b) has reduced readability, and (c) has increased maintenance costs. Many other areas in the (Pascal) standard are also deficient... to the point the standard is pretty much irrelevant. While I find those details sufficiently annoying that I would not willingly use a product that implemented only the standard, those details are not relevant to the point I am trying (probably unsuccessfully) to make... that while official standards are generally good: I have no good solution to the problem... Other than my old man's general caveat: "Scrutinize everything, trust no-one." Keith Full disclosure: I own stock in MSFT & SUNW. I use MSFT and Sun products. I have been programming for 30+ years. And have worked on O/S and hardware platforms that no longer exist (thank goodness!). I've written applications in many dialects of Pascal (many of which also no longer exist), as well as Fortran, Lisp, Prolog, PL1, Java, JavaScript, HTML, ColdFusion, C, Basic, Ada, assembly and as well as other languages which are fortunately extinct. I've written various kinds of language translators, successful commercial applications, federal government applications, robot, space-shuttle and accident simulations, data manipulators, etc. None of which means anything and all of which sounds more impressive than is true in reality. Common sense wisdom ... "Scrutinize..." Scrutinize everything, trust no-one. My grandfather had a saying he liked to use: "Figures don't lie, but liars sure do figure." wow this is the best article that iv read in my life, thanks for everyone who posted. Too young I think OOXML is too young to be a standart, it requeire time for stable. I think if it's not ready I think if it's not ready yet, MAYBE like 6-12 more months. IMO it's ready now, but some people, such as yourself, disagree. Is there something specific you're waiting for or looking for to make it official? ------------- Ajax Upload Script not that perfect. OOXML is supposed to be a standard for document interchange that uses XML but sometimes nothing can be perfect. Before a company starts to ship programs they put engineers to the test. Sometimes flaws can get unnoticed i guess. agree that open standards agree that open standards are best, but ODF has major shortcomings in it's spreadsheet format. SIG ---- We always choose the We always choose the simplest path possible. I guess this is why we prefer using Microsoft Office for our documents. This way we're pretty sure that everyone who needs to receive them will be able to open them. M.O. has become a standard when dealing with documents. Some of us here feel the need to use other, perhaps better, applications that suit our needs but that aren't compatible with other people's habits. wow.. Who cares, as you said people without Microsoft Word can read the format anyway. It's become a standard because everyone uses it, a "standards body" is only needed when this doesn't happen and everyone has different formats. kartuş
http://www.freesoftwaremagazine.com/comment/65208
CC-MAIN-2014-10
refinedweb
14,436
61.56
Turn a Raspberry Pi into Bluetooth Beacon.October 20, 2020 Bluetooth is one of the innovative technology to transfer data wirelessly, build home automation systems, control other devices etc. In this tutorial, we will learn about how to turn a Raspberry Pi into Bluetooth Beacon. Requirements - Raspberry Pi - BleuIO (A Bluetooth low energy adapter) - A Mobile Phone with Bluetooth and an App such as BLE Scanner, LightBlue or DSPS from Dialog Semiconductor. Connect the BleuIO dongle to your Raspberry Pi. To identify which device name the dongle is connected to, you will need to run: ls /dev You might need to do it twice, once before you connect the dongle and once after to be able to identify which one is the device name. When starting up, the dongle will open up a COM port for the bootloader for 10 seconds to allow you to update the firmware (or flash your own application). You can update the firmware from here. Afterwards it will close that port and open a new port for the Smart USB Dongle 2.0 application which is the one we’re interested in here. You can run: lsusb It should list a device with the ID: 2dcf:6001 when the bootloader is active but change to 2dcf:6002 after 10 seconds when the application is running. NOTE: The device name may vary and may not be the same as in the picture above. You will need a serial communication program to communicate with the dongle. For this tutorial we will be using Minicom. You can get Minicom by running: sudo apt-get install minicom Now, to start using the dongle run the following command if, for example, your dongle is connected to the device name ttyACM0: minicom -b 9600 -o -D /dev/ttyACM0 Now try typing an AT-Command. For example AT If you get an OK response that means the dongle is working. To use these After connecting, you can use the following sample python script to set up your own iBeacon. import serial import timeconnecting == 0: try: console = serial.Serial( port='COM14', baudrate=57600, parity="N", stopbits=1, bytesize=8, timeout=0 ) if console.is_open.__bool__(): connecting_to_dongle = 1 except: print("Dongle not connected. Please reconnect Dongle.") time.sleep(5) print("\n\nConnected to Dongle.\n") print("\n Welcome to the iBeacon example!\n\n") new_input = 1 while 1 and console.is_open.__bool__(): # get keyboard input once if ('\r'.encode()) time.sleep(0.1) console.write(str.encode("AT+ADVSTART=0;200;3000;0;")) console.write('\r'.encode()) out = '' # let's wait one second before reading output (let's give device time to answer) time.sleep(1) while console.inWaiting() > 0: out += console.read(console.inWaiting()).decode() else: if not out.isspace(): # We make sure it doesn't print the same message over and over again by setting [out] to blankspace # after printing once and check for blankspace before print again print(">>" + out) out = " " Full source also available on GitHub._3<< Here you can see , your device has started advertising. You can also use Eddystone script. Source code available here.
https://www.bleuio.com/blog/turn-a-raspberry-pi-into-bluetooth-beacon/
CC-MAIN-2022-40
refinedweb
515
65.83
scene updating every second hello i am trying to animate a series of png images computed with pythonista. I would like to display 1 image every second, and record the film with the ipad record, so i try to customize the scene example of the doc. But nothing works, i keep getting stupid errors, probably my bad. Can anyone help? Thanks. you want to avoid globals in Scenes -- make those variables methods of your scene. The way threads work in scene, I think as written you could have issues. by the way, most scene examples use run(amyScene()), but you are allowed to do: s=MyScene(someparams,that,your,init,accepts) s.someattrib=value run(s) Also, take a look at the scene docs. You need to implement either a draw method, which is called once per frame (and you would use scene_drawing.image method, using a set of images where you prefiously called load_pil_image to precache inages), or else you would use update to set spritenode texture. the scene.run method takes a frame_interval parameter to set fps. you may define a custom init that sets scene attributes etc based on globals -- but setup might not have access to globals (not sure if this is still true -- but it does run in a separate thread). Use setup just to handle actual display stuff, Depending in how many images you have, it might be worth creating all your SpriteNodes up front. thanks for your advices. I chose to go for the ui.view. It worked nicely (make sure to set 1080p when you watch the video, otherwise the quality is bad) here is the code import ui from console import clear from PIL import Image import io as io def pil2ui(pil_img): with io.BytesIO() as buffer: pil_img.save(buffer, format='PNG') return ui.Image.from_data(buffer.getvalue()) class MyView (ui.View): def __init__(self): # global view settings self.name = 'Viewing where colors lie in the CIE L*u*v* color space' self.background_color = 'gray' # trying to update 1 per second self.update_interval = 1 # image settings img = ui.Button(name='image') img.width = 1476/1.5 img.height = 1024/1.5 img.enable = False img.hidden = False self.add_subview(img) self.img = img # add a copyright txt = ui.Label() txt.text = 'copyright JMV38 2019' txt.text_color = (0.5, 0.5, 0.5, 0.2) txt.width = 600 txt.height = 100 txt.alignment = ui.ALIGN_CENTER fontName, fontSize = txt.font txt.font = (fontName,30) self.add_subview(txt) self.txt = txt def update(self): self.img.center = (self.width * 0.5, self.height * 0.5) self.txt.center = (self.width * 0.5, self.height * 0.5) try: self.azim -= 10 except: self.azim = 180 file = 'CieLuv_'+str(self.azim)+'.png' try: print(file) im = Image.open(file) ui_image = pil2ui(im) self.img.background_image = ui_image except: exit() if __name__ == '__main__': clear() view = MyView() view.present('full_screen') @mikael actually 1/ i have not computed enough intermediate frames (each take 30s on my ipad air) 2/ i use the video to view it frame by frame from the ipad photo roll, to turn around as i wish, so it is enough for my usage 3/ i have tried 0.5s once but it skipped 1 frame in the middle, so i thought i would remain at 1 Hz. thanks. still in trouble. I am trying to save my numpy structured array with np.save, here is the code for details # differents tests avec Luv from labColor import * import numpy as np from console import clear # compute all colors def getAllColors(step): dtype = [('L', float), ('u', float), ('v', float), ('c', tuple), ('d', float)] data = [] for r in np.arange(0, 256, step): print(r) for g in np.arange(0, 256, step): for b in np.arange(0, 256, step): L, u, v = rgb_to_sLuv(r, g, b) data.append((L, u, v, (r/255,g/255,b/255), 0.0)) ar = np.array(data,dtype=dtype) return ar clear() ar = getAllColors(50) print(len(ar)) print(ar.dtype) np.save('rgb.npy',ar) a = np.load('rgb.npy') print(len(a)) print(a.dtype) but i get this error Traceback (most recent call last): File "/private/var/mobile/Containers/Shared/AppGroup/..../Pythonista3/Documents/couleurs/labColor6.py", line 24, in <module> np.save('rgb.npy',ar) File "/var/containers/Bundle/Application/..../Pythonista3.app/Frameworks/Py3Kit.framework/pylib/site-packages/numpy/lib/npyio.py", line 451, in save format.write_array(fid, arr) File "/var/containers/Bundle/Application/.../Pythonista3.app/Frameworks/Py3Kit.framework/pylib/site-packages/numpy/lib/format.py", line 407, in write_array pickle.dump(array, fp, protocol=2) _pickle.PicklingError: Can't pickle <built-in function _reconstruct>: import of module 'multiarray' failed what am i doing wrong? thanks ok i got it. numpy.save cannot decode tuples by itself... surprising that there is no simple way to save a structured array, and that i must flatten the structure to save it. Extra work and risk of errors... Anyway... here is another video, technically more useful
https://forum.omz-software.com/topic/5326/scene-updating-every-second/17
CC-MAIN-2019-35
refinedweb
837
61.02
Error with MT5 CSV file read - Eduardo Menges Mattje last edited by Hi, I'm trying to implement a strategy I took from Backtest Rookies to work with a MT5 CSV file, but it seems that it was unable to break the CSV into columns. I get the error ValueError: time data 'ÿþ2\x000\x001\x008\x00.\x000\x001\x00.\x000\x001\x00 \x000\x000\x00:\x000\x000\x00' does not match format '%Y.%m.%d %H:%M', even tough the dtformat is right. This is the code that I'm trying to run: import backtrader as bt from datetime import datetime class firstStrategy(bt.Strategy): params = ( ('period', 21), ) def __init__(self): self.rsi = bt.indicators.RSI_SMA(self.data.close, period=self.params.period) def next(self): if not self.position: if self.rsi < 30: self.buy(size=100) else: if self.rsi > 70: self.sell(size=100) # Variable for our starting cash startcash = 10000 # Create an instance of cerebro cerebro = bt.Cerebro() # Add our strategy cerebro.addstrategy(firstStrategy, period=14) data = bt.feeds.GenericCSVData( dataname='ETHUSDH2.csv', fromdate=datetime(2019, 1, 1, 0, 0), todate=datetime(2020, 1, 1, 0, 0), headers=False, separator=",", volume=6, openinterest=-1, dtformat=('%Y.%m.%d %H:%M'), ) # Add the data to Cerebro cerebro.adddata(data) # Set our desired cash start cerebro.broker.setcash(startcash) # Run over everything') This is the CSV file: Tried to run your code and it seems to work just fine with the csv file you've provided. How did you download the file - there are several options ( raw, download, ...) - I was using just 'download' - Eduardo Menges Mattje last edited by I generated the file with MetaTrader 5. Now I tested what you did, downloading the file and it worked (???). Maybe I can't use the original MT5 file because of protection issues, but I'm not certain. Copying the text and placing it into another file seems to fix it. Anyway, it's working now. Thanks!
https://community.backtrader.com/topic/2484/error-with-mt5-csv-file-read
CC-MAIN-2022-21
refinedweb
328
60.51
Technical Support On-Line Manuals CARM User's Guide Discontinued #include <ctype.h> int isxdigit ( int c); /* character to test */ The isxdigit function tests c to determine if it is a hexadecimal digit ('A'-'F', 'a'-'f', or '0'-'9'). The isxdigit function returns a value of 1 if c is a hexadecimal digit or a value of 0 if it is not. isalnum, isalpha, iscntrl, isdigit, isgraph, islower, isprint, ispunct, isspace, isupper #include <ctype.h> #include <stdio.h> /* for printf */ void tst_isxdigit (void) { unsigned char i; char *p; for (i = 0; i < 128; i++) { p = (isxdigit (i) ? "YES" : "NO"); printf ("isx.
http://www.keil.com/support/man/docs/ca/ca_isxdigit.htm
CC-MAIN-2019-43
refinedweb
102
66.33
implicit namespace support?maffewl Jul 6, 2007 9:37 AM Hi, im attempting to upgrade from jboss-net/axis to JBossWS. I want to do this transparently to existing clients. When I issue an existing request : <?xml version="1.0" encoding="UTF-8"?> <soapenv:Envelope xmlns: <soapenv:Body> <getAccount> ... <:getAccount> </soapenv:Body> </soapenv:Envelope> i get an error saying my endpoint "does not contain operation metadata for: getAccount" if i qualify that node w/ a namespace it works , but is there any way to support it without modifying the request? Why wouldn't it default to the namespace specified in the service? Thanks in advance. matt This content has been marked as final. Show 2 replies 1. Re: implicit namespace support?thomas.diesler Jul 9, 2007 1:02 PM (in response to maffewl) The question is: does the client send a request that conforms to the abstract contract defined in wsdl. You might find that the message is invalid because it incorrectly does not namespace qualify the RPC element. To further support such "invalid" messages, you would need to have a pre-processing stage (i.e. a servlet filter) 2. Re: implicit namespace support?jktinoco Jul 16, 2007 9:49 PM (in response to maffewl) Hi, I was using JBoss 4.0.5 and the next SOAP request works perfectly, now with JBoss 4.2 this request doesn't works. <?xml version="1.0"?> <SOAP-ENV:Envelope xmlns: <SOAP-ENV:Body> <find xmlns=""> <arg0>3</arg0> </find> </SOAP-ENV:Body> </SOAP-ENV:Envelope> This same request with explicit namespace works perfectly in Jboss 4.2 <?xml version="1.0"?> <SOAP-ENV:Envelope xmlns: <SOAP-ENV:Body> <ejb:find > <arg0>3</arg0> </ejb:find> </SOAP-ENV:Body> </SOAP-ENV:Envelope> Why doesn't work in JBoss 4.2 my first request? Thanks in advance!! Jair Karim
https://developer.jboss.org/message/336089?tstart=0
CC-MAIN-2020-24
refinedweb
305
60.31
Aaron Mulder wrote: > So our JettyClassLoader denies any requests starting with "javax". > Unfortunately, this appears to break the JSTL, which includes a JAR with > javax.servlet.jsp.jstl.* packages. That breaks Spring, which is blowing > up trying to load the LocalizationContext class from the JSTL when you use > a JSTL view for Spring. > > I guess we need to include the JSTL classes as part of Geronimo? > In the mean time, I'm going to disable the "javax" restriction, so I can > continue to package it in my WAR. > SRV.9.7.2 basically says we should not allow applications to override things in the java.* and javax.* namespaces. On other hand, JSTL is not an API required by the spec. I think that we are being too conservative here. Better logic might be to search for java and container classes in the parent classloader first and the war second, and all other classes in the war first and the parent second. This would prevent the war overriding container classes but would still it to use versions it supplied if the container did not have them. --- Jeremy
http://mail-archives.apache.org/mod_mbox/geronimo-dev/200410.mbox/%3C41728784.2030203@gluecode.com%3E
CC-MAIN-2015-32
refinedweb
186
70.23
A distinguishing property of programming languages is that the programmer can create their own functions. Creating a function is like teaching the computer a new trick. Typically a function will receive some data as input, will perform an algorithm involving the input data, and will output data when the algorithm terminates. In this part, we explore Python functions. We also explore control statements, which allow a program to behave in different ways for different inputs. We also introduce the while loop, a loop whose repetition can be more carefully controlled than a for loop. As an application of these techniques, we implement the Euclidean algorithm as a Python function in a few ways, to effectively find the GCD of integers and solve linear Diophantine equations. This complements Chapter 1 of An Illustrated Theory of Numbers. A function in Python is a construction which takes input data, performs some actions, and outputs data. It is best to start with a few examples and break down the code. Here is a function square. Run the code as usual by pressing shift-Enter when the code block is selected. def square(x): answer = x * x return answer When you run the code block, you probably didn't see anything happen. But you have effectively taught your computer a new trick, increasing the vocabulary of commands it understands through the Python interpreter. Now you can use the square command as you wish. square(12) square(1.5) Let's break down the syntax of the function declaration, line by line. def square(x): answer = x * x return answer The first line begins with the Python reserved word def. (So don't use def as a variable name!). The word def stands for "define" and it defines a function called square. After the function name square comes parentheses (x) containing the argument x. The arguments or parameters of a function refer to the input data. Even if your function has no arguments, you need parentheses. The argument x is used to name whatever number is input into the square function. At the end of the function declaration line is a colon : and the following two lines are indented. As in the case of for loops, the colon and indentation are signals of scope. Everything on the indented lines is considered the scope of the function and is carried out when the function is used later. The second line answer = x * x is the beginning of the scope of the function. It declares a variable answer and sets the value to be x * x. So if the argument x is 12, then answer will be set to 144. The variable answer, being declared within the scope of the function, will not be accessible outside the scope of the function. It is called a local variable. The last line return answer contains the Python reserved word return, which terminates the function and outputs the value of the variable answer. So when you apply the function with the command square(1.5), the number 1.5 is the argument x, and answer is 2.25, and that number 2.25 becomes the output. A function does not have to return a value. Some functions might just provide some information. Here is a function which displays the result of division with remainder as a sentence with addition and multiplication. def display_divmod(a,b): quotient = a // b # Integer division remainder = a % b # print("{} = {} ({}) + {}".format(a,quotient,b,remainder)) display_divmod(23,5) Notice that this function has no return line. The function terminates automatically at the end of its scope. The function also uses Python's string formatting. This has changed between Python 2.x and 3.x, and this notebook uses Python 3.x syntax. String formatting allows you to insert placeholders like {} within a string, and later fill those places with a list of things. print("My favorite number is {}".format(17)) # The .format "method" substitutes 17 for {} print("{} + {} = {}".format(13,12,13+12)) The format command is an example of a string method. It has the effect of replacing all placeholders {} by the its inputs, in sequence. There is an intricate syntax for these placeholders, to allow one to match placeholders with values in different orders, and to format different kinds of values. Here is the official reference for string formatting in Python 3.x. We will only use the most basic features, exhibited below. print ("The number {} comes before {}.".format(1,2)) # This should be familiar. print ("The number {1} comes before {0}.".format(1,2)) # What happens? print ("The number {1} comes before {1}.".format(1,2)) # Got it now? By placing a number in the placeholder, like {1}, one can fill in the placeholders with the values in a different order, or repeat the same value. The format method takes multiple parameters, and they are numbered: parameter 0, parameter 1, parameter 2, etc.. So the placeholder {1} will be replaced by the second parameter (parameter 1). It's confusing at first, but Python almost always starts counting at zero. print("pi is approximately {0}".format(3.14159265)) print("pi is approximately {0:f}".format(3.14159265)) # The "f" in "0:f" formats the float. print("pi is approximately {0:0.3f}".format(3.14159265)) # Choose 3 digits of precision. If you give some information about how the placeholder is being used, the format method will format things more nicely for printing. The placeholder {0:f} will be replaced by parameter 0, and it will be formatted in a way that is nice for floats (hence the f). Don't try formatting things outside of their type! print("{:d} is a pretty big integer.".format(2**100)) # d is the formatting code for integers. print("{:f} is an integer, formatted like a float.".format(2**100)) print("{:f} is a float, of course.".format(1/7)) print("{:s} is a string.".format('Hi there!')) # s is the formatting code for strings. print("{:d} will give us an error message.".format(1/7)) from math import sqrt # Make sure the square root function is loaded. print("The square root of {0:d} is about {1:f}.".format(1000, sqrt(1000))) What are the signals of scope in Python? Write a function called area_circle, which takes one argument radius. The function should return the area of the circle, as a floating point number. Then add one line to the function, using string formatting, so that it additionally prints a helpful sentence of the form "The area of a circle of radius 1.0 is 3.14159." (depending on the radius and the area it computes). format is an example of a method. Another neat one is replace. Try "Python".replace("yth","arag") to see what it does. Try the formatting codes % and E (instead of f) for a floating point number. What do they do? Can you think of a reason you might want to have a function with no arguments? # Use this space to work on the Exercises. # Remember that you can add a new cell above/below by clicking to the left of a cell, # (the cell will have a blue bar at the left) and then pressing "a" or "b" on the keyboard. It is important for a computer program to behave differently under different circumstances. The simplest control statements, if and its relative else, can be used to tell Python to carry out different actions depending on the value of a boolean variable. The following function exhibits the syntax. def is_even(n): if n%2 == 0: print("{} is even.".format(n)) return True else: print("{} is odd.".format(n)) return False is_even(17) is_even(1000) The broad syntax of the function should be familiar. We have created a function called is_even with one argument called n. The body of the function uses the control statement if n%2 == 0:. Recall that n%2 gives the remainder after dividing n by 2. Thus n%2 is 0 or 1, depending on whether n is even or odd. Therefore the boolean n%2 == 0 is True if n is even, and False if n is odd. The next two lines (the first return statements) are within the scope of the if <boolean>: statement, as indicated by the colon and the indentation. The if <boolean>: statement tells the Python interpreter to perform the statements within the scope if the boolean is True, and to ignore the statements within the scope if the boolean is False. Putting it together, we can analyze the code. if n%2 == 0: print("{} is even.".format(n)) return True If n is even, then the Python interpreter will print a sentence of the form n is even. Then the interpreter will return (output) the value True and the function will terminate. If n is odd, the Python interpreter will ignore the two lines of scope. Often we don't just want Python to do nothing when a condition is not satisfied. In the case above, we would rather Python tell us that the number is odd. The else: control statement tells Python what to do in case the if <boolean>: control statement receives a False boolean. We analyze the code else: print("{} is odd.".format(n)) return False The return commands are within the scope of the else: control statement. So when the if statement receives a false signal (the number n is odd), the program prints a sentence of the form n is odd. and then returns the value False and terminates the function. The function is_even is a verbose, or "talkative" sort of function. Such a function is sometimes useful in an interactive setting, where the programmer wants to understand everything that's going on. But if the function had to be called a million times, the screen would fill with printed sentences! In practice, an efficient and silent function is_even might look like the following. def is_even(n): return (n%2 == 0) is_even(17) A for loop and an if control statement, used together, allow us to carry out a brute force search. We can search for factors in order to check whether a number is prime. Or we can look for solutions to an equation until we find one. One thing to note: the function below begins with a block of text between a triple-quote (three single-quotes when typing). That text is called a docstring and it is meant to document what the function does. Writing clear docstrings becomes more important as you write longer programs, collaborate with other programmers, and when you want to return months or years later to use a program again. There are different style conventions for docstrings; for example, here are Google's docstring conventions. We take a less formal approach. def is_prime(n): ''' Checks whether the argument n is a prime number. Uses a brute force search for factors between 1 and n. ''' for j in range(2,n): # the list of numbers 2,3,...,n-1. if n%j == 0: # is n divisible by j? print("{} is a factor of {}.".format(j,n)) return False return True An important note: the return keyword terminates the function. So as soon as a factor is found, the function terminates and outputs False. If no factor is found, then the function execution survives past the loop, and the line return True is executed to terminate the function. is_prime(91) is_prime(101) Try the is_prime function on bigger numbers -- try numbers with 4 digits, 5 digits, 6 digits. Where does it start to slow down? Do you get any errors when the numbers are large? Make sure to save your work first, just in case this crashes your computer! # Experiment with is_prime here. There are two limiting factors, which we study in more detail in the next lesson. These are time and space (your computer's memory space). As the loop of is_prime goes on and on, it might take your computer a long time! If each step of the loop takes only a nanosecond (1 billionth of a second), the loop would take about a second when executing is_prime(1000000001). If you tried is_prime on a much larger number, like is_prime(2**101 - 1), the loop would take longer than the lifetime of the Earth. The other issue that can arise is a problem with space. In Python 3.x, the range(2,n) cleverly avoids storing all the numbers between 2 and n-1 in memory. It just remembers the endpoints, and how to proceed from one number to the next. In the older version, Python 2.x, the range command range(2,n) would have tried to store the entire list of numbers [2,3,4,...,n-1] in the memory of your computer. Your computer has some (4 or 8 or 16, perhaps) gigabytes of memory (RAM). A gigabyte is a billion bytes, and a byte is enough memory to store a number between 0 and 255. (More detail about this later!). So a gigabyte will not even hold a billion numbers. So our is_prime function would have led to memory problems in Python 2.x, but in Python 3.x we don't have to worry (for now) about space. Create a function my_abs(x) which outputs the absolute value of the argument x. (Note that Python already has a built-in abs(x) function). Modify the is_prime function so that it prints a message Number too big and returns None if the input argument is bigger than one million. (Note that None is a Python reserved word. You can use the one-line statement return None.) Write a Python function thrarity which takes an argument n, and outputs the string threeven if n is a multiple of three, or throdd is n is one more than a multiple of three, or thrugly if n is one less than a multiple of three. Example: thrarity(31) should output throdd and thrarity(44) should output thrugly. Hint: study the if/ elif syntax at the official Python tutorial Write a Python function sum_of_squares(n) which finds and prints a pair of natural numbers $x$, $y$, such that $x^2 + y^2 = n$. The function should use a brute force search and return None if no such pair of numbers $x,y$ exists. # Use this space for your solutions to the questions. We almost have all the tools we need to implement the Euclidean algorithm. The last tool we will need is the while loop. We have seen the for loop already, which is very useful for iterating over a range of numbers. The Euclidean algorithm involves repetition, but there is no way to know in advance how many steps it will take. The while loop allows us to repeat a process as long as a boolean value (sometimes called a flag) is True. The following countdown example illustrates the structure of a while loop. def countdown(n): current_value = n while current_value > 0: # The condition (current_value > 0) is checked before every instance of the scope! print(current_value) current_value = current_value - 1 countdown(10) The while loop syntax begins with while <boolean>: and the following indented lines comprise the scope of the loop. If the boolean is True, then the scope of the loop is executed. If the boolean is True again afterwards, then the scope of the loop is executed again. And again and again and so on. This can be a dangerous process! For example, what would happen if you made a little typo and the last line of the while loop read current_value = current_value + 1? The numbers would increase and increase... and the boolean current_value > 0 would always be True. Therefore the loop would never end. Bigger and bigger numbers would scroll down your computer screen. You might panic under such a circumstance, and maybe turn your computer off to stop the loop. Here is some advice for when your computer gets stuck in such a neverending loop: Now, if you're feeling brave, save your work, change the while loop so that it never ends, and try to recover where you left off. But be aware that this could cause your computer to freeze or behave erratically, crashing your browser, etc. Don't panic... it won't break your computer permanently. The neverending loop causes two problems here. One is with your computer processor, which will be essentially spinning its wheels. This is called busy waiting, and your computer will essentially be busy waiting forever. The other problem is that your loop is printing more and more lines of text into the notebook. This could easily crash your web browser, which is trying to store and display zillions of lines of numbers. So be ready for problems! The Euclidean Algorithm is a process of repeated division with remainder. Beginning with two integers a (dividend) and b (divisor), one computes quotient q and remainder q to express a = qb + r. Then b becomes the dividend and r becomes the divisor, and one repeats. The repetition continues, and the last nonzero remainder is the greatest common divisor of a and b. It is the subject of Chapter 1 of An Illustrated Theory of Numbers. We implement the Euclidean algorithm in a few variations. The first will be a verbose version, to show the user what happens at every step. We use a while loop to take care of the repetition. def Euclidean_algorithm(a,b): dividend = a divisor = b while divisor != 0: # Recall that != means "is not equal to". quotient = dividend // divisor remainder = dividend % divisor print("{} = {} ({}) + {}".format(dividend, quotient, divisor, remainder)) dividend = divisor divisor = remainder Euclidean_algorithm(133, 58) Euclidean_algorithm(1312331323, 58123123) This is excellent if we want to know every step of the Euclidean algorithm. If we just want to know the GCD of two numbers, we can be less verbose. We carefully return the last nonzero remainder after the while loop is concluded. This last nonzero remainder becomes the divisor when the remainder becomes zero, and then it would become the dividend in the next (unprinted) line. That is why we return the (absolute value) of the dividend after the loop is concluded. You might insert a line at the end of the loop, like print dividend, divisor, remainder to help you track the variables. def GCD(a,b): dividend = a # The first dividend is a. divisor = b # The first divisor is b. while divisor != 0: # Recall that != means "not equal to". quotient = dividend // divisor remainder = dividend % divisor dividend = divisor divisor = remainder return abs(dividend) # abs() is used, since we like our GCDs to be positive. Note that the return dividend statement occurs after the scope of the while loop. So as soon as the divisor variable equals zero, the funtion GCD returns the dividend variable and terminates. GCD(111,27) GCD(111,-27) We can refine our code in a few ways. First, note that the quotient variable is never used! It was nice in the verbose version of the Euclidean algorithm, but plays no role in finding the GCD. Our refined code reads def GCD(a,b): dividend = a divisor = b while divisor != 0: # Recall that != means "not equal to". remainder = dividend % divisor dividend = divisor divisor = remainder return abs(dividend) Now there are two slick Python tricks we can use to shorten the code. The first is called multiple assignment. It is possible to set the values of two variables in a single line of code, with a syntax like below. x,y = 2,3 # Sets x to 2 and y to 3. This is particular useful for self-referential assignments, because as for ordinary assignment, the right side is evaluated first and then bound to the variables on the left side. For example, after the line above, try the line below. Use print statements to see what the values of the variables are afterwards! x,y = y,x # Guess what this does! print("x =",x) # One could use "x = {}".format(x) too. print("y =",y) Now we can use multiple assignment to turn three lines of code into one line of code. For the remainder variable is only used temporarily before its value is given to the divisor variable. Using multiple assignment, the three lines remainder = dividend % divisor dividend = divisor divisor = remainder can be written in one line, dividend, divisor = divisor, dividend % divisor # Evaluations on the right occur before any assignments! Our newly shortened GCD function looks like this. def GCD(a,b): dividend = a divisor = b while divisor != 0: # Recall that != means "not equal to". dividend, divisor = divisor, dividend % divisor return abs(dividend) The next trick involves the while loop. The usual syntax has the form while <boolean>:. But if while is followed by a numerical type, e.g. while <int>:, then the scope of the while loop will execute as long as the number is nonzero! Therefore, the line while divisor != 0: can be replaced by the shorter line while divisor: This is truly a trick. It probably won't speed anything up, and it does not make your program easier to read for beginners. So use it if you prefer communicating with experienced Python programmers! Here is the whole function again. def GCD(a,b): dividend = a divisor = b while divisor: # Executes the scope if divisor is nonzero. dividend, divisor = divisor, dividend % divisor return abs(dividend) The next optimization is a bit more dangerous for beginners, but it works here. In general, it can be dangerous to operate directly on the arguments to a function. But in this setting, it is safe, and makes no real difference to the Python interpreter. Instead of creating new variables called dividend and divisor, one can manipulate a and b directly within the function. If you do this, the GCD function can be shortened to the following. def GCD(a,b): while b: # Recall that != means "not equal to". a, b = b, a % b return abs(a) # Try it out. Try it on some big numbers and see how quick it runs! This code is essentially optimal, if one wishes to execute the Euclidean algorithm to find the GCD of two integers. It almost matches the GCD code in a standard Python library. It might be slightly faster than our original code -- but there is a tradeoff here between execution speed and readability of code. In this and the following lessons, we often optimize enough for everyday purposes, but not so much that readability is lost. Modify the is_prime function by using a while loop instead of for j in range(2,n):. Hint: the function should contain the lines j = 2 and while j < n: and j = j + 1 in various places. Why might this be an improvement from the for loop? Modify the Euclidean_algorithm function to create a function which returns the number of steps that the Euclidean algorithm requires, i.e., the number of divisions-with-remainder. Create a function which carries out division with minimal remainder. In other words, given integers a,b, the function expresses a = q(b) + r, where r is a positive or negative integer of magnitude bounded by b/2. Use such a function to create a new Euclidean algorithm function which uses minimal remainder. What GCD(a,b) function do you think strikes the best balance between efficiency and readability? # Use this space to work on the exercises. In Chapter 1 of An Illustrated Theory of Numbers, we not only used the Euclidean algorithm to find the GCD of two integers, but also to solve the linear Diophantine equation $ax + by = c$. On paper, this required us to perform the Euclidean algorithm, then "work backwards" to carefully solve a series of linear equations. This process is repetetive and error-prone... perfect for a computer. So here we develop a function solve_LDE(a,b,c) which will describe all integer solutions $x,y$ to the equation $ax + by = c$. The idea of the algorithm is to keep track of "hops" and "skips" throughout the Euclidean algorithm. A general step in the Euclidean algorithm looks like u = q(v) + r. The remainder can then be expressed by the formula r = u - q(v). If u and v can be built from hops and skips, then r can be built from hops and skips. How many? Just tally the hops and skips to find: `r_hops = u_hops - q (v_hops)` and `r_skips = u_skips - q (v_skips)`. This sort of tallying is what makes the algorithm below work. The function below does not introduce any new programming concepts, but it assembles many ideas together. def hop_and_skip(a,b): ''' Takes two integer arguments a,b, and prints a sentence of the form GCD(a,b) = x(a) + y(b). The method is the Euclidean algorithm, tallying hops (units of a) and skips (units of b) along the way. ''' u = a # We use u instead of dividend. v = b # We use v instead of divisor. u_hops, u_skips = 1,0 # u is built from one hop (a) and no skips, for now. v_hops, v_skips = 0,1 # v is built from no hops and one skip (b), for now. print("{} = {}({}) + {}({})".format(u,u_hops,a,u_skips,b)) hop_and_skip(102,45) Try out the hop_and_skip code on some integers of your choice. Does it behave correctly? Check the results, using Python as a calculator. Does it run quickly for large integers? # Experimentation space here. To conclude this lesson, we put everything together to create a long(ish) function to solve linear Diophantine equations. We want this function to be smart enough to respond when an equation has no solutions, and to describe all solutions when they exist. The first part of the function solve_LDE is the same as the hop and skip function above. But rather than expressing $GCD(a,b)$ as $ax + by$, the function uses the GCD to determine the existence and the general form of a solution to $ax + by = c$. The formula for the general form comes from An Illustrated Theory of Numbers, Chapter 1, Corollary 1.25. def solve_LDE(a,b,c): ''' Describes all of the solutions to the linear Diophantine equation ax + by = c. There are either no solutions or infinitely many solutions. Prints a description of the solution set, and returns None if there are no solutions or returns a single solution if one exists. ''' u = a # We use u instead of dividend. v = c%g == 0: # When GCD(a,b) divides c... d = c//g x = d * u_hops y = d * u_skips # Now ax + by = c is a specific solution! print("{} x + {} y = {} if and only if ".format(a, b, c)) print("x = {} + {} n and y = {} - {} n, for some integer n.".format(x,b//g,y,-a//g)) return x,y else: # When GCD(a,b) does not divide c... print("There are no solutions to {} x + {} y = {},".format(a,b,c)) print("because GCD({}, {}) = {}, which does not divide {}.".format(a,b,g,c)) return None solve_LDE(102,45,3) solve_LDE(72,100,17) Solve problems 4-7 of Chapter 1 of An Illustrated Theory of Numbers using the solve_LDE function. Write an LCM function, using the previous GCD function and the GCD-LCM product formula, Theorem 1.23 of An Illustrated Theory of Numbers. Sometimes it is important to find not the integer solutions, but the positive integer solutions to a Diophantine equation. Modify the solve_LDE function to create a solve_LDE_positive(a,b,c) function. The output of the function should be all pairs of positive integers $x$, $y$, such that $ax + by = c$ (if any pairs exist), and a helpful message if no pairs exist (and a return None should be used in this case). # Use this space to work on the exercises.
https://nbviewer.jupyter.org/github/MartyWeissman/Python-for-number-theory/blob/master/P3wNT%20Notebook%202.ipynb
CC-MAIN-2019-43
refinedweb
4,619
66.44
x:TypeArguments Directive Passes constraining type arguments of a generic to the constructor of the generic type. In most cases, the XAML types that are used as an information item in a typeString string are prefixed. Typical types of CLR generic constraints (for example, Int32 and String) come from CLR base class libraries. Those libraries are not mapped to typical framework-specific default XAML namespaces, and therefore, require a prefix mapping for XAML usage. You can specify more than one XAML type name by using a comma delimiter. If the generic constraints themselves use generic types, the nested constraint type arguments can be contained by parentheses (). Note that this definition of x:TypeArguments is specific to .NET Framework XAML Services and using CLR backing. A language-level definition can be found in [MS-XAML] Section 5.3.11. Usage Examples For these examples, assume that the following XAML namespace definitions are declared: List<String> Dictionary<String,String> <scg:Dictionary x:TypeArguments="sys:String,sys:String" ...> instantiates a new Dictionary<TKey, TValue> with two String type arguments. Queue<KeyValuePair<String,String>> <scg:Queue x:TypeArguments="scg:KeyValuePair(sys:String,sys:String)" ...> instantiates a new Queue<T> that has a constraint of KeyValuePair<TKey, TValue> with the inner constraint type arguments String and String. For XAML 2006 usage, and XAML that is used for WPF applications, the following restrictions exist for x:TypeArguments and generic type usages from XAML in general: Only the root element of a XAML file can support a generic XAML usage that references a generic type. The root element must map to a generic type with at least one type argument. An example is PageFunction<T>. The page functions are the primary scenario for XAML generic usage support in WPF. The root element XAML object element for the generic must also declare a partial class using x:Class. This is true even if defining a WPF build action. x:TypeArguments cannot reference nested generic constraints. In .NET Framework XAML Services for either XAML 2006 or XAML 2009, the WPF-related restrictions on generic XAML usage are relaxed. You can instantiate a generic object element at any position in XAML markup that the backing type system and object model can support. If you use XAML 2009 instead of mapping the CLR base types to obtain XAML types for common language primitives, you can use Built-in Types for Common XAML Language Primitives as information items in a typeString. For example, you could declare the following (prefix mappings not shown, but x is the XAML language XAML namespace for XAML 2009): In WPF and when targeting .NET Framework version. If you need to markup compile the XAML, you must operate under the restrictions noted in the "XAML 2006 and WPF Generic XAML Usages" section.
http://msdn.microsoft.com/en-us/library/ms750476(d=printer,v=vs.100).aspx
CC-MAIN-2014-23
refinedweb
464
54.73
plz help me for How can I design a touch key for display an image on mobile screen? Post your Comment J2ME Key Codes Example J2ME Key Codes Example This application illustrates how to print the key value with the current key pressed on the canvas. In this application we are using the keyPressed No complete codes for Simple Form Controlle Example No complete codes for Simple Form Controlle Example No complete codes Request for codes - JSP-Servlet Request for codes Sir , I am an engineering student i am interested in learning JAVA also i need some example code for creating Registration form codes for creating web based application using JSP sir plz send me which SQL Example, Codes and Tutorials SQL Example, Codes and Tutorials  ... SQL Functions MySql Example... by using the Database name. In SQL the key word 'Show databases' finds Java Example Codes and Tutorials Java Tutorials - Java Example Codes and Tutorials Java is great programming... Java SE 6 Java SE 7 Advanced Java J2ME JSP... Get Example An introduction to various methods java codes - Java Beginners get the password by searching this example's\n" + "source code... JFrame("password filed example"); frame.setDefaultCloseOperation... information. Thanks Hibernate unique key validation example Hibernate unique key validation example Hi, How to preform unique key validation in Hibernate application? Thanks Hi, You write a program to check for the presence of the key in database before performing add How to design key, design key, key How to design key It has been made easy now to design a key by this example, just follow some steps that is available in this example to make it. New Spring AOP tutorials and example codes. executed after a jointpoint completed normally, called after advice. For example... defined point. It is a key concept of AOP, which distinguishes it from older Example of remove(Object key) method of HashMap. Example of remove(Object key) method of HashMap. In this tutorial, you will see the use of remove method of HashMap class in java. It removes a value of specific key from HashMap. Code: HashMapRemove.java package Mysql Alter Foreign Key from 'Mysql Alter Foreign Key'. To understand with example we create a table... Mysql Alter Foreign Key A Foreign Key is a field that marks to the primary key Java JButton Key Binding Example Java JButton Key Binding Example In this section we will discuss about how... example which will demonstrate you about how to bind Enter key on JButton... = new JFrame("Binding key example"); frame.setLayout(null); Container Adding A Primary Key to an Existing Table Adding A Primary Key to an Existing Table Been trying to add a primary key to a MySQL table using Java for two days with no success. I'm new... unable to find a good example. My code sample: try show codes of this show codes of this search for the number of occurrence of "and" and "the" in the following sentence by writing a codes. the student like the best teacher at the end of the lessons and others SQL Alter Table Primary Key Key Query The given Query show you an example to alter a table... SQL Alter Table Primary Key Alter a Table Primary Key in SQL modifies the existing table SQL PRIMARY KEY Constraint and each table have only primary key. Understand with Example The Tutorial illustrate an example to understand SQL PRIMARY KEY Constraint. In this example, we... SQL PRIMARY KEY Constraint   JavaScript Array get key JavaScript Array get key  ... in understanding JavaScript Array get key. For this we implement JavaScript...; are addressed using the key strings("R", "I", and "N" Mysql add primary key of this tutorial illustrate an example from 'Mysql Add Primary Key'. To understand... Mysql add primary key Mysql add Primary Key is used to add primary key on the column SQL Primary Key . Understand with Example The Tutorial illustrate an example from 'SQL Primary Key... SQL Primary Key The Primary Key in SQL is used to uniquely identifies each records SQL Example, Codes and Tutorials HTML codes HTML codes Hi, I am trying to find HTML codes to learn HTML. Can any one html me? Thanks Hi, Please check HTML examples and HTML5 Tutorials page. Thanks php array contains key array_key_exists() function is used to check whether the given key is present in the given array or not. PHP Array Contains Key Example..._key_exists("r",$ar); if($b Mysql Alter Table Primary Key Alter Table Primary Key'. To understand this example, we create a table... Mysql Alter Table Primary Key Mysql Alter Table Primary Key is used to remove SQL PRIMARY KEY Constraint and each table have only primary key. Understand with Example The Tutorial illustrate an example to understand SQL PRIMARY KEY Constraint... SQL PRIMARY KEY Constraint   PHP Array Search Key ;c"]=> int(3) } The key is:c Found Example 2: <?php...PHP Array Search Key To check a key of an array exists or not we use array_key... the given key exists within the array or not. If the key exists in the array Java Swing Key Event Java Swing Key Event In this tutorial, you will learn how to perform key event in java swing. Here is an example that change the case of characters... KeyAdapter to perform the keyReleased function over textfield. Example: import Mysql Alter Column Primary Key and redefine the Primary Key Column in a table. Understand with Example The Tutorial illustrate an example from 'Mysql Alter Column Primary Key'. To understand an example, we create a table employees whose primary key is Empid.   Mysql Date Format codes Mysql Date Format codes The Tutorial illustrate an example from 'Mysql date format'. In this example we let you know ,how to display the current date and time in the system help for j2me programmingiman arbabi January 17, 2012 at 11:17 PM plz help me for How can I design a touch key for display an image on mobile screen? Post your Comment
http://roseindia.net/discussion/22803-J2ME-Key-Codes-Example.html
CC-MAIN-2015-48
refinedweb
1,001
53.71
17 April 2009 23:59 [Source: ICIS news] LONDON (ICIS news)--European n-butanol (NBA) producers have been unable to introduce widespread price increases so far in April due to ongoing sluggish demand and good availability, market sources said on Friday. Heading into April, certain European producers targeted increases of around €30/tonne ($40/tonne) in a bid to improve margins. Others said they would target rises on those accounts which had resisted hikes in March. However, so far in April spot prices have not shown a clear rise. “The market is still oversupplied,” said a buyer. “There is lots of competition among sellers.” “It is stable, there is no change,” said a trader. “Availability is good.” Buyers stressed that overall consumption remained low which meant increases were not justified. Suppliers conceded that European demand was far from good, suggesting it had generally remained stable at a low level. NBA spot prices were assessed around €730-780/tonne FD (free delivered) NWE (northwest ?xml:namespace> Rather than rise, the top end of the spot range fell €15/tonne with spot prices now primarily reported in the range €730-765/tonne FD NWE. Some sporadic increases have been reported but these were considered exceptions to the main market. One positive sign for suppliers is the increased prices possible on the export market following greater demand
http://www.icis.com/Articles/2009/04/17/9209112/no-signs-of-europe-nba-spot-price-hike-success.html
CC-MAIN-2015-06
refinedweb
224
64.51
On Thu, Dec 14, 2017 at 04:06:41PM +0100, Martin Pieuchot wrote: > Diff below moves amd64 and i386 mutex to the common C implementation. > > The differences are: > - membar_enter_after_atomic(9) instead of membar_enter(9), and > - membar_exit_before_atomic(9) instead of membar_exit(9) > > I'd appreciate any performance test to know if the performance > degradation is acceptable with these barriers. > These are only compiler barriers and there should be effectively no difference. However, contended behaviour is a regression compared to the asm variant. >From what I gather this is a step towards unifying all mutex implementations, hence the membar_* use. > +void > +__mtx_enter(struct mutex *mtx) > +{ > +#ifdef MP_LOCKDEBUG > + int nticks = __mp_lock_spinout; > +#endif > + > + while (__mtx_enter_try(mtx) == 0) { > + CPU_BUSY_CYCLE(); So this is effectively __mtx_enter_try with single pause in-between. > +} > + > +int > +__mtx_enter_try(struct mutex *mtx) > +{ > + struct cpu_info *owner, *ci = curcpu(); > + int s; > + > + if (mtx->mtx_wantipl != IPL_NONE) > + s = splraise(mtx->mtx_wantipl); > + This is at least one read. > + owner = atomic_cas_ptr(&mtx->mtx_owner, NULL, ci); > +#ifdef DIAGNOSTIC > + if (__predict_false(owner == ci)) > + panic("mtx %p: locking against myself", mtx); > +#endif > + if (owner == NULL) { > + membar_enter_after_atomic(); > + if (mtx->mtx_wantipl != IPL_NONE) > + mtx->mtx_oldipl = s; This repeats the read done earlier. Since the caller loops, this is effectively a very inefficient lock of the form: while (!atomic_cas_ptr(...)) CPU_BUSY_CYCLE(); + some reads in-between Assembly code would spin waiting for the lock to become free before playing with spl level and attempting to lock. I don't know how contended your mutexes are right now, but this will have to be very quickly changed at least to current asm behaviour as more of the kernel gets unlocked. Going for ticket locks or backoff later will probably work fine enough for the foreseeable future and will postpone the need to invest into anything fancy. That said, proposed restructure is as follows (pseudo-code, no debug): void __mtx_enter(struct mutex *mtx) { int want_ipl, s; /* mark mtx_wantipl as volatile or add a read casted through * one to force a read *here* and no re-reads later */ want_ipl = mtx->mtx_wantipl; for (;;) { if (want_ipl != IPL_NONE) s = splraise(want_ipl); owner = atomic_cas_ptr(&mtx->mtx_owner, NULL, ci); if (owner == NULL) { membar_enter_after_atomic(); if (want_ipl != IPL_NONE) mtx->mtx_oldipl = s; break; } if (want_ipl != IPL_NONE) splx(s); do { CPU_BUSY_CYCLE(); } while (mtx->mtx_owner != NULL); } } I don't think partial duplication of try_enter can be avoided without serious ugliness. > +void > +__mtx_leave(struct mutex *mtx) > +{ > + int s; > + > + MUTEX_ASSERT_LOCKED(mtx); > + > +#ifdef DIAGNOSTIC > + curcpu()->ci_mutex_level--; > +#endif > + > + s = mtx->mtx_oldipl; > +#ifdef MULTIPROCESSOR > + membar_exit_before_atomic(); > +#endif > + mtx->mtx_owner = NULL; > + if (mtx->mtx_wantipl != IPL_NONE) > + splx(s); > +} It should be somewhat faster to read mtx_wantipl while the lock is still held - it is less likely that someone else dirtied the cacheline. Then mtx_oldipl can be only conditionally read. This function does not do atomic ops, so membar_exit_before_atomic does not really fit, even though it happens to do the exact same thing the "correctly" named primitive would - just provide a compiler barrier on amd64/i386. >From what I gather you are trying to mimick illumos nomenclature, but they don't have an equivalent afaics. (perhaps Solaris grew one in the meantime?) In FreeBSD an appropriate routine is named atomic_thread_fence_rel (see amd64/include/atomic.h) and I suggest just borrowing the api. Side note is that you probably can shorten ipl to vars to make the lock smaller. It can be doable to fit it into lock word, but I don't know how much sense would playing with it make. -- Mateusz Guzik <mjguzik gmail.com>
https://www.mail-archive.com/tech@openbsd.org/msg43436.html
CC-MAIN-2021-21
refinedweb
566
53.92
This. Happy coding! The Tools - Text editor: Geany, a really easy to use IDE for all languages - Java compiler: javac, included in OpenJDK - Java runtime: java -jar, included in OpenJDK - Java platform: OpenJDK, a free software implementation of Java (a replacement of the nonfree Oracle JDK) - Operating system: Linux Mint, we use here version 19 LTS Cinnamon Edition Installing Tools All required tools in Linux Mint can be installed with a single command: $ sudo apt-get install geany default-jdk Where: - geany is the package name of Geany IDE - default-jdk is metapackage to automatically install latest version of OpenJDK among other versions - The download size needed in Mint 19 Cinnamon is +/-80MB. Configuring Tools No configuration needed in Geany. It automatically recognizes that your typed source code is "Java". Start Programming Here's the traditional Hello world program. Save this as program.java. Notice the file name must be the same as class name. program.java: public class program { public static void main(String[] args){ System.out.println("Hello world!"); } } Building and Running Press Compile button, then press Run button. If your source code is OK, it prints out text "Hello world!" in a new terminal. Some Questions, Maybe? - Why not Eclipse or Netbeans? To start learning Java, you don't need big IDEs, the small Geany is already enough. - How to configure build commands? Go to main menu Build > Set Build Commands > see "Compile" section on top, see "Build" section on bottom. - Why no more examples? See Further References below. Further References - All about Geany IDE: - Learn Java with examples: is a good one - Learn Java to create GUI programs: is also a good one This article is licensed under CC BY-SA 3.0.
https://www.ubuntubuzz.com/2018/08/starting-java-programming-in-linux-mint.html
CC-MAIN-2022-21
refinedweb
287
56.05
Multiple robots with multiple robot_descriptions and ros controllers? Does anyone have a basic example of multiple robots each with a unique robot description and set of ros_control controllers, being loaded from a ros launch file and running alongside each other? I've run into some problems trying to accomplish that described partially here , it seems like I can't launch a controller for the second robot because robot_description lies within a namespace- perhaps I'm forgetting to pass/remap a parameter for robot_description? (though it isn't clear how the gazebo would know I've done that on the controller loading end if it is on the other side of a service call) @Lucas Did you solve the problem? I am launching Gazebo Shadow robot arm-hand first and then rrbot (from here). And I can not launch these robots in one launch file. When I lunch them separately, it seems that /robotdescription is overwritten by the second robot. @Lucas Did you manage to get an example of multiple robots each with a unique robot description and set of ros_control controllers? I'm also stuck at loading the controllers.
https://answers.gazebosim.org/question/7660/multiple-robots-with-multiple-robot_descriptions-and-ros-controllers/
CC-MAIN-2021-10
refinedweb
189
59.53
The .NET Framework includes two namespaces designed for network programming: System.Net and System.Net.Sockets. The System.Net namespace includes several classes that won't interest peer-to-peer programmers, including abstract base classes and types used to set Windows authentication credentials. However, there are also several noteworthy types: IPAddress represents a numeric IP address. IPEndPoint represents a combination of an IPAddress and port number. Taken together, these constitute a socket endpoint. Dns provides shared helper methods that allow you to resolve domain names (for example, you can convert a domain name into a number IP address, and vice versa). IPHostEntry associates a DNS host name with an array of IPAddress objects. Usually, you'll only be interested in retrieving the first IP address (in fact, in most cases there will only be one associated IP address). The FileWebRequest and FileWebResponse classes are useful when downloading a file from a URI (such as). However, we won't use these classes in this book. The HttpWebRequest and HttpWebResponse classes are useful when downloading a web page from a web server. However, we won't use these classes in this book. The System.Net.Sockets class includes the types you'll need for socket programming with TCP or UDP. This namespace holds the most important functionality for the peer-to-peer programmer, including the following class types: TcpListener is used on the server side to listen for connections. TcpClient is used on the server and client side to transfer information over a TCP connection. Usually, you'll transmit data by reading and writing to the stream returned from TcpClient.GetStream(). UdpClient is used on the server and client to transfer information over a UDP connection, using methods such as Send() and Receive(). Socket represents the Berkeley socket used by both TCP and UDP. You can communicate using this socket directly, but it's usually easier to use the higher-level TcpClient and UdpClient classes. SocketException represents any error that occurs at the operating system level when attempting to establish a socket connection or send a message. NetworkStream is used with TCP connections. It allows you to send and receive data using a convention .NET stream, which is quite handy. In the remainder of this chapter, we'll consider some of these essential types and create a few sample programs that show networking in action. On the Internet, publicly accessible IP addresses can be mapped to host names. For example, the IP address 207.46.134.222 maps to, and you can use either the domain name or the IP address when accessing the site in a browser. In some cases, you'll need to retrieve the IP address for a domain name, or vice versa. This task is performed seamlessly in a web browser, and it can also be accomplished using the nslookup.exe command-line utility. In order to retrieve this information, your computer must access a DNS server. If the DNS server you contact cannot resolve the name by examining the values in its cache, it will forward the request to a DNS root server. In .NET, you can perform this task quite easily using the Dns class, which provides a small set of shared methods. For example, the following code snippet retrieves an IPHostEntry for a specific domain name and then displays the first linked IP address. Dim IP As IPHostEntry IP = Dns.GetHostByName("") ' Displays "207.46.249.27". Console.WriteLine(IP.AddressList(0).ToString()) The following code performs the reverse task: Dim IP As IPHostEntry IP = Dns.GetHostByAddress("207.46.249.27") ' Displays "microsoft.com". Console.WriteLine(IP.HostName) Finally, you can use the Dns.GetHostName() method to retrieve the host name of the current computer, which you can then convert into the local numeric IP address. Dim IP As IPHostEntry IP = Dns.GetHostByName(Dns.GetHostName()) ' Displays the IP address for the current computer. Console.WriteLine(IP.AddressList(0).ToString()) In .NET, you can send data over a TCP connection using the NetworkStream class, which follows the standard .NET streaming model. That means that you can write data to a NetworkStream in the same way that you would write bytes to a file. (It also means you can chain a CryptoStream onto your network stream for automatic encryption.) The NetworkStream class differs slightly from other .NET streams because it represents a buffer of data that's just about to be sent or has just been received. On the sender's side, the buffer is emptied as data is sent across the network. On the recipient's side, the buffer is emptied as data is read into the application. Because of this behavior, the NetworkStream class is not seekable, which means you cannot use the Seek() method or access the Length or Position properties. In addition, the NetworkStream class adds a few useful properties: Writeable and Readable indicate whether the NetworkStream supports write and read operations, respectively. Socket contains a reference to the underlying socket that's being used for data transmission. DataAvailable is a Boolean flag that's set to True when there's incoming data in the stream that you have not yet read. The Write() and Read() methods allow you to copy byte arrays to and from the NetworkStream, but to simplify life you'll probably use the BinaryWriter and BinaryReader classes that are defined in the System.IO namespace. These classes can wrap any stream, and automatically convert common .NET types (such as strings, integers, and dates) into an array of bytes. One good rule of thumb is to use the same approach for writing to a file as you do when reading it. For example, if you use the BinaryWriter to write data, use the BinaryReader to retrieve it, instead of the NetworkStream.Read() methods. This prevents you from introducing problems if you don't decode data the same way you encode it. For example, by default the BinaryWriter encodes data to binary using UTF-8 encoding. If you use Unicode to decode it, a problem could occur. The BinaryReader class also helps to add type safety to the NetworkStream. For example, if you use BinaryReader.ReadString() and the data in the stream doesn't correspond to a string, an exception will be thrown immediately.
http://www.yaldex.com/vb-net-tutorial/LiB0044.html
CC-MAIN-2016-50
refinedweb
1,042
56.45
Encode::MAB2 - Das Maschinelle Austauschformat fuer Bibliotheken This module and all the accompanying modules are to be regarded as ALPHA quality software. That means all interfaces, namespaces, functions, etc. are still subject to change. use Encode::MAB2; my $mab2 = 'Some string in MAB2 encoding'; my $unicode = Encode::decode('MAB2',$mab2); The Encode::MAB2 module works on the string level abstraction of MAB2 records. You can feed it a string in the encoding used by MAB2 and get a Unicode string back. The module only works in one direction, it does not provide a way to convert a Unicode string back into MAB2 encoding. MAB2 is a German library data format and an encoding almost completely based on ASCII and ISO 5426:1983. On 2003-09-08 Die Deutsche Bibliothek published, the first official document that maps the MAB2 encoding to Unicode 4.0. The mapping provided by this module follows this publication. See below for small additional convenience tricks that are also implemented by the module to avert common errors. ALERT: USE AT YOUR OWN RISK You are responsible to determine applicability of information provided. Besides the above mentioned mab_unic.pdf, the following documents provided invaluable help in developing the mapping presented in this module: This module uses the module Unicode::Normalize to deliver the combining characters in the MAB2 record in normalization form C. We have taken precautions against common errors in MAB records: This module comes with 6 modules that alleviate the parsing of MAB records. The modules are the following: MAB2::Record::Base MAB2::Record::gkd MAB2::Record::lokal MAB2::Record::pnd MAB2::Record::swd MAB2::Record::titel where Base is based on the file segm000.txt and each of the others is based on the according textfile in the directory on the server of Die Deutsche Bibliothek. More documentation can be found in MAB2::Record::Base. In addition to that, there are two tie interfaces available: Tie::MAB2::Recno and Tie::MAB2::Id. These are the high-level access classes for MAB2 files that use all other modules presented in the package.
http://search.cpan.org/dist/MAB2/lib/Encode/MAB2.pm
CC-MAIN-2014-23
refinedweb
346
54.73
LockRattler checks the currently installed versions of several security data files. As users have rightly pointed out, being told that you have version 2099 is only part of what you need to know. Without being able to check what that number should be, the information is of limited value. My task then was to incorporate ready access to the latest version information which I publish on this blog, in a series of three separate articles, covering El Capitan, Sierra, and High Sierra. The ideal solution would have been to obtain the version information via a REST request. I could then format the response, set into JSON, and compare the versions expected with those found. Unfortunately, for the moment that is not easy to do from WordPress blog pages. WordPress has a REST interface coming along, but I think it will be a while before it is completed, reliable, and fully documented. A quick kludge would simply be to open the appropriate page in the default web browser. Although better than nothing, I thought that I could do better than that. In principle, it should be straightforward to use WebKit in a simple browser window, and to point it at a particular URL. This used to be done through the WebView class: open a window with a WebView view in it, and ask it to open the URL. Apple’s current documentation refers to that as a legacy approach, though, stating: In apps that run in OS X 10.10 and later, use the WKWebView class instead of using WebView. Furthermore, Apple says in the overview for WKWebView: Important Starting in iOS 8.0 and OS X 10.10, use WKWebView to add web content to your app. Do not use UIWebView or WebView. That may be true, but when I had implemented that in LockRattler, which runs on El Capitan and later, Xcode decided that I couldn’t use WKWebView because of implementation bugs. It only works in Sierra and later, not in El Capitan. So, assuming that you want to cater for 10.11 too, here’s how to do it. In Interface Builder, create the window which is to contain the WebView, and add to its view a Web View (legacy), rather than a regular Web View which is intended for use with WKWebView. Make a custom NSWindow class to use for the window, to avoid Xcode complaining about having to use the default, and create a custom NSViewController into which your browser code will be placed. Because this is a separate window, I control it from the App Delegate, which contains a list of those browser windows var myBrowserWindow: [NSWindowController?] = [] Opening a new browser window from there is simple, provided that you remember to give the Window Controller a Storyboard ID: func openBrowserWindow() { let storyboard = NSStoryboard(name: NSStoryboard.Name("Main"), bundle: nil) let theBrowserWindow = (storyboard.instantiateController(withIdentifier: NSStoryboard.SceneIdentifier("Browser Window Controller")) as! NSWindowController) theBrowserWindow.showWindow(self) self.myBrowserWindow.append(theBrowserWindow) } The button to open this browser window then needs to access the App Delegate and call that function: @IBAction func checkBlogButton(_ sender: Any) { let delegate = NSApplication.shared.delegate as! AppDelegate delegate.openBrowserWindow() } In LockRattler, the page to be opened is determined by the version of macOS which is running. This makes the ViewController a little more complex (!). First, we have to import WebKit as well as Cocoa, and wire up the Web View (legacy) view as an outlet: import Cocoa import WebKit class WVViewController: NSViewController { @IBOutlet var webView: WebView! It then takes a single function to create the URLRequest, and call for it to be loaded: override func viewDidLoad() { super.viewDidLoad() var myURL: URL! let osVersion = ProcessInfo.processInfo.operatingSystemVersion.minorVersion if (osVersion > 12) { myURL = URL(string: "") } else if (osVersion == 12) { myURL = URL(string: "") } else { myURL = URL(string: "") } let myRequest = URLRequest(url: myURL!) webView.mainFrame.load(myRequest) } If you’re able to use a WKWebView, all that really differs in terms of code is the last call of that function, which would then be webView.load(myRequest) instead, acting on a WKWebView rather than an old WebView. That is all there is to it, although that browser window is minimalist and lacks all controls, of course.
https://eclecticlight.co/2018/05/12/putting-a-browser-window-in-your-app/
CC-MAIN-2020-40
refinedweb
700
54.22
#include <lcsignal.h> int sigpending(sigset_t *set); The synopsis for the POSIX implementation is #include <signal.h> int sigpending(sigset_t *set); You should use <signal.h> only if an appropriate feature test macro has been defined. sigpending returns the signals that are currently pending. The signal numbers are stored in the signal set addressed by set . The sigpending function tests for pending signals (signals that have been generated for the process, but not delivered). In a POSIX system without extensions, a signal can be pending only if the signal is blocked. Some SAS/C extensions can delay delivery of one or more signals, even though the signal is not blocked. Any such delayed signals are included in the set of pending signals stored by sigpending . sigpending returns 0 if it is successful and -1 if it is not successful. #include <signal.h> #include <stdio.h> /* Define structure of POSIX signal names and numbers. */ const struct { int signum; char *signame; } sigtable[] = { {SIGABRT, "ABRT"}, {SIGALRM, "ALRM"}, {SIGCHLD, "CHLD"}, {SIGCONT, "CONT"}, {SIGFPE, "FPE"}, {SIGHUP, "HUP"}, {SIGILL, "ILL"}, {SIGINT, "INT"}, {SIGKILL, "KILL"}, {SIGPIPE, "PIPE"}, {SIGQUIT, "QUIT"}, {SIGSEGV, "SEGV"}, {SIGSTOP, "STOP"}, {SIGTERM, "TERM"}, {SIGTSTP, "TSTP"}, {SIGTTIN, "TTIN"}, {SIGTTOU, "TTOU"}, {SIGUSR1, "USR1"}, {SIGUSR2, "USR2"}}; void show_pending(void) { sigset_t sigset; int i; int count; if (sigpending(&sigset) != 0) perror("sigpending error"); else { count = 0; /* Initialize pending count. */ for(i = 0; i < sizeof(sigtable)/sizeof(sigtable[0]); ++i) if (sigismember(&sigset, sigtable[i].signum)) { printf("Signal SIG%s is pending.", sigtable[i].signame); ++count; } if (count == 0) /* if no signals were pending */ puts("No POSIX signals are pending."); } } sigaddset , sigprocmask Copyright © 2001 by SAS Institute Inc., Cary, NC, USA. All rights reserved.
http://support.sas.com/documentation/onlinedoc/sasc/doc750/html/lr1/z2056458.htm#z2027971
crawl-003
refinedweb
274
67.25
Provided by: openmpi-doc_1.10.2-8ubuntu1_all NAME MPI_Get_address - Gets the address of a location in memory. SYNTAX C Syntax #include <mpi.h> int MPI_Get_address(const void *location, MPI_Aint *address) Fortran Syntax INCLUDE 'mpif.h' MPI_GET_ADDRESS(LOCATION, ADDRESS, IERROR) <type> LOCATION(*) INTEGER ADDRESS, IERROR C++ Syntax #include <mpi.h> MPI::Aint MPI::Get_address(void* location) INPUT PARAMETERS location Location in caller memory (choice). OUTPUT PARAMETERS address Address of location (integer). IERROR Fortran only: Error status (integer). DESCRIPTION MPI_Get_address returns the byte address of a location in memory. Example: Using MPI_Get_address for an array. EAL A(100,100) INTEGER I1, I2, DIFF CALL MPI_GET_ADDRESS(A(1,1), I1, IERROR) CALL MPI_GET_ADDRESS(A(10,10), I2, IERROR) DIFF = I2 - I1 ! The value of DIFF is 909*sizeofreal; the values of I1 and I2 are ! implementation dependent. NOTES Current Fortran MPI codes will run unmodified and will port to any system. However, they may fail if addresses larger than 2^32 - 1 are used in the program. New codes should be written so that they use the new functions. This provides compatibility with C/C++ and avoids errors on 64-bit architectures. However, such newly written codes may need to be (slightly) rewritten to port to old Fortran 77 environments that do not support KIND declarations..
http://manpages.ubuntu.com/manpages/xenial/man3/MPI_Get_address.openmpi.3.html
CC-MAIN-2019-47
refinedweb
213
51.75
atan2 (<valarray>) Visual Studio 2013 Returns a valarray whose elements are equal to the arctangent of the Cartesian components specified by a combination of constants and elements of valarrays. The units of the returned elements are in radians. This function preserves information about the signs of the components in the argument that is lost by the standard tangent function, and this knowledge of the quadrant enables the return value to be assigned a unique angle between +pi and –pi. If _Left and _Right have a different number of elements, the result is undefined. // valarray_atan2.cpp // compile with: /EHsc #include <valarray> #include <iostream> #include <iomanip> int main( ) { using namespace std; double pi = 3.14159265359; int i; valarray<double> va1y ( 1 , 4 ), va1x ( 1 , 4 ); va1x [ 1 ] = -1; va1x [ 2 ] = -1; va1y [ 2 ] = -1; va1y [ 3 ] = -1; valarray<double> va2 ( 4 ); cout << "The initial valarray for the x coordinate is: ( "; for ( i = 0 ; i < 4 ; i++ ) cout << va1x [ i ] << " "; cout << ")." << endl; cout << "The initial valarray for the y coordinate is: ( "; for ( i = 0 ; i < 4 ; i++ ) cout << va1y [ i ] << " "; cout << ")." << endl; va2 = atan2 ( va1y , va1x ); cout << "The atan2 ( y / x ) of the initial valarrays is:\n"; for ( i = 0 ; i < 4 ; i++ ) cout << setw( 10 ) << va2 [ i ] << " radians, which is " << setw( 11 ) << ( 180/pi ) * va2 [ i ] << "degrees" << endl; cout << endl; } The initial valarray for the x coordinate is: ( 1 -1 -1 1 ). The initial valarray for the y coordinate is: ( 1 1 -1 -1 ). The atan2 ( y / x ) of the initial valarrays is: 0.785398 radians, which is 45degrees 2.35619 radians, which is 135degrees -2.35619 radians, which is -135degrees -0.785398 radians, which is -45degrees Show:
http://msdn.microsoft.com/en-us/library/dfwy2569
CC-MAIN-2014-23
refinedweb
276
69.11
Dear Friends, usually when we made a method. ex : private void test (bool vBoll, int vInt) { } and when we call that method.we will use like this : ex: test( True,3 ) but I have a method like this ex: private static void EventFire( Delegate raisedEvent, params object[] args ) so when I call that method what value i use for raiseEvent?(since I don't know what is Delegate) please help me.... Thanks, Edited 3 Years Ago by mike_2000_17: Fixed formatting Ive not seen one like the one you show, however.. For example: delegate void SetTextCallback(String text); private void settext(String newtext) { if (this.textBox2.InvokeRequired) { SetTextCallback d = new SetTextCallback(settext); this.Invoke(d, new object[] { newtext }); } else { try { this.textBox2.AppendText(newtext); this.textBox2.Update(); } catch (System.Exception excpt) {// } } } which uses delegates to work with threads.. I think what you're methods asking for there is for EventFire( new delegate(your_event_handler),new object[] { params,go,here }); @^ thanks but I have another problem this is my code: public static class B { public static void A( Delegate raisedEvent, params object[] args ) { // skip if no event if( raisedEvent == null ) { return; } // scroll thru each event and push foreach( Delegate sink in raisedEvent.GetInvocationList() ) { try { sink.DynamicInvoke( args ); } catch( TargetInvocationException e ) { Console.Writeline("a"); } catch( TargetException e ) { Console.Writeline("b"); } catch( MemberAccessException e ) { Console.Writeline("c"); } } } } and to test that void I use this test code: public class C { private static int? MyFunc( int? tes1 ) { throw new Exception( "error" ); } private event SimpleDelegate simpleDelegate = new SimpleDelegate( MyFunc ); [TestMethod()] public void EventFireTest() { B tes = new B(); tes.A( simpleDelegate , 3 ); } } and my test code will give me the TargetInvocationException that I expected. My question is: how I can get a TargetException and MemberAccessException ? what code should I use to get that exception? Please help me... Thanks, Edited 3 Years Ago by Dani: Formatting fixed I mean is.. Can my code handle TargetException and MemberAccessException ? it's true that i use try and catch to handle an exception. for example: ------------------------------------- public class C { private static int? MyFunc( int? tes1 ) { throw new Exception( "error" ); } ----------------------------------------- is used to test TargetInvocationException. but I have to prove 2 other exception are handle by my code, so I must debug my code. but I never have any case to prove it. can u give me a case about that exception?
https://www.daniweb.com/programming/software-development/threads/146644/delegate
CC-MAIN-2016-50
refinedweb
388
58.99