Mushrooms - P. cubensis & Cannabis
It was a perfect spring day during my sophomore year of college. Perfect for mushrooms. It was me, Jimbo, and Sideburns. We had 3.5 grams each and a master plan. Jimbo would drive me to drop off my term paper at 4:00. We'd feast on our mushrooms at 5:00. Then we'd go shopping for pipes until it was time for me to unlock the microphones for the film festival by 6:00. No problem.
First let me explain that I was a projectionist at a major university. Their annual film festival was starting that night and it was my job to unlock the microphones for the pre-movie announcements. The people that put on the festival had their own projectionists, so I figured I'd be in and out in five minutes. I figured wrong. I was on my way out when I was cornered by my boss. I didn't see him very often, and he was somewhat scary even when I was sober. He kind of reminded me of a troll. Short, round, and gruff.
'How's it going?' I asked.
'Quite a turnout so far.' he responded.
'So I come back at 10:00 to lock up, right?' I asked.
He looked puzzled.
'I'm here just to unlock the microphones. Right?' My voice was a little strained.
'No, you're working the short films.'
My stomach felt like it was sinking. My mind was racing. I told him I had plans. I begged him to let me leave. There were no bargains with the troll. I went outside to explain the situation to my friends. They looked at me with concern, then they laughed. They tried to convince me to just get in the car and go, but I knew I'd get fired. I needed my job, but how badly? I was faced with a most difficult decision.
A.  Live for the moment!
B. Stay, ride out the storm, keep job. Be responsible for once!
My friends wished me luck as I headed out of the beautiful sunlight and into the dank dungeon that would be my home for the next four hours. I was just starting to get visuals when I was approached by the festival chairperson. She introduced me to my 'assistant' Jason. He was just a volunteer and didn't know anything about projectors and what not. I was a little agitated by this. I didn't want to be stuck in a dark booth with this guy. He was all creepy and nervous-looking. It looked like he was tripping! I tried to make conversation with him so I could get some insight as to what he was all about. It was tough. He was the most sober person I'd ever met. Best not to tell him I'm tripping, I thought to myself.
Things were getting more intense as it approached show-time. I got everything set up quickly because I knew I'd be a drooling mess very soon. It was 1 hour since ingestion. The first movie was actually a fun experience. It was some weird animated flick.  It must of been around the 2nd or 3rd short film when- BOOM! I was hit.
My senses became all discombobulated. The motion of the film winding through projector was hypnotizing. It looked like some kind of serpent working its way around and coiling itself back up on the take-up reel. Suddenly, the screen went black. Oh, the movie is over. Better start the other projector. It was kind of hard to find the start knob in the dark, swirling dimension I was in. Upon my success, I breathed a sigh of relief. Everything was cool again. Then suddenly, some weirdo came banging at the projection room door. 'Can you fix the focus?' he asked in a very demanding tone.
This was not going to be easy. I was seeing 3 layers of simultaneous moving pictures, none of which were real. Better go to plan B.
'Jason, do you think you can do the focus? I left my glasses at home.' I don't even wear glasses. He bought it and became the official focuser for the night. It's a good thing this guy is here after all, I thought. The mushroom gods work in mysterious ways.
Things were going fairly well at this point. I was amused by everything around me except the short films. I couldn't really see them and the soundtrack was just a droning noise that my brain eventually decided to take creative liberties with. It would make up words to go with whatever I was looking at. So in turn, the movie on the screen was about things inside the booth. It seemed that the audience was inside my head watching my thoughts on a big screen. What a weird feeling. I continued on this kick for awhile, when I started to see people turning around and looking at me. It was freaky. Then, there was banging at the door. This startled the living crap out of me because I was so tripped out about why these people were looking at me.
'Um, hello-o, there's no sound.' It was a different weirdo this time, but his condescending tone of voice made me want to smack the shit out him. Besides, I could still hear the sound. Or could I? We now had crisis on our hands. I stopped the film, turned on the booth light, and sent Jason to go get help. He brought back some tech guy from the festival committee who tripped me out even more. He stuttered when he talked, and his hand mannerisms stuttered at the same time.  We used our combined powers to figure out the problem and the show went on.
The rest of the night was fairly smooth. I would take frequent breaks to go outside and be at one with nature. The air smelled like the sweet, sweet essence of spring and the moon looked like a glowing goddess watching over the flickering, diamond-studded sky. It was unbelievably amazing. Especially in contrast to that dark, stagnant booth.
Finally, after what felt like eons, I was done with my shift at the Gulag. I thanked Jason for his help and ran outside. I tore off my shirt, threw my hands in the air, and hollered my victory call. I felt like I had conquered hell, machines, my brain, fear, everything.  I was excited to see how Sideburns and Jimbo were doing, and I still had some trip left to spend however I wanted. I never felt so free in my entire life.
Upon my return to the dorms, I was greeted by my friends as if I'd been gone to war for 20 years and returned victorious. We exchanged about fifty hilarious stories in about five minutes, then we had one of those trip telepathy moments. We all stopped talking, looked at each other and said 'Time to smoke a bowl.' We went to the woods to finish off our trip and tell more stories about that night's events. It turned out that Sideburns was tripping so hard at one point he couldn't figure out what day it was and could barely speak or stand. I guess I was lucky that I maintained even some level of control.
Overall, I'm very glad I decided to go to work that day. I wouldn't recommend it to everybody, but the contrast of work (bondage) to play (freedom) all in one trip was invigorating. It was weird sacrificing ‘the moment’ for my future benefit. It's not something I would normally do on psychedelics. Oh, and my boss thanked me for doing a ‘good job’ the next Monday. If he only knew.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


CindyJS: Game of Life on GPU
Click on canvas to interact!
Press R to reset to some random configuration.
Press SPACE to reset to blank configuration.


Presenting Team 6
Backend Engineer
My name is Jesus Valdes and I am currently a student at SFSU. I will be graduating Summer 2019 with a Bachelor of Science in Computer Science. I have worked with a variety of languages, including: Java, Kotlin, C++, Python, Ruby, and JavaScript. I am interested in working on any kind of project, but mobile applications are my favorite.
valdesj419@gmail.com


Defeasible Reasoning
From Wikipedia, the free encyclopedia
Defeasible reasoning is a kind of reasoning that is based on reasons that are defeasible, as opposed to the indefeasible reasons of deductive logic. Defeasible reasoning is a particular kind of non-demonstrative reasoning, where the reasoning does not produce a full, complete, or final demonstration of a claim, i.e., where fallibility and corrigibility of a conclusion are acknowledged. In other words defeasible reasoning produces a contingent statement or claim. Other kinds of non-demonstrative reasoning are probabilistic reasoning, inductive reasoning, statistical reasoning, abductive reasoning, and paraconsistent reasoning. Defeasible reasoning is also a kind of ampliative reasoning because its conclusions reach beyond the pure meanings of the premises. The differences between these kinds of reasoning correspond to differences about the conditional that each kind of reasoning uses, and on what premise (or on what authority) the conditional is adopted:
- Deductive (from meaning postulate, axiom, or contingent assertion): if p then q (i.e., q or not-p)
- Defeasible (from authority): if p then (defeasibly) q
- Probabilistic (from combinatorics and indifference): if p then (probably) q
- Statistical (from data and presumption): the frequency of qs among ps is high (or inference from a model fit to data); hence, (in the right context) if p then (probably) q
- Inductive (theory formation; from data, coherence, simplicity, and confirmation): (inducibly) "if p then q"; hence, if p then (deducibly-but-revisably) q
- Abductive (from data and theory): p and q are correlated, and q is sufficient for p; hence, if p then (abducibly) q as cause
Some have thought that defeasible reasoning could be connected to qualitative probabilistic reasoning, but such efforts have not borne great insights. Defeasible reasoning finds its fullest expression in jurisprudence, ethics and moral philosophy, epistemology, pragmatics and conversational conventions in linguistics, constructivist decision theories, and in knowledge representation and planning in artificial intelligence. It is also closely identified with prima facie (presumptive) reasoning (i.e., reasoning on the "face" of evidence), and ceteris paribus (default) reasoning (i.e., reasoning, all things "being equal").
History
Though Aristotle differentiated the forms of reasoning that are valid for logic and philosophy from the more general ones that are used in everyday life (see dialectics and rhetoric), 20th century philosophers mainly concentrated on deductive reasoning. At the end of the 19th century, logic texts would typically survey both demonstrative and non-demonstrative reasoning, often giving more space to the latter. However, after the blossoming of mathematical logic at the hands of Bertrand Russell, Alfred North Whitehead and Willard van Orman Quine, latter-20th century logic texts paid little attention to the non-deductive modes of inference.
There are several notable exceptions. John Maynard Keynes wrote his dissertation on non-demonstrative reasoning, and influenced the thinking of Ludwig Wittgenstein on this subject. Wittgenstein, in turn, had many admirers, including the positivist legal scholar H.L.A. Hart and the speech act linguist John L. Austin, Stephen Toulmin in rhetoric (Chaim Perelman too), the moral theorists W.D. Ross and C.L. Stevenson, and the vagueness epistemologist/ontologist Friedrich Waismann.
The etymology of defeasible usually refers to Middle English law of contracts, where a condition of defeasance is a clause that can invalidate or annul a contract or deed. Though defeat, dominate, defer, defy, deprecate and derogate are often used in the same contexts as defeasible, the verbs annul and invalidate (and nullify, overturn, rescind, vacate, repeal, debar, void, cancel, countermand, preempt, etc.) are more properly correlated with the concept of defeasibility than those words beginning with the letter d. Many dictionaries do contain the verb, to defease with past participle, defeased.
Philosophers in moral theory and rhetoric had taken defeasibility largely for granted when American epistemologists rediscovered Wittgenstein's thinking on the subject: John Ladd, Roderick Chisholm, Roderick Firth, Ernest Sosa, Robert Nozick, and John L. Pollock all began writing with new conviction about how appearance as red was only a defeasible reason for believing something to be red. More importantly Wittgenstein's orientation toward language-games (and away from semantics) emboldened these epistemologists to manage rather than to expurgate prima facie logical inconsistency.
At the same time (in the mid-1960s), two more students of Hart and Austin at Oxford, Brian Barry and David Gauthier, were applying defeasible reasoning to political argument and practical reasoning (of action), respectively. Joel Feinberg and Joseph Raz were beginning to produce equally mature works in ethics and jurisprudence informed by defeasibility.
By far the most significant works on defeasibility by the mid-1970s were in epistemology, where John Pollock's 1974 Knowledge and Justification popularized his terminology of undercutting and rebutting (which mirrored the analysis of Toulmin). Pollock's work was significant precisely because it brought defeasibility so close to philosophical logicians. The failure of logicians to dismiss defeasibility in epistemology (as Cambridge's logicians had done to Hart decades earlier) landed defeasible reasoning in the philosophical mainstream.
Defeasibility had always been closely related to argument, rhetoric, and law, except in epistemology, where the chains of reasons, and the origin of reasons, were not often discussed. Nicholas Rescher's Dialectics is an example of how difficult it was for philosophers to contemplate more complex systems of defeasible reasoning. This was in part because proponents of informal logic became the keepers of argument and rhetoric while insisting that formalism was anathema to argument.
About this time, researchers in artificial intelligence became interested in non-monotonic reasoning and its semantics. With philosophers such as Pollock and Donald Nute (e.g., defeasible logic), dozens of computer scientists and logicians produced complex systems of defeasible reasoning between 1980 and 2000. No single system of defeasible reasoning would emerge in the same way that Quine's system of logic became a de facto standard. Nevertheless, the 100-year headstart on non-demonstrative logical calculi, due to George Boole, Charles Sanders Peirce, and Gottlob Frege was being closed: both demonstrative and non-demonstrative reasoning now have formal calculi.
There are related (and slightly competing) systems of reasoning that are newer than systems of defeasible reasoning, e.g., belief revision and dynamic logic. The dialogue logics of Charles Hamblin and Jim Mackenzie (logician), and their colleagues, can also be tied closely to defeasible reasoning. Belief revision is a non-constructive specification of the desiderata with which, or constraints according to which, epistemic change takes place. Dynamic logic is related mainly because, like paraconsistent logic, the reordering of premises can change the set of justified conclusions. Dialogue logics introduce an adversary, but are like belief revision theories in their adherence to deductively consistent states of belief.
Political and judical use
Many political philosophers have been fond of the word indefeasible when referring to rights, e.g., that were inalienable, divine, or indubitable. For example, in the 1776 Virginia Declaration of Rights, "community hath an indubitable, inalienable, and indefeasible right to reform, alter or abolish government..." (also attributed to James Madison); and John Adams, "The people have a right, an indisputable, unalienable, indefeasible, divine right to that most dreaded and envied kind of knowledge - I mean of the character and conduct of their rulers." Also, Lord Aberdeen: "indefeasible right inherent in the British Crown" and Gouverneur Morris: "the Basis of our own Constitution is the indefeasible Right of the People." Scholarship about Abraham Lincoln often cites these passages in the justification of secession. Philosophers who use the word defeasible have historically had different world views from those who use the word indefeasible (and this distinction has often been mirrored by Oxford and Cambridge zeitgeist); hence it is rare to find authors who use both words.
In judicial opinions, the use of defeasible is commonplace. There is however disagreement among legal logicians whether defeasible reasoning is central, e.g., in the consideration of open texture, precedent, exceptions, and rationales, or whether it applies only to explicit defeasance clauses. H.L.A. Hart in The Concept of Law gives two famous examples of defeasibility: "No vehicles in the park" (except during parades); and "Offer, acceptance, and memorandum produce a contract" (except when the contract is illegal, the parties are minors, inebriated, or incapacitated, etc.).
Specificity
One of the main disputes among those who produce systems of defeasible reasoning is the status of a rule of specificity. In its simplest form, it is the same rule as subclass inheritance preempting class inheritance:
(R1) if p then (defeasibly) q e.g., if penguin then not-flies (R2) if r then (defeasibly) not-q e.g., if bird then flies (O1) if p then (deductively) r e.g., if penguin then bird (M1) arguably, p e.g., arguably, penguin (M2) R1 is a more specific reason than R2 e.g., R1 is better than R2 (M3) therefore, arguably, q e.g., therefore, arguably, not-flies
Approximately half of the systems of defeasible reasoning discussed today adopt a rule of specificity, while half expect that such preference rules be written explicitly by whoever provides the defeasible reasons. For example, Rescher's dialectical system uses specificity, as do early systems of multiple inheritance (e.g., David Touretzky) and the early argument systems of Donald Nute and of Guillermo Simari and Ronald Loui. Defeasible reasoning accounts of precedent (stare decisis and case-based reasoning) also make use of specificity (e.g., Joseph Raz and the work of Kevin D. Ashley and Edwina Rissland). Meanwhile, the argument systems of Henry Prakken and Giovanni Sartor, of Bart Verheij and Jaap Hage, and the system of Phan Minh Dung do not adopt such a rule.
Nature of defeasibility
There is a distinct difference between those who theorize about defeasible reasoning as if it were a system of confirmational revision (with affinities to belief revision), and those who theorize about defeasibility as if it were the result of further (non-empirical) investigation. There are at least three kinds of further non-empirical investigation: progress in a lexical/syntactic process, progress in a computational process, and progress in an adversary or legal proceeding.
Defeasibility as corrigibility: Here, a person learns something new that annuls a prior inference. In this case, defeasible reasoning provides a constructive mechanism for belief revision, like a truth maintenance system as envisioned by Jon Doyle.
Defeasibility as shorthand for preconditions: Here, the author of a set of rules or legislative code is writing rules with exceptions. Sometimes a set of defeasible rules can be rewritten, with more cogency, with explicit (local) pre-conditions instead of (non-local) competing rules. Many non-monotonic systems with fixed-point or preferential semantics fit this view. However, sometimes the rules govern a process of argument (the last view on this list), so that they cannot be re-compiled into a set of deductive rules lest they lose their force in situations with incomplete knowledge or incomplete derivation of preconditions.
Defeasibility as an anytime algorithm: Here, it is assumed that calculating arguments takes time, and at any given time, based on a subset of the potentially constructible arguments, a conclusion is defeasibly justified. Isaac Levi has protested against this kind of defeasibility, but it is well-suited to the heuristic projects of, for example, Herbert A. Simon. On this view, the best move so far in a chess-playing program's analysis at a particular depth is a defeasibly justified conclusion. This interpretation works with either the prior or the next semantical view.
Defeasibility as a means of controlling an investigative or social process: Here, justification is the result of the right kind of procedure (e.g., a fair and efficient hearing), and defeasible reasoning provides impetus for pro and con responses to each other. Defeasibility has to do with the alternation of verdict as locutions are made and cases presented, not the changing of a mind with respect to new (empirical) discovery. Under this view, defeasible reasoning and defeasible argumentation refer to the same phenomenon.
See also
References
- Defeasible logic, Donald Nute, Lecture Notes in Computer Science, Springer, 2003.
- Logical models of argument, Carlos Chesnevar, et al., ACM Computing Surveys 32:4, 2000.
- Logics for defeasible argumentation, Henry Prakken and Gerard Vreeswijk, in Handbook of Philosophical Logic, Dov M. Gabbay, Franz Guenthner, eds., Kluwer, 2002.
- Dialectics, Nicholas Rescher, SUNY Press, 1977.
- Defeasible reasoning, John Pollock, Cognitive Science, 1987.
- Knowledge and Justification, John Pollock, Princeton University Press, 1974.
- Abstract argumentation systems, Gerard Vreeswijk, Artificial Intelligence, 1997.
- Hart's critics on defeasible concepts and ascriptivism, Ronald Loui, Proc. 5th Intl. Conf. on AI and Law, 1995.
- Political argument, Brian Barry, Routledge & Kegan Paul, 1970.
- The uses of argument, Stephen Toulmin, Cambridge University Press, 1958.
- Discourse relations and defeasible knowledge, Alex Lascarides and Nicholas Asher, Proc. of the 29th Meeting of the Assn. for Comp. Ling., 1991.
- Defeasible logic programming: an argumentative approach, Alejandro Garcia and Guillermo Simari, Theory and Practice of Logic Programming 4:95-138, 2004.
- Philosophical foundations of deontic logic and the logic of defeasible conditionals, Carlos Alchourron, in Deontic logic in computer science: normative system specification, J. Meyer, R. Wieringa, eds., Wiley, 1994.
- A Mathematical Treatment of Defeasible Reasoning and its Implementation. Guillermo R. Simari, Ronald P. Loui, ] Artificial Intelligence Journal, 53(2-3): 125-157 (1992).
External Links
Categories: Epistemology | Logic | Logic programming | Knowledge representation | Reasoning


irx xylan pVND:IRX Plant wild cell wall Arabidopsis plants lignin secondary xylem (Figure growth biosynthesis mutant type VND mutants IRX transformants stem lines irx, vessels content compared plant showed expression walls Cell {border-style analysis Zhong px;} #ffffff;} biomass promoter saccharification used using Physiol acid stems phenotype strength described inflorescence specifically transformed T-DNA engineering genes levels pVND poplar transcription transformant Figure construct glucuronoxylan sections shown xylose Biotechnol Lee NAC complementation interfascicular involved irregular reduced respective similar type. Atg Scheller amounts constructs deposition family fibers improved water xylans IRX, Primer Transformants approach backgrounds decrease end functional gene increased irx- large reducing reduction significant type, ./j.-X...x ./tpc.. However, [], analyzed cellulose control deficient essential formation lower main mechanical mutants. patterns possible properties px; vessel-specific {font-family B). IRX) Sci breaking expressing font-size function metaxylem mutants, oligosaccharide polymers potential reductions specific sugar transformation yield (Figures ./pp.. Biol Demura Lignin Pauly Turner antibody average background better biofuel biofuels bromide collapsed containing crop determined difference double; enzymatic enzyme expressed glycosyltransferase hydrolysis incubated lignification lignocellulosic low material method morphology mutant. obtained orthologs overall plants. pretreatment primers protoxylem ratio region sugars synthesis transferred transgene < .). Biofuels Curr Kim Opin PCR Richardson Table Verhertbruggen Zhou added amplified bioenergy biosynthetic border-color border-width cells complemented composition contrast, decreased degree direct followed glycosyltransferases grasses grown homozygous increase insertion lines, measurements native normal plants, presence protein recalcitrance regulation release residues respectively. rosettes samples solid; species sulfuric t-test, tissues walls, wood yields {font-style {font-weight ./pnas. Acad Arabidopsis. Brown C/C CTec Cellic D). Dupree Furthermore, Gateway Hustrus Knox MYB Mol NST Natl Proc Samples Scale Somerville Teng USA Values Xylan Yamaguchi Yang York acetyl bold comparable complement constructs, courier; defective demonstrated diluted domain dwarfed effect efficient em; exhibited factor factors factors, fully future higher hygromycin impaired indicates insertions integrity intermediate irx-, key located maintaining major members monoclonal observed pVND_irx_RV phenotypes polysaccharides present promoters. pt;} recovery results reveals room rosette sequence severely showing solution stunted switches total transverse types vascular vector vessel vessels. wild-type yielded


Monica Chan
Hello, my name is Monica. Welcome to my portfolio site!
I'm studying to become a full-stack developer. Currently, I'm taking the MIT xPro Professional Certificate in Coding: Full Stack Development with MERN. This portfolio website is one of our exciting assignments. In the Portfolio section, I'll showcase the different skills I learned in this course, starting with three interactive web pages written in HTML, javascript, and CSS.
My passion for entrepreneurship and innovation has driven my professional life. I started an eCommerce company with a long-term friend almost ten years ago. We sold thousands of products and learned many valuable lessons along the way. To grow our business, I looked into many software and online applications to improve our performance. However, most apps are costly and tailored for mid-to-large size businesses. As a small online business, we need affordable, easy-to-use web applications that can easily integrate online sales, marketing with accounting and internal operations, such as assembly production, shipping, and inventory. That's why I'm learning to become a full-stack developer.


High energy physics¶
Abstract
Contains docstrings for methods in high energy physics.
Gamma matrices¶
Module to handle gamma matrices expressed as tensor objects.
Examples¶
>>> from sympy.physics.hep.gamma_matrices import GammaMatrix as G, LorentzIndex
>>> from sympy.tensor.tensor import tensor_indices
>>> i = tensor_indices('i', LorentzIndex)
>>> G(i)
GammaMatrix(i)
Note that there is already an instance of GammaMatrixHead in four dimensions: GammaMatrix, which is simply declare as
>>> from sympy.physics.hep.gamma_matrices import GammaMatrix
>>> from sympy.tensor.tensor import tensor_indices
>>> i = tensor_indices('i', LorentzIndex)
>>> GammaMatrix(i)
GammaMatrix(i)
To access the metric tensor
>>> LorentzIndex.metric
metric(LorentzIndex,LorentzIndex)
-
sympy.physics.hep.gamma_matrices.
extract_type_tens
(expression, component)[source]¶ Extract from a
TensExpr
all tensors with \(component\).Returns two tensor expressions:
- the first contains all
Tensor
of having \(component\). - the second contains all remaining.
- the first contains all
-
sympy.physics.hep.gamma_matrices.
gamma_trace
(t)[source]¶ trace of a single line of gamma matrices
Examples
>>> from sympy.physics.hep.gamma_matrices import GammaMatrix as G, gamma_trace, LorentzIndex >>> from sympy.tensor.tensor import tensor_indices, tensorhead >>> p, q = tensorhead('p, q', [LorentzIndex], [[1]]) >>> i0,i1,i2,i3,i4,i5 = tensor_indices('i0:6', LorentzIndex) >>> ps = p(i0)*G(-i0) >>> qs = q(i0)*G(-i0) >>> gamma_trace(G(i0)*G(i1)) 4*metric(i0, i1) >>> gamma_trace(ps*ps) - 4*p(i0)*p(-i0) 0 >>> gamma_trace(ps*qs + ps*ps) - 4*p(i0)*p(-i0) - 4*p(i0)*q(-i0) 0
-
sympy.physics.hep.gamma_matrices.
kahane_simplify
(expression)[source]¶ This function cancels contracted elements in a product of four dimensional gamma matrices, resulting in an expression equal to the given one, without the contracted gamma matrices.
Parameters: `expression` the tensor expression containing the gamma matrices to simplify. Notes
If spinor indices are given, the matrices must be given in the order given in the product.
References
[1] Algorithm for Reducing Contracted Products of gamma Matrices, Joseph Kahane, Journal of Mathematical Physics, Vol. 9, No. 10, October 1968.
Examples
When using, always remember that the original expression coefficient has to be handled separately
>>> from sympy.physics.hep.gamma_matrices import GammaMatrix as G, LorentzIndex >>> from sympy.physics.hep.gamma_matrices import kahane_simplify >>> from sympy.tensor.tensor import tensor_indices >>> i0, i1, i2 = tensor_indices('i0:3', LorentzIndex) >>> ta = G(i0)*G(-i0) >>> kahane_simplify(ta) Matrix([ [4, 0, 0, 0], [0, 4, 0, 0], [0, 0, 4, 0], [0, 0, 0, 4]]) >>> tb = G(i0)*G(i1)*G(-i0) >>> kahane_simplify(tb) -2*GammaMatrix(i1) >>> t = G(i0)*G(-i0) >>> kahane_simplify(t) Matrix([ [4, 0, 0, 0], [0, 4, 0, 0], [0, 0, 4, 0], [0, 0, 0, 4]]) >>> t = G(i0)*G(-i0) >>> kahane_simplify(t) Matrix([ [4, 0, 0, 0], [0, 4, 0, 0], [0, 0, 4, 0], [0, 0, 0, 4]])
If there are no contractions, the same expression is returned
>>> tc = G(i0)*G(i1) >>> kahane_simplify(tc) GammaMatrix(i0)*GammaMatrix(i1)
Algorithm
The idea behind the algorithm is to use some well-known identities, i.e., for contractions enclosing an even number of \(\gamma\) matrices
\(\gamma^\mu \gamma_{a_1} \cdots \gamma_{a_{2N}} \gamma_\mu = 2 (\gamma_{a_{2N}} \gamma_{a_1} \cdots \gamma_{a_{2N-1}} + \gamma_{a_{2N-1}} \cdots \gamma_{a_1} \gamma_{a_{2N}} )\)
for an odd number of \(\gamma\) matrices
\(\gamma^\mu \gamma_{a_1} \cdots \gamma_{a_{2N+1}} \gamma_\mu = -2 \gamma_{a_{2N+1}} \gamma_{a_{2N}} \cdots \gamma_{a_{1}}\)
Instead of repeatedly applying these identities to cancel out all contracted indices, it is possible to recognize the links that would result from such an operation, the problem is thus reduced to a simple rearrangement of free gamma matrices.
-
sympy.physics.hep.gamma_matrices.
simplify_gpgp
(ex, sort=True)[source]¶ simplify products
G(i)*p(-i)*G(j)*p(-j) -> p(i)*p(-i)
Examples
>>> from sympy.physics.hep.gamma_matrices import GammaMatrix as G, LorentzIndex, simplify_gpgp >>> from sympy.tensor.tensor import tensor_indices, tensorhead >>> p, q = tensorhead('p, q', [LorentzIndex], [[1]]) >>> i0,i1,i2,i3,i4,i5 = tensor_indices('i0:6', LorentzIndex) >>> ps = p(i0)*G(-i0) >>> qs = q(i0)*G(-i0) >>> simplify_gpgp(ps*qs*qs) GammaMatrix(-L_0)*p(L_0)*q(L_1)*q(-L_1)


closed
by None at 2019-12-20 16:45:24.referenced
by None at 2019-12-20 16:45:24.merged
by None at 2019-12-20 16:45:24.closed
by None at 2019-12-20 16:45:24.head_ref_deleted
by None at 2019-12-20 16:45:27.closed
by None at 2019-12-20 16:46:20.referenced
by None at 2019-12-20 16:46:19.merged
by None at 2019-12-20 16:46:20.closed
by None at 2019-12-20 16:46:20.head_ref_deleted
by None at 2019-12-20 16:46:23.head_ref_force_pushed
by None at 2019-12-20 16:43:46.ready_for_review
by None at 2019-12-20 16:43:57.head_ref_force_pushed
by None at 2019-12-20 16:49:42.review_requested
by None at 2019-12-20 16:49:58.head_ref_force_pushed
by None at 2019-12-20 17:21:04.referenced
by None at 2019-12-20 19:54:06.merged
by None at 2019-12-20 19:54:06.closed
by None at 2019-12-20 19:54:07.head_ref_deleted
by None at 2019-12-20 19:54:10.referenced
by Kevin Reiss at 2019-12-20 23:55:26.merged
by Kevin Reiss at 2019-12-20 23:55:26.closed
by Kevin Reiss at 2019-12-20 23:55:26.head_ref_deleted
by Kevin Reiss at 2019-12-20 23:55:31.https://github.com/pulibrary/figgy/pull/3493/commits/951909cdd93023238586f4f770c0c518c7dabb38 and https://github.com/pulibrary/figgy/pull/3493/commits/2cd14d927dd2d11d9d58b22fcbbe574d9f77626c ensure that pending_uploads
on Resources are just deleted, while the Resources themselves remain persisted. pending_uploads
will not be deleted for cases where the file_name
on the PendingUpload
is not nil
.
renamed
by James R. Griffin III at 2019-12-20 16:39:44.referenced
by James R. Griffin III at 2019-12-20 19:43:13.merged
by James R. Griffin III at 2019-12-20 19:43:13.closed
by James R. Griffin III at 2019-12-20 19:43:13.head_ref_deleted
by James R. Griffin III at 2019-12-20 19:43:16.head_ref_force_pushed
by James R. Griffin III at 2019-12-20 16:41:51.renamed
by James R. Griffin III at 2019-12-20 16:43:49.head_ref_force_pushed
by James R. Griffin III at 2019-12-20 21:48:02.renamed
by James R. Griffin III at 2019-12-20 22:27:31.labeled
by None at 2019-12-20 05:49:04.labeled
by None at 2019-12-20 05:49:04.referenced
by Francis Kayiwa at 2019-12-20 14:05:35.referenced
by Francis Kayiwa at 2019-12-20 14:07:58.referenced
by Francis Kayiwa at 2019-12-20 20:51:12.referenced
by Francis Kayiwa at 2019-12-20 20:51:12.manually changed to 0625 hours.
closed
by Francis Kayiwa at 2019-12-20 14:49:42.review_requested
by Francis Kayiwa at 2019-12-20 19:18:54.referenced
by None at 2019-12-20 19:35:32.merged
by None at 2019-12-20 19:35:32.closed
by None at 2019-12-20 19:35:32.mentioned
by James R. Griffin III at 2019-12-20 15:39:54.subscribed
by James R. Griffin III at 2019-12-20 15:39:54.head_ref_force_pushed
by Francis Kayiwa at 2019-12-20 20:56:27.referenced
by Francis Kayiwa at 2019-12-20 21:35:49.review_requested
by Francis Kayiwa at 2019-12-20 14:08:08.head_ref_force_pushed
by Francis Kayiwa at 2019-12-20 20:51:12.referenced
by Francis Kayiwa at 2019-12-20 21:37:05.merged
by Francis Kayiwa at 2019-12-20 21:37:05.closed
by Francis Kayiwa at 2019-12-20 21:37:05.head_ref_deleted
by Francis Kayiwa at 2019-12-20 21:37:08.review_requested
by Francis Kayiwa at 2019-12-20 21:36:30.referenced
by None at 2019-12-20 21:45:30.merged
by None at 2019-12-20 21:45:30.closed
by None at 2019-12-20 21:45:30.Here is the command sudo -u www-data cp -r /mnt/diglibdata/drupalweb/production_files/* /mnt/diglibdata/drupalweb/staging_files/
The new command should be cap staging sync_files_to_staging
or something similar since we will not be going the other way, to move staging files to production.
head_ref_force_pushed
by Axa Mei Liauw at 2019-12-20 16:39:40.head_ref_force_pushed
by Axa Mei Liauw at 2019-12-20 18:40:25.head_ref_force_pushed
by Axa Mei Liauw at 2019-12-20 19:24:48.renamed
by Axa Mei Liauw at 2019-12-20 20:11:56.renamed
by Axa Mei Liauw at 2019-12-20 20:12:32.referenced
by Kevin Reiss at 2019-12-20 23:54:09.merged
by Kevin Reiss at 2019-12-20 23:54:09.closed
by Kevin Reiss at 2019-12-20 23:54:10.head_ref_deleted
by Kevin Reiss at 2019-12-20 23:54:13.


|
#<[m.message_id]>
by <[m.author_username]>
(anonymously submitted)
Status changed to '<[$ctrl.getHumanReadableStatus(m.updated_status)]>'
Subject changed to '<[m.updated_subject]>'
<[$ctrl.getLocaleAbbreviatedDatetimeString(m.created_on)]>
<[m.text]>
|


ABOUT ME
Hi! I'm Sara Lenahan. I graduated with a Bachelor's in Psychology from the University of Alabama in Huntsville and am currently working towards a Master's in Human-Computer Interaction from DePaul University. Throughout my undergraduate studies, I enjoyed working as a research assistant in an Industrial/Organizational Psychology lab and a Cognitive Psychology lab. My perserverance as a a research assistant led me to many opportunities and travels. I've presented from Boston to Vancouver at the psychonomic Society Conferences and aroud the southern U.S. for the Southeastern Psychological Association annual meetings.
Aside from my studies, you can find me enjoying the beautiful scenery North Alabama has to offer. My hobbies include painting, sketching, and hiking various spots across the Tennesee Valley


We're a small team of developers who are passionate about crafting great software. We're some of the faces behind Ember.js, Ruby on Rails, jQuery and more. We're here to help you build the products and tools of the future.
WHAT WE DO
EMBER.JS & PROJECT CONSULTING
We can handle the most challenging technical problems, and we've also got architecture, product and marketing chops.
TRAINING & SPEAKING ENGAGEMENTS
We offer public, private and group training classes for Ember.js, Ruby on Rails and JavaScript. We also speak at industry conferences.
OPEN SOURCE DEVELOPMENT
We've created and made contributions to some of the most notable and successful open-source projects in the world.


Badges and labels are numerical indicators of how many items are associated with a link.
Badges
Use the .badge
class within
elements to create badges.
1
2
1
5
3
7
4
1
5
7
9
1
22
3
1
6
1 2 1 5 3 7 4 1 5 7 9 1 22 3 1 6
Labels
Use the .label
class within
elements to create labels.
Default Bright
Default Light
Default
Default Dark
Primary Bright
Primary Light
Primary
Primary Dark
Accent Bright
Accent Light
Accent
Accent Dark
Success
Info
Warning
Danger
Default Bright Default Light Default Default Dark
Primary Bright Primary Light Primary Primary Dark
Accent Bright Accent Light Accent Accent Dark
Success Info Warning Danger


Class PVLog
Class provides autoload funtionality for all PVLog classes
This class is only required, if you use the classes without composer.
You can register then the autoloader for the classes
with PVLog\PVLog::registerAutoloader();
Abstract
Namespace: PVLog
License: License (MIT) http://opensource.org/licenses/MIT
Author: Knut Kohl<EMAIL_ADDRESS>Version: PVLog JSON 1.1
Since: 2015-04-08
Since: v1.0.0
Located at PVLog.php
Namespace: PVLog
License: License (MIT) http://opensource.org/licenses/MIT
Author: Knut Kohl<EMAIL_ADDRESS>Version: PVLog JSON 1.1
Since: 2015-04-08
Since: v1.0.0
Located at PVLog.php
public static
boolean
|


The most important parts of the Startup Framework are Samples and the UI Kit that includes a set of different components. The samples consist of a set of 25 pages.
Features of Startup Framework
You’ll get a description of each component and learn how to connect and use them.


@TestOnly
- and @VisibleForTesting
-annotated methods and classes that are used in production code. Also reports
usage of applying @TestOnly
@VisibleForTesting
to the same element.
The problems are not reported if such method or class is referenced from:
@TestOnly
-annotated method
Example (in production code):
@TestOnly
fun foo() { ... }
fun main () {
foo()
}


wddx_serialize_value (PHP 4, PHP 5, PHP 7) wddx_serialize_value — Serialize a single value into a WDDX packet 说明 string wddx_serialize_value ( mixed $var [, string $comment ] ) Creates a WDDX packet from a single given value. 参数 var The value to be serialized comment An optional comment string that appears in the packet header. 返回值 Returns the WDDX packet, or FALSE on error. User Contributed Notes 1 note =============================================================================== When serializing JavaScript objects to interact with PHP objects, you should make the JavaScript object's first entry a php_class_name. PHP: class myclass { var $name; var $age; var $ssn; ... function myclass() { $this->name = ""; $this->age = ""; $this->ssn = ""; ... } } JavaScript: // serialization example code is from the // WDDX SDK http://www.openwddx.org function SerializeMsg(name, age, ssn, ...) { var MyObj = new Object; // the following line is necessary in order // to deserialize back to a PHP object MyObj.php_class_name = "myclass"; MyObj.name = name; MyObj.age = age; MyObj.ssn = ssn; ... // Create a new serializer "object" to do our work for us MySer = new WddxSerializer; // Serialize the Message variable into a WDDX Packet MyWDDXPacket = MySer.serialize(MyObj); // Output WDDX Packet so we can see what it looks like return MyWDDXPacket; } Now you can use this in a page which is its own form action:
... --------------------------------- If you don't provide that first 'php_class_name' in the JavaScript function, then when PHP deserializes it will deserialize into an associative array and not an object instance. Note that this provides a way to maintain state without using sessions or cookies - just good old HTML! Hope this helps! -- Chris Hansen


#include <sys/time.h> void timeradd(struct timeval *a, struct timeval *b, struct timeval *res); void timersub(struct timeval *a, struct timeval *b, struct timeval *res); void timerclear(struct timeval *tvp); int timerisset(struct timeval *tvp); int timercmp(struct timeval *a, struct timeval *b, CMP);
Feature Test Macro Requirements for glibc (see feature_test_macros(7)):
All functions shown above: _BSD_SOURCE
struct timeval { time_t tv_sec; /* seconds */ suseconds_t tv_usec; /* microseconds */ };
timeradd() adds the time values in a and b, and places the sum in the timeval pointed to by res. The result is normalized such that res->tv_usec has a value in the range 0 to 999,999.
timersub() subtracts the time value in b from the time value in a, and places the result in the timeval pointed to by res. The result is normalized such that res->tv_usec has a value in the range 0 to 999,999.
timerclear() zeros out the timeval structure pointed to by tvp, so that it represents the Epoch: 1970-01-01 00:00:00 +0000 (UTC).
timerisset() returns true (nonzero) if either field of the timeval structure pointed to by tvp contains a nonzero value.
timercmp() compares the timer values in a and b using the comparison operator CMP, and returns true (nonzero) or false (0) depending on the result of the comparison. Some systems (but not Linux/glibc), have a broken timercmp() implementation, in which CMP of >=, <=, and == do not work; portable applications can instead use
!timercmp(..., <)
!timercmp(..., >)
!timercmp(..., !=)


FELICIA'S JOURNEY A film review by Steve Rhodes Copyright 1999 Steve Rhodes RATING (0 TO ****): ***
Writer/director Atom Egoyan, whose last picture was the universally acclaimed THE SWEET HEREAFTER (number two on my best picture of the year list in 1997), is back with another sad tale, FELICIA'S JOURNEY. This time, working from a novel by William Trevor, he has crafted a delicate, Hitchcockean mystery.
In a tender, subtle performance, Bob Hoskins plays Joseph Ambrose Hilditch, a catering manager at a large factory in Birmingham, England. With a heart of gold, Hilditch looks after the food the workers are served, as if he were running a 3-star Michelin restaurant. "Food must be served by caring hands," the gentle but firm Hilditch lectures a salesman who dares propose bringing vending machines onto the premises to replace the cafeteria. "It keeps our spirits up. It makes us feel loved."
Not many industrial cafeteria managers care so much about their products, but Hilditch is different. Raised closely -- way too closely as we will discover -- by his mother, Hilditch stills watches her on old videos. A flamboyant woman, she was a famous chef with her own cooking program on television. She smothered her son with her overbearing demeanor, and he gagged sometimes on her food. Still, as an adult, he prepares lavish meals daily -- solely for himself -- based on her video instructions.
This man, who looks like he wouldn't hurt a fly, is also a great befriender of young women. He listens to them, when no one else does. One day, Felicia (Elaine Cassidy) comes from Ireland, searching desperately for a lost boyfriend whom she must locate. Hilditch, of course, offers to help.
Egoyan is a master at creating a mood. Britain's industrial heartland looks cold, gray and dreary in contrast to Hilditch's bright, fully equipped kitchen. And Ireland has never looked lovelier with its church ruins and lush, rolling countryside.
The two leads each seem to be holding back the real stories of their lives. As the movie unfolds, we learn exactly why Felicia feels compelled to make her journey and why Hilditch likes young women to confide in him. Neither answer will come as much of a shock. Given that the element of surprise isn't present to any extent, Egoyan makes a strategic mistake in the film's structure. The completely satisfying setup of the plot is allowed to go on for too long. It isn't until after the film's midway point that the picture is finally ready to get under way. Then, when it should be getting into gear, Egoyan gives Hilditch several long monologues that try viewers' patience. The lethargic second half is a let down as it never quite delivers on the promise of the first.
An incongruous subplot that seems lifted out of a bad comedy features a group of evangelical Christians as the story's buffoons. Using a colorful, popup book, "The Road to Paradise," they peddle God door-to-door with the unrelenting fervor of a Fuller Brush man. They serve, however, only to clutter up the storyline and slow its momentum when it should be building up.
Hitchcock made fascinating films that, compared to the body of his work, were relatively run of the mill for him. So it is with Egoyan's FELICIA'S JOURNEY, an intriguing picture that's ultimately a disappointment because it's a near miss. Well worth seeing, but far from the director's best.
FELICIA'S JOURNEY runs too long at 1:56. It is rated PG-13 for mature thematic elements and related disturbing images and would be fine for teenagers.
Email<EMAIL_ADDRESS>Web: http://www.InternetReviews.com
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Please: Open the console!
Please: chrome://webrtc-internals in Chrome or about:webrtc in Firefox
Theoretical number of arcs: ~
Actual number of arcs(including duplicates):
Actual number of duplicates:
Actual number of arcs without duplicates:
Pourcentage of duplicate:
Average PV size:


Qk App
Home
(current)
UI Demo
API Gateway demo
Documentation
Login
My Account
{User's Name}
{User's role}
Some quick example text to build on the card title and make up the bulk of the card's content.
Docs
SRS (High Level)
UI Demo
Make my business smarter!
Full name of the Business
Business name (abbr.)
Address (Line 1)
Address (Line 2)
City
District
Postal Code
State
Country Code
Phone Number 1
Phone Number 2
email Id
First Name
Last Name
email ID
Mobile Number
User ID (Login ID)
I have read and agree to the
Terms of use
User ID (Login ID)
Enter Password
Confirm Password
Secret Question
Secret Answer
Enter your OTP
Enter user name
Enter password
Title
×
Message


Born November 7, 1918, four days before the Armistice ended World War I, Mr. Graham was reared on a dairy farm in Charlotte, N.C. Growing up during the Depression, he learned the value of hard work on the family farm, but he also found time to spend many hours in the hayloft reading books on a wide variety of subjects.
In the fall of 1934, at age 15, Mr. Graham made a personal commitment to Christ through the ministry of Mordecai Ham, a traveling evangelist, who visited Charlotte for a series of revival meetings.
Ordained in 1939 by Peniel Baptist Church in Palatka, Fla. (a church in the Southern Baptist Convention), Mr. Graham received a solid foundation in the Scriptures at Florida Bible Institute (now Trinity College of Florida). In 1943 he graduated from Wheaton College in Illinois and married fellow student Ruth McCue Bell, daughter of a missionary surgeon, who spent the first 17 years of her life in China.
Billy Graham is beloved by many Americans today. He is an icon in the church and a great influence in his time. He has served the Lord faithfully winning countless souls over to Jesus Christ.
There is no doubt that when Billy Graham does pass into glory, there will be a void left in the American Church and to countless Christians around the world.


Magnolia grandiflora, commonly known as the Southern magnolia or bull bay, is a tree of the family Magnoliaceae native to the southeastern United States, from coastal Virginia south to central Florida, and west to eastern Texas and Oklahoma.  Widely cultivated around the world, over a hundred cultivars have been bred and marketed commercially. The timber is hard and heavy, and has been used commercially to make furniture, pallets, and veneer.
Ranunculus asiaticus (Persian Buttercup) is a species of buttercup (Ranunculus) native to the eastern Mediterranean region in southwestern Asia, southeastern Europe (Crete, Karpathos and Rhodes), and northeastern Africa. It is a herbaceous perennial plant growing to 45 cm tall, with simple or branched stems. The basal leaves are three-lobed, with leaves higher on the stems more deeply divided; like the stems, they are downy or hairy. The flowers are 3-5 cm diameter, variably red to pink, yellow, or white, with one to several flowers on each stem.
Tulipa gesneriana L. or "Didier's tulip" is a plant belonging to the family of Liliaceae. This species has uncertain origins, possibly from Asia, and has become naturalised in south-west Europe. Most of the cultivated species, subspecies and cultivars of tulip are derived from Tulipa gesneriana. The flower and bulb can cause dermatitis through the allergen, tuliposide A, even though the bulbs may be consumed with little ill-effect. The sweet-scented bisexual flowers appear during April and May. Bulbs are extremely resistant to frost, and can tolerate temperatures well below freezing - a period of low temperature is necessary to induce proper growth and flowering, triggered by an increase in sensitivity to the phytohormone auxin. The bulbs may be dried and pulverised and added to cereals or flour.


{% extends 'base.html' %} {% block title %}
Your order has been successfully completed. Your order number is {{ order.id }}


A HOME OF OUR OWN A film review by James Berardinelli Copyright 1993 James Berardinelli
A HOME OF OUR OWN
Rating (Linear 0 to 10): 5.3
Date Released: 11/5/93 Running Length: 1:44 Rated: PG-13 (Mature themes, language)
Starring: Kathy Bates, Edward Furlong, Soon-Teck Oh Director: Tony Bill Producers: Dale Pollock and Bill Bordon Screenplay: Patrick Duncan Music: Michael Convertino Released by Gramercy Pictures
It's 1962 in Los Angeles, and Frances Lacey (Kathy Bates) has spent the last few years just trying to make ends meet. Ever since the death of her husband, life has been nothing but drudgery as she works all hours to feed her children, a group that she has fondly dubbed the "Lacey tribe." Other than son Shane (Edward Furlong) and daughter Lynn (Clarissa Lassig), the kids are to young to be of much substantial help. Finally, after getting fired from her job at a potato chip packing plant, Frances decides to move her family east, looking for a home that they can call their own. They find it - a rundown old shack with no roof, electricity, or plumbing - in Idaho, on a plot of land owned by Mr. Moon (Soon-Teck Oh). Once Frances convinces him to sell, the difficulty comes in meeting his price, since the Lacey tribe is flat broke. But that's never stopped them before.
A HOME OF OUR OWN is supposed to be a deeply-moving emotional experience, showing how a fatherless family can face down any odds if they stick together. You know the kind of movie that I mean - one that has women reaching for tissues and men clearing their throats. Supposedly based on a true story, it contains all the elements of bad melodrama, and the overall effect is overly-sentimental, bordering on cloying. There's even an ending that rivals that of SCENT OF A WOMAN for silliness.
It seems unlikely that a factual story would follow so many well- established Hollywood formulas, but that's what happens in A HOME OF OUR OWN. There aren't too many that this movie misses, the most obvious and disappointing of which is the mother/son conflict that has become obligatory in any picture that touches, however briefly, on a coming-of- age. At best, the resolution of this subplot is weak.
In a way, it's too bad that the movie always takes the easy way out because, taken individually, many of the scenes are effective. One that stands out is a gem between Frances and daughter Lynn on Christmas morning. With no money to spend on her mother for a present, Lynn has knitted Frances slippers, and here she presents them. This is poignant and effective without resorting to the manipulation that is present throughout too much of the film.
Another thing I found annoying about A HOME OF OUR OWN is the voice-over - a depressingly overused tool in these sorts of retrospective films. Sometimes it works, but more often than not, as here, it gives the film makers an easy way out. They no longer have to show emotions and events, they can simply relate them through the narration. This technique leads to gaps in the story, and an general feeling on the part of the viewer that he's missing something important.
The acting is a mixed bag. Kathy Bates is superlative as Frances, and has found a female character with real depth and strength. These are rare enough in movies these days that when one shows up, no matter how dubious the film's quality is, an actress will jump at it. Clarissa Lassig opened my eyes as young Lynn, managing a quality of fresh innocence that is enjoyable to watch. Edward Furlong has improved since AMERICAN HEART, but his range is still limited. Slowly-but-surely, his experience with different directors is building him to a level of competence.
Perhaps the most obvious problem with A HOME OF OUR OWN is that there's nothing new in it. Pieces of this film can be found in recent offerings from THIS BOY'S LIFE to A BRONX TALE. Maybe the release timing is poor, but it seems like I've just gone through everything this movie has to offer in superior productions. A HOME OF OUR OWN isn't a bad movie, but there's certainly no spark to make it stand out.
- James Berardinelli<EMAIL_ADDRESS>.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


{% extends 'base.html' %} {% load staticfiles %} {% block profile %}
{% block uname %}{{ username }}{% endblock %}
{% block upload_pic %}{% block exp_text %}Your current experience is: {{ experience }}{% endblock %}
{% else %}{% block no_exp_text %}You have no experience yet. Get back in the campus!{% endblock %}
{% endif %}You have not finished any stories yet.
{% endif %}You can move
Get your first exp to unlock this badge
Zombie Killer?

Win 20 stories to unlock this badge


What do you want to eat?
Burrito
Cheeseburger
Double Bacon Burger Supreme
Pepperoni Pizza
Taco
Order Now


Theme Builder is set up with a custom theme for you to edit. The 'Instructions' tab has documentation that walks you through how to edit the custom theme files in your favorite text editor.


With the exception of no asset verification loans, lenders want to
verify where the money for your new home will be coming from. If you can
document that the funds are coming from your personal savings, the
lender is more confident of your strength as a borrower.
In addition, if you can verify that you have additional assets that are
not needed for the down payment, it is important to document those, too.
Additional assets are reserves you can draw upon during times of
trouble, such as unemployment, medical emergencies, and similar
occurrences. Additional assets can also help to document that you have a
history of saving money, which makes you a more dependable borrower.
It is extremely important to completely document the paper trail of any
funds you use for down payment and closing costs. The sections below
provide guidance on both verifying assets and documenting them as a
source of your down payment.
Checking, Savings, & Money Market Accounts
The quickest and easiest way to document funds in your bank account is
to provide your lender with copies of your most recent bank statements.
Most lenders request two months of bank statements, but some still ask
for three. Some lenders still send a Verification of Deposit to your
bank in order to determine your current bank balances and average
balance for the last two months. However, that is the old way of doing
business and most lenders nowadays prefer to have bank statements.
If the money you are using for the down payment and closing costs has
been in the bank for the entire period covered by the bank statements,
you’re fine. These are known as “seasoned funds.” However, if your
statements show any large or unusual deposits, the lender will ask you
to explain them and document their source.
Stocks, Bonds, Mutual Funds, etc.
Most of those who own stocks get a monthly or quarterly statement from
their brokerage. You will need to supply statements for the most recent
sixty or ninety days in order to document these assets.
Though it is rare nowadays, some people actually have stock certificates
instead of having a brokerage account. When this is the situation, make
copies of the certificates and provide those copies to your lender. You
might also want to supply tax records to indicate you have owned these
stocks for some time.
If part of your down payment will come from the sale of stocks and
investments, you will need to keep all documentation that applies to the
sale. Provide these copies to your lender as well.
Gifts
Especially when buying a first home, some borrowers need help coming up
with the down payment. This help should come in the form of a gift from
a close family member. Lenders will require the donors to sign a special
form called a gift letter. The gift letter states the relationship
between the parties, the address of the purchased property, the amount
of the gift, and sometimes the source of the funds used to make the
gift. The gift letter also clearly states that the funds are a gift and
not required to be repaid.
With most lenders, the donor will have to also provide evidence that
they have the ability to make the gift. This can be in the form of a
bank or stock statement to show they have the funds available. You
should also make a copy of the check used to make the gift and keep a
copy of the deposit receipt when you deposit the gift funds into your
bank account or escrow.
401K or Retirement Accounts
It is important to provide documentation about your retirement accounts
or 401K programs because this is another asset you could draw upon as
reserves in case of a problem. It is also another way to show you have a
savings history. Just provide a copy of your most recent statement to
your lender.
Many people use these accounts as a source of funds for their down
payment, too. Some employers allow you to cash out a portion of the 401K
and some allow you to borrow against it. Be sure to keep copies of all
paperwork involving the transaction. If they cut you a check, be sure to
make a photocopy of that, too, including any receipt for deposit into
your personal bank account.
If you are borrowing against your 401K, some lenders will count this as
an additional debt to go along with car payments, credit cards and other
obligations. This may seem kind of silly because you are borrowing your
own money, but from the lender’s viewpoint it is still a monthly
obligation that you must come up with and should be taken into account.
If you are tight on your debt-to-income ratios in qualifying for a home
loan, this could be an important consideration. It may affect whether
you choose to cash out the account and pay any tax penalty, or simply
borrow against it.
Employers
Some companies provide down payment assistance for their employees. They
may feel that Homeowners are more stable and reliable employees, or that
providing down payment assistance fosters an environment of higher
morale and loyalty to the firm. Just make copies of all the paperwork,
including a copy of the check and the receipt when you deposit the funds
into your personal bank account. It is important that these funds do not
require repayment.
Savings Bonds
If you have Savings Bonds, remember that they are also financial assets.
Since you hold the actual bonds in your possession, the easiest and best
way to verify them for your mortgage lender is to make photocopies of
them. If you choose to cash them in for down payment or closing costs,
you should do this at your local bank. Be sure to keep copies of the
paperwork the bank provides because that will establish the current
value of the bonds and show that you received their cash value.
Personal Property - Cars, Antiques, etc.
Personal property includes automobiles, vehicles, boats, furniture,
collections, heirlooms, antiques, art, clothing, and practically
everything you own except for real estate. The mortgage application asks
you to estimate the value of these items.
The larger the loan amount, the more important it is for you to provide
details on your personal property. This is because larger loans usually
indicate larger incomes, and lenders check to see if your personal
property matches your income. If it does not, this sends a red flag to
the underwriter and they take a closer look at your application.
You are not required to document the value of personal property unless
you intend to sell them to come up with your down payment.
Selling Personal Property
For those Homebuyers who do sell personal property in order to come up
with their down payment, the verification process can be arduous.
Lenders are much stricter about documenting this method of coming up
with your source of funds.
Selling a car is perhaps the easiest to document. First, you need to
photocopy the registration that shows you actually own the vehicle. You
will have to provide a copy of the page in the “Blue Book” that shows
your model and its value. Then you need to photocopy the bill of sale
showing the transfer to another individual and a copy of the check used
to purchase the vehicle. Do not get paid in cash because that makes it
impossible to show you actually received the funds. Make a copy of the
receipt when you deposit the funds into the bank.
Other types of personal property are more difficult because you have to
show that you actually own the property and that it actually has the
value that you sold it for. This is a little harder to do for most
assets than it is for automobiles.
Records showing you purchased the property would be helpful. You could
also provide an old inventory that documents ownership. To determine
value, you may have to contract with an independent appraiser or a
specialist who has the knowledge for that particular type of property.
If you cannot document the item’s value, the lender will not view the
sale as an acceptable source of funds. Just like selling a car, you have
to prove you own the item, make a copy of the bill of sale, copy the
check used to purchase the item, and make a copy of your receipt when
you deposit the funds into your bank.
Back to Tips


you're bad at table tennis
hello dad
Hello Sofia
this is
my really cool
html
dfgjkhk.m,,kl;hli
it's really:
epic
super cool
complex
this is a link


Search
Preparing search index...
The search index is not available
@xarc/react-query
Options
All
Public
Public/Protected
All
Inherited
Externals
Menu
@xarc/react-query
browser
MutationObserverResult
Interface MutationObserverResult<TData, TError, TVariables, TContext>
Type parameters
TData =
unknown
TError =
unknown
TVariables =
void
TContext =
unknown
Hierarchy
MutationState
<
TData
,
TError
,
TVariables
,
TContext
>
MutationObserverResult
Index
Properties
context
data
error
failure
Count
is
Error
is
Idle
is
Loading
is
Paused
is
Success
mutate
reset
status
variables
Properties
context
context
:
TContext
data
data
:
TData
error
error
:
TError
failure
Count
failure
Count
:
number
is
Error
is
Error
:
boolean
is
Idle
is
Idle
:
boolean
is
Loading
is
Loading
:
boolean
is
Paused
is
Paused
:
boolean
is
Success
is
Success
:
boolean
mutate
mutate
:
MutateFunction
<
TData
,
TError
,
TVariables
,
TContext
>
reset
reset
:
(
)
=>
void
Type declaration
(
)
:
void
Returns
void
status
status
:
MutationStatus
variables
variables
:
TVariables
Exports
browser
common
common/feature-
info
node
Mutation
Observer
Result
context
data
error
failure
Count
is
Error
is
Idle
is
Loading
is
Paused
is
Success
mutate
reset
status
variables
Generated using
TypeDoc


Persepolis Rising by James S.A. Corey
Rating: ★ ★ ★ ★ ★
Price: $11.74
- Cover: Ebook
- Published by Orbit Books
- Pages: 608
Persepolis Rising by James S.A. Corey
Rating: ★ ★ ★ ★ ★
Price: $11.74
The Demon Crown by James Rollins
Rating ★ ★ ★ ★ ★
$28.99
The Vanishing Season by Joanna Schaffhausen
Rating ★ ★ ★ ★ ★
$24.99
Year One by Nora Roberts
Rating: ★ ★ ★ ★ ★
Price: $27.99
Chosen One by Scarlett Dawn
Rating ★ ★ ★ ★ ★
$5.26
Flame In The Dark by Faith Hunter
Rating ★ ★ ★ ★ ★
$7.99
Love, Life, and the List by Kasie West
Rating ★ ★ ★ ★ ★
$13.19
Foolish Hearts by Emma Mills
Rating ★ ★ ★ ★ ★
$17.99
Shadow Girl by Liana Liu
Rating ★ ★ ★ ★ ★
$17.99
Roomies by Christina Lauren
Rating ★ ★ ★ ★ ★
$16.00
After The Wedding by Courtney Milan
Rating ★ ★ ★ ★ ★
$5.99
Cowboy Up by Harper Sloan
Rating ★ ★ ★ ★ ★
$15.95


White Castle
Welcome To White Castle
Home Of The Famous Sliders Since 1921
Menu
- Original Sliders
The Original Slider, made with 100% beef, steam grilled on a bed of
onions and served with a slice of pickle on our signature bun.
- The Impossible Slider
The Impossible Slider with Smoked Cheddar Cheese - it sizzles,
tastes and smells just like real beef- but guess what? It's made from plants!
Also available without cheese. Amazing taste, plant based!
- Cheese Slider
The Original Slider, made with 100% beef, steam grilled on a bed of
onions topped with a slice of American, Jalapeño or Smoked Cheddar cheese.
- Bacon Cheese Slider
Made with 100% beef, steam-grilled on a bed of onions,
topped with crispy hickory-smoked bacon and a slice of cheese: American,
Jalapeno, or Smoked Cheddar.
- Double Cheese Slider
Two 100% beef patties steam-grilled on a bed of onions plus two
slices of cheese: American, Jalapeno, or Cheddar.
- Chicken Slider
Our Chicken Slider is made with all white meat and topped
with cheese: American, Jalapeno or Smoked Cheddar.
- Chicken Rings
Made with tender, white meat chicken on the inside
and crispy on the outside
- Fries
Classic crinkle cut fries, crispy on the outside
and tender on the inside.
1950 3rd St
La Verne, CA 91750
United States
(909)593-3511
Copyright by Sergio
Youtube
Location
Jobs
<EMAIL_ADDRESS>More


Protect your PC against Virus
Install Anti-Virus/Malware Software.
Keep Your Anti-Virus Software Up to Date.
Run Regularly Scheduled Scans with Your Anti-Virus Software.
Keep Your Operating System Current.
Secure Your Network.
Think Before You Click.
Avoid Spyware
To avoid unintentionally installing it yourself, follow these good security practices: Don't click on links within pop-up windows - Because pop-up windows are often a product of spyware, clicking on the window may install spyware software on your computer.
Beware of Ransomware
Malicious software that uses encryption to hold data for ransom has become wildly successful over the last few years. The purpose of this software is to extort money from the victims with promises of restoring encrypted data. Like other computer viruses, it usually finds its way onto a device by exploiting a security hole in vulnerable software or by tricking somebody into installing it.


# Async.js
Async is a utility module which provides straight-forward, powerful functions for working with asynchronous JavaScript. Although originally designed for use with [node.js](http://nodejs.org), it can also be used directly in the browser.
Async provides around 20 functions that include the usual ‘functional’ suspects (map, reduce, filter, forEach…) as well as some common patterns for asynchronous control flow (parallel, series, waterfall…). All these functions assume you follow the node.js convention of providing a single callback as the last argument of your async function.
## Quick Examples
- async.map([‘file1’,’file2’,’file3’], fs.stat, function(err, results){
- // results is now an array of stats for each file
});
- async.filter([‘file1’,’file2’,’file3’], path.exists, function(results){
- // results now equals an array of the existing files
});
- async.parallel([
- function(){ ... }, function(){ ... }
], callback);
- async.series([
- function(){ ... }, function(){ ... }
]);
There are many more functions available so take a look at the docs below for a full list. This module aims to be comprehensive, so if you feel anything is missing please create a GitHub issue for it.
## Download
Releases are available for download from [GitHub](http://github.com/caolan/async/downloads). Alternatively, you can install using Node Package Manager (npm):
npm install async
__Development:__ [async.js](https://github.com/caolan/async/raw/master/lib/async.js) - 17.5kb Uncompressed
__Production:__ [async.min.js](https://github.com/caolan/async/raw/master/dist/async.min.js) - 1.7kb Packed and Gzipped
## In the Browser
So far its been tested in IE6, IE7, IE8, FF3.6 and Chrome 5. Usage:

## Documentation
### Collections
- [forEach](#forEach)
- [map](#map)
- [filter](#filter)
- [reject](#reject)
- [reduce](#reduce)
- [detect](#detect)
- [sortBy](#sortBy)
- [some](#some)
- [every](#every)
- [concat](#concat)
### Control Flow
- [series](#series)
- [parallel](#parallel)
- [whilst](#whilst)
- [until](#until)
- [waterfall](#waterfall)
- [queue](#queue)
- [auto](#auto)
- [iterator](#iterator)
- [apply](#apply)
- [nextTick](#nextTick)
### Utils
- [memoize](#memoize)
- [unmemoize](#unmemoize)
- [log](#log)
- [dir](#dir)
- [noConflict](#noConflict)
## Collections
 ### forEach(arr, iterator, callback)
Applies an iterator function to each item in an array, in parallel. The iterator is called with an item from the list and a callback for when it has finished. If the iterator passes an error to this callback, the main callback for the forEach function is immediately called with the error.
Note, that since this function applies the iterator to each item in parallel there is no guarantee that the iterator functions will complete in order.
__Arguments__
- arr - An array to iterate over.
- iterator(item, callback) - A function to apply to each item in the array. The iterator is passed a callback which must be called once it has completed.
- callback(err) - A callback which is called after all the iterator functions have finished, or an error has occurred.
__Example__
// assuming openFiles is an array of file names and saveFile is a function // to save the modified contents of that file:
- async.forEach(openFiles, saveFile, function(err){
- // if any of the saves produced an error, err would equal that error
});
 ### forEachSeries(arr, iterator, callback)
The same as forEach only the iterator is applied to each item in the array in series. The next iterator is only called once the current one has completed processing. This means the iterator functions will complete in order.
 ### forEachLimit(arr, limit, iterator, callback)
The same as forEach only the iterator is applied to batches of items in the array, in series. The next batch of iterators is only called once the current one has completed processing.
__Arguments__
- arr - An array to iterate over.
- limit - How many items should be in each batch.
- iterator(item, callback) - A function to apply to each item in the array. The iterator is passed a callback which must be called once it has completed.
- callback(err) - A callback which is called after all the iterator functions have finished, or an error has occurred.
__Example__
// Assume documents is an array of JSON objects and requestApi is a // function that interacts with a rate-limited REST api.
- async.forEachLimit(documents, 20, requestApi, function(err){
- // if any of the saves produced an error, err would equal that error
});
 ### map(arr, iterator, callback)
Produces a new array of values by mapping each value in the given array through the iterator function. The iterator is called with an item from the array and a callback for when it has finished processing. The callback takes 2 arguments, an error and the transformed item from the array. If the iterator passes an error to this callback, the main callback for the map function is immediately called with the error.
Note, that since this function applies the iterator to each item in parallel there is no guarantee that the iterator functions will complete in order, however the results array will be in the same order as the original array.
__Arguments__
- arr - An array to iterate over.
- iterator(item, callback) - A function to apply to each item in the array. The iterator is passed a callback which must be called once it has completed with an error (which can be null) and a transformed item.
- callback(err, results) - A callback which is called after all the iterator functions have finished, or an error has occurred. Results is an array of the transformed items from the original array.
__Example__
- async.map([‘file1’,’file2’,’file3’], fs.stat, function(err, results){
- // results is now an array of stats for each file
});
 ### mapSeries(arr, iterator, callback)
The same as map only the iterator is applied to each item in the array in series. The next iterator is only called once the current one has completed processing. The results array will be in the same order as the original.
 ### filter(arr, iterator, callback)
__Alias:__ select
Returns a new array of all the values which pass an async truth test. _The callback for each iterator call only accepts a single argument of true or false, it does not accept an error argument first!_ This is in-line with the way node libraries work with truth tests like path.exists. This operation is performed in parallel, but the results array will be in the same order as the original.
__Arguments__
- arr - An array to iterate over.
- iterator(item, callback) - A truth test to apply to each item in the array. The iterator is passed a callback which must be called once it has completed.
- callback(results) - A callback which is called after all the iterator functions have finished.
__Example__
- async.filter([‘file1’,’file2’,’file3’], path.exists, function(results){
- // results now equals an array of the existing files
});
 ### filterSeries(arr, iterator, callback)
__alias:__ selectSeries
The same as filter only the iterator is applied to each item in the array in series. The next iterator is only called once the current one has completed processing. The results array will be in the same order as the original.
 ### reject(arr, iterator, callback)
The opposite of filter. Removes values that pass an async truth test.
 ### rejectSeries(arr, iterator, callback)
The same as filter, only the iterator is applied to each item in the array in series.
 ### reduce(arr, memo, iterator, callback)
__aliases:__ inject, foldl
Reduces a list of values into a single value using an async iterator to return each successive step. Memo is the initial state of the reduction. This function only operates in series. For performance reasons, it may make sense to split a call to this function into a parallel map, then use the normal Array.prototype.reduce on the results. This function is for situations where each step in the reduction needs to be async, if you can get the data before reducing it then its probably a good idea to do so.
__Arguments__
- arr - An array to iterate over.
- memo - The initial state of the reduction.
- iterator(memo, item, callback) - A function applied to each item in the array to produce the next step in the reduction. The iterator is passed a callback which accepts an optional error as its first argument, and the state of the reduction as the second. If an error is passed to the callback, the reduction is stopped and the main callback is immediately called with the error.
- callback(err, result) - A callback which is called after all the iterator functions have finished. Result is the reduced value.
__Example__
- async.reduce([1,2,3], 0, function(memo, item, callback){
// pointless async: process.nextTick(function(){
callback(null, memo + item)});
- }, function(err, result){
- // result is now equal to the last value of memo, which is 6
});
 ### reduceRight(arr, memo, iterator, callback)
__Alias:__ foldr
Same as reduce, only operates on the items in the array in reverse order.
 ### detect(arr, iterator, callback)
Returns the first value in a list that passes an async truth test. The iterator is applied in parallel, meaning the first iterator to return true will fire the detect callback with that result. That means the result might not be the first item in the original array (in terms of order) that passes the test.
If order within the original array is important then look at detectSeries.
__Arguments__
- arr - An array to iterate over.
- iterator(item, callback) - A truth test to apply to each item in the array. The iterator is passed a callback which must be called once it has completed.
- callback(result) - A callback which is called as soon as any iterator returns true, or after all the iterator functions have finished. Result will be the first item in the array that passes the truth test (iterator) or the value undefined if none passed.
__Example__
- async.detect([‘file1’,’file2’,’file3’], path.exists, function(result){
- // result now equals the first file in the list that exists
});
 ### detectSeries(arr, iterator, callback)
The same as detect, only the iterator is applied to each item in the array in series. This means the result is always the first in the original array (in terms of array order) that passes the truth test.
 ### sortBy(arr, iterator, callback)
Sorts a list by the results of running each value through an async iterator.
__Arguments__
- arr - An array to iterate over.
- iterator(item, callback) - A function to apply to each item in the array. The iterator is passed a callback which must be called once it has completed with an error (which can be null) and a value to use as the sort criteria.
- callback(err, results) - A callback which is called after all the iterator functions have finished, or an error has occurred. Results is the items from the original array sorted by the values returned by the iterator calls.
__Example__
- async.sortBy([‘file1’,’file2’,’file3’], function(file, callback){
- fs.stat(file, function(err, stats){
- callback(err, stats.mtime);
});
- }, function(err, results){
- // results is now the original array of files sorted by // modified date
});
 ### some(arr, iterator, callback)
__Alias:__ any
Returns true if at least one element in the array satisfies an async test. _The callback for each iterator call only accepts a single argument of true or false, it does not accept an error argument first!_ This is in-line with the way node libraries work with truth tests like path.exists. Once any iterator call returns true, the main callback is immediately called.
__Arguments__
- arr - An array to iterate over.
- iterator(item, callback) - A truth test to apply to each item in the array. The iterator is passed a callback which must be called once it has completed.
- callback(result) - A callback which is called as soon as any iterator returns true, or after all the iterator functions have finished. Result will be either true or false depending on the values of the async tests.
__Example__
- async.some([‘file1’,’file2’,’file3’], path.exists, function(result){
- // if result is true then at least one of the files exists
});
 ### every(arr, iterator, callback)
__Alias:__ all
Returns true if every element in the array satisfies an async test. _The callback for each iterator call only accepts a single argument of true or false, it does not accept an error argument first!_ This is in-line with the way node libraries work with truth tests like path.exists.
__Arguments__
- arr - An array to iterate over.
- iterator(item, callback) - A truth test to apply to each item in the array. The iterator is passed a callback which must be called once it has completed.
- callback(result) - A callback which is called after all the iterator functions have finished. Result will be either true or false depending on the values of the async tests.
__Example__
- async.every([‘file1’,’file2’,’file3’], path.exists, function(result){
- // if result is true then every file exists
});
 ### concat(arr, iterator, callback)
Applies an iterator to each item in a list, concatenating the results. Returns the concatenated list. The iterators are called in parallel, and the results are concatenated as they return. There is no guarantee that the results array will be returned in the original order of the arguments passed to the iterator function.
__Arguments__
- arr - An array to iterate over
- iterator(item, callback) - A function to apply to each item in the array. The iterator is passed a callback which must be called once it has completed with an error (which can be null) and an array of results.
- callback(err, results) - A callback which is called after all the iterator functions have finished, or an error has occurred. Results is an array containing the concatenated results of the iterator function.
__Example__
- async.concat([‘dir1’,’dir2’,’dir3’], fs.readdir, function(err, files){
- // files is now a list of filenames that exist in the 3 directories
});
 ### concatSeries(arr, iterator, callback)
Same as async.concat, but executes in series instead of parallel.
## Control Flow
 ### series(tasks, [callback])
Run an array of functions in series, each one running once the previous function has completed. If any functions in the series pass an error to its callback, no more functions are run and the callback for the series is immediately called with the value of the error. Once the tasks have completed, the results are passed to the final callback as an array.
It is also possible to use an object instead of an array. Each property will be run as a function and the results will be passed to the final callback as an object instead of an array. This can be a more readable way of handling results from async.series.
__Arguments__
- tasks - An array or object containing functions to run, each function is passed a callback it must call on completion.
- callback(err, results) - An optional callback to run once all the functions have completed. This function gets an array of all the arguments passed to the callbacks used in the array.
__Example__
- async.series([
- function(callback){
- // do some stuff ... callback(null, ‘one’);
}, function(callback){
// do some more stuff ... callback(null, ‘two’);},
], // optional callback function(err, results){
// results is now equal to [‘one’, ‘two’]});
// an example using an object instead of an array async.series({
- one: function(callback){
- setTimeout(function(){
- callback(null, 1);
}, 200);
}, two: function(callback){
- setTimeout(function(){
- callback(null, 2);
}, 100);
},
}, function(err, results) {
// results is now equal to: {one: 1, two: 2}});
 ### parallel(tasks, [callback])
Run an array of functions in parallel, without waiting until the previous function has completed. If any of the functions pass an error to its callback, the main callback is immediately called with the value of the error. Once the tasks have completed, the results are passed to the final callback as an array.
It is also possible to use an object instead of an array. Each property will be run as a function and the results will be passed to the final callback as an object instead of an array. This can be a more readable way of handling results from async.parallel.
__Arguments__
- tasks - An array or object containing functions to run, each function is passed a callback it must call on completion.
- callback(err, results) - An optional callback to run once all the functions have completed. This function gets an array of all the arguments passed to the callbacks used in the array.
__Example__
- async.parallel([
- function(callback){
- setTimeout(function(){
- callback(null, ‘one’);
}, 200);
}, function(callback){
- setTimeout(function(){
- callback(null, ‘two’);
}, 100);
},
], // optional callback function(err, results){
// in this case, the results array will equal [‘two’,’one’] // because the functions were run in parallel and the second // function had a shorter timeout before calling the callback.});
// an example using an object instead of an array async.parallel({
- one: function(callback){
- setTimeout(function(){
- callback(null, 1);
}, 200);
}, two: function(callback){
- setTimeout(function(){
- callback(null, 2);
}, 100);
},
}, function(err, results) {
// results is now equals to: {one: 1, two: 2}});
 ### whilst(test, fn, callback)
Repeatedly call fn, while test returns true. Calls the callback when stopped, or an error occurs.
__Arguments__
- test() - synchronous truth test to perform before each execution of fn.
- fn(callback) - A function to call each time the test passes. The function is passed a callback which must be called once it has completed with an optional error as the first argument.
- callback(err) - A callback which is called after the test fails and repeated execution of fn has stopped.
__Example__
var count = 0;
- async.whilst(
function () { return count < 5; }, function (callback) {
count++; setTimeout(callback, 1000);}, function (err) {
// 5 seconds have passed}
});
 ### until(test, fn, callback)
Repeatedly call fn, until test returns true. Calls the callback when stopped, or an error occurs.
The inverse of async.whilst.
 ### waterfall(tasks, [callback])
Runs an array of functions in series, each passing their results to the next in the array. However, if any of the functions pass an error to the callback, the next function is not executed and the main callback is immediately called with the error.
__Arguments__
- tasks - An array of functions to run, each function is passed a callback it must call on completion.
- callback(err) - An optional callback to run once all the functions have completed. This function gets passed any error that may have occurred.
__Example__
- async.waterfall([
- function(callback){
- callback(null, ‘one’, ‘two’);
}, function(arg1, arg2, callback){
callback(null, ‘three’);}, function(arg1, callback){
// arg1 now equals ‘three’ callback(null, ‘done’);}
]);
 ### queue(worker, concurrency)
Creates a queue object with the specified concurrency. Tasks added to the queue will be processed in parallel (up to the concurrency limit). If all workers are in progress, the task is queued until one is available. Once a worker has completed a task, the task’s callback is called.
__Arguments__
- worker(task, callback) - An asynchronous function for processing a queued task.
- concurrency - An integer for determining how many worker functions should be run in parallel.
__Queue objects__
The queue object returned by this function has the following properties and methods:
- length() - a function returning the number of items waiting to be processed.
- concurrency - an integer for determining how many worker functions should be run in parallel. This property can be changed after a queue is created to alter the concurrency on-the-fly.
- push(task, [callback]) - add a new task to the queue, the callback is called once the worker has finished processing the task.
- saturated - a callback that is called when the queue length hits the concurrency and further tasks will be queued
- empty - a callback that is called when the last item from the queue is given to a worker
- drain - a callback that is called when the last item from the queue has returned from the worker
__Example__
// create a queue object with concurrency 2
- var q = async.queue(function (task, callback) {
- console.log(‘hello ‘ + task.name); callback();
}, 2);
// assign a callback q.drain = function() {
console.log(‘all items have been processed’);}
// add some items to the queue
- q.push({name: ‘foo’}, function (err) {
- console.log(‘finished processing foo’);
}); q.push({name: ‘bar’}, function (err) {
console.log(‘finished processing bar’);});
 ### auto(tasks, [callback])
Determines the best order for running functions based on their requirements. Each function can optionally depend on other functions being completed first, and each function is run as soon as its requirements are satisfied. If any of the functions pass an error to their callback, that function will not complete (so any other functions depending on it will not run) and the main callback will be called immediately with the error. Functions also receive an object containing the results of functions on which they depend.
__Arguments__
- tasks - An object literal containing named functions or an array of requirements, with the function itself the last item in the array. The key used for each function or array is used when specifying requirements. The syntax is easier to understand by looking at the example.
- callback(err) - An optional callback which is called when all the tasks have been completed. The callback may receive an error as an argument.
__Example__
- async.auto({
- get_data: function(callback){
- // async code to get some data
}, make_folder: function(callback){
// async code to create a directory to store a file in // this is run at the same time as getting the data}, write_file: [‘get_data’, ‘make_folder’, function(callback){
// once there is some data and the directory exists, // write the data to a file in the directory callback(null, filename);}], email_link: [‘write_file’, function(callback, results){
// once the file is written let’s email a link to it... // results.write_file contains the filename returned by write_file.}]
});
This is a fairly trivial example, but to do this using the basic parallel and series functions would look like this:
- async.parallel([
- function(callback){
- // async code to get some data
}, function(callback){
// async code to create a directory to store a file in // this is run at the same time as getting the data}
], function(results){
- async.series([
- function(callback){
- // once there is some data and the directory exists, // write the data to a file in the directory
}, email_link: [‘write_file’, function(callback){
// once the file is written let’s email a link to it...}
]);
});
For a complicated series of async tasks using the auto function makes adding new tasks much easier and makes the code more readable.
 ### iterator(tasks)
Creates an iterator function which calls the next function in the array, returning a continuation to call the next one after that. Its also possible to ‘peek’ the next iterator by doing iterator.next().
This function is used internally by the async module but can be useful when you want to manually control the flow of functions in series.
__Arguments__
- tasks - An array of functions to run, each function is passed a callback it must call on completion.
__Example__
- var iterator = async.iterator([
- function(){ sys.p(‘one’); }, function(){ sys.p(‘two’); }, function(){ sys.p(‘three’); }
]);
node> var iterator2 = iterator(); ‘one’ node> var iterator3 = iterator2(); ‘two’ node> iterator3(); ‘three’ node> var nextfn = iterator2.next(); node> nextfn(); ‘three’
 ### apply(function, arguments..)
Creates a continuation function with some arguments already applied, a useful shorthand when combined with other control flow functions. Any arguments passed to the returned function are added to the arguments originally passed to apply.
__Arguments__
- function - The function you want to eventually apply all arguments to.
- arguments... - Any number of arguments to automatically apply when the continuation is called.
__Example__
// using apply
- async.parallel([
- async.apply(fs.writeFile, ‘testfile1’, ‘test1’), async.apply(fs.writeFile, ‘testfile2’, ‘test2’),
]);
// the same process without using apply
- async.parallel([
- function(callback){
- fs.writeFile(‘testfile1’, ‘test1’, callback);
}, function(callback){
fs.writeFile(‘testfile2’, ‘test2’, callback);},
]);
It’s possible to pass any number of additional arguments when calling the continuation:
node> var fn = async.apply(sys.puts, ‘one’); node> fn(‘two’, ‘three’); one two three
 ### nextTick(callback)
Calls the callback on a later loop around the event loop. In node.js this just calls process.nextTick, in the browser it falls back to setTimeout(callback, 0), which means other higher priority events may precede the execution of the callback.
This is used internally for browser-compatibility purposes.
__Arguments__
- callback - The function to call on a later loop around the event loop.
__Example__
var call_order = []; async.nextTick(function(){
call_order.push(‘two’); // call_order now equals [‘one’,’two]}); call_order.push(‘one’)
## Utils
 ### memoize(fn, [hasher])
Caches the results of an async function. When creating a hash to store function results against, the callback is omitted from the hash and an optional hash function can be used.
__Arguments__
- fn - the function you to proxy and cache results from.
- hasher - an optional function for generating a custom hash for storing results, it has all the arguments applied to it apart from the callback, and must be synchronous.
__Example__
- var slow_fn = function (name, callback) {
- // do something callback(null, result);
}; var fn = async.memoize(slow_fn);
// fn can now be used as if it were slow_fn fn(‘some name’, function () {
// callback});
 ### unmemoize(fn)
Undoes a memoized function, reverting it to the original, unmemoized form. Comes handy in tests.
__Arguments__
- fn - the memoized function
 ### log(function, arguments)
Logs the result of an async function to the console. Only works in node.js or in browsers that support console.log and console.error (such as FF and Chrome). If multiple arguments are returned from the async function, console.log is called on each argument in order.
__Arguments__
- function - The function you want to eventually apply all arguments to.
- arguments... - Any number of arguments to apply to the function.
__Example__
- var hello = function(name, callback){
- setTimeout(function(){
- callback(null, ‘hello ‘ + name);
}, 1000);
};
node> async.log(hello, ‘world’); ‘hello world’
 ### dir(function, arguments)
Logs the result of an async function to the console using console.dir to display the properties of the resulting object. Only works in node.js or in browsers that support console.dir and console.error (such as FF and Chrome). If multiple arguments are returned from the async function, console.dir is called on each argument in order.
__Arguments__
- function - The function you want to eventually apply all arguments to.
- arguments... - Any number of arguments to apply to the function.
__Example__
- var hello = function(name, callback){
- setTimeout(function(){
- callback(null, {hello: name});
}, 1000);
};
node> async.dir(hello, ‘world’); {hello: ‘world’}
 ### noConflict()
Changes the value of async back to its original value, returning a reference to the async object.


Molde FK latest to join the queue of European clubs interested in CSKA Sofia winger Edwin Gyasi
Molde FK have become the latest club to show an interest in Edwin Gyasi as CSKA Sofia brace themselves for a series of bids for their coveted Ghana winger.
The Norwegian champions have been tabs on the player's situation after returning to Bulgaria following his loan spell at Major Soccer League side Dallas FC.
Reports in Norway claim Molde FK have already made their move for the 28-year-old while Turkish media have added Trabzonspor and Besiktas to the list of potential suitors that also includes Norwich and Wolves.
A bidding war could push Gyasi's market value beyond the £2 million mark.
The Ghana international joined the Major League Soccer side on a season long loan from the Bulgarian side in July this year with an option to make it permanent.
But the Ghanaian has been restricted by lack of playing opportunities, forcing him to cut short his loan contract, GHANAsoccernet.com reports.
The wideman is growing frustrated and has voiced his concerns over lack of playing time.
The Netherlands-born winger has returned to the Bulgarian first-division team CSKA Sofia to sort out his long-term future.
Gyasi will be keen to get back on the pitch to aid his return to the Black Stars.
He has been capped fives time by the four-time African champions.


Aside from Tropical Storm Ramon, PAGASA spots new LPA
A low pressure area forms outside the Philippine Area of Responsibility, while Tropical Storm Ramon (Kalmaegi) heads for Northern Luzon
by Acor ArceoSubscribe
Email Address
Newsletters
- Glenda Gloria's Take this Tuesday
- Huddle by Miriam Grace Go
- The Newsbreak Agenda by Chay Hofileña
- Sometimes, all you need is video by Lilibeth Frondoso


HorseJockey
to Make a Move
and inform so on the ControlCentre
.ControlCentre.startTheRace()
in order
to relief the Broker
from the state Supervising the Race (STR
), as the race is over.HorseJockey
to Make a Move on the
the RacingTrack
.horse
make a move on the track, accordingly to its abilities to move.horse
.entities
) and the servers (also known as hippodrome regions
).MessageType
).MessageType
)
and a boolean value.MessageType
)
and one integer value.MessageType
)
and two integer values.MessageType
)
and two integer values.MessageType
),
one pair Horse/Jockey identification and one pair Horse/Jockey state value defined as HorseJockeyState
.MessageType
),
one Spectator identification and one Spectator state value defined as SpectatorState
.MessageType
)
and one Broker state value defined as BrokerState
.MessageType
and a Race
.Message
.Spectator
's.


This is a heading
The style of this document is a combination of an external stylesheet, and internal style