Kernel SGD¶
Usage¶
The kernel sgd module can be imported as:
import sklearn_extensions as ske
mdl = ske.kernel_sgd.KernelSGD()
mdl.fit_predict(X, y)
It also comes along with two helper classes:
ske.kernel_sgd.HingeLoss()
ske.kernel_sgd.GaussianKernel()
Which can be used to create KernelSGD models, or you can bring your own loss and kernel classes.
Examples¶
from sklearn_extensions.kernel_sgd.kernel_sgd import GaussianKernel, KernelSGD, HingeLoss
import numpy as np
def gen_non_lin_separable_data():
mean1 = [-1, 2]
mean2 = [1, -1]
mean3 = [4, -4]
mean4 = [-4, 4]
cov = [[1.0,0.8], [0.8, 1.0]]
X1 = np.random.multivariate_normal(mean1, cov, 50)
X1 = np.vstack((X1, np.random.multivariate_normal(mean3, cov, 50)))
y1 = np.ones(len(X1))
X2 = np.random.multivariate_normal(mean2, cov, 50)
X2 = np.vstack((X2, np.random.multivariate_normal(mean4, cov, 50)))
y2 = np.ones(len(X2)) * -1
return X1, y1, X2, y2
def split_train(X1, y1, X2, y2):
X1_train = X1[:90]
y1_train = y1[:90]
X2_train = X2[:90]
y2_train = y2[:90]
X_train = np.vstack((X1_train, X2_train))
y_train = np.hstack((y1_train, y2_train))
return X_train, y_train
def split_test(X1, y1, X2, y2):
X1_test = X1[90:]
y1_test = y1[90:]
X2_test = X2[90:]
y2_test = y2[90:]
X_test = np.vstack((X1_test, X2_test))
y_test = np.hstack((y1_test, y2_test))
return X_test, y_test
def test():
X1, y1, X2, y2 = gen_non_lin_separable_data()
X_train, y_train = split_train(X1, y1, X2, y2)
X_test, y_test = split_test(X1, y1, X2, y2)
clf = KernelSGD(kernel=GaussianKernel(), loss=HingeLoss(threshold=0), n_iter=5)
clf.fit(X_train, y_train)
y_predict = clf.predict(X_test)
correct = np.sum(y_predict == y_test)
print("%d out of %d predictions correct" % (correct, len(y_predict)))
test()
Which yields the output:
8 support vectors out of 180 points
20 out of 20 predictions correct
Third Party Docs¶
The original unmodified version of this module’s code if from a gist that can be found here: Kernel SGD


Interested in providing your feedback about ktlint? Fill out our 2019 user survey.
curl -sSLO https://github.com/pinterest/ktlint/releases/download/0.34.2/ktlint && chmod a+x ktlint
# you can also download ktlint manually from https://github.com/pinterest/ktlint/releases
# another option is "brew install ktlint"
# verify PGP signature (optional but recommended)
curl -sS https://keybase.io/pinterestandroid/pgp_keys.asc | gpg --import
curl -sSLO https://github.com/pinterest/ktlint/releases/download/0.34.2/ktlint.asc
gpg --verify ktlint.asc
# check the style of all Kotlin files inside the current dir (recursively)
# (hidden folders will be skipped)
$ ktlint
src/main/kotlin/Main.kt:10:10: Unused import
# check only certain locations (prepend ! to negate the pattern)
$ ktlint "src/**/*.kt" "!src/**/*Test.kt"
# auto-correct style violations
# (if some errors cannot be fixed automatically they will be printed to stderr)
$ ktlint -F "src/**/*.kt"
# print style violations grouped by file
$ ktlint --reporter=plain?group_by_file
# print style violations as usual + create report in checkstyle format
$ ktlint --reporter=plain --reporter=checkstyle,output=ktlint-report-in-checkstyle-format.xml
# install git hook to automatically check files for style violations on commit
$ ktlint --install-git-pre-commit-hook
Add the following snippet to pom.xml (inside <build><plugins>...</plugins></build>)
<plugin>
<groupId>org.apache.maven.plugins</groupId>
<artifactId>maven-antrun-plugin</artifactId>
<version>1.7</version>
<executions>
<execution>
<id>ktlint</id>
<phase>verify</phase>
<configuration>
<target name="ktlint">
<java taskname="ktlint" dir="${basedir}" fork="true" failonerror="true"
classname="com.pinterest.ktlint.Main" classpathref="maven.plugin.classpath">
<arg value="src/**/*.kt"/>
<!-- to generate report in checkstyle format prepend following args: -->
<!--
<arg value="--reporter=plain"/>
<arg value="--reporter=checkstyle,output=${project.build.directory}/ktlint.xml"/>
-->
<!-- see https://github.com/pinterest/ktlint#usage for more -->
</java>
</target>
</configuration>
<goals><goal>run</goal></goals>
</execution>
<execution>
<id>ktlint-format</id>
<configuration>
<target name="ktlint">
<java taskname="ktlint" dir="${basedir}" fork="true" failonerror="true"
classname="com.pinterest.ktlint.Main" classpathref="maven.plugin.classpath">
<arg value="-F"/>
<arg value="src/**/*.kt"/>
</java>
</target>
</configuration>
<goals><goal>run</goal></goals>
</execution>
</executions>
<dependencies>
<dependency>
<groupId>com.pinterest</groupId>
<artifactId>ktlint</artifactId>
<version>0.34.2</version>
</dependency>
<!-- additional 3rd party ruleset(s) can be specified here -->
</dependencies>
</plugin>
# check code style (it's also bound to "mvn verify")
$ mvn antrun:run@ktlint
src/main/kotlin/Main.kt:10:10: Unused import
# fix code style deviations (runs built-in formatter)
$ mvn antrun:run@ktlint-format
There are few community-driven plugins (in order of appearance):
Add the following snippet to build.gradle
apply plugin: "java"
repositories {
jcenter()
}
configurations {
ktlint
}
dependencies {
ktlint "com.pinterest:ktlint:0.34.2"
// additional 3rd party ruleset(s) can be specified here
// just add them to the classpath (ktlint 'groupId:artifactId:version') and
// ktlint will pick them up
}
task ktlint(type: JavaExec, group: "verification") {
description = "Check Kotlin code style."
main = "com.pinterest.ktlint.Main"
classpath = configurations.ktlint
args "src/**/*.kt"
// to generate report in checkstyle format prepend following args:
// "--reporter=plain", "--reporter=checkstyle,output=${buildDir}/ktlint.xml"
// see https://github.com/pinterest/ktlint#usage for more
}
check.dependsOn ktlint
task ktlintFormat(type: JavaExec, group: "formatting") {
description = "Fix Kotlin code style deviations."
main = "com.pinterest.ktlint.Main"
classpath = configurations.ktlint
args "-F", "src/**/*.kt"
}
# check code style (it's also bound to "gradle check")
$ gradle ktlint
src/main/kotlin/Main.kt:10:10: Unused import
# fix code style deviations (runs built-in formatter)
$ gradle ktlintFormat
data class C(
val a: Any,
val b: Any = 0,
val c: Any
) {}
data class C(val a: Any,
val b: Any = 0,
val c: Any) {
}
* Starting from 0.8.0 value of indent_size specified under [*{kt,kts}] section in .editorconfig takes precedence (if any). Official recommendation is to use 4 spaces, though. (see #43 for details)
val v = ""
println(v)
// semicolons used to separate multiple statements on the same line are OK
// try avoid though
fn({ v -> println(v); v * 10 })
val v = "";
println(v);
import io.vertx.core.Vertx
import com.google.Guice
import com.google.Injector
import io.vertx.core.*
import com.google.inject.*
import pkg.UnusedClass
class A {}
class B {}
// this in not a Python and you are not in PEP 8 realm
class A {}
class B {}
class A {}
class B {}
class A {}⋅⋅⋅
class B {}⋅
* If you don't use EditorConfig it's a good time to start.
fun f() {}
fun f(): Unit {}
class A
interface B
class A {}
interface B {}
val a = "class = ${String::class}"
val b = "not $a"
val a = "class = ${String::class.toString()}"
val b = "not ${a}"
internal abstract class A {
protected open val v = ""
internal open suspend fun f(v: Any): Any = ""
public lateinit var lv: String
abstract tailrec fun findFixPoint(x: Double = 1.0): Double
}
class B : A() {
public override val v = ""
suspend override fun f(v: Any): Any = ""
tailrec override fun findFixPoint(x: Double): Double
= if (x == Math.cos(x)) x else findFixPoint(Math.cos(x))
}
abstract internal class A {
open protected val v = ""
open suspend internal fun f(v: Any): Any = ""
lateinit public var lv: String
tailrec abstract fun findFixPoint(x: Double = 1.0): Double
}
class B : A() {
override public val v = ""
override suspend fun f(v: Any): Any = ""
override tailrec fun findFixPoint(x: Double): Double
= if (x == Math.cos(x)) x else findFixPoint(Math.cos(x))
}
val short = ""
val long = ""
val v = a - b * c
class A : B, C {}
if (true) {}
@file:JvmName("Main")
class A : B
call(object : C() {})
fun fn(@field:F a: Any, b: Any, c: Any): Any
val v: String = str()
if (ok) { /* .. */ }
fn({ v -> f(v) * g(v) })
emptyList().find { true }!!.hashCode()
find { it.default ?: false }?.phone
// multiple spaces after "val long" for vertical alignment
val short = ""
val long = ""
// no spacing around operators
val v=a-b*c
// no space after the comma
class A : B,C {}
// no spacing after keyword ("if" in this case)
if(true) {}
// incorrect spacing around ":"
@file: JvmName("Main")
class A:B
call(object: C() {})
fun fn(@field: F a:Any, b:Any, c:Any):Any
val v:String = str()
// missing spacing around "{" and before "}"
if (true){/* .. */}
// missing spacing after "{" and before "}"
fn({v -> f(v) * g(v)}!!)
// unnecessary space after "}"
emptyList().find { true } !!.hashCode()
find { it.default ?: false } ?.phone
Simplicity.
Spending time on configuration (& maintenance down the road) of hundred-line long style config file(s) is counter-productive. Instead of wasting your energy on something that has no business value - focus on what really matters (not debating whether to use tabs or spaces).
By using ktlint you put the importance of code clarity and community conventions over personal preferences. This makes things easier for people reading your code as well as frees you from having to document & explain what style potential contributor(s) have to follow.
ktlint is a single binary with both linter & formatter included. All you need is to drop it in (no need to get overwhelmed while choosing among dozens of code style options).
Absolutely, "no configuration" doesn't mean "no extensibility". You can add your own ruleset(s) to discover potential bugs, check for anti-patterns, etc.
See Creating A Ruleset on GitHub.
This is meant primarily as an escape latch for the rare cases when ktlint is not able to produce the correct result (please report any such instances using GitHub Issues).
To disable a specific rule you'll need to turn on the verbose mode (ktlint --verbose ...). At the end of each line you'll see an error code. Use it as an argument for ktlint-disable directive (shown below).
import package.* // ktlint-disable no-wildcard-imports
/* ktlint-disable no-wildcard-imports */
import package.a.*
import package.b.*
/* ktlint-enable no-wildcard-imports */
To disable all checks:
import package.* // ktlint-disable
See the EditorConfig section on GitHub. You may also use the --disabled_rules command line flag.


AES4JS Demo
A simple way to encrypt client-side using 256bit AES GCM .
The default password below is "12345" . Click to encrypt the plain text to the output area. Then click to copy the cipher text to the cipher input box. Then click to turn the cipher text back into plain text in the output box. The cipher text is safe to publically distribute, as long as you protect the password.


Kavathe Mahakaal
Sangli, Maharashtra 416405
P: (02341) 222119
H: Monday - Saturday: 10:00 AM to 8:00 PM
Kavathe Mahakaal
Sangli,Maharashtra 416405
P: (02341) 223119
E<EMAIL_ADDRESS>H: Monday - Saturday: 10:00 AM to 8:00 PM
Sangvi
Pune, Maharashtra 412213
P: +91<PHONE_NUMBER>
H: Monday - Friday: 9:00 AM to 5:00 PM
Hatkanangale,
Kolhapur, Maharashtra 416109
P: +91<PHONE_NUMBER>
P: +91<PHONE_NUMBER>
E<EMAIL_ADDRESS>H: Monday - Friday: 9:00 AM to 5:00 PM
Dhayri,Pune,Maharastra,
India-411041
P: +91<PHONE_NUMBER>
H: Monday - Friday: 9:00 AM to 6:00 PM
“We all need people who will give us feedback. That’s how we improve.”


| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 | 3x 13x 12x 3x 3x 6x 31x 31x 26x 6x 3x 3x 1x 2x 2x 6x 6x 6x 1x 6x 6x 6x 1x 6x 1x 1x 6x 6x 6x 6x 1x 6x 1x 6x 1x 6x 1x 6x 1x 6x 1x 6x 1x 6x 1x 6x 1x 6x 1x 3x 3x | /* * Copyright Camunda Services GmbH and/or licensed to Camunda Services GmbH * under one or more contributor license agreements. See the NOTICE file * distributed with this work for additional information regarding copyright * ownership. Camunda licenses this file to you under the Apache License, * Version 2.0; you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ const { red, green } = require("chalk"); /** * @returns a formatted success message */ const success = message => `${green("✓")} ${green(message)}`; /** * @returns a formatted error message */ const error = message => `${red("✖")} ${red(message)}`; const levels = { error: 0, warn: 1, info: 2, verbose: 3, debug: 4, silly: 5 }; /** * logs various events from client * @param client */ const logger = (client, clientLogLevel) => { const log = (messageLogLevel, message) => { Iif (!message) { console.log(messageLogLevel); return; } if (levels[messageLogLevel] <= clientLogLevel) { console.log(message); } }; switch (typeof clientLogLevel) { case "string": clientLogLevel = levels[clientLogLevel]; break; case "number": break; default: clientLogLevel = levels["info"]; break; } client.on("subscribe", topic => { log("info", success(`subscribed to topic ${topic}`)); }); client.on("unsubscribe", topic => { log("info", success(`unsubscribed from topic ${topic}`)); }); client.on("poll:start", () => { log("debug", "polling"); }); client.on("poll:stop", () => { log("debug", error("polling stopped")); }); client.on("poll:success", tasks => { const output = success(`polled ${tasks.length} tasks`); log("debug", output); }); client.on("poll:error", e => { const output = error(`polling failed with ${e}`); log("error", output); }); client.on("complete:success", ({ id }) => { log("info", success(`completed task ${id}`)); }); client.on("complete:error", ({ id }, e) => { log("error", error(`couldn't complete task ${id}, ${e}`)); }); client.on("handleFailure:success", ({ id }) => { log("info", success(`handled failure of task ${id}`)); }); client.on("handleFailure:error", ({ id }, e) => { log("error", error(`couldn't handle failure of task ${id}, ${e}`)); }); client.on("handleBpmnError:success", ({ id }) => { log("info", success(`handled BPMN error of task ${id}`)); }); client.on("handleBpmnError:error", ({ id }, e) => { log("error", error(`couldn't handle BPMN error of task ${id}, ${e}`)); }); client.on("extendLock:success", ({ id }) => { log("info", success(`handled extend lock of task ${id}`)); }); client.on("extendLock:error", ({ id }, e) => { log("error", error(`couldn't handle extend lock of task ${id}, ${e}`)); }); client.on("unlock:success", ({ id }) => { log("info", success(`unlocked task ${id}`)); }); client.on("unlock:error", ({ id }, e) => { log("error", error(`couldn't unlock task ${id}, ${e}`)); }); }; /** * Returns Logger with configured log-level * @param level */ const level = level => { return function(client) { logger(client, level); }; }; // export logger & attach to it success and error methods module.exports = Object.assign(logger, { success, error, level }); |


The Priority is required.
The Category is required.
The Channel is required.
The Division is required.
The Description is required.
The Contact Number is required.


With ShowTrackr you can track your favorite TV shows automatically, so you never lose track of your TV shows ever again.
COMPATIBLE WITH
ShowTrackr's built-in machine learning and context-aware features guarantee that all the notifications and recommendations are always delievered to you in the perfect moment.
Track your favorite shows automatically without switching between apps.
Learn More >Get recommendations like never before, which are truly customized for your taste.
Learn More >Receive smart notifications exactly at the right moments when you need them.
Learn More >Since most of our features work in a completely automated way, you will mainly use our apps to discover new TV shows recommended for you and discuss the most interesting episodes with like-minded people.
Customized Dashboard
Automatic Day & Night Modes
Integrated Chat Platform
Our goal is to create a product and service that you're satisfied with and use it every day. This is why we're constantly working on our services to make it better every day and really listen to what our users have to say.


| Jump to DART Documentation Main Index |
cam_to_dart is the program that reads a CAM
restart file (usually caminput.nc) and creates
a single DART output/restart file
(e.g. perfect_ics, filter_ics, ... ). If you have
multiple input files, you will need to rename the output files as you create them.
The list of variables extracted from the CAM netCDF
file and conveyed to DART is controlled by the set of input.nml
&model_nml:state_names_* variables. The date and
datesec variables in the CAM netcdf file are used to specify
the valid time of the state vector. The time may be changed with the
restart_file_tool if desired.
Some CAM restart files are from climatological runs and have a valid time that
predates the use of the Gregorian calendar. In such instances, the year component
of the original date is changed to be a valid Gregorian year (by adding 1601).
A warning is issued to the screen and to the logfile. Please use the
restart_file_tool to change
this time.
Conditions required for successful execution of cam_to_dart:
Since this program is called repeatedly for every ensemble member, we have found it convenient to link the CAM restart files to the default input filename (caminput.nc). The default DART output filename is dart_ics - this may be moved or linked as necessary.
This namelist is read from the file input.nml. Namelists start with an ampersand '&' and terminate with a slash '/'. Character strings that contain a '/' must be enclosed in quotes to prevent them from prematurely terminating the namelist.
&cam_to_dart_nml cam_to_dart_input_file = 'caminput.nc', cam_to_dart_output_file = 'dart_ics', /
| Item | Type | Description |
|---|---|---|
| cam_to_dart_input_file | character(len=128) | The name of the DART file containing the CAM state. |
| cam_to_dart_output_file | character(len=128) | The name of the DART file containing the model state derived from the CAM restart file. |
assim_model_mod.f90 types_mod.f90 threed_sphere/location_mod.f90 model_mod.f90 null_mpi_utilities_mod.f90 obs_kind_mod.f90 random_seq_mod.f90 time_manager_mod.f90 utilities_mod.f90
none
none - all error messages come from modules that have their own documentation.
none
None.
DART software - Copyright UCAR. This open source software is provided by UCAR, "as is", without charge, subject to all terms of use at http://www.image.ucar.edu/DAReS/DART/DART_download


Research Assistant IV - Sacramento, CA 95834
Available Internally & Externally 10/16/19. Monthly Salary Range for external hires not affiliated with CTA is $6,338 - $6,840.
General Description
This position provides skilled assistance to department staff as well as provides technically advanced services and computer application skills related to the compilation and distribution of research and data as needed by the association. Work is performed within established guidelines and procedures. The incumbent must exercise a high level of independent judgement and initiative and discretion in dissemination of sensitive information with minimal supervision.
Duties and Responsibilities
- Compiles information and creates databases, spreadsheets, and other data-management files of a highly sophisticated nature.
- Tests operation of databases and software programs while in development stages.
- Proofs multiple databases in order to maintain high level of accuracy.
- Provides knowledge-based technical support to the developers of department databases and programs.
- Arranges, prepares and performs logistical functions as assigned for meetings, workshops and trainings coordinated by the department.
- Reviews and edits training materials for accuracy.
- Edits reports and correspondence for style and correct English usage, grammar, punctuation, and spelling.
- Composes and prepares correspondence for staff and leadership from drafts, notes, disk and/or network.
- Accesses research on internal and external computer networks.
- Uses common research tools and systems, including the Internet.
- Answers inquiries on downloading and processing materials placed on networks by the Legislative Relations Department.
- Drafts, edits and field tests newly-developed computerized data prior to its distribution.
- Compiles statistics and prepares reports for review by the Legislative Relations Manager for the Governmental Relations Department or designee.
- Responds to telephone and written inquiries about the department’s programs and specific information.
- Makes timely referrals to appropriate staff and/or ensures inquiries receive a response in absence of person(s) to whom assigned.
- Works across departmental lines in a cooperative manner with managerial, professional and associate staff by answering questions and providing interpretations of information developed by the Department.
- Schedules appointments, travel arrangements as requested and maintains office calendars for assigned staff.
- Plans, coordinates and follows through on large logistical projects.
- Provides assistance to department staff and any special projects as assigned.
- Provides support to Regional Programs as assigned.
- Opens and processes mail including electronically transmitted materials.
- Establishes and maintains files and records.
- Performs other appropriate duties as assigned.
Functions Unique to This Position
- Attends State Council, records minutes, and prepares reports for the State Legislation Committee.
- Coordinates CTA legislative bill screening, bill tracking, policy tracking and legislative database programs.

- Ability to follow through on work assignments with minimal supervision.
- Excellent interpersonal and communication (oral and written) skills.
- Ability to initiate work, follow through on assignments and handle complicated computer projects with minimal supervision.
- Ability to prioritize multiple projects, adapt and positively respond to changes in priorities.
- Ability to communicate effectively with members and staff about reports generated by the Department.
- Proficient word processing skills with minimum keyboarding speed of 55 wpm.
- Proficiency in the use of computer technology and the ability to learn and use the Association’s software programs (i.e. Microsoft Office Suite and Falcon).
- Ability to effectively maximize integrative features of Microsoft Office Suite.
- Willingness to learn new computer programs needed to meet the requirement of the Department.
- Ability to conduct extensive research using common research tools and systems, including frequent use of the Internet.
- Ability to operate generally used office machines.
- Ability to work overtime as needed.
Desirable Additional Qualifications
- A thorough understanding of the California Legislative process
- This position is in a bargaining unit represented by CAS. Salaries are established by a collective bargaining agreement. Step placement is also determined by the CTA/CAS Agreement.


Page 1 of 1
Game Mechanics: Good vs Evil
Posted:
Thu Dec 21, 2006 10:09 pm
by Vitriol
Xenimus has always had a very duelistic theme in it. However when EJ made an entire EVIL world I think it took alot of evil out of being .. evil.
 I do think that Scelest (PK town) should have an evil square and an evil guard, but thats it. Evil players should have only the benefit of killing other players at their discretion. The new scelest should be distant and difficult to travel to/from.  All characters start good, and become more good/evil based on their actions. Evil players should have some quests/special spells/items to make being evil not completely useless. Regular raids on PK town could be a lot of fun.
Posted:
Wed May 23, 2007 12:27 pm
by a_link_to_the_past
I think the G v E update on Xen was a bad Idea... I liked the idea of pk town...
Posted:
Wed May 23, 2007 1:45 pm
by Karl G.
I agree; GvE doesn't work in this kind of game.
Posted:
Thu Jun 21, 2007 7:59 pm
by shadowni
Yeah, and he should've at least kept the -goevil thing, because without it a lot of people come on trying to do that like a bunchy of noobs. I see atleast 2 a day on Xen. It's so annoying.

Posted:
Fri Jul 27, 2007 4:01 pm
by Karl G.
The guards in DS are likely a bug.
Posted:
Fri Jul 27, 2007 10:17 pm
by JSunJShineR
then ej oviously doesnt care about game becuase I've been E-mailing him of bugs that I've found. Which included this.
Re: Game Mechanics: Good vs Evil
Posted:
Sat Apr 26, 2008 8:41 am
by Simpo
so is that a no to; good vs evil?
i have a hidden opinion if it gets introduced.
Re: Game Mechanics: Good vs Evil
Posted:
Sun Apr 27, 2008 11:34 am
by Karl G.
GvE is not a part of PV. Your "alignment" is more like Lawful vs. Chaotic (maybe I should change it to that!). All player characters are "neutral".
This could actually lead to some interesting consequences; for example, Evil NPCs will attack all players and Good NPCs. Good NPCs will attack chaotic players and Evil NPCs. Neutral NPCs will attack Evil NPCs.
Re: Game Mechanics: Good vs Evil
Posted:
Sun Apr 27, 2008 7:28 pm
by Simpo
great idea man.
Re: Game Mechanics: Good vs Evil
Posted:
Sun May 04, 2008 6:04 pm
by Paz the Spaz
I really like Karl's idea of just using the alignment instead of GvE. But I would like to see more evil towns (like scelest) or something like them, for example trading outposts with merchants you can use without guards pounding you, and maybe safe squares (we are going to have those arent we?). That way, its not impossible to be evil aligned unless you're awesome and high level. But evil outposts might make it too much like the current GvE system, so I guess it has to be balanced in some way. Or maybe being bad should be the "quick and easy" way, with exp bonuses, or more quests, etc..
Re: Game Mechanics: Good vs Evil
Posted:
Sun May 04, 2008 7:02 pm
by Karl G.
There will definitely be stuff for evil people to do (quest-wise and merchant-wise) but, as you said, the major disadvantage is that good players have the option of killing you, and good town guards will kill you.
That said, all classes can be evil but the naturally good classes (paladin, cleric) will have big issues with being evil. There were several balances with old Xenimus that, while they may have been complete coincidence, I really thought balanced the game: clerics were easy to level and were very powerful vs. evil; however, if you PKed as a cleric, you very rapidly lost your power and thus PvP (although completely possible) must be used with discretion. Paladins were better Fighters that lost their power if they became evil.
Re: Game Mechanics: Good vs Evil
Posted:
Mon May 05, 2008 2:55 am
by Simpo
o0o yeah, thats sucked havin no mp as a pally. but it was soo fun!


Garda on trial charged with assault of RTÉ cameraman
by Orla O'Donnell, https://www.facebook.com/rtenews/A garda has gone on trial charged with assaulting an RTÉ cameraman and causing damage to his camera.
Sean Lucey, who has been stationed at Crumlin Village and Sundrive Road garda stations in Dublin, has pleaded not guilty to assaulting cameraman, Colm Hand in the city centre on 6 February, 2016. He has also denied damaging a camera.
Prosecuting counsel, Fiona McGowan said the allegations against Mr Lucey had been investigated by the Garda Siochána Ombudsman Commission and a decision had been taken by the DPP to prosecute him.
She told the jurors that on 6 February, 2016, gardaí were on notice of a march or rally by an organisation called Pegida, which says it is against the islamicisation of countries and aims to protect national identity.
A counter march had also been planned by organisations linked to the anti-racism network.
Mr Lucey was part of a garda public order unit on duty in the city centre with the aim of preventing confrontations between the two groups.
Mr Hand was working with a reporter for RTÉ, reporting on the events.
Ms McGowan said that during the afternoon, the anti-racism protesters made a move to get down Cathedral Street in Dublin 1, to confront Pegida. Gardaí formed a line to stop any confrontation, the crowd got bigger and the situation grew tense.
She said Mr Hand and the reporter, Colman O'Sullivan, made a certain decision as a result. And she said there was an incident involving a camera and Mr Hand was then struck by a baton in the groin area.
Mr Hand was able to continue filming for only a very short time after that she said.
She told the jurors they would hear about the damage to the camera and the injuries to Mr Hand.
Ms McGowan told the jurors she anticipated this was a case in which they would have to consider the circumstances in which a person was justified in using force.
The case is expected to last up to five days.


Username, passwords and groups together with the additional parameters are managed in 4 tabs:
If you don't want to use the default password policy (see Setting a Password Policy), you can define in this tab a different password policy, marking "Use the policy below" and setting the appropriate elements. You may also select your own set of symbols to use when generating a password containing them. You may also set this list for the whole database via "Manage → Options → Password Policy" tab and override it for specific entries.


Class ModelEvents
An enumerated list of values used to define events a model may trigger
string |
CREATE
Called to create a new record |
#
'create'
|
string |
FETCH
Called to retrieve a given record |
#
"fetch"
|
string |
FETCH_ALL
Called to retrieve a collection of records |
#
"fetchAll"
|
string |
UPDATE
Called to update a record with data |
#
'update'
|
string |
DELETE
Called to remove data, be it one or many records |
#
'delete'
|


The quantities in the problem can be clicked to select them. These are boxes that highlight when hovered over, and appear in both problem texts as well as the figures.
We'll guide you through the basic steps on how to use this system to solve equations, submit answers, and get feedback.
Important: Please use the Google Chrome browser to use this system for the best experience. Otherwise, the user interface may not appear correctly.
There are three main parts of the system: the prose, the work area, the notifications (Click on images to go to tutorials):
Additionally, to jump to instructions on how to solve problems, click on the sections for:
The problem prose contains the text of the problem and values that can be added.
The quantities in the problem can be clicked to select them. These are boxes that highlight when hovered over, and appear in both problem texts as well as the figures.
The yellow solution boxes next to each sub-part question can be clicked on to add quantities computed from the system. The "✂" icon can be clicked to clear the boxes, and "�" for a quick in-system help.
Sometimes, solution boxes may allow entry from a list of options. See the instructions for such exercises.
Once solution boxes have been populated, click on "Check Answer" to submit the answers and get feedback.
The workarea is where all calculations are carried out. Systems of equations are built here, and populated with quantities from the prose.
At the end, solutions computed are put back into the solution boxes for each question, which are then subsequently evaluated.
There are two parts here: The workspace and the equation palette.
| Workspace |
Palette |
Equations are added by going to the appropriate equation palette page, clicking on the equation to be added to select it (highlighted), and then clicking on the button for the corresponding workspace to add it in.
Equations can be removed:
Workspaces are added one below the other by clicking on the . They can be deleted in any order by clicking on the "✂" icon in the corner for the workspace.
Note: Deleting a workspace deletes all solutions and equations in the workspace, so this makes it ideal for creating a clean slate for a fresh start!
Equations form the main workhorse of this system. Any kind of calculations or verifications with quantities starts with equation objects added from the palette to the workspace. Each equation has a clickable template with greyed out boxes on the right. These boxes represent variables to which anything can be assigned (quantities, variable associations, etc.)
Values can be added to an equation's variables by clicking on a quantity in the prose (or figure) to select it and then clicking on the box in the equation where it should appear. Note: The sign of the value added can also be negated by clicking to bring up the menu and selecting "multiply by -1".
Alternatively, one could insert quantities manually into boxes as well. This is accessed by clicking on an empty box to bring up the menu, then clicking on the "insert" option to add the magnitude and quantity. This is often useful for using the system as a calculator, when used with physical quantities. Note: To work with plain numbers that aren't physical quantities (or quantities like angles and strain), select "dimensionless" for the domain and unit.
Once a quantity is added, its unit can be changed by clicking on the green-highlighted prompt for unit of the entered quantity. This brings up a list of units in the same domain as the unit of this quantity.
To solve 1 equation or a system of n>1 equations - once the system is set up to show the number of knowns and unknowns, we select ("☑") the equations by clicking on the checkbox,
and then click on for the corresponding workspace the equations appear in.
Note:
Solving equations creates solution boxes as shown. These can be selected to be entered into other equations just like quantities from the prose. To submit the value calculated as the answer for a question, click on it to select it, and then click on the submission box for the question to enter it. Note: Double clicking the box negates the magnitude of the value in the solution box.
Note: The sign associated with an unknown can also be negated by clicking to bring up the menu and selecting "multiply by -1".
To enhance readability for students and to facilitate keeping track of contexts for different problem setups, we provide some features to customize the names of unknowns and associations and equations.
For an unknown that appears in only one equation (i.e. an empty box), to rename this unknown, simple click on it to bring up its menu, and select "rename variables", followed by entering a variable name and/or a subscript for the variable.
For an n-way variable association, to rename this unknown variable, simple click on it to bring up its menu, and select "rename association", followed by entering a variable name and/or a subscript for the variable.
To add a subscript to all the variables in an equation to indicate the specific context that equation belongs to (eg: different materials, numerical index, etc.), click on the text template for the equation to bring up the dialog box to enter a subscript for the equation.
Note: In all of these cases, to reset the variable name back to original or to remove subscripts, simply click "Set" etc. without filling in the blanks.
[back to top]The notifications panel on the right side shows errors for anything that may have happened with your system. Click on the errors to show more details about them. In some cases, clicking on the boxes will also show where in the equations an error has occurred.
Number of unknowns is not equal to the number of known quantities. (shows up as a global error)
Quantities with wrong units have been entered in the wrong place in an equation. Alternatively, an entire equation might be inconsistent because of the associations created or quantities entered. Click on these errors to see where the error may have occurred.
(Not an error, but a warning) Inconsistent units were used in the system which were implicitly converted by the solver prior to computation.
For any additional help during using the system, click on the help symbols (�) located throughout the system to bring up a mini-tutorial for the specific components.
[back to top]


Home
(current)
Logout
NDM Consent Navigator
Care Reciever Details
Health ID
HIP ID
HIU ID
Purpose Text
Purpose Code
Requestor Name
Delivered
Details
<EMAIL_ADDRESS>lh-28
finarkein-001
Care Management
CAREMGT
Dr Formatter
YES
Next


The docs you requested is either missing or not available
Please double check your spelling and try again.


A stream is a sequence of events over time
A stream can emit three kinds of events: values an error a complete notification
After an error or a complete notification, nothing else is emitted by the stream.
Rx Operators never modifies the input stream. Instead it return a new streams. This principle is called Immutability.
Reactive programming is programing with streams. In reactive programming we react to event/data and stream updates. This is the reactive principle.
A listener can receive three kinds of events [ value, error, complete ]. So, it can consume the values, handle an error and act upon completion of the subscribed stream.


Publication list
Papers submitted or in preparation
-
Lutz M, Reid C, Powell S, Couzin ID, Garnier S (2015) Living holds facilitate movement of army ants on steep surfaces. In preparation.
-
Rockenbach C, Reid C, Garnier S (2015) Supply chains in ant colonies. In preparation.
-
Garnier S, Hurme E, Couzin ID (2015) Temporal organization of traffic in army ant trails. In preparation.
-
Garnier S, Neiman D, Ray S, Perna A (2015) Formation of optimal angles at trail bifurcations in the Argentine ant (Linepithema humile). In preparation.
-
Garnier S, Perna A, Labédan M, Fourcassié V, Theraulaz G, Couzin ID (2015) Spatio-temporal characteristics of emerging trail networks in the Argentine ant (Linepithema humile). In preparation.
Published Refereed Journal Papers
-
Reid CR, MacDonald H, Mann RP, Marshall JAR, Latty T, Garnier S (2016) Decision-making without a brain: how an amoeboid organism solves the two-armed bandit. J R Soc Interface 13: 20160030. link | pdf
-
Reid CR, Lutz MJ, Powell S, Kao AB, Couzin ID, Garnier S (2015) Army ants dynamically adjust living bridges in response to a cost–benefit trade-off. PNAS 112: 15113–15118. link | pdf
-
Dorigo M, Birattari M, Garnier S, Hamann H, de Oca MAM, Solnon C, Stützle, T (2015) ANTS 2014 special issue: Editorial. Swarm Intell 9: 71–73. link | pdf
-
Vela-Pérez M, Fontelos MA, Garnier S (2015) From Individual to Collective Dynamics in Argentine Ants (Linepithema humile). Math Biosci 262: 56-64. link | pdf
-
Reid CR, Garnier S, Beekman M, Latty T (2015) Information integration and multiattribute decision making in non-neuronal organisms. Anim Behav 100: 44–50. link | pdf
-
Pérez-Escudero A, Miller N, Hartnett AT, Garnier S, Couzin ID, et al. (2013) Estimation models describe well collective decisions among three options. PNAS 110: E3466–E3467. link | pdf
-
Garnier S, Combe M, Jost C, Theraulaz G (2013) Do ants need to estimate the geometrical properties of trail bifurcations to find an efficient route? A swarm robotics test bed. PLoS Comput Biol 9: e1002903. link | pdf
-
Garnier S, Murphy T, Lutz M, Hurme E, Leblanc S, et al. (2013) Stability and responsiveness in a self-organized living architecture. PLoS Comput Biol 9: e1002984. link | pdf
-
Miller N, Garnier S, Hartnett AT, Couzin ID (2013) Both information and social cohesion determine collective decisions in animal groups. Proc Natl Acad Sci U S A 110: 5263–5268. link | pdf
-
Gallup AC, Hale JJ, Sumpter DJT, Garnier S, Kacelnik A, et al. (2012) Visual attention and the acquisition of information in human crowds. Proc Natl Acad Sci U S A 109: 7245–7250. link | pdf
-
Perna A, Granovskiy B, Garnier S, Nicolis SC, Labédan M, et al. (2012) Individual rules for trail pattern formation in Argentine ants (Linepithema humile). PLoS Comput Biol 8: e1002592. link | pdf
-
Campo A, Garnier S, Dédriche O, Zekkri M, Dorigo M (2011) Self-organized discrimination of resources. PLoS One 6: e19888. link | pdf
-
Garnier S (2011) From Ants to Robots and Back : How Robotics Can Contribute to the Study of Collective Animal Behavior. Bio-Inspired Self-Organizing Robot Syst 355: 105–120. link | pdf
-
Moussaïd M, Perozo N, Garnier S, Helbing D, Theraulaz G (2010) The walking behaviour of pedestrian social groups and its impact on crowd dynamics. PLoS One 5: e10047. link | pdf
-
Campo A, Gutiérrez A, Nouyan S, Pinciroli C, Longchamp V, Garnier S, Dorigo M (2010) Artificial pheromone for path selection by a foraging swarm of robots. Biol Cybern 103: 339–352. link | pdf
-
Garnier S, Gautrais J, Asadpour M, Jost C, Theraulaz G (2009) Self-Organized Aggregation Triggers Collective Decision Making in a Group of Cockroach-Like Robots. Adapt Behav 17: 109–133. link | pdf
-
Moussaid M, Garnier S, Theraulaz G, Helbing D (2009) Collective Information Processing and Pattern Formation in Swarms, Flocks, and Crowds. Top Cogn Sci 1: 469–497. link | pdf
-
Moussaïd M, Helbing D, Garnier S, Johansson A, Combe M, et al. (2009) Experimental study of the behavioural mechanisms underlying self-organization in human crowds. Proc Biol Sci 276: 2755–2762. link | pdf
-
Garnier S, Guérécheau A, Combe M, Fourcassié V, Theraulaz G (2009) Path selection and foraging efficiency in Argentine ant transport networks. Behav Ecol Sociobiol 63: 1167–1179. link | pdf
-
Garnier S, Jost C, Gautrais J, Asadpour M, Caprari G, et al. (2008) The embodiment of cockroach aggregation behavior in a group of micro-robots. Artif Life 14: 387–408. link | pdf
-
Gerbier G, Garnier S, Rieu C, Theraulaz G, Fourcassié V (2008) Are ants sensitive to the geometry of tunnel bifurcation? Anim Cogn 11: 637–642. link | pdf
-
Garnier S, Gautrais J, Theraulaz G (2007) The biological principles of swarm intelligence. Swarm Intell 1: 3–31. link | pdf
-
Garnier S, Jost C, Jeanson R, Gautrais J, Asadpour M, et al. (2005) Aggregation behaviour as a source of collective decision in a group of cockroach-like-robots. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3630 LNAI. pp. 169–178. link | pdf
Published Refereed Conference Papers
-
Garnier S, Tache F, Combe M, Grimal A, Theraulaz G (2007) Alice in Pheromone Land: An Experimental Setup for the Study of Ant-like Robots. 2007 IEEE Swarm Intelligence Symposium. pp. 37–44. link | pdf
-
Garnier S, Jost C, Jeanson R, Gautrais J, Asadpour M, et al. (2005) Collective decision-making by a group of cockroach-like robots. Proceedings 2005 IEEE Swarm Intelligence Symposium. pp. 233–240. link | pdf
-
Jost C, Garnier S, Jeanson R, Asadpour M, Gautrais J & Theraulaz G (2004) The embodiment of cockroach behaviour in a micro-robot. Proceedings 35th International Symposium on Robotics. pp. 23–26. link | pdf
Published Refereed Conference Abstracts
-
Reid C, Lutz M, Garnier S. Investigating the self-organized living architectures of Eciton army ants. In 2014 Meeting of the Entomological Society of America, Portland, OR, November 18, 2014.
-
Rockenbach C, Reid C, Currie C, Garnier S. Colony provisioning affects use of leaf-piles in Atta cephalotes. In 2014 Meeting of the Entomological Society of America, Portland, OR, November 17, 2014.
-
Reid C, Lutz M, Garnier S. The Self-Organization of Living Bridges in Eciton hamatum Army ants. In Social Insects in the North-East Regions, Cornell University, Ithaca, NY, November 9, 2014.
-
Reid C, Lutz M, Garnier S. An ant bridge too far: living architecture and self-organized shortcuts in army ants. In 2nd Workshop on Biological Distributed Algorithms, Austin, TX, October 12, 2014.
-
Reid C, MacDonald H, Garnier S. Cellular Decision-making: How an Amoeboid Organism Solves the Two-Armed Bandit Problem. In 2nd Workshop on Biological Distributed Algorithms, Austin, TX, October 12, 2014.
-
Garnier S. All roads lead to the mound. In 9th International Conference on Swarm Intelligence, Université Libre de Bruxelles, Bruxelles, Belgium, September 10, 2014.
-
Lutz M, Reid C, Garnier S, Couzin ID. Architecture on demand: The dynamics of self-organized construction in army ants. In 51st Annual Conference of the Animal Behavior Society, Princeton University, Princeton, NJ, August 10, 2014.
-
Reid C, MacDonald H, Latty T, Mann R, Garnier S. How slime mold cracks the Two-Armed-Bandit problem; insights into unicellular decision making. In 51st Annual Conference of the Animal Behavior Society, Princeton University, Princeton, NJ, August 10, 2014.
-
Reid C, MacDonald H, Garnier S. Unicellular decision making: How slime mould cracks the Two-Armed-Bandit problem. In 2014 Meeting of the International Union for the Study of Social Insects, Cairns, Australia, July 17, 2014.
-
Garnier S, Neiman D. Formation of efficient transportation networks in the Argentine ant. In 2014 Meeting of the International Union for the Study of Social Insects, Cairns, Australia, July 14, 2014.
-
Garnier S, Reid C. Video tracking ant behavior. In Social Insects in the North-East Regions, Drexel University, Philadelphia, PA, May 29, 2014.
-
Reid C, Garnier S. Investigating the self-organized living architectures of Eciton army ants. In Social Insects in the North-East Regions, Drexel University, Philadelphia, PA, May 28, 2014.
-
Garnier S. Living architectures in army ants. In 2013 Meeting of the Entomological Society of America, Austin, TX, November 10-13, 2013.
-
Rockenbach C, Reid C, Wcislo W, Garnier S. The function of leaf-caching behavior in leaf-cutter ant supply chains. In 2013 Meeting of the Entomological Society of America, Austin, TX, November 10-13, 2013.
-
Garnier S. Ant wuz here! Following the trail of recent ant network research. In The Sixth International Symposium on “Biomathematics and Ecology: Education and Research”, Arlington, VA, October 11-13, 2013.
-
Reid C, Latty T, MacDonald H, Garnier S. Blob breaks bank: an amoeboid organism’s strategy for solving the Two-Armed Bandit problem. In Joint meeting of the 33rd International Ethological Conference and the Association for the Study of Animal Behaviour, Newcastle, UK, August 4-8, 2013.
-
Garnier S, Lutz M, Hurme E, Leblanc S, Couzin ID. Temporal organization of traffic on army ant trails. In Joint meeting of the 33rd International Ethological Conference and the Association for the Study of Animal Behaviour, Newcastle, UK, August 4-8, 2013.
-
Garnier S, Lutz M, Hurme E, Leblanc S, Couzin ID. Temporal organization of traffic on army ant trails. In 50th Annual Conference of the Animal Behavior Society, Boulder, CO, July 28-August 1, 2013. Peer reviewed.
-
Reid C, Latty T, MacDonald H, Garnier S. The exploration-exploitation tradeoff in an amoeboid organism: slime mold vs the two-armed bandit. In 50th Annual Conference of the Animal Behavior Society, Boulder, CO, July 28-August 1, 2013.
-
Garnier S. Ant wuz here! Externalized memory and collective problem-solving in ants. In 10th Annual Conference on $Frontiers in Applied and Computational Mathematics, Newark, NJ, May 31-June 2, 2013.
-
Garnier S, Murphy T, Lutz M, Hurme S, Leblanc S, Couzin ID. Living Architectures: Bridge Construction in Army Ants. In Workshop on “Animal Swarms”, Kfar Blum, Israel, February 19-21, 2013.
-
Garnier S, Murphy T, Lutz M, Hurme S, Leblanc S, Couzin ID. Living Architectures: Bridge Construction in Army Ants. In Proceedings of the workshop “Collective Motion in Biological Systems: from Data to Models”, Bielefeld, Germany, November 5-9, 2012.
-
Delcourt J, Garnier S, Miller N, Couzin ID. Radial arm maze as a new paradigm to study collective behaviours in fish. In Proceedings of the XIV European Congress of Ichthyology, Liège, Belgium, July 3-8, 2012.
-
Garnier S, Faria J, de Froment A, Miller N, Couzin ID. Collective Discrimination In the Presence of Distractors: Application of the Treisman Feature Search Test to Schooling Fish. In Fish Behavior Symposium at AFS 141st Annual Meeting, Seattle, Washington, USA, September 4-8, 2011.
-
Miller N, de Froment A, Garnier S, Faria J, Couzin ID. Combination Laws During Collective Decision-Making In Fish. In Fish Behavior Symposium at AFS 141st Annual Meeting, Seattle, Washington, USA, September 4-8, 2011.
-
Garnier S. Exploratory trail networks in Argentine ants. In MBI workshop on “Insect Self-organization and Swarming”, Colombus, Ohio, USA, March 14-18, 2011.
-
Garnier S, Fourcassié V, Theraulaz G. Trail geometry encodes heuristic information in the Argentine ant. In Young researcher symposium on “Crowd and swarm dynamics: interactions, self-organization, mathematics, applications” at SIMAI 2010, Cagliari, Italy, June 21-25, 2010.
-
Garnier S, Moussaïd M. Self-organized movements in swarms, flocks and crowds. In XVIème Colloque de l’Association Alpha-T des Doctorants en Biologie-Santé-Biotechnologies de Toulouse, Toulouse, France, March 20-21, 2008.
-
Garnier S, Jost C, Theraulaz G. Aggregation behaviour as a source of collective decision in a group of cockroach-like robots. In 8th European Conference on Artificial Life, Canterbury, United Kingdom, September 5-9, 2005.
-
Garnier S, Jost C, Theraulaz G. Décisions collectives dans des groupes de micro-robots. In 6ème Colloque des Jeunes Chercheurs en Sciences Cognitives, Bordeaux, France, May 2-4, 2005.
Professional presentations
-
Garnier S. How Millions Become One - The Biological Principles of Swarm Intelligence. In Nonlinear Science & Mathematical Physics Seminar, Georgia Institute of Technology, Atlanta, GA, December 3, 2014. Invited.
-
Reid C, Lutz M, Garnier S. Investigating the self-organized living architectures of Eciton army ants. In Entomology 2014, Entomological Society of America, Portland, OR, November 18, 2014.
-
Garnier S. How Millions Become One: the Biological Principles of Self-Organization. In Innovation Lab Meeting, MIT, Cambridge, MA, November 13, 2014. Invited.
-
Reid C, Lutz M, Garnier S. The Self-Organization of Living Bridges in Eciton hamatum Army ants. In Social Insects in the North-East Regions, Cornell University, Ithaca, NY, November 9, 2014.
-
Garnier S. An ant bridge too far: living architecture and self-organized shortcuts in army ants. In Entomology Department Seminar Series, Rutgers University, New Brunswick, NJ, October 24, 2014. Invited.
-
Reid C, MacDonald H, Garnier S. Cellular Decision-making: How an Amoeboid Organism Solves the Two-Armed Bandit Problem. In 2nd Workshop on Biological Distributed Algorithms, Austin, TX, October 12, 2014.
-
Garnier S. All roads lead to the mound. In 9th International Conference on Swarm Intelligence, Université Libre de Bruxelles, Bruxelles, Belgium, September 10, 2014. Invited, Keynote Speaker.
-
Garnier S. The Biological Principles of Swarm Intelligence. In Science Foo Camp, Google, O’Reilly Media, Nature, Googleplex, Palo Alto, CA, August 9, 2014. Invited.
-
Lutz M, Reid C, Garnier S, Couzin ID. Architecture on demand: The dynamics of self-organized construction in army ants. In 51st Annual Conference of the Animal Behavior Society, Princeton University, Princeton, NJ, August 10, 2014.
-
Reid C, MacDonald H, Latty T, Mann R, Garnier S. How slime mold cracks the Two-Armed-Bandit problem; insights into unicellular decision making. In 51st Annual Conference of the Animal Behavior Society, Princeton University, Princeton, NJ, August 10, 2014.
-
Reid C, MacDonald H, Garnier S. Unicellular decision making: How slime mould cracks the Two-Armed-Bandit problem. In 2014 Meeting of the International Union for the Study of Social Insects, International Union for the Study of Social Insects, Cairns, Australia, July 17, 2014.
-
Garnier S, Neiman D. Formation of efficient transportation networks in the Argentine ant. In 2014 Meeting of the International Union for the Study of Social Insects, International Union for the Study of Social Insects, Cairns, Australia, July 14, 2014.
-
Garnier S. An Ant Bridge Too Far. In Biology Department Seminar Series, University of Sydney, Sydney, Australia, July 7, 2014. Invited
-
Garnier S, Reid C. Video tracking ant behavior. In Social Insects in the North-East Regions, Drexel University, Philadelphia, PA, May 29, 2014.
-
Reid C, Garnier S. Investigating the self-organized living architectures of Eciton army ants. In Social Insects in the North-East Regions, Drexel University, Philadelphia, PA, May 28, 2014.
-
Garnier S. Des Fourmis aux Hommes: La Science des Foules (From Ants to Humans: The Science of Crowds). In Conférence du Coeur des sciences de l’UQAM, Montreal, Canada, April 24, 2014. Invited, Public lecture.
-
Garnier S. All roads lead to the mound. In UQAM Biology Department Seminar, Montreal, Canada, April 23, 2013. Invited.
-
Garnier S. How millions become one: Complexity and Self-Organization in Social Systems. In Moffitt Integrated Mathematical Oncology Seminar, Tampa, FL, March 20, 2014. Invited.
-
Garnier S. All roads lead to the mound. In Imperial College Applied Mathematics Seminar, London, UK, February 28, 2014. Invited.
-
Garnier S. All roads lead to the mound. In Microsoft Research Cambridge Seminar, Cambridge, UK, February 26, 2014. Invited.
-
Garnier S. How crowds move. In Oxford Mathematical Institute Seminar, Oxford, UK, February 24, 2014. Invited.
-
Garnier S. All roads lead to the mound. In Swansea University Biosciences Seminar, Swansea, UK, February 20, 2014. Invited.
-
Garnier S. All roads lead to the mound. In University of Pennsylvania EcoLunch, Philadelphia, PA, January 21, 2014.Invited.
-
Garnier S. Track me if you can. In Kronauer Lab Meeting at Rockefeller University, New York City, NY, January 3, 2014. Invited.
-
Garnier S. Ant wuz here! Externalized memory and collective problem-solving in ants. In University of Houston Network Seminar Series, Houston, TX, November 15, 2013. Invited.
-
Garnier S. Living architectures in army ants. In 2013 Meeting of the Entomological Society of America, Austin, TX, November 12, 2013. Invited.
-
Rockenbach C, Reid C, Wcislo W, Garnier S. The function of leaf-caching behavior in leaf-cutter ant supply chains. In 2013 Meeting of the Entomological Society of America, Austin, TX, November 11, 2013.
-
Garnier S. Ant wuz here! Following the trail of recent ant network research. In KI-Net young researchers workshop: Kinetic and macroscopic models for complex systems, College Park, MA, October 15, 2013. Invited.
-
Garnier S. Ant wuz here! Following the trail of recent ant network research. In The Sixth International Symposium on “Biomathematics and Ecology: Education and Research”, Arlington, VA, October 13, 2013. Invited.
-
Garnier S. Ant wuz here! Following the trail of recent ant network research. In Collective Behaviours and Social Dynamics Workshop at the 12th European Conference on Artificial Life, Taormina, Italy, September 2, 2013. Invited, Keynote Speaker.
-
Reid C, Latty T, MacDonald H, Garnier S. Blob breaks bank: an amoeboid organism’s strategy for solving the Two-Armed Bandit problem. In Joint meeting of the 33rd International Ethological Conference and the Association for the Study of Animal Behaviour, Newcastle, UK, August 4-8, 2013.
-
Garnier S, Lutz M, Hurme E, Leblanc S, Couzin ID. Temporal organization of traffic on army ant trails. In Joint meeting of the 33rd International Ethological Conference and the Association for the Study of Animal Behaviour, Newcastle, UK, August 4-8, 2013.
-
Garnier S, Lutz M, Hurme E, Leblanc S, Couzin ID. Temporal organization of traffic on army ant trails. In 50th Annual Conference of the Animal Behavior Society, Boulder, CO, July 28-August 1, 2013.
-
Reid C, Latty T, MacDonald H, Garnier S. The exploration-exploitation tradeoff in an amoeboid organism: slime mold vs the two-armed bandit. In 50th Annual Conference of the Animal Behavior Society, Boulder, CO, July 28-August 1, 2013.
-
Garnier S. Ant wuz here! Externalized memory and collective problem-solving in ants. In 10th Annual Conference on Frontiers in Applied and Computational Mathematics, Newark, NJ, May 31-June 2, 2013. Invited.
-
Garnier S. Ant was here! Externalized memory and collective problem solving in ants. In Harvard Widely Applied Math Seminar, Cambridge, MA, May 7, 2013. Invited.
-
Garnier S. Living Architectures. In AIANJ Spring Symposium on Distributed Intelligence, Newark, New Jersey, USA, March 6, 2013. Invited.
-
Garnier S, Murphy T, Lutz M, Hurme S, Leblanc S, Couzin ID. Living Architectures: Bridge Construction in Army Ants. In Workshop on “Animal Swarms”, Kfar Blum, Israel, February 19-21, 2013.
-
Garnier S, Murphy T, Lutz M, Hurme S, Leblanc S, Couzin ID. Living Architectures: Bridge Construction in Army Ants. In Proceedings of the workshop “Collective Motion in Biological Systems: from Data to Models”, Bielefeld, Germany, November 5-9, 2012.
-
Garnier S, Faria J, de Froment A, Miller N, Couzin ID. Collective Discrimination In the Presence of Distractors: Application of the Treisman Feature Search Test to Schooling Fish. In Fish Behavior Symposium at AFS 141st Annual Meeting, Seattle, Washington, USA, September 4-8, 2011.
-
Miller N, de Froment A, Garnier S, Faria J, Couzin ID. Combination Laws During Collective Decision-Making In Fish. In Fish Behavior Symposium at AFS 141st Annual Meeting, Seattle, Washington, USA, September 4-8, 2011.
-
Garnier S. Living architectures: bridge construction by army ants. In Seminar at the Self-Organizing Systems Research Group at Harvard University, Cambridge, Massachusetts, USA, July 11, 2011. Invited.
-
Garnier S. Exploratory trail networks in Argentine ants. In MBI workshop on “Insect Self-organization and Swarming”, Colombus, Ohio, USA, March 14-18, 2011.
-
Garnier S, Fourcassié V, Theraulaz G. Trail geometry encodes heuristic information in the Argentine ant. In Young researcher symposium on “Crowd and swarm dynamics: interactions, self-organization, mathematics, applications” at SIMAI 2010, Cagliari, Italy, June 21-25, 2010.
-
Garnier S. From biology to robotics, and back. In Seminar at the School of Engineering & Science of the Stevens Institute of Technology, Hoboken, New Jersey, USA, June 9, 2010. Invited.
-
Garnier S, Moussaïd M. Self-organized movements in swarms, flocks and crowds. In XVIème Colloque de l’Association Alpha-T des Doctorants en Biologie-Santé-Biotechnologies de Toulouse, Toulouse, France, March 20-21, 2008.
-
Garnier S, Theraulaz G. Collective Behaviour in Groups of Insect-like Robots. In Summer School on Collective Robotics (EAIA’07), Lisboa, Portugal, August 27-31, 2007. Invited.
-
Garnier S, Moussaïd M. Déplacements collectifs dans les sociétés animales et humaines – Collective movements in animal and human societies, In Colloque sur les Systèmes Complexes en Sciences Humaines et Sociales, Cerisy-la-Salle, France, May 26– June 2, 2007. Invited.
-
Garnier S, Tache F, Combe M, Grimal A, Theraulaz G. Alice in Pheromone Land: An Experimental Setup for the Study of Ant-like Robots. In 2007 IEEE Swarm Intelligence Symposium, Honolulu, Hawaii, USA, April 1-5, 2007, 37–44.
-
Garnier S, Jost C, Theraulaz G. Aggregation behaviour as a source of collective decision in a group of cockroach-like robots. In 8th European Conference on Artificial Life, Canterbury, United Kingdom, September 5-9, 2005.
-
Garnier S, Jost C, Jeanson R, Gautrais J, Asadpour M, Caprari G, Theraulaz G. Collective decision-making by a group of cockroach-like robots. In Proceedings of the 2005 IEEE Swarm Intelligence Symposium, Pasadena, California, USA, June 8-10, 2005, 233–240.
-
Garnier S, Jost C, Theraulaz G. Décisions collectives dans des groupes de micro-robots. In 6ème Colloque des Jeunes Chercheurs en Sciences Cognitives, Bordeaux, France, May 2-4, 2005.
-
Garnier S. L’intelligence collective des sociétés d’insectes : une source d’inspiration pour le management de demain ? – Collective intelligence in insect societies: a source of inspiration for tomorrow’s management? In Thales Annual Meeting on Human Resources Management, Thales Université Jouy-en-Josas, France, December 8, 2004. Invited.
-
Jost C, Garnier S, Jeanson R, Asadpour M, Gautrais J, Theraulaz G. The embodiment of cockroach behaviour in a micro-robot. In Proceedings of 35th International Symposium on Robotics, Paris, France, March 23-16, 2004.


Etch-mo
Home
About
Pictures
Materials Used
Creators
Contact Us
Welcome to Etch-Mo
Once you have it, you'll love it...Etch-Mo
The Etch-Mo is a revoluntionary product that changes the future of art and drawing. Through our new technology, our robot can follow you to draw what you want, when you want.


{% extends 'conf/base.html' %} {% load i18n %} {% load static %} {% load socialaccount %} {% block title %}{{ page_title }}{% endblock %} {% block content %}
{% trans 'You decided to cancel logging in to our site using one of your existing accounts.' %}
{% blocktrans %}If this was a mistake, please proceed to sign in.{% endblocktrans %}


Home
About
Gallery
Shop
Join Us
WE'RE EXCITED TO WORK WITH YOU
APPLICATION
Personal Information
First Name
Last Name
Email
Birthday
Gender
Male
Female
I rather not say
Gamer Information
Username
Instagram
TikTok
Twitter
Twitch
Youtube
Website
Additional Information
What games do you play competitively?
Tell us about yourself and how you would fit into this team
Submit


For each section, Click on a button then use TAB or SHIFT+TAB to navigate, unless otherwise indicated.
Start by declaring a focus-group on a DOM container element. (Typically this will be a DIV). The focus manager will immediately control elements within the scope of this focus-group. By default it will not look too much different than what you might expect to see from the browser's native focus manager.

<button>A</button>
<button>B</button>
<button>C</button>

Tab order is declared by using focus-index. Try avoid using tabindex when possible. The focus manager uses them behind the scenes, and mixing the two can sometimes cause unexpected results.

<button focus-index="4">A</button>
<button focus-index="1">B</button>
<button focus-index="3">C</button>
<button focus-index="2">D</button>

Use focus-group-head and focus-group-tail to manage the behavior of the focus when it reaches the first or last element in a group. The "loop" value will set focus to the start of the group once it has reached the end. The "stop" value will prevent any further actions from occurring once it reaches the end of the head or tail.

<button>A</button>
<button>B</button>
<button>C</button>

You can have the focus manager set the focus on an element automatically when it comes into view by using focus-element="autofocus". To run autofocus, once use ng-show. To run multiple times, use ng-if.

<button>A</button>
<button focus-element="autofocus">B</button>
<button>C</button>

You can gain finer control of focus by placing focus-groups within other focus-groups. Like focus elements, You can control the order of focus groups by using focus-group-index.
Focus elements will receive focus based on the following priority: First, child elements; second, child groups. The focus will continue to go deeper into other child groups until there are no more elements before it moves on to another group.

<button>Start Here</button>
...

<button>...</button>
...

<button>...</button>
...

<button>...</button>
...

<button>D</button>
...

When working with popups and dialogs, you will most likely want the focus to return to the origin from which the popup was initialized. The focus-stack="" directive keeps track of these elements. You can stack as many layers deep as you would like. So if you have an application where dialogs open other dialogs, focus-stack="" will help you keep the origins easily organized.

...

<button focus-element="autofocus">...</button>

...


Theme for a dream wedding
by TNN
FOR THE WOKE COUPLE
The green wedding
Weddings don’t tend to be eco-friendly events – there’s food and decor waste, not to mention the carbon footprint of all your guests travelling. An increasing number of couples are looking at adopting eco-friendly ideas to make their shaadi sustainable. From using local wedding suppliers to finding a green venue to tying up with NGOs for managing food waste – it helps you celebrate conscientiously. Wedding planner Sonali Thakore says an eco-friendly wedding doesn’t mean a farm or field as a venue. “It’s a question of reducing the energy and material used to bring the day together. If it’s a destination wedding, source everything from within 100 km, use local arts and textiles of that area,” she says.
According to her, the ideal setting will be to find a place near the majority of your guests and choose a permanent building like a hall or farmhouse rather than setting up a structure. Other ideas? Reuse a dress, go for vintage, rent your clothes or buy ethical fashion. Go for e-invites, avoid disposables, and get recycled décor items.
HAPPILY EVER AFTER
The fairy tale theme
Desi weddings get an angrezi twist with the fairy tale theme as popularised by the Disney movies. From Snow White to Belle to Cinderella – every bride deserves to feel like a princess on her wedding day. Wedding planner Ajay Moudgil says, “Couples are choosing popular Disney songs for their first dance, as these movies have some of the best romantic numbers. This theme ensures that the pictures are awesome as the sets are grand.” Say “I do” on lush green lawns with a sunset backdrop, enjoy al-fresco cocktails by the pool or gorgeous, intimate yet Instagrammable settings – all courtesy this theme.
Go for MAXIMALISM
Moroccan theme
This is all about colourful decor and plush settings. Colours vary from dark pinks to oranges, greens, purples, fuchsia to deep corals. The decor is all about gold tablecloths, Moroccan lanterns, low sofas, colourful crockery and ottomans piled high with brilliant jewel-tone pillows. Use fabric that has geometric patterns to recreate the look of Moroccan rugs. Use beaded table runners, create a henna station, get the DJ to play a few Mediterranean tunes. And finally, make sure the food has an exotic Moroccan twist.
TROPULENCE time
Tropic opulence
The idea behind tropical opulence is to keep the opulence of Indian weddings but with tropical twists of gold accents, luxurious textures and lush florals. This is an extension of boho tropical. Pantone Color Institute created ‘Paradise Found’ – a vibrant wedding colour palette inspired by an escape to the tropical islands. So, while trying this theme mix blues and greens with zesty orange hues. Wedding planner Sonali Thakore says, “You can be creative: use vintage stuff, calligraphy, personalised monograms of the couple, set a greenery photo booth and create a signature fruity welcome drink.”


AttributeValue
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Declaration
Swift
public var description: String
-
Declaration
Swift
public var debugDescription: String
-
ByteArray representation of this value. If the type is
.RawBytes
, then it’s just the value, otherwise it’s the value converted to a[UInt8]
according to its type.Declaration
Swift
public var byteArray: [UInt8]
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Returns an AttributeValue representation for a ValueOption’s match value, based upon the given AttributeDescriptor
Declaration
Swift
public init?(option: ValueOptionPresentable, descriptor: DeviceProfile.AttributeDescriptor)
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Declaration
Swift
public init(unicodeScalarLiteral value: UnicodeScalarLiteralType)
Parameters
value
-
Declaration
Swift
public init(extendedGraphemeClusterLiteral value: ExtendedGraphemeClusterLiteralType)
Parameters
value
-
Declaration
Swift
public init(stringLiteral value: StringLiteralType)
Parameters
value
-
Declaration
Swift
public init(booleanLiteral value: BooleanLiteralType)
Parameters
value
-
Declaration
Swift
public init(integerLiteral value: IntegerLiteralType)
Parameters
value
-
Declaration
Swift
public init(floatLiteral value: FloatLiteralType)
Parameters
value
-
Declaration
Swift
public init(arrayLiteral elements: Element...)
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Undocumented
-
Return the value as a byte array. Identical to accessing the
byteArray
property.Declaration
Swift
public func suited() -> [UInt8]
-
Undocumented
-
If possible, return value as a
Float
.Declaration
Swift
public func suited() -> Float?
Return Value
a
Float
representing the wrapped value, if the value is a numeric type and and not Double, or if it’s a String for whichNSString.floatValue
returns non-nil. Otherwise nil. -
If possible, return value as a Int.
Declaration
Swift
public func suited() -> Int?
Return Value
a
Int
representing the wrapped value, if the value is a numeric type and0 <= value <= Int.max
. Otherwise nil. -
If possible, return value as an Int64.
Declaration
Swift
public func suited() -> Int64?
Return Value
a
Int
representing the wrapped value, if the value is a numeric type and0 <= value <= Int.max
. Otherwise nil. -
If possible, return value as an Int32.
Declaration
Swift
public func suited() -> Int32?
Return Value
a
Int32
representing the wrapped value, if the value is a numeric type and0 ≤ value ≤ Int.max
. Otherwise nil. -
If possible, return value as an Int16.
Declaration
Swift
public func suited() -> Int16?
Return Value
a
Int16
representing the wrapped value, if the value is a numeric type andInt16 ≤ value ≤ Int16.max
. Otherwise nil. -
If possible, return value as an Int8.
Declaration
Swift
public func suited() -> Int8?
Return Value
an
Int8
representing the wrapped value, if the value is a numeric type andInt.min ≤ value ≤ Int.max
. Otherwise nil. -
If possible, return value as a UInt.
Declaration
Swift
public func suited() -> UInt?
Return Value
a
UInt
representing the wrapped value, if the value is a numeric type and0 <= value <= UInt.max
. Otherwise nil. -
If possible, return value as a UInt.
Declaration
Swift
public func suited() -> UInt64?
Return Value
a
UInt
representing the wrapped value, if the value is a numeric type and0 <= value <= UInt.max
. Otherwise nil. -
If possible, return value as a String.
Declaration
Swift
public func suited() -> String?
Return Value
a
String
representing the wrapped value, iff the wrapped value is indeed a string. -
Undocumented
-
Undocumented


 Top with onion, bay leaf, pepper and gravy. Place celery on gravy.
Cover and cook on Low heat setting 8 to 10 hours.
About 30 minutes before serving, make and bake 8 biscuits using Bisquick mix and milk as directed on package.
Meanwhile, gently stir frozen vegetables into chicken mixture. Increase heat setting to High. Cover and cook 15 minutes. Remove bay leaf.
For each serving, split biscuit and place in soup bowl or tart pan. Spoon about 3/4 cup chicken mixture on top of biscuit.
Calories: 335
Total Carbohydrates: 29 g
Cholesterol: 45 mg
Total Fat: 1 1/2
Dietary fiber: 3 g
Protein: 21 g
Saturated fat: 4 g
Amount Per: 1 Serving
Sodium: 940 mg


Kremlin Unaware of Kadyrov's Alleged Calls for 'Killing' People for Insulting Honour Online
MOSCOW (Sputnik) - The BBC Russian Service reported on Wednesday that Kadyrov had called, in an address for the regional government, for punishing Internet users for insulting one's honour, including through "killing, arresting and threatening" the malefactors.
The Kremlin has not heard any statement by Ramzan Kadyrov, the head of Russia's Chechen Republic, in which he has allegedly called for "killing" Internet users who insult anyone's honour, and does not think that the BBC Russian Service can be seen as a primary source of information in this case, Kremlin spokesman Dmitry Peskov said on Thursday.
"I have not read the original transcript of this governmental session, neither have I read printouts of Kadyrov's original statements. I cannot and will not see the BBC publications as a primary source of information," Peskov told reporters, when asked to comment on Kadyrov's statement.
He also said that the Kremlin would not conduct any investigation into the matter.
"We cannot be guided by the BBC reports ... We do not know anything about such statements," Peskov explained.


{{'Show on wallet tab' | translate}}
Missing Credentials
{{'Name' | translate}}
{{ data?.user?.name }}
{{'Native Currency' | translate}}
{{ data?.user?.native_currency }}
{{'Country' | translate}}
{{ data?.user?.country?.name }}
Token was revoked. Please, log out and try to re-connect again.


Spark up a conversation!
Social media handle @jashheartthrob
Light up the night.
Start building your app or website with Indra template.


| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final boolean |
DEBUG |
true |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
activity_horizontal_margin |
2130968576 |
public static final int |
activity_vertical_margin |
2130968577 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
attach1 |
2130837504 |
public static final int |
downarrow |
2130837505 |
public static final int |
ic_launcher |
2130837506 |
public static final int |
logo8 |
2130837507 |
public static final int |
outline |
2130837508 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
action_settings |
2131230763 |
public static final int |
AddButton |
2131230720 |
public static final int |
AnswerListIndicator |
2131230725 |
public static final int |
answerReplyButton |
2131230729 |
public static final int |
answerReplyText |
2131230728 |
public static final int |
askButton |
2131230730 |
public static final int |
askTitle |
2131230732 |
public static final int |
attachButton |
2131230731 |
public static final int |
browseButton |
2131230746 |
public static final int |
browseListView |
2131230739 |
public static final int |
browseTextView |
2131230736 |
public static final int |
browseViewByButton |
2131230738 |
public static final int |
browseViewByText |
2131230737 |
public static final int |
favouriteListView |
2131230741 |
public static final int |
favouriteTextView |
2131230740 |
public static final int |
invisButton |
2131230744 |
public static final int |
logo |
2131230748 |
public static final int |
myQuestionsDeleteCM |
2131230766 |
public static final int |
myQuestionsEditCM |
2131230765 |
public static final int |
myQuestionsListView |
2131230751 |
public static final int |
myQuestionsTitle |
2131230750 |
public static final int |
name |
2131230735 |
public static final int |
question |
2131230733 |
public static final int |
QuestionAnswerList |
2131230721 |
public static final int |
QuestionReplyList |
2131230726 |
public static final int |
QuestionSaveButton |
2131230723 |
public static final int |
QuestionSubject |
2131230722 |
public static final int |
QuestionText |
2131230724 |
public static final int |
readLaterCancel |
2131230768 |
public static final int |
readLaterDelete |
2131230767 |
public static final int |
readLaterListView |
2131230753 |
public static final int |
readLaterTitle |
2131230752 |
public static final int |
ReplyAnswerIndicator |
2131230727 |
public static final int |
searchButton |
2131230747 |
public static final int |
searchListView |
2131230758 |
public static final int |
searchSelectReadLater |
2131230757 |
public static final int |
searchTerm |
2131230745 |
public static final int |
searchTextInput |
2131230759 |
public static final int |
searchTextTitle |
2131230754 |
public static final int |
searchViewBy |
2131230756 |
public static final int |
searchViewByButton |
2131230755 |
public static final int |
signedInAs |
2131230749 |
public static final int |
signInButton |
2131230742 |
public static final int |
signOutButton |
2131230743 |
public static final int |
subject |
2131230734 |
public static final int |
switchToFavourites |
2131230764 |
public static final int |
switchToHome |
2131230760 |
public static final int |
switchToMyQuestions |
2131230762 |
public static final int |
switchToReadLater |
2131230761 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
activity_logo |
2130903040 |
public static final int |
activity_question |
2130903041 |
public static final int |
answer_reply_activity_screen |
2130903042 |
public static final int |
ask_activity_screen |
2130903043 |
public static final int |
browse_activity_screen |
2130903044 |
public static final int |
favourite_activity_screen |
2130903045 |
public static final int |
list_item |
2130903046 |
public static final int |
main_activity_screen |
2130903047 |
public static final int |
myquestions_activity_screen |
2130903048 |
public static final int |
readlater_activity_screen |
2130903049 |
public static final int |
search_activity_screen |
2130903050 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
answer_reply |
2131165184 |
public static final int |
browse |
2131165185 |
public static final int |
favourite |
2131165186 |
public static final int |
logo |
2131165187 |
public static final int |
main_menu |
2131165188 |
public static final int |
my_questions |
2131165189 |
public static final int |
myquestionscontextmenu |
2131165190 |
public static final int |
question |
2131165191 |
public static final int |
read_later |
2131165192 |
public static final int |
readlatercontextmenu |
2131165193 |
public static final int |
search |
2131165194 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
action_settings |
2131034113 |
public static final int |
add_answer |
2131034129 |
public static final int |
add_reply |
2131034131 |
public static final int |
answer_indicator |
2131034134 |
public static final int |
answers_indicator |
2131034130 |
public static final int |
app_name |
2131034112 |
public static final int |
ask |
2131034117 |
public static final int |
browse |
2131034120 |
public static final int |
hello_world |
2131034125 |
public static final int |
logo |
2131034123 |
public static final int |
reply_indicator |
2131034132 |
public static final int |
save |
2131034119 |
public static final int |
search |
2131034118 |
public static final int |
sign_in |
2131034121 |
public static final int |
sign_out |
2131034122 |
public static final int |
title_activity_answer_replies |
2131034133 |
public static final int |
title_activity_answer_reply |
2131034136 |
public static final int |
title_activity_ask_screen |
2131034116 |
public static final int |
title_activity_browse |
2131034126 |
public static final int |
title_activity_favourite |
2131034135 |
public static final int |
title_activity_main_screen |
2131034115 |
public static final int |
title_activity_my_questions |
2131034114 |
public static final int |
title_activity_question |
2131034128 |
public static final int |
title_activity_read_later |
2131034124 |
public static final int |
title_activity_search |
2131034127 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
AppBaseTheme |
2131099648 |
public static final int |
AppTheme |
2131099649 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final java.lang.String |
NEW_QUESTION_KEY |
"NEW_QUESTION" |
public static final java.lang.String |
TEXT_KEY |
"TEXT" |


If the bomb threat is made by phone:
- Don’t hang up.
- Let the caller hang up first.
- Try to get as much information as possible.
- Get the person to repeat him- or herself, or pretend you can’t hear to buy
time.
- Pay special attention to the following elements:
- Gender
- Age
- Accent, language spoken
- Tone of voice (high or low)
- Speech rhythm and emotions (angry, calm, agitated)
- Background noises
- Depending on the situation and what is possible, try to obtain the following information:
- The time at which the bomb will go off
- The type of bomb
- The people being targeted and the reason
- The location of the bomb
- The name and number on the phone’s Caller ID
- Contact Security at extension 55 (internal phone system) to alert them to the situation and
share relevant information.
- Security may then ask you to come to the Security Operations Centre, located at the entrance
of Pavilion A.
Evacuation
- Wait until Security orders evacuation. Security officers must inspect evacuation routes to
ensure that there is no danger (suspicious packages).
- Stay calm.
- Dress according to the outdoor temperature, but don’t make a detour to get clothing
(for example, don’t go to your locker).
- Evacuate the area via the closest emergency staircase. Don’t take the
elevator.
- Keep a safe distance from the building.
- Go to the designated meeting point.
- Do not go back inside for any reason.
Returning to the building
- You can return to the building as soon as Security announces that it is safe to do so.
- This authorization will be announced over a megaphone at the meeting point.


PERLOS390
Section: Perl Programmers Reference Guide (1)Updated: 2009-02-12
Index Return to Main Contents
NAME
README.os390 - building and installing Perl for OS/390 and z/OSSYNOPSIS
This document will help you Configure, build, test and install Perl on OS/390 (aka z/OS) Unix System Services.DESCRIPTION
This is a fully ported Perl for OS/390 Version 2 Release 3, 5, 6, 7, 8, and 9. It may work on other versions or releases, but those are the ones we've tested it on.You may need to carry out some system configuration tasks before running the Configure script for Perl.
Tools
The z/OS Unix Tools and Toys list may prove helpful and contains links to ports of much of the software helpful for building Perl. http://www-1.ibm.com/servers/eserver/zseries/zos/unix/bpxa1toy.htmlUnpacking Perl distribution on OS/390
If using ftp remember to transfer the distribution in binary format.Gunzip/gzip for OS/390 is discussed at:
http://www-1.ibm.com/servers/eserver/zseries/zos/unix/faq/bpxqp1.html
to extract an ASCII tar archive on OS/390, try this:
pax -o to=IBM-1047,from=ISO8859-1 -r < latest.tar
or
zcat latest.tar.Z | pax -o to=IBM-1047,from=ISO8859-1 -r
If you get lots of errors of the form
tar: FSUM7171 ...: cannot set uid/gid: EDC5139I Operation not permitted.
you didn't read the above and tried to use tar instead of pax, you'll first have to remove the (now corrupt) perl directory
rm -rf perl-...
Setup and utilities for Perl on OS/390
Be sure that your yacc installation is in place including any necessary parser template files. If you have not already done so then be sure to:
cp /samples/yyparse.c /etc
This may also be a good time to ensure that your /etc/protocol file and either your /etc/resolv.conf or /etc/hosts files are in place. The IBM document that described such USS system setup issues was SC28-1890-07 ``OS/390 UNIX System Services Planning'', in particular Chapter 6 on customizing the OE shell.
GNU make for OS/390, which is recommended for the build of perl (as well as building CPAN modules and extensions), is available from the ``Tools''.
Some people have reported encountering ``Out of memory!'' errors while trying to build Perl using GNU make binaries. If you encounter such trouble then try to download the source code kit and build GNU make from source to eliminate any such trouble. You might also find GNU make (as well as Perl and Apache) in the red-piece/book ``Open Source Software for OS/390 UNIX'', SG24-5944-00 from IBM.
If instead of the recommended GNU make you would like to use the system supplied make program then be sure to install the default rules file properly via the shell command:
cp /samples/startup.mk /etc
and be sure to also set the environment variable _C89_CCMODE=1 (exporting _C89_CCMODE=1 is also a good idea for users of GNU make).
You might also want to have GNU groff for OS/390 installed before running the ``make install'' step for Perl.
There is a syntax error in the /usr/include/sys/socket.h header file that IBM supplies with USS V2R7, V2R8, and possibly V2R9. The problem with the header file is that near the definition of the SO_REUSEPORT constant there is a spurious extra '/' character outside of a comment like so:
#define SO_REUSEPORT 0x0200 /* allow local address & port reuse */ /
You could edit that header yourself to remove that last '/', or you might note that Language Environment (LE) APAR PQ39997 describes the problem and PTF's UQ46272 and UQ46271 are the (R8 at least) fixes and apply them. If left unattended that syntax error will turn up as an inability for Perl to build its ``Socket'' extension.
For successful testing you may need to turn on the sticky bit for your world readable /tmp directory if you have not already done so (see man chmod).
Configure Perl on OS/390
Once you've unpacked the distribution, run ``sh Configure'' (see INSTALL for a full discussion of the Configure options). There is a ``hints'' file for os390 that specifies the correct values for most things. Some things to watch out for include:- *
-
A message of the form:
(I see you are using the Korn shell. Some ksh's blow up on Configure, mainly on older exotic systems. If yours does, try the Bourne shell instead.)
is nothing to worry about at all.
- *
- Some of the parser default template files in /samples are needed in /etc. In particular be sure that you at least copy /samples/yyparse.c to /etc before running Perl's Configure. This step ensures successful extraction of EBCDIC versions of parser files such as perly.c, perly.h, and x2p/a2p.c. This has to be done before running Configure the first time. If you failed to do so then the easiest way to re-Configure Perl is to delete your misconfigured build root and re-extract the source from the tar ball. Then you must ensure that /etc/yyparse.c is properly in place before attempting to re-run Configure.
- *
-
This port will support dynamic loading, but it is not selected by
default. If you would like to experiment with dynamic loading then
be sure to specify -Dusedl in the arguments to the Configure script.
See the comments in hints/os390.sh for more information on dynamic loading.
If you build with dynamic loading then you will need to add the
$archlibexp/CORE directory to your LIBPATH environment variable in order
for perl to work. See the config.sh file for the value of $archlibexp.
If in trying to use Perl you see an error message similar to:
CEE3501S The module libperl.dll was not found. From entry point __dllstaticinit at compile unit offset +00000194 at
then your LIBPATH does not have the location of libperl.x and either libperl.dll or libperl.so in it. Add that directory to your LIBPATH and proceed.
- *
- Do not turn on the compiler optimization flag ``-O''. There is a bug in either the optimizer or perl that causes perl to not work correctly when the optimizer is on.
- *
- Some of the configuration files in /etc used by the networking APIs are either missing or have the wrong names. In particular, make sure that there's either an /etc/resolv.conf or an /etc/hosts, so that gethostbyname() works, and make sure that the file /etc/proto has been renamed to /etc/protocol (NOT /etc/protocols, as used by other Unix systems). You may have to look for things like HOSTNAME and DOMAINORIGIN in the ``//'SYS1.TCPPARMS(TCPDATA)''' PDS member in order to properly set up your /etc networking files.
Build, Test, Install Perl on OS/390
Simply put:
sh Configure make make test
if everything looks ok (see the next section for test/IVP diagnosis) then:
make install
this last step may or may not require UID=0 privileges depending on how you answered the questions that Configure asked and whether or not you have write access to the directories you specified.
Build Anomalies with Perl on OS/390
``Out of memory!'' messages during the build of Perl are most often fixed by re building the GNU make utility for OS/390 from a source code kit.Another memory limiting item to check is your MAXASSIZE parameter in your 'SYS1.PARMLIB(BPXPRMxx)' data set (note too that as of V2R8 address space limits can be set on a per user ID basis in the USS segment of a RACF profile). People have reported successful builds of Perl with MAXASSIZE parameters as small as 503316480 (and it may be possible to build Perl with a MAXASSIZE smaller than that).
Within USS your /etc/profile or $HOME/.profile may limit your ulimit settings. Check that the following command returns reasonable values:
ulimit -a
To conserve memory you should have your compiler modules loaded into the Link Pack Area (LPA/ELPA) rather than in a link list or step lib.
If the c89 compiler complains of syntax errors during the build of the Socket extension then be sure to fix the syntax error in the system header /usr/include/sys/socket.h.
Testing Anomalies with Perl on OS/390
The ``make test'' step runs a Perl Verification Procedure, usually before installation. You might encounter STDERR messages even during a successful run of ``make test''. Here is a guide to some of the more commonly seen anomalies:- *
-
A message of the form:
comp/cpp.............ERROR CBC3191 ./.301989890.c:1 The character $ is not a valid C source character. FSUM3065 The COMPILE step ended with return code 12. FSUM3017 Could not compile .301989890.c. Correct the errors and try again. ok
indicates that the t/comp/cpp.t test of Perl's -P command line switch has passed but that the particular invocation of c89 -E in the cpp script does not suppress the C compiler check of source code validity.
- *
-
A message of the form:
io/openpid...........CEE5210S The signal SIGHUP was received. CEE5210S The signal SIGHUP was received. CEE5210S The signal SIGHUP was received. ok
indicates that the t/io/openpid.t test of Perl has passed but done so with extraneous messages on stderr from CEE.
- *
-
A message of the form:
lib/ftmp-security....File::Temp::_gettemp: Parent directory (/tmp/) is not safe (sticky bit not set when world writable?) at lib/ftmp-security.t line 100 File::Temp::_gettemp: Parent directory (/tmp/) is not safe (sticky bit not set when world writable?) at lib/ftmp-security.t line 100 ok
indicates a problem with the permissions on your /tmp directory within the HFS. To correct that problem issue the command:
chmod a+t /tmp
from an account with write access to the directory entry for /tmp.
- *
-
Out of Memory!
Recent perl test suite is quite memory hunrgy. In addition to the comments above on memory limitations it is also worth checking for _CEE_RUNOPTS in your environment. Perl now has (in miniperlmain.c) a C #pragma to set CEE run options, but the environment variable wins.
The C code asks for:
#pragma runopts(HEAP(2M,500K,ANYWHERE,KEEP,8K,4K) STACK(,,ANY,) ALL31(ON))
The important parts of that are the second argument (the increment) to HEAP, and allowing the stack to be ``Above the (16M) line''. If the heap increment is too small then when perl (for example loading unicode/Name.pl) tries to create a ``big'' (400K+) string it cannot fit in a single segment and you get ``Out of Memory!'' - even if there is still plenty of memory available.
A related issue is use with perl's malloc. Perl's malloc uses "sbrk()" to get memory, and "sbrk()" is limited to the first allocation so in this case something like:
HEAP(8M,500K,ANYWHERE,KEEP,8K,4K)
is needed to get through the test suite.
Installation Anomalies with Perl on OS/390
The installman script will try to run on OS/390. There will be fewer errors if you have a roff utility installed. You can obtain GNU groff from the Redbook SG24-5944-00 ftp site.Usage Hints for Perl on OS/390
When using perl on OS/390 please keep in mind that the EBCDIC and ASCII character sets are different. See perlebcdic.pod for more on such character set issues. Perl builtin functions that may behave differently under EBCDIC are also mentioned in the perlport.pod document.Open Edition (UNIX System Services) from V2R8 onward does support #!/path/to/perl script invocation. There is a PTF available from IBM for V2R7 that will allow shell/kernel support for #!. USS releases prior to V2R7 did not support the #! means of script invocation. If you are running V2R6 or earlier then see:
head `whence perldoc`
for an example of how to use the ``eval exec'' trick to ask the shell to have Perl run your scripts on those older releases of Unix System Services.
If you are having trouble with square brackets then consider switching your rlogin or telnet client. Try to avoid older 3270 emulators and ISHELL for working with Perl on USS.
Floating Point Anomalies with Perl on OS/390
There appears to be a bug in the floating point implementation on S/390 systems such that calling int() on the product of a number and a small magnitude number is not the same as calling int() on the quotient of that number and a large magnitude number. For example, in the following Perl code:
my $x = 100000.0; my $y = int($x * 1e-5) * 1e5; # '0' my $z = int($x / 1e+5) * 1e5; # '100000' print "\$y is $y and \$z is $z\n"; # $y is 0 and $z is 100000
Although one would expect the quantities $y and $z to be the same and equal to 100000 they will differ and instead will be 0 and 100000 respectively.
The problem can be further examined in a roughly equivalent C program:
#include <stdio.h> #include <math.h> main() { double r1,r2; double x = 100000.0; double y = 0.0; double z = 0.0; x = 100000.0 * 1e-5; r1 = modf (x,&y); x = 100000.0 / 1e+5; r2 = modf (x,&z); printf("y is %e and z is %e\n",y*1e5,z*1e5); /* y is 0.000000e+00 and z is 1.000000e+05 (with c89) */ }
Modules and Extensions for Perl on OS/390
Pure pure (that is non xs) modules may be installed via the usual:
perl Makefile.PL make make test make install
If you built perl with dynamic loading capability then that would also be the way to build xs based extensions. However, if you built perl with the default static linking you can still build xs based extensions for OS/390 but you will need to follow the instructions in ExtUtils::MakeMaker for building statically linked perl binaries. In the simplest configurations building a static perl + xs extension boils down to:
perl Makefile.PL make make perl make test make install make -f Makefile.aperl inst_perl MAP_TARGET=perl
In most cases people have reported better results with GNU make rather than the system's /bin/make program, whether for plain modules or for xs based extensions.
If the make process encounters trouble with either compilation or linking then try setting the _C89_CCMODE to 1. Assuming sh is your login shell then run:
export _C89_CCMODE=1
If tcsh is your login shell then use the setenv command.
AUTHORS
David Fiander and Peter Prymmer with thanks to Dennis Longnecker and William Raffloer for valuable reports, LPAR and PTF feedback. Thanks to Mike MacIsaac and Egon Terwedow for SG24-5944-00. Thanks to Ignasi Roca for pointing out the floating point problems. Thanks to John Goodyear for dynamic loading help.SEE ALSO
INSTALL, perlport, perlebcdic, ExtUtils::MakeMaker.
http://www-1.ibm.com/servers/eserver/zseries/zos/unix/bpxa1toy.html http://www.redbooks.ibm.com/abstracts/sg245944.html http://www-1.ibm.com/servers/eserver/zseries/zos/unix/bpxa1ty1.html#opensrc http://www.xray.mpe.mpg.de/mailing-lists/perl-mvs/ http://publibz.boulder.ibm.com:80/cgi-bin/bookmgr_OS390/BOOKS/ceea3030/ http://publibz.boulder.ibm.com:80/cgi-bin/bookmgr_OS390/BOOKS/CBCUG030/
Mailing list for Perl on OS/390
If you are interested in the VM/ESA, z/OS (formerly known as OS/390) and POSIX-BC (BS2000) ports of Perl then see the perl-mvs mailing list. To subscribe, send an empty message to<EMAIL_ADDRESS>also:
http://lists.perl.org/showlist.cgi?name=perl-mvs
There are web archives of the mailing list at:
http://www.xray.mpe.mpg.de/mailing-lists/perl-mvs/<EMAIL_ADDRESS>HISTORY
This document was originally written by David Fiander for the 5.005 release of Perl.This document was podified for the 5.005_03 release of Perl 11 March 1999.
Updated 28 November 2001 for broken URLs.
Updated 12 November 2000 for the 5.7.1 release of Perl.
Updated 15 January 2001 for the 5.7.1 release of Perl.
Updated 24 January 2001 to mention dynamic loading.
Updated 12 March 2001 to mention //'SYS1.TCPPARMS(TCPDATA)'.
Index
- NAME
- SYNOPSIS
- DESCRIPTION
-
- Tools
- Unpacking Perl distribution on OS/390
- Setup and utilities for Perl on OS/390
- Configure Perl on OS/390
- Build, Test, Install Perl on OS/390
- Build Anomalies with Perl on OS/390
- Testing Anomalies with Perl on OS/390
- Installation Anomalies with Perl on OS/390
- Usage Hints for Perl on OS/390
- Floating Point Anomalies with Perl on OS/390
- Modules and Extensions for Perl on OS/390
- AUTHORS
- SEE ALSO
- HISTORY
This document was created by man2html, using the manual pages.
Time: 05:29:08 GMT, December 24, 2015