Asking questions
The key to success
April 20, 2015
Knowing how to ask a question, nowadays, is more essential than ever. People lack time, and we lack time, so we want to have answers to our questions asap. This extends even to Google, to whom we commonly ask questions. When we ask a good question, we get a straight answer and don't keep stuck.
From these past weeks experience, I've been observing that a good question:
- Is organized: you can't start explaining one thing, and then interrupt it to explain something else, and then return to the previous thought, and then.... no! Organize your thoughts and explain it linearly.
- Is objective: please, don't write the Bible to explain your thoughts. Know how to summarize it. People are less open to help you if they have to read an endless explanation of your problem.
- Is filled with all necessary information: you have to put your readers on the same page that you are. Nobody has a clue of what you're working on or the things you already tried. So, contextualize them. Place them on your universe, and share what you've already researched and tried.
I love to dive in my colleagues problems. It's a great chance of learning something new, apart from helping someone that might be freaking out. When a good question is posed, it will always get answers. And there's more: many times, when we structure our thoughts to make a good question, we end up finding the answer before even having to ask it in fact! So, let's practice to ask good questions, and make us all more productive!


Select the image button from the toolbar
The file will be past to your Upload function.
Return a Promise that resolves as a url of an image
This demo has a timeout to simulate uploading to a server and resolves as as url to an image


INSTALL ------- Just put everything into a directory called 'CheddarGetter' in your include path. You can use git to do this: git clone git://github.com/marcguyer/cheddargetter-client-php.git /path/to/includepath/CheddarGetter The 'CheddarGetter' directory must not exist prior to running the above command. Or, if you don't use git, just download all the files and put them in a directory called /path/to/includepath/CheddarGetter BASIC USAGE ----------- If you use an autoloader, you're good. If not, just require all the files like so: <?php require('CheddarGetter/Client.php'); require('CheddarGetter/Client/Exception.php'); require('CheddarGetter/Response.php'); require('CheddarGetter/Response/Exception.php'); ?> Then, just fire it up: <?php $client = new CheddarGetter_Client('https://theurlforcheddargetter.com', 'yourusername', 'yourpassword', 'yourproductcode'); $customers = $client->getCustomers(); print_r($customers->toArray()); echo $customers->toJson(); ?> DOCUMENTATION ------------- Check 'em out in [http://cheddargetter.com/php-client/docs](http://cheddargetter.com/php-client/docs) Also, raw API docs are here: [http://cheddargetter.com/developers](http://cheddargetter.com/developers)
Documentation generated on Tue, 09 Nov 2010 21:39:56 +0000 by phpDocumentor 1.4.3


Class MixedRealityEditorSettings
Sets Force Text Serialization and visible meta files in all projects that use the Mixed Reality Toolkit.
Inheritance
MixedRealityEditorSettings
Assembly: cs.temp.dll.dll
public class MixedRealityEditorSettings : IActiveBuildTargetChanged
Properties
Declaration
public int callbackOrder { get; }
Property Value
Declaration
public static string MixedRealityToolkit_AbsoluteFolderPath { get; }
Property Value
Declaration
public static string MixedRealityToolkit_RelativeFolderPath { get; }
Property Value
Methods
Check the Mixed Reality Toolkit's settings.
Declaration
public static void CheckSettings()
Declaration
public void OnActiveBuildTargetChanged(BuildTarget previousTarget, BuildTarget newTarget)
Parameters
| Type |
Name |
Description |
| BuildTarget |
previousTarget |
|
| BuildTarget |
newTarget |
|


Home
About us
pizzacitymenu
Contact
Order Here
CONTACTS US
<EMAIL_ADDRESS>Telephone:+254706789034
Name
Email
Subject
Submit


# This is a properties file a.key = A value another.key = http://example.com ! Exclamation mark as comment but.not=Within ! A value # indeed # Spaces at the beginning of a line spaces.before.key=value backslash=Used for multi\ line entries,\ that's convenient. # Unicode sequences unicode.key=This is \u0020 Unicode no.multiline=here # Colons colons : can be used too # Spaces spaces\ in\ keys=Not very common...


Holiday Inn
800 Jefferson Rd
10 min drive away from RIT
WEBSITE →
Radisson Hotel
175 Jefferson Rd
4 min drive away from RIT
WEBSITE →
Microtel
900 Lehigh Station Rd
10 min drive away from RIT
WEBSITE →
Days Inn
4853 W. Henrietta Rd
11 min drive away from RIT
WEBSITE →
RIT Inn and Conference Center
5257 W. Henrietta Rd
12 min drive away from RIT
WEBSITE →
DoubleTree Hilton
1111 Jefferson Rd
8 min drive away from RIT
WEBSITE →
Homewood Suites
2095 Hylan Drive
8 min drive away from RIT
WEBSITE →
Hampton Inn
280 Clay Rd
7 min drive away from RIT
WEBSITE →
Best Western
940 Jefferson Rd
7 min drive away from RIT
WEBSITE →
Couch Surfing
If you’re on a budget, many of our volunteers are happy to offer their places for temporary stay. To apply, message us through the site or email us at<EMAIL_ADDRESS>Do so soon! Space is limited.


SoundSniffer
Shazam for SoundCloud and YouTube.
Just put the link and time and it tells you the name of the song.
Youtube links and long soundcloud tracks can take 1-2 minutes... consequent request on same song are fast.
Experimental, no guarantee. Track recognition service: acrcloud.com


Hi
Sorry if this is a newb question. I'm looking at the best way to get a completely new OpenEnergyMonitor setup, and I think I'd like to go for the NanodeRF option for the base station, rather than a full-blown Raspberry Pi. So data will be sent directly to emonCMS.
If I do this, will I still be able to use the emonGLCD to display data, or does that rely on having a local Raspberry Pi base station with an HD to store the data?
Thanks in advance!
Tom
Re: Will the emonGLCD work with the NanodeRF base station
Yes. But you can still use the RPi as a 'forwarding only' base if you wish without running emonCMS on it and without using local storage for your energy data.
Re: Will the emonGLCD work with the NanodeRF base station
Great - thanks. That makes sense... I think I'll probably opt for the nanode, because its power consumption is lower and it works out a bit cheaper to buy... And using an externally-hosted emonCMS sounds like a good way to do it for starters. I'm guessing that the emonGLCD talks to emonCMS to get the data to display... Or is it actually just talking to the base station to show realtime info?
I might then add a RPi later on, to run emonCMS locally - sounds like that's a good thing to do long-term.
Tom
Re: Will the emonGLCD work with the NanodeRF base station
With my system I measure data using three different emonTX units each working on different channels. I use a Nanode RF SMT to poll all incoming data and transfer it directly to the emoncms web site where I display my data using a dashboard that I have created using the tools available.
at the same time I also have an emon GLCD display polling the wireless traffic and extracting data directly from the channel where the main emonTX is generating data (its the unit measuring the consumed and solar power and temperatures). In effect the GLCD is running in tandem with the Nanode as it never tries to read anything that the Nanode transmits (all transmission being cabled Ethernet anyway).
there will be an occasional data collision but enough data is being read by the Nanode and the GLCD, listening to just a single channel picks up pretty well every packet ever sent.
Hope this helps rather than confuses you!
Re: Will the emonGLCD work with the NanodeRF base station
Just to reinforce what Series530 says - (almost) no data comes back from emonCMS. The GLCD gets the time from emonCMS, but it gets all the rest of its data by radio from the emonTx(s).
Re: Will the emonGLCD work with the NanodeRF base station
Very true Robert. I had forgotten about the time function - most likely because I make no use of it in my sketches.
My GLCD tends to act as a pretty dumb display device because the spare memory available once even a basic sketch is added is pretty finite. It's always a trade off in functionality as a consequence. I find that displaying sensor data is more useful than time information. My main processing unit is emoncms and anything affected by time is done on there and shown on the web page instead.
Re: Will the emonGLCD work with the NanodeRF base station
Thanks Ian and Robert - that's much clearer now! So EmonGLCD is more of a realtime display, gleaning info from the EmonTX transmissions and displaying whatever the latest reading is. That sounds good - I'll probably go for a single EmonTX (which I'm building using an existing Arduino and the EmonTX shield), and then a Nanode, and maybe add the EmonGLCD later on... Or perhaps even just use EmonCMS as the main "display" within a web browser and not both with the EmonGLCD just yet. Looking forward to getting up and running with it all, anyway!
Thanks for all the help and info :-)
Tom


Variables
Const ALIAS_DESCRIPTION
ALIAS_DESCRIPTION: unique symbol = Symbol.for('alias_description')
Const ARRAY_SEPARATOR
ARRAY_SEPARATOR: "," = ","
Const ARRAY_TO_DOT_NOTATION_REGEX
ARRAY_TO_DOT_NOTATION_REGEX: RegExp = /\[(\d+)\]/g
Const CONFIGURABLE_KEY
CONFIGURABLE_KEY: "configurable" = "configurable"
Const CONSUMES_KEY
CONSUMES_KEY: "consumes" = "consumes"
Const CORE
CORE: unique symbol = Symbol.for('storfront_core_service')
Const DEFAULT_VARIANT_FIELD
DEFAULT_VARIANT_FIELD: "variants" = "variants"
Const ESCAPE_CHAR
ESCAPE_CHAR: "\" = "\"
Const GBI
GBI: "gbi" = "gbi"
Const GBI_EXPERIENCE
GBI_EXPERIENCE: "gbi_experience" = "gbi_experience"
Const GBI_METADATA
GBI_METADATA: GbTracker.Metadata[] = [{key: GBI,value: 'true'},{key: GBI_EXPERIENCE,value: 'storefront'}]
Const GLOBALS
GLOBALS: object = (typeof global === 'undefined' ? window : global) || {}
Const LOG_PHASES
LOG_PHASES: string[] = [Phase.INITIALIZE,Phase.BEFORE_MOUNT,Phase.MOUNT,Phase.UPDATE,Phase.UPDATED,Phase.BEFORE_UNMOUNT,Phase.UNMOUNT,]
Const LOG_STYLE
LOG_STYLE: "font-weight: bold" = "font-weight: bold"
Const ORIGIN_KEY
ORIGIN_KEY: "origin" = "origin"
Const PAIR_SEPARATOR
PAIR_SEPARATOR: ":" = ":"
Const PROVIDES_KEY
PROVIDES_KEY: "provides" = "provides"
Const RANGE_SEPARATOR
RANGE_SEPARATOR: ".." = ".."
Const RE_RENDER_MESSAGE
RE_RENDER_MESSAGE: "%ctag is preparing to re-render:" = "%ctag is preparing to re-render:"
Const RIOT
RIOT: unique symbol = Symbol.for('storefront_riot_instance')
Const SEPARATORS
SEPARATORS: string[] = [RANGE_SEPARATOR, ARRAY_SEPARATOR, PAIR_SEPARATOR]
Const STORAGE_KEY
STORAGE_KEY: string = "gb-previous-search-terms"
Const STYLISH_CLASS
STYLISH_CLASS: "gb-stylish" = "gb-stylish"
Const STYLISH_CLASS
STYLISH_CLASS: "gb-stylish" = "gb-stylish"
Const SUGAR_EVENTS
SUGAR_EVENTS: string[] = [Phase.BEFORE_MOUNT,Phase.MOUNT,Phase.UPDATE,Phase.UPDATED,Phase.BEFORE_UNMOUNT,Phase.UNMOUNT,]
Const TAGS
TAGS: unique symbol = Symbol.for('storefront_tags')
Const TAG_DESC
TAG_DESC: unique symbol = Symbol.for('tag_description')
Const TAG_META
TAG_META: unique symbol = Symbol.for('tag_metadata')
Const TRACKER_EVENT
TRACKER_EVENT: "tracker:send_event" = "tracker:send_event"
Const UI_CLASS
UI_CLASS: "gb-ui" = "gb-ui"
Const UI_CLASS
UI_CLASS: "gb-ui" = "gb-ui"
StoreFront Core
Getting Started
StoreFront's core module can be used to start an instance of StoreFront, mount tags to the DOM and register custom tags. It also contains a number of useful abstractions for the development of custom tags.
Prerequisites
This module is meant to be used in a
node
environment which is bundled for use in the browser.Installing
Use
npm
oryarn
to install in anode
project that useswebpack
,browserify
or similar.npm install --save @storefront/core # or yarn add @storefront/core
Usage
This module can be used both to start an entire StoreFront application, or to create a new component that registers with your application.
Start StoreFront
import StoreFront from '@storefront/core';
// start a StoreFront application const app = new StoreFront({ /* config */ });
// mount a component StoreFront.mount('gb-query'); // or app.mount('gb-query');
Configuration
customerId
: The only required configuration that must be passed to start a StoreFront instanceThe rest of the configuration can be found in the generated API reference.
Use with Webpack
The current minimal webpack configuration to load components from
@storefront
npm packages and link them with @storefront/core.// app.js var StoreFront = require('@storefront/core').default; require('@storefront/structure'); require('@storefront/query');
new StoreFront({ customerId: 'myCustomer' }).mount('*');
// webpack.config.js module.exports = { entry: './app', module: { rules: [{ test: /\.html$/, loader: 'html-loader' }, { test: /\.css$/, use: [ 'to-string-loader', 'css-loader' ] }] } };
Register custom component
Although the supplied development tools do not require ES2015+ to function, the examples will show them with that syntax for cleanliness
import { tag } from '@storefront/core';
const template = '
{ someContent }
'; // or if storing in separate file const template = require('./my-component.html');
@tag('my-component', template) class MyComponent {
init() { this.someContent = 'hello world!'; } }
Building the package
To build an individual package, run the following command:
yarn build
To build an individual package in response to changes within the
src
directory, run the following command:yarn dev
Running tests
To test an individual packages, run the following command:
yarn test
To test an individual package in response to changes within the
src
andtest
directories, run the following command:yarn tdd
Linting
To lint a package, run the following command:
yarn lint
To programmatically fix lint errors within a package, run the following command:
yarn lint:fix
Contributing
Read the contributing file to learn about how to contribute to the StoreFront project.
License
StoreFront and its related packages are MIT licensed.
Upgrade
Upgrade to version 1.40.0
In order to address issues with performance stemming from using aliases to render deeply nested and complex components, a number of changes have been made to that system and components which use it.
The major conceptual change to the way the system works brings it more inline with the
<Provider>
/<Consumer>
pattern used inReact
's Context API and the language has been changed to match (both for future clarity and to ensure incompatibility with the previous inefficient alias system).Summary:
@alias(aliasName: string)
->@provide(aliasName: string, resolver?: (props, state, aliases) => any)
tag.expose(aliasName: string)
->tag.provide(aliasName: string, resolver?: (props, state, aliases) => any)
@consume(aliasName: string)
tag.consume(aliasName: string)
_consumes
custom component attribute_props
custom component attribute<consume>
custom component<provide>
custom componentitem-props
<gb-list> prop"state-finalized"
tag lifecycle event"recalculate-props"
tag lifecycle event"props-updated"
tag lifecycle event@provide
decoratorThe
@alias
decorator has been removed in preference for the new@provide
decorator.By default, both decorators will register an alias under the name provided and the value will be the
state
of the component.${version} <= v1.39.X
import { alias } from '@storefront/core';
// in TypeScript @alias('myComponent') class MyComponent { state = { myValue: 'Hello, world!' }; }
// or in ES6 @alias('myComponent') class MyComponent { constructor() { this.state = { myValue: 'Hello, world!' }; } }
 { $myComponent.myValue }  <custom-component> { $myComponent.myValue } </custom-component>
 Hello, world!
${version} >= v1.40.0
import { provide } from '@storefront/core';
// in TypeScript @provide('myComponent') class MyComponent { state = { myValue: 'Hello, world!' }; }
// or in ES6 @provide('myComponent') class MyComponent { constructor() { this.state = { myValue: 'Hello, world!' }; } }
Notice that the
@alias
decorator has been replaced with a@provide
decorator which, when provided only a single parameter, works the exact same way as the@alias
decorator.  { $myComponent.myValue }   <custom-component _consumes="myComponent"> { $myComponent.myValue } </custom-component>
Two changes are made to the "consuming" component:
data-is="gb-container"
_consumes
attribute is added which declares the alias dependencies of the associated component scope Hello, world!
alias resolver
In order to allow aliases to change based on the state of the providing component, the passed either using the
@provide
decorator or thetag.provide()
method must be a function with the following signature:function (props: object, state: object, aliases: object) { return 'my value'; }
This function is called with the
props
,state
andaliases
of the providing component every time a new value is required by a consuming component.@consume()
decoratorWhen creating components using a class, the
@consume()
decorator can be used to statically declare a dependency on an alias. This is similar to using the_consumes
attribute on that component within a template or callingthis.consume()
within that component'sinit()
method.${version} <= v1.39.0
class CustomComponent {}
 { $myAlias }
${version} >= v1.40.0
@consumes('myAlias') class CustomComponent {}
 { $myAlias }
Note: The important change here is that only components that explicitly "consume" an alias will be able to access the alias value within their template. Because riot's scope is tied only to the direct ancestor component this may mean that a complex component with multiple accesses to an alias may need to be re-thought so that only a single "consumer" is used and then distributed by passing to child components as props or accessing from nested templates using
tag.parent
(also sparingly).${version} <= v1.39.0
 <inner-component><yield/></inner-component>
 <inner-component><yield/></inner-component>
 <app> <some-component> <inner-component someProp="
{ $x }"> This is my innermost content: "{ $y }" </inner-component> </some-component> </app>
${version} >= v1.40.0
 <inner-component><yield/></inner-component>
 <inner-component>
{ props.someProp } <yield/> </inner-component>
 <app> <some-component _consumes="x,y"> <inner-component some-prop="
{ $x }">  This is my innermost content: "{ $y }" </inner-component>  </some-component> </app>
 <app> <some-component consumes="x"> <inner-component some-prop="
{ $x }" consumes="y"> This is my innermost content: "{ $y }" </inner-component> </some-component> </app>
 <app> <some-component _consumes="x,y"> <inner-component some-prop="
{ $x }"> This is my innermost content: "{ parent.$y }" </inner-component> </some-component> </app>
tag.provide()
andtag.consume()
These methods can be called from within the component's
init()
method only to provide and consume aliases.class MyComponent { init() { this.consume('parentAlias'); this.provide('myAlias', ({ label }, { currentValue }) => ({ label, currentValue })); // note that aliases passed to the resolver do not include the dollar sign ($) prefix this.provide('other', (props, state, { parentAlias }) => ({ label, currentValue, ...parentAlias })); }
onBeforeMount() { // this will throw an exception if called outside of the
init()
method this.provide('myAlias', ({ label }, { currentValue }) => ({ label, currentValue })); } }class NestedComponent { init() { this.consume('myAlias'); } onBeforeMount() { // this will throw an exception if called outside of the `init()` method this.consume('myAlias'); } }
_consumes
custom component attributeThis attribute marks a component as a consumer of one or multiple aliases.
 <gb-button _consumes="someAlias">{ $someAlias }</gb-button>
 <gb-button _consumes="someAlias,otherAlias">
{ $someAlias } and { $otherAlias }</gb-button>_props
custom component attributeIn lieu of being able to spread props onto a component (such as in JSX) the
_props
attribute has been added. The object passed will be spread as the props of the component and are overridden by any explicitly passed props. <simple-tag _props="{{ a: 'b', c: 'd', e: 'f' }}"></simple-tag>
 <simple-tag c="d2" _props="
{{ a: 'b', c: 'd', e: 'f' }}"></simple-tag> <consume>
and<provide>
These components have been added to allow for declarative aliasing but are still rough around the edges as they still introduce a scope and a custom tag into the DOM.
For now, the most useful pattern is to use the
data-is
property on a<virtual>
tag in order to avoid the additional DOM node.<outer-component> <virtual data-is="provide" data="{ someData }" as="someAlias"> <inner-component> <virtual data-is="consume" alias="someAlias"> <child-component>{ $someAlias }</child-component> </virtual> </inner-component> </virtual> </outer-component>
 <outer-component> <virtual data-is="provide" data="
{ someData }" as="someAlias"> <inner-component> <child-component _consumes="someAlias">{ $someAlias }</child-component> </inner-component> </virtual> </outer-component> <virtual data-is="consume" aliases="firstAlias,secondAlias">
{ ... } </virtual> <virtual data-is="provide" data="
{ someData }" as="firstAlias"> <virtual data-is="provide" data="{ otherData }" as="secondAlias"> { ... } </virtual> </virtual><gb-list>
item-props
attributeIn order to provide props directly to the
<gb-list-item>
components within<gb-list>
theitem-props
attribute has been added. This props is passed into the_props
prop of the<gb-list-item>
tags.<gb-list items="{ [1, 2, 3] }" item-props="{{ a: 'b' }}"> { props.a } { item } </gb-list>

b 1

b 2

b 3

Upgrade to version 1.39.1
In order to address memory usage concerns a new utility method has been added to tag instances which automates the cleanup of
flux
event listeners when the tag is unmounted.${version} <= v1.39.0
class MyComponent { init() { this.flux.on('some_event', this.eventHandler); // usually no cleanup necessary (only executes once) this.flux.one('some_event', this.eventHandler); }
onUnmount() { this.flux.off('some_event', this.eventHandler); } }
${version} >= v1.39.1
class MyComponent { init() { // automatically removed on "unmount" this.subscribe('some_event', this.eventHandler); // alias for this.flux.one() this.subscribeOnce('some_event', this.eventHandler); } }


--- layout: page title: "Ugma - A Javascript Framework" description: "This will be something you want like, and probably hate, but it will let you build everything in 5 minutes with a small amount of code." --- {% include JB/setup %} {% for post in site.posts %} {% if post.tags contains 'Ugma' %}


Need to meet with one of our helpful associates? Pick your day and time and we will be there with a helping hand.


{% extends "base.html" %} {% block content %}
Any number of Assets can be uploaded at a time.
Separate tags with a space. i.e. here are some tags
Entering a Collection name, will make a new collection and append this assets to it.


The properties file
is a collection of key,value pairs of the form key=value1,value2,...
Property files may reference other properties. For example:
prop1=a,b,c,d,e
prop2=${prop1},f,g,h
The properties file can be placed anywhere on the file-system that Jenkins can access.
This property file has different meaning for multi-level select -- see the parameter type help for more info.


/*- * Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#) $Header: /tcpdump/master/libpcap/pcap/vlan.h,v <IP_ADDRESS> 2008-08-06 07:45:59 guy Exp $ */ #ifndef lib_pcap_vlan_h #define lib_pcap_vlan_h struct vlan_tag { u_int16_t vlan_tpid; /* ETH_P_8021Q */ u_int16_t vlan_tci; /* VLAN TCI */ }; #define VLAN_TAG_LEN 4 #endif


What's my gun worth?
What condition is it in?
About 15% less than the lowest advertised price on the Internet.
About 30% less than the lowest advertised price on the Internet.
Whatever you can get for it.
Then its probably worth less. Take all that stuff off and sell it as close to stock as possible. No one cares what you paid in total. Also, holsters are worthless.


faction 31 include/character-status.h Faction_Type faction; faction 23 src/character-status.c access->faction = from->faction; faction 67 src/character-status.c return access->faction; faction 71 src/character-status.c access->faction = RELATION_ALLY; faction 75 src/character-status.c access->faction = RELATION_ENEMY; faction 79 src/character-status.c access->faction = RELATION_NEUTRAL;


A phenotype is an observable characteristic or trait of an organism, like the color of a flower or the shape of an ear.
A genotype is a specific variation of a gene that encodes a phenotype, such a gene that encodes eye color or height. Genes are found on chromosomes and encoded in patterns on the DNA molecule. That DNA pattern is copied and used to make proteins by a suite of RNA molecules in the cell. In this way, changes in the DNA pattern that make up our specific genotype affect the proteins that cells make and result in an observable phenotype, like blue eyes or short stature.
A cyberinfrastructure is a combination of software platforms, tools, and datasets; storage and compute hardware; and people who provide training and support


EXO "The first snow" trends and re-enters charts as the first snow falls in South Korea
by KkkpopvvvYes, it's that time of the year! Winter comes and the first snow falls as we get closer to Christmas. As usual, during this time of the year, for many its, the time to bring out their EXO winter special albums(which like all EXO albums regular and special has part of its profit donated to Unicef).
So for many, this might not come to a surprise as this article is about no doubt one of the best EXO winter songs called "The first snow" which trends and re-enters the charts already 6 years in a row when the first snow falls in South Korea.
The song is part of their 2013 winter special album "Miracles in December" which had "Christmas day" and "Miracles in December" as its singles. Of course, that did not stop the song from being at the top of the charts or re-entering the charts every year as it became so special to many people. This year not only did the song re-enter the charts and trended but it took all of the top places on Melons search along with EXO and their hit song "Love Shot". The song is produced by Kenzie who also is part of the team that worked on EXOs' new album "Obsession" that is comming out on the 27th of November.
If you haven't heard this amazing winter song yet, the link is down below.


Profiles:
DISA STIG for Oracle Linux 7 in xccdf_org.ssgproject.content_benchmark_OL-7
,
PCI-DSS v3 Control Baseline Draft for Oracle Linux 7 in xccdf_org.ssgproject.content_benchmark_OL-7
,
Security Profile of Oracle Linux 7 for SAP in xccdf_org.ssgproject.content_benchmark_OL-7
,
Standard System Security Profile for Oracle Linux 7 in xccdf_org.ssgproject.content_benchmark_OL-7
,
(default) in xccdf_org.ssgproject.content_benchmark_OL-7
Profile:
DISA STIG for Oracle Linux 7
PCI-DSS v3 Control Baseline Draft for Oracle Linux 7
Security Profile of Oracle Linux 7 for SAP
Standard System Security Profile for Oracle Linux 7
(default)
select a profile to display its guide and a command line snippet needed to use it


{% extends "juakstore/base.html" %} {% load juakstore_extras %} {% block content %}
Warning: this booking has a conflict{% endif %}
Fill out the following form to fill a booking request. We shall contact you once the booking request has been confirmed. Please take a look at the description of different rooms available to help you make your choices.


CodeSchool
Application
Take your time to fill this form
Name
Email
Age
Programming Level:
Beginner
Intermidiate
Advanced
Employment status:
Employed
Unemployed
Prefer not to say
Additional course you want?
Data analytics
Data science
Machine learning
Choose at least one course:
Font-end Development
Back-end Development
DevOps
Any Comments or Suggestions?


The purpose of this calculator is to determine if production of an item is profitable, and to find the cheapest possible way of producing that item.
Tip: Log in and provide the 'read blueprints' scope to use your blueprints in the calculations.
Note: This calculator does not factor in Structure Rigs or the Structure Role Bonus of Engineering Complexes because this information is not available to external applications.
This means the actual profit of production can differ a few percent from the value shown here.
The materials required for production of this item are more valuable than the finished product.
Producing this item will yield {{ profit | number: '1.2-2' }} ISK ({{ profitPercentage | number : '1.0-0' }} %) profits.
Price of materials: {{ chain.materialPrice | number: '1.2-2' }} ISK
Industry cost: {{chain.totalIndustryCost | number: '1.2-2' }} ISK
Item sell price: {{ chain.price | number: '1.2-2' }} ISK
{{ getName(item.type_id) }} ( -{{ item.material_efficiency }}% )
{{ item.quantity | number:'1.0-0' }} x {{ item.product.name }} ({{ item.price | number : '0.2-2'}} ISK)
Standing by...
{{ message }}


Strategic Dashboard View
SI No.
Account Name
SBU
IBG
FTE
Total Projects
RAG
Overall RAG
Governance/Commercial
Engineering
Customer
Compliance
People
{{data.sr_no}}
{{data.account_name}}
{{data.SBU}}
{{data.IBG}}
{{data.FTE}}
{{data.total_projects}}


Tests that notifications can be displayed when permission has been granted. The text "notification.onshow fired" should be displayed. When running this test manually, accept the permission request.


The three most widely available millets in the market place today:-
Processing these for human consumption is essentially a matter of cleaning and grading the grains.
They are then ground up to either their flour form or into grits making them ready for cooking.
This ease of processing is one of the reasons for these grains to persist in the local communities' diets.
There are six other commonly cultivated millets - Foxtail, Little, Kodo, Proso, Barnyard, and Brown Top -
that have a hard cellulosic husk layer that humans cannot digest.
Together they are sometimes referred to as small millets.
The removal of the husk layer thus becomes the primary task of processing these grains.
Once removed, we get the respective millets' rice, i.e.
foxtail millet rice, little millet rice, kodo millet rice, proso millet rice, barnyard millet rice and brown top millet rice.
These millet rices are then used in preparations in the same form and method that paddy rice is used in different cuisines.
To remove the husk from the grain, one can use two forces - impact or shear.
A stone grinding mill- manual or motor powered-employs shear force
while manual pounding or centrifugal hulling machines use impact force.
Large scale processing of small millets compromises the nutritional value of the millet rice output
by removing the bran layer completely.
But the pest infestation problem continues to be severe
and most processors resort to chemical methods of cleaning their products pest free.


 – Lady Gaga
Lady Gaga and Starbucks share a mission: to build a kinder, braver world. Through the Born This Way Foundation, Lady Gaga has inspired her fans to embrace kindness in their communities—online and in the world. With your help, we can empower young people to spread more kindness.
learn more


Packed with Apache™OpenNLP Engine, GoogleTranslate™ and Hadoop™ powered data indexing warehouse. As a result, View of Kepler provides you the fastest searching experience years ahead of industry
Supporting any higher than iOS 6. Suppoting Iphone 4, 4s, 5, 5s,6 and 6plus. Ipad, Ipad mini, Ipad Air, Ipad Air 2. Specially optimized for Retina display
Diarrhea diagnoser as part of Kepler diagnoser projects, built and complied as an iOS application, is under Apache software copyright, which is purely open source. Learn more at my github #aertoria
When diarrhea happens to you, DiarrheaDiagnoser gives you information whether you may stay at home to see if it gets better OR you need to see doctor right away. Diarrhea accounts for 1.5 Million outpatient visits every year in States but many of them is self-diagnosable and self-curable. If you have some basic information available, such as the position of abdominal pain and stool volume, DiarrheaDiagnoser can list most common risks that fit your symptoms and give you some basic advices correspondingly. On the other hand, diarrhea can be life threating. DiarrheaDiagnoser also build in a module to capture the sign of some common lethal diseases at their early stages such as chorale and food poisoning. Please be advised that DiarrheaDiagnoser is not a clinical diagnosis alternative, reliance on the information provided by DiarrheaDiagnoser will be at your own risk.
DiarrheaDiagnoser is a free-of-charge application. DiarrheaDiagnoser will not collect nor track any user's information. Also, Diarrhea Diagnoser is an 100% open source project. We welcome and encourage more developer to jump in and contribute.


Survey Questions
About You
Name (Required)
Link to Photo Image (Required)
Question 1
Your mind is always buzzing with unexplored ideas and plans.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
Question 2
Generally speaking, you rely more on your experience than your imagination.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
Question 3
You find it easy to stay relaxed and focused even when there is some pressure.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
Question 4
You rarely do something just out of sheer curiosity.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
.
Question 5
People can rarely upset you.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
Question 6
It is often difficult for you to relate to other people’s feelings.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
Question 7
In a discussion, truth should be more important than people’s sensitivities.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
Question 8
You rarely get carried away by fantasies and ideas.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
Question 9
You think that everyone’s views should be respected regardless of whether they are supported by factsor not.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
Question 10
You feel more energetic after spending time with a group of people.
Select an option
1 (strongly disagree)
2
3
4
5 (strongly agree)
Find your match!
×


The Library holds book information that has been inputted by anyone. The
books submitted will always be here, along with Google search links with
further information about each novel. Feel free to add your own books with
the form above.
F.A.Q. Want to add a book? Use the form above to input your book's
information. Please make sure the title is correct. When you click
submit, your book will be added to The Library. Please wait a few
seconds before refreshing the page after adding new content.
Already read a book? Tell us about it! Click on the "I've Read
This!" button on any book you've already read to add your number to the
growing tally.
See a mistake? Click on the edit button on the top right of each
card. The form above will fill with the provided information. You can
change anything from there. Please wait a few seconds before refreshing
the page after editing content.
Found spam? Books can be deleted by clicking on the X button on
the top left of each card. Be careful! Once you click that button, the
book is deleted forever (until someone adds it back to The Library).
Found a bug? If you've found something wrong with the app or have
an idea for new/better features, feel free to submit your issues here.
Interested in how this was made? You can find more techincal
information about this app here.


How long should you self isolate for?
You should self-isolate for at least 10 days.
You may need to self-isolate for more than 10 days if you get symptoms while self-isolating or your symptoms do not go away.
Page last reviewed: 21 December 2020
Next review due: 21 December 2020


SUBROUTINE CGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK, $ INFO ) * * -- LAPACK routine (version 3.1) -- * Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. * November 2006 * * .. Scalar Arguments .. INTEGER INFO, LDA, LWORK, M, N * .. * .. Array Arguments .. REAL D( * ), E( * ) COMPLEX A( LDA, * ), TAUP( * ), TAUQ( * ), $ WORK( * ) * .. * * Purpose * ======= * * CGEBRD reduces a general complex M-by-N matrix A to upper or lower * bidiagonal form B by a unitary transformation: Q**H * A * P = B. * * If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. * * Arguments * ========= * * M (input) INTEGER * The number of rows in the matrix A. M >= 0. * * N (input) INTEGER * The number of columns in the matrix A. N >= 0. * * A (input/output) COMPLEX array, dimension (LDA,N) * On entry, the M-by-N general matrix to be reduced. * On exit, * if m >= n, the diagonal and the first superdiagonal are * overwritten with the upper bidiagonal matrix B; the * elements below the diagonal, with the array TAUQ, represent * the unitary matrix Q as a product of elementary * reflectors, and the elements above the first superdiagonal, * with the array TAUP, represent the unitary matrix P as * a product of elementary reflectors; * if m < n, the diagonal and the first subdiagonal are * overwritten with the lower bidiagonal matrix B; the * elements below the first subdiagonal, with the array TAUQ, * represent the unitary matrix Q as a product of * elementary reflectors, and the elements above the diagonal, * with the array TAUP, represent the unitary matrix P as * a product of elementary reflectors. * See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * D (output) REAL array, dimension (min(M,N)) * The diagonal elements of the bidiagonal matrix B: * D(i) = A(i,i). * * E (output) REAL array, dimension (min(M,N)-1) * The off-diagonal elements of the bidiagonal matrix B: * if m >= n, E(i) = A(i,i+1) for i = 1,2,...,n-1; * if m < n, E(i) = A(i+1,i) for i = 1,2,...,m-1. * * TAUQ (output) COMPLEX array dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the unitary matrix Q. See Further Details. * * TAUP (output) COMPLEX array, dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the unitary matrix P. See Further Details. * * WORK (workspace/output) COMPLEX array, dimension (MAX(1,LWORK)) * On exit, if INFO = 0, WORK(1) returns the optimal LWORK. * * LWORK (input) INTEGER * The length of the array WORK. LWORK >= max(1,M,N). * For optimum performance LWORK >= (M+N)*NB, where NB * is the optimal blocksize. * * If LWORK = -1, then a workspace query is assumed; the routine * only calculates the optimal size of the WORK array, returns * this value as the first entry of the WORK array, and no error * message related to LWORK is issued by XERBLA. * * INFO (output) INTEGER * = 0: successful exit. * < 0: if INFO = -i, the i-th argument had an illegal value. * * Further Details * =============== * * The matrices Q and P are represented as products of elementary * reflectors: * * If m >= n, * * Q = H(1) H(2) . . . H(n) and P = G(1) G(2) . . . G(n-1) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are complex scalars, and v and u are complex * vectors; v(1:i-1) = 0, v(i) = 1, and v(i+1:m) is stored on exit in * A(i+1:m,i); u(1:i) = 0, u(i+1) = 1, and u(i+2:n) is stored on exit in * A(i,i+2:n); tauq is stored in TAUQ(i) and taup in TAUP(i). * * If m < n, * * Q = H(1) H(2) . . . H(m-1) and P = G(1) G(2) . . . G(m) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are complex scalars, and v and u are complex * vectors; v(1:i) = 0, v(i+1) = 1, and v(i+2:m) is stored on exit in * A(i+2:m,i); u(1:i-1) = 0, u(i) = 1, and u(i+1:n) is stored on exit in * A(i,i+1:n); tauq is stored in TAUQ(i) and taup in TAUP(i). * * The contents of A on exit are illustrated by the following examples: * * m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n): * * ( d e u1 u1 u1 ) ( d u1 u1 u1 u1 u1 ) * ( v1 d e u2 u2 ) ( e d u2 u2 u2 u2 ) * ( v1 v2 d e u3 ) ( v1 e d u3 u3 u3 ) * ( v1 v2 v3 d e ) ( v1 v2 e d u4 u4 ) * ( v1 v2 v3 v4 d ) ( v1 v2 v3 e d u5 ) * ( v1 v2 v3 v4 v5 ) * * where d and e denote diagonal and off-diagonal elements of B, vi * denotes an element of the vector defining H(i), and ui an element of * the vector defining G(i). * * ===================================================================== * * .. Parameters .. COMPLEX ONE PARAMETER ( ONE = ( 1.0E+0, 0.0E+0 ) ) * .. * .. Local Scalars .. LOGICAL LQUERY INTEGER I, IINFO, J, LDWRKX, LDWRKY, LWKOPT, MINMN, NB, $ NBMIN, NX REAL WS * .. * .. External Subroutines .. EXTERNAL CGEBD2, CGEMM, CLABRD, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN, REAL * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 NB = MAX( 1, ILAENV( 1, 'CGEBRD', ' ', M, N, -1, -1 ) ) LWKOPT = ( M+N )*NB WORK( 1 ) = REAL( LWKOPT ) LQUERY = ( LWORK.EQ.-1 ) IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 ELSE IF( LWORK.LT.MAX( 1, M, N ) .AND. .NOT.LQUERY ) THEN INFO = -10 END IF IF( INFO.LT.0 ) THEN CALL XERBLA( 'CGEBRD', -INFO ) RETURN ELSE IF( LQUERY ) THEN RETURN END IF * * Quick return if possible * MINMN = MIN( M, N ) IF( MINMN.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * WS = MAX( M, N ) LDWRKX = M LDWRKY = N * IF( NB.GT.1 .AND. NB.LT.MINMN ) THEN * * Set the crossover point NX. * NX = MAX( NB, ILAENV( 3, 'CGEBRD', ' ', M, N, -1, -1 ) ) * * Determine when to switch from blocked to unblocked code. * IF( NX.LT.MINMN ) THEN WS = ( M+N )*NB IF( LWORK.LT.WS ) THEN * * Not enough work space for the optimal NB, consider using * a smaller block size. * NBMIN = ILAENV( 2, 'CGEBRD', ' ', M, N, -1, -1 ) IF( LWORK.GE.( M+N )*NBMIN ) THEN NB = LWORK / ( M+N ) ELSE NB = 1 NX = MINMN END IF END IF END IF ELSE NX = MINMN END IF * DO 30 I = 1, MINMN - NX, NB * * Reduce rows and columns i:i+ib-1 to bidiagonal form and return * the matrices X and Y which are needed to update the unreduced * part of the matrix * CALL CLABRD( M-I+1, N-I+1, NB, A( I, I ), LDA, D( I ), E( I ), $ TAUQ( I ), TAUP( I ), WORK, LDWRKX, $ WORK( LDWRKX*NB+1 ), LDWRKY ) * * Update the trailing submatrix A(i+ib:m,i+ib:n), using * an update of the form A := A - V*Y' - X*U' * CALL CGEMM( 'No transpose', 'Conjugate transpose', M-I-NB+1, $ N-I-NB+1, NB, -ONE, A( I+NB, I ), LDA, $ WORK( LDWRKX*NB+NB+1 ), LDWRKY, ONE, $ A( I+NB, I+NB ), LDA ) CALL CGEMM( 'No transpose', 'No transpose', M-I-NB+1, N-I-NB+1, $ NB, -ONE, WORK( NB+1 ), LDWRKX, A( I, I+NB ), LDA, $ ONE, A( I+NB, I+NB ), LDA ) * * Copy diagonal and off-diagonal elements of B back into A * IF( M.GE.N ) THEN DO 10 J = I, I + NB - 1 A( J, J ) = D( J ) A( J, J+1 ) = E( J ) 10 CONTINUE ELSE DO 20 J = I, I + NB - 1 A( J, J ) = D( J ) A( J+1, J ) = E( J ) 20 CONTINUE END IF 30 CONTINUE * * Use unblocked code to reduce the remainder of the matrix * CALL CGEBD2( M-I+1, N-I+1, A( I, I ), LDA, D( I ), E( I ), $ TAUQ( I ), TAUP( I ), WORK, IINFO ) WORK( 1 ) = WS RETURN * * End of CGEBRD * END


{% extends TEMPLATE_FOLDER+"/inc/layout_case.html" %} {% block case_content %} {# this is a macro: pass the name of the selected item and the number for the url. Code in inc/layout_case.html #} {{ case_tabs("timeline",1) }}
03:37pm - 6th June 2017
Olivers employer have agreed to the cost share
09:36am - 6th June 2017
Spoke to Oliver employer and agreed on sending cost share
05:00pm - 5th June 2017
Spoke to customer and agreed for information gather
09:12am - 5th June 2017


Collection of React components using the UIkit CSS framework.
Create layouts fast with grid widths built into every component.
No need to import a whole library to use a few components.
Designed with data collections in mind. Simply pass JSON and let the component do the rest.
Quiclky create your own componets which inherit all the utility classes from UIkit.
Easily add custom animations using 3rd party animation libraries.
A lightweight and modular front-end framework for developing fast and powerful web interfaces


Method of DispositionBurialCremationCremation and BurialCremation and EntombCremation and Removed From StateDonationDonation and BurialEntombmentPrivate BurialPrivate CremationRemoval From StateUnknownOtherCrematoryCemetery or Final DispositionFuneral Home DirectorCertifying Physician's Name


---
layout: post
title: "Course Projects"
background: "/img/projects/pexels-startup-stock-photos-7376.jpg"
---
This is a partial listing of some of my course projects.
- Software Engineering: Selected as the winning application by the course client for a web-based travel app built in Java.
- Artificial Intelligence: Created the smartest agent in an adversarial maze-based game.
- Computer and Network Security: One of the top students on the class CTF leaderboard. Completed optional assignment implementing the Needham-Schroeder protocol in Python.
- Computer Graphics: Completed advanced optional features for ray and path tracer projects.


Text with Jack
A Dashboard by Choe Choon Ho and Wong Tiong Kiat
View Dashboard Overview In Fullscreen
Sentiment Distribution
View Bar Chart in Fullscreen
Word Frequency
View Word Cloud in Fullscreen
Subject Frequency
View Bubble Chart in Fullscreen
Subject Description
View Word Tree in Fullscreen
Sentiment Distribution
Word Frequency
Subject Frequency
Subject Description


{% extends 'base.html' %} {% block title %} StatusAudio {% endblock %} {% block content %}
"I was blown away by the quality"
"Might be the best headphones under $100"
Premium sound and minimalist cool at a category-defining price point. For music lovers who are ready to feel the difference.


Here you can find some of the apps/games I have implemented on my free time. The oldest games dates back to the days I started programming.


|
| void * | superlu_malloc (size_t size) |
| |
| void | superlu_free (void *addr) |
| |
| void | SetIWork (int m, int n, int panel_size, int *iworkptr, int **segrep, int **parent, int **xplore, int **repfnz, int **panel_lsub, int **xprune, int **marker) |
| | Set up pointers for integer working arrays. More...
|
| |
| void | copy_mem_int (int howmany, void *old, void *new) |
| |
| void | user_bcopy (char *src, char *dest, int bytes) |
| |
| int * | intMalloc (int n) |
| |
| int * | intCalloc (int n) |
| |
Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)
All rights reserved.
The source code is distributed under BSD license, see the file License.txt at the top-level directory.
– SuperLU routine (version 2.0) –
Univ. of California Berkeley, Xerox Palo Alto Research Center,
and Lawrence Berkeley National Lab.
November 15, 1997


---
---
{% include basic_components/head.html %}
{% include basic_components/page.html yaml-file='header' %}
{{ content }}
{% include basic_components/page.html yaml-file='footer' %}
{% include basic_components/perpage_plugins.html %}
{% include basic_components/snipcartFooter.html %}


[gecode-users] Propagator
Mikael Zayenz Lagerkvist
zayenz at gmail.com
Mon May 25 16:15:24 CEST 2009
Hi,
I'll answer the questions about cumulatives here, since I implemented
it originally. Your two questions are related in that they both are
caused by the fact that the propagation-algorithm for cumulatives is
not idempotent.
On Mon, May 25, 2009 at 3:16 PM, Jan Kelbel <kelbelj at fel.cvut.cz> wrote:
> My second question (set of questions) is related to Val propagator for
> cumulatives constrait, which is my study material for implementation of
> scheduling constraints.
> 2) Why there is no ES_FIX return from the Val::propagate() method?
> In the documentation is that when the propagator computes fixpoint, it
> should return ES_FIX.
> Is the reason that checking whether fixpoint is reached is expensive,
> and the propagation scheduler arranges that the propagation is not
> executed too many times?
Checking for a fix-point for cumulatives amounts to re-running the
propagation algorithm and seeing if there were any changes. Since the
algorithm is comparatively expensive, it is better to defer
re-execution to later than to run the algorithm in a loop to find a
local fix-point.
> 1) in Val::propagate() file cumulatives/val.hpp
> at line 276 there is a test if all the variables are assigned. Is there
> a reason why in case of subsumed = true; the function ES_SUBSUMED() is
> called as late as at line 386?
The reason is that subsumed should only be returned from this
particular propagator if the propagation algorithm does not detect
failure when all the variables are assigned before the algorithm is
executed. If the algorithm was idempotent, then the check for assigned
values could be done after the main algorithm.
Cheers,
Mikael
--
Mikael Zayenz Lagerkvist, http://www.ict.kth.se/~zayenz/
More information about the gecode-users
mailing list