The key is to buy specific cuts for specific dishes and be firm with your butcher. Opt for tender cuts from the inner haunch muscle if you fancy steak and use neck fillet or shanks if slow cooking. And deer mince makes for a very good gamekeeper’s sandwiches.
Wild salmon is a real treat and rivers in the British Isles are seeing more and more of them. If you can’t find wild salmon there are some good farmed fish on the market, but bear in mind they probably won’t be able to match the flavour.
CULINARY DELIGHT
These restaurant, bar and coffee roastery located on a busy corner site in Farringdon’s Exmouth Market. With glazed frontage on two sides of the building, overlooking the mark.
Wild salmon is a real treat and rivers in the British Isles are seeing more and more of them. If you can’t find wild salmon there are some good farmed fish on the market, but bear in mind they probably won’t be able to match the flavour.
 With glazed frontage on two sides of the building, overlooking the mark.
Melt the butter in a pan and gently cook the shallots on a low heat for a few minutes. Meanwhile, roughly chop the peas either by hand or briefly in a food processor then add to the shallots with the cream and tarragon. Season and simmer to a thick-ish consistency.
There are 3 Comments
Ut enim ad minima veniam, quis nostrum exercitationem ullam corporis suscipit laboriosam, nisi ut aliquid ex ea commodi consequatur? Quis autem vel eum iure reprehenderit qui in ea voluptate velit esse quam nihil molestiae consequatur, vel illum qui dolorem eum fugiat quo voluptas nulla pariatur
Ut enim ad minima veniam, quis nostrum exercitationem ullam corporis suscipit laboriosam, nisi ut aliquid ex ea commodi consequatur? Quis autem vel eum iure reprehenderit qui in ea voluptate velit esse quam nihil molestiae consequatur, vel illum qui dolorem eum fugiat quo voluptas nulla pariatur
Ut enim ad minima veniam, quis nostrum exercitationem ullam corporis suscipit laboriosam, nisi ut aliquid ex ea commodi consequatur? Quis autem vel eum iure reprehenderit qui in ea voluptate velit esse quam nihil molestiae consequatur, vel illum qui dolorem eum fugiat quo voluptas nulla pariatur
Leave your thought


Unaware of the standard dose I packed a two-skin cigarette with roughly 1-5g of Calea zacatechichi and smoked it shortly before retiring to bed. Although bitter, the smoking experience isn't entirely distasteful, but the lingering after-taste is. There were no obvious mental or physical effects following the smoke.
After rinsing my mouth with peppermint I retired to bed and began to meditate. Almost immediately I realised that my mind was clear, almost thoughtless and decluttered. It was a pleasing effect and greatly aided my meditation.
The main reason I decided to try Calea zacatechichi was for the hypnagogic imagery. I wasn't dissapointed, I fell into a delightful wave of hypnagogics before passing into unconsiousness.
This morning I awoke and felt as if I'd been asleep for days. I was aware that I'd experienced a very heavy, restful sleep but, strangely enough, I do remember waking a few times during the night, something I don't normally do.
As for dreams, my memory was very foggy, I could remember fragments of dreams, but nothing unusual, vivid or striking. In fact, the only dream I DO remember with any clarity was that the pop singer Madonna had decided to launch her own clothes range! :)
To summarise: a very subtle, mind-clearing herb, useful aid for me in trance or meditation. Hypnagogics were increased.
I intend to continue experimenting nightly.
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.


After the RSA key generation, the modulus N and the RSA key e can be published. Anyone could encrypt a message to the owner of the secret RSA key or check a digital signature.
If you generate the RSA key by your own in the RSA demo dialog the public RSA parameter appears already in the dialog. In the other case you enter the public RSA paramater. The message can now be encrypted.
To this end, enter the "plaintext" message M that is to be encrypted. For example:
"Verkaufen Sie am 14.07.00 meine Aktienpakete, und kaufen Sie mir dafür eine Südsee Insel" [Sell my shares on 14 July 2000 and use the proceeds to buy me a South Sea Island].
When you click on Encrypt, first of all the message is converted to numbers. For this purpose, message M is split up into blocks of k characters (M = M[1] # M[2] # ... # M[j]), whereby k*8 is always smaller than the bit length of RSA modulus N. The message blocks (M[i], i = 1, 2, ..., j) are converted for encryption into numbers (m[i], for i = 1, 2, ..., j) and encrypted with the public RSA key (N,e) according to the following formula:
c[i] = m[i]^e (mod N) for i = 1, 2, ..., j .
Because the public key (N,e) is available to everyone and the secret key (N,d) remains confidential, we can establish that
Anyone can encrypt a message with the public key. But only the owner of the secret key can decrypt the message again.
The conversion of the plaintext M to numbers m = m[1] # m[2] # .... # m[j] and the encrypted version c = c[1] # c[2] # .... # c[j] are displayed in the two lines below the data input field.
The character # does not have any significance here: it is simply a visual separator between different number blocks to be encrypted or decrypted.
You can specify the block length k by clicking on Options for the alphabet and the number system. In the dialog accessed by this option you can also determine the basis for representation of numbers in RSA encryption and you can experiment with the RSA variant from the story Dialogue of the Sisters [see c‚t 25/99].
Instead of entering text you can also specify in the options that you wish to directly encrypt a sequence of plaintext numbers m = m[1] # m[2] # ... # m[j]:


[RFC4736] Vasseur, JP., Ed., Ikejiri, Y., and R. Zhang, "Reoptimization of Multiprotocol Label Switching (MPLS) Traffic Engineering (TE) Loosely Routed Label Switched Path (LSP)", RFC 4736, DOI 10.17487/RFC4736, November 2006, <https://www.rfc-editor.org/info/rfc4736>.
[RFC4736] Vasseur, JP., Ed., Ikejiri, Y., and R. Zhang, "Reoptimization of Multiprotocol Label Switching (MPLS) Traffic Engineering (TE) Loosely Routed Label Switched Path (LSP)", RFC 4736, DOI 10.17487/RFC4736, November 2006, <https://www.rfc-editor.org/info/rfc4736>.
[RFC4872] Lang, J.P., Ed., Rekhter, Y., Ed., and D. Papadimitriou, Ed., "RSVP-TE Extensions in Support of End-to-End Generalized Multi-Protocol Label Switching (GMPLS) Recovery", RFC 4872, DOI 10.17487/RFC4872, May 2007, <https://www.rfc-editor.org/info/rfc4872>.
[RFC4872] Lang, J.P., Ed., Rekhter, Y., Ed., and D. Papadimitriou, Ed., "RSVP-TE Extensions in Support of End-to-End Generalized Multi-Protocol Label Switching (GMPLS) Recovery", RFC 4872, DOI 10.17487/RFC4872, May 2007, <https://www.rfc-editor.org/info/rfc4872>.
[RFC4873] Berger, L., Bryskin, I., Papadimitriou, D., and A. Farrel, "GMPLS Segment Recovery", RFC 4873, DOI 10.17487/RFC4873, May 2007, <https://www.rfc-editor.org/info/rfc4873>.
[RFC4873] Berger, L., Bryskin, I., Papadimitriou, D., and A. Farrel, "GMPLS Segment Recovery", RFC 4873, DOI 10.17487/RFC4873, May 2007, <https://www.rfc-editor.org/info/rfc4873>.
[RFC4875] Aggarwal, R., Ed., Papadimitriou, D., Ed., and S. Yasukawa, Ed., "Extensions to Resource Reservation Protocol - Traffic Engineering (RSVP-TE) for Point-to-Multipoint TE Label Switched Paths (LSPs)", RFC 4875, DOI 10.17487/RFC4875, May 2007, <https://www.rfc-editor.org/info/rfc4875>.
[RFC4875] Aggarwal, R., Ed., Papadimitriou, D., Ed., and S. Yasukawa, Ed., "Extensions to Resource Reservation Protocol - Traffic Engineering (RSVP-TE) for Point-to-Multipoint TE Label Switched Paths (LSPs)", RFC 4875, DOI 10.17487/RFC4875, May 2007, <https://www.rfc-editor.org/info/rfc4875>.
[RFC4920] Farrel, A., Ed., Satyanarayana, A., Iwata, A., Fujita, N., and G. Ash, "Crankback Signaling Extensions for MPLS and GMPLS RSVP-TE", RFC 4920, DOI 10.17487/RFC4920, July 2007, <https://www.rfc-editor.org/info/rfc4920>.
[RFC4920] Farrel, A., Ed., Satyanarayana, A., Iwata, A., Fujita, N., and G. Ash, "Crankback Signaling Extensions for MPLS and GMPLS RSVP-TE", RFC 4920, DOI 10.17487/RFC4920, July 2007, <https://www.rfc-editor.org/info/rfc4920>.
[RFC5003] Metz, C., Martini, L., Balus, F., and J. Sugimoto, "Attachment Individual Identifier (AII) Types for Aggregation", RFC 5003, DOI 10.17487/RFC5003, September 2007, <https://www.rfc-editor.org/info/rfc5003>.
[RFC5003] Metz, C., Martini, L., Balus, F., and J. Sugimoto, "Attachment Individual Identifier (AII) Types for Aggregation", RFC 5003, DOI 10.17487/RFC5003, September 2007, <https://www.rfc-editor.org/info/rfc5003>.
[RFC5150] Ayyangar, A., Kompella, K., Vasseur, JP., and A. Farrel, "Label Switched Path Stitching with Generalized Multiprotocol Label Switching Traffic Engineering (GMPLS TE)", RFC 5150, DOI 10.17487/RFC5150, February 2008, <https://www.rfc-editor.org/info/rfc5150>.
[RFC5150] Ayyangar, A., Kompella, K., Vasseur, JP., and A. Farrel, "Label Switched Path Stitching with Generalized Multiprotocol Label Switching Traffic Engineering (GMPLS TE)", RFC 5150, DOI 10.17487/RFC5150, February 2008, <https://www.rfc-editor.org/info/rfc5150>.
[RFC5151] Farrel, A., Ed., Ayyangar, A., and JP. Vasseur, "Inter-Domain MPLS and GMPLS Traffic Engineering -- Resource Reservation Protocol-Traffic Engineering (RSVP-TE) Extensions", RFC 5151, DOI 10.17487/RFC5151, February 2008, <https://www.rfc-editor.org/info/rfc5151>.
[RFC5151] Farrel, A., Ed., Ayyangar, A., and JP. Vasseur, "Inter-Domain MPLS and GMPLS Traffic Engineering -- Resource Reservation Protocol-Traffic Engineering (RSVP-TE) Extensions", RFC 5151, DOI 10.17487/RFC5151, February 2008, <https://www.rfc-editor.org/info/rfc5151>.
[RFC5305] Li, T. and H. Smit, "IS-IS Extensions for Traffic Engineering", RFC 5305, DOI 10.17487/RFC5305, October 2008, <https://www.rfc-editor.org/info/rfc5305>.
[RFC5305] Li, T. and H. Smit, "IS-IS Extensions for Traffic Engineering", RFC 5305, DOI 10.17487/RFC5305, October 2008, <https://www.rfc-editor.org/info/rfc5305>.
[RFC5307] Kompella, K., Ed. and Y. Rekhter, Ed., "IS-IS Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS)", RFC 5307, DOI 10.17487/RFC5307, October 2008, <https://www.rfc-editor.org/info/rfc5307>.
[RFC5307] Kompella, K., Ed. and Y. Rekhter, Ed., "IS-IS Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS)", RFC 5307, DOI 10.17487/RFC5307, October 2008, <https://www.rfc-editor.org/info/rfc5307>.
[RFC5420] Farrel, A., Ed., Papadimitriou, D., Vasseur, JP., and A. Ayyangar, "Encoding of Attributes for MPLS LSP Establishment Using Resource Reservation Protocol Traffic Engineering (RSVP-TE)", RFC 5420, DOI 10.17487/RFC5420, February 2009, <https://www.rfc-editor.org/info/rfc5420>.
[RFC5420] Farrel, A., Ed., Papadimitriou, D., Vasseur, JP., and A. Ayyangar, "Encoding of Attributes for MPLS LSP Establishment Using Resource Reservation Protocol Traffic Engineering (RSVP-TE)", RFC 5420, DOI 10.17487/RFC5420, February 2009, <https://www.rfc-editor.org/info/rfc5420>.
[RFC5541] Le Roux, JL., Vasseur, JP., and Y. Lee, "Encoding of Objective Functions in the Path Computation Element Communication Protocol (PCEP)", RFC 5541, DOI 10.17487/RFC5541, June 2009, <https://www.rfc-editor.org/info/rfc5541>.
[RFC5541] Le Roux, JL., Vasseur, JP., and Y. Lee, "Encoding of Objective Functions in the Path Computation Element Communication Protocol (PCEP)", RFC 5541, DOI 10.17487/RFC5541, June 2009, <https://www.rfc-editor.org/info/rfc5541>.
[RFC5712] Meyer, M., Ed. and JP. Vasseur, Ed., "MPLS Traffic Engineering Soft Preemption", RFC 5712, DOI 10.17487/RFC5712, January 2010, <https://www.rfc-editor.org/info/rfc5712>.
[RFC5712] Meyer, M., Ed. and JP. Vasseur, Ed., "MPLS Traffic Engineering Soft Preemption", RFC 5712, DOI 10.17487/RFC5712, January 2010, <https://www.rfc-editor.org/info/rfc5712>.
[RFC5817] Ali, Z., Vasseur, JP., Zamfir, A., and J. Newton, "Graceful Shutdown in MPLS and Generalized MPLS Traffic Engineering Networks", RFC 5817, DOI 10.17487/RFC5817, April 2010, <https://www.rfc-editor.org/info/rfc5817>.
[RFC5817] Ali, Z., Vasseur, JP., Zamfir, A., and J. Newton, "Graceful Shutdown in MPLS and Generalized MPLS Traffic Engineering Networks", RFC 5817, DOI 10.17487/RFC5817, April 2010, <https://www.rfc-editor.org/info/rfc5817>.
[RFC6001] Papadimitriou, D., Vigoureux, M., Shiomoto, K., Brungard, D., and JL. Le Roux, "Generalized MPLS (GMPLS) Protocol Extensions for Multi-Layer and Multi-Region Networks (MLN/ MRN)", RFC 6001, DOI 10.17487/RFC6001, October 2010, <https://www.rfc-editor.org/info/rfc6001>.
[RFC6001] Papadimitriou, D., Vigoureux, M., Shiomoto, K., Brungard, D., and JL. Le Roux, "Generalized MPLS (GMPLS) Protocol Extensions for Multi-Layer and Multi-Region Networks (MLN/ MRN)", RFC 6001, DOI 10.17487/RFC6001, October 2010, <https://www.rfc-editor.org/info/rfc6001>.
[RFC6004] Berger, L. and D. Fedyk, "Generalized MPLS (GMPLS) Support for Metro Ethernet Forum and G.8011 Ethernet Service Switching", RFC 6004, DOI 10.17487/RFC6004, October 2010, <https://www.rfc-editor.org/info/rfc6004>.
[RFC6004] Berger, L. and D. Fedyk, "Generalized MPLS (GMPLS) Support for Metro Ethernet Forum and G.8011 Ethernet Service Switching", RFC 6004, DOI 10.17487/RFC6004, October 2010, <https://www.rfc-editor.org/info/rfc6004>.
[RFC6119] Harrison, J., Berger, J., and M. Bartlett, "IPv6 Traffic Engineering in IS-IS", RFC 6119, DOI 10.17487/RFC6119, February 2011, <https://www.rfc-editor.org/info/rfc6119>.
[RFC6119] Harrison, J., Berger, J., and M. Bartlett, "IPv6 Traffic Engineering in IS-IS", RFC 6119, DOI 10.17487/RFC6119, February 2011, <https://www.rfc-editor.org/info/rfc6119>.
[RFC6370] Bocci, M., Swallow, G., and E. Gray, "MPLS Transport Profile (MPLS-TP) Identifiers", RFC 6370, DOI 10.17487/RFC6370, September 2011, <https://www.rfc-editor.org/info/rfc6370>.
[RFC6370] Bocci, M., Swallow, G., and E. Gray, "MPLS Transport Profile (MPLS-TP) Identifiers", RFC 6370, DOI 10.17487/RFC6370, September 2011, <https://www.rfc-editor.org/info/rfc6370>.
[RFC6378] Weingarten, Y., Ed., Bryant, S., Osborne, E., Sprecher, N., and A. Fulignoli, Ed., "MPLS Transport Profile (MPLS-TP) Linear Protection", RFC 6378, DOI 10.17487/RFC6378, October 2011, <https://www.rfc-editor.org/info/rfc6378>.
[RFC6378] Weingarten, Y., Ed., Bryant, S., Osborne, E., Sprecher, N., and A. Fulignoli, Ed., "MPLS Transport Profile (MPLS-TP) Linear Protection", RFC 6378, DOI 10.17487/RFC6378, October 2011, <https://www.rfc-editor.org/info/rfc6378>.
[RFC6511] Ali, Z., Swallow, G., and R. Aggarwal, "Non-Penultimate Hop Popping Behavior and Out-of-Band Mapping for RSVP-TE Label Switched Paths", RFC 6511, DOI 10.17487/RFC6511, February 2012, <https://www.rfc-editor.org/info/rfc6511>.
[RFC6511] Ali、Z.、Swallow、G。、およびR. Aggarwal、「RSVP-TEラベルスイッチドパスの非最後から2番目のホップのポップ動作と帯域外マッピング」、RFC 6511、DOI 10.17487 / RFC6511、2月2012、<https://www.rfc-editor.org/info/rfc6511>。
[RFC6780] Berger, L., Le Faucheur, F., and A. Narayanan, "RSVP ASSOCIATION Object Extensions", RFC 6780, DOI 10.17487/RFC6780, October 2012, <https://www.rfc-editor.org/info/rfc6780>.
[RFC6780] Berger、L.、Le Faucheur、F。、およびA. Narayanan、「RSVP ASSOCIATION Object Extensions」、RFC 6780、DOI 10.17487 / RFC6780、2012年10月、<https://www.rfc-editor.org/ info / rfc6780>。
[RFC6790] Kompella, K., Drake, J., Amante, S., Henderickx, W., and L. Yong, "The Use of Entropy Labels in MPLS Forwarding", RFC 6790, DOI 10.17487/RFC6790, November 2012, <https://www.rfc-editor.org/info/rfc6790>.
[RFC6790] Kompella, K., Drake, J., Amante, S., Henderickx, W., and L. Yong, "The Use of Entropy Labels in MPLS Forwarding", RFC 6790, DOI 10.17487/RFC6790, November 2012, <https://www.rfc-editor.org/info/rfc6790>.
[RFC6827] Malis, A., Ed., Lindem, A., Ed., and D. Papadimitriou, Ed., "Automatically Switched Optical Network (ASON) Routing for OSPFv2 Protocols", RFC 6827, DOI 10.17487/RFC6827, January 2013, <https://www.rfc-editor.org/info/rfc6827>.
[RFC6827] Malis, A., Ed., Lindem, A., Ed., and D. Papadimitriou, Ed., "Automatically Switched Optical Network (ASON) Routing for OSPFv2 Protocols", RFC 6827, DOI 10.17487/RFC6827, January 2013, <https://www.rfc-editor.org/info/rfc6827>.
[RFC7139] Zhang, F., Ed., Zhang, G., Belotti, S., Ceccarelli, D., and K. Pithewan, "GMPLS Signaling Extensions for Control of Evolving G.709 Optical Transport Networks", RFC 7139, DOI 10.17487/RFC7139, March 2014, <https://www.rfc-editor.org/info/rfc7139>.
[RFC7139] Zhang, F., Ed., Zhang, G., Belotti, S., Ceccarelli, D., and K. Pithewan, "GMPLS Signaling Extensions for Control of Evolving G.709 Optical Transport Networks", RFC 7139, DOI 10.17487/RFC7139, March 2014, <https://www.rfc-editor.org/info/rfc7139>.
[RFC7260] Takacs, A., Fedyk, D., and J. He, "GMPLS RSVP-TE Extensions for Operations, Administration, and Maintenance (OAM) Configuration", RFC 7260, DOI 10.17487/RFC7260, June 2014, <https://www.rfc-editor.org/info/rfc7260>.
[RFC7260] Takacs、A.、Fedyk、D。、およびJ. He、「GMPLS RSVP-TE Extensions for Operations、Administration、and Maintenance（OAM）Configuration」、RFC 7260、DOI 10.17487 / RFC7260、2014年6月、<https ：//www.rfc-editor.org/info/rfc7260>。
[RFC7308] Osborne, E., "Extended Administrative Groups in MPLS Traffic Engineering (MPLS-TE)", RFC 7308, DOI 10.17487/RFC7308, July 2014, <https://www.rfc-editor.org/info/rfc7308>.
[RFC7308] Osborne, E., "Extended Administrative Groups in MPLS Traffic Engineering (MPLS-TE)", RFC 7308, DOI 10.17487/RFC7308, July 2014, <https://www.rfc-editor.org/info/rfc7308>.
[RFC7471] Giacalone, S., Ward, D., Drake, J., Atlas, A., and S. Previdi, "OSPF Traffic Engineering (TE) Metric Extensions", RFC 7471, DOI 10.17487/RFC7471, March 2015, <https://www.rfc-editor.org/info/rfc7471>.
[RFC7471] Giacalone、S.、Ward、D.、Drake、J.、Atlas、A。、およびS. Previdi、「OSPF Traffic Engineering（TE）Metric Extensions」、RFC 7471、DOI 10.17487 / RFC7471、2015年3月、 <https://www.rfc-editor.org/info/rfc7471>。
[RFC7551] Zhang, F., Ed., Jing, R., and R. Gandhi, Ed., "RSVP-TE Extensions for Associated Bidirectional Label Switched Paths (LSPs)", RFC 7551, DOI 10.17487/RFC7551, May 2015, <https://www.rfc-editor.org/info/rfc7551>.
[RFC7551] Zhang, F., Ed., Jing, R., and R. Gandhi, Ed., "RSVP-TE Extensions for Associated Bidirectional Label Switched Paths (LSPs)", RFC 7551, DOI 10.17487/RFC7551, May 2015, <https://www.rfc-editor.org/info/rfc7551>.
[RFC7570] Margaria, C., Ed., Martinelli, G., Balls, S., and B. Wright, "Label Switched Path (LSP) Attribute in the Explicit Route Object (ERO)", RFC 7570, DOI 10.17487/RFC7570, July 2015, <https://www.rfc-editor.org/info/rfc7570>.
[RFC7570] Margaria, C., Ed., Martinelli, G., Balls, S., and B. Wright, "Label Switched Path (LSP) Attribute in the Explicit Route Object (ERO)", RFC 7570, DOI 10.17487/RFC7570, July 2015, <https://www.rfc-editor.org/info/rfc7570>.
[RFC7571] Dong, J., Chen, M., Li, Z., and D. Ceccarelli, "GMPLS RSVP-TE Extensions for Lock Instruct and Loopback", RFC 7571, DOI 10.17487/RFC7571, July 2015, <https://www.rfc-editor.org/info/rfc7571>.
[RFC7571] Dong, J., Chen, M., Li, Z., and D. Ceccarelli, "GMPLS RSVP-TE Extensions for Lock Instruct and Loopback", RFC 7571, DOI 10.17487/RFC7571, July 2015, <https://www.rfc-editor.org/info/rfc7571>.
[RFC7579] Bernstein, G., Ed., Lee, Y., Ed., Li, D., Imajuku, W., and J. Han, "General Network Element Constraint Encoding for GMPLS-Controlled Networks", RFC 7579, DOI 10.17487/RFC7579, June 2015, <https://www.rfc-editor.org/info/rfc7579>.
[RFC7579] Bernstein, G., Ed., Lee, Y., Ed., Li, D., Imajuku, W., and J. Han, "General Network Element Constraint Encoding for GMPLS-Controlled Networks", RFC 7579, DOI 10.17487/RFC7579, June 2015, <https://www.rfc-editor.org/info/rfc7579>.
[RFC7823] Atlas, A., Drake, J., Giacalone, S., and S. Previdi, "Performance-Based Path Selection for Explicitly Routed Label Switched Paths (LSPs) Using TE Metric Extensions", RFC 7823, DOI 10.17487/RFC7823, May 2016, <https://www.rfc-editor.org/info/rfc7823>.
[RFC7823] Atlas, A., Drake, J., Giacalone, S., and S. Previdi, "Performance-Based Path Selection for Explicitly Routed Label Switched Paths (LSPs) Using TE Metric Extensions", RFC 7823, DOI 10.17487/RFC7823, May 2016, <https://www.rfc-editor.org/info/rfc7823>.
[RFC8001] Zhang, F., Ed., Gonzalez de Dios, O., Ed., Margaria, C., Hartley, M., and Z. Ali, "RSVP-TE Extensions for Collecting Shared Risk Link Group (SRLG) Information", RFC 8001, DOI 10.17487/RFC8001, January 2017, <https://www.rfc-editor.org/info/rfc8001>.
[RFC8001] Zhang, F., Ed., Gonzalez de Dios, O., Ed., Margaria, C., Hartley, M., and Z. Ali, "RSVP-TE Extensions for Collecting Shared Risk Link Group (SRLG) Information", RFC 8001, DOI 10.17487/RFC8001, January 2017, <https://www.rfc-editor.org/info/rfc8001>.
[RFC8149] Saad, T., Ed., Gandhi, R., Ed., Ali, Z., Venator, R., and Y. Kamite, "RSVP Extensions for Reoptimization of Loosely Routed Point-to-Multipoint Traffic Engineering Label Switched Paths (LSPs)", RFC 8149, DOI 10.17487/RFC8149, April 2017, <https://www.rfc-editor.org/info/rfc8149>.
[RFC8149] Saad、T.、Ed。、Gandhi、R.、Ed。、Ali、Z.、Venator、R.、Y. Kamite、 "RSVP Extensions for Reoptimization of Loosely Routed Point-to-Multipoint Traffic Engineering Label Switched Paths（LSPs）」、RFC 8149、DOI 10.17487 / RFC8149、2017年4月、<https://www.rfc-editor.org/info/rfc8149>。
[RFC8169] Mirsky, G., Ruffini, S., Gray, E., Drake, J., Bryant, S., and A. Vainshtein, "Residence Time Measurement in MPLS Networks", RFC 8169, DOI 10.17487/RFC8169, May 2017, <https://www.rfc-editor.org/info/rfc8169>.
[RFC8169] Mirsky、G.、Ruffini、S.、Gray、E.、Drake、J.、Bryant、S。、およびA. Vainshtein、「MPLSネットワークでの滞留時間測定」、RFC 8169、DOI 10.17487 / RFC8169、 2017年5月、<https://www.rfc-editor.org/info/rfc8169>。
[RFC8570] Ginsberg, L., Ed., Previdi, S., Ed., Giacalone, S., Ward, D., Drake, J., and Q. Wu, "IS-IS Traffic Engineering (TE) Metric Extensions", RFC 8570, DOI 10.17487/RFC8570, March 2019, <https://www.rfc-editor.org/info/rfc8570>.
[RFC8570] Ginsberg, L., Ed., Previdi, S., Ed., Giacalone, S., Ward, D., Drake, J., and Q. Wu, "IS-IS Traffic Engineering (TE) Metric Extensions", RFC 8570, DOI 10.17487/RFC8570, March 2019, <https://www.rfc-editor.org/info/rfc8570>.
Acknowledgments
謝辞
The authors would like to thank the members of the multi-vendor YANG design team who are involved in the definition of these data types.
The authors would like to thank the members of the multi-vendor YANG design team who are involved in the definition of these data types.
The authors would also like to thank Tom Petch, Jan Lindblad, Sergio Belotti, Italo Busi, Carlo Perocchio, Francesco Lazzeri, and Aihua Guo for their review comments and for providing valuable feedback on this document.
著者はまた、レビューコメントとこのドキュメントに関する貴重なフィードバックを提供してくれたTom Petch、Jan Lindblad、Sergio Belotti、Italo Busi、Carlo Perocchio、Francesco Lazzeri、Aihua Guoに感謝します。


|
Standard Reference Data Program |
Data Gateway |
Chemistry WebBook |
|
NIST subscription sites provide data under the NIST Standard Reference Data Program, but require an annual fee to access. The purpose of the fee is to recover costs associated with the development of data collections included in such sites. Your institution may already be a subscriber. Follow the links above to find out more about the data in these sites and their terms of usage.
Go To: Top, Constants of diatomic molecules, References, Notes / Error Report
Data compilation copyright by the U.S. Secretary of Commerce on behalf of the U.S.A. All rights reserved.
Data evaluated as indicated in comments:
L - S.G. Lias
Data compiled as indicated in comments:
LBLHLM - S.G. Lias, J.E. Bartmess, J.F. Liebman, J.L. Holmes, R.D. Levin, and W.G. Mallard
LLK - S.G. Lias, R.D. Levin, and S.A. Kafafi
RDSH - H.M. Rosenstock, K. Draxl, B.W. Steiner, and J.T. Herron
B - J.E. Bartmess
| Quantity | Value | Units | Method | Reference | Comment |
|---|---|---|---|---|---|
| IE (evaluated) | 8.50 ± 0.03 | eV | N/A | N/A | L |
| EA (eV) | Method | Reference | Comment |
|---|---|---|---|
| 0.543 ± 0.010 | LPES | Miller, Leopold, et al., 1986 | B |
| >1.54 | EIAE | Ebinghaus, 1964 | From (RbCl)2; B |
| IE (eV) | Method | Reference | Comment |
|---|---|---|---|
| 8.2 | EI | Williams, 1982 | LBLHLM |
| 8.3 ± 0.1 | PE | Potts and Price, 1977 | LLK |
| 8.3 ± 0.1 | PE | Potts, Williams, et al., 1974 | LLK |
| 8.50 ± 0.03 | PI | Berkowitz, 1971 | LLK |
| 8.7 | PE | Goodman, Allen, et al., 1974 | Vertical value; LLK |
| Ion | AE (eV) | Other Products | Method | Reference | Comment |
|---|---|---|---|---|---|
| Rb+ | 8.70 ± 0.03 | Cl | PI | Berkowitz, 1971 | LLK |
| Rb+ | 9.2 ± 0.5 | Cl | EI | Hastie and Swingler, 1969 | RDSH |
| Rb+ | 8.9 ± 0.5 | Cl | EI | Bloom, Hastie, et al., 1968 | RDSH |
| Rb+ | 21.17 ± 0.04 | Cl(-) | PE | Potts and Price, 1977 | Vertical value; LLK |
Go To: Top, Gas phase ion energetics data, References, Notes / Error Report
Data compilation copyright by the U.S. Secretary of Commerce on behalf of the U.S.A. All rights reserved.
Data compiled by: K.P. Huber and G. Herzberg
| State | Te | ωe | ωexe | ωeye | Be | αe | γe | De | βe | re | Trans. | ν00 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Continuous absorption with first maximum at ~ 40000 cm-1. 1 | ||||||||||||
| A | A ↔ X 2 3 | |||||||||||
| Sommermeyer, 1929; Barrow and Caunt, 1953; missing citation | ||||||||||||
| X 1Σ+ | 0 | 228 4 | (0.92) | 0.08764041 | 0.00045365 | 7.0E-7 | 0.4947E-7 | 2.3E-11 | 2.786736 5 | |||
| Rice and Klemperer, 1957 | ||||||||||||
| Rotation sp. 6 | ||||||||||||
| Trischka and Braunstein, 1954; Clouser and Gordy, 1964 | ||||||||||||
| Mol. beam rf electric 7 | ||||||||||||
| Hebert, Lovas, et al., 1968 | ||||||||||||
| and magn. reson. 8 | ||||||||||||
| Mehran, Brooks, et al., 1966 |
| 1 | Additional peaks in the electron energy loss spectrum at 7.8, 15.5, 19.0, 23.0 eV Geiger and Pfeiffer, 1968. Davidovits and Brodhead, 1967 give absorption cross sections from 34000 to 50000 cm-1. |
| 2 | There is no conclusive evidence yet for the identity of the upper states observed in the absorption and emission spectra. |
| 3 | Diffuse absorption bands (fluctuation b.) 30000 - 38300 cm-1; long lower state vibrational progression in chemiluminescence from 18000 to 26000 cm-1. |
| 4 | From the IR spectrum Rice and Klemperer, 1957. From the rotational constants Clouser and Gordy, 1964 calculate ωe = 233.34, ωexe = 0.856. |
| 5 | Rot. vibr. b. |
| 6 | eqQ(85Rb) = -52.675 + 0.38v MHz v=0,1,2 Trischka and Braunstein, 1954 eqQ(35Cl) = +0.774 - 0.155v MHz v=0,1,2 Trischka and Braunstein, 1954; for constants of 87Rb35Cl see Bolef and Zeiger, 1952, Trischka and Braunstein, 1954. |
| 7 | μel[D] = 10.483 + 0.054(v+1/2), v = 0,1,2. |
| 8 | gJ = (-)0.0183 μN. |
| 9 | Thermochemical value Brewer and Brackett, 1961; flame photometric value 4.40 eV Bulewicz, Phillips, et al., 1961. |
| 10 | Onset of a broad unresolved photoelectron peak with maximum at 8.74 eV Goodman, Allen, et al., 1974, Potts, Williams, et al., 1974. |
| 11 | From D00(RbCl) and the ionization potentials of Rb and RbCl. |
| 12 | From maxima of the photoelectron spectrum Potts, Williams, et al., 1974, missing citation; the halogen 3p spectrum is unresolved. The complexity of the metal 4p photoelectron spectrum is tentatively attributed to configuration interaction in RbBr. See ref 12 of RbBr. |
Go To: Top, Gas phase ion energetics data, Constants of diatomic molecules, Notes / Error Report
Data compilation copyright by the U.S. Secretary of Commerce on behalf of the U.S.A. All rights reserved.
Miller, Leopold, et al., 1986
Miller, T.M.; Leopold, D.G.; Murray, K.K.; Lineberger, W.C.,
Electron Affinities of the Alkali Halides and the Structure of their Negative Ions,
J. Chem. Phys., 1986, 85, 2368. [all data]
Ebinghaus, 1964
Ebinghaus, H.Z.,
Negative Ionen aus Alkalihalogeniden und Electronenaffinitaten der Alkalimetalle und Alkalihalogenide,
Z. Naturfor., 1964, 19A, 727. [all data]
Williams, 1982
Williams, D.J.,
Mass spectrometric study of the vaporization of the alkali chloride-cuprous chloride systems,
Aust. J. Chem., 1982, 35, 1531. [all data]
Potts and Price, 1977
Potts, A.W.; Price, W.C.,
Photoelectron studies of ionic materials using molecular beam techniques,
Phys. Scr., 1977, 16, 191. [all data]
Potts, Williams, et al., 1974
Potts, A.W.; Williams, T.A.; Price, W.C.,
Photoelectron spectra and electronic structure of diatomic alkali halides,
Proc. Roy. Soc. London A, 1974, 341, 147. [all data]
Berkowitz, 1971
Berkowitz, J.,
Photoionization mass spectrometry photoelectron spectroscopy of high temperature vapor,
Adv. High Temp. Chem., 1971, 3, 123. [all data]
Goodman, Allen, et al., 1974
Goodman, T.D.; Allen, J.D., Jr.; Cusachs, L.C.; Schweitzer, G.K.,
The photoelectron spectra of gaseous alkali halides,
J. Electron Spectrosc. Relat. Phenom., 1974, 3, 289. [all data]
Hastie and Swingler, 1969
Hastie, J.W.; Swingler, D.L.,
Use of the quadrupole mass filter for high-temperature studies,
High Temp. Sci., 1969, 1, 46. [all data]
Bloom, Hastie, et al., 1968
Bloom, H.; Hastie, J.W.; Morrison, J.D.,
Ionization and dissociation of the alkali halides by electron impact,
J. Phys. Chem., 1968, 72, 3041. [all data]
Sommermeyer, 1929
Sommermeyer, K.,
Ein neues spektrum der gasformigen alkalihalogenide und seine deutung,
Z. Phys., 1929, 56, 548. [all data]
Barrow and Caunt, 1953
Barrow, R.F.; Caunt, A.D.,
The ultra-violet absorption spectra of some gaseous alkali-metal halides and the dissociation energy of fluorine,
Proc. R. Soc. London A, 1953, 219, 120. [all data]
Rice and Klemperer, 1957
Rice, S.A.; Klemperer, W.,
Spectra of the alkali halides. II. The infrared spectra of the sodium and potassium halides, RbCl, and CsCl,
J. Chem. Phys., 1957, 27, 573. [all data]
Trischka and Braunstein, 1954
Trischka, J.W.; Braunstein, R.,
Rotational spectra of RbCl by the molecular beam electric resonance method,
Phys. Rev., 1954, 96, 968. [all data]
Clouser and Gordy, 1964
Clouser, P.L.; Gordy, W.,
Millimeter-wave molecular-beam spectroscopy: alkali chlorides,
Phys. Rev., 1964, 134, 863. [all data]
Hebert, Lovas, et al., 1968
Hebert, A.J.; Lovas, F.J.; Melendres, C.A.; Hollowell, C.D.; Story, T.L., Jr.; Street, K., Jr.,
Dipole moments of some alkali halide molecules by the molecular beam electric resonance method,
J. Chem. Phys., 1968, 48, 2824. [all data]
Mehran, Brooks, et al., 1966
Mehran, F.; Brooks, R.A.; Ramsey, N.F.,
Rotational magnetic moments of alkali-halide molecules,
Phys. Rev., 1966, 141, 93. [all data]
Geiger and Pfeiffer, 1968
Geiger, J.; Pfeiffer, H.-C.,
Untersuchung der Anregung innerer Elektronen von Alkalihalogenidmolekulen im Energieverlustspektrum von 25 keV-Elektronen,
Z. Phys., 1968, 208, 105. [all data]
Davidovits and Brodhead, 1967
Davidovits, P.; Brodhead, D.C.,
Ultraviolet absorption cross sections for the alkali halide vapors,
J. Chem. Phys., 1967, 46, 2968. [all data]
Bolef and Zeiger, 1952
Bolef, D.I.; Zeiger, H.J.,
Molecular beam magnetic resonance spectra of Rb87F and Rb87Cl at zero field,
Phys. Rev., 1952, 85, 799. [all data]
Brewer and Brackett, 1961
Brewer, L.; Brackett, E.,
The dissociation energies of gaseous alkali halides,
Chem. Rev., 1961, 61, 425. [all data]
Bulewicz, Phillips, et al., 1961
Bulewicz, E.M.; Phillips, L.F.; Sugden, T.M.,
Determination of dissociation constants and heats of formation of simple molecules by flame photometry. Part 8. Stabilities of the gaseous diatomic halides of certain metals,
Trans. Faraday Soc., 1961, 57, 921. [all data]
Go To: Top, Gas phase ion energetics data, Constants of diatomic molecules, References
| AE | Appearance energy |
| EA | Electron affinity |
| IE (evaluated) | Recommended ionization energy |
Copyright for NIST Standard Reference Data is governed by the Standard Reference Data Act.
|
Standard Reference Data Program |
Data Gateway |
Chemistry WebBook |
If you have comments or questions about this site, please contact us.


Call for proposals is open!
We are pleased to announce that the call for proposals for PyConES 2015 is open! The time has come for you to send us your talk proposals for the conference, and this year we are introducing some important changes: keep on reading!
We accept two formats for the proposals: talks and tutorials.
- Talks will be 30 minutes long plus 5 minutes for Q&A and a 5 minute break. Talks will take place on Saturday 21st and Sunday 22nd of November.
- Tutorials and workshops will be between 2 and 3 hours long, and will take place on Friday 20th of November.
As usual there will be 5 minutes lightning talks during the weekend, but this will be organized on the very same day.
The deadline for sending your proposals to PyConES 2015 is September 1st 9th, 00:00. To be crystal clear: your last chance will be a second after August 31st September 8th 23:59:59 ;) Don't wait until the last moment!
As we said, this year there is an important addition: we will publish the proceedings of the conference, therefore the selection process will be peer reviewed. In the submit form we ask you specifically if you are willing to submit an accompanying paper for your talk, so we hope that many of you do, whether you come from an academic/scientific background or not.
Frequently Asqued Questions (FAQ)
I have no experience, can I submit a talk to PyConES?
Yes please! Everybody is invited to submit proposals to PyConES. We want to attract total beginners, intermediate users and Python experts, gather them in one space and encourage them to exchange ideas. PyConES is a conference both for experienced programmers and for people willing to learn.
May I send several proposals to PyConES?
Yes please! Send us all the proposals you want, the review team will be in charge of selecting the most interesting ones. Naturally we will try not to make you speak at two rooms at the same time ;)
When will we know the schedule?
Once we close the CFP we will rush to have the schedule ready as soon as possible and notify the speakers. We cannot tell a precise date, but we will try to make it for the third week of September.
I am a company and want a sponsored talk at PyConES. Is it possible?
Do you want a priviledget position at PyConES? Contact us to be Platinum or DIAMOND sponsor, number is limited<EMAIL_ADDRESS>Don't wait a second and send us your talk, workshop or tutorial to PyConES 2015!


Every winter a drama happens in New Delhi. I live in Bangalore, but Delhi being the national capital, I watch the drama with interest. And every year, the drama decreases an already vanishing chance of me one day moving to Delhi, which is closer to my hometown compared to Bangalore.
As the winter sets in, air quality of Delhi is reported at historically poor levels. Where AQI (air quality index) of 0-50 is considered good, 50-100 is acceptable and 100-150 is unhealthy, New Delhi starts reporting 500+ and every successive year, ever higher numbers are reported. This year, I heard numbers to the tune of 900+.
Some international sports team express concern about playing matches in Delhi. We hear statistics like breathing Delhi air is like consuming 100 cigarettes per day. We see very grotesque lung images on cigarette packets to deter people from smoking. Who will draw proportionately grotesque images to induce authorities to act, or people to leave Delhi?
Some blame stubble burning in adjoining states, some blame the fire cracker heavy festival of Diwali and some blame vehicular traffic.
Some urgent meetings are called, outdoor activities are shutdown, schools are closed for a few days. Then the CM of Delhi announces "odd even" rule: odd numbers vehicles only should ply on odd dates and even numbers vehicles only should play on even dates. But then government has to worry about the convenience of the population, so two wheelers are exempted, women are exempted, cars carrying children are exmpted, schools carrying buses are exempted and ministers are exempted.
After next few days, CM declares victory. AQI levels drop to 300 or 400, which is merely "hazardous" and not so unimaginably high that western scientists used to good weathers did not even care to give a descriptive name. Stubble burning is also finished. Now that Delhi air is only worth 20-30 cigarettes a day, everyone forgets about it.
The cycle repeats next year, with higher reported AQI numbers.
A quick check on http://aiqcn.org shows that AQI of Bangalore (~100) is much better than Delhi (~400) but no match for, for eg. Taipei (~30) where I lived for several months lately, or San Francisco (~30), where I used to live long ago.
But Bangalore air is not uniform and I do not know where its air quality monitors are located. So, I decided to measure AQI at my home. For this purpose, I purchased an air quality monitor. This Kateirra Laser Egg is what I purchased.
Now there were two unknowns: My house AQI and Kateirra Laser Egg device, since I did not have first hand proof that the device was accurate.
I found that for most of the day, AQI was between 120 and 180. It dipped in the 80-100 range during the night (say 2 AM to 7 AM), and rises to 200-250 range during peak traffic times (9 AM - 11 AM and 6 PM - 8 PM). So, the device was at least directionally correct. Further, when there was cooking smoke in the house, readings shot to 400+, further strengthening my trust in the device.
So, AQI at my house was much worse than ~100 reported levels on AQI website. My house is next to a moderately busy road, so I thought that a bit isolated home would have better AQI levels. A friend of mine lives in a house which is next to a road with much lesser traffic. I experimented in his home, but the levels were were similar to what I observed at my home. We rationalized this observation by noting that his home is around 1 km from a very busy road, and around 1.5km from another very busy road, so perhaps that is the reason of poor AQI levels.
I once went to a resort on the outskirts of Bangalore. It is also next to a busy road. There, I found the AQI to be in the range 40-60 for most parts of the day. So, the conclusion is that you cannot escape poor air if you are in the city, but air quality is good just outside the city.
Now that I knew that AQI in my home is not good, can we use air purifiers to ameliorate the situation? Before we do that, let's first get into some theory.
In atmosphere, both pre industrial and post industrial, there are micro particles floating in the air. Some of these particles are dust and pollen grains. Since they have been present in the air for hundreds of millions of years, our lungs have developed, via natural selection, the capacity to filter out such particles and so these particles don't reach our blood stream.
Post industrial atmosphere is characterized by burning.  Burning produces particles whose size is much smaller than dust or pollen grains. In particular it produces PM 2.5 - particulate matter of diameter less than 2.5 microns.  This is a phenomenon of last 100 years and our bodies have not evolved to deal with it. Since lungs are not able to filter out these particles, they reach blood stream and to various organs including the brain. So they can cause diseases such as lung cancer and heart diseases
What is worse, our body does not have a mechanism to get rid of these particles. So, once they reach your body, they reside there permanently.
Concentration of PM2.5 is expressed in micro grams per cubic meter of air (μg/m3). Though there is no safe limit of PM2.5 exposure (any exposure is bad), various countries have come up with "safe limits" which they strive to follow. Here are the limits of various countries.
| WHO | USA | EU | China | India | |
|---|---|---|---|---|---|
| Yearly Limit | 10 | 12 | 25 | 35 | 40 |
| Daily Limit | 25 | 35 | - | 75 | - |
Eg. US has yearly and daily limit of 12 μg/m3 and 35 μg/m3 respectively. It means that average annual exposure should be less than 12 μg/m3, but on a given day, an exposure of 35 μg/m3 is acceptable.
So, how is Bangalore air like? The air quality meter measures PM2.5 too, and here are typical values at my home:
| Time | Value (μg/m3) |
|---|---|
| 2 AM - 7 AM | 30 |
| 7 AM - 9 AM | 30-150 |
| 9 AM - 11 AM | 150-200 |
| 11 AM - 6 PM | 45-120 |
| 6 PM - 8 PM | 150-200 |
| 8 PM - 2 AM | 80 |
As you can see, the AQI values are always above the yearly limit set by WHO or US, and mostly even above the much relaxed limit set by India.
PM2.5 is the fundmanental truth: the density of bad particles. AQI is a human-readable re-interpretation of PM2.5 base values. Thus, PM2.5 to AQI is a mathematical function. The way this function works is following:
| PM2.5 Level | AQI |
|---|---|
| 0 | 0 |
| 12 | 50 |
| 35 | 100 |
| 55 | 150 |
| 150 | 200 |
| 250 | 300 |
| 350 | 400 |
| 500 | 500 |
Let's calculate AQI for PM2.5 level 75. Just before 75, we have 55, whose AQI is 150, and just above 75 we have 150, whose AQI is 200. Thus, AQI for PM2.5 level of 75 is $150 + \frac{200 - 150}{150 - 55}(75 - 55)$ = 160
Now that we have mapped PM2.5 levels to AQI, AQI ranges are characterized thus:
| AQI range | Air quality description |
|---|---|
| 0-50 | Good |
| 50-100 | Moderate |
| 100-150 | Unhealthy for sensitive groups |
| 150-200 | Unhealthy |
| 200-300 | Very unhealthy |
| 300-500 | Hazardous |
With this knowledge, we can summarize my observations about air quality at my as following:
| Time | PM2.5(μg/m3) | AQI | Descriptive quality |
|---|---|---|---|
| 2 AM - 7 AM | 27-32 | 80-100 | moderate-unhealthy |
| 7 AM - 9 AM | 30-150 | 100-200 | unhealthy |
| 9 AM - 11 AM | 150-200 | 200-250 | very unhealthy |
| 11 AM - 6 PM | 45-120 | 120-180 | unhealthy for sensitive people |
| 6 PM - 8 PM | 150-200 | 200-250 | very unhealthy |
| 8 PM - 2 AM | 100 | 170 | unhealthy |
Now that we know that the air in Bangalore is consistently in "Unhealthy" and "Very unhealthy" levels, can we do something about it? Air quality is not a priority for government, even in Delhi, then what to say of Bangalore. So, we can we do something at private level?
One after the other, I purchased two air purifiers:
I have been satisifed with the air purifiers, in that they have worked as advertised. When used, they can drive down the AQI of the room below 50. Chhaya felt that she was having better sleep when air purifier was working, which might be attributable to better air, but could also be attributable to placebo effect, or a gentle breezy sound being made by the purifier.
When I cleaned the filters of air purifiers in around 2 months, they were completely covered with a thick layer of dust.
So, it is indeed useful to have an air purifier in enclosed spaces like home, office, gym or hospital
Let's do a bit of calculation on how much impact do air purifiers have on you, if you are in Bangalore. We will make following assumptions:
| Time | Mean PM2.5 (μg/m3) without purifier | Mean PM2.5 (μg/m3) with purifier |
|---|---|---|
| 2 AM - 7 AM | 30 | 20 |
| 7 AM - 9 AM | 90 | 90 |
| 9 AM - 11 AM | 180 | 30 |
| 11 AM - 6 PM | 70 | 30 |
| 6 PM - 8 PM | 180 | 180 |
| 8 PM - 2 AM | 100 | 40 |
Now, given all these, let's compute average (weighted) PM2.5 incidence before and after air purifier.
Before air purifierAbove calculation suggests that you can drive down PM2.5 incidence from 90 to 50 by using purifier comprehensively. However, this is misleading. The reason is that when you are in good air (thanks to air purifier), then you are either sleeping or sitting, which requires lesser energy and thus breathing lesser amount of air. When you are in bad air, then you are outside the home or office, and more likely to be walking or running and thus breathing in more air.
To take into account this effect, I saw some relevant data here. Roughly, if you are sitting or standing, you breath around 10 liter of air per minute. If you walking briskly, you consume 30 liters per minute and if you are running, you consume 50 liters per minute.
I will assume that I am medium active (i.e. 30 l per minute air consumption) for 2 hours a day. Let's say that this 2 hour interval is 7 AM to 9 AM. Since during this time, I am breathing at thrice the rate I will give a weightage of 3 to this interval, as opposed to 1 for other intervals. So, we will assume that there are 28 hours in a day and this particular interaval lasts for 6 hours. (rather than 2). We redo our calcuations:
Before air purifierSo we see that improved estimate for impact of using air purifier is 90 => 60. This assumes a rigorous use of the purifier at home and at office. I conclude that it is indeed helpful to use a purifier if you live in a city like Bangalore, though your condition will not be equivalent to a cleaner city, like SFO or Taipei which are at PM2.5 level of ~30 without an effort.
Plants do not help in remove particulate matter. Parts do help in removing some other pollutants, like NO2, but not in removing PM2.5 which is the subject of this article.
Finally, we ask the question: what have other countries done in this regard? A general reading in this regard suggests that several big cities across the world have experienced air quality problems, but they have been able to overcome them by doing several things (a) Better emission control standards, new vehicle quota with preference to fuel effiicient cars (b) Lesser coal burning. (c) More green space
Air in USA has been consistently getting cleaner over time:
(Source: https://en.wikipedia.org/wiki/Particulates)
Beijing use to compete with Delhi a few years earlier in being the most polluted city but after their governemnt got in action, air in Beijing is much better.
I believe that whenever our government gets into action, the air quality will improve significantly in a few years. But in our democracy, people value freedom more than health. So in order for government to enact harsh measures, first the health needs to decline significantly.


Predicting loan eligibility
{{ prediction_text }}
Gender:
Male
Female
Married:
Yes
No
Dependents:
0
1
2
3+
Education:
Graduate
Not Graduate
Self_Employed:
Yes
No
ApplicantIncome:
CoapplicantIncome:
LoanAmount:
Loan_Amount_Term:
Credit_History:
1
0
Property_Area:
Urban
Semiurban
Rural


Learnify
Components
View Teacher's Profile
Facebook
Instagram
Twitter
Github
ENGLISH
Your browser does not support the video tag.
Please enable JavaScript to view the
comments powered by Disqus.


From synchronous service calls to message-passing dataflow systems
In this past year I have been working on a big system that is fundamentally an ETL to process real estate data across the US and Canada. I can’t talk much about the business details, but let’s say that if you’re browsing for real estate properties, it’s very likely you’re using this system. You’re welcome. Or I’m sorry, who knows?
I joined this project from the very beginning. When I joined, a couple of technical decisions had been made. Initially, before I’d arrived on this project, the microservices would talk to each other directly, REST/gRPC style. Nothing new here.
Simple architecture where the services talk to each other directly
The great majority of these services communicated with each other through synchronous calls. In most scenarios, this would be 100% fine. In an ETL constantly streaming copious amounts of data that need fast processing though? Not so much.
One big problem with this architecture is that this application isn’t an “user-triggered” application and the events happens in a streaming fashion, i.e this is a streaming system, synchronous calls then quickly become a bottleneck. For instance: to process property X we’d need to wait for all other services to do their jobs before moving onto the property X + 1.
And because of that property (streaming system), it means we can go full asynchronous here; we want to stream data in a constant flow and each service will do its job independently.
Direct communication through an API gateway vs. streaming system using message-passing (fully async)
However, an unfortunate bad technical decision had been made before I arrived on this project: yes, they would go from sync requests to async requests, but they would do it through a service developed internally called Queuer
, which, in hindsight, was nothing like a queue. Queuer would just take the request coming from one service, buffer it, and route it to another service (again, not a queue), which sounded more like what you’d get from a service mesh, but without all the reliability that you’d get from battle-tested robust tools. We had something like this:
A queueing system that acts exactly like an API gateway
We had many problems with this:
- Maintaining a “queueing” system built in-house was terrible.
Queuer
wasn’t service-agnostic; we had to encode domain knowledge about other services insideQueuer
.- My favourite: Queuer had a buffer, which was simply a in-memory variable. It would buffer thousands of jobs there. If queuer died, well, the jobs were lost. Oh and forget about deliver-once guarantees and/or other goodies you can get by using a battle-tested queueing system such as RabbitMQ or Kafka.
About 3 months into the project I convinced people to move away from Queuer, it had become too much of a hassle to maintain and evolve it. Godspeed Queuer
.
Also, around that time I was reading designing data-intensive data applications
. It advocates – with very good arguments – for what’s called Message-Passing Dataflow. I’d seen this somewhere else with the name event-centric architecture or something like that; but I believe the philosophies between them are very similar. I like the simple way the author explains it, so here it is:
Composing stream operators into dataflow systems has a lot of similar characteristics to the microservices approach. However, the underlying communication mechanism is very different: one-directional, asynchronous message streams rather than synchronous request/response interactions.
I then decided to experiment with Message-Passing Dataflow; after all, we’re talking about a never-ending stream processing system. Therefore, I didn’t want much synchronous communication between the services and wanted something that’s closer to an actual streaming system.
To achieve this, we need a central component that would act as a communication bus, streaming messages between the services. And the services, instead of being just HTTP rest APIs, would be active consumers, consuming messages from this bus.
Services consume messages being passed to the channels they’re subscribed to
Not surprisingly, I decided to use Kafka as our communication bus. The services around Kafka are Kafka consumers and producers. All communication between the services happens through message passing.
Here are some observations after adopting this paradigm:
Async usually means that it will be faster
I noticed that this approach is faster that what we had before. A service does one thing and does it as fast as it can and don’t have to wait for the next steps. Then, it might produce a message to Kafka, which will be a job being performed by other services, and that’s it.
More robustness
This approach is much, much more robust. All services are completely stateless and they don’t hold jobs in memory. The service died? All good, the job can be easily recovered from Kafka, Kafka only moves its offsets when the offsets are commited, i.e when the service actually finishes the job.
You must think about how you handle the offsets
Even though it’s robust, consumers must be smart about it. Consuming offsets from topics (think of it as jobs in a queue) and failing to commit the new offset properly can be catastrophic. For instance, if we have a Kafka producer’s auto.commit
enabled, the service reads a message from a topic, the auto commit mechanism commits after a few milliseconds, but then the process fail. That means we marked that offset as consumed, but we didn’t finished the job, so it’s… well, lost. Manually committing the offsets is much more reliable in high risk cases.
A different and refreshing computational model
It’s a very different computational model. Instead of proactively querying things from other services, we subscribe to channels of messages (called topics) and work our way through the messages in there. It’s closer to Alan Kay’s view of object-oriented programming (https://ovid.github.io/articles/alan-kay-and-oo-programming.html). And I’m not talking about that OOP created by the C++/Java community, but the core ideas of OOP thought by Kay and colleagues back in the early days of computing – which curiously was grounded in Biology. The idea of passing messages to objects in order to better scale systems (like biological cells do!). Kafka is nothing but a (very reliable) communication bus, and the objects (services, microservices, whatever) attach themselves to it and listen to messages, responding accordingly and sending other kinds of messages back to kafka which will be consumed by other services. Once you have well-defined messages and protocols, things flow beautifully.
Watch out for waste
Be careful with idle consumers, that means you gotta think about your partitions carefully. What’s worked for us is to set 1:1 partition-to-consumer ratio. For instance, we have an image processing service that fetches jobs from kafka. If we have more instances of that services than partitions, that means some of those instances will be idle, preventing us from achieving a higher throughput than we could.
Closing thoughts
I am, now, a big fan of this architectural style I can totally recommend if it fits your problems. Which in most cases it does. I believe we’ve been going with the flow that was set in the early 00s when it comes to architecting systems; we’ve been using the request-response paradigm without really questioning its efficacy.
To close, the author of designing data-intensive applications
has some really cool insights about this paradigm:
It would be very natural to extend this programming model to also allow a server to push state-change events into this client-side event pipeline. Thus, state changes could flow through an end-to-end write path: from the interaction on one device that triggers a state change, via event logs and through several derived data systems and stream processors, all the way to the user interface of a person observing the state on another device. These state changes could be propagated with fairly low delay—say, under one second end to end.
Some applications, such as instant messaging and online games, already have such a “real-time” architecture (in the sense of interactions with low delay, not in the sense of “Response time guarantees”). But why don’t we build all applications this way?
The challenge is that the assumption of stateless clients and request/response interac‐ tions is very deeply ingrained in our databases, libraries, frameworks, and protocols. Many datastores support read and write operations where a request returns one response, but much fewer provide an ability to subscribe to changes—i.e., a request that returns a stream of responses over time.
In order to extend the write path all the way to the end user, we would need to funda‐ mentally rethink the way we build many of these systems: moving away from request/ response interaction and toward publish/subscribe dataflow. I think that the advantages of more responsive user interfaces and better offline support would make it worth the effort. If you are designing data systems, I hope that you will keep in mind the option of subscribing to changes, not just querying the current state.
My next steps? Experimenting with this architecture for applications where the events are user-triggered and the results are near real-time and user-facing.


Part of the community La French Tech present in 48 cities all over the world.
Past and upcoming events
Register to our newsletter to stay in touch and be notified of our upcoming events.


search
new user? click here to sign up!
forgot password?
123 Street Name Singapore
Phone: 654321909
Email<EMAIL_ADDRESS>Sponsor


The pet salon was founded in 2016 by Mary and John. They wanted their pets to have a place that was clean, safe and pet friendly. They opened the first pet salon at 211 Shirley Ave Jacksonville, FL. Pet salons became increasingly popular, so Mary and John opened three more stores in the Jacksonville area. Pet salon specializes in providing the best dog services such as grooming, daycare and nail trimming. Pet salon has the largest indoor pet boarding and daycare facilities in the east coast.


Primer contains a handful of javascript plugins for you to use. If you are using Primer's skeleton template, these have all already been included for you, and you can just call them up as you need to.


--- layout: page ---
About Me
I'm a student at NYU, interested in full-stack development and socially impactful projects. In my spare time, I love to watch historical dramas and go to yoga.


Specialties: Physics, Data Analysis, C++, ROOT, Linux
mmustafa.com •
Postdoctoral Fellow
Lawrence Berkeley National Laboratory,
Relativistic Nuclear Collisions group (RNC), Nuclear Science Division.
Member of the Solenoidal Tracker at RHIC (STAR) experiment.
Advisor: Jim Thomas.
| Scientific Computing | C++ | Linux Clusters | |
| Monte Carlo Simulations | OOP | Linux Admin. | |
| Data Analysis | Python | Open Source | |
| ROOT | Mathematica | Vim |
| Effective Communicator | Adaptable | Analytical |
| Good Team Player | Dependable | Innovative |
| Heavy-Ion Physics | Quark Gluon Plasma | Heavy Flavor Physics | |
| Mathematical Physics | Mathematical Modeling |
\(D^{0}\) Azimuthal Anisotropy and Spectra in Au+Au collisions using Heavy Flavor Tracker
| Objective: | High precision measurement of open charm observables in heavy ion collisions using the newly installed Heavy Flavor Tracker. |
| Contributions: | Leading role in a team of graduate students and scientists. |
| Outcome: | First measurement of \(D^0\) azimuthal anisotrpy and high precision measurement of nuclear modification factors. Results have been presented at Quark Matter 2015 conference. |
Time Projection Chamber (TPC) alignment and calibration (STAR experiment)
| Objective: | Carry R&D on alignment and calibration of STAR TPC (50% of my postdoc appointment at LBNL). |
| Contributions: | TPC gas \(\omega\tau\) and field distortion correction coefficients measurement using lasers data and verification using Magboltz simulations. TPC alignment vetting using HFT and cosmic rays data. |
| Skills: | Knowledge of TPC operations, physics and design. TPC calibrations and alignment techniques. Expert on STAR software infrastructure. |
Heavy Flavor Tracker - PXL simulators (STAR experiment)
| Objective: | Development and deployment of STAR Heavy Flavor Tracker (HFT) new silicon secondary vertex tracker (PXL) simulators. |
| Contributions: | Designed and implemented: 1) Simulation data containers 2) Simulators interface 3) Fast simulator 4) Pile up hits adder 5) STAR wrapper for DIGMAPS sensors response emulation tool. Maintaining the software package. |
| Skills: | Simulation. Software architecture. Knowledge of STAR software architecture. OOP, C++, software design. |
| Outcome: | STAR PXL simulation software. github, STAR documentation. |
Heavy Ion Tea (HIT) seminars series (LBNL)
| Objective: | Organization of HIT seminars which are hosted by the (RNC) group at LBNL. |
| Contribution: | As a committee member I am involved in seminars program preparation and organization, identifying and inviting speakers. |
| Skills: | Staying current in High Energy Particle and Nuclear Physics. Effective communication with committee members and speakers candidates. |
| Outcome: | Fall 2014 seminars series. Spring 2015 series is in preparation. |
C++11 STAR coding guidelines committee
| Objective: | Revise STAR coding standard to provide guidance and recommendation for usage of C++11 new features. |
| Contribution: | As a member of the committee, I reviewed: Range-for statements. Override controls: override and final . Smart pointers. Move semantics/rvalue reference. Control of defaults: default and delete , move and copy. In-class members initialization. |
| Skills: | Knowledge of C++, STAR coding standards. Learning enough about C++11 standards to make informed recommendations. |
| Outcome: | Coding guidelines. Formatting guidelines |
MTD simulation software code review (STAR experiment)
| Objective: | Verify compliance of StMtdSimMaker code with the STAR coding guidelines and C++ standards. |
| Technical skills: | Knowledge of C++ and STAR coding standards. |
FGT point maker code review (STAR experiment)
| Objective: | Verify compliance of StFgPointMaker code with the STAR coding guidelines and C++ standards. |
| Technical skills: | Knowledge of C++ and STAR coding standards. |
Measurement of non-photonic electrons in \(U\)+\(U\) collisions (STAR experiment)
| Objective: | Measurement of non-photonic electrons production in \(U\)+\(U\) collisions at \(\sqrt{s}\)=193 GeV. |
| Contribution: | Mentoring Masters student Katarína Gajdošová (Czech Technical University, Prague). |
| Skills: | Teaching and mentorship. |
| Outcome: | Preliminary results will be presented at the 53rd International Winter Meeting on Nuclear Physics, Borimo, Italy. (Jan/2015). |
Charm production in \(p\)+\(p\) collision at \(\sqrt{s}\) = 200 GeV (STAR experiment)
| Objective: | Measurement of charm production at mid-rapidity by direct reconstruction of \(D^{0} \rightarrow K\pi\) and \(D^{*} \rightarrow D^{0}\pi \rightarrow K\pi\pi\) from RHIC year 2012 run. |
| Contribution: | Hao Qiu and I carried out the entire analysis. |
| Technical skills: | Large data analysis. PYTHIA. ROOT, OOP, C++, computer clusters. |
| Outcome: | Preliminary results were presented at Quark Matter 2014 (PDF). |
Measurement of non-photonic electrons in \(p\)+\(p\) collisions (STAR experiment)
| Objective: | Measurement of non-photonic electrons production in \(p\)+\(p\) collisions at \(\sqrt{s}\)=200 GeV from RHIC year 2012 run. |
| Contribution: | Mentoring Ph.D. student Xiaozhi Bei (UIC and CCNU). |
| Skills: | Teaching and mentorship. |
| Outcome: | Poster at Quark Matter 2014. Paper in preparation. |
Measurement of non-photonic electrons production and azimuthal anisotropy (STAR experiment)
| Objective: | Measurement of non-photonic electrons production and azimuthal anisotropy in \(Au\)+\(Au\) collisions at \(\sqrt{s_{NN}}\)=200, 62.4 and 39 GeV. |
| Contribution: | PicoDst production. Data quality assurance. Electrons identification. Data analysis for spectra part. Embedding and efficiency studies. |
| Technical skills: | Large data analysis. Statistical methods. Simulation. PYTHIA. OOP, C++, ROOT, scripting. |
| Outcome: | Ph.D. thesis. arXiv:1210.5199. arXiv:1405.6348. Two more papers in the pipeline. |
Embedding Deputy (STAR experiment)
| Objective: | Train and follow-up with Embedding Helpers on embedding productions. Quality assurance of production physics and detector performance in simulation vs. data. Follow-up on issues and bugs with the core Software and Computation team. |
| Skills: | Effective communication. Team management. Knowledge of STAR data simulation and reconstruction code base. C++, scripting. |
| Outcome: | Identified and helped in solving several software bugs. Helped in restructuring the embedding work-flow and thus refactoring submission and production management scripts. |
Embedding Helper (STAR experiment)
| Objective: | Organize, prepare and submit Heavy Flavor (HF) embedding productions. Quality assurance of the production. Communicate the needs of the HF working group to the embedding team. |
| Skills: | Effective communication. Computational resources management and planning. C++, scripting. |
| Achievement Highlight: | The embedding team and I finished more than 25 HF embedding requests (17m events) for Quark Matter 2012 within sixth months. This required 6500 CPU weeks and 30TB of disk space. |
\(D^{*}\) reconstruction with HFT (STAR experiment)
| Objective: | Study topological reconstruction of \(D^{*}\) using STAR Heavy Flavor Tracker in full GEANT simulations. |
| Contribution: | Carried out the entire study. |
| Technical skills: | Simulations. Data analysis. PYTHIA. ROOT, C++, computer clusters. |
| Outcome: | Optimized topological cuts and signal significance estimates for RHIC projected luminosities for year 2014 run. PDF. |
\(D^{0}\) production in \(p\)+\(p\) collision at \(\sqrt{s}\) = 200 GeV (STAR experiment)
| Objective: | Measurement of charm cross-section at mid-rapidity by direct reconstruction of \(D^{0} \rightarrow K\pi\). |
| Contribution: | Studying event-mixing techniques in \(p\)+\(p\) collisions. Cross-checking signal reconstruction. STAR documents. |
| Technical skills: | Large data analysis. PYTHIA. ROOT, C++, computer clusters. |
| Outcome: | Phys. Rev. D 86, 072013 (2012). arXiv:1204.4244. |
Theoretical Physics Lab. Linux Cluster (University of Jordan)
| Objective: | Constructing the first Linux Cluster in the University of Jordan for computation physics research. |
| Contribution: | Organized and lead a group of physicists and engineers to carry the task. |
| Skills: | Leadership. Linux administration, networking, cluster infrastructure. |
| Outcome: | We completed the construction of two clusters. |
59+ publications. Full list available at Google Scholar or INSPIRE.
mmustafa.com •
• +1<PHONE_NUMBER> •
Nuclear Science Division, Lawrence Berkeley National Laboratory,
One Cyclotron Road, Berkeley, CA 94720


Go
Wikipedia Map
A tool for exploring the world’s knowledge by making connections between topics.
instructions


When I was a child I had a friend with custom lego-like blocks, maybe 4"x6"x12"in or so. They were pretty cool, but never enough to really satisfy me. Seeing some legos on TV, I remembered those blocks, and a do-it-yourself idea occurred to me.
You can get different kind of large building blocks.
But I enjoy making things, so what if you just buy a bunch of cardboard boxes and make it yourself? And to make them a little more fun, add some velcro so they stick together? So here's the supplies I might imagine getting (all in inches):
Total: $141.00
Well, it's not that cheap; about $1 a block, with shipping, which is only slightly cheaper than ImagiBricks (though the boxes are larger and include velcro). And you have to assemble them and add dots. You can draw on them, but they are brown; white boxes aren't available in the full variety of sizes. And they aren't water resistent like the ImagiBrics (which have a glossy surface), and I think Imagiblocks may have an internal structure making them stronger. And it takes 34 cubic feet to store the boxes, about a 4x4x2 foot area. You could enclose a 4x4x4 foot house-like structure with them. And of course you could leave some unassembled as replacements.
So, I'm not sure if it's the best do-it-yourself idea. But I'm sure the kids would have fun.
not really blockish.. But imo one of the best educational/creative games of the last generation, you have to conder em togheter with lego: http://www.geomagsa.com/
# anonymous


Man arrested after allegedly lighting the fire threatening Ebor
A man has been arrested after allegedly lighting a fire currently threatening Ebor on the Northern Tablelands.
Since 3pm today, the fire in the vicinity of Guyra Rd, west of Ebor has been at emergency warning level.
The RFS said the fire was fast moving, out of control, and burning towards Ebor village.
Residents have been told it is too late to leave and they should seek shelter as the fire approaches.
BlazeAid president Kevin Butler has been trying to contact the Ebor camp to make sure they are okay but he said phone calls are not getting through.
Emergency services first responded to reports of the fire on Thursday evening at about 10.30pm.
Witnesses reported a man acting suspiciously and police were alerted.
Following inquiries, New England police arrested a 51-year-old Ebor man just after 2pm today.
The man was taken to Armidale Police Station and remains in police custody.
EMERGENCY WARNING - Guyra Road, Ebor (Armidale LGA)
Posted:15/11/2019 17:30
An emergency warning is in place for a bush fire burning in the area of Guyra Road, Ebor. The fire is more than 2,000 hectares in size and is out of control.
Current Situation
- The fire is burning in the area of Guyra Road, west of Ebor.
- The fire is burning towards Ebor village.
- The fire is fast moving and out of control.
Advice
- If you are in the area of Ebor, seek shelter as the fire front arrives. Protect yourself from the heat of the fire. It is too late to leave.


Highly motivated font-end developer with international client portfolio, I WORK AS A WEB DEVELOPER DEVELOPING DIFFERENT WEB PAGES OF YOUR CHOICES. WE offer you the best website you can affordable For your advert and product development,


Copyright © 2010 W3C® (MIT, ERCIM, Keio), All Rights Reserved. W3C liability, trademark, and document use rules apply.
Syntax tests syntax-sparql3
This page describes W3C SPARQL Working Group's SPARQL1.0 test suite.
The test manifests and entries are built automatically from manifest.ttl using a Rake task. Tests may be contributed via pull request to https://github.com/w3c/rdf-tests with suitable changes to the manifest.ttl and referenced files.
Distributed under both the W3C Test Suite License and the W3C 3-clause BSD License. To contribute to a W3C Test Suite, see the policies and contribution forms.
 COPYRIGHT HOLDERS WILL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE DOCUMENT OR THE PERFORMANCE OR IMPLEMENTATION OF THE CONTENTS THEREOF.


Money Play. How should play 66?
pips Red=149 White=99
(CorrectAnswer= 0/0, ErrorScore= 0)
This position occurred in a chouette at the Cyprus tournament last year. I was the captain.
We had a long debate between 23/17(2), 23/11 and 23/17(2), 9/3(2)*. In the ned we couldn’t agree so as captain I made my move, 23/17(2), 23/11. When the box didn’t roll a four, we redoubled him out next turn.
Was I correct? Not quite. The better move is 23/17(2), 9/3(2)*. The point is that if we make that move and White fans we can play on for a gammon! That thought didn’t even enter our five-minute discussion. We were so focussed on winning the game after our joker roll, we didn’t even consider gammons. Did you?
Tricky game, backgammon!
We had a long debate between 23/17(2), 23/11 and 23/17(2), 9/3(2)*. In the ned we couldn’t agree so as captain I made my move, 23/17(2), 23/11. When the box didn’t roll a four, we redoubled him out next turn.
Was I correct? Not quite. The better move is 23/17(2), 9/3(2)*. The point is that if we make that move and White fans we can play on for a gammon! That thought didn’t even enter our five-minute discussion. We were so focussed on winning the game after our joker roll, we didn’t even consider gammons. Did you?
Tricky game, backgammon!
1. Cubeful 2-ply 23/11 23/17(2) Eq.: +0.398 0.630 0.053 0.001 - 0.370 0.171 0.002 2. Cubeful 2-ply 23/11 9/3*(2) Eq.: +0.397 (-0.001) 0.613 0.097 0.003 - 0.387 0.119 0.007 3. Cubeful 2-ply 23/17(2) 9/3*(2) Eq.: +0.332 (-0.066) 0.607 0.111 0.004 - 0.393 0.212 0.011 4. Cubeful 0-ply 23/17 9/3*(3) Eq.: +0.079 (-0.318) 0.492 0.086 0.003 - 0.508 0.150 0.011 5. Cubeful 0-ply 23/17(3) 7/1 Eq.: +0.072 (-0.326) 0.473 0.037 0.001 - 0.527 0.072 0.000


wiki / software / git Edit this page
Edited (8a55f77) at 2021-07-02 by Dilyn Corner
GIT [0]
________________________________________________________________________________
Git is a free and open source distributed version control system designed to
handle everything from small to very large projects with speed and efficiency.
[0.0] Index
________________________________________________________________________________
- Git Commands [1.0]
- Example 1: Staying Up-to-Date [2.0]
- Example 2: Squashing Your Latest Commits Into One [3.0]
- Example 3: Writing a new KISS Wiki article [4.0]
- References [5.0]
[1.0] Git Commands
________________________________________________________________________________
New KISS users may have various levels of exposure to git and other forms of
version control systems. The following is intended to be a "quick" reference
sheet of git commands.
+-------------------+----------------------------------------------------------+
| Action | Command |
+-------------------+----------------------------------------------------------+
| | |
| Set Default | $ git config --global user.name "FIRSTNAME LASTNAME" |
| Username | # stored in ~/.gitconfig |
| | |
| Set Default | $ git config --global user.email<EMAIL_ADDRESS>|
| Email Address | # stored in ~/.gitconfig |
| | |
| Set Default | $ git config --global core.editor vim |
| Text Editor | # stored in ~/.gitconfig |
| | |
| Store User | $ git config credential.helper store |
| Credentials | # credentials saved in ~/.git-credentials |
| | |
| Clone Repo. | $ git clone GIT_URL |
| | |
| Clone Branch | $ git clone GIT_URL -b BRANCH_NAME |
| | |
| Repo. Status | $ git status |
| | |
| Add/Update | $ git add FILE_OR_PATH |
| Project Files | |
| | |
| Apply a patch | $ git apply PATH_FILE |
| | |
| Remove | $ git add FILE_OR_PATH |
| Project Files | |
| | |
| Checkout | $ git checkout BRANCH_NAME |
| | # switch branches or restore working tree files |
| | |
| Commit | $ git commit |
| | # records changes to the repository |
| | |
| Push | $ git push |
| | # updates remote refs along with associated objects |
| | |
| Pull | $ git pull |
| | # fetch and integrate with another repository/branch |
| | |
| Fetch | $ git fetch |
| | # download objects and refs from another repository |
| | |
| Merge | $ git merge |
| | # join two or more development histories together |
| | |
| Rebase | $ git rebase |
| | # reapply commits on top of another base tip |
| | |
+-------------------+----------------------------------------------------------+
[2.0] Example 1: Staying Up-to-Date [1]
________________________________________________________________________________
In a standard setup, you generally have an origin and an upstream remote - the
latter being the gatekeeper of the project or the source of truth to which you
wish to contribute.
First, verify that you have already setup a remote for the upstream repository,
and hopefully an origin too:
+------------------------------------------------------------------------------+
| |
| $ git remote -v |
| |
+------------------------------------------------------------------------------+
If you don't have an upstream you can easily add it with the remote command:
+------------------------------------------------------------------------------+
| |
| $ git remote add upstream UPSTREAM_URL |
| |
+------------------------------------------------------------------------------+
Now you can collect the latest changes of the upstream repository with fetch.
Repeat this every time you want to get updates:
+------------------------------------------------------------------------------+
| |
| $ git fetch upstream |
| |
+------------------------------------------------------------------------------+
Generally, you want to keep your local master branch as a close mirror of the
upstream master and execute any work in feature branches, as they might later
become pull requests.
At this point, it does not matter if you use merge or rebase, as the result
will typically be the same. Let's use merge:
+------------------------------------------------------------------------------+
| |
| $ git checkout master |
| $ git merge upstream/master |
| |
+------------------------------------------------------------------------------+
[3.0] Example 2: Squashing Your Latest Commits Into One [2]
________________________________________________________________________________
With git it’s possible to squash previous commits into one. This is a great way
to group certain changes together before sharing them with others. Let’s say
this is your current git log:
+------------------------------------------------------------------------------+
| |
| * df71a27 - (HEAD feature_x) Updated CSS for new elements (4 minutes ago) |
| * ba9dd9a - Added new elements to page design (15 minutes ago) |
| * f392171 - Added new feature X (1 day ago) |
| * d7322aa - (origin/feature_x) Proof of concept for feature X (3 days ago) |
| |
+------------------------------------------------------------------------------+
You have a branch “feature_x” here. You’ve already pushed d7322aa with the proof
of concept of the new feature X. After that you’ve been working to add new
element to the feature, including some changes in CSS.
The command to accomplish that is:
+------------------------------------------------------------------------------+
| |
| $ git rebase -i HEAD~3 |
| |
+------------------------------------------------------------------------------+
This will open up your editor with the following:
+------------------------------------------------------------------------------+
| |
| pick f392171 Added new feature X |
| pick ba9dd9a Added new elements to page design |
| pick df71a27 Updated CSS for new elements |
| |
+------------------------------------------------------------------------------+
Now you can tell git what to do with each commit. Let’s keep the commit f392171,
the one were we added our feature. We’ll squash the following two commits into
the first one - leaving us with one clean commit with features X in it,
including the added element and CSS.
Change your file to this:
+------------------------------------------------------------------------------+
| |
| pick f392171 Added new feature X |
| squash ba9dd9a Added new elements to page design |
| squash df71a27 Updated CSS for new elements |
| |
+------------------------------------------------------------------------------+
When done, save and quit your editor. Git will now squash the commits into one.
Note: Do not squash commits that you’ve already shared with others. You are
changing history and it will cause trouble for others.
[4.0] Example 3: Writing a new KISS Wiki article.
________________________________________________________________________________
Note: The method described below requires a GitHub user account. If you do not
have a GitHub user account or do not wish to create one, you can still
submit your articles or ideas directly to<EMAIL_ADDRESS>Lets say you are interested in writing a new article for the KISS Wiki. The
process is fairly straight forward!
Begin by first creating a fork of the KISS Wiki repository. One way to do this
is from a web browser by going to the https://github.com/kiss-community/wiki
page, clicking the "Fork" button in the upper right corner of the page. Doing so
should create a copy of the KISS Wiki repository on your user account (e.g.
https://github.com/USERNAME/wiki).
Clone the forked repository to your PC with the following command. Remember to
replace USERNAME with your actual GitHub username.
+------------------------------------------------------------------------------+
| |
| $ git clone https://github.com/USERNAME/wiki.git |
| |
+------------------------------------------------------------------------------+
Once cloned to your PC, navigate to the wiki directory:
+------------------------------------------------------------------------------+
| |
| $ cd wiki |
| |
+------------------------------------------------------------------------------+
Add your new article in this directory per the #/wiki/help/adding-a-page
guidelines. Once you are ready to publish your newly created article, you need
to add/update your forked repository. From the main wiki directory, you can
check the status of all changes or newly created files:
+------------------------------------------------------------------------------+
| |
| $ git status |
| |
+------------------------------------------------------------------------------+
Using the output of command above, update/add the new files your forked
repository that are ready to be published:
+------------------------------------------------------------------------------+
| |
| $ git add FILE_NAME1 FILE_NAME |
| |
+------------------------------------------------------------------------------+
Alternatively, you can add ALL newly updated/created files in a single command:
+------------------------------------------------------------------------------+
| |
| $ git add * |
| |
+------------------------------------------------------------------------------+
Next, you will commit your changes.
+------------------------------------------------------------------------------+
| |
| $ git commit -m "YOUR_COMMIT_MSG" |
| |
+------------------------------------------------------------------------------+
Replace YOUR_COMMIT_MSG with a short description of change(s) or the new article
(i.e. "git: new article" or "git: add new git example").
At this point you are ready to push your changes to the GitHub server with the
following command.
+------------------------------------------------------------------------------+
| |
| $ git push |
| |
+------------------------------------------------------------------------------+
Upon doing so, you will be prompted to enter your GitHub user credentials. Once
entered, the latest changes will be uploaded to your forked Wiki repository
on GitHub.
The last step is to initiate a Pull Request (PR). A PR can be initiated via a
web browser by going to the https://github.com/USERNAME/wiki page and pressing
the "New pull request" button near the top of the page. In the Title field,
enter the reason for initiating a PR (i.e. "git: new article") and press the
"Create pull request" button.
Note: Pay attention to which branch is being merged into the master branch of
the repository :kiss-community/wiki".
[5.0] References
________________________________________________________________________________
[0] https://git-scm.com
[1] https://www.atlassian.com/git/tutorials/git-forks-and-upstreams
[2] https://www.devroom.io/2011/07/05/git-squash-your-latests-commits-into-one/
________________________________________________________________________________
Dylan Araps (C) 2019-2020
kiss-community (C) 2020-2021
Dilyn Corner (C) 2021
Linux(R) is the registered trademark of Linus Torvalds in the U.S. and
other countries.


Pumpkin is perfect for fall baking. Whether you are looking for sweet or savory, pumpkin adds an amazing fall flavor to any dish.
Recipe - Frosted Pumpkin Cookies
Ingredients
2 cups butter, softened
2 cups granulated sugar
2 tsp. baking powder
2 tsp. baking soda
1 tsp salt
1 tsp. cinnamon
1 tsp. ground nutmeg
2 eggs
2 tsp. vanilla extract
15 ounce can of pumpkin
4 cups flour
Frosting
1/2 cup of butter
1/2 cup packed brown sugar
1/4 cup of milk
1 tsp. vanilla
3 to 4 cups of powdered sugar
Instructions
Preheat oven to 350 degrees. In a large bowl beat the 2 cups of butter with an electric mixer on medium speed for 30 seconds. Add granulated sugar, baking powder, baking soda, salt, the 1 teaspoon cinnamon, and the nutmeg. Beat until combined. Beat in the eggs and 2 teaspoons of vanilla until combined. Beat in pumpkin. Beat in as much of the four as you can with the mixer. Stir in remaining flour with a wooden spoon.
Drop dough by heaping teaspoons 2 inches apart on ungreased cookie sheets. Bake for 10 to 12 minutes or until tops are set. Transfer to wire racks to cool.
For frosting, in a small saucepan heat the 1/2 cup butter and brown sugar until melted and smooth. Transfer to a medium bowl. Stir in milk and 1 teaspoon of vanilla. Beat in powdered sugar until smooth. Spread frosting on cookies. Sprinkle with additional cinnamon if desired.


We visualize blockchain!
- revolutionize open-source bandwidth
- envisioneer B2B infrastructures
- extend synergistic platforms
- maximize virtual ROI
- aggregate clicks-and-mortar vortals
- synthesize leading-edge users
- monetize turn-key content
- unleash compelling supply-chains
- orchestrate proactive models


ISwR: Introductory Statistics with R
Data sets and scripts for text examples and exercises in
P. Dalgaard (2008), ‘Introductory Statistics with R’, 2nd ed., Springer Verlag, ISBN<PHONE_NUMBER>534.
| Version: |
2.0-7 |
| Depends: |
R (≥ 2.6.0) |
| Suggests: |
survival, MASS |
| Published: |
2015-06-07 |
| Author: |
Peter Dalgaard |
| Maintainer: |
Peter Dalgaard <pd.mes at cbs.dk> |
| License: |
GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: |
no |
| CRAN checks: |
ISwR results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=ISwR
to link to this page.


{% extends 'base.html' %} {% block title %}Home{% endblock %} {% block home_active %}class="active"{% endblock %} {% load static %} {% block content %}
This website is a High-intensity interval training application that will give you a randomly selected exercise from the DareBee workout library.
These exercises do not require any equipment.
You will have 60 seconds to perform the exercise and then the page will reload with another random exercise.
If you don't like an exercise click Skip Exercise and you will move on to the next exercise.
There are currently {{ exercise_count }} exercises available.
There have been a total of {{ entries_count }} exercises performed on this website.
To get started you can either sign in as a guest or sign up for an account if you want to record your workout history.
Note videos will not autoplay on iPhone and iPads due to Apple disabling autoplay to "save user data"...
The source code for the site is hosted in Github here Github.com/okftw/track
Feel free to raise an Issue or PR


Blog with Api
Active
Link
Link
Another Link
Previous
1
2
3
4
5
6
7
8
9
10
11
Next
USER
New message
Title
Body
Think about it
Are you sure do you want to delete this post?
EDIT
DELETE


--- layout: post permalink: expressdecor.html Tags: Array NameOfCoupon: Express Decor Summary: See our ExpressDecor Coupon Code, ExpressDecor Rebate, ExpressDecor Promo Code, ExpressDecor Discount, ExpressDecor Coupon Cash Back Rebate here. MetaKeywords: ExpressDecor Coupon Code, ExpressDecor Rebate, ExpressDecor Promo Code, ExpressDecor Cash Back Rebate, ExpressDecor Discount, ExpressDecor Coupon Image: images/17021.jpg LinkURL: http://www.shareasale.com/r.cfm?b=120089&u=412002&m=17021 affiliate_url_link: http://www.icouponblog.com/jane.php?id=22 thesis_readmore: See the ExpressDecor Coupon thesis_thumb: http://www.icouponblog.com/tn.php?merchantURL=expressdecor.com Title: Save 4% - ExpressDecor Coupon Code for expressdecor.com. ExpressDecor Rebate & Discount thesis_description: Our ExpressDecor Discount Coupon Code for expressdecor.com. We have the best ExpressDecor Rebate anywhere. thesis_keywords: ExpressDecor, ExpressDecor Coupon Code, ExpressDecor Discount, ExpressDecor Rebate product_name: ExpressDecor hop_url: http://www.icouponblog.com/hop.php?id=22 ---
ExpressDecor.com a leading online distributor of high end bathroom fixtures and accessories. We carry a wide selection of top of the line glass vessel sinks, high quality bathroom faucets, tub fillers, shower fixtures, as well as fabulous vanity sets and highly versatile accessories. Every model offered in our online store is carefully chosen by our exclusive designers who ensure that the models are stylish and elegant. Furthermore, each item undergoes rigorous quality control before it is offered to our clients.
We partner with the top manufacturers to obtain the latest styles and the widest selections so that we can offer our customers the newest trend setting bathroom fixtures. All the items sold on expressdecor.com are made for U.S. standard plumbing and are appropriate for commercial as well as residential use.
If you are a do-it-yourself kind of a person looking for name brand products at an affordable price this website is for you. For a limited time you can enjoy even more great savings by taking advantage of our Express Decor coupon code and receive 5% cash back on any purchase made through the link above.


Sliding Down That Hill: Golden Retriever Knows How to Enjoy Life
What makes a dog happy?
Watching this video will make you smile and probably remind you of days when you were sliding down a snowy hill in your childhood. This cute golden retriever looks so happy while sliding and would be glad to see his owner accompanying him. After all, why not?


ONCE WERE WARRIORS A film review by James Berardinelli Copyright 1995 James Berardinelli
RATING (0 TO 10): 8.2
U.S. Availability: limited release on 2/24/95 Running Length: 1:39 MPAA Classification: R (Violence, rape, language)
Starring: Rena Owen, Temuera Morrison, Mamaengaroa Kerr-Bell, Julian Arahanga, Taungaroa Emile, Cliff Curtis Director: Lee Tamahori Producer: Robin Scholes Screenplay: Riwia Brown based on the novel by Alan Duff Cinematography: Stuart Dryburgh Music: Murray McNabb Released by Fine Line Features
ONCE WERE WARRIORS, a New Zealand export, is centered upon the touchy yet timely topic of domestic violence. It is not, however, merely another "domestic violence motion picture." With its complex cultural backdrop and its stark view of this societal cancer, ONCE WERE WARRIORS attains a level where it is equally painful and potent.
The critical themes of this movie are universal, even though there is a great deal of background that only a New Zealander (or a student of that country's history) can appreciate. Nevertheless, though many elements of the subtext may be lost to outside viewers, the key issue--the brutal cycle of violence and denial within a family--is brought to the fore in a manner that necessitates no special awareness.
It is helpful, although not essential, to know a little about Maori society and culture (Maoris are the Polynesian warrior-race who settled--or, more appropriately, conquered--New Zealand some 1000 years ago). Equality is not a basic tenant of the Maori lifestyle, at least as depicted in this film. However, alcoholism and unemployment are. It's the lot of the woman to work, while the man--the "protector"--spends all day at the local pub getting drunk. Wife-beating, while distasteful, is acceptable behavior, especially if the woman has the audacity to talk back to her husband.
The movie takes place in an urbanized area of south Auckland, where Beth and Jake Heke (Rena Owen and New Zealand soap stud Temuera Morrison) live in a small house with four of their five children. The fifth, Nig (Julian Arahanga), has moved out to join a local gang. At first glance, Beth and Jake seem to have a solid marriage. They gripe at each other, but all seems pretty tranquil, and there are moments of genuine affection.  Many films have depicted wife-beatings. Few have been as graphic and difficult to watch.
 Boogie (Taungaroa Emile) has been arrested, and when neither of his parents appear at his court hearing, he is sentenced to enter social welfare custody. Grace (Mamaengaroa Kerr-Bell), the Heke's thirteen-year old daughter, is having as much difficulty coping with her own sexuality as with the brutal chaos of her home life.
The acting throughout ONCE WERE WARRIORS is uniformly strong, with leading and supporting actors turning in performances that range from credible to electric. The musical score, by Murray McNabb, is evocative, and a perfect match for the drab, dreary colors suffusing Stuart Dryburgh's camerawork. Great pains have been taken to emphasize that everyone in this film is trapped by one thing or another--if not their circumstances, then their personality. The only moment of serenity--the opening scene depicting a pastoral setting--turns out to be an illusion: a billboard in the midst of a gray city.
By anchoring ONCE WERE WARRIORS in the turmoil of a Maori family, director Lee Tamahori takes full advantage of an opportunity not only to dissect the forces that lead to domestic violence, but also to focus on the clash between Maori traditions and modern values. The snares laid for men and women are not the only concepts put forth to ponder. ONCE WERE WARRIORS works, to some degree, on three levels: the visceral, the emotional, and the intellectual, and it is the amalgamation of these that makes this a memorable film.
- 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


Todd Brentlinger, E.I.T
Summary
Engineer-in-Training (EIT) and graduate of ABET-accredited bachelor's in civil engineering program backed by knowledge of engineering theories, principles, specifications, and standards. Highly motivated to secure an entry-level job where I may benefit my employer, gain experience, and expand my knowledge of the field of engineering.
Education
Graduate Coursework, Structural Engineering
University of California, Davis
September 2013 - June 2014
36 units completed toward M.S.
Cumulative GPA: 3.48
Bachelor of Science in Civil Engineering
University of California, Berkeley
August 2009 - December 2011
Upper Division Technical GPA: 3.307
Fundamentals of Engineering Exam Passed, California, October 2011 No. EIT 144769
Academic Coursework
- Structural Engineering
- Adv. Steel Design
- Bridge Design
- Adv. Reinforced Concrete Design
- Seismic Engineering
- Finite Element
- Adv. Structural Analysis
- Project Management
- Structural Dynamics
Graduate Project Experience
Bridge Design Team Member (UC Davis)
April - June '14
- Conducted a preliminary slab-on-girder bridge design given a set of functionality, seismic, and site constraints under AASHTO design loads. Collaborated with two other team members in design calculations of the superstructure as well as the end abutments, including pile foundation, culminating in a technical report.
Seismic Design Team Member (UC Davis)
Jan - March '14
- Collaborated with two other team members in designing a building based on ASCE-7 as well as analyzed the variations and issues with the design of the buildings for earthquake loads using different methods including pushover analysis and ASCE-41 code.
Adv. Reinforced Concrete Programmer (UC Davis)
Jan - March '14
- Designed a program implemented in MATLAB for the moment-curvature analysis of confined and unconfined concrete columns through the application of Mandar's model culminating in a technical report including a validation and use of the program for two concrete column designs.
Additional Skills
- Strong analytic and problem-solving abilities
- Good written and oral communication skills
- Visual Studio
- Able to function well as an independent worker or as a member of a professional engineering team
- Proficient in C++, C#, MATLAB
- Proficient in HTML/CSS/JavaScript
- Advanced knowledge of AutoCAD
- Proficient in Microsoft Office Applications - Excel, Word, PowerPoint, etc.


--- layout: page ---
This web application demonstrate s how you can send an authorized XHR Request to an HTTPS Function. Now sign in!