Technical Inventory
Backend
Java
Java is a general-purpose computer-programming language that is concurrent, class-based, object-oriented, and specifically designed to have as few implementation dependencies as possible. It is intended to let application developers "write once, run anywhere" (WORA), meaning that compiled Java code can run on all platforms that support Java without the need for recompilation. Java applications are typically compiled to bytecode that can run on any Java virtual machine (JVM) regardless of computer architecture. Source
Download Latest Java Version Here
TopPHP
PHP is the primary language currently is use in my current position.
From W3 Schools, PHP is a server scripting language, and a powerful tool for making dynamic and
interactive Web pages, is a widely-used, free, and efficient alternative to competitors such as
Microsoft's ASP. Source
As of 11/3/2020, PHP 7.4.12 is the latest stable release with PHP 8 currently in its 10th testing
phase as of 10/29/2020. PHP 8 Info
Download Latest PHP Version Here
TopPostgreSQL
From PostgreSQL, PostgreSQL is a powerful, open source object-relational database system with over 30 years of active development that has earned it a strong reputation for reliability, feature robustness, and performance. Source
As of 2/10/2022, PostgreSQL 14.2 is the latest stable release. PostgreSQL 14.2
Gradle
Directly from Gradle, Gradle is an open-source build automation tool that is designed to be flexible enough to build almost any type of software. The following is a high-level overview of some of its most important features: High Performance, JVM Foundation, Conventions, Extensibility, IDE Support, and Insight. Source
As of 2/8/2022, Gradle 7.4 is the latest stable release Gradle 7.4 Info
Maven
Directly from Maven, Maven, a Yiddish word meaning accumulator of knowledge, began as an attempt to simplify the build processes in the Jakarta Turbine project. There were several projects, each with their own Ant build files, that were all slightly different. JARs were checked into CVS. We wanted a standard way to build the projects, a clear definition of what the project consisted of, an easy way to publish project information, and a way to share JARs across several projects. Source
The result is a tool that can now be used for building and managing any Java-based project. We hope that we have created something that will make the day-to-day work of Java developers easier and generally help with the comprehension of any Java-based project.
As of 11/14/2021, Maven 3.8.4 is the latest stable release Maven 3.8.4 Info
Test Driven Development - TDD
1. You are not allowed to write any production code unless it is to make a failing unit test pass.
2. You are not allowed to write any more of a unit test than is sufficient to fail; and compilation failures are failures.
3. You are not allowed to write any more production code than is sufficient to pass the one failing unit test.
You must begin by writing a unit test for the functionality that you intend to write. But by rule 2, you can't write very much of that unit test. As soon as the unit test code fails to compile, or fails an assertion, you must stop and write production code. But by rule 3 you can only write the production code that makes the test compile or pass, and no more. Source
TopObject Oriented Programming - OOP
Object-oriented programming (OOP) is a programming paradigm based on the concept of "objects", which may contain data, in the form of fields, often known as attributes; and code, in the form of procedures, often known as methods. A feature of objects is that an object's procedures can access and often modify the data fields of the object with which they are associated (objects have a notion of "this" or "self"). In OOP, computer programs are designed by making them out of objects that interact with one another. There is significant diversity of OOP languages, but the most popular ones are class-based, meaning that objects are instances of classes, which typically also determine their type. Source
TopStructured Query Language - SQL
Is a domain-specific language used in programming and designed for managing data held in a relational database management system (RDBMS), or for stream processing in a relational data stream management system (RDSMS). In comparison to older read/write APIs like ISAM or VSAM, SQL offers two main advantages:
First, it introduced the concept of accessing many records with one single command.
Second, it eliminates the need to specify how to reach a record, e.g. with or without an index.
Source TopFrameworks
Spring MVC
The Spring Web model-view-controller (MVC) framework is designed around a DispatcherServlet that dispatches requests to handlers, with configurable handler mappings, view resolution, locale and theme resolution as well as support for uploading files.
The default handler is based on the @Controller and @RequestMapping annotations, offering a wide range of flexible handling methods. With the introduction of Spring 3.0, the @Controller mechanism also allows you to create RESTful Web sites and applications, through the @PathVariable annotation and other features.
TopHibernate JPA
The Java Persistence API (JPA) is a Java specification for accessing, persisting, and managing data between Java objects / classes and a relational database. JPA was defined as part of the EJB 3.0 specification as a replacement for the EJB 2 CMP Entity Beans specification. JPA is now considered the standard industry approach for Object to Relational Mapping (ORM) in the Java Industry. Source
TopLaravel
The Laravel framework for PHP is one of thee most popular frameworks to which there is even a
certification in Laravel by Laravel which proves to Companies that a Developer who holds a Laravel
Certification knows their framework and is proof of their credibility.
Per Laravel, "Laravel is a web application framework with expressive, elegant syntax. We’ve already
laid the foundation — freeing you to create without sweating the small things." Source
CodeIgniter
CodeIgniter is one of many PHP Frameworks and is so powerful that it leaves a tiny foot print, for those
who needs a toolkit designed for its simplicity and elegance to create full featured web apps.
Frontend
HTML5
HTML5 is a markup language used for structuring and presenting content on the World Wide Web. It is the fifth and current major version of the HTML standard. It was published in October 2014 by the World Wide Web Consortium (W3C) to improve the language with support for the latest multimedia, while keeping it both easily readable by humans and consistently understood by computers and devices such as web browsers, parsers, etc. HTML5 is intended to subsume not only HTML 4, but also XHTML 1 and DOM Level 2 HTML.
HTML5 includes detailed processing models to encourage more interoperable implementations; it extends, improves and rationalizes the markup available for documents, and introduces markup and application programming interfaces (APIs) for complex web applications. For the same reasons, HTML5 is also a candidate for cross-platform mobile applications, because it includes features designed with low-powered devices in mind. Source
TopCSS3
CSS3 is the latest evolution of the Cascading Style Sheets language and aims at extending CSS2.1. It brings a lot of long-awaited novelties, like rounded corners, shadows, gradients, transitions or animations, as well as new layouts like multi-columns, flexible box or grid layouts. Source
Practice CSS Grid with Grid Garden
Practice CSS Flexbox by killing Zombies
TopJavaScript (ES6)
JavaScript (JS) is a programming language mostly used to dynamically script webpages on the client side, but it is also often utilized on the server-side, using packages such as Node.js.
JavaScript should not be confused with the Java programming language. Both "Java" and "JavaScript" are trademarks or registered trademarks of Oracle in the U.S. and other countries. However, the two programming languages are significantly different in their syntax, semantics, and uses. Source
TopjQuery
jQuery is a fast, small, and feature-rich JavaScript library. It makes things like HTML document traversal and manipulation, event handling, animation, and Ajax much simpler with an easy-to-use API that works across a multitude of browsers. With a combination of versatility and extensibility, jQuery has changed the way that millions of people write JavaScript. Source
Download jQuery Here
TopAjax
AJAX stands for Asynchronous JavaScript And XML. In a nutshell, it is the use of the XMLHttpRequest object to communicate with servers. It can send and receive information in various formats, including JSON, XML, HTML, and text files. AJAX’s most appealing characteristic is its "asynchronous" nature, which means it can communicate with the server, exchange data, and update the page without having to refresh the page.
The two major features of AJAX allow you to do the following:
1. Make requests to the server without reloading the page.
2. Receive and work with data from the server
TopThymeleaf
From Thymeleaf, Thymeleaf is a modern server-side Java template engine for both web and standalone environments. Source
Thymeleaf's main goal is to bring elegant natural templates to your development workflow — HTML that can be correctly displayed in browsers and also work as static prototypes, allowing for stronger collaboration in development teams.
With modules for Spring Framework, a host of integrations with your favourite tools, and the ability to plug in your own functionality, Thymeleaf is ideal for modern-day HTML5 JVM web development — although there is much more it can do.
As of 1/31/2022, Latest version is 3.0.15 and is available Source
TopTools
Eclipse IDE
Eclipse is an integrated development environment (IDE) used in computer programming, and is the most widely used Java IDE. It contains a base workspace and an extensible plug-in system for customizing the environment. Eclipse is written mostly in Java and its primary use is for developing Java applications, but it may also be used to develop applications in other programming languages via plug-ins. Source
Download Eclipse IDE Here
TopIntelliJ IDEA
Per Jet Brains, Every aspect of IntelliJ IDEA has been designed to maximize developer productivity. Together, intelligent coding assistance and ergonomic design make development not only productive but also enjoyable. Source
Download Latest Version of IntelliJ IDEA Here
TopPHP Storm
PHP Storm is my goto IDE for PHP. It handles everything from writing PHP, to the frameworks like Laravel and CodeIgniter. Not only that, I can utilize any revision controls such as GIT or SVN. This little IDE is great for all PHP Programmers out there who is looking for an elegant IDE design and is what I use for work.
Per Jet Brains, PhpStorm is perfect for working with Symfony, Laravel, Drupal, WordPress, Zend Framework, Magento, Joomla!, CakePHP, Yii, and other frameworks. The editor actually 'gets' your code and deeply understands its structure, supporting all the PHP language features for modern and legacy projects. It provides the best code completion, refactorings, on-the-fly error prevention, and more. Source
Download Latest Version of IntelliJ IDEA Here
TopSublime Text 3
Sublime Text is a proprietary cross-platform source code editor with a Python application programming interface (API). It natively supports many programming languages and markup languages, and functions can be added by users with plugins, typically community-built and maintained under free-software licenses. Source
Download Sublime 3 Here
TopNotepad++
Notepad++ is a free (as in “free speech” and also as in “free beer”) source code editor and Notepad replacement that supports several languages. Running in the MS Windows environment, its use is governed by GNU General Public License. Source
As of 2/15/2022, Download the lastest stable release of Notepad++ 8.3.1 Here
TopGit
Git is a free and open source distributed version control system designed to handle everything from small to very large projects with speed and efficiency. Source
Download Git Here (Should be a Pop Up window)
TopSubversion
From Subversion, Subversion is an open-source, centralized version control system. Source
As of 5/27/2020, Subversion 1.14 is the lastest stable release, and can be found Here
Top


Solution to the problem
The database administrator earlier concluded the problem for SQL performance slowdown to be a 'table scan'
as the index was not present on the predicate column.
As a solution to the problem, database administrator creates an index on the column, which is the search predicate
for the query or workload run.
The DDL for the creating the index is present on the right pane. The workload or the query is run again.
Now, with the index in place DB2 picks the index to satisfy the query. With this, the ratio of number of rows read
vs the number of rows returned reduces considerably, improving the performance of the query.


PleaseHoldViewConfig
public class PleaseHoldViewConfig
Configuration for PleaseHoldView
-
Singleton access to
PleaseHoldViewConfig
.Declaration
Swift
public static var shared: PleaseHoldViewConfig
-
Initialize new instance of
PleaseHoldViewConfig
Declaration
Swift
public init()
-
Customize the title
UILabel
ofPleaseHoldView
. Called when adding a title toPleaseHoldView
instances.Declaration
Swift
public var newTitleLabel: () -> UILabel
-
The default title label for
PleaseHoldView
.Declaration
Swift
public static var defaultTitleLabel: UILabel { get }
-
Customize the message
UILabel
ofPleaseHoldViewConfig
. Called when adding a message toPleaseHoldViewConfig
instances.Declaration
Swift
public var newMessageLabel: () -> UILabel
-
The default message label for
PleaseHoldView
.Declaration
Swift
public static var defaultMessageLabel: UILabel { get }
-
Customize the message
UILabel
ofPleaseHoldViewConfig
. Called when adding a message toPleaseHoldViewConfig
instances.Declaration
Swift
public var newActivityIndicator: () -> UIActivityIndicatorView
-
Edit the
UIActivityIndicatorView
used as the activity indicator forPleaseHoldView
Declaration
Swift
public static var defaultActivityIndicator: UIActivityIndicatorView { get }
-
Set the padding for the leading and trailing side of the contents of
PleaseHoldView
.Declaration
Swift
public var viewPadding: CGFloat
-
Convenient access to
DarkPleaseHoldViewConfigPreset
.Declaration
Swift
static let darkPresent: PleaseHoldViewConfigPreset
-
Convenient access to
LightPleaseHoldViewConfigPreset
.Declaration
Swift
static let light: PleaseHoldViewConfigPreset


Main page
Sales page
Cookie shops
The location:
Maximum customers per hour:
Minimum customers per hour:
Average cookies per customers:
SUBMIT
These are our customers
This is my cutter
This is our shirt
This is our frosted cookie


Web Dev
Basic Front-end Development (HTML, CSS, and JS).
Basic Front-end Development (HTML, CSS, and JS) .
Coding
Being coding in C, C++ using the concepts of OOPM and Machine Learning. Along with that learning C#
Been coding in C, C++ using the concepts of OOPM and Machine Learning. Along with that learning C#
UI/UX
User Interaction and Experience Designing in Figma.
User Interaction and Experience Designing in Figma.
Public Speaking
Public Speaking skills are quite decent. I am able to interact with people easly and i'm coordinator of orators club in doconation.
Public Speaking skills are quite decent. I am able to interact with people easly and i'm coordinator of orators club in doconation.


Matthew Sembinelli is a selfproclaimed tinkerer and technology buff. His interest in computers started at 13 years of age and it quickly turned into a career path. Matthew has strong interests in embedded systems, digital logic, and programming. He is currently employed in the low power wireless industry, focusing on 2.4GHz radio stack development. Matt is proficient in several programming languages, including C/C++, Python, Java, HTML/CSS, and Javascript. Matthew can sometimes be found performing PC overclocking experiments with liquid nitrogen and dry ice.


|
VirtualSCADA
1.0
VirtualSCADA Senior Design Project
|
Public Member Functions | |
| setParam ($id, $value) | |
| getParam ($id, $default=null) | |
| set ($id, $value) | |
| setShared ($id, $callable) | |
| get ($id) | |
| isDefined ($id) | |
| getByPrefix ($prefix) | |
| remove ($id) | |
| addConfigurator ($configurator) | |
| configure () | |
The Service Container is a lightweight container based on Pimple to handle object creation of PhpSpec services.
Definition at line 22 of file ServiceContainer.php.
| addConfigurator | ( | $configurator | ) |
Adds a configurator, that can configure many services in one callable
| callable | $configurator |
Definition at line 206 of file ServiceContainer.php.
| configure | ( | ) |
Loop through all configurators and invoke them
Definition at line 220 of file ServiceContainer.php.
| get | ( | $id | ) |
Retrieves a service from the container
| string | $id |
Definition at line 134 of file ServiceContainer.php.
| getByPrefix | ( | $prefix | ) |
Retrieves a list of services of a given prefix
| string | $prefix |
Definition at line 164 of file ServiceContainer.php.
| getParam | ( | $id, | |
$default = null |
|||
| ) |
Gets a param from the container or a default value.
| string | $id | |
| mixed | $default |
Definition at line 63 of file ServiceContainer.php.
| isDefined | ( | $id | ) |
| remove | ( | $id | ) |
Removes a service from the container
| string | $id |
Definition at line 185 of file ServiceContainer.php.
| set | ( | $id, | |
| $value | |||
| ) |
Sets a object or a callable for the object creation. A callable will be invoked every time get is called.
| string | $id | |
| object | callable | $value |
Definition at line 77 of file ServiceContainer.php.
| setParam | ( | $id, | |
| $value | |||
| ) |
Sets a param in the container
| string | $id | |
| mixed | $value |
Definition at line 50 of file ServiceContainer.php.
| setShared | ( | $id, | |
| $callable | |||
| ) |
Sets a callable for the object creation. The same object will be returned every time
| string | $id | |
| callable | $callable |
Definition at line 106 of file ServiceContainer.php.


This package contains code used in the build process. None of the code here should be included with a disc runtime.


Night Stories-New Orleans is an old school RPG based on pen n' paper games. The outcome of the story is affected by the
decisions of the player and uses a ten-sided dice system.
RULES
The game begins by creating your character. You have to assign points to attributes and skills which will affect
your chances of succeeding or failing when the dice are rolled. The numbers 7, 8, 9 & 10 indicate success.
The number 10 re-rolls the specific dice. For a scene to be successful you may need more than one successful dice,
taking into consideration the difficulty level of the scene, which is not visible to you. The number of dice comes from
the summary of the specific attributes and skills depending on the scene
For Example: Your character tries to shoot a target. If you have assigned 3 points to physical attribute and you have
chosen the pistol skill, you have a total of 4 dice to roll. Assuming you have rolled 2, 8, 5, 10, you have two successes
and number 10 is re-rolled, giving you a 9. You have three successes, totally. The difficulty level of the scene is two.

When the summary of the attribute and skill needed on a scene is zero then the difficulty of this scene is increased dramatically.
The player is able to roll only one die but the rules applied are the same as explained above.
Developing: Γιωργος Μιχάλαινας - Στέργιος Παππάς.
Artwork: Σταυρος Τακτικός.
Graphic Design: Μαρία Κορμπίλα.
Special Thanks To:
Starting a new game will reset your progress! Continue anyway?


Renew a tax disc
604
users online now
— about average
665
users online now
12% more than normal
751
users online now
28% more than normal
1094
users online now
70% more than normal
0.75m
renewals per week
32% less than normal
93%
user satisfaction
— about average
54%
digital take-up
14% less than normal
47%
completion rate
— about average
0.9s
page load time
— about average
99%
uptime
— about average
Service is
up
Service is
down
39%
using mobiles/tablets
— about average
0.75m
renewals per week
data is 2 weeks old
0.75m
renewals per week
data is 3 weeks old
95%
user satisfaction
— about average
www.gov.uk/performance


Absa Uganda Digital Branch: All you need to know – Techjaja
by pages/Techjaja/291142381017322Absa Bank Uganda formerly Barclays Banks has today open the bank’s first fully digital branch at Jubilee Insurance Building on Parliamentary Avenue. The new Digital branch will offer customers greater convenience through self-service at automated digital platforms.
To grace the event, the new digital branch was officially opened by Bank of Uganda Executive Director Supervision, Dr. Twinemanzi Tumubweine and Absa Bank Uganda’s Managing Director, Nazim Mahmood.
Speaking at the event, Absa Bank Uganda Managing Director Nazim Mahmood said,
- Advertisement -
“This digital branch will offer a more convenient, secure, personalized and engaging banking experience for our Business banking and Corporate customers. Using self-service terminals, customers can look forward to an even faster and cost-efficient banking experience.”
Representing the Bank of Uganda, Dr. Tumubweine remarked that the banking industry is continuously being disrupted by technology and that Bank of Uganda appreciates the role that digital financial services play the in improving quality of banking services in Uganda.
Absa Uganda digital branch services
- 24/7 self-service terminals for all cash related transactions (withdrawals & deposits) using intelligent ATMs.
- Bulk cash deposits using the self-service bulk cash depositor.
- Utility bill payments.
- Interbank and international funds transfers.
The new digital branch will enable customers to print their own bank statements and transact on their own devices in the established free Wi-Fi zone. In case you need to talk to someone, there will be some customer service agents to help customers do their transactions at the digital branch.
A new Absa chat bot
On top of the new digital branch, Absa bank has also announced a whole new Absa Chatbot. This is basically a customer service solution that gives customers access to 24/7 replies to frequently asked questions via WhatsApp and the Absa website.
For the WhatsApp users, all you need to do is simply save the number +256707433433 as Absa Bot and send a ‘Hello’ message to start chatting. The bank says that this will enable the customers to bank without ever having to leave their favorite messaging app.
- Advertisement -


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface GeometryDescription
Common interface for geometry descriptions (that can be used for building a robot)
| Method Summary | |
|---|---|
GeometryDescription |
copy()
Get a copy of this object (using clone()) |
boolean |
getAccurateCollisionDetection()
Get whether accurate collision detection should be used for this geometry |
java.awt.Color |
getColor()
Get the color of the geometry |
RotationDescription |
getRotation()
|
VectorDescription |
getTranslation()
|
void |
setAccurateCollisionDetection(boolean accurateCD)
|
void |
setColor(java.awt.Color color)
Set the color of the geometry |
| Method Detail |
|---|
void setColor(java.awt.Color color)
color
- the color to assign to the geometryjava.awt.Color getColor()
boolean getAccurateCollisionDetection()
void setAccurateCollisionDetection(boolean accurateCD)
VectorDescription getTranslation()
RotationDescription getRotation()
GeometryDescription copy()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


An interface for interacting with files that ensures encoding is handled in a consistent manner.
# File lib/cane/file.rb, line 25 def case_insensitive_glob(glob) Dir.glob(glob, ::File::FNM_CASEFOLD) end
# File lib/cane/file.rb, line 13 def contents(path) open(path).read end
# File lib/cane/file.rb, line 21 def exists?(path) ::File.exists?(path) end
# File lib/cane/file.rb, line 9 def iterator(path) EncodingAwareIterator.new(open(path).each_line) end
# File lib/cane/file.rb, line 17 def open(path) ::File.open(path, 'r:utf-8') end


Home Publications Blog Projects CV Works
Computer Science
IIT Gandhinagar
Contact<EMAIL_ADDRESS>Linkedin |
Code Chef |
Hackerearth
I'm a student of M.Tech Computer Science& engineering at IIT Gandhinagar. Before joinging IIT Gn, I completed my B.Tech from Jss Academy of Technical Education, Noida. I am currently working under Professor Nipun Batra in the area of machine learning/AI/sensors/IoT for computational sustainability problems.


Why not pack a picnic bag with some of the locally produced foods and enjoy in the nature?
Written by Lina Abrahamsson
Local fish
Fish has always been an important source of food for the Ålanders. Generation after generation of hunters and fishermen have provided for their families. Today fishing isn’t quite as important as it used to be, but the fish that is being offered here is exquisite. Outside of the supermarkets, there’s often local fishermen selling their recent catch, and if you get the chance to try smoked salmon you should absolutely do it. It needs to be said though that the salmon in particular is usually cultured in fish farms and not wild. But if you do eat fish, you should try it together with the famous ”black bread”.
Svartbröd
Svartbröd, ”black bread” in English, is a very typical bread from Åland. And it’s no fuss about the name - the bread is truly is entirely black. This is because of the flour mix which consists of malt, rye flour and graham flour. With only these ingredients it doesn’t sound very tempting, but by adding a good amount of molasses the bread becomes a little sweet and soft in its texture. You typically find this bread on all festive occasions; midsummer, Christmas, birthday celebrations and graduation parties just to name a few. You can eat it solely with butter or have any savory topping of choice.
Ålandspannkaka
This is yet another very traditional dish from Åland, as you might hear in the name. It’s an oven pancake made with either rice grains or semolina, the original recipe might differ depending on who you’re asking. The pancake is made with cardamom and the whole pancake itself is quite sturdy, so you won’t need much more to your afternoon coffee! By tradition, it is always served together with cream of plums, which on Åland is called ”sviskonkräm”, and whipped cream, or ”snömos” as the Ålanders call it, which means snow mash in English.
Locally produced apple juice
One of the most farmed product on the island is apples. You will see lots of apple trees along the way, especially if you’re going to the north east part of the island to Saltvik and Geta. Two farmers have also started producing their very own apple juice, which is highly appreciated among both the Ålanders and tourists alike. To get yourself a taste, you should look out for ”Grannas” or ”Karl-Ers” apple juice in the restaurant or in the supermarket. The taste is rich, sweet, a bit tart but one thing’s for sure - there is not a single trace of concentrate in these juices!
Pub Niska
If you’re looking for a really good pizza, this is the place you should be heading. Originally founded by the Åland-famous chef Michael Björklund, Pub Niska was quickly established as the go-to restaurant for delicious pizza. You find the restaurant in the Sea Quarters, just outside the city center of Mariehamn. For example, their pizzas include ingredients such as goats cheese, cured ham, herb oil, sauces of different kinds and fresh vegetables. The concept has been so successful so Niska has now opened its doors also in Turku, Vaasa and Ekenäs in Finland.
Stallhagen
Stallhagen is Åland’s very own beer brewery. Since it first was founded in 2004 with a tiny assortment, they now have expanded and have over 10 different kinds of beer, with new coming along every now and then. The original and and the honey beer are the two most popular ones, and you’ll most probably find them in any restaurant or café that serves alcoholic beverages. The brewery is also a restaurant and visitors are welcome for both dinner, beer tasting or a guided tour in the manufacturing area.


{% extends "base.html" %} {% block title %} Reset Password {% endblock %} {% block content %}
Your password is now changed.


indexapp package¶
Subpackages¶
Submodules¶
indexapp.admin module¶
indexapp.apps module¶
indexapp.models module¶
-
class
indexapp.models.
FeedNPDateIndex
(id, term, feed, frequency, date)¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
date
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
feed
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
Child.parent
is aForwardManyToOneDescriptor
instance.
-
feed_id
¶
-
frequency
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
get_next_by_date
(*, field=<django.db.models.fields.DateTimeField: date>, is_next=True, **kwargs)¶
-
get_previous_by_date
(*, field=<django.db.models.fields.DateTimeField: date>, is_next=False, **kwargs)¶
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <django.db.models.manager.Manager object>¶
-
term
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
exception
-
class
indexapp.models.
FeedNPIndex
(id, term, feed, frequency, feed_user)¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
feed
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
Child.parent
is aForwardManyToOneDescriptor
instance.
-
feed_id
¶
-
feed_user
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
frequency
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <django.db.models.manager.Manager object>¶
-
term
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
exception
-
class
indexapp.models.
TextExIndex
(id, term, text, count, noun)¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
count
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
noun
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <django.db.models.manager.Manager object>¶
-
term
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
text
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
Child.parent
is aForwardManyToOneDescriptor
instance.
-
text_id
¶
-
exception
-
class
indexapp.models.
TweetExIndex
(id, term, tweet, day, month, year, count, noun)¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
count
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
day
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
month
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
noun
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <django.db.models.manager.Manager object>¶
-
term
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
tweet
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
Child.parent
is aForwardManyToOneDescriptor
instance.
-
tweet_id
¶
-
year
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
exception
-
class
indexapp.models.
TweetIndex
(id, term, tweet, bigram, lemmatized)¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
bigram
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
lemmatized
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <indexapp.models.TweetIndexManager object>¶
-
term
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
tweet
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
Child.parent
is aForwardManyToOneDescriptor
instance.
-
tweet_id
¶
-
exception
-
class
indexapp.models.
TweetIndexManager
(*args, **kwargs)¶ Bases:
django.db.models.manager.Manager
-
for_terms
(terms, users=None)¶
-
-
class
indexapp.models.
TweetNPDateIndex
(id, term, tweet, frequency, date)¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
date
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
frequency
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
get_next_by_date
(*, field=<django.db.models.fields.DateTimeField: date>, is_next=True, **kwargs)¶
-
get_previous_by_date
(*, field=<django.db.models.fields.DateTimeField: date>, is_next=False, **kwargs)¶
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <django.db.models.manager.Manager object>¶
-
term
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
tweet
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
Child.parent
is aForwardManyToOneDescriptor
instance.
-
tweet_id
¶
-
exception
-
class
indexapp.models.
TweetNPIndex
(id, term, tweet, frequency, tweet_user)¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
frequency
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <django.db.models.manager.Manager object>¶
-
term
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
tweet
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
Child.parent
is aForwardManyToOneDescriptor
instance.
-
tweet_id
¶
-
tweet_user
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
exception


- Shadow Quality: Disabled
- Texture Quality: Low
- Windowed or Fullscreen: Window Mode
- General Settings:
- Lock Windows When Pinned: ON
- Small Station Service Buttons: ON
- Route Settings (click on "A" next to "Route"):
- Undocked HUD Settings:
- Blink Cargohold on Update: ON
- Display Module Tooltips: ON
- Display Readout: ON
- Display Readout as Percentage: OFF
- Display Zoom Buttons: OFF


Adapt axes
### Introduction
Herein, we describe how to force different axes to behave dependently of each other. jsGraph gives you the possibility to adapt the value of one axis (in this example, the right one) to another value on another axis (in this example, the left one). For this, the function to employ is Axis.adaptTo, which was introduced in v1.3.12 (and replaces the previous adapt0To
method which is covered and extended in the current adaptTo
method).
The method takes the following syntax:
With the following arguments:
axis
should be an Axis axis instance of the same type (vertical/horizontal) as the same axis. Note that jsGraph doesn’t check that so you could mathematically adapt a y axis to an x axis, but this wouldn’t make too much sensemyValueToAdaptTo
this is the value on the current axis that should be aligned to the other value onmyReferenceValueOnAxisRef
myReferenceValueOnAxisRef
is the value on themyAxisRef
to whichmyValueToAdaptTo
will be aligned to.MinOrMaxPreferred
will define the behavior of the boundaries (see text later)
Let us start with a basic example
Ok so here there’s no adapt. The two axis behave independantly and adapt to their own serie.
Now, let’s force the right axis to align to the left axis. In this example, the value 0
of the right axis will align with -3
on the left axis:
So here you can see that the minimum of the right axis has been preserved (roughly -1). This is because of the MinOrMaxPreferred
which is by default min
. If we set it to max
, a different behavior is observed:
#### Behavior when axes are forced
Here is the rule when a boundary of the axis is forced:
- If no boundary is forced, then
MinOrMaxPreferred
defined which boundary behaves normally (adapts to the serie data). - If only one boundary is forced, then
MinOrMaxPreferred
has no influence. Priority is given to forcing. So ifforceMin
is used andMinOrMaxPreferred
is set tomax
, the minimum of the axis will be chose to behave normally (according to the forced minimum) and the max will adapt. - If two boundaries are forced,
MinOrMaxPreferred
defined which one will be preserved. The other forced boundary will not be effective.
In this example, both boundaries are forced (case 3):
While in the following example, case 2 applies (if one boundary only is forced, then MinOrMaxPreferred
has no influence)


---
layout: page
title: Sphynx
header: SPMD Instruction Cache Research
group: pastprojects
author_ids: [abagaria, fhannan, pjolly, dhpark, estorm, jspjut]
---
{% include JB/setup %}
The Sphynx project is an investigation of instruction cache design
with respect to the growing number of parallel single program
applications in the world.
When a single application is executed by a number of independent
threads, the instruction cache can be reasonably shared.
In this project, we examine the performance characteristics of a
variety of such applications and vary the cache configuration to see
which design is optimal.
Publication
- Dong-hyeon Park, Akhil Bagaria, Fabiha Hannan, Eric Storm, Josef Spjut;
Sphynx: A Shared Instruction Cache Exporatory Study,
Tech Report, arXiv:1412.1140,
December 3, 2014.
paper Bibtex
@inproceedings{parkbagaria14,
author = { Dong-hyeon Park and Akhil Bagaria and Fabiha Hannan and Eric Storm and Josef Spjut },
title = { {Sphynx: A Shared Instruction Cache Exporatory Study} },
year = {2014},
booktitle = {Tech Report, arXiv:1412.1140}
}
Recent Blog Posts
{% for category in site.categories %}
{% if category[0] == "sphynx" %}
{% assign pages_list = category[1] %}
{% include JB/pages_list %}
{% endif %}
{% endfor %}
People
{% include custom/author_list %}


Avast pinnace warp Cat o'nine tails maroon Pirate Round scuppers capstan hearties boatswain.  Wench belaying pin line black jack clipper gaff take a caulk six pounders Admiral of the Black fire in the hole.Rigging topmast ye Corsair swing the lead gally lad bilge water bowsprit maroon. Smartly gally wherry barkadeer Gold Road rum grapple deadlights Davy Jones' Locker dead men tell no tales. Doubloon belay wench topsail sheet draft belaying pin Corsair capstan chase guns.


|
gtsam 4.1.1
gtsam
|
A Bayes net made from linear-Gaussian densities.
Public Member Functions | |
Standard Constructors | |
| GaussianBayesNet () | |
| Construct empty factor graph. | |
| template<typename ITERATOR > | |
| GaussianBayesNet (ITERATOR firstConditional, ITERATOR lastConditional) | |
| Construct from iterator over conditionals. | |
| template<class CONTAINER > | |
| GaussianBayesNet (const CONTAINER &conditionals) | |
| Construct from container of factors (shared_ptr or plain objects) | |
| template<class DERIVEDCONDITIONAL > | |
| GaussianBayesNet (const FactorGraph< DERIVEDCONDITIONAL > &graph) | |
| Implicit copy/downcast constructor to override explicit template container constructor. | |
| virtual | ~GaussianBayesNet () |
| Destructor. | |
Testable | |
| bool | equals (const This &bn, double tol=1e-9) const |
| Check equality. | |
Standard Interface | |
| VectorValues | optimize () const |
| Solve the GaussianBayesNet, i.e. return \( x = R^{-1}*d \), by back-substitution. | |
| VectorValues | optimize (const VectorValues &solutionForMissing) const |
| Version of optimize for incomplete BayesNet, needs solution for missing variables. More... | |
| Ordering | ordering () const |
| Return ordering corresponding to a topological sort. More... | |
Linear Algebra | |
| std::pair< Matrix, Vector > | matrix (const Ordering &ordering) const |
| Return (dense) upper-triangular matrix representation Will return upper-triangular matrix only when using 'ordering' above. More... | |
| std::pair< Matrix, Vector > | matrix () const |
| Return (dense) upper-triangular matrix representation Will return upper-triangular matrix only when using 'ordering' above. More... | |
| VectorValues | optimizeGradientSearch () const |
| Optimize along the gradient direction, with a closed-form computation to perform the line search. More... | |
| VectorValues | gradient (const VectorValues &x0) const |
| Compute the gradient of the energy function, \( \nabla_{x=x_0} \left\Vert \Sigma^{-1} R x - d \right\Vert^2 \), centered around \( x = x_0 \). More... | |
| VectorValues | gradientAtZero () const |
| Compute the gradient of the energy function, \( \nabla_{x=0} \left\Vert \Sigma^{-1} R x - d \right\Vert^2 \), centered around zero. More... | |
| double | error (const VectorValues &x) const |
| 0.5 * sum of squared Mahalanobis distances. | |
| double | determinant () const |
| Computes the determinant of a GassianBayesNet. More... | |
| double | logDeterminant () const |
| Computes the log of the determinant of a GassianBayesNet. More... | |
| VectorValues | backSubstitute (const VectorValues &gx) const |
| Backsubstitute with a different RHS vector than the one stored in this BayesNet. More... | |
| VectorValues | backSubstituteTranspose (const VectorValues &gx) const |
| Transpose backsubstitute with a different RHS vector than the one stored in this BayesNet. More... | |
| void | print (const std::string &s="", const KeyFormatter &formatter=DefaultKeyFormatter) const override |
| print graph More... | |
| void | saveGraph (const std::string &s, const KeyFormatter &keyFormatter=DefaultKeyFormatter) const |
| Save the GaussianBayesNet as an image. More... | |
| Public Member Functions inherited from gtsam::FactorGraph< GaussianConditional > | |
| virtual | ~FactorGraph ()=default |
| Default destructor. | |
| void | reserve (size_t size) |
| Reserve space for the specified number of factors if you know in advance how many there will be (works like FastVector::reserve). | |
| IsDerived< DERIVEDFACTOR > | push_back (boost::shared_ptr< DERIVEDFACTOR > factor) |
| Add a factor directly using a shared_ptr. | |
| IsDerived< DERIVEDFACTOR > | push_back (const DERIVEDFACTOR &factor) |
| Add a factor by value, will be copy-constructed (use push_back with a shared_ptr to avoid the copy). | |
| IsDerived< DERIVEDFACTOR > | emplace_shared (Args &&... args) |
| Emplace a shared pointer to factor of given type. | |
| IsDerived< DERIVEDFACTOR > | add (boost::shared_ptr< DERIVEDFACTOR > factor) |
add is a synonym for push_back. | |
| std::enable_if< std::is_base_of< FactorType, DERIVEDFACTOR >::value, boost::assign::list_inserter< RefCallPushBack< This > > >::type | operator+= (boost::shared_ptr< DERIVEDFACTOR > factor) |
+= works well with boost::assign list inserter. | |
| HasDerivedElementType< ITERATOR > | push_back (ITERATOR firstFactor, ITERATOR lastFactor) |
| Push back many factors with an iterator over shared_ptr (factors are not copied) | |
| HasDerivedValueType< ITERATOR > | push_back (ITERATOR firstFactor, ITERATOR lastFactor) |
| Push back many factors with an iterator (factors are copied) | |
| HasDerivedElementType< CONTAINER > | push_back (const CONTAINER &container) |
| Push back many factors as shared_ptr's in a container (factors are not copied) | |
| HasDerivedValueType< CONTAINER > | push_back (const CONTAINER &container) |
| Push back non-pointer objects in a container (factors are copied). | |
| void | add (const FACTOR_OR_CONTAINER &factorOrContainer) |
| Add a factor or container of factors, including STL collections, BayesTrees, etc. | |
| boost::assign::list_inserter< CRefCallPushBack< This > > | operator+= (const FACTOR_OR_CONTAINER &factorOrContainer) |
| Add a factor or container of factors, including STL collections, BayesTrees, etc. | |
| std::enable_if< std::is_base_of< This, typenameCLIQUE::FactorGraphType >::value >::type | push_back (const BayesTree< CLIQUE > &bayesTree) |
| Push back a BayesTree as a collection of factors. More... | |
| FactorIndices | add_factors (const CONTAINER &factors, bool useEmptySlots=false) |
| Add new factors to a factor graph and returns a list of new factor indices, optionally finding and reusing empty factor slots. | |
| bool | equals (const This &fg, double tol=1e-9) const |
| Check equality. | |
| size_t | size () const |
| return the number of factors (including any null factors set by remove() ). | |
| bool | empty () const |
| Check if the graph is empty (null factors set by remove() will cause this to return false). | |
| const sharedFactor | at (size_t i) const |
| Get a specific factor by index (this checks array bounds and may throw an exception, as opposed to operator[] which does not). | |
| sharedFactor & | at (size_t i) |
| Get a specific factor by index (this checks array bounds and may throw an exception, as opposed to operator[] which does not). | |
| const sharedFactor | operator[] (size_t i) const |
| Get a specific factor by index (this does not check array bounds, as opposed to at() which does). | |
| sharedFactor & | operator[] (size_t i) |
| Get a specific factor by index (this does not check array bounds, as opposed to at() which does). | |
| const_iterator | begin () const |
| Iterator to beginning of factors. | |
| const_iterator | end () const |
| Iterator to end of factors. | |
| sharedFactor | front () const |
| Get the first factor. | |
| sharedFactor | back () const |
| Get the last factor. | |
| iterator | begin () |
| non-const STL-style begin() | |
| iterator | end () |
| non-const STL-style end() | |
| void | resize (size_t size) |
| Directly resize the number of factors in the graph. More... | |
| void | remove (size_t i) |
| delete factor without re-arranging indexes by inserting a nullptr pointer | |
| void | replace (size_t index, sharedFactor factor) |
| replace a factor by index | |
| iterator | erase (iterator item) |
| Erase factor and rearrange other factors to take up the empty space. | |
| iterator | erase (iterator first, iterator last) |
| Erase factors and rearrange other factors to take up the empty space. | |
| size_t | nrFactors () const |
| return the number of non-null factors | |
| KeySet | keys () const |
| Potentially slow function to return all keys involved, sorted, as a set. | |
| KeyVector | keyVector () const |
| Potentially slow function to return all keys involved, sorted, as a vector. | |
| bool | exists (size_t idx) const |
| MATLAB interface utility: Checks whether a factor index idx exists in the graph and is a live pointer. | |
Public Types | |
| typedef FactorGraph< GaussianConditional > | Base |
| typedef GaussianBayesNet | This |
| typedef GaussianConditional | ConditionalType |
| typedef boost::shared_ptr< This > | shared_ptr |
| typedef boost::shared_ptr< ConditionalType > | sharedConditional |
| Public Types inherited from gtsam::FactorGraph< GaussianConditional > | |
| typedef GaussianConditional | FactorType |
| factor type | |
| typedef boost::shared_ptr< GaussianConditional > | sharedFactor |
| Shared pointer to a factor. | |
| typedef sharedFactor | value_type |
| typedef FastVector< sharedFactor >::iterator | iterator |
| typedef FastVector< sharedFactor >::const_iterator | const_iterator |
Friends | |
| class | boost::serialization::access |
| Serialization function. | |
Additional Inherited Members | |
| Protected Member Functions inherited from gtsam::FactorGraph< GaussianConditional > | |
| FactorGraph () | |
| Default constructor. | |
| FactorGraph (ITERATOR firstFactor, ITERATOR lastFactor) | |
| Constructor from iterator over factors (shared_ptr or plain objects) | |
| FactorGraph (const CONTAINER &factors) | |
| Construct from container of factors (shared_ptr or plain objects) | |
| Protected Attributes inherited from gtsam::FactorGraph< GaussianConditional > | |
| FastVector< sharedFactor > | factors_ |
| concept check, makes sure FACTOR defines print and equals More... | |
| VectorValues gtsam::GaussianBayesNet::backSubstitute | ( | const VectorValues & | gx | ) | const |
Backsubstitute with a different RHS vector than the one stored in this BayesNet.
gy=inv(R*inv(Sigma))*gx
| VectorValues gtsam::GaussianBayesNet::backSubstituteTranspose | ( | const VectorValues & | gx | ) | const |
Transpose backsubstitute with a different RHS vector than the one stored in this BayesNet.
gy=inv(L)*gx by solving L*gy=gx. gy=inv(R'*inv(Sigma))*gx gz'*R'=gx', gy = gz.*sigmas
| double gtsam::GaussianBayesNet::determinant | ( | ) | const |
Computes the determinant of a GassianBayesNet.
A GaussianBayesNet is an upper triangular matrix and for an upper triangular matrix determinant is the product of the diagonal elements. Instead of actually multiplying we add the logarithms of the diagonal elements and take the exponent at the end because this is more numerically stable.
| bayesNet | The input GaussianBayesNet |
| VectorValues gtsam::GaussianBayesNet::gradient | ( | const VectorValues & | x0 | ) | const |
Compute the gradient of the energy function, \( \nabla_{x=x_0} \left\Vert \Sigma^{-1} R x - d \right\Vert^2 \), centered around \( x = x_0 \).
The gradient is \( R^T(Rx-d) \).
| x0 | The center about which to compute the gradient |
| VectorValues gtsam::GaussianBayesNet::gradientAtZero | ( | ) | const |
Compute the gradient of the energy function, \( \nabla_{x=0} \left\Vert \Sigma^{-1} R x - d \right\Vert^2 \), centered around zero.
The gradient about zero is \( -R^T d \). See also gradient(const GaussianBayesNet&, const VectorValues&).
| [output] | g A VectorValues to store the gradient, which must be preallocated, see allocateVectorValues |
| double gtsam::GaussianBayesNet::logDeterminant | ( | ) | const |
Computes the log of the determinant of a GassianBayesNet.
A GaussianBayesNet is an upper triangular matrix and for an upper triangular matrix determinant is the product of the diagonal elements.
| bayesNet | The input GaussianBayesNet |
| pair< Matrix, Vector > gtsam::GaussianBayesNet::matrix | ( | ) | const |
Return (dense) upper-triangular matrix representation Will return upper-triangular matrix only when using 'ordering' above.
In case Bayes net is incomplete zero columns are added to the end.
| pair< Matrix, Vector > gtsam::GaussianBayesNet::matrix | ( | const Ordering & | ordering | ) | const |
Return (dense) upper-triangular matrix representation Will return upper-triangular matrix only when using 'ordering' above.
In case Bayes net is incomplete zero columns are added to the end.
| VectorValues gtsam::GaussianBayesNet::optimize | ( | const VectorValues & | solutionForMissing | ) | const |
Version of optimize for incomplete BayesNet, needs solution for missing variables.
solve each node in turn in topological sort order (parents first)
| VectorValues gtsam::GaussianBayesNet::optimizeGradientSearch | ( | ) | const |
Optimize along the gradient direction, with a closed-form computation to perform the line search.
The gradient is computed about \( \delta x=0 \).
This function returns \( \delta x \) that minimizes a reparametrized problem. The error function of a GaussianBayesNet is
\[ f(\delta x) = \frac{1}{2} |R \delta x - d|^2 = \frac{1}{2}d^T d - d^T R \delta x + \frac{1}{2} \delta x^T R^T R \delta x \]
with gradient and Hessian
\[ g(\delta x) = R^T(R\delta x - d), \qquad G(\delta x) = R^T R. \]
This function performs the line search in the direction of the gradient evaluated at \( g = g(\delta x = 0) \) with step size \( \alpha \) that minimizes \( f(\delta x = \alpha g) \):
\[ f(\alpha) = \frac{1}{2} d^T d + g^T \delta x + \frac{1}{2} \alpha^2 g^T G g \]
Optimizing by setting the derivative to zero yields \( \hat \alpha = (-g^T g) / (g^T G g) \). For efficiency, this function evaluates the denominator without computing the Hessian \( G \), returning
\[ \delta x = \hat\alpha g = \frac{-g^T g}{(R g)^T(R g)} \]
| Ordering gtsam::GaussianBayesNet::ordering | ( | ) | const |
Return ordering corresponding to a topological sort.
There are many topological sorts of a Bayes net. This one corresponds to the one that makes 'matrix' below upper-triangular. In case Bayes net is incomplete any non-frontal are added to the end.
|
inlineoverridevirtual |
print graph
Reimplemented from gtsam::FactorGraph< GaussianConditional >.
| void gtsam::GaussianBayesNet::saveGraph | ( | const std::string & | s, |
| const KeyFormatter & | keyFormatter = DefaultKeyFormatter |
||
| ) | const |
Save the GaussianBayesNet as an image.
Requires dot
to be installed.
| s | The name of the figure. |
| keyFormatter | Formatter to use for styling keys in the graph. |


twilio.rest.api.v2010.account.recording.add_on_result package¶
Module contents¶
This code was generated by / _ _ _| _ _
(_)/(_)(_|/| |(/_ v1.0.0 / /
-
class
twilio.rest.api.v2010.account.recording.add_on_result.
AddOnResultContext
(version, account_sid, reference_sid, sid)[source]¶ Bases:
twilio.base.instance_context.InstanceContext
-
delete
()[source]¶ Deletes the AddOnResultInstance
Returns: True if delete succeeds, False otherwise Return type: bool
-
fetch
()[source]¶ Fetch the AddOnResultInstance
Returns: The fetched AddOnResultInstance Return type: twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultInstance
-
payloads
¶ Access the payloads
Returns: twilio.rest.api.v2010.account.recording.add_on_result.payload.PayloadList Return type: twilio.rest.api.v2010.account.recording.add_on_result.payload.PayloadList
-
-
class
twilio.rest.api.v2010.account.recording.add_on_result.
AddOnResultInstance
(version, payload, account_sid, reference_sid, sid=None)[source]¶ Bases:
twilio.base.instance_resource.InstanceResource
-
class
Status
[source]¶ Bases:
object
-
CANCELED
= 'canceled'¶
-
COMPLETED
= 'completed'¶
-
DELETED
= 'deleted'¶
-
FAILED
= 'failed'¶
-
INIT
= 'init'¶
-
IN_PROGRESS
= 'in-progress'¶
-
PROCESSING
= 'processing'¶
-
QUEUED
= 'queued'¶
-
-
account_sid
¶ Returns: The SID of the Account that created the resource Return type: unicode
-
add_on_configuration_sid
¶ Returns: The SID of the Add-on configuration Return type: unicode
-
add_on_sid
¶ Returns: The SID of the Add-on to which the result belongs Return type: unicode
-
date_completed
¶ Returns: The date and time in GMT that the result was completed Return type: datetime
-
date_created
¶ Returns: The RFC 2822 date and time in GMT that the resource was created Return type: datetime
-
date_updated
¶ Returns: The RFC 2822 date and time in GMT that the resource was last updated Return type: datetime
-
delete
()[source]¶ Deletes the AddOnResultInstance
Returns: True if delete succeeds, False otherwise Return type: bool
-
fetch
()[source]¶ Fetch the AddOnResultInstance
Returns: The fetched AddOnResultInstance Return type: twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultInstance
-
payloads
¶ Access the payloads
Returns: twilio.rest.api.v2010.account.recording.add_on_result.payload.PayloadList Return type: twilio.rest.api.v2010.account.recording.add_on_result.payload.PayloadList
-
reference_sid
¶ Returns: The SID of the recording to which the AddOnResult resource belongs Return type: unicode
-
sid
¶ Returns: The unique string that identifies the resource Return type: unicode
-
status
¶ Returns: The status of the result Return type: AddOnResultInstance.Status
-
subresource_uris
¶ Returns: A list of related resources identified by their relative URIs Return type: unicode
-
class
-
class
twilio.rest.api.v2010.account.recording.add_on_result.
AddOnResultList
(version, account_sid, reference_sid)[source]¶ Bases:
twilio.base.list_resource.ListResource
-
get
(sid)[source]¶ Constructs a AddOnResultContext
Parameters: sid – The unique string that identifies the resource to fetch Returns: twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultContext Return type: twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultContext
-
get_page
(target_url)[source]¶ Retrieve a specific page of AddOnResultInstance records from the API. Request is executed immediately
Parameters: target_url (str) – API-generated URL for the requested results page Returns: Page of AddOnResultInstance Return type: twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultPage
-
list
(limit=None, page_size=None)[source]¶ Lists AddOnResultInstance records from the API as a list. Unlike stream(), this operation is eager and will load limit records into memory before returning.
Parameters: - limit (int) – Upper limit for the number of records to return. list() guarantees never to return more than limit. Default is no limit
- page_size (int) – Number of records to fetch per request, when not set will use the default value of 50 records. If no page_size is defined but a limit is defined, list() will attempt to read the limit with the most efficient page size, i.e. min(limit, 1000)
Returns: Generator that will yield up to limit results
Return type: list[twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultInstance]
-
page
(page_token=<object object>, page_number=<object object>, page_size=<object object>)[source]¶ Retrieve a single page of AddOnResultInstance records from the API. Request is executed immediately
Parameters: Returns: Page of AddOnResultInstance
Return type: twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultPage
-
stream
(limit=None, page_size=None)[source]¶ Streams AddOnResultInstance records from the API as a generator stream. This operation lazily loads records as efficiently as possible until the limit is reached. The results are returned as a generator, so this operation is memory efficient.
Parameters: - limit (int) – Upper limit for the number of records to return. stream() guarantees to never return more than limit. Default is no limit
- page_size (int) – Number of records to fetch per request, when not set will use the default value of 50 records. If no page_size is defined but a limit is defined, stream() will attempt to read the limit with the most efficient page size, i.e. min(limit, 1000)
Returns: Generator that will yield up to limit results
Return type: list[twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultInstance]
-
-
class
twilio.rest.api.v2010.account.recording.add_on_result.
AddOnResultPage
(version, response, solution)[source]¶ Bases:
twilio.base.page.Page
-
get_instance
(payload)[source]¶ Build an instance of AddOnResultInstance
Parameters: payload (dict) – Payload response from the API Returns: twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultInstance Return type: twilio.rest.api.v2010.account.recording.add_on_result.AddOnResultInstance
-


Upload your design
You have
5
uploads remainig today.
JPG
,
GIF
or
PNG
files
800x600
or
1200x900
pixels


Using PIRCS collaboartion system
The installed BSCW collaboration package can be used by following the following link with your username and passwd
Enter PIRCS collaboration system (be ready with your username and passwd)
If you are working with the PIRCS program and wish to register for a user account on the system you will need to follow the registration link below and then contanct the group administrators to be added to the various teams. You will be provided this information. If you have trouble with this system please contact<EMAIL_ADDRESS>and mention PIRCS BSCW in your email. There are some help files on this server or you can go directory to the BSCW help pages as well.


| genealogy diagram internals {phylopomp} | R Documentation |
Facilities to produce diagrammatic representations of genealogy process states.
genealogyGrob(object, m = NULL, n = NULL, vp = NULL, palette, ...)
nodeGrob(object, digits = 1, palette, n = NULL, vp = NULL)
pocketGrob(object, n, vp = NULL)
ballGrob(object, vp = NULL)
resizingTextGrob(..., vp = NULL)
## S3 method for class 'resizingTextGrob'
drawDetails(x, recording = TRUE)
## S3 method for class 'resizingTextGrob'
preDrawDetails(x)
## S3 method for class 'resizingTextGrob'
postDrawDetails(x)
## S3 method for class 'ballGrob'
drawDetails(x, recording = TRUE)
## S3 method for class 'ballGrob'
preDrawDetails(x)
## S3 method for class 'ballGrob'
postDrawDetails(x)
## S3 method for class 'gpsim'
print(x, ...)
## S3 method for class 'gpgen'
print(x, ...)
## S3 method for class 'gpyaml'
print(x, ...)
object |
list; pocket structure |
m |
width of plotting window, in nodes. By default, the nodes will be adjusted in width to fit the window. |
n |
length of longest genealogy |
vp |
viewport to draw plot in |
palette |
color palette for indicating demes. This can be furnished either as a function or a vector of colors. If this is a function, it should take a single integer argument, the number of colors required. If it is a vector, it should have at least as many elements as there are demes in the genealogy. |
... |
arguments to be passed to |
digits |
non-negative integer; number of decimal digits to print in the node time |
x |
An R object. |
recording |
A logical value indicating whether a grob is being added to the display list or redrawn from the display list. |
Code for the resizing text adapted from a blog post by Mark Heckmann (https://ryouready.wordpress.com/2012/08/01/creating-a-text-grob-that-automatically-adjusts-to-viewport-size/).


Next
Previous
Contents
The ld65 linker combines several object modules created by the ca65
assembler, producing an executable file. The object modules may be read
from a library created by the ar65 archiver (this is somewhat faster and
more convenient). The linker was designed to be as flexible as possible.
It complements the features that are built into the ca65 macroassembler:
- Accept any number of segments to form an executable module.
- Resolve arbitrary expressions stored in the object files.
- In case of errors, use the meta information stored in the object files
to produce helpful error messages. In case of undefined symbols,
expression range errors, or symbol type mismatches, ld65 is able to
tell you the exact location in the original assembler source, where
the symbol was referenced.
- Flexible output. The output of ld65 is highly configurable by a config
file. More common platforms are supported by builtin configurations
that may be activated by naming the target system. The output
generation was designed with different output formats in mind, so
adding other formats shouldn't be a great problem.
Next
Previous
Contents


{% extends "global/Page.html" %} {% load otree static %} {% block title %} Beginning of Stage Two {% endblock %} {% block content %}
We are about to start Stage Two. We ask you to carefully read the instructions to follow. You will receive a QUIZ on its contents, and proceed only when you complete all questions correctly.
Background
Stage Two consists of 10 periods. The manager and the three employees in each firm will be interacting with one another during each period.
The established roles (Manager, Employee A, Employee B, and Employee C) do not change throughout Stage Two.
The decisions you and others in your firm make will determine your compensation, which will be first provided in points. At the end of today’s session, earned points will be converted into cash at the rate of 7 cents per point.
{% next_button %} {% endblock %}


## Evercookie
Evercookie is a gem allowing you to use very persistent cookies on your rails project to track existing users on your system. It's javascript is based on github.com/samyk/evercookie javascript. Please note, that evercookie can't be fully reliable for detecting previous visiting of your site/application. For people who know the job it's simple enough to override it.
As written on original javascript site (samy.pl/evercookie/), when creating a new cookie, it uses the following storage mechanisms when available:
Standard [HTTP Cookies](en.wikipedia.org/wiki/HTTP_cookie)
[Local Shared Objects](en.wikipedia.org/wiki/Local_Shared_Object) (Flash Cookies)
[Isolated Storage](www.silverlight.net/learn/quickstarts/isolatedstorage/) Silverlight (removed in gem)
Storing cookies in RGB values of auto-generated, force-cached PNGs using HTML5 Canvas tag to read pixels (cookies) back out
Storing cookies in and reading out [Web History](samy.pl/csshack/) (removed in gem)
Storing cookies in HTTP [ETags](en.wikipedia.org/wiki/HTTP_ETag)
Storing cookies in [Web cache](en.wikipedia.org/wiki/Web_cache)
[window.name](en.wikipedia.org/wiki/HTTP_cookie#window.name) caching
Internet Explorer [userData](msdn.microsoft.com/en-us/library/ms531424(VS.85).aspx) storage
HTML5 [Session Storage](dev.w3.org/html5/webstorage/#the-sessionstorage-attribute)
HTML5 [Local Storage](dev.w3.org/html5/webstorage/#dom-localstorage)
HTML5 [Global Storage](developer.mozilla.org/en/dom/storage#globalStorage)
HTML5 [Database Storage](dev.w3.org/html5/webdatabase) via SQLite
## Information
### RDoc
RDoc documentation can be found here rubydoc.info/github/daddyz/evercookie/master/frames
### Bug reports
If you discover a problem with Evercookie gem, let us know about it. github.com/daddyz/evercookie/issues
### Example application
You can see an example of evercookie working in test/dummy application of this gem
## Getting started
Evercookie works was written and tested on Rails 3.2. You can add in to your Gemfile with:
“`ruby gem ‘evercookie’ “`
Run the bundle command to install it.
### View helpers
View helper that adds javascript for setting the evercookie for client:
“`ruby set_evercookie(:key, :value) “`
View helper that checks whether the cookie was set on client side and resets if some of cookies were deleted:
“`ruby check_evercookie(:key) “`
### Controller helpers
Controller helper that gets the value of evercookie by key:
“`ruby evercookie_get_value(:key) “`
Controller helper that checks if specific evercookie was set:
“`ruby evercookie_is_set?(:key) evercookie_is_set?(:key, :value) “`
### How it works
When you are calling:
`set_evercookie` helper it adds javascript to set evercookie values in all available storage mechanisms.
`check_evercookie` helper it adds javascript to get evercookie values from all storage mechanisms where it possible and resets their values where it was removed (like if user removed individual cookies it sets them back) and after that it calls it’s controller action to save evercookie value in rails session
`evercookie_get_value` helper in controller it checks evercookie’s session for provided ‘key’ value and returns it if exists
`evercookie_is_set?` helper in controller it checks if there is a provided ‘key’ in evercookie’s session
### How this gem should be used
The main idea of this gem is to set somewhere in application an evercookie to track that this client already visited your application. I used it to track multiple registrations in such scenario:
After user was registered he was passed to specific view where I called set_evercookie helper:
“`ruby set_evercookie(:uid, user_unique_id) “`
In user sign up page view I called check_evercookie helper:
“`ruby check_evercookie(:uid) “`
In controller that was handling new user creation process I was running evercookie_get_value helper to check if previously I got evercookie value from user, and if I got it I was showing an error:
“`ruby evercookie_get_value(:uid) “`
### Configuring the gem
You can create the initializer for evercookie gem in your Rails application initializers folder:
“`ruby Evercookie.setup do |config|
# path for evercookie controller config.namespace = :evercookie # name of javascript class to be used for evercookie config.js_class = :evercookie # hash name base for session storage variables config.hash_name = :evercookie # cookie name for cache storage config.cookie_cache = :evercookie_cache # cookie name for png storage config.cookie_png = :evercookie_png # cookie name for etag storage config.cookie_etag = :evercookie_etag
end “`


--- layout: post title: Chinese beer labels date: '2017-06-18T10:30:37+02:00' categories: - Grand Froid - Graphic Design - Props picture_url: https://film-Storyboards.tumblr.com/post/161968249904/chinese-beer-labels ---
more beer labels Sketches


SQL Naming Conventions
At this point, we support only MySQL database. At some point in the future, we will support PostgreSQL and SQLite.
- Table names and column names are in lower case. Words are separated by an underscore. Example, call_status
- Tables names are singular. Example, user is correct. users is incorrect
- Text columns, ie, data types being text, char, varchar, longtext, etc have collation utf8_general_ci
- All tables have a primary key
- The auto increment column is named <table_name_id>. This data type for this column is unsigned int.
- All tables use the InnoDB storage engine
- Verbose names are preferred. For example, invice is preferred over inv
- Collation for all tables must be utf8_unicode_ci


 CAREER GIRLS is a light, almost comedic drama that harkens back, in tone and temperament, to LIFE IS SWEET. There's nothing bold or ground-breaking about this film -- it's a two-character piece that features strong writing and acting, and very little else. CAREER GIRLS is also short enough (a skinny ninety minutes) that it's never in danger of wearing out its welcome, something that occasionally happens with "talky" movies like this.
In many ways, simplicity is CAREER GIRLS' greatest asset. Because the plot is so threadbare, it allows us to delve more deeply into the personalities of the two protagonists. They are Hannah (Katrin Cartlidge) and Annie (Lynda Steadman), a pair of thirty-ish former university roommates-turned-business women who are spending a weekend together in London. Once, Hannah and Annie were inseparable, but, since completing their terms at college six years ago, they have become victims of the gulf that time and distance often build. CAREER GIRLS is about their attempts to rediscover, and perhaps redefine, their relationship.
As usual, Mike Leigh uses the "fly on the wall" perspective to give us insights into the most mundane aspects of the women's weekend. We see them eating, drinking, and getting ready for bed. Their topics of conversation are often banal, but the intelligence of the writing keeps us involved even when the subject matter is stale. And, to give us a sense of perspective about Hannah and Annie's past, Leigh employs numerous flashbacks to allow us to share their memories. It's a technique that amplifies our understanding of the two characters.
The reunion is presented believably, with the initial awkwardness and tension giving way to the gradual recapturing of an easy familiarity. Anyone who has met an old friend after many years' absence will find the ring of truth here. In this, as in almost everything else, Leigh shows that he's a careful observer of life. Time mutates all of us, although, living within the shell of our body, we're unaware of the changes, or think that they're imperceptible. Reunions give us a chance to take a step back and examine how the years have altered our lives and those of others. This is the feeling that Leigh has captured here, by introducing not only Hannah and Annie, but three other important individuals from their past: the "idiot savant" Ricky (Mark Benton), the callous Adrian (Joe Tucker), and another former roommate, Claire (Kate Byers). Coincidence also plays a role in CAREER GIRLS, although Leigh seems a little self-conscious using this device, since he keeps mentioning it.
CAREER GIRLS is peppered with humor, although, as was the case in LIFE IS SWEET, some of the comedy is underpinned by a bittersweet aura. The most memorable of this film's episodes has Hannah and Annie, who are looking at expensive condos without any intention of buying ("just to see how the other half lives"), encountering a sleazy owner who seems as interested in getting them into bed as in showing off his high-rise domicile.
The film's success depends largely on how well the two main characters are presented, and the performances of Katrin Cartlidge and Lynda Steadman are rock solid. Steadman, in her first feature film, captures the innocence and insecurity of a woman suffering from a severe self-esteem problem.  Katrin Cartlidge, who appeared in Leigh's NAKED (and more recently in BREAKING THE WAVES), is even better as the self-confident, but inevitably lonely, Hannah. Cartlidge delivers Leigh's dialogue with a relish that gives many of the one- liners their zing.
CAREER GIRLS is a wonderful diversion -- expert film making that's all the more effective because it seems so natural and effortless. The movie lacks the grit of NAKED and the emotional impact of SECRETS AND LIES, but, because it effectively transforms two strangers into people worth caring about, CAREER GIRLS can be regarded as nothing less than a success.
Copyright 1997 James Berardinelli
- James Berardinelli e-mail<EMAIL_ADDRESS>ReelViews web site: http://www.cybernex.net/~berardin
"A film is a petrified fountain of thought." - Jean Cocteau
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


{{ define "main" }}
The page you're looking for doesn't exist. Sorry. Try choosing something from the menu.


The syntax of the blocking receive operation is given below.
MPI_RECV (buf, count, datatype, source, tag, comm, status)
[ OUT buf] initial address of receive buffer (choice)
[ IN count] number of elements in receive buffer (integer)
[ IN datatype] datatype of each receive buffer element (handle)
[ IN source] rank of source (integer)
[ IN tag] message tag (integer)
[ IN comm] communicator (handle)
[ OUT status] status object (Status)
int MPI_Recv(void* buf, int count, MPI_Datatype datatype, int source, int tag, MPI_Comm comm, MPI_Status *status)
MPI_RECV(BUF, COUNT, DATATYPE, SOURCE, TAG, COMM, STATUS, IERROR)
<type> BUF(*)
INTEGER COUNT, DATATYPE, SOURCE, TAG, COMM, STATUS(MPI_STATUS_SIZE), IERROR
The blocking semantics of this call are described in Sec. Communication Modes .
The receive buffer consists of the storage containing count consecutive elements of the type specified by datatype, starting at address buf. The length of the received message must be less than or equal to the length of the receive buffer. An overflow error occurs if all incoming data does not fit, without truncation, into the receive buffer.
If a message that is shorter than the receive buffer arrives, then only those locations corresponding to the (shorter) message are modified.
[] Advice to users.
The MPI_PROBE function described in
Section Probe and Cancel
can be used to receive messages of
unknown length.
( End of advice to users.)
[] Advice
to implementors.
Even though no specific behavior is mandated by MPI for erroneous programs, the recommended handling of overflow situations is to return in status information about the source and tag of the incoming message. The receive operation will return an error code. A quality implementation will also ensure that no memory that is outside the receive buffer will ever be overwritten.
In the case of a message shorter than the receive buffer, MPI is
quite strict in that it allows no modification of the other locations.
A more lenient statement would allow for some
optimizations but this is not allowed. The implementation must be ready to
end a copy into the receiver memory exactly at the end of the receive
buffer, even if it is an odd address.
( End of advice to implementors.)
The selection of a message by a receive operation is governed by
the value of the message envelope.
A message can be received by a receive operation
if its envelope matches the source, tag and
comm values specified by the
receive operation. The receiver may specify a wildcard
MPI_ANY_SOURCE
value for source, and/or
a wildcard MPI_ANY_TAG value for tag,
indicating that any source and/or tag are acceptable. It cannot specify a
wildcard value for comm.
Thus, a message can be received by a receive
operation only if it is addressed
to the receiving process, has a matching communicator, has
matching source unless
source= MPI_ANY_SOURCE
in the pattern, and has a matching tag unless tag= MPI_ANY_TAG in
the pattern.
The message tag is specified by the tag argument of the receive operation. The argument source, if different from MPI_ANY_SOURCE, is specified as a rank within the process group associated with that same communicator (remote process group, for intercommunicators). Thus, the range of valid values for the source argument is {0,...,n-1} {MPI_ANY_SOURCE}, where n is the number of processes in this group.
Note the asymmetry between send and receive operations: A receive operation may accept messages from an arbitrary sender, on the other hand, a send operation must specify a unique receiver. This matches a ``push'' communication mechanism, where data transfer is effected by the sender (rather than a ``pull'' mechanism, where data transfer is effected by the receiver).
Source = destination is allowed, that is, a process can send a message to itself. (However, it is unsafe to do so with the blocking send and receive operations described above, since this may lead to deadlock. See Sec. Semantics of point-to-point communication .)
[] Advice
to implementors.
Message context and other communicator information
can be implemented as an additional tag field. It differs
from the regular message tag in that wild card matching is not allowed on this
field, and that value setting for this field is controlled by communicator
manipulation functions.
( End of advice to implementors.)


Hello, welcome to my website. Feel free to explore. On this website you will find a neglected blog, some random photos, an outdated list of books I should read, and a secret map to ancient treasure.
Hello, welcome to my website. Feel free to explore. On this website you will find a neglected blog, some random photos, an outdated list of books I should read, and a secret map to ancient treasure.


bind-transforms demo touch or mouse over
The square is positioned using translateY
and translateX
CSS3 transforms bound to a human-model.
As you touch or mouse over, the only thing we do is set the model's x
and y
values:
model.set({x: pageX, y: pageY});
We use derived properties on the model to describe various styles we'd like bound to the element.
This makes it possible to describe highly-performant and intricate UI behaviors with very little code.


Preparation time
less than 30 mins
Cooking time
30 mins to 1 hour
Serves
Serves 4
This is a simple lasagne, easy to jazz up with your own choice of fillings or a grating of cheese on top. This is designed to be a low cost recipe.
Preheat the oven to 200C/400F/Gas 6
Heat a large frying pan over a medium heat and add the olive oil. Once hot, add the mince along with a good pinch of salt and pepper. Brown the mince for 5-6 minutes until coloured all over and beginning to crisp. Remove the mince from the pan and set to one side.
Add the onion and carrot to the frying pan along with a pinch of salt. Cook gently for 10 minutes, or until everything is softened.
Meanwhile, melt the butter in a saucepan over a medium heat. Once melted, add the flour and mustard, stir to mix well. Leave to cook over a medium heat for two minutes, or until the mixture makes a paste.
Pour the milk in batches into the saucepan, whisking as you add to create a smooth white sauce. Once all the milk is added season with a pinch of salt and black pepper, turn the heat down and leave to simmer very gently for seven minutes.
Once the onions and carrots are softened, add the garlic to the frying pan and cook for two minutes. Return the meat (plus any juices) to the pan and add the tomatoes. Mix everything together, cover with a lid and simmer the sauce for 10 minutes until thickened slightly.
To assemble the lasagne, place a quarter of the tomato sauce into the bottom of a small/medium baking dish. Top with a layer of lasagne sheets. Spoon over another quarter of the tomato sauce and top with a third of the white sauce. Repeat this twice more, finishing at the top with the last layer of white sauce. (You should have three sets of layers of lasagne, tomato and white sauce, all on a bed of tomato sauce.)
Place into the preheated oven and bake for 30 minutes or until bubbling and the top is golden-brown. Serve the lasagne in slices while hot.