23 July 2015
Kenya, like other countries in the region, is bearing the brunt of climate change impacts and the associated socio-economic losses. The situation is exacerbated by the high dependence on climate sensitive natural resources. In response to the challenges posed by Climate Change, Kenya has developed a National Climate Change Response Strategy (NCCRS 2010), National Climate Change Action Plan (NCCAP 2013), and a National Adaptation Plan (NAP) - under preparation which provides a vision for low carbon and climate resilient development pathway, while a National Climate Change Framework Policy and legislation are in their final stages of enactment to facilitate effective response to climate change. Kenya is operationalising these policies and plans through the implementation of climate change actions in various areas such as afforestation and reforestation, geothermal and other clean energy development, energy efficiency, climate smart agriculture, and drought management.
This document presents Kenya’s Intended Nationally Determined Contribution (INDC) in response to decisions adopted at the 19th and 20th sessions of the Conference of the Parties to the United Nations Framework Convention on Climate Change (UNFCCC); that invite Parties to communicate to the Secretariat their INDCs, towards achieving the objective of the UNFCCC as set out in Article 2 of the Convention.
Kenya’s INDC builds on the participatory multi-stakeholder and cross-sectoral consultative processes during the development of NCCRS and NCCAP at national and county levels. The contribution will also contribute towards the delivery of the Constitution of Kenya and the attainment of Vision 2030, the country’s development blueprint.
Kenya is located in the Greater Horn of Africa region, which is highly vulnerable to the impacts of climate change. More than 80% of the country’s landmass is arid and semi-arid land (ASAL) with poor infrastructure, and other developmental challenges. The country’s economy is highly dependent on climate sensitive sectors such as agriculture that is mainly rain-fed, energy, tourism, water and health. Climate hazards have caused considerable losses across the country’s different sectors over the years. The main climate hazards include droughts and floods which cause economic losses estimated at 3% of the country’s Gross Domestic Product (GDP).
Kenya’s total greenhouse gas (GHG) emissions are relatively low, standing at 73 MtCO2eq in 2010, out of which 75% are from the land use, land-use change and forestry (LULUCF) and agriculture sectors. This may be explained by the reliance on wood fuel by a large proportion of the population coupled with the increasing demand for agricultural land and urban development. The other significant emissions are from the energy and transport sectors, with the waste and industrial processes contributing negligible amounts.
Kenya strives to be a newly industrialised middle income country by 2030. This development is expected to increase emissions from the energy sector. The current energy mix, however, is mainly clean with deliberate efforts by Government towards enhancing geothermal, wind, solar and other clean energy development.
Climate change impacts continue to slow down the attainment of its national development goals. Kenya will continue making investments with both domestic and international resources to adapt to climate change and realise its abatement potentials.
Kenya’s INDC includes both mitigation and adaptation components based on her national circumstances and in line with decisions 1/CP.19 and 1/CP.20.
Kenya seeks to undertake an ambitious mitigation contribution towards the 2015 Agreement. Kenya therefore seeks to abate its GHG emissions by 30% by 2030 relative to the BAU scenario of 143 MtCO2eq; and in line with its sustainable development agenda. This is also subject to international support in the form of finance, investment, technology development and transfer, and capacity building.
Kenya aims to achieve a low carbon, climate resilient development pathway.
Kenya will continue to implement the NCCAP (2013-2017), and subsequent action plans beyond this period to achieve this target. This will include the promotion and implementation of the following mitigation activities.
Expansion in geothermal, solar and wind energy production, other renewables and clean energy options.
Enhancement of Energy and resource efficiency across the different sectors.
Make progress towards achieving a tree cover of at least 10% of the land area of Kenya.
Clean energy technologies to reduce overreliance on wood fuels.
Low carbon and efficient transportation systems.
Climate smart agriculture (CSA) in line with the National CSA Framework.
Sustainable waste management systems.
| Timeframe for implementation | The timeframe for implementation of the INDC is up to 2030. |
| Scope of gases included in the contribution Sectors covered by the contribution | Carbon dioxide (CO2), Methane (CH4), and Nitrous Oxide (N2O) are prioritised. |
| Sectors covered by the contribution | The IPCC Guidelines for all sectors: Energy, Transportation, Industrial Processes, Agriculture, Forestry and Other Land Use (AFOLU) and waste sector. |
| Assumptions and methodological approaches | |
| Methodology for emissions accounting | The IPCC Revised 1996 Guidelines for National Greenhouse Gas Inventories and the Good Practise Guidance and Uncertainty Management in National Greenhouse Gas Inventories were used to calculate the GHG emissions and removals as described in the Second National Communication. Emissions of carbon dioxide from the combustion of biomass are assessed but not counted towards the contribution. Future contribution from the extractive sector has not been included in the accounting. |
| Global warming potentials | The carbon dioxide equivalent was calculated using the 100 year global warming potentials in accordance with the IPCC 2nd Assessment Report. |
| Approaches to land sector emissions | This includes emissions from the land use, land-use change and forestry (LULUCF) sector. Relevant national policy documents and the FAO’s Global Forest Resource Assessment 2010 for Kenya were used. A global land-use data approach was used, as described in the 2003 IPCC Good Practice Guidance for LULUCF. A state and transition model consistent with the 1996 Revised IPCC Guidelines was used to calculate fluxes of CO2 to (or from) the atmosphere and biomass carbon pools is the same as outlined in the 1996 Revised IPCC Guidelines. There is significant uncertainty in the BAU emission and mitigation potential estimates for this sector and work is underway to update and improve these estimates. |
| Contribution of International Market Based Mechanism | Kenya does not rule out the use of international market-based mechanisms in line with agreed accounting rules. |
| Reference Point | |
| BAU emissions in the target year | Business-as-usual (BAU) emissions are estimated to be 143 MtCO2eq) by 2030. This excludes future exploitation in the extractive sector. |
| BAU projection methodology | The BAU projection methodology is detailed within the NCCAP and the Second National Communication (SNC), including key assumptions, drivers and methodologies for each sector. The base year is 2010. For geothermal energy, note that the BAU projection contained in the NCCAP and SNC has been revised to be consistent with the current level of geothermal deployment since the NCCAP was published. |
As a minimal contributor to global GHG emissions, Kenya places significant priority on adapting to the effects of climate change.
The priority adaptation actions are presented in the NCCAP and further elaborated in the NAP. The actions are based on risk and vulnerability assessments across the MTP sectors. Many of the actions have strong synergies with mitigation actions. Kenya’s capacity to undertake strong mitigation actions is dependent upon support for the implementation of these adaptation actions.
Kenya will ensure enhanced resilience to climate change towards the attainment of Vision 2030 by mainstreaming climate change adaptation into the Medium Term Plans (MTPs) and implementing adaptation actions. Any reasonable achievement of the adaptation goal will require financial, technology and capacity building support.
| MTP SECTOR | PRIORITY ADAPTATION ACTIONS |
|---|---|
| Energy | Increase the resilience of current and future energy systems. |
| Science, Technology and innovations | Support innovation and development of appropriate technologies that promote climate resilient development. |
| Public sector reforms | Integrate climate change adaptation into the public sector reforms. |
| Human Resource Development, Labour and Employment | Enhance adaptive capacity and resilience of the informal private sector. |
| Infrastructure | Climate proofing of infrastructure (energy, transport, buildings, ICT). |
| Land Reforms | Mainstream climate change adaptation in land reforms. |
| Education and training | Enhance education, training, public awareness, public participation, public access to information on climate change adaptation across public and private sectors. |
| Health | Strengthen integration of climate change adaptation into the health sector. |
| Environment | Enhance climate information services. |
| Enhance the resilience of ecosystems to climate variability and change. | |
| Water and irrigation | Mainstream of climate change adaptation in the water sector by implementing the National Water Master Plan (2014). |
| Population, urbanisation and housing | Enhance the adaptive capacity of the population, urbanisation and housing sector. |
| Gender, Vulnerable Groups and Youth | Strengthen the adaptive capacity of the most vulnerable groups and communities through social safety nets and insurance schemes. |
| Tourism | Enhance the resilience of the tourism value chain. |
| Agriculture, livestock development and fisheries | Enhance the resilience of the agriculture, livestock and fisheries value chains by promoting climate smart agriculture and livestock development. |
| Private Sector/ Trade; Manufacturing; Business Process Outsourcing, Financial services | Create enabling environment for the resilience of private sector investment, demonstrate an operational business case. |
| Oil and mineral resources | Integrate climate change adaptation into the extractive sector. |
| Devolution | Mainstream climate change adaptation into county integrated development plans and implement the Ending Drought Emergencies Strategy. |
Kenya believes that the key factors in determining the fairness of a contribution should include historical responsibility and respective capability to address climate change. The UNFCCC also recognises that the extent to which developing countries will meet their obligations under the Convention will depend on the level of support in terms of finance, technology and capacity building available.
Kenya’s historical contribution is low, at 0.1% of the total global emissions, while the per- capita emissions are less than 1.26 MtCO2eq compared to the global average of 7.58 MtCO2eq [1].
The country’s capability to implement this contribution is also subject to limitations; with poverty alleviation and sustainable economic development being the key national objectives. Increasing the per-capita GDP growth equitably above the current levels of 4.1% is therefore a priority.
Nevertheless, Kenya places a high priority on response to climate change. In order to meet the below 2°C objective, all countries will need to undertake mitigation based on the common but differentiated responsibilities and respective capabilities in accordance with the Convention. In addition, Kenya particularly notes that the Lima Call to Action agrees that each Party’s contribution will “represent a progression beyond the current undertaking of that Party”.
Kenya is determined to continue playing a leadership role in addressing climate change by communicating a fair and ambitious contribution. This intended contribution targets a high proportion of its mitigation potential, dependent on the level of support available. This will involve implementing the priority mitigation and adaptation actions in the NCCAP to achieve a low carbon climate resilient development in line with Vision 2030.
This is the first time that Kenya has stated an intended contribution to global mitigation efforts. In addition, Kenya’s INDC represents her aspiration to increase the resilience to climate change by introducing a comprehensive programme for adaptation action across sectors in support of livelihoods, and economic well-being of the Kenyan people. This represents a high level of fairness and ambition in light of Kenya’s national circumstances.
Kenya’s planning process on mitigation and adaptation hinges on the NCCAP and the NAP. The two shall be reviewed every five years to inform the MTP. The adaptation actions are further amplified in the NAP. Mitigation and adaptation actions are implemented across the various sectors at both the national and county government levels. The Ministry of Environment and Natural Resources coordinates the country’s climate change affairs through the National Climate Change Secretariat (NCCS).
The planning process also takes cognisance of the Climate Change Bill (2014) that proposes several institutional reforms to enhance coordination of climate change adaptation and mitigation. These include the establishment of:
A high level National Climate Change Council chaired by the President. The Council shall provide an overarching national climate change coordination mechanism and, among other roles, ensure the mainstreaming of climate change functions by the National and County governments, and approve and oversee the implementation of the NCCAP.
A Climate Change Directorate as the lead agency of the government on national climate change plans and actions to deliver operational coordination; and provide technical assistance on climate change actions and responses to County governments.
Kenya Climate Fund to be a financing mechanism for priority climate change actions and interventions approved by the Council.
In addressing climate change issues, public entities are required to undertake public awareness and consultations, and ensure gender mainstreaming, in line with the Constitution and the Climate Change Bill (2014).
Kenya’s contribution will be implemented with both domestic and international support. It is estimated that over USD 40 billion is required for mitigation and adaptation actions across sectors up to 2030. Kenya will require international support in form of finance, investment, technology development and transfer, and capacity-building to fully realize her intended contribution. Further analysis will be necessary to refine the required investment cost and determine the domestic support.
GHG time series 1990-2012 per capita emissions for world countries http://edgar.jrc.ec.europa.eu/overview.php?v=GHGts_pc1990-2012 ↩


Officer Jakan:
It is simple. I'd like to know what happened to the soldiers I left behind. Save those that might still be alive, but if not, at least bring back their ID tag so we can identify and remember the dead.
Nod in understanding.


Boris Johnson on the foreign leader he admires most: ‘The EU27, all of them’
Favorite leaders and Christmas gifts in the UK election debate.
by Paul DallisonBoris Johnson doesn't have a favorite world leader but 27 of them!
Asked in a televised election debate on Tuesday "which current foreign leader do you most admire?" the British prime minister said: "I would like the EU27, all of them, because they did me a fantastic deal which enables us to come out of the EU."
Jeremy Corbyn went for António Guterres, the secretary-general of the United Nations.
The Conservative and Labour leaders were taking part in a debate broadcast on ITV ahead of the U.K.'s public poll on December 12.
The final question of the debate also featured Johnson's Brexit deal. Asked what gift each leader would get the other, Corbyn said a copy of Charles Dickens' "A Christmas Carol" so he could "understand how nasty Scrooge was."
Despite being told to pick a non-political gift, Johnson said he would get Corbyn a copy of "my brilliant Brexit deal." Corbyn looked disgusted at the prospect.


|
| ||
|
|
To receive this accreditation, the Compaq Associate ASE candidate must demonstrate proficiency in knowledge, planning, installation, and configuration of Compaq hardware platforms. This is accomplished by passing three required Compaq exams: (1) Compaq Systems Technologies Test, (2) Compaq Integration & Performance Test-based on a specific operating system platform which is chosen by the Associate ASE candidate, and (3) Compaq Systems Management Test. Once the Associate ASE has successfully completed these tests, the candidate must submit an application to Compaq (See Chart 1). Accreditation is not automatic. A candidate must submit an application.
Compaq ASETo be qualified to apply for the Compaq ASE accreditation, ASE candidates must have successfully completed the requirements for Associate ASE accreditation. Additionally, ASE candidates must provide proof of certification in one of the matching eligible operating systems (See Chart 2).
Eligible operating system vendor certifications include: For ASE Windows NT
For ASE Netware
|
| |||||||||||||
|
Revised: 07 April 1997 |


{% extends "base.html" %} {% block title %}Frequently Asked Questions{% endblock %} {% block content %}
{{ answer }}
If we don't cover it here feel free to email us for more details.


David is a 2017 graduate of Dev Bootcamp in New York City, where he was immersered in FullStack Web Development. At Dev Bootcamp, David crafted an art and appreciation for not only making things look pretty on the front-end but diving deep into the back-end to set-up databases properly. Before Dev Bootcamp, David's career focused on the client-side at various SaaS companies, where he gained invaluable customer service skills and technical insights. David holds a bachelor's degree in Political Science from College of Charleston and a Web Development Certification from Dev Bootcamp.
The CarShare Guy seeks to be a digitial content-based resource and media platform dedicated to sharing the power of the carsharing community.
Check it outMonolithic Ruby-on-Rails Application. Database set up using ActiveRecord and PostgreSQL. Secure login/sign-up with the Ruby Gem 'Devise'. Styling done with Materialize.
View on GitHubRuby application built with the Sinatra framework that uses the Weather Underground API to allow users to search by city and state to receive weather results. Results are displayed dynamically using jQuery and AJAX. Secure login/sign-up with the Ruby Gem 'BCrypt'. Lightly styled with Bootstrap. Plan to implement additional features and styling.
Check it Out


Click on the eye icon to display; turn up your screen brightness to the max when scanning just in case. Edits are saved automatically. For the curious, student ID cards use Code 39, which you can read about on Wikipedia.
Current grade: %
Portion of grade the final determines: %
Minimum acceptable grade: %
For the image: You can use a finger to pan, or two to rotate, zoom, and pan. You can use your mouse to drag, or scroll to zoom or right-click to rotate.
For Google Maps: Only works when you're connected to the internet. If you're on touchscreen and can't scroll back up, try scrolling on the buttons.
Please note that club information was taken from their chartered club list as of September 14th, 2018. Apparently some of their information turned out to be inaccurate, so blame them, not us.
You've disabled the club and staff lists
You've disabled the club and staff lists


{% extends "learn/pages/level-1-base.html" %} {% import "partials/_utils.html" as utils %} {% import "learn/pages/partials/_learn_pages_utils.html" as learn_pages_utils %} {% block lhs_toc %} Table of contents
{% endblock %} {% block learn_content %}Before the lecture, please read the following chapters:
Question 1: What will be printed after running the following program?
total = 0
for num in range(5):
total += num
print(total)
{{
learn_pages_utils.render_question_responses(1, [
(True, "10", "Correct!"),
(False, "15", "Incorrect. Remember that range starts from 0 and goes up to the final number"),
(False, "01234", "Incorrect. We're summing numbers, not concatenating strings"),
(False, "012345", "Incorrect. We're summing numbers, not concatenating strings"),
])
}}
Question 2: What will be printed after running the following program?
result = 0
my_list = [1, 3, 5, 2, 7, 1, 1, 1]
index = 0
while my_list[index] != 7:
result += my_list[index]
print(result)
{{
learn_pages_utils.render_question_responses(2, [
(False, "11", "Incorrect. You probably had the right idea, but pay attention to the value of index at each iteration of the loop"),
(False, "18", "Incorrect. If you picked this, it's important to remember that when the while condition fails, we immediately exit the loop"),
(False, "21", "Incorrect. Remember the condition to exit the loop!"),
(True, "(nothing)", "Correct! We never advance index
so we have a logical error in our code"),
])
}}
How big would you like the triangle to be? 25
That's too big! Try again.
How big would you like the triangle to be? 5
.
..
...
....
.....
$ python3 guessing_game.py
Welcome to the guessing game!
What should the maximum number be? 100
Okay, I've thought of a number between 1 and 100! (Imagine the computer randomly got 56 here)
What's your guess? 50
Nope! My number is higher.
What's your guess? 70
Nope! My number is lower.
What's your guess? 60
Nope! My number is lower.
What's your guess? 55
Nope! My number is higher.
What's your guess? 56
You got it!
You took 5 guesses to find my number. Not bad!
{% endblock %}
{% block pagination_prev %}
{{ utils.paginate_prev("level-1-lesson-3.html", "Lesson 3") }}
{% endblock %}
{% block pagination_next %}
{{ utils.paginate_next("level-1-lesson-5.html", "Lesson 5") }}
{% endblock %}
{% block scripts %}
{{ super() }}
{{ learn_pages_utils.render_question_jquery(1) }}
{{ learn_pages_utils.render_question_jquery(2) }}
{% endblock %}


[§465D-3] Behavior analyst program; established; personnel. (a) Notwithstanding any other law, there is established a behavior analyst program within the department to be administered by the director.
(b) The department may employ necessary personnel without regard to chapter 76 to assist with the implementation and continuing functions of this chapter. [L 2015, c 199, pt of §2]


SKOS Vocabulary: Overview
back to
ToC
This ontology has the following classes and properties.
Classes
Collection
Concept
Concept Scheme
Ordered Collection
Object Properties
has broader
has broader match
has broader transitive
has close match
has exact match
has member
has member list
has narrower
has narrower match
has narrower transitive
has related
has related match
has top concept
is in mapping relation with
is in scheme
is in semantic relation with
is top concept in scheme
Data Properties
notation


--- title: '' date: 2014-07-21 17:38:59 Z tags: - friends - productivity. - punks - routines - Work layout: post type: post status: publish meta: pe_theme_meta: O:8:"stdClass":2:{s:7:"gallery";O:8:"stdClass":3:{s:2:"id";s:2:"89";s:5:"width";s:0:"";s:6:"height";s:0:"";}s:5:"video";O:8:"stdClass":1:{s:2:"id";s:2:"63";}} _edit_last: '1' tumblr_landlaborcapital_id: '92486602152' tumblr_landlaborcapital_permalink: http://landlaborcapital.tumblr.com/post/92486602152/a-great-little-bit-on-the-practice-work-style-of author: Nathaniel ---
A great little bit on the practice/work style of my friend, Erin Riley, a textile artist. (http://www.emptykingdom.com/featured/one-piece-of-art-erin-riley/)
How do you start your day? Is there something you do every morning?
I usually just make sure I have a decent amount of coffee and water within reach and make sure I have all the colors I need to work for a while. I turn on all the lights, fans, take my vitamins, check my email and then get to weaving.


Querying JSON files with JS
IWT Coursework 1 - Ginestra Ferraro
I confirm that this coursework submission is entirely my own work, except where explicitly stated otherwise.
Search nobel prize winners
Hit 'Search' on an empty form to get all records displayed.
Results
| Enter search terms in the form, or hit 'Search' to see all records and start exploring the data. |
Objectives of the coursework:
- The user should be able to enter a category value (e.g. literature) and retrieve the corresponding prize winners.
- The user should be able to enter a year value (e.g. 1991) as well as an operator (<, = or >) and retrieve the prize winners for the years specified.
- The user should be able to enter a share value (e.g. 2) as well as an operator (<, = or >) and retrieve the prize winners whose share value is specified by the condition.
- The user should be able to enter part of a surname value (e.g. Curie) and retrieve the corresponding prize winners.
- The user should be able to enter conditions for any combination of the properties mentioned above. If no conditions are entered, all prizes and winners should be returned.


--- layout: page title: "XML Media Types" description: "This document standardizes five new media types - text/xml, application/xml, text/xml-external-parsed-entity, application/xml-external-parsed-entity, and application/xml-dtd - for use in exchanging network entities that are related to the Extensible Markup Language (XML). This document also standardizes a convention (using the suffix '+xml') for naming media types outside of these five types when those media types represent XML MIME (Multipurpose Internet Mail Extensions) entities. XML MIME entities are currently exchanged via the HyperText Transfer Protocol on the World Wide Web, are an integral part of the WebDAV protocol for remote web authoring, and are expected to have utility in many domains." ---
| Document Name: | RFC 3023 |
|---|---|
| Document URI: |
urn:ietf:rfc:3023
|
| Online Version: |
https://datatracker.ietf.org/doc/html/rfc3023
|
| Organization: | Internet Engineering Task Force (IETF) |
| Series: | Request for Comments (RFC) |
| Abstract: | This document standardizes five new media types - text/xml, application/xml, text/xml-external-parsed-entity, application/xml-external-parsed-entity, and application/xml-dtd - for use in exchanging network entities that are related to the Extensible Markup Language (XML). This document also standardizes a convention (using the suffix '+xml') for naming media types outside of these five types when those media types represent XML MIME (Multipurpose Internet Mail Extensions) entities. XML MIME entities are currently exchanged via the HyperText Transfer Protocol on the World Wide Web, are an integral part of the WebDAV protocol for remote web authoring, and are expected to have utility in many domains. |
text/xml
,
text/xml-external-parsed-entity
Return to ( Series | Organization | all Specifications )


Burnt Ferret wrote:Sorry, been pretty busy with work. I have the models done, the textures are just messed up... I'll post the UV outline for the textures so feel free to make them into whatever you want. I'll do that when i get home from work.
Return to Modeling and Textures
Users browsing this forum: No registered users and 1 guest


'Uncomfortable' - Mixed response to Aston Villa star's performance in England win
Aston Villa latest | Villa centre-half Tyrone Mings played his part as England made it seven wins from eight in their European Championship qualifying group with victory over Kosovo
by Josh MurrayAston Villa defender Tyrone Mings earned his second senior cap as England secured a European Championship top-seed spot with victory over Kosovo today (Sunday).
Mings played the full 90 minutes of a 4-0 win in Pristina, partnering Harry Maguire at centre-half.
Harry Winks fired the Three Lions into a first-half lead, before Harry Kane, Marcus Rashford and Mason Mount struck in the final 20 minutes to secure England's seventh group A win from eight.
John Stones had made Gareth Southgate's starting XI for Thursday's 7-0 thrashing of Montenegro - but Mings was back at the heart of the defence in England's final competitive fixture before next summer's finals.
Here is what the national media made of the Villa centre-back's performance, with ratings out of 10...
MIRROR
7 - So commanding in every sense - dominated with his size and strength. Excellent
Aston Villa latest
This is your round up of all things Villa; the one-stop shop that will keep you updated on the latest goings on at the club and beyond.
Transfers, injuries, match-days and managers, we’ve got you covered.
We’ll be bringing the very latest on the Villains throughout the week and around the clock.
Make sure you keep yourself updated with our handy daily catch up...
Must reads...
- Villa fans make Chelsea transfer demand
- 'Worried' fans react to major announcement
- Former Villan reveals Newcastle bombshell
- Morelos saga takes new twist
For all your latest AVFC news, opinion, analysis and transfer gossip, click here
You can follow our Villa reporter Ashley Preece on Twitter, and his email address is<EMAIL_ADDRESS>DAILY MAIL
6.5 - Looked uncomfortable with the ball at his feet on occasions - but defended stoutly
THE SUN
6 - Struggled for an hour. He certainly deserved another run-out after handling himself so well on and off the pitch in Bulgaria but he endured a difficult game, particularly in the first half.
He was beaten early on in the air by Nuhiu and some of his passing was sloppy.
THE INDEPENDENT
7


Format documentation
Full date (%x - %X)
Date (%x)
Time (%X)
Milliseconds (%Q)
Locale date (%c)
Arbitrary string + format (`Around %B of %Y`)
Changing the language for locale specific formatting
Spanish 🇪🇸
German 🇩🇪
French 🇫🇷
Brazilian Portuguese 🇧🇷
Swiss German 🇨🇭
Canadian French 🇫🇷
Russia 🇷🇺


Back to index
In this example, the form is sent to the Build Endpoint of the API using picnicc.form.js. We're using the .done callback here to override picnicc.form's default behavior (read more).
.done
section-1
section-2
section-3


{% extends '../layouts/template.html' %} {% block title %}Check my State Pension - {{mvpversion}}{% endblock %} {% block serviceName %}Check your State Pension{% endblock %} {% block main %}
To use the service again you’ll need to sign in.
What did you think of this service? (takes 30 seconds)
You may get extra State Pension if you defer your claim.


In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of an arbitrary directed graph form a partition into subgraphs that are themselves strongly connected. It is possible to test the strong connectivity of a graph, or to find its strongly connected components, in linear time.
A directed graph is called strongly connected if there is a path in each direction between each pair of vertices of the graph. In a directed graph G that may not itself be strongly connected, a pair of vertices u and v are said to be strongly connected to each other if there is a path in each direction between them.
The binary relation of being strongly connected is an equivalence relation, and the induced subgraphs of its equivalence classes are called strongly connected components. Equivalently, a strongly connected component of a directed graph G is a subgraph that is strongly connected, and is maximal with this property: no additional edges or vertices from G can be included in the subgraph without breaking its property of being strongly connected. The collection of strongly connected components forms a partition of the set of vertices of G.
If each strongly connected component is contracted to a single vertex, the resulting graph is a directed acyclic graph, the condensation of G. A directed graph is acyclic if and only if it has no strongly connected subgraphs with more than one vertex, because a directed cycle is strongly connected and every nontrivial strongly connected component contains at least one directed cycle.
Several algorithms can compute strongly connected components in linear time.
Although Kosaraju's algorithm is conceptually simple, Tarjan's and the path-based algorithm are favoured in practice since they require only one depth-first search rather than two.
Algorithms for finding strongly connected components may be used to solve 2-satisfiability problems (systems of Boolean variables with constraints on the values of pairs of variables): as showed, a 2-satisfiability instance is unsatisfiable if and only if there is a variable v such that v and its complement are both contained in the same strongly connected component of the implication graph of the instance.
Strongly connected components are also used to compute the Dulmage–Mendelsohn decomposition, a classification of the edges of a bipartite graph, according to whether or not they can be part of a perfect matching in the graph.
A directed graph is strongly connected if and only if it has an ear decomposition, a partition of the edges into a sequence of directed paths and cycles such that the first subgraph in the sequence is a cycle, and each subsequent subgraph is either a cycle sharing one vertex with previous subgraphs, or a path sharing its two endpoints with previous subgraphs.
According to Robbins' theorem, an undirected graph may be oriented in such a way that it becomes strongly connected, if and only if it is 2-edge-connected. One way to prove this result is to find an ear decomposition of the underlying undirected graph and then orient each ear consistently.
The above header should be an H2 tag. Now, for a list of fruits:
Let's get crazy:
This is a list item with two paragraphs. Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Aliquam hendrerit mi posuere lectus.
Vestibulum enim wisi, viverra nec, fringilla in, laoreet vitae, risus. Donec sit amet nisl. Aliquam semper ipsum sit amet velit.
Suspendisse id sem consectetuer libero luctus adipiscing.
What about some code in a list? That's insane, right?
['a', 'b'].map { |x| x.uppercase }
['a', 'b'].map(&:uppercase)
Some people seem to like definition lists
Maybe you want to print robot
to the console 1000 times.
Why not?
class Car < ActiveRecord::Base
has_many :wheels, class_name: 'Wheel', foreign_key: 'car_id'
scope :available, -> { where(available: true) }
end
You see, that was formatted as code because it's been indented by four spaces.
How about we throw some angle braces and ampersands in there?
<div class="footer">
© 2004 Foo Corporation
</div>
CSV:
Year,Make,Model,Length
2/5/08,Ford,E350,2.34
1/2/06,Mercury,Cougar,2.38
Preformatted blocks are useful for ASCII art:
,-. , ,-. ,-. / \ ( )-( ) \ | ,.>-( )-< \|,' ( )-( ) Y ___`-' `-' |/__/ `-' | | | -hrr- ___|_____________
If you need to blame someone, the best way to do so is by quoting them:
I, at any rate, am convinced that He does not throw dice.
Or perhaps someone a little less eloquent:
I wish you'd have given me this written question ahead of time so I could plan for it... I'm sure something will pop into my head here in the midst of this press conference, with all the pressure of trying to come up with answer, but it hadn't yet...
I don't want to sound like I have made no mistakes. I'm confident I have. I just haven't - you just put me under the spot here, and maybe I'm not as quick on my feet as I should be in coming up with one.
| ID | Name | Rank |
|---|---|---|
| 1 | Tom Preston-Werner | Awesome |
| 2 | Albert Einstein | Nearly as awesome |
I get 10 times more traffic from Google than from Yahoo or MSN.


This task is designed to
"true"
),
a new classloader will be created and the reference will be set. Otherwise the classpath
will appended to the referenced classloader. In this case, the classloader remains untouched
if no classpath is set.
If the property build.sysclasspath
is set to "only"
,
create/append actions on the System-, Project- or CoreLoader are omitted with a warning.
See also: ClassloaderReport Task
See also: Supporting custom classloaders
<taskdef>
and <typedef>
and
modification of existing classloaders in the same build script.
| Attribute | Description | Required |
| loader | Id or symbolic name of the classloader to create, manipulate or get the path from. See nested element's description for further information. | Yes, unless nested loader element is specified. |
| classpath | The classpath to create or append to loader. | No |
| classpathRef | Id of the classpath to create or append to loader.
It can be a reference to a Fileset , Filelist ,
Dirset , Path or Urlpath . |
No |
| duplicateEntry | Handling of duplicate entries in the classpath.
One of "ignore" (don't check), "warn" (log warning but add entry)
or "omit" (omit entry and log in verbose mode).
|
No, defaults to "omit". |
| property | Name of the property to put loaders classpath in. | No |
| reset | If "true" , reset loader if it already exists. I.e. a new classloader will
be created and the reference to the old one will be replaced.
(It is not possible to remove paths from a loader). NOTE: Use this option with care, as it
may deliver unexpected results. |
No, defaults to "false" . |
| parameters | Id of the Loaderparameters to use when creating a new classloader.
See nested element's description for further information.
|
No, defaults to an empty Antloaderparameters . |
| handler | Id of the Loaderhandler to use when creating a new classloader. Overwrites
the default Loaderhandler of parameters.
See "Supporting custom classloaders" for further information.
|
No, defaults to parameters's default Loaderhandler . |
| handlerSet | Id of the LoaderhandlerSet to use when modifying an existing classloader or getting it's classpath.
See "Supporting custom classloaders" for further information.
|
No, defaults to a generic LoaderhandlerSet
containing the predefined Loaderhandlers and handler. |
| failonerror | Stop the build process if an error occurs. | No, defaults to "true" . |
| parentLoader | Id or symbolic name of a classloader to use as the parent of a newly created classloader. See nested element's description for further information. | No, defaults to "none" . |
| superLoader | Id or symbolic name of a classloader to use as the classloader of a newly created classloader. See nested element's description for further information. | No, defaults to "current" . |
loader specifies the classloader to create, modify or get the path from.
parentLoader specifies the classloader to use as parent of a newly created classloader.
superLoader specifies the classloader to use as classloader of a newly created classloader. It depends
on the particular adapter, whether or not this parameter is supported.
To specify classloaders, Classloader
uses Loaderref
types.
Classloader
's loader, parentLoader and superLoader attributes are Loaderref
s with one of the attributes set
due to the following algorithm:
LoaderRef
,
set attribute's value as refid.Loaderref
's attribute, you can can define one via a nested loader, parentLoader resp. superLoader element.
| Attribute | Description | Required |
| loader | Symbolic name of a classloader. | Exactly one of these. |
| loaderref | Refers to the id of a classloader defined elsewhere. | |
| refid | Makes this Loaderref a reference to a Loaderref defined somewhere else. |
| Symbolic Name | Description | reset="true" |
| core | The result of getProject().getCoreLoader() . If used as parentLoader or superLoader and getProject().getCoreLoader() returns null, "project" is used as delegation parent resp. superloader. |
Calls getProject().setCoreLoader and updates the current Project reference id "ant.coreLoader". |
| current | The result of this.getClass().getClassLoader() . |
Error |
| none | Explicitely no classloader. Can not be used as Classloader 's loader. (Typically used to specify the bootstrap classloader.) |
Error |
| project | The result of getProject().getClass().getClassLoader() . |
Error |
| system | The result of ClassLoader.getSystemClassLoader(). |
Error |
| thread | The result of Thread.currentThread().getContextClassLoader() . |
Calls Thread.currentThread().setContextClassLoader . |
Classloader
's classpathRef attribute is a reference to an extended
PATH like structure and can also be set via a nested
classpath element. The extended path can also be set outside the task via a Urlpath
element.
In addition to the attributes and nested elements of Path
, Urlpath
supports
the following parameters:
| Attribute | Description | Required |
| urlpath | a ';' separated list of files or directories specified as files or URLs | No |
| Attribute | Description | Required |
| location | a single file or directory specified as file or URL | Exactly one of those |
| path | a ';' separated list of files or directories specified as files or URLs |
Urlpath
as part of the current one.
A reference to a Fileset
, Filelist
, Dirset
, Path
or Urlpath
defined elsewhere as part of the current Urlpath
.
Classloader
's parameters attribute is a reference to
a Loaderparameters
or compatible type defined elsewhere.
Loaderparameters
and compatible types are defining the parameters used to
modify a newly created classloader.
Furthermore they are defining a default Loaderhandler
used to create a new classloader.
Loaderparameters
default Loaderhandler
is
"ant.clhandler.URLClassLoader"
.
Ant ships with the following compatible types:
- Antloaderparameters
NOTE: In Ant versions 1.6.5 (and prior) <taskdef> and <typedef> requires instances of AntClassloader
to define tasks or types..
Instead of referring to existing Loaderparameters
,
you can can define them via a nested parameters element.
| Attribute | Description | Required |
| defaultAssertionStatus | The argument for calling setDefaultAssertionStatus(Boolean)
at the newly created classloader. Will be ignored on Java < 1.4. |
No |
| refid | Makes this Loaderparameters a reference to a Loaderparameters or compatible type defined somewhere else. |
No |
Describes the arguments for a call of setClassAssertionStatus
at a classloader.
Will be ignored on Java < 1.4.
| Attribute | Description | Required |
| class | Classname. | Yes |
| status | Desired assertion status for the class. | No, defaults to "false" . |
Describes the arguments for a call of setPackageAssertionStatus
at a classloader.
Will be ignored on Java < 1.4.
| Attribute | Description | Required |
| package | Package name. | Yes |
| status | Desired assertion status for the package. | No, defaults to "false" . |
Antloaderparameters
is a Loaderparameters
-compatible type
that defines the parameters of an AntClassLoader.
Instead of referring to existing Antloaderparameters
,
you can can define them via a nested antparameters element.
| Attribute | Description | Required |
| addJavaLibraries | If "true" , addJavaLibraries will called
at the newly created AntClassLoader. |
No, defaults to "false" . |
| defaultAssertionStatus | The argument for calling setDefaultAssertionStatus(Boolean)
at the newly created classloader. Will be ignored on Java < 1.4. |
No |
| isolated | The argument for calling setIsolated(boolean)
at the newly created AntClassLoader. |
No, defaults to "false" . |
| loaderPackageRoot | ';', ':' or ',' separated list of Packagenames used as argument for calling setLoaderPackageRoot(String)
at the newly created AntClassLoader. |
No |
| parentFirst | The argument for calling setParentFirst(boolean)
at the newly created AntClassLoader. |
No, defaults to "true" . |
| systemPackageRoot | ';', ':' or ',' separated list of Packagenames used as argument for calling
setSystemPackageRoot(String) at the newly created AntClassLoader. |
No |
| refid | Makes this Antloaderparameters a reference to a Loaderparameters or compatible type defined somewhere else.
|
No |
See Loaderparameters
's classAssertionStatus
.
See Loaderparameters
's packageAssertionStatus
.
... <jar destfile="dist/lib/my.jar" basedir="build/classes" includes="mypackage/MyTask.class"/> <classloader loader="project" classpath="dist/lib/my.jar"/> <taskdef name="mytask" classname="mypackage.MyTask"/> <mytask .../>Adds the newly created jar ${basedir}/dist/lib/my.jar to the ProjectClassLoader, so that the following taskdef can load the new task in the same classloader as Ant's Core Tasks.
<classloader loader="my-new-antloader" parentloader="project"> <classpath> <pathelement path="dist/lib/my2nd.jar:${junit.dir}/junit.jar"/> <urlpathelement path="dist/lib/my3rd.jar"/> </classpath> </classloader>Creates a new
AntClassLoader
with the ProjectClassLoader as delegating
parent and a classpath consisting of ${basedir}/dist/lib/my2nd.jar followed by
${junit.dir}/junit.jar followed by
${basedir}/dist/lib/my3rd.jar
and adds it to the reference table with id my-new-loader.
Ant Tasks in this classloader can be loaded by the current project as it is a childloader of the project classloader.
<classloader loader="my-new-loader" parentloader="system"> <classpath> <pathelement path="dist/lib/my2nd.jar:${junit.dir}/junit.jar"/> <urlpathelement path="http://some.domain.com/lib/remote.jar;dist/lib/my3rd.jar"/> </classpath> <parameters/> </classloader>Creates a new
java.net.URLClassLoader
with the SystemClassLoader as delegating
parent and a classpath consisting of ${basedir}/dist/lib/my2nd.jar followed by
${junit.dir}/junit.jar followed by
http://some.domain.com/lib/remote.jar followed by
${basedir}/dist/lib/my3rd.jar
and adds it to the reference table with id my-new-loader.
Ant Tasks in this classloader can not be loaded by the current project as it is not a childloader of the project classloader.
org.apache.tools.ant.taskdefs.classloader.adapter
.
Your class should derive from SimpleClassLoaderAdapter
or - if it fits - one of the derived classes.
If the supported classloader is not in Java's bootstrap classpath,
you should use reflection for all the object access. (Example: AntClassLoaderAdapter
)<Loaderhandler>
in or outside the
Classloader
task and add it to a <LoaderhandlerSet>
via handler or addAll.
To deal with arbitrary classloaders, Classloader
uses adapter classes that are defined
by Loaderhandler
types.
Classloader
's handler attribute is a reference to
a Loaderhandler
defined elsewhere. Instead of referring to an existing Loaderhandler
,
you can can define one via a nested handler element.
| Attribute | Description | Required |
| adapter | The classname of the adapter class. | Yes, unless refid is specified. |
| loader | The class- or interfacename of a classloader to modify or introspect. This class is used to test the assignability of an existing classloader. (The instantiating class is defined in the Adapter.) | Yes, unless refid is specified. |
| refid | Makes this Loaderhandler a reference to a Loaderhandler defined somewhere else. |
No |
Ant ships with loaderhandlers and adapters for some widely used classloaders:
<loaderhandler id="ant.clhandler.URLClassLoader" adapter="org.apache.tools.ant.taskdefs.classloader.URLClassLoaderAdapter" loader="java.net.URLClassLoader"/>covers Java's most used classloader that is used in Ant as Project- and SystemClassLoader.
<loaderhandler id="ant.clhandler.AntClassLoader" adapter="org.apache.tools.ant.taskdefs.classloader.AntClassLoaderAdapter" loader="org.apache.tools.ant.AntClassLoader"/>covers Ant's classloader that is implicitely created in
Typedef
and Taskdef
.
<loaderhandler id="ant.clhandler.ClassLoader" adapter="org.apache.tools.ant.taskdefs.classloader.SimpleClassLoaderAdapter" loader="java.lang.ClassLoader"/>covers trivial reports for any other classloader but doesn't support create, append and property actions.
To find the compatible and best fitting Loaderhandler
by reflection, Classloader
uses a LoaderhandlerSet
type, that
contains all possible Loaderhandler
s.
Classloader
's handlerSet attribute is a reference to
a LoaderhandlerSet
defined elsewhere. Instead of referring to an existing
LoaderhandlerSet
, you can can define one via a nested handlerset element.
| Attribute | Description | Required |
| handler | The Id of a LoaderHandler to add to this LoaderhandlerSet .
|
No |
| addAll | If "true" , all Loaderhandler s that are specified in Reference table
of the current Project will be added to this LoaderhandlerSet .
|
No, defaults to "false" . |
| addDefault | If "true" , all predefined Loaderhandlers will be added to the LoaderhandlerSet .
|
No, defaults to "true" . |
| refid | Makes this handler a reference to a LoaderhandlerSet defined somewhere else. |
No |
Loaderhandler
directly and
add multiple Loaderhandler
s to the LoaderhandlerSet
.
org.apache.tools.ant.types.LoaderParameters
. (Example: org.apache.tools.ant.types.AntLoaderParameters
)
Your adapter class needs to handle the parameters. (Example: AntClassLoaderAdapter
)Classloader
task with id="myid"
and
refer to them.
org.apache.tools.ant.types.LoaderHandler.DEFAULT_HANDLERS
).
If your adapter supports additional parameters, they should be supported as nested element inside
the Classloader
task like antparameters. (Example: Classloader.addAntparameters
)
Don't forget to update this documentation.
Assuming you support the classloader mypackage.MyClassLoader with your adapter class mypackage.MyClassLoaderAdapter:
<loaderhandler id="my.handler" adapter="mypackage.MyClassLoaderAdapater" loader="mypackage.MyClassLoader"/> <classloader classpath="load/with/my/loader" reset="true" loader="my.custom.loader" handler="my.handler"> <handlerset addDefault="true"/> </classloader>This creates a new mypackage.MyClassLoader with the initial classpath ${basedir}/load/with/my/loader and makes it referencable with id "my.custom.loader".
Assuming your classloader and adapter support custom parameters and you've written
a loaderparameters class mypackage.MyLoaderParameters that is compatible to Loaderparameters
,
the fragment
<loaderhandler id="my.handler" adapter="mypackage.MyClassLoaderAdapater" loader="myPackage.MyClassLoader"/> <typedef name="myloaderparameters" classname="mypackage.MyLoaderParameters"/> <myloaderparameters id="my.parameters" myargument="myvalue"/> <classloader classpath="load/with/my/loader" reset="true" loader="my.custom.loader" handler="my.handler" parameters="my.parameters"> <handlerset addDefault="true"/> </classloader>is the same as above but with support for you custom parameters. The handler attribute may be dispensable if your adapter supports the correct default handler.
© Copyright 2004-2005 The Apache Software Foundation. All rights Reserved.


Motivation
Writing is an important form of communication. However when writing, we often spend more time searching for appropriate citations than actually writing.
Citation Context
We can understand the context of a journal article without having to read the article itself through how other papers cite it.
Scraping Journals
Over a million sentences describing over 60,000 unique citations were scraped from over 130,000 open access journal articles with Python 3 and Beautiful Soup.
Natural Language Processing
Doc2Vec from the gensim package is a natural language processing neural network algorithm that vectorizes sentences into multi-dimensional space. An optimal model was used to vectorize each sentence and corresponding citation.
Citations to match Sentences
A users' sentence in first vectorized based on the optimized Doc2Vec model, then mapped into the models' multi-dimensional space. The model's citations with the highest cosine-similarity score (closest vectors in space) to the users' mapped sentence vector are returned as recommendations.


Armario is a web app that allows people to upload or capture images of their clothing and create outfits. This grants access to a new, more efficient way of planning outfits ahead of time. Questions, comments, or concerns? Contact us at<EMAIL_ADDRESS>or via Twitter or Google+:
I am a rising Junior at Middle College High School. Talk to me about Steven Universe.
I am a rising senior at Central High School. Please hire me.
I am a rising Senior at Castlemont High School in Oakland, Ca. Let's capture Pokemon and explore the Bay Area.


Click here to log in
Member Login
Username
:
Password
:
Create an Account
Rollover Images
Mouse over the images below


Rock, Paper, Scissors
"When you really want someone else to do it."
Wait for an opponent and click a button below to see who the RPS gods prefer
You are Player Number:
Talk some smack, it might help!
Number of Wins:
Number of Losses:
Number of Ties:
Users Connected:


--- layout: post title: angkor wat date: '2013-07-26T13:15:00+02:00' categories: - Sketches - Sketchbooks - Architecture picture_url: https://film-Storyboards.tumblr.com/post/56532705537/angkor-wat ---
Angkor Wat, from old Sketchbooks.


Feedback invited on resort plans for Carabooda
by Lucy JarvisPLANS for tourist accommodation in Carabooda are out for public consultation.
The City of Wanneroo has invited submissions until December 11 on an application for a resort, restaurant and reception centre on the corner of Wanneroo and Trian roads.
The Carabooda Village proposal would provide a tourism service as well as a function centre for events such as weddings with capacity for up to 176 people, and a restaurant open to the general public that could accommodate up to 52 people.
If approved by Wanneroo Council at a future meeting, it would feature 24 chalets with two bedrooms and a bathroom in each as well as three detached motel blocks, with five self-contained units in each building.
The plans for 14 Trian Road also include a pool area and activity space, baby animal farm, nature play spaces and parking.
According to a vegetation study, the 9.4ha rural property currently has a house, sheds, established gardens, remnant pasture, a pig pen, and sparse to dense existing tree stands with flooded gums, mature tuarts and a range of smaller trees.
Visit www.wanneroo.wa.gov.au to make a submission.
The City has also invited feedback on an application for a change of use to holiday house for a Yanchep property.
The short term accommodation proposal would allow up to eight guests to stay in the house at 27 Brazier Road.


CertWare Exports
Identifier:
net.certware.export.net.certware.export
Since:
1.1.0
Description:
Provides export capabilities to the run-time platform. Installs the exports for selection through standard workbench operations.
Configuration Markup:
<!ELEMENT extension (styleIdMapping | styleResource | styleContribution | exportOperation)+>
<!ATTLIST extension
point CDATA #REQUIRED
id CDATA #IMPLIED
name CDATA #IMPLIED
>
<!ELEMENT styleResource EMPTY>
<!ATTLIST styleResource
styleTheme CDATA #IMPLIED
styleFile CDATA #REQUIRED
>
An XML resource file associated with the example to be copied into the workspace.
- styleTheme - Description of the nature style file.
- styleFile - An XML style file to be loaded prior to export operations.
<!ELEMENT styleIdMapping EMPTY>
<!ATTLIST styleIdMapping
modelElementID CDATA #REQUIRED
styleString CDATA #REQUIRED
isParagraphStyle (true | false)
>
Maps one of the built-in style IDs to a model element or attribute. Use the model's package identifier for the identifier value. Use the style IDs from the built-in document styles (see docx4j styles.xml), e.g. "Heading1" for a paragraph style or "Heading1Char" for a run style.
- modelElementID - Model element number from the model package file.
- styleString - Paragraph or run style ID from built-in or supplemental styles.
- isParagraphStyle - True if the style is for paragraphs, false if style is for runs.
<!ELEMENT styleContribution EMPTY>
<!ATTLIST styleContribution
styleString CDATA #REQUIRED
isParagraphStyle (true | false)
>
Provides an XML-syntax string to define a new style.
- styleString - XML string describing the style including the namespace. The style name should be included in the string as it will be retrieved for application during the export process. The usual namespace for word processing documents in this framework is
xmlns:w="http://schemas.openxmlformats.org/wordprocessingml/2006/main".
- isParagraphStyle - True if the style is for paragraphs, false otherwise (for runs).
<!ELEMENT exportOperation EMPTY>
<!ATTLIST exportOperation
fileExtension CDATA #REQUIRED
class CDATA #REQUIRED
>
Class for exporting the argument as a formatted document from the export wizard.
- fileExtension - The model file extension to match when running the export wizard.
- class - The export operation class will be called from the workbench export wizard when a file of this type is selected for export.
Examples:
[Enter extension point usage example here.]
API Information:
[Enter API information here.]
Supplied Implementation:
[Enter information about supplied implementation of this extension point.]
Copyright (c) 2011 Kestrel Technology LLC.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/deterministic.20craziness.html ---
Consider the following example:
import ring_theory.adjoin_root import ring_theory.integral_closure open algebra variables {k : Type*} [discrete_field k] variables {L : Type*} [discrete_field L] [algebra k L] variables (L_alg : ∀ x : L, is_integral k x) variables (f : polynomial L) (hif : irreducible f) instance : algebra L (adjoin_root f) := algebra.of_ring_hom coe $ by apply_instance include L_alg --hif lemma alg_trans (x : comap k L (adjoin_root f)) : is_integral k x := _
If you remove the --
in the include statement, you get a timeout.
I have zero understanding of why. Adding the assumption that f
is irreducible seems completely harmless.
@Sebastian Ullrich Why can the mere adding of an assumption cause timeouts?
The instance saying adjoin_root
is a field depends on irreducible f
But why would that matter?
I don't need that instance
You need a ring
or comm_ring
instance presumably, and that instance would provide a path.
Last updated: Apr 24 2020 at 19:02 UTC


{% extends "layout.html" %} {% block content %}
What would have been the best stocks to invest in for a given period?
| Rank | Ticker | Company | Sector | Price in {{ from_year }} | Price in {{ to_year }} | Change |
|---|---|---|---|---|---|---|
| {{ loop.index }} | {{ stock.ticker_symbol }} | {{ stock.title }} | {{ industry_sector.title }} | ${{ avg_close_price_from }} | ${{ avg_close_price_to }} | {% if price_change_percent >= 0.0 %}+{% endif %}{{ "{:,.2f}".format(price_change_percent) }}% |


Edit Job.
Design
Programming
System administration
Must need skill :
{{skill.code_value}}
removeAllSelect
Save


|
clang::tidy PagesJaunes rules
1.0
Rules for manipulating PagesJaunes eSQL requests
|
#include <ExecSQLForToFunctionCall.h>
Classes | |
| struct | AssignmentRecord |
| struct | ReqFmtRecord |
| class | SourceRangeBefore |
| class | SourceRangeForStringLiterals |
| struct | StringLiteralRecord |
Public Types | |
| using | source_range_set_t = std::multiset< SourceRangeForStringLiterals, SourceRangeBefore > |
Public Member Functions | |
| ExecSQLForToFunctionCall (StringRef, ClangTidyContext *) | |
| Constructor for the ExecSQLForToFunctionCall rewriting check. More... | |
| void | storeOptions (ClangTidyOptions::OptionMap &Opts) override |
| Store options for this check. More... | |
| void | registerMatchers (ast_matchers::MatchFinder *) override |
| Register the ASTMatcher that will found nodes we are interested in. More... | |
| void | registerPPCallbacks (CompilerInstance &Compiler) override |
| Register callback for intercepting all pre-processor actions. More... | |
| void | check (const ast_matchers::MatchFinder::MatchResult &) override |
| This method is called each time a visited AST node matching our ASTMatcher is found. More... | |
Public Attributes | |
| ClangTidyContext * | TidyContext |
Protected Attributes | |
| std::vector< struct StringLiteralRecord * > | m_req_copy_collector |
| std::vector< struct AssignmentRecord * > | m_req_assign_collector |
| std::vector< struct ReqFmtRecord * > | m_req_fmt_collector |
Definition at line 27 of file ExecSQLForToFunctionCall.h.
| using clang::tidy::pagesjaunes::ExecSQLForToFunctionCall::source_range_set_t = std::multiset<SourceRangeForStringLiterals, SourceRangeBefore> |
Definition at line 87 of file ExecSQLForToFunctionCall.h.
| clang::tidy::pagesjaunes::ExecSQLForToFunctionCall::ExecSQLForToFunctionCall | ( | StringRef | Name, |
| ClangTidyContext * | Context | ||
| ) |
Constructor for the ExecSQLForToFunctionCall rewriting check.
ExecSQLForToFunctionCall constructor
The rule is created a new check using its ClangTidyCheck
base class. Name and context are provided and stored locally. Some diag ids corresponding to errors handled by rule are created:
| Name | A StringRef for the new check name |
| Context | The ClangTidyContext allowing to access other contextsInit check (super class) Init our TidyContext instance Request grouping option: Filename containing a json map for a group name indexing a vector of requests name |
Definition at line 127 of file ExecSQLForToFunctionCall.cpp.
|
override |
This method is called each time a visited AST node matching our ASTMatcher is found.
check
This method will navigated and inspect the found AST nodes for:
| Result | The match result provided by the recursive visitor allowing us to access AST nodes bound to variables |
Definition at line 899 of file ExecSQLForToFunctionCall.cpp.
|
override |
Register the ASTMatcher that will found nodes we are interested in.
registerMatchers
This method register 1 matcher for each oracle ProC generated statement to rewrite. The matcher bind elements we will use, for detecting the found statement we want to rewrite , and for writing new code.
| Finder | the recursive visitor that will use our matcher for sending us AST node. |
Definition at line 541 of file ExecSQLForToFunctionCall.cpp.
|
override |
Register callback for intercepting all pre-processor actions.
ExecSQLForToFunctionCall::registerPPCallbacks
Allows to register a callback for executing our actions at every C/C++ pre-processor processing. Thanks to this callback we will collect all string literal macro expansions.
| [in] | compiler | the compiler instance we will intercept |
Definition at line 562 of file ExecSQLForToFunctionCall.cpp.
|
override |
Store options for this check.
storeOptions
This check support one option for customizing comment regex
| Opts | The option map in which to store supported options |
Definition at line 515 of file ExecSQLForToFunctionCall.cpp.
|
protected |
Definition at line 174 of file ExecSQLForToFunctionCall.h.
|
protected |
Definition at line 117 of file ExecSQLForToFunctionCall.h.
|
protected |
Definition at line 223 of file ExecSQLForToFunctionCall.h.
| ClangTidyContext* clang::tidy::pagesjaunes::ExecSQLForToFunctionCall::TidyContext |
Definition at line 31 of file ExecSQLForToFunctionCall.h.


File locking is a form of IPC used to synchronize multiple processes' access to common files.
This API provides a co-operative file locking mechanism that can be used by multiple processes and/or threads to sychronize reads and writes to common files.
This API only supports regular files. Attempts to use this API on sockets, devices, etc. results in undefined behaviour.
Co-operative File Locking
Co-operative file locks (also known as advisory file locks) means that the processes and threads must co-operate to synchronize their access to the file. If a process or thread simply ignores the lock and accesses the file then access synchronization errors may occur.
Locking Files
There are two types of locks that can be applied: read lock and write lock. A file can have multiple simultaneous read locks, but can only have one write lock. Also, a file can only have one type of lock on it at one time. A file may be locked for reading if the file is unlocked or if there are read locks on the file, but to lock a file for writing the file must be unlocked.
Use le_flock_Open()
to lock a file and open it for access. When attempting to lock a file that already has an incompatible lock on it, le_flock_Open()
will block until it can obtain the lock. Call le_flock_Close()
to close the file and remove the lock on the file.
This code sample shows four processes attempting to access the same file. Assume that all the calls to le_flock_Open() in the example occur in chronological order as they appear:
This sample shows that Process 2 obtains the read lock even though Process 1 already has a read lock on the file. Process 3 is blocked because it's attempting a write lock on the file. Process 3 is blocked until both Process 1 and 2 remove their locks.
When multiple processes are blocked waiting to obtain a lock on the file, it's unspecified which process will obtain the lock when the file becomes available.
The le_flock_Create() function can be used to create, lock and open a file in one function call.
Streams
The functions le_flock_OpenStream()
and le_flock_CreateStream()
can be used to obtain a file stream to a locked file. le_flock_CloseStream()
is used to close the stream and remove the lock. These functions are analogous to le_flock_Open(), le_flock_Create() and le_flock_Close() except that they return file streams rather than file descriptors.
Non-blocking
Functions le_flock_Open(), le_flock_Create(), le_flock_OpenStream() and le_flock_CreateStream() always block if there is an incompatible lock on the file. Functions le_flock_TryOpen(), le_flock_TryCreate(), le_flock_TryOpenStream() and le_flock_TryCreateStream() are their non-blocking counterparts.
Multiple Threads
All functions in this API are thread-safe; processes and threads can use this API to synchronize their access to files.
Replicating File Descriptors
File locks are contained in the file descriptors that are returned by le_flock_Open() and le_flock_Create() and in the underlying file descriptors of the file streams returned by le_flock_OpenStream() and le_flock_CreateStream().
File descriptors are closed the locks are automatically removed. Functions le_flock_Close() and le_flock_CloseStream() are provided as a convenience. When a process dies, all of its file descriptors are closed and any file locks they may contain are removed.
If a file descriptor is replicated either through dup() or fork(), the file lock will also be replicated in the new file descriptor:
There must still be a read lock on the file "foo" because newfd has not been closed.
This behaviour can be used to pass file locks from a parent to a child through a fork() call. The parent can obtain the file lock, fork() and close its file descriptor. Now the child has exclusive possession of the file lock.
Limitations
Here are some limitations to the file locking mechanisms in this API:
The file locks in this API are advisory only, meaning that a process may simply ignore the lock and access the file anyways.
This API does not detect deadlocks and a process may deadlock itself. For example:
This API only permits whole files to be locked, not portions of a file.
Many NFS implementations don't recognize locks used by this API.
Copyright (C) Sierra Wireless Inc. Use of this work is subject to license.


Hello World
PROJECTS
I'm Julien, a student.
CLICK FOR PROJECTS
My main area of study is Computing and Software Systems, I also love applying myself in the visual arts. Feel free to check out my projects!
E-mail
LinkedIn
Codepen
Github
CONTACT
E-mail
LinkedIn
Codepen
Github


This week I was exploring how parallelism can be incorporated into decoding of Random Linear Network Codes ?
During decoding of RLNC coded pieces it's required to invert one N x N coding coefficient matrix, where N = #-of pieces coded together i.e.
generation size. And matrix inversion is quite expensive O(N ** 3), which is why I'm interested in implementing faster decoding algorithm
in kodr, a RLNC library I've started writing sometime ago. Currently implemented decoding technique
works in progressive mode i.e. as soon as a new coded piece is received, decoder attempts to compute Reduced Row Echelon Form of
updated matrix ( read considering new coded piece ), which keeps pieces partially decoded. When N-th linearly independent piece is received
last iteration of RREF calculation decodes whole data matrix & original pieces are revealed. This scheme works fine, but works in single threaded
mode. So I'm looking for scheme which allows leveraging multiple CPU cores while decoding pieces, which are coded with large generation size
( read N is high ). As soon as generation size goes beyond 64, decoding speed starts to fall down very fast. I've found literatures around
parallelization of RLNC decoding which also works in progressive mode i.e. decoder doesn't need to wait for receiving all of N-many coded pieces
before it can start decoding those pieces.
Today I'll dig deep into Parallel Role Division Progressive Decoding technique, proposed
here, which I'm already implementing
in kodr. You may want to check implementation progress.
In single threaded RLNC decoding implementation, there exists only one thread of execution which accepts newly received coded pieces; places coding vector into coding coefficient matrix & coded data vector into coded data matrix; reduces coefficient matrix into row echelon form, also replicates respective row operations in coded data matrix. This flow of execution is followed by executor thread on reception of every new coded piece. This way prograssively coded pieces get decoded. Finally reception of N-th linearly independent piece reveals all original pieces, N = generation size.
On the other hand, multi threaded variant of RLNC decoding employs more than one thread to work on coding coefficient matrix & coded data matrix. Easy to reason about way of employing > 1 threads of execution, is seperately considering coding coefficient matrix & coded data matrix. Say I create two threads of execution & place responsibility of mutating coding coefficient matrix on thread A, while other one replicates those mutations on coded data matrix portion. As soon as a new coded piece is received, that's inspected by thread A, which primarily figures out whether this piece is linearly dependent with already received pieces or not. If yes, discard piece because it doesn't bring any useful information which can help in decoding. If this piece turns out to be useful one, then thread A proceeds with forward cleaning & backward substitution steps. These steps are communicated to thread B, which replicates respective row operations on whole coded data matrix. So given one communication channel exists between thread A & B, each of them works on two seperate portions of coded piece matrix = coded coefficient matrix + coded data matrix. Actions of thread B are dependent on what thread A decides to do on coding coefficient matrix. But thread A doesn't necessarily need to wait for thread B to replicate respective changes, rather it can proceed with newly received coded pieces & in the mean time thread B performs its pending tasks. Those elementary row operations, which thread B needs to perform on coded data matrix are put in a work queue, which is periodically monitored by thread B ( read looking for new task ). Thread B runs at its own pace, which is <= pace of thread A. And on reception of N-th useful piece, thread A turns whole coding coefficient matrix into N x N identity matrix & enqueues respective row operations in work queue, which will be eventually executed by worker thread B --- revealing N-many original pieces. This progressive way to decoding allows me to make use of multiple cores available on almost all modern machines.
Let me extend this idea of operating on coding coefficient matrix & coded data matrix with two different threads of execution and employ > 1 worker threads, replicating elementary row operations on M-many non-overlapping set of columns of coded data matrix, given M-many worker threads are involved. Essentially coded data matrix is vertically splitted into M-many sub matrices of dimension K x ( piece-length / M ), where K = #-of coded pieces received till now & K <= N ( = generation size ). Then M-many threads asynchronously replicate row operations on non-overlapping submatrices, without using any concurrency control mechanism --- no slow down due to lock contention. Thread which works on coding coefficient matrix is called supervisor thread, inspecting coding vector of newly arrived coded pieces, determining whether linearly independent or not etc. . Supervisor thread performs some elementary row operations on coding coefficient matrix, which are placed in worker queue in order, as those are to be replicated in coded data matrix. M-many worker threads keep listening for messages from supervisor thread for new enqueued work to be replicated in respective submatrix, it's responsible for managing. Worker threads don't need to synchronize their actions, they all work in their own pace --- further making model affordable. After N-many linearly independent coded pieces are received, before decoded data can be consumed, it must be checked with M-many workers, whether they all have finished their pending works from worker queue or not. It may happen that not all of those M-many workers are completely done with executing row operations from worker queue & consumer end up reading still un-decoded data, which will be decoded in sometime future as soon as that/ those worker thread(s) complete their pending worklist. It may lead to data race, which is why before decoded data can be safely consumed, supervisor must receive M-many successful completion messages from M-many worker threads.
Now I'm going to demonstrate whole parallel decoding process with the help of an example. Say, generation size is 3 i.e. 3 pieces to be coded together & each piece is of size 4 bytes. So decoder needs to receive 3 linearly independent coded pieces to be able successfully decode original pieces. Supervisor thread works on coding coefficient matrix of dimension K x 3, where K = [1..3] & 2 worker threads are responsible for managing two non-overlapping coded data submatrices, each of dimension K x 2, where K = [1..3].
After reception of every coded piece, three steps are performed in order on updated coding coefficient matrix by supervisor thread. And respective steps are also replicated on coded data matrix by two worker threads.
When first coded piece is received, supervisor thread finds it's the only row in coding coefficient matrix, which is why step {1, 3} can't be performed for this piece. Linear dependence check requires dividing row C[0] by pivot element at C[0][0] & it can be clearly understood that as this is the only piece received so it's indeed useful i.e. trivial case. Resulting coding coefficient matrix looks like.
Now same step needs to be performed on coded data matrix, by two worker threads. Both worker threads divide row D'[0] of their respective submatrices by weight 211.
After reception of second coded piece, this is how coding coefficient matrix & coded data matrix looks like.
Forward elimination cleans elements below pivots, so I multiply row C[0] with weight at cell C[1][0]; add resulting vector ( element by element ) with row C[1]; finally put resulting vector in row C[1].
As element at pivot cell C[1][1] is non-zero, elements of row C[1] can be divided by C[1][1] --- piece is linearly independent. After step 2, C[1] of coding coefficient matrix looks like below.
Backward substitution cleans up elements above pivot elements. For eliminating elements above pivot element C[1][1], elements of row C[1] are multipled by C[0][1]; resulting vector is element-wise added with row C[0]; finally resulting vector replaces C[0]. This way both pivots C[0][0], C[1][1] have zero-ed cells above & below them.
Supervisor thread managed coding coefficient matrix looks like below, after second linearly independent piece is received.
Exact same row operations need to be performed on coded data matrix by two workers, which results into following. Note, these two worker threads are not synchronized.
After reception of third coded piece, coding coefficient matrix & coded data matrix looks like below. Again, aforementioned 3 steps to be performed for decoding data.
For eliminating cells below pivots i.e. C[0][0] & C[1][1], following row operations are performed. After following row operations i.e. completion of step 1, coding coefficient matrix looks as below.
As it turns out, pivot element C[2][2] is non-zero i.e. third piece is linearly independent with other two pieces, I can proceed with step 2, where pivot elements are made 1.
And finally step 3, attempts to clean cells above pivot elements i.e. here C[2][2]. For zeroing cells above C[2][2], following sets of row operations need to be performed, which results into below coding coefficient matrix --- N x N identity matrix, denoting all pieces required for decoding data are received, as rank of this matrix = 3 = generation size.
For actually consuming decoded data, I need to wait for both worker threads to execute all pending row operations. After completion of all pending row operations in coded data matrix, original pieces are revealed --- ready for consumption by client application. Before worker threads stop, they must send one message to supervisor thread notifying completion of all tasks, in submatrix allocated to it.
This way Parallel RDPD is able to harness power of multiple CPU cores available in most of modern machines,
for decoding Random Linear Network Coded data with minimal corridination among all employed threads. As worker threads are
not synchronized, they're free to proceed at their own pace, except at very end of decoding supervisor expects to hear
from all workers, notifying it of completion of execution of all pending elementary row operations.
How good is Parallel RDPD compared to single threaded decoding algorithm ? After I complete implementation of Parallel RDPD
in kodr & benchmark it I'll find that out.
Have a great time !


--- title: Terms sitemap: true header_title: Terms of service header_caption: "Last Revised: March 2, 2015" ---


{% block title %}
Get Python 3
{% endblock %} {% block link %}{% endblock %}
{% block script %}{% endblock %}
Python 3
Beautiful, Explicit and Simple.
{% block body %}{% endblock %}
Download
Libraries
Bottle (Web Framework)
PyGObject (Desktop/GUI)
PyQt (Desktop/GUI)
Books
A Byte of Python by Swaroop C H
Dive Into Python 3 by Mark Pilgrim
Programming in Python 3 by Mark Summerfield
Python 3 Object Oriented Programming
Python Programming: An Introduction to Computer Science by John M. Zelle, Ph.D.
Programming Python by Mark Lutz
Articles/Blogs
Python 2 or 3
Porting Python 3
Porting Python 2 Code to Python 3 (HOWTO)


---
format: html
external: true
author: Holly Schinsky
title: Sample Masonry Layout in a Mobile App (Cordova/AngularJS/Ionic)
link: http://devgirl.org/2014/05/22/sample-masonry-layout-in-a-mobile-app-cordovaangularjsionic/
type: post
date: 2014-05-22 20:51:43 Z
status: publish
tags:
- PhoneGap Network
---
If you're looking for a fun useful layout library for your mobile apps then you should check out the Masonry grid system library. This layout is what is used on the Pinterest site, as well as many others you've probably come across daily and just may not have been aware that a special layout technique […]


Right now this code is useless, and kind of annoying. It is useless because your name isn't actually saved anywhere. It is annoying because the prompt keeps popping up since CodePen automatically reloads the code often.
If you save this code and run it on your computer, you won't have that problem.


Welcome to Abco pizza where all your pizza requirements are met.
| Name | Size | Crust | Topping | Total |
|---|---|---|---|---|
Our establishment started back in 2016 when our CEO Mr. Felix chegero identified a niche in the market and decided to grab the opportunity.
EMAIL<EMAIL_ADDRESS>PHONE: +254741906738
BOX OFFICE: 4532-0100, Nairobi


Next: unuse-package, Previous: unintern, Up: Packages Dictionary
in-package
name ⇒ package
name—a string designator; not evaluated.
package—the package named by name.
Causes the the package named by name to become the current package—that is, the value of *package*. If no such package already exists, an error of type package-error is signaled.
Everything in-package does is also performed at compile time if the call appears as a top level form.
The variable *package* is assigned. If the in-package form is a top level form, this assignment also occurs at compile time.
An error of type package-error is signaled if the specified package does not exist.


Web Note is a new feature of Microsoft Edge. It helps you write, draw and make notes directly on the web page. You can also share the web page with your notes on it.
This autumn themed coloring book will take you through how to use Web Note. Click the
and scroll down to start with the maze.


Train Travel Times
Scheduled arrivals listed below
Current Train Schedule
Train Name
Destination
Frequency (minutes)
Next Arrival
Minutes Away
Add Train
Train Name
Destination
First Train Time (HH:mm Military Time)
Frequency
Submit


|
Bitstream Interpretation Library (BIL)
0.1
|
Files | |
| file | bitcorrelate.cpp [code] |
| Contains the main method of the bitcorrelate program. | |
| file | bitcorrelateArgs.cpp [code] |
| Contains definition of bitcorrelate command line parsing function. | |
| file | bitcorrelateArgs.hpp [code] |
| Contains declaration of bitcorrelate command line parsing function. | |
| file | bitcorrelateMsgs.cpp [code] |
| Contains definition of text message constants for bitcorrelate. | |
| file | bitcorrelateMsgs.hpp [code] |
| Contains declaration of text message constants for bitcorrelate. |


Lykke Wallet is the next generation trading platform with zero commissions. We make it simple to trade all asset classes. The immediate settlement and direct ownership is enabled by the blockchain. Some of the features available on both iOS and Android:
Working on Lykke Pay we look into the future and believe, micropayments on the blockchain will be available at every shop and restaurant, as banking cards nowadays. Our partner – 34Bytes – manufactured for us a POS handheld terminal connected to Lykke Pay, that prints out a check with QR code containing a receiver address and amount to be paid in Bitcoins.
As soon as Lykke Pay detects the required amount on the provided address, the terminal prints out a confirmation receipt. While we are waiting for a payment from a customer we take care of the market risk, once the payment is received, merchants working with us can convert received Bitcoins to FIAT currency at Lykke Exchange immediately.
Modern Money is a personal finance application that will help you take control of your money, build your financial portfolio and pay everyday bills on the go.
Modern Money is a multisignature wallet, which is like a safe with two keys. You have one key, and Lykke has the other. No one can take your money, even if your phone is stolen. Every transaction is approved by fingerprint and for additional security, we ask for PIN code as well.
Earth faces dangerous ecological tipping points due to primitive economic models that undervalue nature. We’re building a global movement to act on climate and protect biodiversity by investing in natural capital. Now is the time to reinvent finance with a truly sustainable global marketplace, open to everyone.
Empower sustainability leaders to launch innovative digital assets with 24/7 liquidity. Powered by blockchain and Lykke Alpha Engine. Democratise investment in natural capital.
Lykke.blue is a secure, easy to use e-wallet in iOS & Android with direct access to the world’s most inspiring marketplace.


Feature improvements
- Add "timeout" to exec, and "ntlm_auth_timeout" to mschap.
So that run-away child processes are caught earlier.
- Allow TLS clients to use "proto = tls", in which case
TLS is required. The shared secret is then set to "radsec".
- More documentation in the tls virtual server.
- Add "date" module for date formatting.
See raddb/mods-available/date.
- Added unit test suite for internal server functionality
- When loading "update" sections, check if the RHS is a literal
value. If so, syntax check it immediately.
- Update LDAP module documentation and functionality.
The generic attribute can now update lists.
- Updated dictionary.extreme.
- Update sqlippool to do clears as a separate transaction,
and at most once per second. This should help MySQL.
- Respect control:Response-Packet-Type for all types of
requests.
- Add support for SSL encryption to the MySQL driver.
- Allow arbitrary connection parameters to be used with the
PostgreSQL driver.
- Changes to the OpenLDAP schema to fully expose functionality
of the new LDAP module.
- Update debian packaging to include a freeradius-config
package. This package may be provided as a site local
package to avoid fighting with the preinstalled config
files.
Bug Fixes
- Use correct field for ARP setting in DHCP.
- Fix crash on debug condition (#454).
- Fix a number of minor issues caught by the clang
analyzer.
- Set WARNING messages to yellow instead of normal text.
- Correct debug colorise logic. Patch from Phil Mayers.
- Encode attributes of type "ethernet". No one uses them,
but it makes sense.
- Work around regex initialization issues.
- Fix build when linking against OpenSSL.
- Print IDs as positive numbers, which helps for large DHCP
XIDs.
- Fix issue with sql_ippool.
- sqlcounter now uses 64-bit counters, to deal with 4G overflow.
- Fix issues with DHCP subsystem.
- Don't build / install disabled modules, or their config
files.
- Fix build for OSX Mavericks, which hid the header files
in a magical place.
- Fix LEAP buffer issue. You should still avoid LEAP.
- Mark "unknown" WiMAX attributes as being WiMAX.
- Fix typo in packet decoder for fragmented extended attrs
- RPM spec fixes.
- Fix rlm_perl build issues when not using threads.
- Enable %{Response-Packet-Type} again.
- Update configuration file parser to handle "bool"
consistently.
- Update declarations of global boolean variables to use
"bool" consistently. This fixes an issue where some
modules were instantiated in "config check" mode and
did not work correctly.
- Make more messages debug instead of info, to avoid
polluting the logs with messages that can't be fixed.
- Set operator in internal unlang code to suppress spurious
warning messages.
- Fix debian packaging.
- Added "status" to Debian init script.
- Fix "update outer.request" to update the outer request.
- Don't print TLS debugging messages when not in debug mode.
- Correctly manage counters for "limit" sections of TCP / TLS
"listen" sockets.
- Fix libldap debug output.
- Fix rlm_ldap tls functionality.
- Initialise OpenSSL globals early to avoid issues with the
PostgreSQL library.
- Fix typo in sqlcounter expansion code. Fixes #463
- Overwrite previous instances of SQL-User-Name when adding
it to the request.
- Work around bugs in both MIT and heimdal versions of
krb5_copy_context(), which caused segfaults in
multithreaded mode.
- Provide meaningful error messages if Heimdal krb5 is used.
- Fix attribute supression in rlm_detail.
- Exit with error code if child fails to complete server
initialisation after forking. This allows init scripts to
correctly report whether the server started ok.


Badges are simple components that can be used to highlight, categorize etc.
&.sm
.badge
&.lg
&.turquoise
&.teal
&.yellow
&.orange
&.crimson
&.mauve
&.black
&.grey-dark
&.grey-light
&.white


Projects
The following are examples projects where I've applied my skills to deliver solutions.
OpenClinica Insight Product
I designed and implemented an ETL and reporting system that streamlines reporting and analysis workflows for dozens of OpenClinica customers and their numerous research projects. The system is primarily implemented in Python, with PostgreSQL using SQL and PL/PGSQL; some components include Clojure and shell scripts.
The OpenClinica system is underpinned by a form data collection and management operational database. Among many other features, forms are designed by users, can be version controlled, can be organised into visits, and each form element can be annotated or queried.
The Insight system transforms common data models for ease of reporting, and uses the metadata to dynamically generate data tables corresponding to user-specified form element groups. The transformation process incorporates strict data consistency and validations, and applies data refreshes in a performant way that minimises interruption to end users.
Obstetrics Medical Records Analysis
As part of my Masters of Biostatistics, for a non-coursework project unit I analysed Obstetrics medical records data from the Sydney NSW Local Health District Obstetrics department database and medical record. The project was supervised by a Professor and a post-doc researcher from an epidemilogy unit at the University of Sydney, as well as a statistics Senior Lecturer from Macquarie University. The analysis was conducted with SAS and LaTeX, involved writing custom macros, and produced a detailed report document with data tables, charts, and interpretation.
The analysis described the characteristics of women who had consecutive singleton pregnancies with a term over 20 weeks, comparing those with and without gestational diabetes mellitus (GDM) in the second observed pregnancy. The main exposures of interest were the duration of the inter-pregnancy interval (IPI), and the change in BMI. The main techniques used was logistic regression.
The analysis found that high initial BMI, weight gain, and longer than recommended IPI were associated with increased odds ratios for GDM in the second pregnancy. There was interaction between initial BMI and the BMI change, and initial BMI and IPI, suggesting that the effect of the exposures on GDM is amplified for overweight women. The findings were consistent with GDM diagnosis criteria, and previous research that investigated alternative combinations of these factors.
Breast Cancer Registry Analysis
As part of my Masters of Biostatistics, for a non-coursework project unit I analysed Breast Cancer data from the Auckland Breast Cancer Register. The project was supervised by a statistics Lecturer at Macquarie University, and a breast cancer surgeon at Bankstown-Lidcombe Hospital who had proposed the project. The analysis was conducted with Stata and LaTex, involved writing custom Stata modules, and produced a detailed report document with data tables, charts, and interpretation.
The analysis described differences in characteristics of women with breast cancer detected by screening (comparing by age at initial diagnosis, 45-69 years vs. 70+), and assessed whether baseline variables affected the association between age group and 5-year breast cancer mortality. The main techniques were Pearson Chi-squared and Cox Proportional Hazards models.
The analysis found that in general screening continued to detect similar disease profiles after 70, similar treatment combinations were used, and the strongest associations for 5-year survival were with age and disease grade. In the context of NZ breast cancer screening programs that end at age 70, these findings suggested that there may be some merit to extending these programs.
Mobile Data Collection
I designed and implemented a mobile data collection framework that improved quality and completeness of participant questionnaire data for 5 projects conducted by the VHCRP team at the Kirby Institute.
The framework covered all aspects - policies for device procurement, configuration, management, account management and security; tools for form design, validation, multi-language capable presentation customisation; procedures for data collection, submission, and storage; tools for ETL of collected data for analysis in Stata.
The deployment included over 80 Android tablets for offline data collection at study sites, including hospitals, clinics and prisons in Australia and internationally, with thousands of responses from hundreds of participants had been collected and processed. At the centre of the framework was ODK Collect, an Android app for processing XML-based form definitions. Design and data processing tools included custom distributable desktop apps written in Python.
OpenClinica Community DataMart
I designed and implemented an ETL and reporting system that streamlined reporting and analysis workflows for 13 projects conducted by the VHCRP team at the Kirby Institute. This system was implemented with PostgreSQL using SQL and PL/PGSQL.
This system replaced a time-intensive process involving numerous manual steps, with a robust, automated process. The ETL system involved transforming a column-based data storage format into user-friendly tables corresponding to the original form design templates uploaded to OpenClinica.
The deployment included encrypted connections between database servers and with client machines, data access controls mirroring those in OpenClinica, and integrated Windows domain authentication. Client tools were also developed to integrate via ODBC with Stata, SAS and Microsoft Access; as well as automated VBScript tools to simplify setup for new users. The preparation of detailed documentation and delivery of targeted training encouraged adoption of the system across the team.
System Integrations
I designed and implemented the following system integrations for the VHCRP team at the Kirby Institute:
- An automated daily transfer of hepatitis C test results from a LabKey sample management database to the clinical database in OpenClinica. Written in Python, and included development of a re-usable library for interacting with OpenClinica's SOAP XML webservices.
- A promotional website for a study with a custom styled LimeSurvey instance for web-based data collection from study participants. Written in Python and JavaScript and included development of a re-usable library for interacting with LimeSurvey's REST JSON webservices.
- An automated integration test suite for the above custom LimeSurvey template to ensure that these elements worked as expected across common browsers. Written in Python using Selenium WebDrivers for Firefox, Chrome and Internet Explorer.


NAME:
Name in use
Name can only contains letters, numbers, and dashes. Names must start with a letter or number.
ENTER:


| Author | Vasile Surducan, Copyright © 2010...2012, all rights reserved. |
| Adapted-by | |
| Compiler | >=2.4m |
software implementation for single SMbus master, use 4 hw stack
const id_number1 = 0x0F ; read only
var word temp = 0
var byte mem_low = 0
var volatile bit pwm_frequency at config: 1 ; 1=low, 0=high
var word config
const raw_ir_data = 0x05
var word temperature_k = 0
const tambiant = 0x06
const emissivity = 0x03
var volatile bit*3 iir_setting at config: 12 ; see table below
var word w_t_high = 0
var sword temperature_c = 0
var byte mem_high = 0
var byte t_high = 0
var volatile bit zero at config: 15 ; keep 0
const config_reg = 0x02
const bit ACK = low
const pwm_t_range = 0x01
const bit NACK = high
const tobject = 0x07
var sword temperature = 0
const id_number0 = 0x0E ; read only
const eeprom_access = 0b0001_0000
var volatile bit*9 factory_cal at config: 3 ; do not alter
const sleep_mode = 0b1100_0110
const smbus_sa = 0 ; SMbus Slave Address 7 bit, 0 to 6; 0x5b factory default
var sword s_t_high = 0
var bit mlx90615_ack = high
const ram_access = 0b0010_0000
var byte pec = 0
var volatile bit mode_select at config: 0 ; 1=SMbus, 0=PWM
var volatile bit pwm_output_temp at config: 2 ; 1=Tambiant, 0=Tobject
const sword c27315 = 27315
var byte nack_counter = 0
mlx90615_sleep( byte in senzor_address )
calculate_temp_k()
mlx90615_wake()
calculate_temp_c()
sm_start_bit()
sm_stop_bit()
sm_bus_initialize() is ; not necesary if SMbus
const id_number1 = 0x0F ; read only
No documentation found
var word temp = 0
No documentation found
var byte mem_low = 0
No documentation found
var volatile bit pwm_frequency at config: 1 ; 1=low, 0=high
No documentation found
var word config
No documentation found
const raw_ir_data = 0x05
0x04 to 0x4h Melexis reserved
var word temperature_k = 0
No documentation found
const tambiant = 0x06
No documentation found
const emissivity = 0x03
No documentation found
var volatile bit*3 iir_setting at config: 12 ; see table below
No documentation found
var word w_t_high = 0
No documentation found
var sword temperature_c = 0
No documentation found
var byte mem_high = 0
No documentation found
var byte t_high = 0
var byte t_low = 0
var volatile bit zero at config: 15 ; keep 0
No documentation found
const config_reg = 0x02
No documentation found
const bit ACK = low
No documentation found
const pwm_t_range = 0x01
No documentation found
const bit NACK = high
No documentation found
const tobject = 0x07
No documentation found
var sword temperature = 0
No documentation found
const id_number0 = 0x0E ; read only
No documentation found
const eeprom_access = 0b0001_0000
No documentation found
var volatile bit*9 factory_cal at config: 3 ; do not alter
No documentation found
const sleep_mode = 0b1100_0110
No documentation found
const smbus_sa = 0 ; SMbus Slave Address 7 bit, 0 to 6; 0x5b factory default
No documentation found
var sword s_t_high = 0
No documentation found
var bit mlx90615_ack = high
No documentation found
const ram_access = 0b0010_0000
No documentation found
var byte pec = 0
No documentation found
var volatile bit mode_select at config: 0 ; 1=SMbus, 0=PWM
No documentation found
var volatile bit pwm_output_temp at config: 2 ; 1=Tambiant, 0=Tobject
No documentation found
const sword c27315 = 27315
No documentation found
var byte nack_counter = 0
No documentation found
mlx90615_sleep( byte in senzor_address )
No documentation found
calculate_temp_k()
conversion to kelvin
mlx90615_wake()
No documentation found
calculate_temp_c()
No documentation found
sm_start_bit()
SMbus start bit
sm_stop_bit()
SMbus stop bit
sm_bus_initialize() is ; not necesary if SMbus
No documentation found
_scl_high()
No documentation found
_sda_high()
No documentation found
_scl_low()
No documentation found
_sm_send_bit(bit in x)
Transmit one bit on SM bus (for internal use only )
_sda_low()
No documentation found
_sm_receive_bit(bit out x)
Receive one bit on SM bus (for internal use only)
sm_transmit_byte(byte in tx_buffer) return bit
Transmit one byte on SM bus
sm_receive_byte(bit in ack_noack) return byte
Receive one byte on SM bus
| 18f25j10 | 18f25j10_test_mlx90615.jal |