| 1 | /* =========================================================== | |
| 2 | * JFreeChart : a free chart library for the Java(tm) platform | |
| 3 | * =========================================================== | |
| 4 | * | |
| 5 | * (C) Copyright 2000-2013, by Object Refinery Limited and Contributors. | |
| 6 | * | |
| 7 | * Project Info: http://www.jfree.org/jfreechart/index.html | |
| 8 | * | |
| 9 | * This library is free software; you can redistribute it and/or modify it | |
| 10 | * under the terms of the GNU Lesser General Public License as published by | |
| 11 | * the Free Software Foundation; either version 2.1 of the License, or | |
| 12 | * (at your option) any later version. | |
| 13 | * | |
| 14 | * This library is distributed in the hope that it will be useful, but | |
| 15 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY | |
| 16 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public | |
| 17 | * License for more details. | |
| 18 | * | |
| 19 | * You should have received a copy of the GNU Lesser General Public | |
| 20 | * License along with this library; if not, write to the Free Software | |
| 21 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, | |
| 22 | * USA. | |
| 23 | * | |
| 24 | * [Oracle and Java are registered trademarks of Oracle and/or its affiliates. | |
| 25 | * Other names may be trademarks of their respective owners.] | |
| 26 | * | |
| 27 | * -------------- | |
| 28 | * YInterval.java | |
| 29 | * -------------- | |
| 30 | * (C) Copyright 2006-2008, by Object Refinery Limited. | |
| 31 | * | |
| 32 | * Original Author: David Gilbert (for Object Refinery Limited); | |
| 33 | * Contributor(s): -; | |
| 34 | * | |
| 35 | * Changes | |
| 36 | * ------- | |
| 37 | * 20-Oct-2006 : Version 1 (DG); | |
| 38 | * | |
| 39 | */ | |
| 40 | ||
| 41 | package org.jfree.data.xy; | |
| 42 | ||
| 43 | import java.io.Serializable; | |
| 44 | ||
| 45 | /** | |
| 46 | * A y-interval. This class is used internally by the | |
| 47 | * {@link YIntervalDataItem} class. | |
| 48 | * | |
| 49 | * @since 1.0.3 | |
| 50 | */ | |
| 51 | public class YInterval implements Serializable { | |
| 52 | ||
| 53 | /** The y-value. */ | |
| 54 | private double y; | |
| 55 | ||
| 56 | /** The lower bound of the y-interval. */ | |
| 57 | private double yLow; | |
| 58 | ||
| 59 | /** The upper bound of the y-interval. */ | |
| 60 | private double yHigh; | |
| 61 | ||
| 62 | /** | |
| 63 | * Creates a new instance of {@code YInterval}. | |
| 64 | * | |
| 65 | * @param y the y-value. | |
| 66 | * @param yLow the lower bound of the y-interval. | |
| 67 | * @param yHigh the upper bound of the y-interval. | |
| 68 | */ | |
| 69 | public YInterval(double y, double yLow, double yHigh) { | |
| 70 |
1
1. |
this.y = y; |
| 71 |
1
1. |
this.yLow = yLow; |
| 72 |
1
1. |
this.yHigh = yHigh; |
| 73 | } | |
| 74 | ||
| 75 | /** | |
| 76 | * Returns the y-value. | |
| 77 | * | |
| 78 | * @return The y-value. | |
| 79 | */ | |
| 80 | public double getY() { | |
| 81 |
2
1. getY : replaced double return with 0.0d for org/jfree/data/xy/YInterval::getY → NO_COVERAGE 2. getY : replaced return of double value with -(x + 1) for org/jfree/data/xy/YInterval::getY → NO_COVERAGE |
return this.y; |
| 82 | } | |
| 83 | ||
| 84 | /** | |
| 85 | * Returns the lower bound of the y-interval. | |
| 86 | * | |
| 87 | * @return The lower bound of the y-interval. | |
| 88 | */ | |
| 89 | public double getYLow() { | |
| 90 |
2
1. getYLow : replaced double return with 0.0d for org/jfree/data/xy/YInterval::getYLow → NO_COVERAGE 2. getYLow : replaced return of double value with -(x + 1) for org/jfree/data/xy/YInterval::getYLow → NO_COVERAGE |
return this.yLow; |
| 91 | } | |
| 92 | ||
| 93 | /** | |
| 94 | * Returns the upper bound of the y-interval. | |
| 95 | * | |
| 96 | * @return The upper bound of the y-interval. | |
| 97 | */ | |
| 98 | public double getYHigh() { | |
| 99 |
2
1. getYHigh : replaced double return with 0.0d for org/jfree/data/xy/YInterval::getYHigh → NO_COVERAGE 2. getYHigh : replaced return of double value with -(x + 1) for org/jfree/data/xy/YInterval::getYHigh → NO_COVERAGE |
return this.yHigh; |
| 100 | } | |
| 101 | ||
| 102 | /** | |
| 103 | * Tests this instance for equality with an arbitrary object. | |
| 104 | * | |
| 105 | * @param obj the object ({@code null} permitted). | |
| 106 | * | |
| 107 | * @return A boolean. | |
| 108 | */ | |
| 109 | @Override | |
| 110 | public boolean equals(Object obj) { | |
| 111 |
2
1. equals : negated conditional → KILLED 2. equals : removed conditional - replaced equality check with true → KILLED |
if (obj == this) { |
| 112 |
3
1. equals : replaced boolean return with false for org/jfree/data/xy/YInterval::equals → NO_COVERAGE 2. equals : Substituted 1 with 0 → NO_COVERAGE 3. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return true; |
| 113 | } | |
| 114 |
3
1. equals : removed conditional - replaced equality check with false → SURVIVED 2. equals : negated conditional → KILLED 3. equals : removed conditional - replaced equality check with true → KILLED |
if (!(obj instanceof YInterval)) { |
| 115 |
3
1. equals : replaced boolean return with true for org/jfree/data/xy/YInterval::equals → NO_COVERAGE 2. equals : Substituted 0 with 1 → NO_COVERAGE 3. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return false; |
| 116 | } | |
| 117 | YInterval that = (YInterval) obj; | |
| 118 |
3
1. equals : negated conditional → KILLED 2. equals : removed conditional - replaced equality check with false → KILLED 3. equals : removed conditional - replaced equality check with true → KILLED |
if (this.y != that.y) { |
| 119 |
3
1. equals : replaced boolean return with true for org/jfree/data/xy/YInterval::equals → KILLED 2. equals : Substituted 0 with 1 → KILLED 3. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → KILLED |
return false; |
| 120 | } | |
| 121 |
3
1. equals : negated conditional → KILLED 2. equals : removed conditional - replaced equality check with false → KILLED 3. equals : removed conditional - replaced equality check with true → KILLED |
if (this.yLow != that.yLow) { |
| 122 |
3
1. equals : replaced boolean return with true for org/jfree/data/xy/YInterval::equals → KILLED 2. equals : Substituted 0 with 1 → KILLED 3. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → KILLED |
return false; |
| 123 | } | |
| 124 |
3
1. equals : negated conditional → KILLED 2. equals : removed conditional - replaced equality check with false → KILLED 3. equals : removed conditional - replaced equality check with true → KILLED |
if (this.yHigh != that.yHigh) { |
| 125 |
3
1. equals : replaced boolean return with true for org/jfree/data/xy/YInterval::equals → KILLED 2. equals : Substituted 0 with 1 → KILLED 3. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → KILLED |
return false; |
| 126 | } | |
| 127 |
3
1. equals : replaced boolean return with false for org/jfree/data/xy/YInterval::equals → KILLED 2. equals : Substituted 1 with 0 → KILLED 3. equals : replaced return of integer sized value with (x == 0 ? 1 : 0) → KILLED |
return true; |
| 128 | } | |
| 129 | ||
| 130 | } | |
Mutations | ||
| 70 |
1.1 |
|
| 71 |
1.1 |
|
| 72 |
1.1 |
|
| 81 |
1.1 2.2 |
|
| 90 |
1.1 2.2 |
|
| 99 |
1.1 2.2 |
|
| 111 |
1.1 2.2 |
|
| 112 |
1.1 2.2 3.3 |
|
| 114 |
1.1 2.2 3.3 |
|
| 115 |
1.1 2.2 3.3 |
|
| 118 |
1.1 2.2 3.3 |
|
| 119 |
1.1 2.2 3.3 |
|
| 121 |
1.1 2.2 3.3 |
|
| 122 |
1.1 2.2 3.3 |
|
| 124 |
1.1 2.2 3.3 |
|
| 125 |
1.1 2.2 3.3 |
|
| 127 |
1.1 2.2 3.3 |


Talk Overview
- What is < write / speak / code >
- Why did it get started
- The 2013 conference
- How you can start writing, speaking and contributing to open source
Your browser doesn't support the features required by impress.js, so you are presented with a simplified version of this presentation.
For the best experience please use the latest Chrome, Safari or Firefox browser.
initiative to empower
women software developers
to become
Thought Leaders
Speakers
and
Open Source Contributors
Interactive Exercise:
Goal: Find 2 things you'd love to hear your speak or write about
...and GO!
Resources:
Resources:
Resources:


Vizianagaram fort is an early 18th-century fort in the city of Vizianagaram in northeastern Andhra Pradesh, South India. It was built by Vijaya Rama Raju, the Maharaja of Vizianagaram in 1713. The formal ceremony, while laying the foundation for the fort, was very auspicious as it represented five signs of victory.
The square-shaped fort has two main gates, of which the main entry gate (the "Nagar khana") has elaborate architectural features. There are many temples and palaces within the fort and a victory tower. It is 60.9 kilometers from vishakapatnam.
Visiting Timings:-9:00AM-6:00PM
It is a famous Pilgrimage and also Ancient Historical Site since 3rd Century BCE. The temple and village at the base of a chain of hills of solid rock on which are some perennial springs of water, and various places each in a way associated with the name of Rama.
The Black Granite hills on which you can find the ruins of some Buddhist and Jain structures known as Bodhikonda. Apart from it there are two other hills by name Gurabaktakonda (Gurubhakthulakonda) and Ghani konda (also known as Durga Konda) on which you can find a 3rd-century BC Buddhist Monastic complex Remains and Rock-cut caves with Jain Tirthankara images on the walls of the caves.
This Place has a Historical Importance as both the religions of Buddhism and Jainism flourished temporarily over here. At this place also the Buddhists are shown to have had a prior settlement in a place now sacred to the Jains. It is 53.6 kilometers from vishakapatnam.
Visiting Timings:-5:00AM-8:00PM
The Bobbili Fort, located in the Vizianagaram district of the Indian state of Andhra Pradesh, was built during the middle of the 19th century in Bobbili. It has a historical link to the nearby mud fort of the same name which was destroyed during the Bobbili war in 1757 in a feud between the Rajas of Bobbili and the neighbouring Maharaja of Vizianagaram.
The fort complex has an impressive entrance gate in Indo-Sarcenic architectural style with high dome and many mantapas, Durbar Hall, four major palaces and two temples. It is 120.3 kilometers from vishakapatnam.
Visiting Timings:-9:00AM-6:00PM
This small village is famous on account of a huge complex of temples from ancient time. The temples are unique with extremely attractive sculptures, paintings on the walls and idols. The story of Ramayana was painted on the walls of the temples.
The temples within the complex are of Ganapathi, Shiva, Kalika Devi, Navagrahalu, Satyanarayana Swamy, Subramanyeswaraswamy, Seetharamaswamy, Anjaneya Swamy and Venu Gopalaswamy. It is 75.2 kilometers from vishakapatnam.
Visiting Timings:-6:00AM-1:00PM and 1:30PM-8:00PM
Varaha Lakshmi Narasimha Temple, also known as the Simhadri, is a beautiful Hindu shrine dedicated to Lord Narasimha. Situated on a hilltop, the shrine is believed to be the holy abode of Varaha Narasimha Swami, an incarnation of Lord Vishnu.
Representing a blend of Orissan and Chalukyan architectural styles, the temple is believed to have been constructed in 1098 by the famous Chola king, Kuloththunga. The queen of ancient Orissa covered the image with gold, between 1137 and 1156. Furthermore, Narasimha Deva, the king of the Eastern Ganga Kingdom in Orissa, constructed the central shrine in 1267.
The shrine was visited twice by Sri Krishna Deva Raya in 1516 and 1519, after defeating Gajapati Prataparudra Dev, a Gajapati ruler of Orissa. He offered jewellery to the deity, along with a huge bhogam, out of which a beautiful necklace is still preserved in the temple. The idol resembles a Shiva Lingam that is enshrined within the inner sanctum of the temple.
The Shiva Lingam remains covered with sandal paste and other holy pastes throughout the year. Apart from beautifully carved stone idols, the temple also has a statue of a stone chariot drawn by seven horses. It is 20.3 kilometers from visakhapatnam.
Visiting Timings:-7:00AM-4:00PM and 6:00PM-9:00PM
Bavikonda is one of the prominent attractions, located in the Sankaram village of Anakapalli. Being a popular Buddhist excavation site, the place is known as a Buddhist heritage spot, which reveals history, of before 2,000 years. The architectural remnants of the Buddhist period are earliest of its kind in South India and are prime attraction of the place.
The place houses different varieties of bricks that are used for construction and groups of Buddhist monuments, which are found during excavations in 1906. The architectural remnants on the eastern hill include a series of rock-cut caves, numerous groups of monolithic dagobas and a rock-cut stupa with extensive structural remains.
Apart from this, a stairway is also found, which leads up to a double-storeyed cave. The entrance of the cave is adorned with huge dwarapalas that are located on each side of the doorway. Being rectangular in shape, the cave chamber is segmented into 20 compartments by four cross rocks of 16 massive pillars.
Besides this, the place is also famous for housing the ancient statues of Buddha in various postures. It is 37 kilometers from visakhapatnam.
Visiting Timings:-9:00AM-5:00PM
Visakha Museum houses the historical treasures and artifacts of the Kalingandhra region. Collections available for viewing in the museum include ancient armory, crockery, coins, silk costumes, jewelry, stuffed animals, portraits, manuscripts, letters, diaries, scrapbooks, periodicals, and maps.
All of these were used by the early settlers in the region. Many models of warships, planes and submarines can be found here.It is 20.8 kilometers from visakhapatnam.
Visiting Timings:-11:00AM-7:00PM. It is closed on friday.


PCR respiratory assays OpenUrl Respanel assay pathogens Resplex specimens test Respiratory results tests using CrossRef detection infections FTDRP rapid Clin panel tested viral Table commercial different laboratory tract use View acid bacterial nucleic previously probes real-time Infect Microbiol Panel USA) common reference (Thermofisher Abstract Dis FREE Scientific, Text assays. available based pathogen patient probe targets testing time Med detected diagnostic human influenza known molecular multiplex new performance primers specificity virus Eur NPFS NPW USA). according accuracy compared control culture described detect diagnosis difficult dispensed extraction included infections. method methods mix mixed mixes multiple parainfluenza pathogens. performed reagents sample strains strip-tube strips -well Download LDTs Mix Pathogen QuantiTect Respanel. Science Sidra Viral Web additional amplification associated automated characteristics clinical coronavirus developed extracted kits lower nasopharyngeal obtained patients platforms pneumonia: prepared review sequence shown significant specific target total tubes used validated validation


Ralph Sun
<EMAIL_ADDRESS>Favorite color: Blue
Favorite website: Quora
Favorite activity:
Fall 2019 Classes
- CSCI 201: Principles of Software Development
- CSCI 270: Intoduction to Algorithms and Theory of Computing
- EE 109: Intoduction to Embedded Systems
- MATH 410: Fundamental Concepts of Modern Algebra
- PHED 155A: Golf
- PHED 156A: Basketball
Assignments:
Labs:


SWMS
home
Home
assignment_late
Awareness
assignment
Complaint
assignment
My DashBoard
directions_bus
Services Nearby
Tips,Tricks and Techniques


| 040:035 Khan | : |
Those who dispute about the Ayat (proofs, evidences, verses, lessons, signs, revelations, etc.) of Allah, without any authority that has come to them, it is greatly hateful and disgusting to Allah and to those who believe. Thus does Allah seal up the heart of every arrogant, tyrant. (So they cannot guide themselves to the Right Path). |
| 040:035 Maulana | : |
Those who dispute concerning the messages of Allah without any authority that has come to them. Greatly hated is it by Allah and by those who believe. Thus does Allah seal every heart, of a proud, haughty one. |
| 040:035 Pickthal | : |
Those who wrangle concerning the revelations of Allah without any warrant that hath come unto them, it is greatly hateful in the sight of Allah and in the sight of those who believe. Thus doth Allah print on every arrogant, disdainful heart. |
| 040:035 Rashad | : |
They argue against GOD's revelations, without any basis. This is a trait that is most abhorred by GOD and by those who believe. GOD thus seals the hearts of every arrogant tyrant. |
| 040:035 Sarwar | : |
those who dispute the revelations of God without having received clear authority. This act greatly angers God and the believers. Thus does God seal the hearts of every arrogant oppressor.". |
| 040:035 Shakir | : |
Those who dispute concerning the communications of Allah without any authority that He has given them; greatly hated is it by Allah and by-those who believe. Thus does Allah set a seal over the heart of every proud, haughty one. |
| 040:035 Sherali | : |
Those who dispute concerning the Signs of ALLAH without any authority having come to them from ALLAH. Grievously hateful is this in the Sight of ALLAH and in the sight of those who believe. Thus does ALLAH set a seal upon the heart of every arrogant, haughty person. |
| 040:035 Yusufali | : |
"(Such) as dispute about the Signs of Allah, without any authority that hath reached them, grievous and odious (is such conduct) in the sight of Allah and of the Believers. Thus doth Allah, seal up every heart - of arrogant and obstinate Transgressors." |
Concepts/Themes Covered: أركان الإسلام > التوحيد > الكافرون > افتراؤهم على الله وتكذيبهم ومجادلتهم بآيات الله Pillars of Islam> Islamic> The Disbelievers> Their Fabrication Against Allah, their Denial and Argumentation Against Allah's Signs الإنسان والعلاقات الأخلاقية > الأخلاق الذميمة > الاستكبار Man and The Moral Relations>The Dispraised Morals>Arrogance الإنسان والعلاقات الأخلاقية > الأخلاق الذميمة > التكبر Man and The Moral Relations>The Dispraised Morals>Arrogance
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


Summarized from "Clean Code" by Robert Martin
Technically correct
Does function as expected
BUT
You get a sense of deeper problem
Indications of violation of fundamental design principles
Your development has slowed down
Or there is increased risk of bugs and failures
Hold information in the right system
Old, irrelevant and incorrect
Floating islands of irrelevance and misdirection in the code
Either update or remove obselete comments
Comments should say what the code cannot say for itself
Don'ti++; //increment i
or
/**
* @param sellRequest
* @return
* @throws ManagedComponentException
*/
public SellResponse beginSellItem(SellRequest sellRequest)
throws ManagedComponentException
A comment worth writing is worth writing well
Make sure it is the best comment
Use proper grammar and punctuation
Don't state the obvious
Rots and becomes less and less irrelevant with each day
Delete it. Source control system has it for reference.
Calls functions and uses variables that are no longer valid.
Trivialize building a project
Automate multi-steps and simplify
Explore new age build tools - SBT, Gradle, etc.
Does your build tool allow easy extensions?
Make testing less painful
Running tests should be quick, easy and obvious
No Arguments is best
Three is the limit
Time to refactor your design and abstractions when you need more arguments
They are counterintuitive
Arguments are for inputs
Update state of the object being actioned
public void appendFooter(StringBuffer report)
vs
report.appendFooter();
Strong smell and avoid them
Clear indication that your function does more than one thing
Go back and revise your understanding of SRP
def chosen_ident(choice_flag, item, match):
assert choice_flag in (action.ASIS, action.APPLY)
if choice_flag is action.ASIS:
return (item.artist, item.title)
elif choice_flag is action.APPLY:
return (match.info.artist, match.info.title)
class _IdentChooser:
pass
class AsisIdent(_IdentChooser):
def __call__(self, ident):
return (ident.artist, ident.title)
class ApplyIdent(_IdentChooser):
def __call__(self, ident):
assert ident.hasattr('info') is True
return (ident.info.artist, ident.info.title)
class NullChooser(_Chooser):
def __call__(self, ident=None):
return ()
choosers = {action.ASIS: AsisChooser, action.APPLY: ApplyChooser, None: NullChooser, '': NullChooser}
def chosen_ident(choice_flag, item):
return choosers[choice_flag](item)
it just rots and misguides
Just discard
Follow "The Principle of Least Surprise"
Not implementing the obvious results into
getDayOfWeek()
should return Monday, Tuesday, etc and not 1, 2, 3, etc.
Don't rely on your intuition
Write tests for every boundary condition
represents a missed opportunity for abstraction
Always follow DRY principle
Abstraction increases vocabulary of your design
Improves reusability, increases coding speed and reduces error
Replace switch/case
or if/else
with polymorphism
Similar looking code? Does TEMPLATE METHOD or STRATEGY Pattern apply?
Seperate concepts at different levels and place them in different containers
Seperation should be complete. Don't mix lower and higher level concepts.
public interface Stack {
Object pop() throws EmptyException;
void push(Object o) throws FullException;
double percentFull();
class EmptyException extends Exception {}
class FullException extends Exception {}
}


You can download my resume as a PDF
Massachusetts Institute of Technology
SM Mechanical Engineering, January 2014 - GPA: 5.0/5.0
Relevant coursework: Sustainable manufacturing, computational science and engineering, innovation strategy, entrepreneurship, technology sales management.
Master’s Thesis, 2012-2014 - MIT Presidential Fellow
Strategic and Financial Implications of Unmanned Underwater Vehicles and Long-term Underwater Power Sources.
SB Mechanical Engineering, June 2012 - GPA: 5.0/5.0
Relevant coursework: Manufacturing, systems engineering, product design & development, robotics & controls, programming and computer science, biology.
Research projects: Bio-mimetic underwater robotics, networked indoor robot navigation, firearms identification for Boston Police, compact fusion power for spacecraft.
Innosight, 2014 - Present
Innovation strategy consultant
Developing strategies for Fortune 500 companies to respond to disruptive innovation.
Unmanned Underwater Vehicle (UUV) Projects with Lincoln Laboratory, MIT 2011-2014
Managed research team members, experimental research, accounting ($300k budget), procurement, and technical documentation & communication for prototype long-term underwater power sources. Founded a startup, competed in the MIT 100K, acted as CFO & COO.
Boeing Company, Summer 2012
Manufacturing and Robotics Engineering Intern
Contributed to the development of a revolutionary manufacturing line to improve aircraft quality & takt time, building & presenting critical industrial robotic vision & manipulation systems to upper management.
Schlumberger Limited, Summer 2011
Manufacturing Engineering Intern
Led a team to design, build, and implement apparati for testing electrical components for oil exploration equipment.
Biotech computing platform
Managed a project between major pharma and tech companies to design a cloud platform for biotech R&D. Created technical documentation, designed a new business model to commercialize, and helped negotiate terms.
Pharma R&D accelerator
Built a new in-house accelerator for high-risk breakthrough research at a major pharma, including organizational design, funding structure, identifying opportunity areas, evaluating potential ventures, and finding talent.
New venture in high-risk immunology research
Identified a disease area with scientific potential and high unmet medical need. Identified talent, created venture pitch, outlined experimental and clinical objectives and timelines, and evaluated technologies and partners.
Planning capabilities development for R&D programs
Identified critical science and technology capabilities needed to build an R&D program for a new therapeutic group. Created a detailed plan for development, including specific technologies, hiring, timelines, location, and budgeting.
New health payor business models based on big data
Created a new organizational design, project execution structure, and outcomes evaluation model for a big data group at a major health insurer. Outlined new ways to deliver value to payor business units and communicate impact.
Predicting content value for advertising
Built regression model to correlate content with ad value. Used SQL and Python to process over 250 million samples.
BRFSS diabetes and demographics
Built machine learning model to predict diabetes based on behavior. Cleaned demographics data for 30 years of BRFSS.
Venture portfolio simulation
Built Monte Carlo simulation of a large venture portfolio over 10 years to guide investment and management strategy.
Patent valuation
Scraped hundreds of thousands of patents from the USPTO website and structured data to estimate patent values.
Scientific advisory board membership
Used scientific publication records to identify potential SAB candidates.
Engineering: Systems engineering; manufacturing; data mining and analysis; Python (pandas, Numpy, SciPy), Java & Matlab; SolidWorks; product design and development; electronics.
Business: Team & project management; strategy & business development; disruptive innovation; entrepreneurship & startups; communication, presentations & writing.
© 2016. All rights reserved. "Then you will know the data, and the data will set you free." winstonlarson@gmail.com


Set a Precedence: bulk header on all emails. This will stop most auto-responders from sending replies back to the sender (out-of-office, on-vacation, etc.).


This online store gives you the newest football collections with the most exclusive offers. Shipping cost is free!


Submitted by charliemic on Fri, 20/12/2013 - 23:47
Hi all,
I have an emonTX sat on top of my distribution board, with the CT sensor inside the board. This is the only way I could get to a live cable as my incoming electrical supply is hidden within a wall.
I've been getting some strange readings from the emonTX, which after a quite a bit of problem solving (see: http://openenergymonitor.org/emon/node/3004), I have narrowed down to a problem with the CT cable, or the CT sensor itself.
Basically, if I fiddle around with the cable, I can get the sensor to give very large readings of power from 2500W to over 4000W, even when I know I am only pulling around 300W.
The problem is I am struggling to know what exactly is causing the problem. It appears that when I pull on the cable, it causes the reading to shoot up. But not always.
I will try and have more of a play tomorrow, but I wondered if there could be an issue here to do with the CT cable itself picking up interference (induction?) from cabling and terminals within the board. The clamp is fitted very snuggling onto the live, but is close up against the neutral. The cable then loops back over the top of various cables serving different circuits.
Any thoughts?
Right now I have managed to find a position that gives reasonable figures.
I'll try and get some photos of the board in the morning to show you what I mean.
CT Sensor in a distribution board
Submitted by charliemic on Fri, 20/12/2013 - 23:47Hi all,
I have an emonTX sat on top of my distribution board, with the CT sensor inside the board. This is the only way I could get to a live cable as my incoming electrical supply is hidden within a wall.
I've been getting some strange readings from the emonTX, which after a quite a bit of problem solving (see: http://openenergymonitor.org/emon/node/3004), I have narrowed down to a problem with the CT cable, or the CT sensor itself.
Basically, if I fiddle around with the cable, I can get the sensor to give very large readings of power from 2500W to over 4000W, even when I know I am only pulling around 300W.
The problem is I am struggling to know what exactly is causing the problem. It appears that when I pull on the cable, it causes the reading to shoot up. But not always.
I will try and have more of a play tomorrow, but I wondered if there could be an issue here to do with the CT cable itself picking up interference (induction?) from cabling and terminals within the board. The clamp is fitted very snuggling onto the live, but is close up against the neutral. The cable then loops back over the top of various cables serving different circuits.
Any thoughts?
Right now I have managed to find a position that gives reasonable figures.
I'll try and get some photos of the board in the morning to show you what I mean.
Chris
[This is essentially a duplicate of EmonTX: Strange power readings ]


Selected Assets
No Selection
Transfer To
To Local
To FTP Server
Local Dest.
Server Dest.
Server Name
Port
UserName
Password
API Calls
Refer to API messages as follows:
Clear


Jan 14, 2012 5:14 PM
Jana Sukkarieh from the Educational Testing Service will discuss the scoring of free-text responses at this seminar. Ongoing progress in natural language processing and a renewed interest in open-ended test questions prompted researchers and assessment organizations to consider the development of automatic scoring technologies. In this talk, I will concentrate on discussing automatic content scoring technologies. In particular, I will emphasize the kind of content these technologies are trying to measure and the natural language understanding skills that, ideally, such technology needs to possess. I will then describe several techniques for these types of scoring tasks, focusing on the use of text analytics and mining for short free-text responses written in English as well as those written in French, Spanish, and Japanese. I will also present a methodology for question design in view of the fact that building scoring technologies cannot be seen independently from the question design process — in fact, one drives the other. I will demonstrate how some test question attributes, e.g., the cognitive skills required to respond to a question, can be predictive of the technology's performance. In addition, I will report on two types of evaluation: one using open-ended test questions and another using a suite that can be used for automated regression and performance evaluations within the technology and for a comparative evaluation across several technologies. Since assessment can be seen as a way of enhancing student learning, I will outline the types of student feedback that can be provided by these text-understanding-based technologies. Finally, I will outline how these techniques can be used in other content-based text management applications such as the clustering of textual online discussions and the generation of automatic alerts for newly published articles. Open to all members of the university community. If you are coming from outside the Edlab, please RSVP by March 26th by sending a message to Edlab at http://ednode.com/profiles/edlabtc/about (You must have/create an Ednode account and click on the Contact button to send a message). EdLab Seminars take place on the 5th floor of Russell Hall at Teachers College Columbia University (525 W. 120th Street, NY, NY). For detailed directions within the College visit TC Route Finder: http://maps.tc-library.org


{include file='public/head' /}
{include file='public/header' /}
{include file='public/left_menu' /}
{$language_tag.index_public_homepage}
{$language_tag.index_branchcompany_showBranchProductManage_branchManagement}
{$language_tag.index_branchcompany_showCompanyOrderManage_orderManagement}
{include file='public/foot_js' /} {include file='public/bookingAll' /}


Your access to and use of the Service is conditioned on your acceptance of and compliance with these Terms. Terms apply to all visitors, users and others who access and use the Service. By downloading and using our mobile application, now or at any given point in the future you agree to be bound by these Terms.
Love a Frenchie reserves the right to amend, remove or adjust the Terms of Use at any given time. By agreeing to the Terms of Use you understand that you hold at the obligation to regular check, and become aware of any changes made to the Terms of Use. If you breach any of the Terms your permission to use this Service is immediately terminated.
Whenever we make changes to these Terms, the changes are effective immediately after the changes. It is your responsibility to check Love a Frenchie for changes to these Terms of Use. If you continue to use the Service after the revised Terms go into effect, then you have accepted the changes to these Terms.
If you disagree with any part of the terms you may not access the Service and you must uninstall our application from all relevant devices. If, for any reason, we believe that you have not complied with these terms, we may at our sole discretion, cancel your access the Love a Frenchie services immediately and without prior notice.
Users may find advertising or other content on our Service that link to the sites and services of our partners, suppliers, advertisers, sponsors, licensors and other third parties. We do not control the content or links that appear on these sites and are not responsible for the practices employed by websites linked to or from our Service. In addition, these sites or services, including their content and links, may be constantly changing. These sites and services may have their own privacy policies and customer service policies. Browsing and interaction on any other website, including websites which have a link to our application, is subject to that website's own terms and policies.
Dimitar Stefanovski
Cane Vasilev 2/3
7000 Bitola, Macedonia


{{previewQuestion.description}}
{{previewQuestion.language.name}} Created by {{previewQuestion.author}} {{previewQuestion.createTime|amTimeAgo}}


--- layout: post title: 'Time Travel: yes it''s possible' date: 2012-03-10 10:05:26.000000000 +08:00 permalink: time-travel-yes-its-possible/ categories: - science tags: - einstein - science - spacetime - time-machine status: publish type: post published: true meta: _yoast_wpseo_meta-robots-noindex: '0' _yoast_wpseo_title: '' _edit_last: '2' OGP: a:20:{s:5:"title";s:0:"";s:4:"type";s:7:"article";s:5:"image";s:45:"http://images.darwinbiler.com/time-travel.jpg";s:11:"description";s:0:"";s:9:"fb:admins";s:0:"";s:9:"fb:app_id";s:0:"";s:14:"street-address";s:0:"";s:4:"city";s:0:"";s:11:"postal-code";s:0:"";s:12:"country-name";s:0:"";s:5:"email";s:0:"";s:12:"phone_number";s:0:"";s:10:"fax_number";s:0:"";s:5:"video";s:0:"";s:10:"videowidth";s:0:"";s:11:"videoheight";s:0:"";s:9:"videotype";s:0:"";s:6:"locale";s:0:"";s:18:"locale-alternative";s:0:"";s:3:"url";s:0:"";} _thumbnail_id: '117' _yoast_wpseo_metadesc: '' _yoast_wpseo_focuskw: '' _yoast_wpseo_meta-robots-nofollow: '0' _yoast_wpseo_meta-robots-adv: none _yoast_wpseo_sitemap-include: '-' _yoast_wpseo_sitemap-prio: '-' _yoast_wpseo_canonical: '' _yoast_wpseo_redirect: '' _oembed_e0a6404cefab95d4fc0a05b5f6373397: '{{unknown}}' _yoast_wpseo_linkdex: '0' _oembed_89179de1e3c5c487f3e050bf2c512125: '{{unknown}}' _oembed_d3281abf3906c6d725b664945d8bac38: '{{unknown}}' _oembed_418e621d35d01db51f6d21ad4d3301ae: '{{unknown}}' _oembed_65bd6fd6b3fb3ca19faf27ad0d6be439: '{{unknown}}' _oembed_cd049e452a5f764e33d7d9fb826bee71: '{{unknown}}' dsq_thread_id: '3277637784' cleaned: true ---
Before you say I'm dreaming and relying on a fictional movie: no I'm not.
First, think about these facts:
(from General Theory of Relativity by Einstein)
Given those facts. That means, if the gravitational pull is stronger in the place where I'm at right now than the place you are standing at, your clock is faster than my clock.
One second of you is equivalent to 2 seconds of me.

Do you get the logic?
Cool isn't it?
Wait, before you build your time-machine right now, hold on : currently, there is no way to go to such place ( enter in the center of the blackhole) because if you do that, you'll get ripped apart before you could even get there. Since on the process of falling into it, the speed will reach the speed of light and lots of strange things happens: I could not get back, its a one-way street.
Don't worry, there is another way: Wormholes
Wormholes are holes in the space, actually they are more of a tunnel that bridges two places. The concept came in when Einstein proposed the fabric of space: It says that the universe is like a cloth ( can be folded, twisted and bent).
So let's say, there is a big cloth of the size of basketball court. You are standing on the edge of the court and it takes you 30 seconds to walk to the other side of the court. Instead of walking to the basketball court, according to Einstein, you could actually fold the basketball court (reducing its width) and put a hole to a place where you are standing at -- and hola! you are in the other edge of the court!
Same could apply in the universe said Einstein, instead of traveling, you could just actually bend the universe and let the universe do the moving for you!
Hey, wait. when you fold the basketball court, yeah the time needed to travel from one side of the court to the other is reduced from 30 seconds to 0 seconds - but it had saved me only the distance I traveled but not the time, how about travelling the time?
Ok, this is the tricky part: Spacetime theory by Einstein suggests that the fabric on which the universe is made of is represented by 4 dimensions.
x = horizontal position
y = vertical position
z = nearness or farness
time = what time you are at when you are in that particular position
It's like, positions are always associated with time. When you are in your house example, your position (x,y,z values)can be accurately determined via GPS device, then add the time you were at that place, 8am for example.
What that indicates is, if you could bend the x,y,z positions (like what you did when you fold the basketball court earlier) and time is just another dimension, then you could also bend the time!
I know it's quite hard to grasp it, but do think about it a little more.
I recommend reading this article to at least brighten things up a bit
http://www.scientificamerican.com/article.cfm?id=could-time-end


Sunday
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Shade color with opacity 0.1
Shade color with opacity 0.2
Shade color with opacity 0.3
Shade color with opacity 0.4
Shade color with opacity 0.5
Shade color with opacity 0.6
Shade color with opacity 0.7
Shade color with opacity 0.8
Shade color with opacity 0.9
Sunday color with opacity 1.0
Shade color with opacity 0.1
Shade color with opacity 0.2
Shade color with opacity 0.3
Shade color with opacity 0.4
Shade color with opacity 0.5
Shade color with opacity 0.6
Shade color with opacity 0.7
Shade color with opacity 0.8
Shade color with opacity 0.9
Monday color with opacity 1.0
Shade color with opacity 0.1
Shade color with opacity 0.2
Shade color with opacity 0.3
Shade color with opacity 0.4
Shade color with opacity 0.5
Shade color with opacity 0.6
Shade color with opacity 0.7
Shade color with opacity 0.8
Shade color with opacity 0.9
Tueday color with opacity 1.0
Shade color with opacity 0.1
Shade color with opacity 0.2
Shade color with opacity 0.3
Shade color with opacity 0.4
Shade color with opacity 0.5
Shade color with opacity 0.6
Shade color with opacity 0.7
Shade color with opacity 0.8
Shade color with opacity 0.9
Wedday color with opacity 1.0
Shade color with opacity 0.1
Shade color with opacity 0.2
Shade color with opacity 0.3
Shade color with opacity 0.4
Shade color with opacity 0.5
Shade color with opacity 0.6
Shade color with opacity 0.7
Shade color with opacity 0.8
Shade color with opacity 0.9
Thuday color with opacity 1.0
Shade color with opacity 0.1
Shade color with opacity 0.2
Shade color with opacity 0.3
Shade color with opacity 0.4
Shade color with opacity 0.5
Shade color with opacity 0.6
Shade color with opacity 0.7
Shade color with opacity 0.8
Shade color with opacity 0.9
Friday color with opacity 1.0
Shade color with opacity 0.1
Shade color with opacity 0.2
Shade color with opacity 0.3
Shade color with opacity 0.4
Shade color with opacity 0.5
Shade color with opacity 0.6
Shade color with opacity 0.7
Shade color with opacity 0.8
Shade color with opacity 0.9
Saturday color with opacity 1.0


Since I began Phase 0 of Dev Bootcamp I've paired several times with students to complete challenges. Pairing, and giving and receiving feedback are very much a part of the credo of Dev Bootcamp. Through the process I've learned a lot about myself.
Pairing has been a valuable tool for me to learn about myself. I do admit that I don't like to rely on pairing for learning and that I've found pairing difficult. I think I learn best by thinking to myself and going at my own pace. I prefer quiet while trying to understand something rather than talking. Sometimes pairing can be fun, but other times I can feel flustered especially if the material is challenging or the partner moves at a fast pace. At times there will be situations where I'm still trying to understand the instructions and my partner will be a few steps ahead of me, talking and interrupting my thought process. This is not always the case though. There have been some pairing sessions where I felt like I was ahead of my pair.
A common theme in the feedback I've received from other students regarding pairing with me is that I need to speak up more and express my thoughts. My feedback was rated low in expressing my thoughts clearly. This is because I'm introverted and I tend to think in order to talk, whereas extroverted personalities talk in order to think.
Writing feedback is pretty straightforward for me. I try not to overthink it and write what my first instincts are. So far I have not had any pairing experiences that I would deem bad. Most of the feedback I have given was favorable. In some cases I felt my pair was great and I couldn't provide any critical feedback. For me the most difficult thing with writing feedback to others is finding something critical and how to phrase it. Naturally I dislike criticizing people and sometimes I felt my partner contributed more to the challenge and I was out of place to criticize them.
Overall, the feedback I received was helpful because it helped me realize a pattern that was going on. Mainly that I do not speak up enough and express my thoughts clearly. I will try to improve on this. Also, I think it will be useful for me to prepare ahead of time for challenges. This may mean reading the instructions and attempting the challenge before pairing. By doing this I can prevent becoming flustered or feeling like I'm holding us back when we are actually pairing.


and world domination
deploying a new PHP app
app checklist
- ☑ code written
- ☑ deployment configured
- ☑ servers up
- ☐ ...with PHP 5.5?
crap, we need a custom PHP version
We can upgrade!
...but everything on the servers use PHP!
vagrant?
at best you need a whole VM
puppet?
nope.
we can launch with VMWare
but it's hefty
docker provides env separation
docker is not a VM
docker is an app container
build image
↓
run container
docker containers...
- like a fancy chroot
- isolated on the network
- have versioning
- are versioned sans git
- require linux with lxc
hundreds of containers per host
versus one VM per app
there are flaws
- osx is clunky
- containers across hosts?
- syncing config changes
- needs reverse proxy
(not really a flaw, but)
we shouldn't change our entire infrastructure
special needs
and
new projects...
dockerfile
FROM docker.redventures.net/base-php
MAINTAINER somebody
RUN yum install php-5.5
EXPOSE 5041:80
CMD ["service http start"]


Before Change
// Drop any segments where the C value is None
new_segs = []
for seg, ncop in zip(segarr.copy(), copies):
if ncop is None:
continue
new_segs.append(seg._replace(
log2=math.log((ncop or 0.5) / ploidy, 2)))
yield segarr.as_rows(new_segs)
After Change
for copies in theta["C"]:
// Drop any segments where the C value is None
mask_drop = np.array([c is None for c in copies], dtype="bool")
segarr = segarr[~mask_drop].copy()
ok_copies = np.array([c for c in copies if c is not None], dtype="int")
// Replace remaining segment values with these integers
segarr["cn"] = ok_copies.copy()
ok_copies[ok_copies == 0] = 0.5


Multinomial logistic regression with sparse group lasso penalty. Simultaneous feature selection and parameter estimation for classification. Suitable for high dimensional multiclass classification with many classes. The algorithm computes the sparse group lasso penalized maximum likelihood estimate. Use of parallel computing for cross validation and subsampling is supported through the 'foreach' and 'doParallel' packages. Development version is on GitHub, please report package issues on GitHub.
| Version: | 2.3.7 |
| Depends: | R (≥ 3.2.4), Matrix, sglOptim (≥ 1.3.7) |
| Imports: | methods, tools, utils, stats |
| LinkingTo: | Rcpp, RcppProgress, RcppArmadillo, BH, sglOptim |
| Suggests: | knitr, rmarkdown |
| Published: | 2018-10-24 |
| Author: | Martin Vincent [aut], Niels Richard Hansen [ctb, cre] |
| Maintainer: | Niels Richard Hansen <niels.r.hansen at math.ku.dk> |
| BugReports: | https://github.com/nielsrhansen/msgl/issues |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | http://www.sciencedirect.com/science/article/pii/S0167947313002168, https://github.com/nielsrhansen/msgl |
| NeedsCompilation: | yes |
| Citation: | msgl citation info |
| Materials: | NEWS |
| CRAN checks: | msgl results |
| Reference manual: | msgl.pdf |
| Vignettes: |
Quick Start Quick Start |
| Package source: | msgl_2.3.7.tar.gz |
| Windows binaries: | r-devel: msgl_2.3.7.zip, r-release: msgl_2.3.7.zip, r-oldrel: msgl_2.3.7.zip |
| OS X binaries: | r-release: msgl_2.3.7.tgz, r-oldrel: msgl_2.3.7.tgz |
| Old sources: | msgl archive |
Please use the canonical form https://CRAN.R-project.org/package=msgl to link to this page.


Assume that there is a set of input vectors with independent, predictor, variables $$ \boldsymbol{X}_N \equiv \{ \boldsymbol{x}^{(n)}\}_{n=1}^N $$ and a set of target values $$ \boldsymbol{t}_N \equiv \{ t^{(n)}\}_{n=1}^N. $$
The inference of a function will obviously also allow to make predictions for new targets. However, we will need to consider in particular the second term in the numerator, which is the prior distribution on functions assumed in the model.
A Gaussian process is a stochastic process (a collection of random variables indexed by time or space), such that every finite collection of those random variables has a multivariate normal distribution
Let us express \( y(\boldsymbol{x}) \) in terms of a model function \( y(\boldsymbol{x}; \boldsymbol{\theta}) \) that depends on a vector of model parameters \( \boldsymbol{\theta} \).
For example, using a set of basis functions \( \left\{ \phi^{(h)} (\boldsymbol{x}) \right\}_{h=1}^H \) with linear weights \( \boldsymbol{\theta}_H \) we have $$ y (\boldsymbol{x}, \boldsymbol{\theta}) = \sum_{h=1}^H \theta^{(h)} \phi^{(h)} (\boldsymbol{x}) $$
The basis functions can be non-linear such as Gaussians (aka radial basis functions) $$ \phi^{(h)} (\boldsymbol{x}) = \exp \left[ -\frac{\left( \boldsymbol{x} - \boldsymbol{c}^{(h)} \right)^2}{2 (\sigma^{(h)})^2} \right]. $$
Still, this constitutes a linear model since \( y (\boldsymbol{x}, \boldsymbol{\theta}) \) depends linearly on the parameters \( \boldsymbol{\theta} \).
The inference of model parameters should be a well-known problem by now. We state it in terms of Bayes theorem $$ p \left( \boldsymbol{\theta} | \boldsymbol{t}_N, \boldsymbol{X}_N \right) = \frac{ p \left( \boldsymbol{t}_N | \boldsymbol{\theta}, \boldsymbol{X}_N \right) p \left( \boldsymbol{\theta} \right)}{p \left( \boldsymbol{t}_N | \boldsymbol{X}_N \right)} $$
Having solved this inference problem (e.g. by linear regression) a prediction can be made through marginalization $$ p\left( t^{(N+1)} | \boldsymbol{t}_N, \boldsymbol{X}_{N}, \boldsymbol{x}^{(N+1)} \right) = \int d^H \boldsymbol{\theta} p\left( t^{(N+1)} | \boldsymbol{\theta}, \boldsymbol{x}^{(N+1)} \right) p \left( \boldsymbol{\theta} | \boldsymbol{t}_N, \boldsymbol{X}_N \right). $$ Here it is important to note that the final answer does not make any explicit reference to our parametric representation of the unknown function \( y(\boldsymbol{x}) \).
Assuming that we have a fixed set of basis functions and Gaussian prior distributions (with zero mean) on the weights \( \boldsymbol{\theta} \) we will show that:
If \( X \) and \( Y \) are independent random variables that are normally distributed (and therefore also jointly so), then their sum is also normally distributed. i.e., \( Z=X+Y \) is normally distributed with its mean being the sum of the two means, and its variance being the sum of the two variances.
Consider the linear model and define the \( N \times H \) design matrix \( \boldsymbol{R} \) with elements $$ R_{nh} \equiv \phi^{(h)} \left( \boldsymbol{x}^{(n)} \right). $$
Then \( \boldsymbol{y}_N = \boldsymbol{R} \boldsymbol{\theta} \) is the vector of model predictions, i.e. $$ y^{(n)} = \sum_{h=1}^H R_{nh} \boldsymbol{\theta^{(h)}}. $$
Assume that we have a Gaussian prior for the linear model weights \( \boldsymbol{\theta} \) with zero mean and a diagonal covariance matrix $$ p(\boldsymbol{\theta}) = \mathcal{N} \left( \boldsymbol{\theta}; 0, \sigma_\theta^2 \boldsymbol{I} \right). $$
Now, since \( y \) is a linear function of \( \boldsymbol{\theta} \), it is also Gaussian distributed with mean zero. Its covariance matrix becomes $$ \boldsymbol{Q} = \langle \boldsymbol{y} \boldsymbol{y}^T \rangle = \langle \boldsymbol{R} \boldsymbol{\theta} \boldsymbol{\theta}^T \boldsymbol{R}^T \rangle = \sigma_\theta^2 \boldsymbol{R} \boldsymbol{R}^T, $$ which implies that $$ p(\boldsymbol{y}) = \mathcal{N} \left( \boldsymbol{y}; 0, \sigma_\theta^2 \boldsymbol{R} \boldsymbol{R}^T \right). $$ This will be true for any set of points \( \boldsymbol{X}_N \); which is the defining property of a Gaussian process.
In fact, we don't really need the basis functions and their parameters anymore. The influence of these appear only in the covariance matrix that describes the distribution of the targets, which is our key object. We can replace the parametric model altogether with a covariance function \( C( \boldsymbol{x}, \boldsymbol{x}' ) \) which generates the elements of the covariance matrix $$ Q_{nn'} = C \left( \boldsymbol{x}^{(n)}, \boldsymbol{x}^{(n')} \right), $$ for any set of points \( \left\{ \boldsymbol{x}^{(n)} \right\}_{n=1}^N \).
Note, however, that \( \boldsymbol{Q} \) must be positive-definite. This constrains the set of valid covariance functions.
Once we have defined a covariance function, the covariance matrix for the target values will be given by $$ C_{nn'} = C \left( \boldsymbol{x}^{(n)}, \boldsymbol{x}^{(n')} \right) + \sigma_\nu^2 \delta_{nn'}. $$
A wide range of different covariance contributions can be constructed. These standard covariance functions are typically parametrized with hyperparameters \( \boldsymbol{\alpha} \) so that $$ C_{nn'} = C \left( \boldsymbol{x}^{(n)}, \boldsymbol{x}^{(n')}, \boldsymbol{\alpha} \right) + \delta_{nn'} \Delta \left( \boldsymbol{x}^{(n)}; \boldsymbol{\alpha} \right), $$ where \( \Delta \) is usually included as a flexible noise model.
A very standard kernel is the RBF (also known as Exponentiated Quadratic or Gaussian kernel) which is differentiable infinitely many times (hence, very smooth), $$ C_\mathrm{RBF}(\mathbf{x},\mathbf{x}'; \boldsymbol{\alpha}) = \alpha_0 + \alpha_1 \exp \left[ -\frac{1}{2} \sum_{i=1}^I \frac{(x_{i} - x_{i}')^2}{r_i^2} \right] $$ where \( I \) denotes the dimensionality of the input space. The hyperparameters are: \( \{ \alpha_0, \alpha_1, \vec{r} \} \). Sometimes, a single correlation length \( r \) is used.
The joint density is $$ p \left( t^{(N+1)}, \boldsymbol{t}_N \right) = p \left( t^{(N+1)} | \boldsymbol{t}_N \right) p \left( \boldsymbol{t}_N \right) \quad \Rightarrow \quad p \left( t^{(N+1)} | \boldsymbol{t}_N \right) = \frac{p \left( t^{(N+1)}, \boldsymbol{t}_N \right)}{p \left( \boldsymbol{t}_N \right) }. $$
Since both \( p \left( t^{(N+1)}, \boldsymbol{t}_N \right) \) and \( p \left( \boldsymbol{t}_N \right) \) are Gaussian distributions, then the conditional distribution, obtained by the ratio, must also be a Gaussian. Let us use the notation \( \boldsymbol{C}_{N+1} \) for the \( (N+1) \times (N+1) \) covariance matrix for \( \boldsymbol{t}_{N+1} = \left( \boldsymbol{t}_N, t^{(N+1)} \right) \). This implies that $$ p \left( t^{(N+1)} | \boldsymbol{t}_N \right) \propto \exp \left[ -\frac{1}{2} \left( \boldsymbol{t}_N, t^{(N+1)} \right) \boldsymbol{C}_{N+1}^{-1} \begin{pmatrix} \boldsymbol{t}_N \\ t^{(N+1)} \end{pmatrix} \right] $$
The prediction of the (Gaussian) pdf for \( t^{(N+1)} \) requires an inversion of the covariance matrix \( \boldsymbol{C}_{N+1}^{-1} \).
We can use the partitioned inverse equations (Barnett, 1979) to rewrite \( \boldsymbol{C}_{N+1}^{-1} \) in terms of \( \boldsymbol{C}_{N}^{-1} \) and \( \boldsymbol{C}_{N} \) as follows $$ \boldsymbol{C}_{N+1}^{-1} = \begin{pmatrix} \boldsymbol{M}_N & \boldsymbol{m} \\ \boldsymbol{m}^T & \mu \end{pmatrix}, $$ where $$ \begin{align*} \mu &= \left( \kappa - \boldsymbol{k}^T \boldsymbol{C}_N^{-1} \boldsymbol{k} \right)^{-1} \\ \boldsymbol{m} &= -\mu \boldsymbol{C}_N^{-1} \boldsymbol{k} \\ \boldsymbol{M}_N &= \boldsymbol{C}_N^{-1} + \frac{1}{\mu} \boldsymbol{m} \boldsymbol{m}^T. \end{align*} $$
What are the dimensions of the different blocks? Check that the answer.
This implies that we can make a prediction for the Gaussian pdf of \( t^{(N+1)} \) (meaning that we predict its value with an associated uncertainty) for an \( N^3 \) computational cost (the inversion of an \( N \times N \) matrix).
The prediction for \( t^{(N+1)} \) is a Gaussian $$ p \left( t^{(N+1)} | \boldsymbol{t}_N \right) = \frac{1}{Z} \exp \left[ -\frac{\left( t^{(N+1)} - \hat{t}^{(N+1)} \right)^2}{2 \sigma_{\hat{t}_{N+1}}^2} \right] $$ with $$ \begin{align*} \mathrm{mean:} & \quad \hat{t}^{(N+1)} = \boldsymbol{k}^T \boldsymbol{C}_N^{-1} \boldsymbol{t}_N \\ \mathrm{variance:} & \quad \sigma_{\hat{t}_{N+1}}^2 = \kappa - \boldsymbol{k}^T \boldsymbol{C}_N^{-1} \boldsymbol{k}. \end{align*} $$
In fact, since the prediction only depends on the \( N \) available data we might as well predict several new target values at once. Consider \( \boldsymbol{t}_M = \{ t^{(N+i)} \}_{i=1}^M \) so that $$ \boldsymbol{C}_{N+M} = \begin{pmatrix} \boldsymbol{C}_N & \boldsymbol{k} \\ \boldsymbol{k}^T & \boldsymbol{\kappa} \end{pmatrix}, $$ where \( \boldsymbol{k} \) is now an \( N \times M \) matrix and \( \boldsymbol{\kappa} \) an \( M \times M \) matrix.
The prediction becomes a multivariate Gaussian $$ p \left( \boldsymbol{t}_{N+M} | \boldsymbol{t}_N \right) = \frac{1}{Z} \exp \left[ -\frac{1}{2} \left( \boldsymbol{t}_M - \hat{\boldsymbol{t}}_M \right)^T \boldsymbol{\Sigma}_M^{-1} \left( \boldsymbol{t}_M - \hat{\boldsymbol{t}}_M \right) \right], $$ where the \( M \times 1 \) mean vector and \( M \times M \) covariance matrix are $$ \begin{align*} \hat{\boldsymbol{t}}_M &= \boldsymbol{k}^T \boldsymbol{C}_N^{-1} \boldsymbol{t}_N \\ \boldsymbol{\Sigma}_M &= \boldsymbol{\kappa} - \boldsymbol{k}^T \boldsymbol{C}_N^{-1} \boldsymbol{k}. \end{align*} $$


This section will include descriptions of and instructions for scripts included in the Nyzo verifier repository.


Thanks to:
- The LibTom project for the great quality C codebase
- The LLVM and Cheerp projects
- Peter Olson + Mathias Bynens + Robert Kieffer + John-David Dalton for the benchmark (took from here)
Wait for the libraries to perform all initializations, then press "Run all benchmarks" to have the benchmarks run by a webWorker that runs on your device.
Here you can find an article discussing what's going on, written by me, Carlo Piovesan.
Big integer benchmarks
Some performance benchmarks for different libraries that do arbitrary precision integer arithmetic. Keep in mind that the results shown here are only a rough estimate of the relative performance and can change significantly from run to run, as well as across different runtime environments.


A terrible plague has taken root in the kingdom. Every day more and more people fall victim to the sickness, and spreading just as fast is the fear. Citizens have barricaded themselves in their homes, too afraid to be on the streets. The king believes the source is the recent increase in the rat population. The pests can be heard in most homes, chewing through the wooden walls and crawling underneath the floorboards. The sewers are their home, and if you accept this mission, into the sewers you will have to descend. Do you accept?


A channel to discuss trading. For useful links and more info click the pinned messages to the right.
100 messages
Before 05-Dec-19 12:00 AM
bpkdasbaum26-Sep-18 03:41 PM
why is it limited to 15 kmd?
That's my point
Nothing about crypto
ComputerGenie 👴👴👴26-Sep-18 03:49 PM
why is it limited to 15 kmd?
For the same reason you ignored my math question:
"because"
And for not much more per, you can strike OTC deals for pretty much however much KMD you can afford to spend
bpkdasbaum26-Sep-18 03:54 PM
@Deleted User Well makes sense, still funny for now though ^^
1
jcooper26-Sep-18 05:00 PM
Anyone in here know where i can get pirates?
passcombo.com 🏴☠🏴26-Sep-18 05:08 PM
@jcooper #pex
jl777c26-Sep-18 05:57 PM
#pirate
ComputerGenie 👴👴👴26-Sep-18 07:09 PM
WTS 50k PIRATE @ 0.04 KMD each(edited)
-------
Separately, @bpkdasbaum, I'm still waiting on you to acknowledge that your math over-inflates the cost of a miner by 2.1x and under-calculates hash by almost 7%
Cryptoon26-Sep-18 07:15 PM
Fire, meet gasoline.
@Cryptoon meet popcorn.
4
ryman11226-Sep-18 09:24 PM
The bands are getting super tight on BTC looks like its gonna explode one way or the other in the next 10 days or so. Thoughts?
ComputerGenie 👴👴👴26-Sep-18 09:26 PM
hopes it implodes
2
ryman11226-Sep-18 11:38 PM
Oh boy
Deleted User27-Sep-18 12:47 AM
Electroneum beating us in marketcap
ComputerGenie 👴👴👴27-Sep-18 01:02 AM
selling 20K PIRATE for 1000KMD
Pm if interested in full amount only
beor27-Sep-18 07:33 AM
WTB Pirate, 20k or more, until 100k
Deleted User27-Sep-18 07:40 AM
Wtb 500,000 pirate at 8200kmd cause bulk discount tings


Otlobly
Products
Users
Manual Order
Checks
Logout
UserName
Edit User
Name
Email
Password
Confirm Password
Room No.
Ext.
Profile Picture
Save
Reset


| CCY | Amount | BTC Equivalent | USD Equivalent | From |
| {{balance.currency}} | {{balance.amount | number:'2'}} | {{balance.btc_equivalent | number:'2'}} | {{balance.usd_equivalent | number:'0'}} | {{detail.account}} ({{detail.amount | number: '0'}}) |
| {{balancesnapshot.summary.BTC.amount | number:'2'}} | {{balancesnapshot.summary.USD.amount | number:'0'}} |
| From | To | Rate |
| {{rate.currency_from}} | {{rate.currency_to}} | {{rate.value | number:'6'}} |


| Package | Description |
|---|---|
| javatools.database |
| Modifier and Type | Field and Description |
|---|---|
protected WordNet.Synset |
WordNet.source
Holds the current source synset for NCA calculi
|
| Modifier and Type | Field and Description |
|---|---|
protected java.util.List<WordNet.Synset> |
WordNet.Synset.downs
Downward connected synsets of this synset
|
protected java.util.Map<java.lang.Integer,WordNet.Synset> |
WordNet.id2synset
Maps ids to synsets (compiled on demand)
|
protected java.util.List<WordNet.Synset> |
WordNet.Synset.ups
Upward connected synsets of this synset
|
java.util.Map<java.lang.String,java.util.List<WordNet.Synset>> |
WordNet.word2synsets
Maps words to synsets
|
| Modifier and Type | Method and Description |
|---|---|
WordNet.Synset |
WordNet.getSynset(int id)
Returns a synset for a given id
|
protected WordNet.Synset |
WordNet.nca(WordNet.Synset destination,
int[] dist,
int d)
Finds the NCA by help of labels
|
WordNet.Synset |
WordNet.nca(WordNet.Synset s1,
WordNet.Synset s2)
Returns the nearest common ancestor of two synsets.
|
WordNet.Synset |
WordNet.nca(WordNet.Synset source,
WordNet.Synset destination,
int[] dist1,
int[] dist2)
Returns the nearest common ancestor of two synsets.
|
WordNet.Synset |
WordNet.synsetFor(java.lang.String word,
java.lang.String otherWord)
Returns the synset that contain two words
|
| Modifier and Type | Method and Description |
|---|---|
java.util.Set<WordNet.Synset> |
WordNet.Synset.ancestors()
Returns the set of ancestors
|
java.util.Set<WordNet.Synset> |
WordNet.Synset.descendants()
Returns the set of descendants
|
java.util.List<WordNet.Synset> |
WordNet.Synset.getDowns()
Returns the downs.
|
java.util.Map<java.lang.Integer,WordNet.Synset> |
WordNet.getId2SynsetMap()
Returns the map from ids to synsets
|
java.util.Collection<WordNet.Synset> |
WordNet.getSynsets()
Compiles the set of all Synsets
|
java.util.List<WordNet.Synset> |
WordNet.Synset.getUps()
Returns the ups.
|
java.util.List<WordNet.Synset> |
WordNet.synsetsFor(java.lang.String s)
Returns the list of synsets that contain a word
|
| Modifier and Type | Method and Description |
|---|---|
int |
WordNet.ancestor(WordNet.Synset s1,
WordNet.Synset s2)
Returns the distance in the hierarchy upwards from the first node to the second, -1 in case of failure
|
int |
WordNet.Synset.compareTo(WordNet.Synset o)
Sorts synsets by id
|
int |
WordNet.distance(WordNet.Synset s1,
WordNet.Synset s2)
Returns the length of s1->NCA->s2, -1 in case of failure
|
protected WordNet.Synset |
WordNet.nca(WordNet.Synset destination,
int[] dist,
int d)
Finds the NCA by help of labels
|
WordNet.Synset |
WordNet.nca(WordNet.Synset s1,
WordNet.Synset s2)
Returns the nearest common ancestor of two synsets.
|
WordNet.Synset |
WordNet.nca(WordNet.Synset source,
WordNet.Synset destination,
int[] dist1,
int[] dist2)
Returns the nearest common ancestor of two synsets.
|
void |
WordNet.remove(WordNet.Synset s)
Removes a synset
|
protected void |
WordNet.setSource(WordNet.Synset start)
Sets the source for an NCA or distance calculus
|
protected void |
WordNet.setSource(WordNet.Synset start,
int dist)
Labels all up's of a synset with their distance from start
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
WordNet.Synset.ancestors(java.util.Set<WordNet.Synset> set)
Returns the set of ancestors of a Synset
|
protected void |
WordNet.Synset.descendants(java.util.Set<WordNet.Synset> set)
Returns the set of ancestors of a Synset
|


The last word on remittances
Sir, – Bernard Shaw had the last word on remittances (Diarmaid Ferriter and Ruadhán Mac Cormaic, Opinion, November 16th), as he did on many topics of timeless interest, more than 100 years ago: “The money that Ireland has accepted from America without shame, and without perceptible gratitude, both in domestic remittances and political subscriptions, is incalculable. We are the champion mendicants of the world . . .”
I believe Mr Shaw was mistaken that remittances from the Irish diaspora were received “without perceptible gratitude” but he was surely close to the mark in estimating that the importance of remittances in sustaining poor Irish families was nearly incalculable.
To be sure, not all emigrants could be relied upon to remember those who remained in Ireland.
There were surely real-world examples of the apocryphal son who wrote to his parents after securing employment in America, “I was going to send you 10 dollars, but I have already sealed the envelope.” – Yours, etc,
PATRICK PURCELL,
Maryland, US.


We're close to releasing the new design of ocaml.org but need help from the OCaml community to identify and fix bugs before we switch next week.
Ashish, Christophe, Philippe and I have been discussing how we should go about this and below is the plan for migration. If anyone would like to discuss any of this, then the infrastructure list is the best place to do so.
We've made a new branch on the main ocaml.org repository with the redesign. This branch is a fork of the master and we've simply cleaned up and replayed our git commits there.
We've built a live version of the new site, which is visible at http://preview.ocaml.org - this is rebuilt every few minutes from the branch mentioned above.
Over the course of one week, we ask the community to review the new site and report any bugs or problems on the issue tracker. We triage those bugs to identify any blockers and work on those first. This is the phase we'll be in from today.
After one week (7 days), and after blocking bugs have been fixed, we merge the redesign branch into the master branch. This would effectively present the new site to the world.
During the above, we would not be able to accept any new pull requests on the master branch but would be happy to accept them on the new, redesign branch. Hence, restricting the time frame to one week.
Please note that the above is only intended to merge the design and toolchain for the new site. Specifically, we've created new landing pages, have new style sheets and have restructured the site's contents as well as made some new libraries (OMD and MPP). The new toolchain means people can write files in markdown, which makes contributing content a lot easier.
Since the files are on GitHub, people don't even need to clone the site locally to make simple edits (or even add new pages). Just click the 'Edit this page' link in the footer to be taken to the right file in the repository and GitHub's editing and pull request features will allow you to make changes and submit updates, all from within your browser (see the GitHub Article for details).
There is still work to be done on adding new features but the above changes are already a great improvement to the site and are ready to be reviewed by the OCaml community and merged.


Methods
| Modifier and Type |
Method and Description |
GdlRule |
rename(GdlRule rule) |
GdlSentence |
rename(GdlSentence sentence) |
private GdlConstant |
renameConstant(GdlConstant constant,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlDistinct |
renameDistinct(GdlDistinct distinct,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlFunction |
renameFunction(GdlFunction function,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlLiteral |
renameLiteral(GdlLiteral literal,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlNot |
renameNot(GdlNot not,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlOr |
renameOr(GdlOr or,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlProposition |
renameProposition(GdlProposition proposition,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlRelation |
renameRelation(GdlRelation relation,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlRule |
renameRule(GdlRule rule,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlSentence |
renameSentence(GdlSentence sentence,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlTerm |
renameTerm(GdlTerm term,
java.util.Map<GdlVariable,GdlVariable> renamings) |
private GdlVariable |
renameVariable(GdlVariable variable,
java.util.Map<GdlVariable,GdlVariable> renamings) |


{% extends "base.html" %} {% block css %} {% endblock %} {% block body %} SEATTLE, USA Starting at $117 per night Book now LONDON, UK Starting at $117 per night Book now SINGAPORE CITY, SINGAPORE Starting at $101 per night Book now Secure your best deals, now! Destination Date to Search {% if not is_authenticated %} Log in to save your searches {% endif %} {% endblock %} {% block js %} {% endblock %}
Starting at $117 per night
Starting at $101 per night


Student
Kingston, TN
<EMAIL_ADDRESS>865-466-1180
Skills
- Industrial and Systems Engineering
- Quality Engineering
- Reliability Engineering
- Communication using the Spanish language
- Industrial Safety
- Supply Chain Optomization Solutions
Resumé
Current Intern at Kingston Fossil Plant.
While interning with TVA I gained vast knowledge in coal, hydro, wind, solar, and nuclear energy production. During the summer I assisted and managed a multitude of projects including: The gypsum dewatering chlorine removal project, Arc Flash safety technology installation, and reaction mercury evation solutions.
- Pilot Flying J cashier 2016 - 2018
- Drone Videographer 2015 - 2016.Bachelor Degree in Industrial Engineering
University of Tennessee Industrial Engineering Department Page University of Tennessee Home Page


Regex Validators for Strings
Username
- starts with alphanumeric character
- has a min-length of 3 and max-length of 30
- can contain '.-_ ' except as first character
Password is complex
- contains at least one alphabetic character
- contains at least one digit or a non-alphabetic character
- is beetween 5 and 50 characters long
- can contain anything else if rules 1-3 apply
Email is valid
Returns true if email matches pattern<EMAIL_ADDRESS>where:
- x, y: alphabetic characters, numbers and characters
- z: only alphabetic characters, min-length is 2
Regex Validators for Numbers
Date ISO/DIN
- matches iso format, i.e. 2015-08-30
- matches german DIN, i.e. 30.08.2015
Time
- matches 24h format, i.e. 18:15, 2:00 etc.
- matches 12h format, i.e. 6:15pm, 12:00am etc
Copyright Jan Suwart, MIT license


Search
Search
Select the distance between event and asset (km):
Start tracking hits close to barclays Assets:
Track
Retain hits of interest over time:
Retain Hits
Time:
Mutiple select list (hold shift to select more than one):


Sub Board I, Inc.
- Student Medical Insurance - Box Office - Off Campus Housing - Legal Assistance - Safety Service
- Health & Safety Services - Pharmacy - Student Government Accounting - Radio - Gaming - Dry Cleaning
Sub-Board I, Inc. is a non-for-profit corporation, founded by U.B. students in 1970, designed to enhance the quality of student life at U.B.


Ocean [am11], ocean, in The Outer Sea ------------------------------------------------------------------------ Routes leaving Ocean: North, plain, to Herberon Fields [al11], Mandoria, 2 days East, to Ocean [am12], 6 days South, to Ocean [an11], 6 days West, to Ocean [am10], 6 days


About
Work
Résumé
Scrapbook
Mentoring
Menu
Hi 👋🏼, I'm Dumebi,
Head of Design at
Stears
.
I am a Design leader and mentor.
I was previously Head of Design at Big Cabal Media and an Art Director at Webcoupers and Isobar.


Gareth Bale Set for First Home Appearance for Real Madrid in 49 Days Despite Wales Controversy
by Ben CarterReal Madrid winger Gareth Bale is set to walk out at the Santiago Bernabéu for the first time in almost two months after being selected in Zinedine Zidane's squad to face Real Sociedad on Saturday.
The Wales international caused quite a stir in the Spanish capital over the last two weeks when he celebrated qualification to Euro 2020 alongside a 'Wales. Golf. Madrid' flag - a dig at Los Blancos for their treatment of the 30-year-old.
Even though Bale's celebrations didn't sit well with the decision-makers at Real Madrid, Marca confirm that manager Zidane has selected the former Tottenham Hotspur forward to be part of the squad this weekend.
Bale's even been selected ahead of Vinícius Júnior, who has lost his place on the left side to 18-year-old summer signing Rodrygo.
Although there is an obvious anger surrounding Bale's actions with Wales at Real Madrid, Zidane actually appears to be in the player's corner and called on fans to support the forward when he returns this weekend.
"There’s been a lot of noise about what he did but we need to just focus on football. It’s all got a bit too much," he said. "I’m just looking at what he can give us on the pitch, not what’s said off it, that doesn’t interest me.
"I believe he can become a decisive player for us again. He’s an important player when he is injury-free; he’s shown that before and he will show it again.
"When you see what he’s given to the club and to the fans, those who feel our colours and come to the stadium, you can see he’s one of our own and the fans need to get behind him."
Elsewhere for Real Madrid, Nacho Fernández, Lucas Vázquez, James Rodríguez and Marco Asensio will all be absent on Saturday due to injury.
For more from Ben Carter , follow him on Twitter !


|
|
|
@857
|
3 months |
mmckerns |
nudging to klepto-0.1.2
|
|
|
|
@856
|
3 months |
mmckerns |
|
|
|
|
@855
|
5 months |
mmckerns |
updated copyright to 2016
|
|
|
|
@814
|
10 months |
mmckerns |
nudging support to dill-0.2.4; add missing methods to all in constraints
|
|
|
|
@798
|
11 months |
mmckerns |
bumping version dependency to dill-0.2.3
|
|
|
|
@780
|
16 months |
mmckerns |
use 'dev0' to be more PEP440 compliant
|
|
|
|
@776
|
17 months |
mmckerns |
copyright updated to 2015; added to examples2
|
|
|
|
@774
|
17 months |
mmckerns |
ticking up versions for dill depends
|
|
|
|
@753
|
20 months |
mmckerns |
remove upper bound on sympy version; bugfix: import dill in forward_model
|
|
|
|
@746
|
22 months |
mmckerns |
move model_plotter from example to script
|
|
|
|
@721
|
22 months |
mmckerns |
use seterr to ignore warnings in constraints solver and wrap_bounds
fix: …
|
|
|
|
@720
|
2 years |
mmckerns |
set sympy version max at 0.7.3 as 0.7.4 seems to have ufunc wrapping bug
|
|
|
|
@719
|
2 years |
mmckerns |
bumping dill and klepto version numbers
|
|
|
|
@718
|
2 years |
mmckerns |
fix: typo in setup.py
|
|
|
|
@717
|
2 years |
mmckerns |
updated to klepto-0.1
|
|
|
|
@716
|
2 years |
mmckerns |
updating mystic to dill-0.2
|
|
|
|
@715
|
2 years |
mmckerns |
renamed 'nested' solvers as 'ensemble' solvers
|
|
|
|
@713
|
2 years |
mmckerns |
added license and copyright to each file
|
|
|
|
@711
|
2 years |
mmckerns |
updated LICENSE/Copyright for 2014; sync'ed version numbering across …
|
|
|
|
@706
|
3 years |
mmckerns |
moved mystic.cache to new subpackage klepto; updated LICENSE file
|
|
|
|
@681
|
3 years |
mmckerns |
|
|
|
|
@670
|
3 years |
mmckerns |
fix: created module to correct import of cache.safe cache.archives …
|
|
|
|
@648
|
3 years |
mmckerns |
can now serialize solvers; added SaveSolver? method, LoadSolver? function; …
|
|
|
|
@647
|
3 years |
mmckerns |
simplify use of mystic.info for version control
|
|
|
|
@569
|
4 years |
mmckerns |
merge of dirac_measure plus compressed, paramtrans, and legacydata to …
|
|
|
|
@530
|
4 years |
mmckerns |
enable better versioning in setup.py init.py; add setup.cfg;
autogenerate …
|
|
|
|
@475
|
5 years |
mmckerns |
better interface to hypercube and convergence plotter scripts (tickets …
|
|
|
|
@427
|
6 years |
mmckerns |
initial import of Alta's constraints toolbox. Needs improvement and some …
|
|
|
|
@374
|
6 years |
mmckerns |
moved multilogger code to scripts;
log_reader can stop at desired …
|
|
|
|
@335
|
6 years |
mmckerns |
increment trunk to 0.2a2.dev; cleaned by-file copyright, added Alta Fang
|
|
|
|
@243
|
6 years |
mmckerns |
again fixing so epydoc and setup.py are happy with "mystic.math"
|
|
|
|
@241
|
6 years |
mmckerns |
epydoc barfs at mystic.math, so moving to mystic/math
|
|
|
|
@240
|
6 years |
mmckerns |
tag for the mystic-0.2a1 release
|
|
|
|
@236
|
6 years |
mmckerns |
created "math" subdirectory, migrated "grid" and "poly" tools
|
|
|
|
@145
|
7 years |
mmckerns |
removed "pre-alpha" status indicator
|
|
|
|
@143
|
7 years |
mmckerns |
fixed formatting for epydoc
|
|
|
|
@134
|
7 years |
mmckerns |
patched easy_install problem for matplotlib (see ticket #56)
|
|
|
|
@129
|
7 years |
mmckerns |
added releases branch;
added a bit more doc to example12;
modified …
|
|
|
|
@125
|
7 years |
mmckerns |
added authors, license, copyright, and etc information
|
|
|
|
@124
|
7 years |
mmckerns |
coerce source to mostly play nice with epydoc;
added epydoc config file
|
|
|
|
@89
|
7 years |
mmckerns |
restructured top-level to have trunk for mystic & pyina (also branches)
|
|
copied from branches/merge-pyina-at-r87/trunk/mystic/setup.py:
|
|
|
|
@88
|
7 years |
mmckerns |
added branch that merges mystic/trunk and branches/pyina at r87;
reduced …
|


--- layout: static1 title: Contact permalink: /contact --- Daniel Padgett, PhD LMS Training Lead US Air Force Academy 2345 Fairchild Dr Colorado Springs, CO 80840 daniel.padgett.ctr [at] usafa.edu danpadgett01 [at] gmail.com


You are running the brand new NuCache!
NuCache is working. NuCache says: {{vm.status}}
This lets you refresh the status, or collect snapshots (after running a CLR GC).
This lets you rebuild the database cache (status above), ie the content of the cmsContentNu table. Rebuilding can be expensive.
This lets you reload the in-memory and local file cache by entirely reloading it from the data in the cmsContentNu table, but it does not rebuild that table. This is relatively fast. Triggers the reload on all servers in an LB environment.


FULL METAL JACKET (Spoilers) A film review by Stuart Cracraft Copyright 1987 Stuart Cracraft
FULL METAL JACKET is a disappointment. After a rabble-rousing first 5-10 minutes, the absurdly funny drill sergeant becomes repetitive and boring. The portrayal of a young, overweight recruit's difficulty in fitting in is interesting at first, but by the time all his comrades beat him senseless with towels-wrapped-with-soap, it becomes quite clear what Kubrick is trying to tell us about life and people. This viewpoint is strongly echoed in the last few minutes of the film (see below).
The fat recruit goes nuts (who blames him?), and drills his drill sergeant with a .22 caliber, and then drills himself. What do we learn?  Is this surprising or revealing of human nature?
The critical scene in this movie occurs in a large, abandoned structure which hides a sniper. The sniper gradually picks off the platoon's members one-by-one as they enter. Finally ensnared, the sniper reveals herself as a pretty, young Vietnamese girl, who begs the platoon members to kill her. The young Vietnamese girl I saw this movie with commented: "They show all the bad things about Vietnam, and little of the good."
Kubrick's vision of war and humanity is certainly strongly anti-war, but as usual with Kubrick, it may be anti-human too. Kubrick has never directed people well, save for LOLITA and the movies before it.  If Kubrick could once portray an individual showing the self-same responsibility that Kubrick himself shows in molding his own movies to perfection, then we would know what the heights of human endeavor could achieve. We await such a character in Kubrick's movies.
Stuart Cracraft
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


On the drive to work earlier this week, I noticed the great early morning light falling on the church in Lullington - a village I drive through. This morning, I noticed snow drops starting to appear. I often carry my camera in the car boot, so I decided to park up, get the camera out and rattle off a hundred snaps or so.
[caption id=”attachment_165” align=”aligncenter” width=”300” caption=”All Saint's Church, Lullington, Derbyshire”][/caption]
I have enjoyed some architectural photography recently, but I was disappointed at this mornings attempts with the church. I struggled to get far enough away to get the church in context and the pics came out a little shallow. I also failed to capture the great light, but maybe next time…. Also, the sky was perfect blue - a little bland so I will try shooting again with an interesting cloud backdrop.
[caption id=”attachment_166” align=”aligncenter” width=”300” caption=”A snow drop in the church yard”][/caption]
Instead, I had a play with some flower shots and quite liked the results for the small amount of time invested. I am now getting to grips with depth of field, and in particular how I could get bokeh effects at smaller apertures than I originally thought.
[caption id=”attachment_167” align=”aligncenter” width=”300” caption=”A lone crocus in a field of snow drops”][/caption]
Anyhow, an enjoyable drive to work, and was a little disappointed that on the drive home, I saw a buzzard sitting on a fence next to the road. I would have stopped to get some pictures at close range, but the road had no parking cones due to the Basra Memorial Wall opening at the National Memorial Arboretum.