Video Directive Examples
Simple
Width and Height
Poster and Controls
Preload, Loop, Muted and Autoplay


This class represents a .ini/.conf/.desktop file parser based on the Windows INI standard. More...
#include <libthinkpad.h>
Public Member Functions | |
| vector< IniSection * > * | readIni (string path) |
| parse parse a config file from the disk into the class More... | |
| bool | writeIni (string path) |
| writeConfig write a list of sections to the disk More... | |
| vector< IniSection * > | getSections (const char *section) |
| IniSection * | getSection (const char *section) |
| void | addSection (IniSection *section) |
This class represents a .ini/.conf/.desktop file parser based on the Windows INI standard.
WARNING: COMMENTS ARE NOT SUPPORTED!
| void ThinkPad::Utilities::Ini::Ini::addSection | ( | IniSection * | section | ) |
Add a section to the config file
| section | the section to add |
| Utilities::Ini::IniSection * ThinkPad::Utilities::Ini::Ini::getSection | ( | const char * | section | ) |
Get a single section from the file with the name
| section | the section to get |
| vector< Utilities::Ini::IniSection * > ThinkPad::Utilities::Ini::Ini::getSections | ( | const char * | section | ) |
Get a list of sections from the file with the same name
| section | the name of the sections |
| vector< Utilities::Ini::IniSection * > * ThinkPad::Utilities::Ini::Ini::readIni | ( | string | path | ) |
parse parse a config file from the disk into the class
| path | the path to the file to parse |
| bool ThinkPad::Utilities::Ini::Ini::writeIni | ( | string | path | ) |
writeConfig write a list of sections to the disk
| sections | the list of sections to write |
| path | the path to write |


Google Duplex launches on the web, starting with movie tickets
by Abner LiAt I/O 2019, Sundar Pichai announced that Google Duplex was “moving beyond voice” and coming to the web. After publicly testing in late September, Duplex is officially launching today as “Google Assistant in Chrome” to help you buy movie tickets.
While getting tickets online is not hard, it’s can be a tedious, multi-step process that is inconsistent from site to site. With Duplex, you can just interact with an interface presented by Assistant while Google does the work of selecting and navigating the web.
It starts by asking Assistant on Android for movie showtimes or searching from the Google app. After selecting a movie time, there is a pill-shaped “Buy tickets” button next to the usual list of ticketing providers.
Tapping slides up an Assistant panel while the the selected theater’s regular mobile page loads in the background. On first use, you’ll have to accept the terms and conditions for using “Google Assistant in Chrome” and that site’s cookie policy.
Instead of interacting with that third party, you just interact with Google’s interface. The first question is, “How many tickets would you like?” with Duplex on the Web, then inputting the answer and progressing to seat selection. This process is interactive, and you can slide down the panel at anytime.
The last step is “Confirming your details” and entering a payment method. Your profile image is in the top-right corner, while a blue bar and loading indicator denotes progress.
According to Google, Duplex for movie tickets supports more more than 70 cinemas and ticketing services: AMC, Fandango, MJR Theaters, and Movietickets.com in the US, or Odeon in the UK.
Google hopes to expand Google Assistant/Duplex on the web to more complex tasks in the future with car rentals coming next. This joins using Duplex to make restaurant reservations, and both widely rolled out today.
FTC: We use income earning auto affiliate links. More.


What makes us right for you?
100% PERSONALIZED FITNESS TRAINING
What process can you expect?

THE
METHOD
We utilize the Optimum Performance Training model designed by the National Academy of Sports Medicine. Backed by decades of scientific research proven safe and effective for all populations, the OPT model allows us to lead a person of any athletic ability to any desired health and fitness goal in the shortest time possible.
Call or text now for a free consultation
(504) 418-6356


Hi, I'm Alex.
Berlin-based developer.
Currently living in Berlin by way of Washington DC and Chicago.
Building iOS for Komoot so people can get outdoors and not get lost.

PROJECTS
Komoot
- The #1 outdoor app in Germany, Austria, and Swizerland. With our app, pros and enthusiast hikers, bikers, and runners alike can easily discover the best places to go outdoors. download detailed offline maps and navigate your way to and from awesome highlights with voice navigation. Currently working on just about every aspect of the app with an awesome team in Berlin!
- View in the App Store: DE EN
Be Brave
- Help raise awareness for childhood cancer with this fun photo app! Take pictures, simply put an overlay on them and share on your favorite social media network to show your support for a great organization helping families cope with the financial burden of caring for their child. All app sale proceeds go to helping out families in the Orlando, FL area.
- Organization web site: Be Brave Foundation
- View in the App Store
- App promotional page
Hapto
- Simple vacation time calculator and tracker (and my first app in the App Store). Determine how much vacation time you have available on a given date, accounting for recorded vacation time. Figure out how much time it will take to bounce back from a negative PTO value.
- View in the App Store
Legacy
Explore the timelines of prominent historical figures and view their related Wikipedia page. Links with your Facebook to explore what someone accomplished at your exact age, to the day!
- View in the App Store
Yumlist
- Link your Yummly or Pinterest boards to YumList and microblog your culinary creations! Add notes, pictures, and more to the recipes you have added on Yummly or Pinterest. Work in progress, source available on Github
CONNECT
The best way to get in touch with me is through Twitter or via email at<EMAIL_ADDRESS>But you've got options, too.
Alexander Freas
<EMAIL_ADDRESS>@sashimiblade


# AF 2006-2020
### An incomplete introspective view on the FLOS/CH community
---
- Julian Bogdani <[julian.bogdani@uniroma1.it](mailto:julian.bogdani@uniroma1.it)>
- Federico Sciacca <[fede__fs@libero.it](mailto:fede__fs@libero.it)>
---
Play online: https://jbogdani.github.io/af-introspection/
# Aim
This brief presentation is aimed at providing a rapid overview on
applications and projects presented in the previous editions of
ArcheoFOSS from a statistical point of view.
The goal is to provide a snapshot of the FLOS’ community
activity as it appears in 2020, with no presumption of
perfection or completeness. This is why the source of
charts and tables is made publically available,
so anyone can complete the dataset or suggest corrections.
# Data
The information presented in the next slides has been extraced
from the **official pubblications**. Conferences that have not
been published (2016 and 2019) have not been considered.
When the pubblication will appear, hopefully, if this application
is still maintained, it will be updated.
### Methodology
For each project, the following data have been extracted from the text:
- `year` : Year of the conference where the application has been presented
- `authors` : Authors of the presentation
- `name` : Name of the project
- `license` : License as stated in the source; `false` if no information on license is found
### Methodology #2
By combining texts with web research the following information have been recovered
- `maintained`: `true` if the project is still maintained, otherwise `false`
- `source_available`: URL o the repository where the sourse is available, otherwise `false`
- `last_commit`: Year of the last commit to the repository
- `commits` : Total number of commits as reported in the official repository
### Warning
The Web search is not a very reliable source of information
since projects living in the dark web might not appear.
Yet, we believe that projects targeting an open community
might not have walked many steps towards invisibility.
Please feel free [to report](https://github.com/jbogdani/af-introspection/issues)
wrong or incomplete information.
List of available pubblications up to october 2020
Publishing time
Years passed from the conference session to the publication of the proceedings
Publishing license
Please note that the chart refers to the pubblication licence.
Access policy is not considered here.
1.1. Openness
Source code availabililty
Applications with published source code
Applications with source code not available
Page 1/2
Applications with source code not available
Page 2/2
License type
License type | detail
1.2. Lifecicle
Survival rate
Longevity
Years passed from the presentation to the last commit


\
About Me | Learn Detail About Me
Toggle navigation
Home
Software Developer
Software Developer
Personal Information
Eduaction
School
College
Favorite Personalities
HomeTown
Interested In
Language


Allow custom craft analysis for BPEL and BPMN20
providing static and dynamic analysis .
We have a great surprise for Designmodo fans – our first free HTML user interface kit. Flat UI Free is made on the basis of Twitter Bootstrap in a stunning flat-style.
You can start with a4bp visit our book to learn how use and hack the tool for you own custom visualization.
A4bp book


As part of GSoC’16 I’m working on Porting Comment Alter module to Drupal 8 under the mentorship of boobaa and czigor. This blog is an excerpt of the work which I did in the sixth week of the coding period of GSoC’16. The blogpost for the work done in the fifth week can be found here.
Last week I worked on the submit and validate callback functions but in the submit function only the parent entity was stored. In order to show the changes made by a comment we need to create new revision of the parent entity and store the revision ID corresponding to that comment. A revision can be created using setNewRevision
if the entity supports revisions. In case if entity is an instance of RevisionLogInterface we also set the revision_user_id and the creation time. (For e.g. See NodeForm::submitForm()).
There are some content entity type which doesn’t support revisions like the taxonomy term. For those entity we decided to allow altering of the comment alterable fields from the comment form. Though the changes made by a particular comment wouldn’t be available then as we are using revision for this. Later this week I tried to fix following issues related to the field widgets:
Multi-valued fields add more option: One of the issue was add_more option of any multi-valued field widget. Clicking the add_more button was resulting in an AJAX error and we were unable to add any extra fields to a multi-valued field. Fix to the issue was rather small, just removing the comment_alter_
prefix from the alterable field names solved this issue.(See commit)
Checkboxes/radio buttons and select list widget: In case when checkboxes were used as a field widget, Element::children()
was giving a fatal error as there were no any children elements in the $form[$alterable_field][‘widget’]
element. So, to fix this we needed to bail out early or get the column information from the #key_column
property of the form element.
By the end of the week I was able to complete the comment_alter_form_comment_form_alter_submit()
function and fixed some of the issues related to field widgets. My mentors have already reviewed the code for the work which I did during this week. If anyone is interested, my progress can be followed in my GitHub repo.


Lecture notes for M362M: Introduction to Stochastic Processes
last updated - 2020-08-12
Preface
This is an always-evolving set of lecture notes for Introduction to Stochastic Processes (M362M). It should start with me explaining what stochastic proceses are. Instead, here is a list of several questions you will be able to give answers to upon completion of this course.
Question 1 In a simplistic model, the price of a share of a stock goes either up or down by \(\$1\) each day, with probability \(1/2\). You own a single share whose value today is \(\$100\), so that its tomorrow’s price will be \(\$101\) or \(\$99\) with probability \(1/2\), etc. Your strategy is to hold onto your share until one of the following two things happen: you go bankrupt (the stock price hits \(0\)), or you make a \(\$50\) dollar profit (the stock price hits \(\$150\).)
- How likely is it that you will make a profit before you go bankrupt?
- How long will it take?
- Is it possible that it takes forever, i.e., that the stock price hovers beween \(\$1\) and \(\$149\) forever?
Question 2. A person carying a certain disease infects a random number of people in a week, and then stops being infectious. Each of the infected people transmits the disease in the same way, etc. Suppose that the number of people each (infectious individual) infects is either \(0\), \(1\) or \(2\) or \(3\), each with probability \(1/4\); different infectious individuals may infect different number of people and behave independently of each other.
- What is the probability that the disease will every be eradicated?
- What is the probability that every single individual in the population of \(300,000,000\) will eventually be infected?
Question 3. In a game of tennis, Player \(1\) wins against Player \(2\) in each rally (the smallest chunk of the match that leads to point, i.e., to a score change from \(15-30\) to \(30-30\), for example) with probability \(p\). What is the probability that Player \(1\) wins
- a game (the chunk of the match that leads to a score change such as \(5-3\) to \(6-3\) within a set)?
- a set? the entire match?
- Is the game of tennis set up in such a way that is amplifies or reduces the difference in skill between players?
Question 4. A knight starts in the lower left corner of the chess board and starts moving ``randomly’’. That means that from any position, it chooses one of the possible (legal) moves and takes it, with all legal moves having the same probability. It keeps doing the same thing until it comes back to the square it started from.
- What is the expected number of moves the knight will make before it returns to “square one”?
- How about the same problem, but using a different chess piece? Which one do you think will come back is the smallest (expected) number of steps?
- (*) How about the same problem, but until all squares have been visited at least once?
Question 5. How does Google search work?


Hello-Books
All Books
(current)
Sign in
×
Email Address
Password
Sign in
Welcome to Hello-Books
Create Account
Full Name
Email address
Password
Register


More about Open Source@HackIllinois
We want hackers to be able to make meaningful addtions to the field of computer science and to organizations that depend on the technology that open source provides.
If you do accept working on Open Source, we ask that you be sure:
-
You are coming to Hackillinois
-
You want to work on Open Source during the hackathon, knowing there are no prizes
-
You won't drop Open Source during the hackathon, as you will be letting your team down
We have assembled a varied set of Open Source Projects that hackers may work on.
-
If you have been accepted to Open Source@HackIllinois, let us know you preference.
(Note: Not all of these projects necessarly will have a mentor day of based on the prefence of the mentor and the popularity of the project, If you select a project that won't have a mentor during the hackathon we will do our best to put you on a similar project, or you can work on the project without a mentor)
-
If you have have not been accepted to Open Source@HackIllinois but still want to work on Open Source projects, we commend you and we would love for you to do that.
Just know that you most likely will not have a mentor hacking with you, though you may still ask for support on the mentorship portal.
Also let us know if you are doing so, if a mentor has the time we will direct them to work with you.
You are free to join Open Source after the beginning of the hackathon, you may be added to a existing team or asked to hack with out a mentor (see above to learn how that works)
Projects you could be working on
Here is a list of project for which you might be able to hack with a developer on (You may work on projects not on this list but you may not have a mentor to hack with if so):
Red Cross: Smoke Alarm Portal
| Description: |
The American Red Cross of Chicago and Northern Illinois (ARC-CNI) seeks to improve smoke alarm installation rates in the Red Cross North Central Division, which is comprised of 10 regions. This software is a lightweight web portal for receiving and routing smoke alarm installation requests. |
| Technologies: |
Javascript, Node.js |
| Mentor: |
Karl Fogel |
| Useful Documentation: |
https://github.com/redcross/smoke-alarm-portal/issues |
Red Cross: DCSOps
| Description: |
DCSOps is a fully open-source volunteer coordination platform deployed by the Red Cross. It has a number of open enhancement requests and issues; . |
| Technologies: |
Rails |
| Mentor: |
Karl Fogel |
| Useful Documentation: |
https://github.com/redcross/arcdata/issues |
HTBox AllReady
| Description: |
Humanitarian Toolbox "AllReady" app is an open source disaster preparedness system. The prototype was first developed by Microsoft in a sprint, then taken over by Humanitarian Toolbox. It has a number of outstanding issues and enhancement requests. |
| Technologies: |
Visual Studio, .NET |
| Mentor: |
Karl Fogel |
| Useful Documentation: |
http://www.htbox.org/projects/allready |
WorldWide Telescope
| Description: |
WorldWide Telescope (WWT) is a "virtual telescope" that assembles imagery and other data from many space-based and Earth-based telescopes and stitches it all together to create an interactive telescope in software. There are many open issues and enhancements, for both the Windows native client version of WWT and the web-based HTML5 version. |
| Technologies: |
Visual Studio, .NET, Javasript, HTML5 |
| Mentor: |
Karl Fogel |
| Useful Documentation: |
https://github.com/WorldWideTelescope/wwt-web-client |
Bro: Network Log Visualization
| Description: |
As network speeds keep increasing, and more and more devices are connected to the Internet, network logs are quickly becoming "Big Data." Some sites that use Bro generate over 1 billion log lines per day. Network security teams need help in processing this massive amount of data. I'd like to mentor a project that takes Bro log data (CSV files) and processes them to create real-time (or near-real-time) visualizations that can be used to identify malicious or compromised hosts. |
| Technologies: |
Data processing, Visualization, Java, Docker |
| Mentor: |
Vlad Grigorescu |
| Useful Documentation: |
https://github.com/bro |
Bro: Google Safe Browsing
| Description: |
With the Google Safe Browsing API, you can query URLs to detect and alert on malicious or phishing sites. By adding this to the Bro Network Security Monitor, you would gain alerts and protection for all users on a network. |
| Technologies: |
C++ |
| Mentor: |
Vlad Grigorescu |
| Useful Documentation: |
https://github.com/bro |
Bro: Script Repo and Plugin
| Description: |
The Bro Network Security Monitor relies on scripts for advanced functionality. The Bro script repository would be a project similar to CPAN or PyPy, with a Bro Control plugin for downloading, installing, updating and removing scripts (+ any dependencies) |
| Technologies: |
Python, Git |
| Mentor: |
Vlad Grigorescu |
| Useful Documentation: |
https://github.com/bro |
Apache - Apache HTTPd: Dervitive for IoT
| Description: |
Apache Web Server is widely deployed across all modern operating systems. It may also interesting for students to build a minimal deployment of httpd suitable for embedded controllers/IoT devices. |
| Technologies: |
C, Unix |
| Mentor: |
William A. Rowe Jr. |
| Useful Documentation: |
https://github.com/apache/httpd |
OSI: [Insert Your Idea Here]
| Description: |
Project to be determined by the participating team. Team would need to identify the purpose of their component or project, determine the appropriate OSI license to achieve their goal (adoption/permissive vs code freedom/copyleft), determine the organization/umbrella best suited to host the project, create the initial spec and draft implementation on github and bring their proposal the project to that community or incubator. Team members should expect to choose functionality of their own longer-term interest and to pursue their project idea beyond the initial hackathon duration. |
| Technologies: |
[For Hackers to Decide] |
| Mentor: |
William A. Rowe Jr. |
| Useful Documentation: |
https://opensource.org/ |
CoinSorter: Coin grading and Counterfeit Detection
| Description: |
Over the years there have been small changes in the same designs of coins. For example the spacing of “AM” in AMERICA is different on the back of US Lincoln pennies after 1992. Having a large database of coin images, front and back, and knowing their date and mint mark one could correlate regions on both sides of the coin. Most of these will be meaningless, but some correlations of regions will be quite interesting. Using the existing CoinSorter system one will be able to detect rare verities and counterfeit coins already known and quite possibly ones that are unknown. |
| Technologies: |
Deep Learning, CUDA, Computer Vision, Hardware Development, Mechatronics |
| Mentor: |
Paul Krush |
| Useful Documentation: |
https://github.com/GemHunt/CoinSorter/ |
CoinSorter: Metering, Spacing, and Classification of Coins
| Description: |
Currently CoinSorter only handles one size of coin at time with an off the shelf coin hopper. One should be able to handle mixed coin sizes with a series of independently driven conveyors controlled with an Arduino. Handling mixed coin sizes would make the system much more useful. For example it could find rare coins while doing the simple act of sorting and counting mixed change. This might involve some mechanical changes to conveyor belt guides and fingers or some electronic changes such as adding IR or eddy current sensors. |
| Technologies: |
Arduino, OpenCV, C++, Python, SQL, image processing, machine learning, Caffe, convolutional neural networks, basic mechanical/robotics design |
| Mentor: |
Paul Krush |
| Useful Documentation: |
https://github.com/GemHunt/CoinSorter/ |
CoinSorter: Port to Android
| Description: |
Currently a Windows PC classifies Caffe models and sends commands to control Arduino based conveyors and solenoids for sorting coins. An Android based system would great option to reduce the cost, size and complexity of the system. |
| Technologies: |
Android, Arduino, OpenCV, C++, Python, SQL, image processing, Machine Learning, Caffe, Convolutional Neural Networks |
| Mentor: |
Paul Krush |
| Useful Documentation: |
https://github.com/GemHunt/CoinSorter |
Yelp: PaaSTA
| Description: |
PaaSTA is a highly-available, distributed system for building, deploying, and running services using containers and Apache Mesos! |
| Technologies: |
Docker, Mesos, Marathon, Chronos, SmartStack, Jenkins, Sensu |
| Mentor: |
Nathan Handler |
| Useful Documentation: |
https://github.com/Yelp/paasta |
IllinoisWCS: Library Tracker
| Description: |
The goal is to create a useful library tracker web app for both members and officers. Members should be able to view available books online and request new materials. Officers should be able to be able to have an admin page where they can check in and out copies of books, see the status of the library overall with analytics, and have useful features such as click-to-email students with overdue books. Ideally we can connect to a database but also to APIs to pull down book information from the web for auto-fill. |
| Technologies: |
Django |
| Mentor: |
Nathan Handler |
| Useful Documentation: |
https://github.com/IllinoisWCS/LibraryTracker |
NodeSchool Qik
| Description: |
A combination of gulp-begin (a quick start build script for full-stack Node.js websites), Fritz (a Django-inspired back-end interface for Node.js that provides database schema creation and manipulation through a model system), and gulp-ng-svg (a templating system that provides drop-in inline SVGs as a build task and replace icon fonts and image sprites). All three of these would be brought together in a project called Qik that interactively sets up a platform for constructing websites. |
| Technologies: |
Node.js, SQL, ORM |
| Mentor: |
Brian Jesse |
| Useful Documentation: |
|
Nodep
| Description: |
See nodep.org. Nodep is a dependency injection system for Node.js. I would want to work with the team to come up with new robust features, strong tests, and possible use-cases. |
| Technologies: |
Node.js, IoC |
| Mentor: |
Brian Jesse |
| Useful Documentation: |
https://nodep.org |
AnyChat
| Description: |
A modern group chat for all of your friends and friends to be. AnyChat allows you to chat with random local people in the comfort of a group, without the awkwardness of trying to talk one on one. AnyChat gives you the ability to meet people around you with common interests and talk about enything. |
| Technologies: |
Python, Django |
| Mentor: |
Ryan Mirman |
| Useful Documentation: |
https://github.com/Rsgm/wyvern |
AgentPy
| Description: |
An agent based simulation framework for python that can be easily accessible through a GUI and provides support for production of simulated data. |
| Technologies: |
Python, C, Simulation |
| Mentor: |
Mike Tamillow |
Sysdig Lock Analysis Tooling
| Description: |
Sysdig is a tool for doing system-wide syscall tracing with minimal performance impact, making it useful for production systems. Right now, it correctly decodes some locking-related calls, but doesn't collect initial FD lock state and doesn't have any chisels or views for quickly finding places in a system where processes are blocked waiting for locks. |
| Technologies: |
C (Kernel), Lua |
| Mentor: |
Charles Duffy |
Apache - Apache Storm: Federated Storm UI
| Description: |
The storm UI currently supports single storm cluster. Having federated UI might be very useful for users with multiple topologies/resources on multiple clusters. Ability to deep drive into supervisor might also help. |
| Technologies: |
Java, Clojure |
| Mentor: |
Kishorkumar Patil |
| Useful Documentation: |
https://github.com/apache/storm |
Apache - Apache Storm: Performance Booster
Apache - Apache Storm: Simplified/Unified Metrics API
| Description: |
Storm could benefit using new simple API ( such as codahale library to provide better ability to register and report metrics) to Ganglia like reporting/aggregation system |
| Technologies: |
Java, Clojure, Codahale/Ganglia |
| Mentor: |
Kishorkumar Patil |
| Useful Documentation: |
https://github.com/apache/storm |
Apache Airavata Allocation Manager
| Description: |
Apache Airavata is software for building science gateways--user environments that help scientists make the best use of supercomputers to solve challenging problems. Airavata follows a microservices architecture. A key missing component in Apache Airavata today is to give science gateway administrators the ability to assign and manage allocations to their users to make sure that a few users don’t use up the gateway’s entire supercomputing allocation. Students who participate in this activity will develop a new Apache Airavata component that will include a database backend, middleware, and an API for the component. The students will also develop form-based submission and approval process that will prospective gateway scientists will use when applying to use a science gateway. Apache Airavata has mentored over 20 Google Summer of Code students since 2013 and is looking for more students in 2016. |
| Technologies: |
Java, C++, Python |
| Mentor: |
Suresh Marru |
| Useful Documentation: |
https://issues.apache.org/jira/browse/AIRAVATA-1893 |
Apache Airavata Web-based Workflow Editor
| Description: |
Apache Airavata is software for building science gateways--user environments that help scientists make the best use of supercomputers to solve challenging problems. Airavata follows a microservices architecture. This project involves the implementation of a scientific workflow editor user interface for Apache Airavata. Scientific workflows allow scientists to couple two or more applications, perhaps running on supercomputers across the world, into a single composite application. Apache Airavata manages the executions of these workflows and uses JSON to describe a specific workflow. The challenge will be to develop a JSON editor that is integrated with other Airavata components. Apache Airavata has mentored over 20 Google Summer of Code students since 2013 and is looking for more students in 2016. |
| Technologies: |
Java, C++, Python |
| Mentor: |
Supun Nakandala |
| Useful Documentation: |
https://issues.apache.org/jira/browse/AIRAVATA-1894 |
Apache - Apache Bigtop
| Description: |
Bigtop is an Apache Foundation project for Infrastructure Engineers and Data Scientists looking for comprehensive packaging, testing, and configuration of the leading open source big data components. Bigtop supports a wide range of components/projects, including, but not limited to, Hadoop, HBase and Spark. It would be cool to add BOSH as a "packaging" format to what Bigtop supports. |
| Technologies: |
Java, Docker |
| Mentor: |
Roman Shaposhnik |
| Useful Documentation: |
https://github.com/apache/bigtop |
Apache - Apache Eagle
| Description: |
Given that many metrics/logs in an organization needs to be computed or correlated for finding anomaly(M metrics * N computes), use metadata to onboard metric compute and metric join without any programming and metric compute/join are distributed across storm cluster. |
| Technologies: |
Java, Apache Storm, Apache Kafka |
| Mentor: |
Yong Zhang |
| Useful Documentation: |
https://github.com/apache/bigtop |
Implementing HTrace in the Nutch Web Crawler
Questions?
Shoot us an email at<EMAIL_ADDRESS>for any questions!


At Mozilla, we’re a global community of
working together to build a better internet. We want to put people first and help empower individuals to shape their own safe and independent experience.
Read the Mozilla Manifesto to learn even more about the values and principles that guide the pursuit of our mission.
There are also plenty of volunteer opportunies in a number of different areas so don't hesitate to GET INVOLVED!


@Experimental public abstract class Row extends java.lang.Object implements java.io.Serializable
Row
is an immutable tuple-like type to represent one element in a
PCollection
. The fields are described with a RowType
.
RowType
contains the names for each field and the coder for the whole
record, {see @link RowType#getRowCoder()}.
| Modifier and Type | Class and Description |
|---|---|
static class |
Row.Builder
Builder for
Row . |
| Constructor and Description |
|---|
Row() |
| Modifier and Type | Method and Description |
|---|---|
java.math.BigDecimal |
getBigDecimal(int idx)
Get a
BigDecimal value by field index, ClassCastException is thrown
if type doesn't match. |
java.math.BigDecimal |
getBigDecimal(java.lang.String fieldName)
Get a
BigDecimal value by field name, ClassCastException is thrown
if type doesn't match. |
java.lang.Boolean |
getBoolean(int idx)
Get a
Boolean value by field index, ClassCastException is thrown
if type doesn't match. |
java.lang.Boolean |
getBoolean(java.lang.String fieldName)
Get a
Boolean value by field name, ClassCastException is thrown
if type doesn't match. |
java.lang.Byte |
getByte(int idx)
Get a
Byte value by field index, ClassCastException is thrown
if type doesn't match. |
java.lang.Byte |
getByte(java.lang.String fieldName)
Get a
Byte value by field name, ClassCastException is thrown
if type doesn't match. |
java.util.Date |
getDate(int idx)
Get a
Date value by field index, ClassCastException is thrown
if type doesn't match. |
java.util.Date |
getDate(java.lang.String fieldName)
Get a
Date value by field name, ClassCastException is thrown
if type doesn't match. |
java.lang.Double |
getDouble(int idx)
Get a
Double value by field index, ClassCastException is thrown
if type doesn't match. |
java.lang.Double |
getDouble(java.lang.String fieldName)
Get a
Double value by field name, ClassCastException is thrown
if type doesn't match. |
int |
getFieldCount()
Return the size of data fields.
|
java.lang.Float |
getFloat(int idx)
Get a
Float value by field index, ClassCastException is thrown
if type doesn't match. |
java.lang.Float |
getFloat(java.lang.String fieldName)
Get a
Float value by field name, ClassCastException is thrown
if type doesn't match. |
java.util.GregorianCalendar |
getGregorianCalendar(int idx)
Get a
GregorianCalendar value by field index, ClassCastException is thrown
if type doesn't match. |
java.util.GregorianCalendar |
getGregorianCalendar(java.lang.String fieldName)
Get a
GregorianCalendar value by field name, ClassCastException is thrown
if type doesn't match. |
java.lang.Integer |
getInteger(int idx)
Get a
Integer value by field index, ClassCastException is thrown
if type doesn't match. |
java.lang.Integer |
getInteger(java.lang.String fieldName)
Get a
Integer value by field name, ClassCastException is thrown
if type doesn't match. |
java.lang.Long |
getLong(int idx)
Get a
Long value by field index, ClassCastException is thrown
if type doesn't match. |
java.lang.Long |
getLong(java.lang.String fieldName)
Get a
Long value by field name, ClassCastException is thrown
if type doesn't match. |
abstract RowType |
getRowType()
Return
RowType which describes the fields. |
java.lang.Short |
getShort(int idx)
Get a
Short value by field index, ClassCastException is thrown
if type doesn't match. |
java.lang.Short |
getShort(java.lang.String fieldName)
Get a
Short value by field name, ClassCastException is thrown
if type doesn't match. |
java.lang.String |
getString(int idx)
Get a
String value by field index, ClassCastException is thrown
if type doesn't match. |
java.lang.String |
getString(java.lang.String fieldName)
Get a
String value by field name, ClassCastException is thrown
if type doesn't match. |
<T> T |
getValue(int fieldIdx)
Get value by field index,
ClassCastException is thrown
if type doesn't match. |
<T> T |
getValue(java.lang.String fieldName)
Get value by field name,
ClassCastException is thrown
if type doesn't match. |
abstract java.util.List<java.lang.Object> |
getValues()
Return the list of data values.
|
static Row |
nullRow(RowType rowType)
Creates a new record filled with nulls.
|
static <T> java.util.stream.Collector<T,java.util.List<java.lang.Object>,Row> |
toRow(RowType rowType)
Creates a
Row from the list of values and getRowType() . |
static Row.Builder |
withRowType(RowType rowType)
Creates a record builder with specified
getRowType() . |
public static <T> java.util.stream.Collector<T,java.util.List<java.lang.Object>,Row> toRow(RowType rowType)
Row
from the list of values and getRowType()
.public <T> T getValue(java.lang.String fieldName)
ClassCastException
is thrown
if type doesn't match.@Nullable public <T> T getValue(int fieldIdx)
ClassCastException
is thrown
if type doesn't match.public java.lang.Byte getByte(java.lang.String fieldName)
Byte
value by field name, ClassCastException
is thrown
if type doesn't match.public java.lang.Short getShort(java.lang.String fieldName)
Short
value by field name, ClassCastException
is thrown
if type doesn't match.public java.lang.Integer getInteger(java.lang.String fieldName)
Integer
value by field name, ClassCastException
is thrown
if type doesn't match.public java.lang.Float getFloat(java.lang.String fieldName)
Float
value by field name, ClassCastException
is thrown
if type doesn't match.public java.lang.Double getDouble(java.lang.String fieldName)
Double
value by field name, ClassCastException
is thrown
if type doesn't match.public java.lang.Long getLong(java.lang.String fieldName)
Long
value by field name, ClassCastException
is thrown
if type doesn't match.public java.lang.String getString(java.lang.String fieldName)
String
value by field name, ClassCastException
is thrown
if type doesn't match.public java.util.Date getDate(java.lang.String fieldName)
Date
value by field name, ClassCastException
is thrown
if type doesn't match.public java.util.GregorianCalendar getGregorianCalendar(java.lang.String fieldName)
GregorianCalendar
value by field name, ClassCastException
is thrown
if type doesn't match.public java.math.BigDecimal getBigDecimal(java.lang.String fieldName)
BigDecimal
value by field name, ClassCastException
is thrown
if type doesn't match.public java.lang.Boolean getBoolean(java.lang.String fieldName)
Boolean
value by field name, ClassCastException
is thrown
if type doesn't match.public java.lang.Byte getByte(int idx)
Byte
value by field index, ClassCastException
is thrown
if type doesn't match.public java.lang.Short getShort(int idx)
Short
value by field index, ClassCastException
is thrown
if type doesn't match.public java.lang.Integer getInteger(int idx)
Integer
value by field index, ClassCastException
is thrown
if type doesn't match.public java.lang.Float getFloat(int idx)
Float
value by field index, ClassCastException
is thrown
if type doesn't match.public java.lang.Double getDouble(int idx)
Double
value by field index, ClassCastException
is thrown
if type doesn't match.public java.lang.Long getLong(int idx)
Long
value by field index, ClassCastException
is thrown
if type doesn't match.public java.lang.String getString(int idx)
String
value by field index, ClassCastException
is thrown
if type doesn't match.public java.util.Date getDate(int idx)
Date
value by field index, ClassCastException
is thrown
if type doesn't match.public java.util.GregorianCalendar getGregorianCalendar(int idx)
GregorianCalendar
value by field index, ClassCastException
is thrown
if type doesn't match.public java.math.BigDecimal getBigDecimal(int idx)
BigDecimal
value by field index, ClassCastException
is thrown
if type doesn't match.public java.lang.Boolean getBoolean(int idx)
Boolean
value by field index, ClassCastException
is thrown
if type doesn't match.public int getFieldCount()
public abstract java.util.List<java.lang.Object> getValues()
public static Row.Builder withRowType(RowType rowType)
getRowType()
.
Row.Builder.build()
will throw an IllegalArgumentException
if number of fields
in getRowType()
does not match the number of fields specified.


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.
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.
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.
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.
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.
Domestic Flights Starting from $199 1m ago
20% Cashback on hotel booking 1h ago
50% off on all items 08h ago
New Year special offer 1d ago
Domestic Flights Starting from $199 1m ago
20% Cashback on hotel booking 1h ago
Order Date: 20 Aug 2015Order Total: $566
Order Date: 20 Aug 2015Order Total: $566
Start: 22 Aug
End: 25 Aug
Payment Failed
Order Date: 20 Aug 2015Order Total: $566
Order Date: 20 Aug 2015Order Total: $566
Order Date: 20 Aug 2015Order Total: $566
Order Date: 20 Aug 2015Order Total: $566
Ticket #123456: My last booking was failed but ammount has been dedicted from my account.
Ticket #113443: My last booking was failed but ammount has been dedicted from my account.
Ticket #113443: My last booking was failed but ammount has been dedicted from my account.
Ticket #123456: My last booking was failed but ammount has been dedicted from my account.
Ticket #113443: My last booking was failed but ammount has been dedicted from my account.
Ticket #113443: My last booking was failed but ammount has been dedicted from my account.
Ticket #123456: My last booking was failed but ammount has been dedicted from my account.
Ticket #113443: My last booking was failed but ammount has been dedicted from my account.
Ticket #113443: My last booking was failed but ammount has been dedicted from my account.
Ticket #123456: My last booking was failed but ammount has been dedicted from my account.


View.Set ("graphics")
procedure getKey
var ch : char
ch := getchar
end getKey
for i : 1 .. 1000
put i : 4, " Pause till a key is pressed"
getKey
end for
Some keys, such as the left arrow key, insert key, delete key, and function keys do not produce ordinary character values. These keystrokes are returned by getch as special values. See Appendix D for these values.
This means that you can call the function by calling getchar or by calling Input.getchar.


Calculator
Write the functions to be calculated here. Restrictions serve to limit your component values to a certain degree (and make calculation much faster).
Please be considerate, syntax checking is not too strong and the program may crash if it finds unexpected results. Press F5 in those cases.
Variables to be calculated:
CalculateResults
Run the calculator with the components available in your toolbox to get the closest matches.


{% extends "compression.html" %} {% block pagetitle %}Brian R. Bondy - Huffman{% endblock %} {% block title %} Compression - Huffman {% endblock %} {% block subtitle %}Huffman trees{% endblock %} {% block main_content %}
Huffman coding is a mapping of a set of 'symbols' to a set of 'series of bits'. Each symbol corresponds to a variable length series of bits.
The more common symbols are represented with less bits, and the least common symbols are represented with more bits.
There is no algorithm which produces better results than Huffman coding, where each symbol has a binary representation. That is it is, it will always lead to optimal compression.
However, Huffman coding is not the best compression method since it does not take advantage of the relation between symbols.
Example: An 'h' follows a 'T' very often in the english language, and Huffman coding will not take that into consideration.
Each Huffman code is prefix free. Meaning no binary code is a prefix of any other binary code. If it was you wouldn't know on the decoding phase which symbol to pick, the prefix of one code which itself a symbol or to keep reading to get another symbol.
The binary representations for each symbol is made by using a binary tree. Each symbol is first stored as its own distinct leaf node. Each of these nodes also stores the frequency of the symbol. Since even a single node is considered a tree, each of these nodes are considered their own tree.
From here you simply continuously pick the 2 trees with smallest frequency and combine them into a new tree with a new parent node. The new parent node gets the frequency of both of its children added. This sequence is continued until you have no more trees to merge. The frequency of a tree is defined to be the frequency of its root node.
You now have a single tree with each leaf node being an original symbol. This tree is called a Huffman tree. Creating this tree can be done in O(nlogn) by using a priority queue.
To obtain a code for any symbol you simply start at the root node and follow down the path to the leaf node. For each left arc you follow you add a 0 to the end of your code, for each right arc that you follow you add a 1 to the end of your code.

Since Huffman encoding keeps the ordering for symbols to series of bits, other kinds of compression can usually be applied after Huffman coding. For example a compression algorithm that takes into consideration cross boundary symbols will still be useful.
Adaptive Huffman coding discovers the frequency of symbols as it processes the algorithm.
{% endblock %}


At Project Precedence, we use the most expensive, state-of-the-art technology that money can buy. We conduct the most brutal yet necessary research that small businesses cannot afford in order to save them time and money.
We catalog all of our research, from basic force calculations to complex dynamic influx airflow computations. All in one place, easy to access.
As we've said before, our research is expensive. That's why we need you, the startups, to pitch in whatever you can to help.
Want to buy an access card but not sure if it applies to your project? With world-class customer support, we can answer any and all of your questions in the nick of time.
Experiencing an issue with a product you purchased? We'll straighten it out for you. At Project Precedence, we want your business to run as smoothly as possible.
Is there something you think we're missing? Do everyone a favour and let us know. We want to make our archive as comprehensive as possible, so we need to hear your voice.


Although all themes coming with CalendarXP are in English, it's very easy to localize them into your own language. Moreover it's quite simple to setup an i18n framework with your cgi server to provide multi-language support of your website. This tutorial will help you deal with them fast.
Pick up any theme at hand and take a look at the source, you'll find all text strings in the calendar are externalized here. So what's next? Just translate the English strings to your own language strings and modify the theme css to use corresponding font family.
Certain languages may need a charset different than the default one, in which case you just need to set the 6th parameter of the name & id of iframe calendar tag with the correct charset - please refer to helloworld the beginner's tutorial for details. e.g.
<iframe name="gToday:normal:agenda.js:::utf-8" id="gToday:normal:agenda.js:::utf-8" src=...>
I18n, a.k.a internationalization, is to make your page available in different languages at the same time. You'll be preparing resources in different language and feeding the browser with the one chosen by the end user.
First, you need to localize the theme you choose into different languages and name them with specific suffixes. e.g. For mini theme localized in French, we can have mini_fr.css and mini_fr.js. If you were to use any strings in plugins or agendas, you may either create plugins_fr.js and agenda_fr.js accordingly, or externalize the text strings into an array and append it to mini_fr.js.
Next, you need to create server-side wrappers for the engine files so that a correct charset encoding header will be sent to the browser. The wrapper is nothing but a file with a http charset setting and an "include" tag in the syntax of the cgi tech your server employed. Taking ASP as example, we need to create the iflateng.asp as following: (You may need to do same thing for nflateng.asp if you need to support Netscape 4.x)
<%
Response.Charset=Request.QueryString("sel_charset")
%>
<!-- #include file="iflateng.htm" -->
Copy the file into the same directory where the iflateng.htm engine file is located, then modify the calendar tag to use the wrapper file as the code source accordingly. e.g.
<iframe name="gToday:mini:agenda.js" id="gToday:mini:agenda.js"
src="iflateng.asp" ...>
</iframe>
Finally, dynamically generate the theme name and sel_charset
according to the language/charset used in your page.
<iframe name="gToday:mini_<%=selected_language%>:agenda.js" id="gToday:mini_<%=selected_language%>:agenda.js"
src="iflateng.asp?sel_charset=<%=selected_charset%>" ...>
</iframe>
The selected_language
can be "fr", "cn"
or any language code used by your localized theme. The selected_charset
can be "iso-8859-1", "gb2312" or any charset employed
by your theme correspondingly.
Note: the server-side wrappers approach can also be replaced by setting the 6th parameter of the name & id to the correct charset. e.g.
<iframe name="gToday:normal:agenda.js:::<%=selected_charset%>" id="gToday:normal:agenda.js:::<%=selected_charset%>" src=...>


snabbt.js is a perfect fit for text animations. Each letter is rotated around the x-axis with a really tight perspective.
Again please!
DOM elements animated with
snabbt.js
.


Wireframes and flows created for Pogo Games
Initial deal layouts
Mid-game layout
Max-State layout
Initial deal layouts
Mid-game layout
Max-State layout
Win/loss screen layout
With annotation marks
Initial deal layouts
Initial deal layouts
Mid-game layout
Initial deal layouts
Mid-game layout
Max-State layout


Optic tract:
-
Macula
- central scotoma
-
Anterior to optic chiasm
- uniocular visual loss
-
within the optic chism
- bitemporal hemianopia
-
posterior to optic chiasm
-
Optic tract
-
Lateral geniculate body
-
optic radiation
-
occipital cortex
-
homonymous hemianopia
-
most common cause =
-
elderly = stroke
- CT = best investigation
-
-
-
-
retinal vein occlusion
-
branch vs. central
-
images
-
sudden loss of vision
-
scattered retinal haemorrhages and tortuous retinal veins
- in region of occluded vein
-
associated with hypertension
-
refer within 2 weeks
-
usually has a benign course
-
improve spont. within 2 months
-
consider laser if not improved within 3mo
-
rare causes;
-
rheumatological
-
behcet’s syndrome
-
antiphospholipid syndrome
-
protein c deficiency
-
-
inflammatory
-
sarcoidosis
-
Wegener’s granulomatosis
-
-
Exudative age related macular degeneration
-
subretinal haemorrhages
-
drusen deposits
-
tiny yellow/white accumulations of extracellular material
-
noraml >40yo to have a few drusen deposits
-
Central retinal artery occlusion
-
diffuse pallor
- retinal ischaemia
-
occlusion usually related to embolus
-
carotid arteirs or from ehart valves
-
-
fovea appears red
-
this part of retina is thin
-
intact choroidal circulation shines through fovea
- “cherry red spot”
-
-
refer within 24hours of symptoms
-
possible to prevent permanent ischaemica of retina by dislodging the embolus
-
then to stroke clinic
-
doppler
-
echocardiogram
-
-
-
GCA may also present with retinal artery occlusion
retinal artery detachemnt
-
inner sensory retina detaches from underlying pigmented epithelium
-
symptoms
-
floaters
-
flashers
-
Loss of vision
-
also shadow or curtain
-
-
tear or hole
- secondary to posterior vitreous detachment or an ocular trauma
-
associated with
-
congenital malformations
-
trauma
-
vascular disease
-
choroidal tumours
-
high myopia
-
vitrous disease/degeneration
-
Optic nuritis
-
inflammation of optic nerve may be idiopathic
-
comonly associatedwith multiple sclerosis
-
risk of developing MS after episode of isolated optic neuritis = 30% at 5yrs
-
15-20% with MS present with ON
-
38-58% have ON at some point in MS course
-
-
refer opthalmologist within 1wk
-
intravenous steroids
- reduce recurrence of disease
-
oral prednisolone ineffective
-
neuromyelitis optica
- iv steroid indicated
-
impaired colour vision
- red
-
pain on eye movement
posterior vitreous attachment
-
vitreous gel that fills middle of eye
- contracts and separates from retina
-
liquefaction of vitrous jelly
-
normally occurs as people get older
-
floaters and flashers
-
can lead to retirnal tear
-
?associated with loss of vision
Giant cell arteritis
-
diagnosis can be difficult
-
28% will have skip lesions
-
American College of Rheumatology’s 1990 classification
-
=≥3 = sens 94% and 91% spec
-
>50yo
-
localised headache of new onset
-
ESR ≥ 50mm in first hour
-
tenderness in palpation over temporal artery
-
abnormal temporal artery biopsy
-
granulomatous infiltration
-
disruption of internal elastic lamina
-
proliferation of intima
-
occulsion of the lumen
-
-
-
-
ask about:
-
headahce
-
weight loss
-
shoulder pain
-
jaw claudicaiton
-
recent episodes of transient loss of vision
-
-
consider USS


{% extends "layout.html" %} {% block page_title %} Money Claims Prototype {% endblock %} {% block proposition_header %} {% set my_account="2" %} {% include "includes/propositional_navigation.html" %} {% endblock %} {% block content %} {% include "includes/phase_banner_beta.html" %} Back {{formData | safe}} You can't use mediation You said you can't agree to these conditions: you're willing to be flexible you know all the facts of the dispute you can take a one-hour call between 9am and 5pm on Monday to Friday If you want to try mediation you can change your answer. {% include 'prototypes/prototype-nov-2018/includes/contact.html' %} {% endblock %}
You said you can't agree to these conditions:
If you want to try mediation you can change your answer.


Hello! I am Adwaita. Welcome to my small world of web. I am a computer geek and extremely passionate about Data Science and Artificial Intelligence.
Apart from that I also dance, play baseball & softball and work as a professional actor.
I read books related to philosophy, spirituality and fiction. I consider 'Mother Teresa' as my role model
and firmly believe that kindness can surely make this world a better place to live.
I believe,
" You got a dream... You gotta protect it.
People can't do somethin' themselves, they wanna tell you you can't do it. If you want somethin',
go get it. Period."
- Chris Gardner
-
Programming Languages:
C++, Java, Python3 and Shell Scripting.
-
Front End: HTML, CSS, AngularJS 6/7.
-
Database: MySQL, Hive and MongoDB.
-
Frameworks: Ruby on Rails, Hadoop and Django.
-
Operating Systems: Linux, Unix and Windows.
-
Tools/Libraries/Technologies: Tensorflow, Tableau, Informatica, Sqoop, OpenCV and Cloud(Azure and AWS).
“The mind once enlightened by experiences cannot again become dark.”
-
Data Engineer at Schlumberger, Pune July 2018 - (Currently working).
-
Currently contributing in ETL process involving tools,Languages and technologies such as Informatica,Sqoop,Hive and Hadoop framework.
-
Contributing towards automating jobs with help of shell scripts.
-
Data Scientist at Gateway IT Solutions, Pune (July 2017 - March 2018) .
-
Used tableau to help clients make better decision.
-
Was responsible for Master Data Management.
- Academics :
- Awarded as 'The All Rounder' student for year 2017-2018,MIT(Pune Uniersity).
- Awarded 'The Best Student' by TCS(Tata Consulting Services) for year 2017-2018,MIT(Pune Uniersity).
- Awarded 'Shelar Mama Award' for contribution in education for underprivileged.
- Awarded Gold and Silver medal in Computer science for years 2016-2017,2017-2018 respectively at MIT(Pune Uniersity).
- Received scholarship from University of Texas Dallas (MS in CS- Data Science specialization).
- Won National level Abacus Mathematics competition (Scored 100/100 in 8 levels of abacus).
- Awarded Scholarship in Physics for year 2014-2015 at, NMV High School(Pune Uniersity)
- Acting and Dance :
- Film for FTII(Film and Telivision Institute Of India): 'Aranya'.
(Selected for Seven Hills Film Festival,Hungary and also awarded by NFAI among top 5 films of Asia.)
- Feature Film: 'Tendlya', acclaimed by cricket player 'Sachin Tendulkar', worked as a Lead Actress
- Best Actress (Kakaji award) in Purushottam Karandak (2016) for play 'Kashti'
- Maunantar Karandak (3rd prize): Play 'The Day'
- Firodiya Karandak(3rd Prize): Play 'Mishmi'
-
Sports:
- First Prize(1st ) Throwball (State Level)
- Second Prize(2nd) Softball (State level)
- Second Prize(2nd) Baseball(State Level)
- Second Prize(2nd) Kho-Kho (State Level)
- First Prize(1st) Kabbadi (District Level)
-
Poetry:
- 'The Home' (Literature Writing).
- 'Lakeerein' (Hindi Poem for a play).
- 'The Burried Things'(Nominated for the best poem at Kerala Literature Festival).
-
Social Service:
- Founder of "Abhyass" organization which works for technical education of students in villages across India.
- Volunteer at TeachIndia for teaching at various tribal schools in India.
- Member of ‘Robin Hoods Army” (NGO) from December 2013. Active volunteer for providing food for underprivileged and needy.


{% extends 'base.html' %} {% block body %}
Some quick example text to build on the card title and make up the bulk of the card's content.


Reports identical
catch
sections in a single
try
statement. Such sections can be collapsed into a multi-catch section.
This inspection only reports if the language level of the project or module is 7 or higher


Welcome to CarpetJS
A conventions based soft layer on top of express and mongoose for smooth web api development.
How To Install
// code samples coming soon.
Features
More to come here..
Authors and Contributors
Support or Contact
Having trouble with CarpetJS? Check out the documentation or create an issue and we’ll help you sort it out.


A product is added to cart just right after a customer clicks plus button. Customer see current count of product at products list.
The same logic at product page.
For products with variants default behaviour is kept, i.e. number means count of products to add after clicking "Add to cart".
Contact us by email or fill out request form


Shifting mobility patterns –
environmental change and migration to and from the Nepali plains
Climate Change and Human Mobility Workshop
26 - 27 March 2015
Fenner School of Environment and Society,
The Australian National University, Canberra
Prof. Graeme Hugo
,
ARC Australian Professorial Fellow,
Geography, Environment & Population,
The University of Adelaide
Outline
- Introduction
- Exposure to agricultural risks
- Perception and adaptation to climate change
- Human mobility and resilience in the Nepali plains (the Tarai)
- Conclusion
1. Introduction
- Ongoing PhD project
- Field questionnaire survey (September 2013 - March 2014)
- Open-ended interviews (November 2013 - March 2014)
- Climate data analysis using daily records from 1970-2012 from 10 stations
- Explore linkages between environmental change and subsequent livelihood decisions by households
Study sites
Dhangadhi, Far-west Nepal
Damak, East Nepal
Background on Nepali plains - the Tarai
- Tarai has been a destination of in-migrants moving from the hills since the 1960s (Gurung, 1989; Kansakar, 1985)
- Tarai has also witnessed massive socio-ecological change
- Forest clearing and malaria eradication
- Agricultural extensification to feed the nation
- Urbanization
- Tarai is also seen as a region neglected by the central government (Majumdar, 2006); marginalized communities have been left out of the decision making process in resource management including community forestry (Gauli & Rishi, 2004)
- Shares open border with India
Background on Nepali plains - the Tarai
Historic internal migration pattern based on prior residence
Map usage subject to Google Maps API Terms of Service (http://developers.google.com/maps/terms)
Household characteristics
|
Damak |
Dhangadhi |
| Sample households |
143 |
151 |
| Total households |
3,989 |
4,624 |
| Total population in selected wards |
15,909 |
25,726 |
| Mean age: respondents; respondents' family |
45.15; 34.11 |
39.6; 25.62 |
| Gender distribution |
M 75.5%; F 24.5% |
M 43.0%; F 57.0% |
| Livestock ownership |
68.53% |
96.69% |
| Involvement in agriculture |
77.62% |
90.07% |
| HH with migrant worker |
49.65% |
56.28% |
| HH w/ flood experience |
49.65% |
56.29% |
| HH's median land area in sq. m. |
6,773 |
4,741 |
| Median household size |
5 |
6 |
| Indigenous % |
17 |
25 |
2. Exposure to agricultural risks
- High inter-annual variability in rainfall - floods and droughts
- Mediocre agricultural infrastructure
Rainfall variability
Inter-annual variability in mean monthly rainfall in Tarahara Station (1971 - 2012 aggregate)
Trends in rainfall
Trend in annual total precipitation (PREPTOT) in three stations
For Nepalgunj RO, Mann Kendall p = 0.0108, Kendall's Tau =-0.3084
, Sen's slope = -15.8
Agricultural infrastructure
- Irrigation system: only small percentage with access to canals, and the structure has not been properly maintained
- Electricity: supply is not constant, up to 18 hours per day load shedding
- Cost barrier: cost of pump, cost of bore hole, cost of fuel, cost of pipe and cost of labour
- Only 3 respondents out of 294 had started harvesting a new crop in the last 5 years
Flash floods
- Sediment deposit on the field was the most reported problem from floods
- No mechanism for compensation when land is lost
- Only 18 respondents had received any form of relief
- No insurance mechanism
3. Perception and adaptation
- Perception of climate change
- Perception of trends in agricultural output
- In-situ adaptation examples
Perception of impact from changes in climatic variables
Perception of changes in eleven climatic variables
Perception of impact from changes in climatic variables
In Damak, the perceptions were significantly related to respondents' prior experience with flood χ2(2, N = 143) = 6.6206, p = 0.04
Perception of trends in agricultural output
The respones were not significantly related with respondents' prior experience with flood or, with respondents' family having a migrant member or not
Coping and adaptation
"Nothing can be done."
(6 respondents in questionnaire survey)
"When the field was dry, land owner accused me of not working hard enough. Pump set is not available when needed."
(female-25 from Dhangadhi, 3 Feb 2014)
"Rainfall is the best [for paddy]. Pumped water do not contain vitamins."
(female-33 from Dhangadhi, 3 Feb 2014)
In-situ adaptation examples
- Farming of high value crops along the river banks when it is dry
- Requires constant safeguard
- No legal entitlement
- Prone to flooding
In-situ adaptation examples
- Procuring fodder and firewood
- Forests in the Tarai are highly protected now compared to in the past when it used to be a common pool resource
- Not all families can afford the payment and have resorted to fetching firewood from across the border
- During flooding period, locals collect trees and branches brought by the flood.
In-situ adaptation examples
- Hiring paid labour for agriculture
- Labour from outside of the family needed
- Upfront investment for planting, transplanting and harvesting labour
4. Human mobility and resilience in the Tarai
- Contemporary destinations
- Demographics
- Migrant households' narratives
- Migration characteristics
Contemporary destinations for migrant workers
Destination regions of migrant members from surveyed households
one arc represents one migrant from surveyed households
Migrant Households' narratives
- Economic reasons - inadequate income from local jobs
- Adhiya system of land tenure by which the poor or the landless use farmlands and pay half of the produce in return
- Farm income does not enable households to accure assets, remittance on the otherhand, if successful yields much higher earnings
Choice of destinations of migrants from surveyed households
|
Damak |
Dhangadhi |
| India |
3 |
101 |
| Middle East |
60 |
5 |
| Internal (within Nepal) |
5 |
18 |
| South East Asia |
32 |
7 |
| Other |
6 |
1 |
|
Migrants' age, education and years in foreign employment
SE Asia, especially Malaysia has become the destination of choice for most migrants from the Tarai
Formal education of migrants
Migrants to new international destinations have higher median education
Remittances by destination
Remitances from new international destinations are significantly more than from traditional destinations. National GPD per capita for 2013 was USD 694 (World Bank, 2014)
Findings
- There is no significant decline in cultivation in migrants' households as the remaining members continute farming and livestock practice
- Labour migration opportunities remain the most important factor in household decision making. Low winter rainfall and failure of irrigation systems prompted some farmer to leave land fallow during the winter of 2013/14
- Migrants going to India and the Middle East have significantly lower formal education compared to internal migrants and migrants going to new destinations in SE Asia. This agrees with findings from Findlay (2011) and Massey et al. (1993)
Findings
- The popularity of international destinations disagrees with the theories that most of the environmental change initiated movements will be within national/regional boundaries (Findlay, 2011) perhaps because to the established international networks and any pressure due to environmental change simply reinforces these.
- Since the use of remittances for basic household activities and the fact that remittance income is disproportionately larger than income made at home, the trend in foreign employment is expected to continue
5. Conclusion
- Although a deterministic environmental change - migration relationship was not found, the case studies qualifies the value of environmental variables in migration decision making at the household level
- This calls for rethinking adaptation in terms of the extent of adjustment that the societal system will change to become resilient (Bardsley, 2014) and begs inclusion of migration in adaptation policies (Black et al., 2011; Black, Kniveton & Schmidt-Verkerk, 2011)
- By tapping on the trans-local network, the resilience of migrants' household and the community is expected to be strengthened
References
- Bardsley, D. K. 2014, 'Limits to adaptation or a second modernity? Responses to climate change risk in the context of failing socio-ecosystems, Environmental Development & Sustainability, DIO 10.1007/s10668-014-9541-x
- Black, R, Bennett, SRG, Thomas, SM & Beddington, JR 2011, 'Migration as adaptation', Nature Climate Change, vol. 478.
Black, R, Kniveton, D & Schmidt-Verkerk, K 2011, 'Migration and climate change: towards and integrated assessment of sensitivity', Environment and Planning A, vol. 73, pp. 431-450.
- Findlay, AM 2011, 'Migrant destinations in an era of environmental change', Global Environmental Change, vol. 2011.
- Gauli, K & Rishi, P 2004, 'Do the marginalised class really participate in community forestry? A case study from western Terai region of Nepal', Forests Trees and Livelihoods, vol. 14, no. 2-4
- Gurung, H. (1989). Regional Patterns of Migration in Nepal. Hawaii, USA: East-West Center.
- Kansakar, V. B. S. (1985). Land resettlement policy as a population distribution strategy in Nepal. In L. A. Kosinski & K. M. Elahi (Eds.), Population redistribution and development in South Asia. Dordrecht, Holland: D. Reidel Publisihing Company.
- Karmacharya, J 2010, Exploring daily rainfall data to investigate evidence of climate change in Kathmandu Valley and its implication in rice farming in the area, Ministry of Agriculture, Kathmandu, Nepal.
- Majumdar, M 2006, 'धनी ठाऊँ, गरिब अर्थतन्त्र (Rich place, poor economy)', in M Mainali & B Thapa (eds), मधेस: समस्या र संभावना (Madhesh: challanges and opportunities), Social Science Baha, Himal Association, Lalitpur, Nepal, pp. 29-40.
- Massey, DS, Arango, J, Hugo, G, Kouaouci, A, Pellegrino, A & Taylor, JE 1993, 'Theories of International Migration: A Review and Appraisal', Population Council, vol. 19, no. 3, pp. 431-466.
- World Bank 2014, 'World Bank development indicators', URL: http://data.worldbank.org/indicator/NY.GDP.PCAP.CD/countries accessed 3-08-2014
Acknowledgements
- Field-work and partial workshop travel funding from Department of Geography, Environment & Population, The University of Adelaide
- Partial workshop travel funding from Australian National University, Climate Change Institute
- Field research assistants Shreekrishna Chaudhary and Sujan Ranjitkar
- Local contact persons - Umesh Dhimal, Tejpal Dhimal, Laxmi Niraula and Kanchan Ojha
- Special thanks to Damak Municipality, Dhangadhi Municipality, Mercycorps Nepal, ADF Nepal Pvt. Ltd., and Neeraj Dangol


Books
Add new book:
Name:
Author:
Year:
Add to list
Book list:
Name
Author
Year
Actions
No books available
Open
Edit
Remove


WriteSerialPortString()
Syntax
Result = WriteSerialPortString(#SerialPort, String$ [, Format])Description
Writes a string to the specified serial port.
Parameters
#SerialPort The serial port to use. String$ The string to write. Format (optional) The string format to use. It can be one of the following value: #PB_Ascii : the string will be written in ascii format (default, even in unicode mode). #PB_UTF8 : the string will be written in UTF8 format. #PB_Unicode : the string will be written in unicode (UTF16) format.
Return value
The number of bytes written to the serial port, or zero if the operation has failed.
Remarks
To check how much data is available in the output buffer, use AvailableSerialPortOutput().
See Also
OpenSerialPort(), WriteSerialPortData()
Supported OS
All


{{name | capitalize}} {{firstLastName | capitalize}} {{secondLastName | capitalize}}
Canton: {{canton}}
District: {{district}}
Province: {{province}}
Birth Date: {{birthDate}}
New User Registration
Electoral Code/ Username *
Password *
Birth Date *
Gender *
Masculine
Female
Name *
First Surname *
Second Surname
Province
Canton
District
Ethnic Group
Expiration Date *
Are you an Admin?
Submit
VoteMachine.IO
You need to
Log In
or
Register
before you can vote.


Site Details:
| ParticipantID | Current Lesion Type | Age of Dx | Year of Dx | Lesion Type | Specimen Collected | Biomarker Tested | Labcas Files | Actions |
|---|
| ParticipantID | Current Lesion Type | Age of Dx | Year of Dx | Lesion Type | Specimen Collected | Biomarker Tested | Labcas Files | Actions |
|---|


ZIKV immunity age risk infection outbreak Zika []. population model rate virus data epidemic years number time vaccination ;():–. attack vaccine {border-style transmission year congenital group px;} #ffffff;} women information protective used Health Managua, Nicaragua future outbreaks adverse resulting cases reintroduction (Fig French Virus based immunity, proportion rates World age-specific considered different herd microcephaly new overall reproductive seroprevalence using Sciences Supporting distribution infected lifelong reintroductions vector compared from: individuals levels px; {font-family Medicine Nicaragua. Vaccination [], al.Zika antibodies development duration font-size immune likely old studies susceptible (.–.) ABM Available CrI: Dis. Pathogens Polynesia SIR [Online]. additional coverage disease double; effect effective fitted incidence outbreak, outbreak. outcomes people period probability reproduction result rise showed study surveillance (.; (A) (B) Biology Fig Life Managua Med. Model Polynesia, S). abundance adults aged approach assumed births border-color border-width caused circulation dynamics end endemic estimates evolution expected general groups high higher highest loss lower observed occur outbreaks. parameters population. pregnancy reduce regions relative reported scenarios scenariosc solid; step targeted threshold timing values {font-style {font-weight (Table ;(). Americas B). Bern, Data Flaviviruses: Immunology: Infect Negl Parameter Risk Transmission Trop age-stratified ageing agent-based agents analysis assuming available basic bold burden children courier; deterministic early em; epidemics estimated given immunity. implementation increase influence mathematical mean migration model, models population, populations predict propagation pt;} range reduced reintroduced remains results review simulations. structure total trials trimester, weekly


prediction = [ 1 + e-wTx ] -1
wTx = 0.94 - 3.9 notmarried - 0.47 BlueCollar - 0.59 CommunityCollege
Feature Importance
Regression for Neighbourhood of Observation 1
Quality of regression statistic:
aic =
160.0
"b-counterfactual value" = numeric value needed to be at the decision boundary
"actual b-counterfactual value" determined by carrying out a grid search on the target AI system.
| feature | input value | actual b-counterfactual value | regression estimated b-counterfactual value | b-counterfactual fidelity error |
|---|
"c-counterfactual value" = categorical value that flips the observation's classification
"actual c-counterfactual value" determined by running target AI system with c-counterfactual.
| feature | input value | c-counterfactual value | actual c-counterfactual value | regression forecast using c-counterfactual | regression forecast error |
|---|
| Feature | age | hoursPerWeek | mar=notmarried | occ=BlueCollar | gen=Female | wor=Private | edu=CommunityCollege |
|---|---|---|---|---|---|---|---|
| -1.33 | -2.08 | 1 | 1 | 1 | 1 | 1 |
['BlueCollar', 'CommunityCollege', 'notmarried']
[1.0, 1.0, 1.0]
[-3.9064245238136857, -0.47186756912794325, -0.5922628647213405]
0.9395872624731653
logistic


---
layout: default
permalink: /release/release-notes-:title
---
{% include link-list.html
title="Compatible extensions"
entries=page.extensions %}
{% include link-list.html
title="Web application (.war)"
entries=page.binary-war %}
{% include link-list.html
title="Source"
entries=page.source-archives %}
{% include link-list.html
title="Release documentation"
entries=page.documentation %}
Guacamole {{ page.title }}
{{ content }}


| Opcode* | Instruction | Op/En | 64-Bit Mode | Compat/Leg Mode | Description |
|---|---|---|---|---|---|
| 0F 01 /1 | SIDT m | M | Valid | Valid | Store IDTR to m. |
| Op/En | Operand 1 | Operand 2 | Operand 3 | Operand 4 |
| M | ModRM:r/m (w) | NA | NA | NA |
Stores the content the interrupt descriptor table register (IDTR) in the destination operand. The destination operand specifies a 6-byte memory location.
In non-64-bit modes, if the operand-size attribute is 32 bits, the 16-bit limit field of the register is stored in the low 2 bytes of the memory location and the 32-bit base address is stored in the high 4 bytes. If the operand-size attri-bute is 16 bits, the limit is stored in the low 2 bytes and the 24-bit base address is stored in the third, fourth, and fifth byte, with the sixth byte filled with 0s.
In 64-bit mode, the operand size fixed at 8+2 bytes. The instruction stores 8-byte base and 2-byte limit values.
SIDT is only useful in operating-system software; however, it can be used in application programs without causing an exception to be generated if CR4.UMIP = 0. See “LGDT/LIDT—Load Global/Interrupt Descriptor Table Register” in Chapter 3, Intel® 64 and IA-32 Architectures Software Developer’s Manual, Volume 2A, for information on loading the GDTR and IDTR.
The 16-bit form of SIDT is compatible with the Intel 286 processor if the upper 8 bits are not referenced. The Intel 286 processor fills these bits with 1s; processor generations later than the Intel 286 processor fill these bits with 0s.
IF instruction is SIDT THEN IF OperandSize = 16 THEN DEST[0:15] ← IDTR(Limit); DEST[16:39] ← IDTR(Base); (* 24 bits of base address stored; *) DEST[40:47] ← 0; ELSE IF (32-bit Operand Size) DEST[0:15] ← IDTR(Limit); DEST[16:47] ← IDTR(Base); FI; (* Full 32-bit base address stored *) ELSE (* 64-bit Operand Size *) DEST[0:15] ← IDTR(Limit); DEST[16:79] ← IDTR(Base); (* Full 64-bit base address stored *) FI; FI;
None.
| #GP(0) |
If the destination is located in a non-writable segment. If a memory operand effective address is outside the CS, DS, ES, FS, or GS segment limit. If the DS, ES, FS, or GS register is used to access memory and it contains a NULL segment selector. If CR4.UMIP = 1 and CPL > 0. |
| #SS(0) | If a memory operand effective address is outside the SS segment limit. |
| #PF(fault-code) | If a page fault occurs. |
| #AC(0) | If alignment checking is enabled and an unaligned memory reference is made while CPL = 3. |
| #UD | If the LOCK prefix is used. |
| #GP | If a memory operand effective address is outside the CS, DS, ES, FS, or GS segment limit. |
| #SS | If a memory operand effective address is outside the SS segment limit. |
| #UD | If the LOCK prefix is used. |
| #GP(0) |
If a memory operand effective address is outside the CS, DS, ES, FS, or GS segment limit. If CR4.UMIP = 1. |
| #SS(0) | If a memory operand effective address is outside the SS segment limit. |
| #PF(fault-code) | If a page fault occurs. |
| #AC(0) | If alignment checking is enabled and an unaligned memory reference is made. |
| #UD | If the LOCK prefix is used. |
Same exceptions as in protected mode.
| #SS(0) | If a memory address referencing the SS segment is in a non-canonical form. |
| #UD |
If the destination operand is a register. If the LOCK prefix is used. |
| #GP(0) |
If the memory address is in a non-canonical form. If CR4.UMIP = 1 and CPL > 0. |
| #PF(fault-code) | If a page fault occurs. |
| #AC(0) | If alignment checking is enabled and an unaligned memory reference is made while CPL = 3. |


|
Contributors |
|
Lead |
Role |
Contact Info |
| Gary R. Bradski | Manager, Lead Designer, Architect |<EMAIL_ADDRESS>|
| Vadim Pisarevsky | Software Group Leader, Architect |
|
Contributor |
Contribution |
Contact Info |
| Dmitry Abrosimov | Optimizations; Eigen Objects; Image Rectification | |
| Jean-Yves Bouguet | Calibration; L-K in pyramid; Various Optical Flow; 3D gesture; 3D vision routines; Tracking; Documentation. |<EMAIL_ADDRESS>|
| Gary R. Bradski | Initial idea for the library; CAMSHIFT; Histogram Recognition; Motion Templates; Calibration; 3D Gesture; Tracking; POSIT, Documentation; Various Utilities. |<EMAIL_ADDRESS>|
| Valery Cherepennikov | Optimizations; Kalman; Condensation; Matrix Functions; Motion Template | |
| Michael Chu | Documentation; Graphics Design; Hardware Support; 3D Gesture |<EMAIL_ADDRESS>|
| Boris Chudinovich | Consulting, Contour Processing | |
| Prof. Trevor Darrell | Stereo algorithms (in process, not in library yet) | |
| Bob Davies | First one to push for open source; General software support; contributing future COM wrappers |<EMAIL_ADDRESS>|
| Prof. James Davis | Motion templates |<EMAIL_ADDRESS>|
| Victor Eroukhimov | Hough Transform; Scripting Environment; 3D gesture; Extensive Documentation. | |
| Prof. Irfan Essa | First extensive use of library and feedback | |
| Radek Grzeszczuk | 3D gesture |<EMAIL_ADDRESS>|
| Mark Holler | Visual interactivity group manager; facilitation; inspired 3D Gesture |<EMAIL_ADDRESS>|
| Prof. Jitendra Malik | Normalized cuts (in process); general support | |
| Sergey Molinov | Snakes; HMM implementation; Canny; POSIT; Contour processing | |
| Valery Mosyagin | Calibration; View morphing | |
| Ara Nefian | embedded-HMM; Face recognition. |<EMAIL_ADDRESS>|
| Sergey Oblomov | Optimizations; Histograms; CAMSHIFT; Thresholds | |
| Prof. Pietro Perona | General support and help with securing calibration license from Cal Tech. | |
| Vadim Pisarevsky | Optimization; Had a hand in almost every demo application; Contours | |
| Alexander Pleskov | Contour processing; Pyramid segmentation; color iteration segmentation. | |
| Chuck Richards | Convex Hull; Triangulation; Tesselation; Kalman and Condensation filter design. |<EMAIL_ADDRESS>|
| Prof. Stan Scarloff | Extensive use of library, general feedback | |
| Stewart Taylor | Function design consultation; development of the library primitives concept | |
| Prof. Carlo Tomasi | Stanford Prof. While he contributed no code directly, we found many of his algorithms useful to implement such as "good features to track" and Earth Mover's Distance, and in the future Affine feature measures for tracking. |


SUBROUTINE CGEEQU( M, N, A, LDA, R, C, ROWCND, COLCND, AMAX, $ INFO ) * * -- LAPACK routine (version 3.1) -- * Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. * November 2006 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N REAL AMAX, COLCND, ROWCND * .. * .. Array Arguments .. REAL C( * ), R( * ) COMPLEX A( LDA, * ) * .. * * Purpose * ======= * * CGEEQU computes row and column scalings intended to equilibrate an * M-by-N matrix A and reduce its condition number. R returns the row * scale factors and C the column scale factors, chosen to try to make * the largest element in each row and column of the matrix B with * elements B(i,j)=R(i)*A(i,j)*C(j) have absolute value 1. * * R(i) and C(j) are restricted to be between SMLNUM = smallest safe * number and BIGNUM = largest safe number. Use of these scaling * factors is not guaranteed to reduce the condition number of A but * works well in practice. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input) COMPLEX array, dimension (LDA,N) * The M-by-N matrix whose equilibration factors are * to be computed. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * R (output) REAL array, dimension (M) * If INFO = 0 or INFO > M, R contains the row scale factors * for A. * * C (output) REAL array, dimension (N) * If INFO = 0, C contains the column scale factors for A. * * ROWCND (output) REAL * If INFO = 0 or INFO > M, ROWCND contains the ratio of the * smallest R(i) to the largest R(i). If ROWCND >= 0.1 and * AMAX is neither too large nor too small, it is not worth * scaling by R. * * COLCND (output) REAL * If INFO = 0, COLCND contains the ratio of the smallest * C(i) to the largest C(i). If COLCND >= 0.1, it is not * worth scaling by C. * * AMAX (output) REAL * Absolute value of largest matrix element. If AMAX is very * close to overflow or very close to underflow, the matrix * should be scaled. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * > 0: if INFO = i, and i is * <= M: the i-th row of A is exactly zero * > M: the (i-M)-th column of A is exactly zero * * ===================================================================== * * .. Parameters .. REAL ONE, ZERO PARAMETER ( ONE = 1.0E+0, ZERO = 0.0E+0 ) * .. * .. Local Scalars .. INTEGER I, J REAL BIGNUM, RCMAX, RCMIN, SMLNUM COMPLEX ZDUM * .. * .. External Functions .. REAL SLAMCH EXTERNAL SLAMCH * .. * .. External Subroutines .. EXTERNAL XERBLA * .. * .. Intrinsic Functions .. INTRINSIC ABS, AIMAG, MAX, MIN, REAL * .. * .. Statement Functions .. REAL CABS1 * .. * .. Statement Function definitions .. CABS1( ZDUM ) = ABS( REAL( ZDUM ) ) + ABS( AIMAG( ZDUM ) ) * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'CGEEQU', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) THEN ROWCND = ONE COLCND = ONE AMAX = ZERO RETURN END IF * * Get machine constants. * SMLNUM = SLAMCH( 'S' ) BIGNUM = ONE / SMLNUM * * Compute row scale factors. * DO 10 I = 1, M R( I ) = ZERO 10 CONTINUE * * Find the maximum element in each row. * DO 30 J = 1, N DO 20 I = 1, M R( I ) = MAX( R( I ), CABS1( A( I, J ) ) ) 20 CONTINUE 30 CONTINUE * * Find the maximum and minimum scale factors. * RCMIN = BIGNUM RCMAX = ZERO DO 40 I = 1, M RCMAX = MAX( RCMAX, R( I ) ) RCMIN = MIN( RCMIN, R( I ) ) 40 CONTINUE AMAX = RCMAX * IF( RCMIN.EQ.ZERO ) THEN * * Find the first zero scale factor and return an error code. * DO 50 I = 1, M IF( R( I ).EQ.ZERO ) THEN INFO = I RETURN END IF 50 CONTINUE ELSE * * Invert the scale factors. * DO 60 I = 1, M R( I ) = ONE / MIN( MAX( R( I ), SMLNUM ), BIGNUM ) 60 CONTINUE * * Compute ROWCND = min(R(I)) / max(R(I)) * ROWCND = MAX( RCMIN, SMLNUM ) / MIN( RCMAX, BIGNUM ) END IF * * Compute column scale factors * DO 70 J = 1, N C( J ) = ZERO 70 CONTINUE * * Find the maximum element in each column, * assuming the row scaling computed above. * DO 90 J = 1, N DO 80 I = 1, M C( J ) = MAX( C( J ), CABS1( A( I, J ) )*R( I ) ) 80 CONTINUE 90 CONTINUE * * Find the maximum and minimum scale factors. * RCMIN = BIGNUM RCMAX = ZERO DO 100 J = 1, N RCMIN = MIN( RCMIN, C( J ) ) RCMAX = MAX( RCMAX, C( J ) ) 100 CONTINUE * IF( RCMIN.EQ.ZERO ) THEN * * Find the first zero scale factor and return an error code. * DO 110 J = 1, N IF( C( J ).EQ.ZERO ) THEN INFO = M + J RETURN END IF 110 CONTINUE ELSE * * Invert the scale factors. * DO 120 J = 1, N C( J ) = ONE / MIN( MAX( C( J ), SMLNUM ), BIGNUM ) 120 CONTINUE * * Compute COLCND = min(C(J)) / max(C(J)) * COLCND = MAX( RCMIN, SMLNUM ) / MIN( RCMAX, BIGNUM ) END IF * RETURN * * End of CGEEQU * END


---
authors:
- brad-czerniak
#categories: ["one", "two"]
#date: 2020-03-03 02:02:02
#hero_classes: "background-color--main-dark color--white"
menus:
# copyright: 1
footer: 4
main: 4
# utility: 1
meta:
description: "Who, what, when, where, why, and how."
image:
alt: "Shifting the synergy paradigm" # It's okay for this to be empty if the image is decorative
src: 1200x630/cytonn-photography-n95VMLxqM2I-unsplash.jpg
# robots: "index,follow"
# title: "Overrides the tab title and social titles"
permalink: /about/
#published: true
#schema:
# type: "Thing"
sections:
- "freshness"
- "mailchimp"
#sitemap: true
#tags: ["three", "four"]
title: "About"
---
{% include atoms/heading.html
children="Our story"
classes=" heading--h1 text-align--center"
level="2"
%}
{% include atoms/spacer.html size="4" %}
{% include atoms/heading.html
children="How we stand out"
classes=" heading--h1 text-align--center"
level="2"
%}
{% include atoms/spacer.html size="4" %}
{% include organisms/section.html
mode="ref"
slug="people"
%}
{% include atoms/heading.html
children="Global reach"
classes=" heading--h1 text-align--center"
level="2"
%}
{% include atoms/spacer.html size="4" %}


Extends unittest.TestCase with mango.unittest.TestCase.getRootTmpDir(), mango.unittest.TestCase.createTmpDir() method and mango.unittest.TestCase.removeTmpDir() methods.
Methods
| __init__([methodName]) | Create an instance of the class that will use the named test method when executed. |
| addCleanup(function, *args, **kwargs) | Add a function, with arguments, to be called when the test is completed. |
| addTypeEqualityFunc(typeobj, function) | Add a type specific assertEqual style function to compare a type. |
| assertAlmostEqual(first, second[, places, ...]) | Fail if the two objects are unequal as determined by their difference rounded to the given number of decimal places (default 7) and comparing to zero, or by comparing that the between the two objects is more than the given delta. |
| assertAlmostEquals(first, second[, places, ...]) | Fail if the two objects are unequal as determined by their difference rounded to the given number of decimal places (default 7) and comparing to zero, or by comparing that the between the two objects is more than the given delta. |
| assertDictContainsSubset(expected, actual[, msg]) | Checks whether actual is a superset of expected. |
| assertDictEqual(d1, d2[, msg]) | |
| assertEqual(first, second[, msg]) | Fail if the two objects are unequal as determined by the ‘==’ operator. |
| assertEquals(first, second[, msg]) | Fail if the two objects are unequal as determined by the ‘==’ operator. |
| assertFalse(expr[, msg]) | Check that the expression is false. |
| assertGreater(a, b[, msg]) | Just like self.assertTrue(a > b), but with a nicer default message. |
| assertGreaterEqual(a, b[, msg]) | Just like self.assertTrue(a >= b), but with a nicer default message. |
| assertIn(member, container[, msg]) | Just like self.assertTrue(a in b), but with a nicer default message. |
| assertIs(expr1, expr2[, msg]) | Just like self.assertTrue(a is b), but with a nicer default message. |
| assertIsInstance(obj, cls[, msg]) | Same as self.assertTrue(isinstance(obj, cls)), with a nicer default message. |
| assertIsNone(obj[, msg]) | Same as self.assertTrue(obj is None), with a nicer default message. |
| assertIsNot(expr1, expr2[, msg]) | Just like self.assertTrue(a is not b), but with a nicer default message. |
| assertIsNotNone(obj[, msg]) | Included for symmetry with assertIsNone. |
| assertItemsEqual(*args, **kwargs) | See unittest.TestCase.assertItemsEqual(). |
| assertLess(a, b[, msg]) | Just like self.assertTrue(a < b), but with a nicer default message. |
| assertLessEqual(a, b[, msg]) | Just like self.assertTrue(a <= b), but with a nicer default message. |
| assertListEqual(*args, **kwargs) | See unittest.TestCase.assertListEqual(). |
| assertMultiLineEqual(first, second[, msg]) | Assert that two multi-line strings are equal. |
| assertNotAlmostEqual(first, second[, ...]) | Fail if the two objects are equal as determined by their difference rounded to the given number of decimal places (default 7) and comparing to zero, or by comparing that the between the two objects is less than the given delta. |
| assertNotAlmostEquals(first, second[, ...]) | Fail if the two objects are equal as determined by their difference rounded to the given number of decimal places (default 7) and comparing to zero, or by comparing that the between the two objects is less than the given delta. |
| assertNotEqual(first, second[, msg]) | Fail if the two objects are equal as determined by the ‘!=’ operator. |
| assertNotEquals(first, second[, msg]) | Fail if the two objects are equal as determined by the ‘!=’ operator. |
| assertNotIn(member, container[, msg]) | Just like self.assertTrue(a not in b), but with a nicer default message. |
| assertNotIsInstance(obj, cls[, msg]) | Included for symmetry with assertIsInstance. |
| assertNotRegexpMatches(text, unexpected_regexp) | Fail the test if the text matches the regular expression. |
| assertRaises(excClass[, callableObj]) | Fail unless an exception of class excClass is raised by callableObj when invoked with arguments args and keyword arguments kwargs. |
| assertRaisesRegexp(*args, **kwargs) | See unittest.TestCase.assertRaisesRegexp(). |
| assertRegexpMatches(text, expected_regexp[, msg]) | Fail the test unless the text matches the regular expression. |
| assertSequenceEqual(*args, **kwargs) | See unittest.TestCase.assertSequenceEqual(). |
| assertSetEqual(*args, **kwargs) | See unittest.TestCase.assertSetEqual(). |
| assertTrue(expr[, msg]) | Check that the expression is true. |
| assertTupleEqual(*args, **kwargs) | See unittest.TestCase.assertTupleEqual(). |
| assert_(expr[, msg]) | Check that the expression is true. |
| countTestCases() | |
| createTmpDir([dirName, mpiComm, rootRank]) | Creates unit-test temporary directory. |
| debug() | Run the test without collecting errors in a TestResult |
| defaultTestResult() | |
| doCleanups() | Execute all cleanup functions. |
| fail([msg]) | Fail immediately, with the given message. |
| failIf(*args, **kwargs) | |
| failIfAlmostEqual(*args, **kwargs) | |
| failIfEqual(*args, **kwargs) | |
| failUnless(*args, **kwargs) | |
| failUnlessAlmostEqual(*args, **kwargs) | |
| failUnlessEqual(*args, **kwargs) | |
| failUnlessRaises(*args, **kwargs) | |
| getRootTmpDir() | Returns the temporary unit-test root directory. |
| id() | |
| removeTmpDir(dirName[, mpiComm, rootRank]) | Recursively removes specified unit-test directory. |
| run([result]) | |
| setUp() | Hook method for setting up the test fixture before exercising it. |
| setUpClass() | Hook method for setting up class fixture before running tests in the class. |
| shortDescription() | Returns a one-line description of the test, or None if no description has been provided. |
| skipTest(reason) | Skip this test. |
| tearDown() | Hook method for deconstructing the test fixture after testing it. |
| tearDownClass() | Hook method for deconstructing the class fixture after running all tests in the class. |
Attributes
| longMessage | |
| maxDiff |


Dark Count Spyrelet¶
This section runs through a simple spyrelet, found in ~/code/spyre/spyre/spyrelets/darkcount_spyrelet The experiment counts dark counts detected by the SNSPD, by communicating with the QuTAG and SRS modules. It stores the data in csv files.
Imports¶
The top of every spyrelet file will have the following
import numpy as np
import pyqtgraph as pg
import time
from lantz import Q_
from PyQt5.Qsci import QsciScintilla, QsciLexerPython
from spyre import Spyrelet, Task, Element
from spyre.widgets.task import TaskWidget
from spyre.plotting import LinePlotWidget
from spyre.widgets.rangespace import Rangespace
from spyre.widgets.param_widget import ParamWidget
from spyre.widgets.repository_widget import RepositoryWidget
Other modules can be imported as needed.
The lantz drivers for each instruments used must also be imported. Dark counts uses the SRS modules and the QuTAG, so the following are imported:
from lantz.drivers.stanford.srs900 import SRS900
from lantz.drivers.qutools import QuTAG
Class Header¶
The class is declared as a spyrelet:
class DarkCount(Spyrelet):
Following this, give aliases to the instruments to connect it to the config file (see Dark Count Config File).
requires = {
'srs': SRS900
}
qutag = None
Note usually, with NI Max devices (such as SRS, AWG, scopes, etc.) the declaration will be similar to the srs. The exception is for devices that don’t use NI VISA to connect, but instead use .dll files to communicate (Attocube, QuTAG, etc.). For these, we separately intiate communication with them, so initially setting them to None is my temporary solution. Now we have to establish a connection with the QuTAG (SRS is already connected at this point).
Task¶
The bulk of the code is contained in the task functions, indicated by:
@Task()
above the function declaration. In the particular case of having a .dll instrument such as the QuTAG, we can have a Task that establishes connection with the device, as with the case of the dark counts spyrelet.
@Task()
def qutagInit(self):
print('qutag successfully initialized')
@qutagInit.initializer
def initialize(self):
from lantz.drivers.qutools import QuTAG
self.qutag = QuTAG()
devType = self.qutag.getDeviceType()
if (devType == self.qutag.DEVTYPE_QUTAG):
print("found quTAG!")
else:
print("no suitable device found - demo mode activated")
print("Device timebase:" + str(self.qutag.getTimebase()))
return
@qutagInit.finalizer
def finalize(self):
return
A Task is the main function that you will run in the spyrelet, once the GUI pops up. You can have multiple Tasks in a spyrelet.
The main body of a Task is contained under the @Task() header, followed by a defined function with a name of your choice. The argument of the task is always just self. Inside the body of this function, put what you want to happen during the experiment. For this particular simple Task, we just print something.
In addition to the main Task function, each Task must have an initializer and finalizer. They can both be as simple as just return. Specify the initializer and finalizer with the @__functionName__initializer/finalizer, as shown above, with the corresponding function names, with argument self. The initializer and finalizer are no different than running them at the beginning/end of the main task. For instance, the following code is exactly the same as the above:
@Task()
def qutagInit(self):
from lantz.drivers.qutools import QuTAG
self.qutag = QuTAG()
devType = self.qutag.getDeviceType()
if (devType == self.qutag.DEVTYPE_QUTAG):
print("found quTAG!")
else:
print("no suitable device found - demo mode activated")
print("Device timebase:" + str(self.qutag.getTimebase()))
print('qutag successfully initialized')
@qutagInit.initializer
def initialize(self):
return
@qutagInit.finalizer
def finalize(self):
return
The initialize and finalize simply help the organization of the code. For instance, if you are using the AWG, you may always want to turn it off at the end of the Task, so it’s a good idea to include that in finalize.
A Task on the GUI looks like this:
Once the “play” button is pressed, the initializer will run, followed by the main task function, and then the finalizer. Simply running the code without pressing this button will not run any tasks. In this way, you can set up several tasks and run them in any order.
Elements¶
An Element is a GUI component that will display something, whether it be a plot or adjustable parameters. Dark count spyrelet has several parameter Elements, one of them is:
@Element(name='QuTAG Parameters')
def qutag_params(self):
params = [
('Start Channel', {'type': int, 'default': 0}),
('Stop Channel 1', {'type': int, 'default': 1}),
('Stop Channel 2', {'type': int, 'default': 2}),
('Total Hist Width Multiplier', {'type': int, 'default': 5}),
('Bin Count', {'type': int, 'default': 1000})
]
w = ParamWidget(params)
return w
Each parameter has a type, such as int, float, string, etc. This is displayed on the GUI as:
You can call the elements in Tasks with
qutagparams = self.qutag_params.widget.get()
start = qutagparams['Start Channel']
The .get() function creates a dictionary, and you can reference each parameter using it’s dictionary key to get the value. The “start” variable above will be set to 0, if no changes were made in the GUI.
The use of Elements is so that you can dynamically change parameters of the experiment without digging into the code everytime. You can change the parameters in the GUI before running Tasks, and the change will be reflected when you run the Tasks.


- MORNING ASSEMBLY
-
A working day at the school commences with the morning assembly. Resonent with Vande Matram and Vedic Mantras, the morning assembly's atmosphere exercises a very ennobling influence on the minds of students. Short quizzes, news and thought for the day are given. Presence of all the students is essential at the morning assembly.
-
- HOUSE SYSTEM
-
One of the main objectives of the House system is to foster in students a sense of collective responsibility and solidarity at the same time kindling and developing the social qualities latent in every child through competitions among six houses.

Head prefect is the incharge of prefect and the Games Captain is the incharge of co-ordinating Sports activities among the student body. The system of prefect body managing the six houses help to develop a spirit of team work with co-operation, co-ordination, understanding and inculcating a sense of responsibility.
-
- MUSIC
-
The reverberating sounds of instruments, enthusiastic participants are the essential part of the School's music department.
-
FOR JUNIORS :
- Action Songs
- Patriotic Songs etc.
FOR SENIORS :
- Classical Songs
- Classical Dance (Kathak)
- Semi Classical Dance
- Instrumental Music
- Casio, Tabla, Congo,
- Bongo, Guitar, Sitar etc.
- Western Dance & Creative Dance
- Different Taals theory and practical.