Resume
Employment History
Junior Software Engineer - NextDocs Corporation
January 2013 - November 2013
-
Worked with SCRUM Team to Migrate NextDocs System from a Nintex Based Workflow System to a NextDocs Distributed WCF Architecture
-
Implemented Scalable and Modular CSS pattern (SMACSS) to quickly migrate legacy UI branding to modern NextDocs standard with a Responsive Grid Layout for SharePoint 2010
-
Managed the Automated .MSI Packaging with Flexera Installshield 2010
-
With Help from Senior Developers, Founded a new Decoupled Architecture reduce dependency on SharePoint 2010 and add Support for JQuery/AngularJS and Asp.Net WebApi
Support Engineer Intern - NextDocs Corporation
May 2012 – September 2012
-
Developed a Server Farm Health Reporting App
-
Utilized a Centralized Database to Store Recurring System Health and Analytics
-
Developed a plugin interface to allow new developers to quickly add and validate new farm tests
-
Created an Easy to Use Portal to Present and Troubleshoot Problems Across the Server Farm with Twitter Bootstrap, JQuery, and ASP.NET Web Forms
Computer Science Tutor - Kutztown University
May 2012 – September 2012
-
Met Up With Students on a Weekly/Biweekly Basis for Supplemental Instruction
-
Offered Support to Students in Object Oriented Programming Methodologies and Pointer Based Syntax in C++
-
Helped Students Prepare for/Review for Tests as well as Debug Project to Help Them Succeed in Their Classes
Projects
Dungeon Resource - Dungeons and Dragons references right at your fingertips.
July 2013
Dungeons and Dragons Spell Repository with a User Friendly Front End. ASP.NET MVC4 Web Application with a NoSQL (RavenDB) Database. Follows the SOLID Principle Combined with DDD Architecture to Offer Excellent Unit Testability and Decoupling.
Kutztown University iVote
Spring 2012
Project Lead for Six Other Students to Develop a ASP.NET Web Forms Voting System for the APSCUF Union at Kutztown University. In Addition to Serving as Project Lead, I also handled the Management the SVN Repository, MySql Database Hosting, IIS6 Web Hosting, and UML based documentation.
Languages and Technologies
-
C#, ASP.NET Web forms, ASP.NET MVC4, Web API
-
HTML5, CSS3, Javascript, JQuery, KnockoutJs, JsRender, AngularJs
-
T-SQL, ADO.NET Stored Procedures, NHibernate, RavenDB, MongoDB
-
Visual Studio 2010/2012, TFS 2010, GitHub, Microsoft SQL Server 2008
Education
Kutztown University
Fall 2009 – December 2012
-
Bachelors of Science in Computer Science
-
Relevant Coursework – Software Engineering, Data Structures I, Data Structures II, Computational Organization and Assembly Language
Events
-
Penn Apps 2013 Spring Mentor
-
Regular Microsoft Philly.NET Attendee


Water board announces VDS
by Special CorrespondentThe Hyderabad Metropolitan Water Supply and Sewerage Board (HMWS&SB) has announced voluntary disclosure scheme (VDS) for getting illegal drinking water connections regularised.
The scheme will commence on November 22, and continue for 90 days up to February 21, 2020.
According to the scheme, the connections may be regularised merely through payment of connection charges, and one month’s water bill. Earlier, to get an illegal connection regularised, one had to pay three years’ water bills and double the connection charges.
After the 90-day period, the same charges would be applicable, in addition to ₹300 service charge, a press statement said.
Of the 472 million gallons drinking water the board is supplying, 37 per cent was being wasted for different reasons, resulting in loss of revenue for the board, which was spending ₹47 for every 100 litres to bring water from Krishna and Godavari rivers located 200 kms away from the city, the statement said.
Monthly loss incurred by the water board for such reasons was put at ₹20 crore.
Those who wish to avail themselves of the scheme may contact their nearest HMWS&SB office or call the toll-free number 155313.


A Nightmare on Elm Street (1984) *1/2 out of *****
Cast: John Saxon, Ronee Blakley, Heather Langenkamp, Robert Englund, Amanda Wyss, Nick Corri, Johnny Depp, Charles Fleischer, Lin Shaye, Mimi Craven Written and Directed by: Wes Craven Running Time: 91 minutes
My first exposure to the Nightmare on Elm Street series of films was not this one, but in fact the third installment (it was the first to gain a national theatrical release). I didn't see the first film until much later. So looking back, the original didn't hold a lot of great memories for me, since I didn't think too much of it when I initially saw it. Watching it now for a second time confirmed that it's an overrated horror film that ultimately makes no sense whatsoever.
 This first installment does an adequate job with it's low budget, but there's some absurd dialogue and conceptual problems with the story. Plus the movie's ending (understandably the result of the studio wanting the end of the film to have a "hook" for a sequel) renders the rest of the film pointless. And does anyone understand what happens to Nancy's mother at the end of this film?
Don't get me wrong though... it's not as if a new generation of horror films have spurned me away from the classics. Most horror movies released today are just as inane as this film is. Horror is a difficult genre to pull off credibly, and A Nightmare on Elm Street just doesn't cut it.
A Nightmare on Elm Street is available on DVD from New Line Home Video. It is available both as a single disc and as part of the Nightmare on Elm Street Collection box set. The film is presented in both pan and scan and it's original theatrical aspect ratio of 1.78:1 (although on the disc that comes in the box set, only a widescreen transfer is provided). The film has been digitally remastered and includes two options for audio: a mono mix and a new Dolby Digital 5.1 mix. Also included on the DVD is a full-length audio commentary track with writer/director Wes Craven, stars John Saxon and Heather Langenkamp, and the film's director of photography. Other extras include the "Jump to a Nightmare" feature (I'm sure you can figure that one out), the usual cast and crew bios (which are from the film's original press release kit, and notably leave out Robert Englund and Johnny Depp!), and the film's original theatrical trailer. Some DVD-ROM features are also included, but since I don't have DVD-ROM capabilities I can't really get into that.
The commentary track is entertaining and informative, but nothing spectacular. The first thing of note is that it's the same commentary track that was on the special edition laserdisc from a few years ago. I'm not saying that's a negative thing, just pointing it out. Everyone seems enthusiastic about being there, with the possible exception of John Saxon, who just doesn't say much at all. Most of the time you'll forget he's even there. Everyone else talks really quietly though for some reason, as if because they're commenting on a scary movie that they need to stay as quiet as possible.
The bonus disc with the boxed set called The Nightmare Series Encyclopedia features about 45 minutes worth of interviews relating to the first film of the series. Also included is the original theatrical trailer and two alternate endings to the film... however you can only access one easily. The other is hidden in what's called "the labyrinth", which might possibly be the most annoying feature of a DVD ever created. Basically, it's an interactive game of sorts where you wander through different Nightmare locations looking at objects which give you access to extra little snippets of footage, interviews, etc. Somewhere in the labyrinth is the second alternate ending to the film. Finding it though is both a chore and a bore. [R]
The Jacksonville Film Journal URL:http://users.southeast.net/~chuckd21/<EMAIL_ADDRESS>© 1999 of The Jacksonville Film Journal. No reviews may be reprinted without permission.
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


|
|
-
Problems Solved
in Pascal, Blue Publishing House, Cluj-Napoca, 150 pages, 1995 (in romanian).
-
Solving problems using Turbo Pascal,
Computer Libris Agora, Cluj-Napoca, 140 pages, 1996 (in romanian).
-
Mathematical games programming,
Blue Publishing House, 150 pages, 1996 (in romanian).
-
C++Builder in applications, Blue
Publishing House, Cluj-Napoca, 400 pages, 1998 (in romanian).
-
Advanced programming in Delphi,
Blue Publishing House, Cluj-Napoca, 350 pages, 1999 (in romanian).
-
Algorithms, Design and Implementation,
Computer Libris Agora, Cluj-Napoca, 300 pages, 2000 (in romanian).
-
Programming with C++Builder, Blue
Publishing House, Cluj-Napoca, 400 pages, 2001 (in romanian).
-
Delphi 7 in 200 Applications, Blue
Publishing House, Cluj-Napoca, 450 pages, 2004 (in romanian).
|
|


There are several ways to filter replays based on player properties using different
Filter by Groups
. These can be
combined
arbitrarily.
[Any Player]Name='Dakota' AND [Any Player]APM>50
Example #2: Replays that have a player Dakota who has more than 50 APM:
[Player A]Name='Dakota' AND [Player A]APM>50
Example #3: Replays that have a player Dakota and have a different player with more than 50 APM:
[Player A]Name='Dakota' AND [Player B]APM>50
Example #4: Replays that have a player Dakota and have a different player with more than 50 APM and have a Protoss player (could be anyone):
[Player A]Name='Dakota' AND [Player B]APM>50 AND [Any Player]Race=Protoss
Example #5: Replays where the players have greather than 50 APM average and all players reached level 90:
[Players Avg]Average APM>50 AND [All Players]Levels≥90


Alle Isn't it? Used for negative framing in a question.  Seattle-il alle thaamasikkunne?


No matter what stage you are in— from startup to enterprise— AT Computers has a solution. Whether you're looking for end-to-end digital product services or augmenting your existing team, AT Computers has the capabilities to customize a solution that fits your needs.


...
...
Please support my Kickstarter so that I can get rid of the Deeplearnjs web pages and videos and replace them
with new Tensorflowjs webpages and videos.
This Kickstarter is only live until Friday midnight May 18th
https://www.kickstarter.com/projects/rocksetta/as-simple-as-possible-deep-learning-tensorflowjs-j


In a previous article of this series we’ve studied Programming Language Parsers and answered the basic question: what are they?
We learnt that:
Parsers are algorithms that decide whether or not a source code is correct with respect to the rules of a Grammar. Parsers get in input the list of Tokens produced by the Lexical Analysis, and output the yes/no decision, while building in memory a Parse-Tree. And we also learnt what are the main features that distinguish parsers:
[Read More]
How to Design Semantic Analysis
In a previous article in this series, we learnt what is the Semantic Analysis module of a Compiler.
The key points to remember are:
Semantic Analysis is the third step in front-end compilation (after Lexical Analysis and Parsing). It’s meant to catch all errors that weren’t caught by the first two steps. It’s the last step in front-end compilation, so it’s also the last point where a source code can be rejected.
[Read More]
Where Do Compilers Use Finite Automata?
Finite Automata…
Formally, they are computational machines with a finite number of states.
For instance, a digital watch counting only hours and minutes is a finite state machine, because it can only in one out of 1440 states (24 “hour state” times 60 “minute state” for each hour).
A washing machine can be seen as a finite state machine too. It starts in the “Ready” state, then goes onto the “Washing” state, followed by the “Drying” state.
[Read More]
Where Do Compilers Use Regular Expressions?
The first step in a modern compiler is the so-called Lexical Analysis. This is a piece of software that takes the source code in input (i.e., the code that must be compiled) and generates a list of tokens.
The Lexical Analyzer in a Compiler performs two tasks:
Divide the input string (that’s the source code) into its units, such as variables, operators, keywords, etc. These are called lexemes. Assign each lexeme to its actual class.
[Read More]
How to Design Formal Grammars
In a previous article of this series we answered basic questions about Formal Grammars:
What are they? How are they related to Programming Languages? What are they made of? Then, we quickly got a glimpse of more profound questions, such as:
Are all Grammars the same? What differentiates one Grammar from the others? How can we build a new Grammar? I did answer them, but in a brief way.
[Read More]
How Does the Computer Run Code?
This article is positioned between the front-end compilation (to decide whether a source code is correct or not) and the back-end compilation (to generate machine-runnable code and optimization). Before taking the leap, I want to understand the machine’s internal organization, in order to truly grasp what to run code means.
Here’s what I am going to discuss:
Memory organization. Word Alignment. Activation and lifetime of procedures. Understanding Static vs Dynamic A key distinction, that one should really understand deeply, exists between what happens during compilation time, and what happens at runtime.
[Read More]
How To Generate Machine-Runnable Code?
Software developers are usually interested in writing a few thousands lines of code, and then run that code. They rarely ask deeper questions.
In this series of articles, I did ask many deep questions. My objective was to learn about Compilers, Programming Languages and also to create a new programming language, to get hands-on practice.
To summarize, we’ve learnt about:
Formal Grammars. Software modules that make a Compiler. Lexical Analysis, Parsing and Semantic Analysis.
[Read More]
Introduction
Welcome to my self-inflicted course on Compilers, Formal Grammars and Programming Languages!
This is a subject I had been wanting to explore for a long time. It wasn’t taught as part of my BSc in Software Engineering, and my other degrees were about Automation and Optimization, so it fell off the table.
Yet, I felt I could not stand this large missing piece of knowledge for very long. Thus, I gathered the best MOOC and the 2 best books on the arguments and started studying.
[Read More]
What Is Semantic Analysis in a Compiler?
Semantic Analysis is the last step in the front-end compilation. It’s called front-end because it basically is an interface between the source code written by a developer, and the transformation that this code will go through in order to become executable.
In different words, front-end is the stage of the compilation where the source code is checked for errors. There can be lots of different error types, as you certainly know if you’ve written code in any programming language.
[Read More]
What Is a Programming Language Parser?
First of all, a correction:
Parsing algorithms are not made for programming languages; they are made for language Grammars.
A Grammar is a set of rules that specify how you can write characters one after the other in order to form valid sentences (that is, valid for that grammar).
For example, the English grammar tells us that you can put the characters ‘y’, ‘o’, ‘u’ one after the other and form a valid token (the word “you”), and that if you also add the characters ‘ ‘, ‘a’, ‘r’, ‘e’, ‘ ‘, ‘g’, ‘r’, ‘e’, ‘a’, ’t’, you will have made a valid sentence (that is, “you are great”).
[Read More]


Data Management
1. NO FILES!
From user's perspective, jsCoFE operates with data objects, rather than raw
files. There are only 2 points where a user deals with actual files:
(1) importing and (2) exporting data to/from jsCoFE Project. Data objects
correspond to entities that are passed from task to task as a whole. Therefore,
for all tasks, except Data Import, require choice of data objects, rather than
raw files. This is done in form of drop-down selectors, pre-filled with data
objects, relevant to particular task and input field only, which are in the
visibility scope (see below). For example, input filed "
Reflections"
will contain only merged reflection datasets (in this instance, either with
or without anomalous data):
| Figure 1. Input data selector |
|
Data objects have one of pre-defined type and optional sub-types. The following
data objects with optional subtypes are defined in jsCoFE:
| Type |
Description |
Subtypes |
Produced in tasks |
| Unmerged |
Unmerged reflections dataset |
|
Data Import |
| HKL |
Merged and scaled reflections dataset |
anomalous |
Data Import, Data Reduction |
| Symmetry |
A set of compatible space groups, associated with the content of
either Unmerged or HKL dataset. Symmetry object exists only in form of
the reflection dataset meta-data and is created automatically upon
introducing the dataset to the Project. |
|
N/A |
| Sequence |
Macromolecular sequence |
unknown |
Data Import, Simbad, Convert XYZ to Revision |
| ASU |
Content of Asymmetric Unit. This is a combination object, containing
Sequence objects and some derived data, such as stoichiometric coefficients,
an estimate of solvent fraction and Matthews coefficients and
probabilities. ASU object exists only as part of Structure Revision
(see below). |
unknown |
Define ASU, Simbad, Convert XYZ to Revision |
| XYZ |
Macromolecular coordinates |
|
Data Import |
| Ensemble |
Ensemble of macromolecular models, associated with a sequence |
|
Ensemble Preparation from Sequence/XYZ |
| Structure Data |
Crystal structure as a combination of symmetry, macromolecular
coordinates, electron density and phases |
EP, MR, substructure |
Any phasing task, Convert XYZ to Revision |
| Ligand |
Ligand structure with crystallographic restraints for refinement |
|
Make Ligand |
| Structure Revision |
Collection of experimental and derived (computed) data, representing the
currently achieved stage in structure solution process. Subject to
particular stage, Structure Revision may include HKL, ASU, Structure
and Ligand objects. |
hkl, anomalous, asu, phases, xyz, substructure, ligands, waters |
Define ASU, Simbad, Convert XYZ to Revision |
All data typing and naming is done in jsCoFE completely automatically,
and the above table should be used only for reference.
2. Data Object Naming
All data objects are named according to the following template:
[NNNN-MM] name /type/subtype(s)
where:
| |
NNNN | |
Serial number of job, which produced the data object |
| MM | |
Serial number of data object in the job, which produced it |
| name | |
Given name, which can be derived either from the name of related
file imported to the Project, or from program or task name that
created the respective data, or from the output id of
the Job Dialog
|
| type | |
Type of data object (see above) |
| subtype(s) | |
Optional subtypes (see above) |
3. Data Object Visibility
By default, each new job has access to data objects, imported or generated by
all its parent jobs. For example, in the following project:
| Figure 2. Sample project |
|
job [0008] has access to data imported in job [0001], MR model(s) made in job
[0002] and structures produced by jobs [0006] and [0007]. However, job [0008]
cannot (by default) access structures produced by jobs [0003] and [0004] because
they belong to a different branch of job tree.
Most of structure solution process may be represented as a job tree, similar
to one in Figure 2. However, sometimes you may need to use data from different
branches in a subsequent job. For example, you may want to structurally compare
outputs of jobs [0005] and [0008] from Figure 2, using Gesamt software. This can
be done by multiple selection of jobs, outcome of which needs to be used, and
then right-clicking on one of them in order to add the new job through the
dropdown menu:
| Figure 3. Using data for new job from different
branches by multiple job selection |
|
Choosing "Add job" from the dropdown menu will bring up the
Task List Dialog, from which the "Structural
comparison with Gesamt" task can be chosen. The new job will be added as a
child to the right-clicked job ([0008] in the above Figure) and will see only data
produced in jobs selected. Multiple selection is achieved by clicking on
jobs lines with key "Alt" ("Apple" on Mac computers) pressed.
4. Data Objects and Project Branching
Limitation of data visibility along branches of the job tree helps to keep
the content of input data selectors in job dialogs (just like one shown above in
Figure 1) as conscise and relevant as possible. For new jobs, jsCoFE will always
offer initially data settings based on most recenty generated data (in given branch
of the job tree), as well as associated data. For example, a new refinement job
will have, as initial setings, the most recently produced
Structure Data and
reflection dataset (
HKL) used to produce it. However, you can always
change these settings, e.g., in order to refine structure against another
compatible dataset.
It is therefore clear that you want to grow your Project (the job tree) in such
a way that needed data is always in the scope, and you do not have to resort to
breaking the default behaviour by adjusting the data visibility scope with
mutiple job selection. Following these principles will help to keep your projects
in the most logical way, where the structure solution pathway can be easily
identified (as a branch that led to best results).
In order to demonstrate the difference, consider that the rnase project
from Figure 2 could have been developed in a single branch:
| Figure 4. Single-branch project |
|
where jobs [0009], [0010] and [0011] are completely identical to jobs [0006],
[0007] and [0008] in Figure 2. The only advantage of such a linear development
is that all data objects produced ara available for all new jobs, so that you can
compare structures obtained in job [0005] and [0011] without resorting to
multiple job selection. The disadvantage of non-branching is the gradual lose of
clarity of the structure solution process with growing number of trials, as well
as growing inconvenience of dealing with long lists of input data to be chosen
for new tasks. While these disadvantages do not seem to be dramatic in case of
simple short projects like in Figures 2-4, they may become critical in not so
unusual case of projects having 100s of jobs.
jsCoFE does not impose any specific rules for project branching. However, it may
be convenient to branch when you:
- start working with a new crystal / reflection dataset
- start a new route of structure solution (e.g. trying to solve structure
stage-by-stage after a failure of automated solvers)
- try another method of phasing (e.g. EP after MR); however,
do not branch if you are planning a hybrid phasing, such as using
MR phases in combination with those obtained from heavy atom location
- start working with new model for molecular replacement
- change the composition of asymmetric unit
- want to rerun the same job with different input parameters (job cloning)


| Package | Description |
|---|---|
| bayou.file |
Utilities for files.
|
| bayou.form |
Html form handling.
|
| bayou.gzip |
GZIP related utils.
|
| bayou.html |
For building html trees.
|
| bayou.http |
Http server.
|
| bayou.text |
Utilities for texts.
|
| bayou.websocket |
WebSocket server.
|
| Class and Description |
|---|
| HttpEntity
Http entity.
|
| HttpHandler
Generates a response for each http request.
|
| HttpRequest
Http request.
|
| HttpResponseImpl
A mutable implementation of HttpResponse.
|
| Class and Description |
|---|
| CookieJar
For managing cookies in a request-response cycle.
|
| HttpRequest
Http request.
|
| HttpRequestImpl
A mutable implementation of HttpRequest.
|
| Class and Description |
|---|
| HttpEntity
Http entity.
|
| HttpEntityWrapper
A wrapper of HttpEntity.
|
| Class and Description |
|---|
| HttpResponseImpl
A mutable implementation of HttpResponse.
|
| Class and Description |
|---|
| Cookie
Http response cookie.
|
| CookieJar
For managing cookies in a request-response cycle.
|
| CookieStorage
Cookie storage for HttpClient.
|
| HotHttpHandler
Hot-reloadable HttpHandler.
|
| HttpAccess
An entry in http access log.
|
| HttpClient
Http client.
|
| HttpClientConf
Configuration for HttpClient.
|
| HttpClientConnection
Http connection from client's perspective.
|
| HttpEntity
Http entity.
|
| HttpEntityWrapper
A wrapper of HttpEntity.
|
| HttpHandler
Generates a response for each http request.
|
| HttpProxy
Proxy information for HttpClient.
|
| HttpRequest
Http request.
|
| HttpRequestImpl
A mutable implementation of HttpRequest.
|
| HttpResponse
Http response.
|
| HttpResponseImpl
A mutable implementation of HttpResponse.
|
| HttpServerConf
Configuration for HttpServer.
|
| HttpStatus
HTTP response status.
|
| HttpUpgrader
For handling HTTP Upgrade mechanism.
|
| Class and Description |
|---|
| HttpEntity
Http entity.
|
| Class and Description |
|---|
| HttpRequest
Http request.
|
| HttpResponse
Http response.
|
| HttpServer
Http server.
|


Data Fields | |
| long | nx |
| long | ny |
| BDIGIT * | yds |
| BDIGIT * | zds |
| VALUE | stop |
Definition at line 2575 of file bignum.c.
| long big_div_struct::nx |
Definition at line 2576 of file bignum.c.
Referenced by bigdivrem(), and bigdivrem1().
| long big_div_struct::ny |
Definition at line 2576 of file bignum.c.
Referenced by bigdivrem(), and bigdivrem1().
Definition at line 2578 of file bignum.c.
Referenced by bigdivrem(), bigdivrem1(), and rb_big_stop().
| BDIGIT* big_div_struct::yds |
Definition at line 2577 of file bignum.c.
Referenced by bigdivrem(), and bigdivrem1().
| BDIGIT * big_div_struct::zds |
Definition at line 2577 of file bignum.c.
Referenced by big_lshift(), big_rshift(), bigand_int(), bigdivrem(), bigdivrem1(), bigor_int(), bigxor_int(), rb_big_and(), rb_big_or(), and rb_big_xor().


CEDA Flight Finder
Search for flights within the CEDA flights index using the parameters below. Search for specific flights by Collection, Flight Code, Instrument or Keyword Search, or filter specific flights by temporal geospatial parameters. Flights from FAAM, NERC-ARSF, SAFIRE, AWI-Polar5, Kit-Enduro, and INTA-CASA aircraft and the APEX instrument flown on the DLR aircraft are now included.
Up to the first 1000 flights will be plotted on the map with most recent on top. The default view is the 100 most recent flights.
Click an item to expand the panel.
When "Geospatial Search" is toggled on, map dragging is off. Draw a rectangular bounding box on the map and drag the rectangle. To reenable map dragging, toggle geospatial search off.
Rectangle Corners
NW:
SE:
Note: Geospatial Search is updated on moving the rectangle, not resizing.
When toggled on, map panning is disabled. Turn off to enable panning.
Click and drag over the map to set the area of interest. The shape can be resized, using the points, and moved.
Click , or start drawing, to hide this panel.
New: Click on the Histogram to apply a Time Range
0 Flights with current selection (0 ms)
0 Line sequences with current selection.
Mouse: 123.123, 456.456


LINQ Query Syntax and Type Argument Inference Dec 3 .NET, Algorithms, C#, Delegates, Error, Functional Programming, LINQ, Microsoft, SQL, Visual Studio
IIS 7 and ASP.NET Providers (Membership, Roles, and Profile) Feb 17 .NET, ASP.NET, ASP.NET Providers Series, Error, IIS, ISAPI, Microsoft, Server 2008, Vista, Windows
Build Problems with a Very Large Visual Studio Deployment Project Jun 18 .NET, Build, Deployment and Installers, Error, MSI, Microsoft, Virtual Machine, Visual Studio, Windows
Launching MSIExec.exe From C# Jun 12 .NET, Add/Remove Programs, C#, Deployment and Installers, Error, MSI, Microsoft, Patching/Updating, Threading, Windows
Migrating from VS 2005 to 2008 Feb 28 .NET, Bootstrapper, Build, Deployment and Installers, Error, MSI, Microsoft, New Technology, Prerequisites, Visual Studio
"Unrecoverable Build Error" When Building Very Large VS Deployment Project Dec 18 .NET, Build, Deployment and Installers, Error, MSI, Microsoft, Visual Studio, Windows
Building a Monster VS 2005 (or 2008) Deployment Project Dec 14 .NET, Build, Deployment and Installers, Error, MSI, Microsoft, Visual Studio, Windows


App Style Guide
#Grids
Grids in Throwdown are pretty straight-forward, create a wrapper

with a class grid
and any block element you place inside of it will be contextualized as a column.
(default)
1-2
1-2
1-3
1-3
1-3
1-4
1-4
1-4
1-4
1-5
1-5
1-5
1-5
1-5
1-6
1-6
1-6
1-6
1-6
1-6
Sample grid code

Content goes here

Content goes here

Content goes here

Content goes here

Content goes here

Content goes here

Extended Grids
1-6
5-6
1-4
3-4
1-3
2-3
2-5
3-5
1-2
1-2
3-5
2-5
2-3
1-3
3-4
1-4
5-6
1-6
Mix-n-match Grids
1-5
4-5
2-5
3-5
3-5
2-5
4-5
1-5
1-3
1-6
1-2
3-5
2-5
4-5
1-5
#Buttons
Button Styles
Button Outline Styles
Buttons With Icons
Outlined Buttons With Icons
Disabled Buttons
Block Buttons
Sample grid code
<button class="btn-primary">Button text

<button class="btn-secondary">Button text

<button class="btn-info">Button text

<button class="btn-success">Button text

<button class="btn-warning">Button text

<button class="btn-danger">Button text

Form Styles
Table Styles
| Sample Heading 1 | Sample Heading 2 | Sample Heading 3 | Sample Heading 4 | Sample Heading 5 |
|---|---|---|---|---|
| Sample Text | Sample Text | Sample Text | Sample Text | Sample Text |
| Sample Text | Sample Text | Sample Text | Sample Text | Sample Text |
| Sample Text | Sample Text | Sample Text | Sample Text | Sample Text |
| Sample Text | Sample Text | Sample Text | Sample Text | Sample Text |


Returns the mapping of an object’s (writable) attributes.
#TODO
#TODO
Objects such as modules and instances have an updateable __dict__ attribute; however, other objects may have write restrictions on their __dict__ attributes (for example, new-style classes use a dictproxy to prevent direct dictionary updates).
Without an argument, vars() acts like locals(). Note, the locals dictionary is only useful for reads since updates to the locals dictionary are ignored.
>>> vars()
{'Foo': <class '__main__.Foo'>,
'__builtins__': <module '__builtin__' (built-in)>,
'__doc__': None,
'__name__': '__main__',
'__package__': None,
'f': <__main__.Foo object at 0x02BF35F0>,
'pyscripter': <module 'pyscripter' (built-in)>}
>>> class Foo:
... x = 10
... y = 20
...
>>> vars(Foo)
{'__doc__': None, '__module__': '__main__', 'x': 10, 'y': 20}
#TODO


Alzheimer's Prevention
Menu
About Alzheimer's
Trends
Calculator
Prevention
Nutrition
About
Statistics of Alzheimer's
Do you know how many people died from AD in Australia?


[gecode-users] skipping alternative branchings during search?
Martin Mann
mmann at informatik.uni-freiburg.de
Thu Jun 8 16:22:59 CEST 2006
Me once more,
I am interested in the following scenario:
Given a CSP and a corresponding search tree (e.g. via DFS). During the
enumeration of all solutions I test the solution. If it fullfills a
certain criteria I would like to skip the alternatives of this solution
due to the last branching (== A). Or (B): skip until a specific branching.
Think this is possible using the idea of the description stack of a
search engine.
as a sketch in my mind it works like that:
(A) : just pop and skip the topmost BranchingDesc object from the
description stack.
(B) : it would be neccessarry to identify the BranchingDesc objects
(B.1) or to introduce a special tag that is placed on the stack (B.2)
(B.1) : if the BranchingDesc objects can be identified they are popped
from stack until the searched one is reached. It's only neccessary to
know the identifier for the description you want to jump to.
(B.2) : all are popped until the special tag description has been
reached. but for that a special function to introduce the tags is
neccessarry.
So my first question: is it possible? I had a closer look into the DFS
implementation and thinking about to introduce the changes there, but I
m not sure if it is really possible there.
Out of that my second question arises: what do you think about such a
feature? Is it worth to become part of Gecode, or do you think I m the
only one who would like to have it?
Or, is it already available and I m blind? ;)
Hope you arent bored ..
Martin
More information about the gecode-users
mailing list


CRNT4SBML
0.0.11
Contents:
CRNT4SBML
Installation
Steps for Detecting Bistability
Quick Start
Parallel CRNT4SBML
Docker and CRNT4SBML
Creating Physiological Bounds
CellDesigner Walkthrough
Low Deficiency Approach
Mass Conservation Approach Walkthrough
Semi-diffusive Approach Walkthrough
General Approach Walkthrough
Numerical Optimization Routine
Numerical Continuation Routine
Direct Simulation for the General Approach
Creating the Equilibrium Manifold
Confidence Level Routine
Generating Presentable C-graphs
Further Examples
An Example User Case Scenario
Reference
Contributing
Credits
History
Bibliography
CRNT4SBML
Docs
»
Index
Index
_
|
B
|
C
|
D
|
G
|
I
|
L
|
M
|
P
|
R
|
S
_
__init__() (crnt4sbml.Cgraph method)
(crnt4sbml.CRNT method)
(crnt4sbml.GeneralApproach method)
(crnt4sbml.LowDeficiencyApproach method)
(crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
B
basic_report() (crnt4sbml.CRNT method)
C
Cgraph (class in crnt4sbml)
CRNT (class in crnt4sbml)
D
does_satisfy_any_low_deficiency_theorem() (crnt4sbml.LowDeficiencyApproach method)
does_satisfy_deficiency_one_theorem() (crnt4sbml.LowDeficiencyApproach method)
does_satisfy_deficiency_zero_theorem() (crnt4sbml.LowDeficiencyApproach method)
G
GeneralApproach (class in crnt4sbml)
generate_report() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
get_a() (crnt4sbml.Cgraph method)
get_advanced_deficiency_approach() (crnt4sbml.CRNT method)
get_b() (crnt4sbml.Cgraph method)
get_boundary_species() (crnt4sbml.SemiDiffusiveApproach method)
get_c_graph() (crnt4sbml.CRNT method)
get_comm() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
get_complexes() (crnt4sbml.Cgraph method)
get_concentration_bounds_species() (crnt4sbml.MassConservationApproach method)
get_concentration_funs() (crnt4sbml.MassConservationApproach method)
get_concentration_solutions() (crnt4sbml.MassConservationApproach method)
get_concentration_vals() (crnt4sbml.MassConservationApproach method)
get_conservation_laws() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
get_dch_matrix() (crnt4sbml.MassConservationApproach method)
get_decision_vector() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
get_deficiency() (crnt4sbml.Cgraph method)
get_determinant_of_jacobian() (crnt4sbml.GeneralApproach method)
get_dim_equilibrium_manifold() (crnt4sbml.Cgraph method)
get_fixed_reactions() (crnt4sbml.GeneralApproach method)
get_g_edges() (crnt4sbml.Cgraph method)
get_g_matrix() (crnt4sbml.MassConservationApproach method)
get_g_nodes() (crnt4sbml.Cgraph method)
get_general_approach() (crnt4sbml.CRNT method)
get_graph() (crnt4sbml.Cgraph method)
get_h_vector() (crnt4sbml.MassConservationApproach method)
get_if_cgraph_weakly_reversible() (crnt4sbml.Cgraph method)
get_independent_odes() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
get_independent_odes_subs() (crnt4sbml.GeneralApproach method)
get_independent_species() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
get_input_vector() (crnt4sbml.GeneralApproach method)
get_jacobian() (crnt4sbml.GeneralApproach method)
get_key_species() (crnt4sbml.SemiDiffusiveApproach method)
get_lambda() (crnt4sbml.Cgraph method)
get_lambda_dch_matrix() (crnt4sbml.MassConservationApproach method)
get_lambda_g_matrix() (crnt4sbml.MassConservationApproach method)
get_lambda_objective_fun() (crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
get_lambda_polynomial_fun() (crnt4sbml.SemiDiffusiveApproach method)
get_linkage_classes() (crnt4sbml.Cgraph method)
get_linkage_classes_deficiencies() (crnt4sbml.Cgraph method)
get_low_deficiency_approach() (crnt4sbml.CRNT method)
get_mass_conservation_approach() (crnt4sbml.CRNT method)
get_mu_vector() (crnt4sbml.SemiDiffusiveApproach method)
get_my_rank() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
get_network_dimensionality_classification() (crnt4sbml.Cgraph method)
get_network_graphml() (crnt4sbml.CRNT method)
get_non_key_species() (crnt4sbml.SemiDiffusiveApproach method)
get_number_of_terminal_strong_lc_per_lc() (crnt4sbml.Cgraph method)
get_objective_fun_params() (crnt4sbml.MassConservationApproach method)
get_ode_system() (crnt4sbml.Cgraph method)
get_optimization_bounds() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
get_physiological_range() (crnt4sbml.CRNT static method)
get_psi() (crnt4sbml.Cgraph method)
get_reactions() (crnt4sbml.Cgraph method)
get_s() (crnt4sbml.Cgraph method)
get_s_to_matrix() (crnt4sbml.SemiDiffusiveApproach method)
get_semi_diffusive_approach() (crnt4sbml.CRNT method)
get_solutions_to_fixed_reactions() (crnt4sbml.GeneralApproach method)
get_species() (crnt4sbml.Cgraph method)
get_symbolic_objective_fun() (crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
get_symbolic_polynomial_fun() (crnt4sbml.SemiDiffusiveApproach method)
get_w_matrix() (crnt4sbml.MassConservationApproach method)
get_w_nullspace() (crnt4sbml.MassConservationApproach method)
get_weak_reversibility_of_linkage_classes() (crnt4sbml.Cgraph method)
get_y() (crnt4sbml.Cgraph method)
get_y_r_matrix() (crnt4sbml.SemiDiffusiveApproach method)
I
initialize_general_approach() (crnt4sbml.GeneralApproach method)
L
LowDeficiencyApproach (class in crnt4sbml)
M
MassConservationApproach (class in crnt4sbml)
P
plot() (crnt4sbml.Cgraph method)
plot_c_graph() (crnt4sbml.CRNT method)
plot_save() (crnt4sbml.Cgraph method)
plot_save_c_graph() (crnt4sbml.CRNT method)
print() (crnt4sbml.Cgraph method)
print_biological_reaction_types() (crnt4sbml.CRNT method)
print_c_graph() (crnt4sbml.CRNT method)
print_decision_vector() (crnt4sbml.SemiDiffusiveApproach method)
R
report_deficiency_one_theorem() (crnt4sbml.LowDeficiencyApproach method)
report_deficiency_zero_theorem() (crnt4sbml.LowDeficiencyApproach method)
run_continuity_analysis() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
run_direct_simulation() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
run_greedy_continuity_analysis() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
run_optimization() (crnt4sbml.GeneralApproach method)
(crnt4sbml.MassConservationApproach method)
(crnt4sbml.SemiDiffusiveApproach method)
S
SemiDiffusiveApproach (class in crnt4sbml)


Login
Login to Account
Create an Account
Register
Register
already regisrtred
Welcome User
Welcome to Firebase web login Example. You're currently logged in.
Logout


UX Aspects is the only open source user interface framework for building modern, responsive, mobile big data applications on the web. It provides all of the essentials required for your big data project, allowing you to swiftly create dashboards and reports that provide users with the insights they crave from their big data applications. UX Aspects is based on best-of-breed, open source technologies, including Angular, Bootstrap and D3. It is easy to include in your web applications with the Bower web package manager.
UX Aspects can be downloaded via the Bower package manager, allowing it to be added to your build process and work with your existing tools. If you don’t need an automated install process, you can instead directly download the zip files. For installation details, refer to Getting Started.
UX Aspects provides you with the following key pieces for your user interface design:
A wide range of tables complete with sorting and filtering, card views to view data more easily on smaller screens and hotkeys to let you move through the site quickly and improve productivity.
Numerous charts to display your information in the best way helping you to make the most of your data. You can select from multiple line charts, bar charts, donut charts and many others. The charts can be stacked and configured to show forecast data.
Refer to Components, CSS and Charts for a detailed view of all the components or check out the Showcase for an example application created using UX Aspects.


{% extends 'base.html' %} {% load bootstrap4 %} {% block content %}
To change your old password, you need to have your old password
The data in this application will not be distributed to any third party.
The creator is not liable to misuse by any third party user through download or malicious software.


For the 'improved' string hash function that sums up 32-bit values each generated by 4 characters at a time, does the output change when the order of the letters changes?
Swapping a couple of different letters will change the result.
Swapping the same letters will not change the result.
Swapping chunks of 4 letters will not change the result.


{% extends 'common/base.html' %} {% load staticfiles %} {% block content %}
Thank you for completing this survey! There is nothing left to do here at this time.
The scale you completed was the "Moral Foundations Questionnaire", developed by Jesse Graham and Jonathan Haidt at the University of Virginia.


Mourinho hails Pochettino: Spurs will always be Mauricio's home
by BeSoccerJose Mourinho took time to pay a warm tribute to Mauricio Pochettino at the start of his first news conference as Tottenham head coach.
Mauricio Pochettino will always be welcome at Tottenham, according to his successor Jose Mourinho.
Pochettino was sacked after five-and-a-half years at the helm on Tuesday, with last season's Champions League finalists moving quickly to appoint former Chelsea, Real Madrid and Manchester United boss Mourinho as head coach.
The 56-year-old faced his first news conference in charge of Spurs on Thursday and began by speaking warmly of Pochettino, who remains widely revered by the club's fanbase despite a dismal start to the current campaign that leaves them languishing 14th in the Premier League.
"I’ve been smiling for two days [but] first of all I do it with a bit of sadness [because] I have to speak about Mauricio," Mourinho said.
"I have to congratulate him on the incredible job he did. I share with you what we shared inside. This club will always be his home; this training ground is his training ground. He is always welcome here."
"Tomorrow is another day. He will find happiness soon. He will give everything like he did at this club. He will leave with sadness, with the feeling that he did great work. It is what everyone at the club felt."
Featured links
- BREAKING NEWS: Mourinho replaces Pochettino at Tottenham
- The latest football transfers news and rumours
- Wales, golf, Madrid... in that order
- Luis Enrique returns to Spain national team
A turbulent week has meant a quick turnaround for Mourinho, who will lead Spurs for the first time at West Ham on Saturday.
He has been out of management for almost a year after being sacked by Manchester United last December but insists he is ready for the challenge.
"I had a feeling I was going to get a club mid-season," he said. "I knew I would be in a situation where I would get only one or two days before my first game. I cannot come here and think it is about myself. It is about the players and going from a base of stability."
"I thought about it during these months because I thought I might get a job mid-season and I might have a game two days later. We have our own ways but they were in the hands of a good manager and coaching staff here."
Club record signing Tanguy Ndombele and centre-back Jan Vertonghen face fitness tests on respective groin and hamstring complaints, while Mourinho will be without winger Erik Lamela (hamstring) and goalkeeping duo Michel Vorm (calf) and Hugo Lloris (elbow) at London Stadium.


ICM
Job
- Passed5
- In Process4
- Failed7
Audit Processing
- Passed3
- In Process12
- Failed6
NETWORK DISCOVERY
Getting Started
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of
learn MoreINVENTRY
Getting Started
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of
learn MoreTOPOGRAPHY
Getting Started
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of
learn More


Welcome to Broccoli.js
So what is Broccoli? ⚭
Broccoli is a Javascript build tool that exposes a simple Javascript API to perform file-based transformations, allowing developers to easily build complex build pipelines, using a simple, functional API.
Why choose Broccoli? ⚭
Blazing fast ⚡
Broccoli's incremental rebuild system gives you sub-second compile times even when you're working with hundreds of files.
Less (code) is more 📉
Broccoli's ecosystem of high-quality plugins means you only have to write a few lines of code for most common tasks.
Flexible 🤸
Use Broccoli by itself, or as part of a larger system like Grunt, Rails, ember-cli, or even make. Broccoli don't care, it just builds what it's told.
It's Just Javascript 🙌
A Brocfile.js is just an ES6 module – use the Javascript you already know to specify how to build your assets.
Broccoli simply orchestrates file transformations via plugins. Plugins perform the actual work and operate on files, Broccoli coordinates the inputs and output of plugins.
Broccoli provides a simple, functional javascript API for constructing your build pipeline.
Example pipeline ⚭
/* Brocfile.js */
import SassSourceMaps from 'broccoli-sass-source-maps';
import Sass from 'sass';
import babel from 'broccoli-babel-transpiler';
import merge from 'broccoli-merge-trees';
const compileSass = SassSourceMaps(Sass);
const appRoot = 'app';
const styles = compileSass([appRoot], 'styles/app.scss', 'assets/app.css');
const scripts = babel(appRoot);
export default () => merge([styles, scripts]);
The above is an example of a simple Broccoli build pipeline that compiles Sass files and transcodes javascript using Babel, then merges the result into an output directory.


Anthem is getting a major overhaul at BioWare – report
by Stephany NunneleyBioWare is revamping Anthem, according to a report.
Sources speaking with Kotaku have said Anthem is getting a complete overhaul.
According to the report, the studio has dubbed it as Anthem 2.0 or Anthem Next.
The studio is apparently working to “drastically” changing loot, he world, and mission structure. According to one source, the team has spent a few months “tearing it down and figuring out what needed to change fundamentally,” and rebuilding for months afterward.
At present, the studio has yet to decide whether the changes will be released at once or over a specific time period.
BioWare has said in the past, more than once, it was working on long-term changes to the game, but wasn’t ready to discuss said changes. It did, however, state core issues with the game would be addressed.


I spent the morning of the my second day of wheeling with Old Colony Four Wheel Drive Club doing trail maintenance. This wasn't planned trail maintenance, it turned out that the owner of the freshly graded trail that we drove down the day before, wasn't too happy about the ruts we put in his driveway. We didn't know it was private property (no sign or chain) and it turned the real trail paralleled his "driveway". We all walked the trail with shovels and rakes and filled holes, drained puddles, and smoothed out the trail.
After we were done we paused for lunch and headed for Old Florida Road. The Old Florida Road goes through the forest and it is one of the trails that is part of the Mohawk Jeep Jamboree. We hadn't gone too far down the trail when I noticed a horrible noise from underneath my Jeep. I jumped out and took a look underneath. The first thing I noticed was the bolt holding my rear spring didn't have a nut on it and it worked its way almost all the way out.
Before I had the Jeep up on the Hi-Lift, several club members were prying, hammering, and aligning the bolt. Someone (a guy named Terry I think) found a nut that would fit and the problem was fixed. I lowered it, and moved the Jeep forward a bit, same noise. Rick Boiros crawled under with a crow bar in hand and discovered a rock jammed against my front driveshaft. Once that was removed, it sounded much better.
| Rick going over one of the big steps |
We continued on over several large rock steps one of which put me in a wicked (it wouldn't be a report from Mass. without the word "wicked" in it) off camber situation, but I didn't roll. After four or five tries I made it over.
Everyone made it through the trail without and use of the strap or winching, but no one dared the bottomless mud hole at the end. Jeff, our trail leader, tried the hole Friday night and was not willing to give it another shot.
| Chris taking the bypass around the big mud hole |


Liam Payne Parties with His Angel & Charlie's Angels at the Same Time
Liam Payne had a lot of angels by his side over the weekend – his real-life angel Maya Henry and the stars of the new film Charlie’s Angels!
They were all in attendance at the Business of Fashion Voices Gala Dinner to help honor British Vogue‘s editor-in-chief Edward Enninful on Friday (November 22) in Oxfordshire, England.
Charlie’s Angels stars Ella Balinska and Naomi Scott (with husband Jordan Spence) were there, as well as model Jourdan Dunn.
FYI: Maya is wearing an Alberta Ferretti dress. Naomi is wearing a Jason Wu look. Ella is wearing Prada. Jourdan is wearing Alexander McQueen.


The 2020 DjangoCon US Conference is a wrap! Thanks for another amazing year!
DjangoCon US 2020 was in San Diego for the second year and hosted 425 attendees from all over the world!
{% comment %}Supportive copy speaking to the line up or topics discussed, generally setting the mood for a successful event. Basically the primary takeaway.
{% endcomment %}Fond memory from 2020? Share it with us:
From tutorials on APIs and testing to talks about burnout and async to hallway tracks where we made buttons and planned our sprint contributions, 2020 was DjangoCon US's best year ever!
This was an innovative year for DjangoCon US! Every year, DjangoCon US works hard to make our program better and more accessible, and this year we're super proud of the features we were able to add:
- Deep Dive Day, a single-track conference day dedicated to talks that go into more detail on Django topics
- Accessibility wins: In addition to subsidized child care and captioned conference videos, this year we had a dedicated lactation room and live captioning for all talks
- Travel stipends for all speakers
Thanks to our generous sponsors, who helped make these conference dreams a reality.
Awesome Talks and Tutorials
We featured over 40 talks & tutorials this year. Here are some crowd favorites!
See the full schedule{{ "Our Presenters are :sparkles: Amazing :sparkles:" | markdownify | remove: '
' | remove: '
' }}{{ ":chart_with_upwards_trend: 2020 By the Numbers" | markdownify | remove: '
' | remove: '
' }}2020 was an amazing year for attendance, sponsorship, talks, food, really everything that goes into making a conference great.
The buzz we heard on Twitter was that it was a lot of people's favorite DjangoCon US ever!
And remember...
Under the hood it's all just a grid system. So you can just add a new row if you want to associate more text with this block. Easy peasy, lemon squeezy.
Picture Perfect
We captured so many Kodak moments over the week! Thanks to Bartek Pawlik for being our official conference photographer and saving these memories for us.
View all photos{{ "DjangoCon 2020 was possible through lots of :heart:" | markdownify | remove: '
' | remove: '
' }}Our organizers put hundreds of hours of heart and soul into this conference. We couldn't do it without each and every one of you!


Njeri Gachago
About Me
I am a passionate Lean/Agile practitioner, currently based in Tokyo. In previous roles in both manufacturing and retail, I led initiatives to reduce operational costs and increase efficiency by introducing reliable products and processes. Drawing insights from data to drive optimization has been a key aspect of all my roles. Learning how to code in Python, JavaScript, HTML and CSS has been a great addition to my analytical skills.
Projects
Building a Recommendation System with Turi Create
Turi Create offers machine learning solutions that are easy to implement
Skills: Machine Learning, Python
Kaggle Competition: Tabular Playground Series
What I learned from participating in my first data science competition
Skills: Modeling, Machine Learning, Deep Learning
R-style Visualizations in Python
Implementation of visualizations using plotnine
Skills: Data Visualization, Python, R
Speech Emotion Recognition
Implementation of MLP classifier for speech emotion recognition
Skills: Deep Learning, Model Tuning, Python


| 785 | (A) | that alle deride noghte a dyce bot grete dyn made |
| 788 | (C) | That ałł dered not a dyce . but greet dynne made |
| 780 | (D) | That al derid not a dys but grete dyn made |
| 760 | (E) | þat all dered nat a del . but greet noyse made . |
| (Ex) | ---- no text ---- | |
| 804 | (L) | þat alle dered noȝt a dyȝs bot grete dyt made |
| 733 | (P) | þ at ??? ???ed noght a dyce bot dyn n made |
| 768 | (U) | That al dered nogħt a dissh / but grete dyn made |
| (V) | ---- no text ---- |


T Hello, I'm Chris v2 test!
Wake up early. Drink Coffee. Work Hard.
A Detroiter who is inspired by the hustle, loves building things from the rock bottom, and is constantly in search for another cup of coffee. Despite growing up on Motown, I actually prefer listening to Hip Hop and Jazz. Definitely, rooted deep in the Motor City, but I still love to get out and explore different cities and experience new cultures.


Equations for terms are alpha-conversion plus:
| let P = M; P | = | M | |
| let P = P; M | = | M | |
| (D D') M | = | D (D' M) | |
| D let P = M; M' | = | let P = (D M); M' | (bv D fv M' = Ø) |
| D (M M') | = | (D M) M' | (bv D fv M' = Ø) |
| D (M1,...,Mn) | = | (D M1,...,D Mn) |
Equations for declarations are alpha-conversion plus:
| let P = (D P) | = | D | (bv P = bv D) |
| let (P1,...,Pn) = (M1,...,Mn); | = | let P1 = M1;...; let Pn = Mn; | (bv Pi fv Mj = Ø) |
| (D; D'); D'' | = | D (D' D'') | |
| D () | = | D | |
| () D | = | D | |
| D D' | = | D' D | (bv D fv D' = fv D bv D' = Ø) |
We shall write ` M = M' : T in val' and ` D = D' : T in val' for the typed proof system given by the above axioms.
Let val be the category with:
viewed up to alpha-conversion and provable equality.
is given by let-binding:
where x is the vector x1...xn, and T is the vector T1...Tn.
The category val has finite products, with (using alpha-conversion to avoid variable name clashes):
is given by pairing:
We shall now give a graphical presentation of a cartesian closed category, which allows us to draw data-flow diagrams for programs in val. These graphs are acyclic flow graphs, with edges labelled by base types and nodes labelled by constructors. These are described more formally in an appendix.
The symmetric monoidal structure is drawn:
| Identity: | Composition: |
| Tensor: | |
| Symmetry: | |
The product structure is drawn:
| Diagonal: | |
| Terminal: | |
We can now present the axioms of a category with finite products in graphical form. First, we present the symmetric monoidal axioms, all of which are graph isomorphisms.
| Left unit: | = | ||
| Right unit: | = | ||
| Associativity: | = | ||
| Functoriality of tensor wrt identity: | = | ||
| Functoriality of tensor wrt composition: | = | ||
| Symmetry is an iso: | = | ||
| Symmetry is natural: | = |
As well as the symmetric monoidal category axioms, we have diagonal and terminal natural transformations, so the category has finite products. The coherence conditions are multigraph isomorphisms:
| Symmetry respects diagonal 1: | = | ||
| Symmetry respects diagonal 2: | = | ||
| Terminal repsects diagonal: | = |
The naturality conditions for the product structure are not multigraph isomorphisms, but are bisimulations (as discussed in an appendix):
| Diagonal is natural: | = | ||
| Terminal is natural: | = |
| local rec x; let y:T = x; let x:T = M | = | let y:T = M | (x fv M) |
| (local rec x; D) D' | = | local rec x; (D D') | (x fv D') |
| D (local rec x; D') | = | local rec x (D; D') | (x fv D) |
| local rec x; local rec y; D | = | local rec y; local rec x; D |
The recursive structure we have added allows us to find fixed points in val, on objects from proc. This is a familiar story to domain theorists, where it is common to find fixed points on (non-strict) Cpo morphisms on (pointed) Cpo objects.
To give a categorical account of recursive declarations, we borrow Hasegawa's presentation of recursive declarations, adapting Joyal, Street and Verity's traced monoidal structure. However, there is a crucial difference between our presentation and Hasegawa's: we are considering call-by-value semantics (such as the Cpo example above) where Hasegawa is considering call-by-name. The call-by-value category Cpo has smash product as its monoidal structure, so does not support a trace, whereas the call-by-name equivalent has non-strict product, and so does support a trace.
A trace on a symmetric monoidal category is given by a natural transformation:
satisfying certain axioms. For example, Hasegawa shows that the category of pointed cpos with non-strict product has a trace given by fixed points.
As noted above, the category Cpo (of pointed cpos with smash product) does not have a trace, since the obvious fixed-point construction is the trivial one, since the fixed point of any strict map is the constant bottom map, and smash producting bottom with any other map yields bottom. Thus the attempt to duplicate Hasegawa's construction in the call-by-value case yields the constant bottm natural transformation, which fails to satisfy the trace axioms.
We need to generalize the trace construction to include cases such as Cpo, and fortunately there is an obvious such generalization. Given a symmetric monoidal category C with a full subcategory (not necessarily symmetric monoidal) TC
a partial trace is a natural transformation:
satisfying certain axioms (given in an appendix).
Adding local rec declarations gives the syntactic category val a partial trace (where TC is the full subcategory of traceable types) where the trace of
is given by a local rec declaration:
This trace is partial because of the condition that T has to be traceable.


Directions: Choose a strategy, enter the number of trials, click the 'Go' button, and think about the results.


Object detection track is based on DOTA-v2.0. DOTA-v2.0 collects more Google Earth, GF- 2 Satellite, and aerial images. There are 18 common categories, 11,268 images and 1,793,658 instances in DOTA-v2.0. Compared to DOTA-v1.5, it further adds the new categories of ”airport” and ”helipad”. The 11,268 images of DOTA are split into training, validation, test-dev, and test-challenge sets. To avoid the problem of overfitting, the proportion of the training and validation set is smaller than the test set. Furthermore, we have two test sets, namely test-dev and test-challenge. Training contains 1,830 images and 268,627 instances. Validation contains 593 images and 81,048 instances. We released the images and ground truths for training and validation sets. Test-dev contains 2,792 images and 353,346 instances. We released the images but not the ground truths. Test-challenge contains 6,053 images and 1,090,637 instances. The images and ground truths of the test-challenge will be available only during the challenge. In the dataset, each instance's location is annotated by a quadrilateral bounding box, which can be denoted as "x 1, y 1, x 2, y 2, x 3, y 3, x 4, y 4" where (x i, y i) denotes the positions of the oriented bounding boxes' vertices in the image. The vertices are arranged in clockwise order. The following is the visualization of the adopted annotation method. The yellow point represents the starting point. Which refers to: (a) the top left corner of a plane, (b) the top left corner of a large vehicle diamond, (c) the center of sector-shaped baseball.
Except for the annotation of location, a category label is assigned for each instance, which comes from one of the above 15 selected categories, and meanwhile, a difficult label is provided which indicates whether the instance is difficult to be detected(1 for difficult, 0 for not difficult). Annotations for an image are saved in a text file with the same file name. In the first line, 'imagesource'(from GoogleEarth, GF-2 or JL-1) is given. In the second line, ’gsd’(ground sample distance, the physical size of one image pixel, in meters) is given. Note if the 'gsd' is missing, it is annotated to be 'null'. From the third line to the last line in the annotation text file, the annotation for each instance is given. The annotation format is:
Instance segmentation track is based on iSAID. Existing Earth Vision datasets are either suitable for semantic segmentation or object detection. iSAID is the first benchmark dataset for instance segmentation in aerial images. This large-scale and densely annotated dataset contains 655,451 object instances for 15 categories across 2,806 high-resolution images. The distinctive characteristics of iSAID are the following: (a) a large number of images with high spatial resolution, (b) fifteen important and commonly occurring categories, (c) a large number of instances per category, (d) large count of labeled instances per image, which might help in learning contextual information, (e) huge object scale variation, containing small, medium and large objects, often within the same image, (f) Imbalanced and uneven distribution of objects with varying orientation within images, depicting real-life aerial conditions, (g) several small size objects, with ambiguous appearance, can only be resolved with contextual reasoning, (h) precise instance-level annotations carried out by professional annotators, cross-checked and validated by expert annotators complying with well-defined guidelines. The annotated examples are shown as follows:
Semantic segmentation track is based on GID. GID is a large-scale land-cover dataset with Gaofen-2 (GF-2) satellite images. This new dataset, which is named as Gaofen Image Dataset (GID), has superiorities over the existing land-cover dataset because of its large coverage, wide distribution, and high spatial resolution. GID consists of two parts: a large-scale classification set and a fine land-cover classification set. The large-scale classification set contains 150 pixel-level annotated GF-2 images, and the fine classification set is composed of 30,000 multi-scale image patches coupled with 10 pixel-level annotated GF-2 images. The training and validation data with 15 categories is collected and re-labeled based on the training and validation images with 5 categories, respectively. The annotated examples are shown as follows:


--- layout: post title: "Mark Zuckerberg's Education Investment Portfolio" date: 2016-12-05 09:35:00 +0000 tags: image: https://s3.amazonaws.com/hackedu/2016-12-05-pigeon.jpg imagecredits: https://www.flickr.com/photos/giovanibr/15562477920 ---
This article helps provide funding data for part 3 of my annual review of the year in ed-tech
The following investments were made by Zuckerberg Education Ventures this year:
Previous years’ investments include Newsela, MasteryConnect, AltSchool, and Bridge International Academies.
The following investments in 2016 were made by the Chan Zuckerberg Initiative:
Mark Zuckerberg has also invested in Panorama Education.


Cookbook/InterfacingWithJava
Interfacing with Kdb+ from Java
Introduction
The Java interface to Kdb+ is implemented in the c class available from here. The c class implements the protocol to interact with a Kdb+ server. Instances may be constructed with on of the following constructors:
| Signature | Notes |
| public c(ServerSocket s) throws IOException | Creates a connection from an existing ServerSocket |
| public c(String host, int port, String usernameAndPassword) throws KException, IOException | Throws a KException if access is denied by the Kdb+ server. The username and password should be of the format "username:password" |
| public c(String host, int port) throws KException, IOException | Uses the user.name property as the login name and password. It throws a KException if access is denied by the Kdb+ server |
It is important to explicitly close the c object, via the close method, when we are finished with the connection to a Kdb+ server.
The class provides a number of other features explored in the following sections.
Utility class for Kdb+ types
Within the c class there are a number of utility classes provided which match the available types in Kdb+ which do not map directly to standard classes such as Integer. In general these classes have all their fields declare with public access, and several provide custom toString() methods to decode the data payload.
| Class | Members | Methods | Notes |
| Dict | Object x; Object y | - | - |
| Flip | String[] x, Object[]y | - | - |
| Month | int i | String toString() | Provides toString() to decode the i field |
| Minute | int i | String toString() | Provides toString() to decode the i field |
| Second | int i | String toString() | Provides toString() to decode the i field |
Creating null values
For each type character, we can get a reference to a null Kdb+ value by indexing into the NULL Object array using the NULL utility method. Note that the K null values are not the same as Java's null.
An example of creating an object array containing two null Kdb+ integers:
#!java Object[] twoNullIntegers = {NULL('i'), NULL('i')};
The Kdb+ null values are mapped to Java values according to the following table:
| Kdb+ type | Kdb+ null accessor | Java null |
| Boolean | NULL('b') | Boolean(false) |
| Byte | NULL('x') | Byte(byte() 0) |
| Short | NULL('h') | Short(Short.MIN_VALUE) |
| Integer | NULL('i') | Integer(Integer.MIN_VALUE) |
| Long | NULL('j') | Long(Long.MIN_VALUE) |
| Float | NULL('e') | Float(Double.NaN) |
| Double | NULL('f') | Double(Double.Nan) |
| Character | NULL('c') | Character(' ') |
| String | NULL('s') | "" |
| Month | NULL('m') | Month(Integer.MIN_VALUE) |
| Date | NULL('d') | Date(Integer.MIN_VALUE) |
| DataTime/java.util.Date | NULL('z') | Timestamp(Long.MIN_VALUE) |
| Minute | NULL('u') | Minute(Integer.MIN_VALUE) |
| Second | NULL('v') | Second(Integer.MIN_VALUE) |
| Time | NULL('t') | Time(Integer.MIN_VALUE) |
We can check whether a given Object x is a Kdb+ null using the c utility method:
#!java public static boolean qn(Object x);
Kdb+ types of Java objects
For reference, internally, types are mapped as follows for scalars:
| Java Object Type | Kdb+ type number |
| Boolean | -1 |
| Byte | -4 |
| Short | -5 |
| Integer | -6 |
| Long | -7 |
| Float | -8 |
| Double | -9 |
| Character | -10 |
| String | -11 |
| Month | -13 |
| java.util.Date | -15 |
| Time | -19 |
| Date | -14 |
| Minute | -17 |
| Second | -18 |
and the following for complex data:
| Java Object Type | Kdb+ type number |
| boolean[] | 1 |
| byte[] | 4 |
| short[] | 5 |
| int[] | 6 |
| long[] | 7 |
| float[] | 8 |
| double[] | 9 |
| char[] | 10 |
| String[] | 11 |
| Month[] | 13 |
| java.util.Date[] | 15 |
| Time[] | 19 |
| Date[] | 14 |
| Minute[] | 17 |
| Second[] | 18 |
| Flip | 98 |
| Dict | 99 |
The default return value for all other objects is 0.
Interacting with Kdb+ via an open c instance
Interacting with the Kdb+ server is very simple. You must make a basic choice between sending a message to the server where you expect no answer, or will check later for an answer.
In the first case, where we will not wait for a response, use the ks method on a c instance:
| Method |
| public void ks(String s) throws IOException |
| public void ks(String s, Object x) throws IOException |
| public void ks(String s, Object x, Object y) throws IOException |
| public void ks(String s, Object x, Object y, Object z) throws IOException |
Alternatively, should we expect an immediate response use the k method:
| public Object k(Object x) throws KException, IOException |
| public Object k(String s) throws KException, IOException |
| public Object k(String s, Object x) throws KException, IOException |
| public Object k(String s, Object x, Object y) throws KException, IOException |
| public Object k(String s, Object x, Object y, Object z) throws KException, IOException |
As a special case of the k method, we may receive a message from the server without sending any message as an argument:
| Method |
| public Object k() throws KException, IOException |
Accessing elements of arrays
We can access elements using the "at" method of the utility class "c":
| Object c.at(Object x, int i) | Returns the object at x[i] or null |
and set them with "set":
| void c.set(Object x, int i, Object y) | Set x[i] to y, or the appropriate Kdb+ null value if y is null |
What is the default time zone that the Java interface to Kdb+ uses?
GMT.
What is the default date format?
SimpleDateFormat("yyyy.MM.dd").
How do I change the socket a c instance is using?
Given some c instance, we can change the socket being used to talk to a Kdb+ server using the void io(Socket x) throws IOException method.
Exceptions
The c class throws IOExceptions for typical socket read/write reasons and throws KException objects in higher level cases. That is, errors at the Kdb+ level rather than the Socket level.
Is there a JDBC interface?
Yes. See here for the implementation. Compile it as follows:
java jdbc.java jar cf jdbc.jar *.class
and use as normal.
Note that this is a pure Java native-protocol driver (type 4) JDBC driver. The implementation builds on the lower level KDBC API which is somewhat simpler and a good choice for application development when support for legacy code is not a consideration.
The JDBC driver implements only the minimal core of the JDBC feature set. Operations must be prefixed by "q)" in order to be executed as kdb+ statements. There is no significant difference in performance between using the !PreparedStatement, !CallableStatement or Statement interfaces.
Kdb+ does not have the concept of transactions as expected by the JDBC API. That is, you cannot open a connection, explicitly begin a transaction, issue a series of separate queries within that transaction and finally rollback or commit the transaction. It will always behave as if autoCommit is set to true and the transaction isolation is set to SERIALIZABLE. In practice, this means that any single query (or sequence of queries if executed in a single jdbc call) will be executed in isolation without noticing the effects of other queries and modifications made to the database will always be permanent.
If little work is being performed per interaction via the JDBC driver, that is, few queries and each query is very quick to execute, then there is a significant advantage to using connection pooling. Using the Apache Commons DBCP component improves the performance of this case by about 70%. DBCP avoids some complexity which can be introduced by other connection pool managers. For example, it handles connections in the pool that have become invalid (say due to a database restart) by automatically reconnecting. Furthermore it offers configuration options to check the status of connections in the connection pool using a variety of strategies.
Although it is not necessary to call the close method on !ResultSet, Statement, !PreparedStatement and !CallableStatement when using the Kdb+ JDBC driver, it is recommended with the DBCP component as it performs checks to ensure all resources are cleaned up and has the ability to report resource leaks. Explicitly closing the resources avoids a small runtime cost.
#!java // An ObjectPool serves as the pool of connections. // ObjectPool connectionPool = new GenericObjectPool(null); // A ConnectionFactory is used by the to create Connections. // This example uses the DriverManagerConnectionFactory, with a // a connection string for a local Kdb+ database listening on port 5001. // ConnectionFactory connectionFactory = new DriverManagerConnectionFactory("jdbc:q:localhost:5001",null); // A PoolableConnectionFactory is used to wrap the Connections // created by the ConnectionFactory with the classes that implement // the pooling functionality. // PoolableConnectionFactory poolableConnectionFactory = new PoolableConnectionFactory(connectionFactory,connectionPool,null, null,false,true); // Finally, we create the PoolingDriver itself: // Class.forName("org.apache.commons.dbcp.PoolingDriver"); PoolingDriver driver = (PoolingDriver) DriverManager.getDriver("jdbc:apache:commons:dbcp:"); // ...and register our pool with it. // driver.registerPool("q",connectionPool); // Now we can just use the connect string "jdbc:apache:commons:dbcp:q" // to access our pool of Connections.
Example Grid Viewer using Swing
#!java package app; import java.awt.BorderLayout; import java.awt.Color; import java.io.IOException; import java.lang.reflect.Array; import java.util.logging.Level; import java.util.logging.Logger; import javax.swing.JFrame; import javax.swing.JScrollPane; import javax.swing.JTable; import javax.swing.table.AbstractTableModel; import kx.c; public class Main { public static class KxTableModel extends AbstractTableModel { private c.Flip flip; public void setFlip(c.Flip data) { this.flip = data; } public int getRowCount() { return Array.getLength(flip.y[0]); } public int getColumnCount() { return flip.y.length; } public Object getValueAt(int rowIndex, int columnIndex) { return c.at(flip.y[columnIndex], rowIndex); } public String getColumnName(int columnIndex) { return flip.x[columnIndex]; } }; public static void main(String[] args) { KxTableModel model = new KxTableModel(); c c = null; try { c = new c("localhost", 5001,"username:password"); String query="([]date:.z.D;time:.z.T;sym:10?`8;price:`float$10?500.0;size:10?100)"; // String query="0!select last price by sym from trade where date=last date"; model.setFlip((c.Flip) c.k(query)); } catch (Exception ex) { Logger.getLogger(Main.class.getName()).log(Level.SEVERE, null, ex); } finally { if (c != null) {try{c.close();} catch (IOException ex) {} } } JTable table = new JTable(model); table.setGridColor(Color.BLACK); String title = "kdb+ Example - "+model.getRowCount()+" Rows"; JFrame frame = new JFrame(title); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.getContentPane().add(new JScrollPane(table), BorderLayout.CENTER); frame.setSize(300, 300); frame.setVisible(true); } }


{% extends 'registration/registration_base.html' %} {% block meta %} {% endblock %} {% block subtitle %}Password Changed{% endblock %} {% block page_header %} Password successfully changed {% endblock %} {% block page_body %}
Your password has been updated.
Please wait, you will be redirected to your homepage.
{% endblock %}


Mortgage Calculator
The Simplest one in BC CANADA
Amount
Interest Rate
Amortization Period
Downpayment
Monthly Payment