about
About hexxed
hexxed is a puzzle game designed by scientists to study how we solve problems. By playing, you will contribute to a global experiment seeking to model the human creative process with unprecedented depth and clarity.
Download hexxed now!
About us
We are neuroscientists based in Lisbon and Berkeley who study how the brain shapes our behaviors in the laboratory, so that we may learn to make better decisions in our lives.
You can reach us at<EMAIL_ADDRESS>or follow us on social media with inquiries, feedback, and more.
We would love to hear from you!
hexxed is developed in Lisbon, Portugal and Berkeley, USA by Gautam Agarwal, Tiago Quendera, Mani Hamidi and Zachary Mainen
leaderboard
In hexxed, you compete to become the best in the world.
See how you rank by playing hexxed!
Scoring rules
- Your total score is the sum of your highest score in each of the 6 levels.
- You have to complete a level without getting hexxed to receive a score for the level.
- For each puzzle, you receive 1000 points for collecting it perfectly, and 0 points otherwise.
- In order to break ties, you receive a small number of additional points based on the speed with which you complete the level.
Privacy
Who is the app owner?
Gautam Agarwal
What data is being collected? How is that data being collected?
During gameplay, each user action, and its timing, is logged. In addition, the time zone, user language, IP address, device model, unique device identifier, and operating system version are collected. This data is sent to our server every time the user completes a level. Users can also access an optional survey where they are asked questions about gender, age, and personality.
What is the Legal basis for the collection? (e.g consent, necessary for your service, legal obligation etc.)
Users are asked for consent the first time they open the app. All data collection procedures were approved by the ethics committee of the Champalimaud Foundation in Lisbon, Portugal.
For which specific purposes are the data collected? Analytics? Email Marketing?
We use the data in an anonymous fashion for a scientific research project whose objective is to model players’ decision making process, and how it correlates to the characteristics of the player (their gender, age, personality, geographic location, and native language). The IP address is collected to identify the geographic location of subjects, and their unique device ID is used to associate all level attempts to the same (anonymous) player. There are no additional financial or commercial interests. The data is not used by us for any other purposes.
No third parties will have access to the data collected.
What rights do users have? Can they request to see the data you have on them, can they request to rectify, erase or block their data? (under European regulations most of this is mandatory).
Users can request to withdraw from the study and have their data erased.
To do so, please email us at<EMAIL_ADDRESS>and include the numbers in the game’s ABOUT tab.
Upon request, no record of the data will be kept.
Description of process for notifying users and visitors of changes or updates to the privacy policy
Any updates to this policy will be posted on our website (hexxed.io)
Effective date of the privacy policy
24 November, 2020
Research
You routinely make choices that are much more complex than they seem. Right now, in choosing to play this game you may wonder: Is it worth my time? Could I be doing something better? Your memories, desires, and imagination weave together in a mysterious way as you ponder. So, how do you choose?
We made hexxed to study this question.  Now we aim to collect data from tens of thousands of players like you. Why? Because mapping the creative impulse that fuels intelligence requires many repeated observations. Each of you arrives at the game with a unique history and tendencies, meaning that you can interpret the game in highly diverse and fluid ways. Nonetheless, based on our work in the lab, we believe that the commonalities across players will outweigh the differences, allowing us to map a territory of intelligent play, and see how people move through it.
Within one year, we will share our findings here, so that you may see how you and your fellow humans solve problems.
Ready, player 1?
This study is funded in part by Champalimaud Foundation and Bial.
Download
Android
IOS


Installation of astrolyze¶
astrolyze is only tested on Linux/Ubuntu so far.
Installation¶
Astrolyze is available via pypi, use:
sudo pip install astrolyze --user
to install the package.
When installed with the –user flag the package will be installed in:
/home/USERNAME/.local/lib/python2.7/site-packages/astrolyze
The configuration files for astrolyze are installed in:
/home/USERNAME/.astrolyze/
Further a script to configure the database for additional information is installed in:
/home/USERNAME/.local/bin/
Dependencies¶
Python¶
astrolyze depends on the following python packages:
astropy numpy scipy matplotlib pysqlite docutils generaltools
After installation of astrolyze via pip a list of these packages “requirements.txt” is copied to
/home/USER/.astrolyze/
The dependencies can be installed via pip:
pip install -r ~/.astrolyze/requirements.txt
Warning
Astrolyze does not work in python3 yet. Since the Gildas Python extension is not yet available for python 3!!
Gildas¶
To be able to use GILDAS from within astrolyze it is enough to have a working GILDAS installation compiled with the python support. The actual GILDAS version and installation instructions can be found here:
Miriad¶
Also Miriad just has to be installed and working. At the moment only the smooth function of miriad is used in astrolyze but it is worth installing it since it it a common task.
A package for Ubuntu 14.04 (works for 15.04 as well) can be found here:
ftp://ftp.astro.umd.edu/progs/carma/miriad_2014.7/miriad_linux64_u14_gfortran.tar.gz
and instructions for the installation of the package here:
http://vilhelmp.blogspot.de/2011/10/installing-sma-miriad-in-latest-ubuntu.html
Configuration of the (optional) Database¶
Astrolyze can store META Information for Sources, Lines and Calibration Uncertainties in a database. Based on the information deduced from the naming convention the additional information is loaded automatically when a map is opened.
astrolyze can read:
- Additional informations of the source
- Frequencies and wavelengths
- Calibration error for specific telescopes
The database has to be populated after installation This is done via the three text
files in the /home/USER/.astrolyze/cfg
folder that contains:
galaxy_parameter.txt:
# Name MorphType Distance[pc] VLSR[km/s] RA DEC PA[degrees] Inclination[degrees] R25[kpc]
M33 SA(s)cd 840e3 -179 01:33:51.02 +30:39:36.7 -22.5 56 30.8
NGC3627 SAB(s)b 9.1e6 727 11:20:15.027 +12:59:29.58 173 64 9.1
line_parameter.txt:
# line_name frequency[GHz]
HCOP10 89.188523
HCN10 88.6304156
12CO10 115.271204
13CO10<PHONE_NUMBER>
12CO21 230.542408
HI 1.427583133
HALPHA 457121.40
calibration_error.txt:
# telescope species cal_error Reference
WISE 2.4MUM 0.15 guess
IRAC 3.6MUM 0.1 guess
IRAC 4.5MUM 0.1 guess
WISE 4.6MUM 0.15 guess
IRAC 5.8MUM 0.1 guess
IRAC 8MUM 0.1 guess
WISE 12MUM 0.15 guess
WISE 22MUM 0.15 guess
MIPS 24MUM 0.07 Spitzers Observers Manual v.8.0
MIPS 70MUM 0.07 Spitzers Observers Manual v.8.0
PACS 100MUM 0.2 Kramer et al. 2010
PACS 160MUM 0.2 Kramer et al. 2010
SPIRE 250MUM 0.15 Kramer et al. 2010
SPIRE 350MUM 0.15 Kramer et al. 2010
SPIRE 500MUM 0.15 Kramer et al. 2010
GISMO 2MM 0.15 guess
The Names of the source telescope and lines have to be exactly how they are used in the map names. However the writing can be an arbitrary mix of upper an lower case characters. Internally Astrolyze converts them to upper case before comparing.
To generate the database from these files you have to run the script:
> ~/.local/bin/astrolyze_opt_db_setup.py
installed in .local/bin.


Hi!
The new version of our OsmAnd Tracker is ready!
We prepared new feature for you!
Now you can see the online moving of your contacts on the map of OsmAnd with online GPS-track. For this, you should switch on "Live" at your contact in "Timeline menu". If there are many sharing contacts at this moment OsmAnd app chooses the color of tracks by random.
When you click "Show in OsmAnd" or mini-map you can choose special settings for GPX-track your contact in OsmAnd app and see it live moving with track on OsmAnd map.
We added information to "Timeline" screen if you don't have data collected in the selected day. You can go to select the nearest date with one click.
Further instructions and helpful advice can be found here.
OsmAnd at Facebook, Twitter, and Reddit!
Join us at our group of Telegram (EN).
Join us at our group of Telegram (DE).
Join us at our group of Telegram (RU).
Get OsmAnd Tracker today from Google play.
.


|
All packages of Analysis Situs can be divided logically to the backend and the frontend parts. The contents of each part are schematically shown in the figure below.
To represent Data Model, Active Data framework is used. The Active Data framework is based on OCAF module of OpenCascade kernel. The architecture of an OCAF-based application resembles a typical architecture of an Enterprise application constructed on the top of a database engine. In our case, we have OCAF (Active Data) serving as a hierarchical no-sql in-memory database. At the layer above, all necessary Data Access Objects (DAO) reside. These DAOs bring an object-oriented abstraction to the Data Model. The Data Access Objects are also called Data Cursors (or Data Interfaces) as they do not store any data in their member fields and only point to the corresponding persistent entity (OCAF label) which can be used to read and write actual data. Finally, at the top level of Data Model, we have Services (mentioned as API in the figure above) which drive the business logic of the application. It is the role of Service layer to update the contents of the Data Model according to the user inputs.
Programmatically, the DAO layer of the architecture is realized in asiData library. In this library, all object interfaces are declared and implemented. For the Service layer, we have a dedicated asiEngine library. In the Service library, one can find classes like asiEngine_Part or asiEngine_IV which contain the business logic relevant to a specific object type (Part and Imperative Viewer for the mentioned classes).
For a Part object, a piece of business logic may assume recomputation of accelerating structures or AAG in case if the Part gets another B-Rep shape to store. In most cases, it is a good idea to work with a Part (and other object types) via its Service API (i.e., asiEngine_Part) instead of using the DAOs class (i.e., asiData_Part) directly. Calling API functions ensures that the Data Model remains consistent.
An object in Analysis Situs is called a Node following the convention of the Active Data framework. A Node is defined with a list of its Parameters which can be observed in the Parameter Editor panel of the desktop application. Additionally, a Node may have different relations to other Nodes, including:
The functional dependencies are optional in the whole framework. All operations in Analysis Situs, except the reverse engineering workflow, assume no automatic dependency execution.
The visualization module (implemented in asiVisu library) is tightly bounded to the Data Model backbone. For a Node to be represented in a 3D scene, the corresponding Presentation class is created. There is a one-to-one correspondence between the Node types and the Presentation types. Practically, it means that whenever a new Node type is introduced, the dual Presentation class should be created. A Presentation is essentially a collection of Pipelines, where a Pipeline is an abstraction to represent the similar notion of VTK visualization library [Schroeder, 2006].
A Pipeline starts with a Data Source which is aware of geometric primitives such as curves, surfaces, meshes, etc. At the same time, a Data Source is not aware of OCAF. The independency from OCAF at a Data Source level allows us reusing the predefined set of Pipelines and/or Data Sources in situations when no persistent storage is used or when the storage is variable (e.g., you may store a parametric curve in different Node types while the visualization Pipeline is just the same).
It is also possible to reuse Data Sources in different Pipelines. The latter is especially useful when dealing with large objects. It is a Pipeline object which creates all used data sources, algorithms (VTK "filters"), mappers and actors. By convention, a Pipeline may have only one actor (check VTK documentation for the overview about filters, mappers and actors).
The persistent data is transferred from OCAF to a visualization Pipeline by means of the so called Data Providers. A Data Provider is used to handle variability in the Data Model representations of a specific object which needs to be rendered in a 3D scene. Thanks to the abstract Data Providers, all Pipelines can be kept OCAF-free. The Pipelines only rely on the abstract interfaces of the corresponding Data Providers to feed their Data Sources properly. All details related to the Data Model, specific Node and Parameter types, and the relations between the data objects are encapsulated within the implementations of the specific Data Providers. The correspondence between Pipelines and their Data Providers is managed by Presentation classes. The Presentation classes construct Pipelines, Data Providers and associate them with each other.
All Parameters of all Nodes store their last modification time.  Each Pipeline stores its modification time as a member field. If the modification time of the sourced Parameters is more recent than the modification time of a Pipeline, the Pipeline should be (re)executed to bring data to the up-to-date state. Technically, since a Pipeline is not aware of OCAF and Data Model Parameters, the timestamp check is done by a Data Provider.
To visualize a Node, you need to construct a Presentation object for it. Additionally, it is necessary to specify the 3D viewer where this Presentation will render its Pipelines. The associativity between the Presentations and the Nodes together with a link to the rendering window is managed by the so called Presentation Manager. The Presentation Manager provides the following common services:
There is a one-to-one correspondence between Presentation Managers and 3D viewers. To visualize a Node in a certain viewer, you need this viewer to be managed by a dedicated Presentation Manager class. In Analysis Situs, the base class for all 3D viewers is asiUI_Viewer. This class holds a reference to its corresponding Presentation Manager.
There is a single entry point to the Data Model which is asiEngine_Model class. Using this class, you can iterate all Nodes in the project, find Nodes, delete and copy/paste them. This class is also responsible for such basic operations as Open/Save, Undo/Redo and compatibility conversion between different versions of project files. On start-up, the empty Data Model is created and populated with the predefined structure of Nodes.
Analysis Situs is based on Qt framework, hence it fully exploits the mechanism of signals-slots to organize the communication between the UI elements. The principal components comprising the user interface are listed below:
The widgets are used to display the controls and the listeners define the reactions of the widgets to the user events. It is the responsibility of a listener to organize computations, detach and monitor threads, supply the algorithms with all necessary data and make the outputs available to the user. Most listeners can be overridden so that for a single view (widget) it is possible to have various behaviour depending on how the listener is implemented.
The so-called common facilities object is a singleton representing the UI desktop of the application. It stores the pointers to the main UI controls (object browser, viewers, logger, console, etc.), and is generally accessible from within any UI component. While in principle such common access can jeopardize the consistency of the application state, we think that having such a singleton class is much better than passing only the essential UI controls to particular components of the program. Indeed, a true object-oriented encapsulation becomes impossible once you start encapsulating pointers to your shared resources, such as an Object Browser, etc. Think of this for a moment: the pointer is passed to a component class externally, so unless you make a deep copy (which is nonsense), you are not the only owner of the referenced object. Indeed, syntactical isolation (putting the member fields in a private section) of components does not prevent them from changing the global state of the software which is, in fact, a common problem in object-oriented architectures. Therefore, we decided not to make the illusion of isolation but instead to give all controls full access to the desktop elements. In our opinion, such an approach does not make the architecture any worse, but it makes the communication at least more transparent: anything can access anything (at a certain architectural level). A natural alternative could be to communicate all components via messages (like Qt signals and slots), and this approach found a limited use in Analysis Situs (an example is the relationship between the widgets and their listeners). We think that using the signals & slots mechanism alone (i.e., without direct pointers) is a bad property of an over-architectured software system which is hard to understand and maintain.
The vast majority of algorithms provided within Analysis Situs is accessible via the Active Script console. The geometry processing and modeling algorithms cannot be unified in a simple way, so there is no single rule of thumb for their organization and launching. At the same time, in the recent developments the following architecture is being followed:
Some examples of the algorithms organized into the Tree Functions include:
The parametric nature of a persistent algorithm makes it convenient for experimenting with the input data. In most cases, a persistent algorithm is represented with a specific Data Node in the project tree.


Developer with 3+ years of experience, able to build web applications from ground up. Skilled at writing well designed and efficient code, an eager learner who wants to continue to enhance technical skills with hard work and dedication. Exceptional at integrating creative problem-solving skills to develop user-friendly applications and proficient in an array of scripting languages and multimedia web tools. Fast learner and team player with positive attitude.
• Developed and implemented high performing complex application using Ruby on Rails and MySQL.
• Created innovative, responsive and user-friendly website design.
• Using Ruby on rails to create a Dynamic user profile that allows user to upload private state employee information onto MySQL database.
• Developed admin section and analytical dashboards.
• Implemented and enhanced CRUD operations using MVC.
• Recognized for creating a Statewide Training Manual for the Caltrans Department of Transportation Office of discipline services which is now being used in multiple districts.
• Created a Statewide Discipline Request form that is used by Caltrans.
• Recognized for creating an application that met the companies audit requirements.
• Implemented UI design using HTML5 and CSS3.
• Designed and Built Login/Signup pages using HTML and JavaScript and used parse to save data on cloud.
• Implemented search bar and filters in application using AJAX.
• Rewrote existing code in addition to adding new code.
• Maintained analysis of requirements and identification of missing requirement’s/gaps if any.
• Debugging of application using Chrome development tools and fixed identified defects during unit testing.
• Recognized for following code standards and code quality.
• Maintained version control of files using GIT.


If debugging is the process of removing bugs, then programming must be the process of putting them in. --Edsger Dijkstra [ source]


|
SVG plot
|
Boxplot of two functions. More...
#include <boost/svg_plot/svg_1d_plot.hpp>
#include <boost/svg_plot/svg_boxplot.hpp>
#include <vector>
#include <cmath>
#include <iostream>
Functions | |
| double | f (double x) |
| double | h (double x) |
| int | main () |
Boxplot of two functions.
| double f | ( | double | x | ) |
| double h | ( | double | x | ) |
| int main | ( | ) |


Given an unsorted array of n elements, write a function to sort the array #### Approach
O(n^2)
Worst case performanceO(n log n)
Best-case performanceO(n log n)
Average performanceO(log n)
Worst case
Tony Hoare in 1959
arr[] = {10, 80, 30, 90, 40, 50, 70}
Indexes: 0 1 2 3 4 5 6
low = 0, high = 6, pivot = arr[h] = 70
Initialize index of smaller element, i = -1
Traverse elements from j = low to high-1
j = 0 : Since arr[j] <= pivot, do i++ and swap(arr[i], arr[j])
i = 0
arr[] = {10, 80, 30, 90, 40, 50, 70} // No change as i and j
// are same
j = 1 : Since arr[j] > pivot, do nothing
// No change in i and arr[]
j = 2 : Since arr[j] <= pivot, do i++ and swap(arr[i], arr[j])
i = 1
arr[] = {10, 30, 80, 90, 40, 50, 70} // We swap 80 and 30
j = 3 : Since arr[j] > pivot, do nothing
// No change in i and arr[]
j = 4 : Since arr[j] <= pivot, do i++ and swap(arr[i], arr[j])
i = 2
arr[] = {10, 30, 40, 90, 80, 50, 70} // 80 and 40 Swapped
j = 5 : Since arr[j] <= pivot, do i++ and swap arr[i] with arr[j]
i = 3
arr[] = {10, 30, 40, 50, 80, 90, 70} // 90 and 50 Swapped
We come out of loop because j is now equal to high-1.
Finally we place pivot at correct position by swapping
arr[i+1] and arr[high] (or pivot)
arr[] = {10, 30, 40, 50, 70, 90, 80} // 80 and 70 Swapped
Now 70 is at its correct place. All elements smaller than
70 are before it and all elements greater than 70 are after
it.


---
layout: post
title: BibleWorks
date: '2009-07-28T10:32:00.002-05:00'
author: Jabell
tags:
- Bible
- Apple
modified_time: '2010-12-10T13:33:32.419-06:00'
blogger_id: tag:blogger.com,1999:blog-19739956.post-7005119619526600639
blogger_orig_url: http://theabellsix.blogspot.com/2009/07/bibleworks.html
---
Since I began formal theological studies in 2004, I have been using BibleWorks as my preferred Bible software. I have often argued for this software over Accordance and Logos. My main arguments are that BibleWorks is faster and cheaper and provides more bang for the buck than either of the other two contenders. The only downside is that BibleWorks does not run natively on a Mac; instead, one has to use Parallels or VMWare Fusion.
Justin Taylor linked to two reviews by Keith Mathison, one on BibleWorks and one on Accordance. It seems that Keith and I have the same understanding about these software bundles.


Hi, I'm Shirley! I'm a junior at Stanford University studying international relations and computer science. I enjoy making artsy videos and I also have a passion for dance, singing, and music. You can find my videos under the "Videos" tab.
I am also very passionate about debate and competed in parliamentary debate while in high school(also dabbled a bit in public forum on the side). It was a formulative experience and now I am a debate coach, hoping to also enrich the lives of my students with this wonderful activity.
Anyways, this website will mostly be a hub for my random non academic interests, but at some point I might add more of my academic interests here as well.


@* * Copyright 2021 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import timetopaytaxpayer.cor.model.Debit @import model._ @(debits: Seq[Debit])(implicit messages: play.api.i18n.Messages, request: Request[_])
@partials.charge_code(debit.originCode, debit.taxYearEnd) @Messages("ssttp.calculator.self-assessment-account-summary-page.for-tax-year", debit.startTaxYear.toString, debit.endTaxYear.toString)


{% extends 'base.html' %} {% block pagetitle %}Brian R. Bondy - Web Applications expected age by tag list{% endblock %} {% block title %} Web Applications expected age by tag list{% endblock %} {% block subtitle %}Calculated by using the expected value for the age each answer comes from{% endblock %} {% block main_content %}
This list contains the expected age per tag from the the Web Applications site, sorted by expected age.
The list was generated with the Web Applications April 2011 data dump on 4/25/2011 10:48:43 PM.
The creator of this list is Brian R. Bondy: Blog, Twitter, StackOverflow.
Please see the following link for other lists.


If you have any comments about our WEB page, you can either write us at the address shown above or you can e-mail us at<EMAIL_ADDRESS>due to the limited number of personnel in our corporate office, we are unable to provide a direct response.


--- layout: post status: publish published: true title: Updated SqlTrackingQuerySample author: display_name: Tomas Restrepo login: tomasr email<EMAIL_ADDRESS>url: http://winterdom.com/ author_login: tomasr author_email<EMAIL_ADDRESS>author_url: http://winterdom.com/ wordpress_id: 920 wordpress_url: http://winterdom.com/2006/10/updatedsqltrackingquerysample date: '2006-10-26 06:36:40 +0000' date_gmt: '2006-10-26 06:36:40 +0000' categories: - WinFX - Workflow tags: [] comments: [] ---
I just uploaded an updated version of the SqlTrackingQuery sample application I had created in January. I added no new functionality, just cleaned it up a little and now it compiles cleanly and works against the .NET FX 3.0 RC1 release.
Technorati: Windows Workflow Foundation, WF, SqlTrackingQuery, .NET


|
MAY 2015 EEO PROGRAM Digest |
|
BLOG:
We hear this all the time, and we say it ourselves. If you’ve been to EEO Training and perhaps attended one of Mark’s Learning to SEE® workshops or boot camps, you know how important it is to approach energy efficiency selling differently. Read More »
|
|
|
BLOG:
It’s a bit depressing, but Google “learning retention rates after training” and you’ll see plenty of studies and neat graphics that tell us what we already know: If you do nothing to reinforce what you’ve learned, within two weeks of training you’ll have forgotten about 85% of what you learned. Read More »
|
|
|
|
Upcoming webinar! Join us for an EEO + Noesis Portal Introduction. The next sessions are on May 27th and June 24th, both at 2pm CDT. Click here to register »
|
|
|
BLOG:
We’ve all heard that expression or something like it – particularly with the discretionary, value-based projects that are the focus of growth for EEO Professionals. Read More »
|
|
|
BLOG:
There are endless clichés to describe when you stop receiving feedback or interest in a project. When it comes to energy efficiency, these clichés are all too familiar. Read More »
|
|
|
|
Find Past Editions of the EEO Digest Below:
|
|
|
|
|


Mooltipass
General
Credential Fields
Blacklisted Sites
About
Blacklisted Sites
Sites on this list do not prompt for password updates.
Page URL
No blacklisted URLs.
Add blacklisted site
Add


climate \documentclass[pt]{minimal} \setlength{\oddsidemargin}{-pt} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amsmath} \usepackage{amssymb} \usepackage{mathrsfs} \usepackage{upgreek} \usepackage{wasysym} emissions carbon \begin{document}$$_{{ forcing }}^{{}}$$\end{document} uncertainties {border-style GtCO case change px;} #ffffff;} total Change model uncertainty adaptation ranges results using GDP temperature gross lower parameters \begin{document}$${.}_{-.}^{.}$$\end{document} costs MAGICC cycle industrial obtained socioeconomic used Clim USD()/tCO assessment climate-related likely losses mitigation radiative scenario IPCC increase indicate targets use van Climate Fig. SSP case. corresponding cost emission land-use models output prices px; shown social upper {font-family CMIP Econ Environ Masui achieve difference font-size global module physical processes range target target. (nos. ./s--- Asselt Fujimori Hasegawa Nordhaus Table \begin{document}$${}_{-}^{}$$\end{document} based double; estimates levels net pathways reductions result scenarios study (Fig. (Fujimori (Su (i.e., Cambridge Environmental Institute Press SCMOPT Takahashi analysis approximately associated border-color border-width change. consistent estimated individual integrated larger median rates relatively simple simplified solid; sources {font-style {font-weight (–) -eq ./j.gloenvcha... Bruin Contribution DICE Douglas GMT Glob However, PAGE Riahi Rotmans Shared Socioeconomic Sztorc University [], abatement bars bold calculate considering control costs, courier; damages effects em; ends estimate explicitly forcings function mean moderate negative optimization ozone, ppm pt;} report represent stabilization supplementary


Who sang the song "Thriller"?
What NBA team did Kobe Bryant play for?
Who created both LOST and Alias?
What year were American Women allowed to vote?
Who makes the Echo?


Master Chef Donath:
Did you bring the meat and the ice crystal? I'm going to get started. It isn't going to be easy! You can wait if you want to. Maybe you could practice your skills or something!
A certain amount of sacrifice by the chef is necessary, but you risked your life obtaining the ingredients, so I'll do my part!
"I'll wait."


Project 2 --Louisville Government Employee Salaries
YaHui Liu - Winter/2017 Ecs 163
Overview Visualization & Detailed View
Total Annual Rate VS. Overtime Rate VS. Incentive Allowance VS. Year
Total Employee Salaries VS. Louisville Government Department
The first and second visualization views include a set of a connected bar chart, a pie chart, and a legend table. The bar chart which is at the left of the page shows the number of total annual rate, the overtime rate or the incentive allowance during 2008 to 2017 by the length of each bar. And the pie chart which is to the right of the page will compare the rates of these three different type of salaries by using the size of each piece. And the legend will show the specific data changed with users’ selections.
The way to use this set of a connected dashboard is to move the mouse over different bars of years or different pieces of the type of salaries. Then the size and color of bars or pieces of pie will change with the specific setting based on the data and legend colors. An additional operation is a checkbox on the left side which will sort the bar chart by clicking.
The third visualization is a donuts chart with a select menu of different government departments. By using the selection menu on the top-left to select a different department, the donuts chart will show the total of employee salaries during 2008 to 2009 of this department. All of the legends contains different years are in the middle of the chart will remain user to notice the different colors. Every color which is in the same color hue (e.g. different color numbers of blue, green and red) will contain the continuous four years which will let users notice much easily
Annual Rate VS. Regular Rate
The last extra visualization is a line chart with plot bubbles as line point weightings. This chart will mainly compare the annual rate and regular rate during 2008 to 2017. The lines’ positions will show the average annual rate or regular rate in each year and the size of each plot bubbles will contain the total annual rate or regular rate in each year. For the color, the blue line shows the annual rate and the red line shows the regular rate. And when the users move their mouse to each plot, will highlight the data point and get the specific information of the plot bubble.


{% extends "layout.html" %} {% block content %}
{{ fname }} successfully uploaded.
Original Image ⤵
Detected Image ⤵
Upload another?


Good afternoon,
The IT Department has just finished migrating to a new anti-virus platform which will more accurately identify viruses and malware which may affect your systems.
Click here to activate and update the new anti-virus software.
If you could do so by the end of the day, this will help us get everyone on to the new system over the weekend and the new software fully functional ASAP.
Much appreciated,
{{ sender.friendly_alias }}
Systems Engineer
{{ client.company_name }}
{{ sender.email }}
{{ tracking_dot_image_tag }}


Use the button below to trigger a refresh on the cache system, useful when you've made character updates but not DKP updates. The cache will automatically update every 12 hours OR when a DKP change is detected such as Add/Delete/Update raids or Adjustments. It should be rare that you force reset a cache, give approximately 30 seconds for this operation to finish
Below are useful administrative tools for the site, each with their own dedicated page
These settings control the Class cards at the top of the DKP Summary Page. You can define which Ranks show up in those cards along with how many show up in each card. If no values are stored here, the defaults are all ranks show and up to 5 are listed.
Every night OpenDKP runs a batch job which automatically marks characters as Active or Inactive based on their raiding history. Below you can toggle the batch on, off or fine tune the batch settings such as deciding whether the batch marks characters as active or inactive. The batch will mark inactive characters as active if they have attended a raid in the last N days, where N is determined by you. The batch will mark active characters as inactive if they have NOT attended a raid in the last N days, where N is determined by you.


When exposing an application as a service, the exposer is responsible for providing the relationship that will perform his side of the relationship connexion.


I am Shwetank Babal. I am from Jaipur Rajasthan.
I have done my schooling from Jaipur and my aim in life is to be in civil srevices as both my mother and father are in civil services.
I am pursuing my B.Tech in CSE from VIT University Chennai


Summary
Project:
Number of java files:
Analysis was performed by:
Date:
Group findings by: Type Category Severity Class


WITNESS LIST
S/C on Public Education Funding
February 22, 2011 9:00 AM
Public Testimony
FOR:
Mayton, Emma Lea retired public school teacher (school children of Texas / self), Austin,
TX
AGAINST:
Budak, Patricia A. Retired Texas Teacher (self), Austin, TX
Drummond, Marie retired public school teacher (also providing written testimony) (self)
ON:
CASEY, DANIEL T. PARTNER, MOAK, CASEY & ASSOCIATES (FAST GROWTH
SCHOOL COALITION AND MYSELF), Austin, TX
Champion, Nancy Professional School Counselor (Texas Counseling Association),
Weatherford, TX
Colbert, Paul consultant (El Paso ISD), Houston, TX
Grusendorf, Wm. C. (Bill) Exec. Director (Texas Assoc. of Rural Schools), San Saba, TX
Pierce, Wayne Executive Director (also providing written testimony) (Equity Center),
Austin, TX
1


Loops are another form of control flow. They "loop" through a block of code until an original specified condition is no longer true.
For loops are an incredibly useful kind of loop. Always make sure your loop eventually evaluates to false or you will create what is called an infinite loop and crash the browser.
View syntax example
//prints numbers 1-10 to the console
for( i = 0; i < 11; i++){
console.log(i);
}


Preparation time
less than 30 mins
Cooking time
over 2 hours
Serves
Serves 4
Black cod with miso is a popular Japanese dish and would stand out as part of a main course a dinner party. The creamy white flesh of the cod is balanced beautifully with the sweet/salty miso paste.
To make the saikyo miso, put the sake, mirin, miso paste and sugar in a medium saucepan and bring to the boil over a high heat. Cook for a few minutes, until the sugar has dissolved. Leave to cool to room temperature.
Put the cod in a bowl and cover with the saikyo miso (reserving a little to garnish). Cover and leave to marinate at room temperature for 2–3 hours.
When you're ready to cook the cod, preheat the oven to 220C/200C Fan/Gas 7. Heat an ovenproof frying pan over a medium heat. Lift the fish fillets out of the marinade and cook them skin side-down in the pan for 2 minutes. Turn the fish over and roast in the oven for 6–8 minutes, or until cooked through and blackened.
Meanwhile, for the sesame spinach, bring the dashi stock to the boil in a large saucepan and add the soy sauce and sugar. Once the sugar has dissolved, add the spinach, stir and turn off the heat. Toast the sesame seeds in a dry frying pan until golden, then crush using a mortar and pestle. Drain the spinach, reserving the liquid, and squeeze out any excess moisture. Mix the spinach with almost all the toasted seeds and a little of the cooking liquor.
To serve, gather the spinach into a ball and top with the remaining sesame seeds. Serve with the cod and hajikami, with a few drops of the reserved saikyo miso on each plate.


{% extends "base.mail.html" %}
{% load i18n %}
{% block content %}
{% blocktrans with receiver_name=to.short_name %}
Hello {{ receiver_name }}
The scheduled date of your task "{{ title }}" has been reached.
No candidates have been accepted, therefore the task is set to closed.
Please confirm the candidates to set your task to realised.
{% endblocktrans %}
{% endblock %}
{% block action %}
{% trans 'Confirm participants' context 'email' %}
{% endblock %}`


( article-id*, ( article-version | article-version-alternatives )?, article-categories?, title-group?, ( contrib-group | aff | aff-alternatives )*, author-notes?, ( ( pub-date )* | pub-date-not-available? ), volume*, volume-id*, volume-series?, issue*, issue-id*, issue-title*, issue-title-group*, issue-sponsor*, issue-part?, volume-issue-group*, isbn*, supplement?, ( ( fpage, lpage?, page-range? ) | elocation-id )?, ( email | ext-link | uri | product | supplementary-material )*, history?, pub-history?, permissions?, self-uri*, ( related-article | related-object )*, ( abstract )*, trans-abstract*, ( kwd-group )*, funding-group*, support-group*, conference*, counts?, custom-meta-group? )
May Contain:


Javascript makes it possible to select html elements and make modifications. This page uses getElementById.


field framework for web applications
|
inputEx is an open-source javascript framework to build fields and forms for web applications using the YUI3 library. AboutAll the fields and forms are configured using JSON or created in Javascript. It provides a very efficient abstraction for building interactive web applications. Disclaimer: It is not an unobtrusive library, but has much more to see! |
Download inputex 3.1.0
inputEx is released under the MIT License |
HTML fields"Meta" fields
Widgets |
Date & Time fields
Extended
NumbersJson-Schema |
WrappersSMD json-rpc/RESTOtherStylingTools |


visOctreeAttrAccess Class Reference
[
VisAPI Index
] [
VisAPI Hierarchy
]
More...
#include <
VisApi/VisApi.h
>
Inherits:
visAttributeAccess
Public Members
virtual bool
instanceOf
(visClassId id)
visOctreeAttrAccess
(visOctreeNode *octreeNode, visOctree *octreeAccess)
~visOctreeAttrAccess
()
virtual int
getSize
()
virtual int
getAttributes
()
virtual visAttribute *
getCellAttribute
(int n, int attr)
if
(attr < 0 || attr >= myAttributeCount)
if
(myOctreeNode->child && myOctreeNode->child[n])
return
p
return
NULL
virtual visAttributeFactory *
getAttrFactory
(int comp)
Private Members
visOctreeNode *
myOctreeNode
visOctree *
myOctree
Documentation generated by breitlip@atzenger10 on Mon Jan 17 19:29:23 CET 2000
K
doc


Motivation
Sounds cool, but I need that why?
"With great Power comes great Responsibility"
"With great 'Buzz Words' comes great Responsibility"
-- Me
Disclaimer:
- There is nothing wrong with "buzz words".
- There buzz is generated by value.
Following the current trends
Chances are that you are already using...
-
Cloud
-
NOSQL Databases
-
Message Brokers
-
Rest APIs
-
Anything that qualifies as a "Service"...
Which of course you will eventually have to "configure"!
Are your services "Set to Stone"?
You could always hardcode everything...
... as long as you tell no one!
But when you build for ...
-
Cloud
-
Elasticity
-
Scalability
IP Address & Ports are rarely known in advance!
So hardcoding is not just "smelly", its also not workable.
What you need is Location Transparency.
Continous Delivery
The more VMs your application is using, the more challenging to...
Speaking of "Down Time" ...
-
Failover Strategy
-
Load Balancing
-
Access shared resources
Bottome line: You need Coordination.
Summary: To stay "relevant"
you need...
-
Tools for allocating resources (e.g. VMs or LXC containers)
-
Tools for installing your apps to those resources.
-
Tools for discovering services.
-
Tools for coordinating services.
-
Tools to managing/monitoring those services.
-
Tools for glueing all these together.
Good news !!!
There are indeed lots of tools.
Infact, there are too many!
What's missing?
A unified tool...
You can use Fabric8.
Fabric8 Concepts
- ZooKeeper for Registry and Coordination
- Git for Configuration
- Profiles for modeling configuration
- Hawtio for managing
Runtime Registry
Apache ZooKeeper
-
Sequential Consistency
-
Atomicity
-
Single System Image
Ideal for distributed system coordination...
Runtime Registry
How is it used?
-
As a registry of non configuration data.
-
Distributed Locks
-
Leader Election
-
Service Discovery
Runtime Registry
What does it contain?
-
Container Status
-
Container connection addresses
-
Container allocated resources
-
Container services (URLs, Endpoints)
So where do the "configuration data" live?
Git
Git
Why Git?
-
Versioning
-
Full audit history (who changed what and when)
-
Multiple Repositories Concept
-
Easy access through external clients
-
Works pretty well on unreliable networks
-
It's becoming a standard
Git
Isn't the git repo becoming a single point of failure?
NO! Fabric8 provides you with an HA Git Repository!
Git
Highly available Git
Fabric8 treats Git as any other HA service:
-
Uses Runtime Registry for Master election.
-
If the "current" master fails...
- host goes down
- jvm crashes
- unable to serve http content
-
A new master will get elected.
-
All containers will switch to the "new" master.
How is configuration modled?
-
What layout I should use?
-
How is the configuration applied?
Profiles
Configuration is not meant to be applied to all containers
Instead of configuring each container individually...
Identify logical groups of containers and create profiles for them.
Profiles
What exactly is a profile?
"A collection of configuration resources that can be applied to the container"
-
Hierarchical
-
Reusable
-
Combinable
-
Versioned
Some exaples of such resources:
-
property files
-
json files
-
XML files
-
ActiveMQ broker.xml configuration files
-
A camel routes
-
Anything !!!
Profiles
What can I define in profiles?
-
What should be deployed to the container.
-
The configuration of your container.
-
Configuration Admin Support
-
Raw files that can be easily looked up (e.g. profile://config.xml).
Profiles, Containers & Git
How do I use all these?
-
A git branch corresponds to a version.
-
A version contains multiple profiles.
-
A container can be assinged a version and multiple profiles.
-
Each container:
- Checkouts the assigned version
- Reads the associated profiles
- Applies configuration to itself
- Provisions itself
- Acts as a configuration repository
-
Easy way of performing rolling upgrades / downgrades.
Containers, Versions, Profiles, Applications
How do I manage all this?

Hawtio
Remember when we talked about a "common" facade?
Hawtio is a unified console for visualizing & managing everything.
Written on AngularJS!
Pluggable
Rich collection of plugins
-
Camel
-
ActiveMQ
-
OSGi / Karaf
-
Docker
-
... lot more


[ by Michael Taylor]
After the header data comes each object's definition. Each one starts with an object header and then the data. The object header is the word "OBJECT" followed by the object's name in double quotes. The object names seem irrelevant provided they are unique within the 3DO file. Next is the word "TEXTURE" followed by the texture used for this object. If no texture is used then the value of -1 is used else an index into the texture table defined in the header data is given.
| OBJECT "shuttle"
| TEXTURE 0 # Index into texture array
| # IFOCTGR.BM
After the texture information, starts the actual geometric description of the object.
First comes the vertices. The initial line is the word VERTICES followed by the number of vertices defined. Then the vertices are listed starting with 0 and going up to the number of vertices listed on the VERTICES line. Each vertex is defined by 3 numbers; x, y, and z. They represent relative locations on a 3-D graph. They are taken to 3 decimal places.
| VERTICES 8
| 0: 0.000 2.000 -0.050
| 1: -10.000 2.000 -5.550
| ...
After the vertex information, comes the polygonal information. Each object may be made up of either triangles or quads.
The appropriate header and number of polygons defined are listed, TRIANGLES for triangles and QUADS for quadrilaterals.
The polygons are described with a number starting at 0, then the vertex number for each end point is given (3 for triangles and 4 for quadrilaterals). Then a color is given to each polygon (0 to 255). Finally comes the shading used for each polygon.
Note that in order to use a texture for a polygon, you must set its shading to TEXTURE.
[Here is a list and quick explanation of each of the shading types:
| FLAT | Normal, flat surface |
| GOURAUD | Gouraud shading on surface |
| VERTEX | Display only vertexes of polygon (like Death Star holo) |
| TEXTURE | filled with a texture |
| GOURTEX | filled with a texture, plus gouraud shading on the texture |
| PLANE | texture on a horizontal plane (acts same as floor and ceiling textures -- must be 64*64, affected by flr and ceil txoffsets, and scrolled by elevators scroll_floor and scroll_ceiling) |
- Jereth]
| TRIANGLES 12
| # Num V1 V2 V3 Color Shading
| 0: 1 2 3 0 PLANE
| 1: 0 1 3 0 PLANE
| 2: 5 1 0 62 FLAT
| ...
Also note that the vertices are listed in clockwise order if you are facing directly at the polygon.
[This simplifies hidden lines/surfaces algorithm, as you may determine the facet orientation with 3 of them [Yves]]
[end of Michael's section]
Here is a description of TEXTURE VERTICES and TEXTURE QUADS/TRIANGLES, which Michael didn't fully cover.
If textures are used (TEXTURE, GOURTEX or PLANE shading), then texture vertices and texture triangles/quads also needed to be defined.
TEXTURE VERTICES:
These are a set of points defined on an X-Y plane, where X and Y coordinate values are >=0 and <= 1. These points define relative positions on the texture being used for the current object, eg. for a 16 x 8 texture, the following TEXTURE VERTICE...
| #num:<x><y>
|0:0.50.25
....defines a point on the texture at (8, 2) in geometry units, or (64, 8) in pixels.
TEXTURE QUADS / TEXTURE TRIANGLES:
These link texture vertices into a 3 or 4 sided polygon, hence deciding which portion of the texture is to be placed on the polygon.
For example, if you have an 16 x 8 texture, and the following 4 TEXTURE VERTICES:
| 0:0.000.00
| 1:0.000.50
| 2:1.000.50
| 3:1.000.00
and the following TEXTURE QUAD:
| 0:0123
....the bottom half of the texture will be placed onto QUAD 0 of the object (i.e. up to an X value of 16, but only up to a Y value of 4) with the first vertice of the TEXTURE QUAD being placed on the first vertice of the QUAD, the second vertice on the second, and so on. So you can also orientate the portion of texture on the polygon any way you want by keeping the TEXTURE VERTICES pointed to in the same order, but varying the starting vertice, flip it by reversing the order of TEXTURE VERTICES pointed to, or even deform the texture by varying the order of the TEXTURE VERTICES pointed to.
| 1: 2 1 0 3
In this example, the texture will be flipped horizontally, and be on its side relative to TEXTURE QUAD 0 (the first example).
Of course, this section of the texture will need to be scaled to cover the whole polygon, so if the polygon is, say, a 64 by 32 rectangular QUAD, the texture will be expanded by a factor of 4 for the above example. If the polygon doesn't have dimensions of the same ratio as the portion of texture, the texture portion will be warped, eg. if the polygon for the above example is shaped like a regular trapezium, the top part of the texture will be squashed and the bottom part stretched.
It is okay to point to the same texture vertices over and over again if you for example want to put the same section of a texture on more than one polygon in the object.
Note: TEXTURE VERTICES and TEXTURE QUADS / TRIANGLES are also needed for PLANE fill, although you can't decide what part of a texture is to be placed on a PLANE polygon. Hence the TEXTURE VERTICES pointed to by the TEXTURE QUAD / TRIANGLE are unused.
TEXTURE QUADS / TRIANGLES correspond with the polygons (having TEXTURE, GOURTEX or PLANE fill) that they are linked to. So if QUAD 0 and 2 of an object have a texture fill, but QUAD 1 is just gouraud or flat or otherwise, then TEXTURE QUAD 0 and 2 will be used, but TEXTURE QUAD 1 must also be defined even though it isn't used. So to be economical, you should have all polygons filled with a texture defined first within each object of the 3DO file.


Your Local Movie Theater
Which movie would you like to see:
The Matrix
Willy Wonka And the Chocolate Factory
Event Horizon
Mortal Kombat
Soldier
Shoot Em Up
Showtimes:
11AM
1:30PM
3:30PM
5PM
7PM
9PM
11PM
Child, Adult or Senior:
Child
Adult
Senior
Submit
Your Ticket price is:
and your showtime is


#include <synch.h>
Public Member Functions | |
| Condition (char *debugName) | |
| ~Condition () | |
| char * | GetName () |
| void | Wait () |
| void | Signal () |
| void | Broadcast () |
Public Attributes | |
| ObjectTypeId | typeId |
Private Attributes | |
| char * | name |
| Listint * | waitQueue |
| Lock * | conditionLock |
A condition variable does not have a value, but threads may be queued, waiting on the variable. These are only operations on a condition variable:
Wait() -- release the lock, relinquish the CPU until signaled, then re-acquire the lock
Signal() -- wake up a thread, if there are any waiting on the condition
Broadcast() -- wake up all threads waiting on the condition
All operations on a condition variable must be made while the current thread has acquired a lock. Indeed, all accesses to a given condition variable must be protected by the same lock. In other words, mutual exclusion must be enforced among threads calling the condition variable operations.
In Nachos, condition variables are assumed to obey *Mesa*-style semantics. When a Signal or Broadcast wakes up another thread, it simply puts the thread on the ready list, and it is the responsibility of the woken thread to re-acquire the lock (this re-acquire is taken care of within Wait()). By contrast, some define condition variables according to *Hoare*-style semantics -- where the signalling thread gives up control over the lock and the CPU to the woken thread, which runs immediately and gives back control over the lock to the signaller when the woken thread leaves the critical section.
The consequence of using Mesa-style semantics is that some other thread can acquire the lock, and change data structures, before the woken thread gets a chance to run.
|
|
Create a condition and initialize it to "no one waiting". Initializes a Condition, so that it can be used for synchronization.
|
|
|
Deallocate the condition. De-allocate condition, when no longer needed. |
|
|
Condition::Broadcast wake up all threads waiting in the waitqueue of the condition and put them on the queue of the lock conditionLock must be held by the currentThread. This operation must be atomic, so we need to disable interrupts.
|
|
|
For debugging.
|
|
|
Wake up a thread if there are any waiting in the waitqueue of the condition and put it on the queue of the condition conditionLock must be held by the currentThread. This operation must be atomic, so we need to disable interrupts.
|
|
|
Releases the lock and make the thread waiting in the waitqueue. This operation must be atomic, so we need to disable interrupts.
|
|
|
|
|
|
for debbuging
|
|
|
signature to make sure the condition is in the correct state
|
|
|
threads asked to wait
|


Resets built-in toolbars to the default Microsoft Excel set.
Syntax
RESET.TOOLBAR(bar_id)
Bar_id specifies the number or name of the toolbar that you want to reset. For detailed information about bar_id, see ADD.TOOL.
Remarks
If RESET.TOOLBAR successfully resets the toolbar, it returns TRUE. If you try to reset a custom toolbar, RESET.TOOLBAR returns #VALUE! and takes no other action.
Related Functions
ADD.TOOL Adds one or more tools to a toolbar
DELETE.TOOLBAR Deletes custom toolbars
Return to index


Phat Huynh
About
Experience
Education
Skills
Interests
Projects
Learn
Read some
Latest updated: 6 May 2023
This website host on Firebase


Entering a plain text
To enter a plain text you need to activate the text-typing mode.
The color of the blinking cursor indicates what typing mode is currently active:
- Blue cursor - the math-typing mode is active
- Green cursor - the text-typing mode is active
Alternative ways to start plain text entry
- while a box is still entirely empty you can use the spacebar key (in addition to Alt+spacebar) to toggle the typing mode
- you can mouse-click at the sigma sign in the text-control box to switch into text-typing mode (the text-control box will change its color to green)
- instead of using single mouse click to start a box, you can double-click to start a box that already has the text typing mode activated
- you can define a text guideline - by clicking on it, the new box is started and will have the text typing mode activated
- you can just start typing plain text even if the math-typing mode is still active - after several keystrokes Math-o-mir will revert into text-typing mode (this only works if your text entry started from an empty box, if your typing speed is sufficient and if you don't use some math operators)


Moossical 0.0.3
A simple and creative multiplayer online music game
The canonical example for
Moosse
Repo
|
Play Online


|
Bullet Collision Detection & Physics Library
|
#include <btSoftBodyInternals.h>
Public Member Functions | |
| void | Process (const btDbvtNode *la, const btDbvtNode *lb) |
| void | ProcessSoftSoft (btSoftBody *psa, btSoftBody *psb) |
| Public Member Functions inherited from btSoftColliders::ClusterBase | |
| ClusterBase () | |
| bool | SolveContact (const btGjkEpaSolver2::sResults &res, btSoftBody::Body ba, const btSoftBody::Body bb, btSoftBody::CJoint &joint) |
| Public Member Functions inherited from btDbvt::ICollide | |
| DBVT_VIRTUAL void | Process (const btDbvtNode *, const btDbvtNode *) |
| DBVT_VIRTUAL void | Process (const btDbvtNode *) |
| DBVT_VIRTUAL void | Process (const btDbvtNode *n, btScalar) |
| DBVT_VIRTUAL bool | Descent (const btDbvtNode *) |
| DBVT_VIRTUAL bool | AllLeaves (const btDbvtNode *) |
Public Attributes | |
| btSoftBody * | bodies [2] |
| Public Attributes inherited from btSoftColliders::ClusterBase | |
| btScalar | erp |
| btScalar | idt |
| btScalar | m_margin |
| btScalar | friction |
| btScalar | threshold |
Definition at line 805 of file btSoftBodyInternals.h.
|
inline |
Definition at line 808 of file btSoftBodyInternals.h.
|
inline |
Definition at line 846 of file btSoftBodyInternals.h.
| btSoftBody* btSoftColliders::CollideCL_SS::bodies[2] |
Definition at line 807 of file btSoftBodyInternals.h.


Let's play a game
Just some of the horrors of frameworks
A set of architectural patterns for building distributed systems
We can do better
Some examples may contain traces of Spring.
If you're allergic, please close your eyes.
vs
@Configuration class MyConfig {
@Bean DataSource dataSource(){
//some side-effecty things allocating some DB connection pool
}
@Bean UserRepository userRepository(DataSource dataSource) {
return new UserRepositoryImpl(dataSource);
}
}
vs
fs2.co
NPE when called
Lack of side effects
Lack of referential transparency
for any expression `a`
given `x = a`
All occurrences of `x` in a program `p` can be replaced with `a`
//Example
val prog1 = (x, x)
val prog2 = (a, a)
//both sides equivalent
prog1 <-> prog2
Manages resource acquisition and cleanup
Acquiring lock1
Acquiring file reader: .gitignore
Acquiring lock2
Finished reading lines
Releasing lock2
Releasing file reader: .gitignore
Releasing lock1
.idea/
*.iml
*.iws
*.eml
out/
type HttpRoutes = Request => Response
type HttpRoutes = Request => IO[Response]
type HttpRoutes = Request => IO[Option[Response]]
type HttpRoutes = Request[IO] => IO[Option[Response[IO]]]
//Kleisli[F[_], A, B] ~= A => F[B]
//OptionT[F, A] ~= F[Option[A]]
type HttpRoutes =
Kleisli[OptionT[IO, ?], Request[IO], Response[IO]]
type HttpRoutes[F[_]] =
Kleisli[OptionT[F, ?], Request[F], Response[F]]
If a route is just a function
...then we can modify its input and output
Example: Response timing
Built-in server middleware (0.20.0-M5)
What about clients?
Just another function
Built-in client middleware (0.20.0-M5)
Creating clients from routes - trivial server stubbing
Calling endpoint in test = calling a function
case class Country(name: String, capital: String)
def countryById(id: CountryId): IO[Option[Country]] =
sql"""select c.name, c.capital
from countries
where c.id = $id"""
.query[Country]
.option
.transact(transactor)
Transactor
Query
def countryById(id: CountryId): Query0[Country] =
sql"""select c.name, c.capital
from countries
where c.id = $id""".query[Country]
val countries: Query0[Country] =
sql"select c.name, c.capital from countries"
.query[Country]
val country1: ConnectionIO[Option[Country]] =
countryById(CountryId(1L)).option
val countriesStream: Stream[ConnectionIO, Country] =
countries.stream
ConnectionIO -> IO
transactor.use { xa =>
country1
.transact(xa)
.flatMap(putStrLn(_)) // Some(Country(...))
}
End-to-end streaming with http4s
Query typechecking
class AnalysisTestScalaCheck extends FunSuite with Matchers with IOChecker {
val transactor = Transactor.fromDriverManager[IO](
"org.postgresql.Driver", "jdbc:postgresql:world", "postgres", ""
)
test("countryById") { check(countryById(CountryId(1L))) }
test("countries") { check(countries) }
}
Slides: https://git.io/fhsW5
Code: https://git.io/fhoVH
Get in touch
(Read my blog! blog.kubukoz.com)


pip_services3_components library Null safety
Classes
- CachedCounters
- Abstract implementation of performance counters that measures and stores counters in memory. Child classes implement saving of the counters into various destinations. [...]
- CachedLogger
- Abstract logger that caches captured log messages in memory and periodically dumps them. Child classes implement saving cached messages to their specified destinations. [...]
- CachedTracer
- Abstract tracer that caches recorded traces in memory and periodically dumps them. Child classes implement saving cached traces to their specified destinations. [...]
- CacheEntry
- Data object to store cached values with their keys used by MemoryCache
- Component
- Abstract component that supportes configurable dependencies, logging and performance counters. [...]
- CompositeConnectionResolver
- Helper class that resolves connection and credential parameters, validates them and generates connection options. [...]
- CompositeCounters
- Aggregates all counters from component references under a single component. [...]
- CompositeFactory
- Aggregates multiple factories into a single factory component. When a new component is requested, it iterates through factories to locate the one able to create the requested component. [...]
- CompositeLogger
- Aggregates all loggers from component references under a single component. [...]
- CompositeTracer
- Aggregates all tracers from component references under a single component. [...]
- ConfigReader
- Abstract config reader that supports configuration parameterization. [...]
- ConnectionParams
- Contains connection parameters to connect to external services. They are used together with credential parameters, but usually stored separately from more protected sensitive values. [...]
- ConnectionResolver
- Helper class to retrieve component connections. [...]
- ConnectionUtils
- A set of utility functions to process connection parameters
- ConsoleLogger
- Logger that writes log messages to console. [...]
- ContextInfo
- Context information component that provides detail information about execution context: container or/and process. [...]
- Counter
- Data object to store measurement for a performance counter. This object is used by CachedCounters to store counters.
- CounterTiming
- Callback object returned by {@link ICounters.beginTiming} to end timing of execution block and update the associated counter. [...]
- CredentialParams
- Contains credentials to authenticate against external services. They are used together with connection parameters, but usually stored in a separate store, protected from unauthorized access. [...]
- CredentialResolver
- Helper class to retrieve component credentials. [...]
- DefaultCacheFactory
- Creates ICache components by their descriptors. [...]
- DefaultConfigReaderFactory
- Creates IConfigReader components by their descriptors. [...]
- DefaultCountersFactory
- Creates ICounters components by their descriptors. [...]
- DefaultCredentialStoreFactory
- Creates ICredentialStore components by their descriptors. [...]
- DefaultDiscoveryFactory
- Creates IDiscovery components by their descriptors. [...]
- DefaultInfoFactory
- Creates information components by their descriptors. [...]
- DefaultLockFactory
- Creates ILock components by their descriptors. [...]
- DefaultLoggerFactory
- Creates ILogger components by their descriptors. [...]
- DefaultStateStoreFactory
- Creates IStateStore components by their descriptors. [...]
- DefaultTestFactory
- Creates test components by their descriptors. [...]
- DiscoveryItem
- Used to store key-identifiable information about connections.
- Factory
- Basic component factory that creates components using registered types and factory functions. [...]
- FileConfigReader
- Abstract config reader that reads configuration from a file. Child classes add support for config files in their specific format like JSON, YAML or property files. [...]
- ICache
- Interface for caches that are used to cache values to improve performance.
- IConfigReader
- Interface for configuration readers that retrieve configuration from various sources and make it available for other components. [...]
- ICounters
- Interface for performance counters that measure execution metrics. [...]
- ICounterTimingCallback
- Interface for a callback to end measurement of execution elapsed time. [...]
- ICredentialStore
- Interface for credential stores which are used to store and lookup credentials to authenticate against external services. [...]
- IDiscovery
- Interface for discovery services which are used to store and resolve connection parameters to connect to external services. [...]
- IFactory
- Interface for component factories. [...]
- ILock
- Interface for locks to synchronize work or parallel processes and to prevent collisions. [...]
- ILogger
- Todo: solve issue with overloaded methods. Look at Python implementation Interface for logger components that capture execution log messages.
- IStateStore
- Interface for state storages that are used to store and retrieve transaction states.
- ITracer
- Interface for tracer components that capture operation traces.
- JsonConfigReader
- Config reader that reads configuration from JSON file. [...]
- Lock
- Abstract lock that implements default lock acquisition routine. [...]
- LogCounters
- Performance counters that periodically dumps counters measurements to logger. [...]
- Logger
- Abstract logger that captures and formats log messages. Child classes take the captured messages and write them to their specific destinations. [...]
- LogLevelConverter
- Helper class to convert log level values. [...]
- LogMessage
- Data object to store captured log messages. This object is used by CachedLogger.
- LogTracer
- MemoryCache
- Cache that stores values in the process memory. [...]
- MemoryConfigReader
- Config reader that stores configuration in memory. [...]
- MemoryCredentialStore
- Credential store that keeps credentials in memory. [...]
- MemoryDiscovery
- Discovery service that keeps connections in memory. [...]
- MemoryLock
- Lock that is used to synchronize execution within one process using shared memory. [...]
- MemoryStateStore
- State store that keeps states in the process memory. [...]
- NullCache
- Dummy cache implementation that doesn't do anything. [...]
- NullCounters
- Dummy implementation of performance counters that doesn't do anything. [...]
- NullLock
- Dummy lock implementation that doesn't do anything. [...]
- NullLogger
- Dummy implementation of logger that doesn't do anything. [...]
- NullStateStore
- Dummy state store implementation that doesn't do anything. [...]
- NullTracer
- OperationTrace
- Registration
- Shutdown
- Random shutdown component that crashes the process using various methods. [...]
- StateEntry
- Data object to store state values with their keys used by MemoryStateStore
-
StateValue<
T> - A data object that holds a retrieved state value with its key.
- TraceTiming
- Timing object returned by ITracer.beginTrace to end timing of execution block and record the associated trace. [...]
- YamlConfigReader
- Config reader that reads configuration from YAML file. [...]
Enums
- CounterType
- Types of counters that measure different types of metrics
- LogLevel
- Standard log levels. [...]
Exceptions / Errors
- CreateException
- Error raised when factory is not able to create requested component. [...]


Streaming queries
The following findEach, findIterate,
and findStream are all streaming queries with mainly a
difference in terms of style using a closure, iterator or stream.
With these streaming queries we can process very large results without having to hold
all results in memory.
findEach would be the recommended style as it ensures all the resources
held by the query are closed without necessitating a try with resources block. Using
findStream and findIterate are equally fine with the note that we
need to ensure the QueryIterator and Stream are closed typically via try with resources
.
From Ebean version 12.3.5 these streaming queries use an "adaptive persistence context". This means that findEach, findIterate, and findStream will work equally as well against small query results as findList. After 1000 beans are processed the queries adapt the persistence context they use to ensure it does not hold all the beans (and run out of memory when processing very large results).
Queries processing less than 1000 beans use a single normal persistence context. After 1000 beans the persistence context adapts such that it does not hold all the beans.
findEach
Execute the query processing the result one bean at a time.
new QCustomer()
.status.equalTo(Status.NEW)
.order().id.asc()
.findEach((Customer customer) -> {
// do something with customer
System.out.println("-- visit " + customer);
});
findEachWhile
Like findEach but takes a predicate that allows us to stop processing the result early.
// Returning false inside the predicate will stop the execution
new QCustomer()
.status.equalTo(Status.NEW)
.order().id.asc()
.findEachWhile((Customer customer) -> {
// do something with customer
...
// return true to continue processing or false to stop
return (customer.getId() < 40);
});
findEach with batch consumer
Similar to findEach but batches the beans up so that they can be processed in batches - for example process in batches of 100 at a time.
new QCustomer()
.status.equalTo(Status.NEW)
.order().id.asc()
.findEach(100, batch -> {
// process the customers in batches of 100 at a time
// where batch is List<Customer>
...
});
findStream
Execute the query processing the result as a stream.
Use a try with resources
block to ensure the resources held by the stream are closed.
try (Stream<Customer> stream =
new QCustomer()
.status.equalTo(Status.NEW)
.order().id.asc()
.findStream()) {
stream
.filter(...)
.map(..)
.collect(...);
}
findIterate
Execute the query processing the result as a QueryIterator.
Use a try with resources
block to ensure the resources held by the iterator are closed.
try (QueryIterator<Customer> it =
new QCustomer()
.status.equalTo(Status.NEW)
.order().id.asc()
.findIterate()) {
while (it.hasNext()) {
Customer customer = it.next();
...
}
}


We are more than just real estate investors, who are looking to unite people with good homes. We offer properties for sale or rent, which our clients are excited to make into happy homes. On the other hand, we also offer a quick-sale option to the regular homeowner, and hassle-free solutions to challenged and distressed homeowners wanting to quickly sell their houses …
Read MoreWhether your house is immaculate or needs work, whatever state it is in, we will buy it in its current condition cash. No need to spend money and waste time, giving it a face-lift for the sale. We take the hassle out of our transactions for people who are selling their homes.
We buy any and all types of residential properties, from small apartment blocks, duplexes, triplexes, fourplexes to single family homes. We can close quickly or on any date that best suite you need.
Read More


web and graphic designer
24 year old swedish born nigerian, living in houston, texas.
currently studying software engineering at the university of texas at arlington.
also learning other technologies like javascript, java etc.
i love being
creative and pushing limits.
hardworking and willing to learn from others.
"the mind is a terrible thing to waste"