our current available loactions are 1st and pike, SeaTac, Seattle Center, Capitol Hill, Alki, and whatever location you decide to choose to add.
our HQ address is 2901 3rd ave Seattle Wa
our open hours are 24/7 we don't stop the salmon cookie grind.
we dont have any contact information sorry, come to a store location and give us your money
Home


Navbar
Home
GitHub Repositories
Pac Man Exercise
Moving Eyes JavaScript
Bus Tracking
Back to Home
Search
Timothy Bock - GitHub Portoflio
Moving Eyes JavaScript
GitHub Username: tbcolorado
Link to Bus Tracking Repository
Watch it Work!


PhD in computer science from MAPi and Researcher in IT, Aveiro.
I received my Computer and Telematics engineering M.Sc. degree in 2011, with first-class honours, from the Electronics, Telecommunication and Informatics Department, University of Aveiro, Portugal. And concluded my doctoral program in computer science from MAPi in 2018. I'm currently working as a researcher for the 5G-Contact project at IT-Aveiro.
My main research areas focus on Knowledge Extraction and Context Storage in the Internet of Things (IoT) Scenarios using Machine Learning techniques and Big Data repositories. My works include developing efficient ways to deal with unstructured information. These techniques are being implemented and evaluated in advance machine-to-machine projects, such as APOLLO, SCOT and SGH.
My PhD in Computer Science was developed at University of Aveiro (UA) within the MAP-Tele Doctoral Program, December 2018, supervised by Diogo Gomes and Rui Aguiar (both from IT/UA).
The thesis “Knowledge extraction from semi-structured sources” addresses the problem of storing and organizing context information from IoT/M2M scenarios in a meaningful way, without imposing a representation scheme or requiring a priori relations. This work proposes a d-dimension organization model, which was optimized for IoT/M2M data. During this work, two different machine learning techniques were tackled: semantic and stream similarity.
If you are interest in know more about me, you can see this section. On general way, I describe my professional life and my academic career. Adictionally, I talk about my hobbies and some of my interests.
All of my projects are in my github page where you can access and see implementation details. But, you can access this section where you can read some theorical details about more important projects.
I'm avaliable to talk and answer to questions about my work. If you are interest, you can contact me. See my contacts at this section.


--- layout: data_model title: ClusteringMetadataType this_version: 4.1 ---
The ClusteringMetadataType specifies any metadata regarding the algorithm and/or methods used for clustering the Malware Subjects in this Package, for use in the ‘clustered together’ relationship type.
| Field Name | Type | Description |
|---|---|---|
| Algorithm_Name0..1 | string |
The Algorithm_Name field specifies the name of the clustering algorithm used to cluster the malware. |
| Algorithm_Version0..1 | string |
The Algorithm_Version field specifies the version of the algorithm used to cluster the malware. |
| Algorithm_Parameters0..1 | ClusteringAlgorithmParametersType |
The Algorithm_Parameters field specifies any parameters that may have been used in the clustering algorithm. |
| Cluster_Size0..1 | positiveInteger |
The Cluster_Size field specifies the size of the malware cluster. |
| Cluster_Description0..1 | string |
The Cluster_Description field provides a textual description of the malware cluster, such as information about its composition, etc. |
| Cluster_Composition0..1 | ClusterCompositionType |
The Cluster_Composition field captures the composition of the malware cluster, including the similarity indices between its members, as a collection of edges and their corresponding nodes. |


This module provides an interface to the Elastic Compute Cloud (EC2) load balancing service from AWS.
Init method to create a new connection to EC2 Load Balancing Service.
Note
The region argument is overridden by the region specified in the boto configuration file.
Applies security groups to the load balancer. Applying security groups that are already registered with the Load Balancer has no effect.
| Parameters: |
|
|---|---|
| Return type: | List of strings |
| Returns: | An updated list of security groups for this Load Balancer. |
Attaches load balancer to one or more subnets. Attaching subnets that are already registered with the Load Balancer has no effect.
| Parameters: |
|
|---|---|
| Return type: | List of strings |
| Returns: | An updated list of subnets for this Load Balancer. |
Define a health check for the EndPoints.
| Parameters: |
|
|---|---|
| Return type: | |
| Returns: | The updated boto.ec2.elb.healthcheck.HealthCheck |
Generates a stickiness policy with sticky session lifetimes that follow that of an application-generated cookie. This policy can only be associated with HTTP listeners.
This policy is similar to the policy created by CreateLBCookieStickinessPolicy, except that the lifetime of the special Elastic Load Balancing cookie follows the lifetime of the application-generated cookie specified in the policy configuration. The load balancer only inserts a new stickiness cookie when the application response includes a new application cookie.
If the application cookie is explicitly removed or expires, the session stops being sticky until a new application cookie is issued.
Generates a stickiness policy with sticky session lifetimes controlled by the lifetime of the browser (user-agent) or a specified expiration period. This policy can only be associated only with HTTP listeners.
When a load balancer implements this policy, the load balancer uses a special cookie to track the backend server instance for each request. When the load balancer receives a request, it first checks to see if this cookie is present in the request. If so, the load balancer sends the request to the application server specified in the cookie. If not, the load balancer sends the request to a server that is chosen based on the existing load balancing algorithm.
A cookie is inserted into the response for binding subsequent requests from the same user to that server. The validity of the cookie is based on the cookie expiration time, which is specified in the policy configuration.
None may be passed for cookie_expiration_period.
Creates a new policy that contains the necessary attributes depending on the policy type. Policies are settings that are saved for your load balancer and that can be applied to the front-end listener, or the back-end application server.
Create a new load balancer for your account. By default the load balancer will be created in EC2. To create a load balancer inside a VPC, parameter zones must be set to None and subnets must not be None. The load balancer will be automatically created under the VPC that contains the subnet(s) specified.
| Parameters: |
|
|---|---|
| Return type: | |
| Returns: | The newly created boto.ec2.elb.loadbalancer.LoadBalancer |
Creates a Listener (or group of listeners) for an existing Load Balancer
| Parameters: |
|
|---|---|
| Returns: | The status of the request |
Deletes a policy from the LoadBalancer. The specified policy must not be enabled for any listeners.
Delete a Load Balancer from your account.
| Parameters: | name (string) – The name of the Load Balancer to delete |
|---|
Deletes a load balancer listener (or group of listeners)
| Parameters: |
|
|---|---|
| Returns: | The status of the request |
Remove Instances from an existing Load Balancer.
| Parameters: |
|
|---|---|
| Return type: | List of strings |
| Returns: | An updated list of instances for this Load Balancer. |
Get current state of all Instances registered to an Load Balancer.
| Parameters: |
|
|---|---|
| Return type: | |
| Returns: | list of state info for instances in this Load Balancer. |
Detaches load balancer from one or more subnets.
| Parameters: |
|
|---|---|
| Return type: | List of strings |
| Returns: | An updated list of subnets for this Load Balancer. |
Remove availability zones from an existing Load Balancer. All zones must be in the same region as the Load Balancer. Removing zones that are not registered with the Load Balancer has no effect. You cannot remove all zones from an Load Balancer.
| Parameters: |
|
|---|---|
| Return type: | List of strings |
| Returns: | An updated list of zones for this Load Balancer. |
Add availability zones to an existing Load Balancer All zones must be in the same region as the Load Balancer Adding zones that are already registered with the Load Balancer has no effect.
| Parameters: |
|
|---|---|
| Return type: | List of strings |
| Returns: | An updated list of zones for this Load Balancer. |
Gets all Attributes of a Load Balancer
| Parameters: | load_balancer_name (string) – The name of the Load Balancer |
|---|---|
| Return type: | boto.ec2.elb.attribute.LbAttributes |
| Returns: | The attribute object of the ELB. |
Retrieve all load balancers associated with your account.
| Parameters: |
|
|---|---|
| Return type: | |
| Returns: | A ResultSet containing instances of boto.ec2.elb.loadbalancer.LoadBalancer |
Gets an attribute of a Load Balancer
This will make an EC2 call for each method call.
| Parameters: | |
|---|---|
| Return type: | Attribute dependent |
| Returns: | The new value for the attribute |
Changes an attribute of a Load Balancer
| Parameters: |
|---|
| Parameters: | value (string) – The new value for the attribute |
|---|---|
| Return type: | bool |
| Returns: | Whether the operation succeeded or not |
Add new Instances to an existing Load Balancer.
| Parameters: |
|
|---|---|
| Return type: | List of strings |
| Returns: | An updated list of instances for this Load Balancer. |
Sets the certificate that terminates the specified listener’s SSL connections. The specified certificate replaces any prior certificate that was used on the same LoadBalancer and port.
Replaces the current set of policies associated with a port on which the back-end server is listening with a new set of policies.
Associates, updates, or disables a policy with a listener on the load balancer. Currently only zero (0) or one (1) policy can be associated with a listener.
Given a valid region name, return a boto.ec2.elb.ELBConnection.
| Parameters: | region_name (str) – The name of the region to connect to. |
|---|---|
| Return type: | boto.ec2.ELBConnection or None |
| Returns: | A connection to the given region, or None if an invalid region name is given |
Get all available regions for the ELB service.
| Return type: | list |
|---|---|
| Returns: | A list of boto.RegionInfo instances |
Represents an EC2 Access Point Health Check. See Configuring a Health Check for a walkthrough on configuring load balancer health checks.
| Variables: |
|
|---|
In the case where you have accessed an existing health check on a load balancer, this method applies this instance’s health check values to the load balancer it is attached to.
Note
This method will not do anything if the access_point attribute isn’t set, as is the case with a newly instantiated HealthCheck instance.
Represents the state of an EC2 Load Balancer Instance
| Variables: |
|
|---|
Represents an EC2 Load Balancer Listener tuple
Backend server description
Represents an EC2 Load Balancer.
| Variables: |
|
|---|
Applies security groups to the load balancer. Applying security groups that are already registered with the Load Balancer has no effect.
| Parameters: | security_groups (string or List of strings) – The name of the security group(s) to add. |
|---|
Attaches load balancer to one or more subnets. Attaching subnets that are already registered with the Load Balancer has no effect.
| Parameters: | subnets (string or List of strings) – The name of the subnet(s) to add. |
|---|
Configures the health check behavior for the instances behind this load balancer. See Configuring a Health Check for a walkthrough.
| Parameters: | health_check (boto.ec2.elb.healthcheck.HealthCheck) – A HealthCheck instance that tells the load balancer how to check its instances for health. |
|---|
Delete this load balancer.
Deletes a policy from the LoadBalancer. The specified policy must not be enabled for any listeners.
Remove instances from this load balancer. Removing instances that are not registered with the load balancer has no effect.
| Parameters: | instances (list) – List of instance IDs (strings) that you’d like to remove from this load balancer. |
|---|
Detaches load balancer from one or more subnets.
| Parameters: | subnets (string or List of strings) – The name of the subnet(s) to detach. |
|---|
Turns off CrossZone Load Balancing for this ELB.
| Return type: | bool |
|---|---|
| Returns: | True if successful, False if not. |
Disable availability zones from this Access Point.
| Parameters: | zones (string or List of strings) – The name of the zone(s) to add. |
|---|
Turns on CrossZone Load Balancing for this ELB.
| Return type: | bool |
|---|---|
| Returns: | True if successful, False if not. |
Enable availability zones to this Access Point. All zones must be in the same region as the Access Point.
| Parameters: | zones (string or List of strings) – The name of the zone(s) to add. |
|---|
Gets the LbAttributes. The Attributes will be cached.
| Parameters: | force (bool) – Ignore cache value and reload. |
|---|---|
| Return type: | boto.ec2.elb.attributes.LbAttributes |
| Returns: | The LbAttribues object |
Returns a list of boto.ec2.elb.instancestate.InstanceState objects, which show the health of the instances attached to this load balancer.
| Return type: | list |
|---|---|
| Returns: | A list of InstanceState instances, representing the instances attached to this load balancer. |
Identifies if the ELB is current configured to do CrossZone Balancing.
| Parameters: | force (bool) – Ignore cache value and reload. |
|---|---|
| Return type: | bool |
| Returns: | True if balancing is enabled, False if not. |
Adds instances to this load balancer. All instances must be in the same region as the load balancer. Adding endpoints that are already registered with the load balancer has no effect.
| Parameters: | instances (list) – List of instance IDs (strings) that you’d like to add to this load balancer. |
|---|


[gecode-users] minimodel question
Gustavo Gutierrez
gutierrez.gustavo at uclouvain.be
Tue Mar 24 18:45:08 CET 2009
Hello,
After migrating my code to gecode 3.0, I am having a problem when
posting a constraint on a boolean relation. The file attached compiles
with gecode 3.0 but when executing it I got a bus error (a
segmentation fault, I think). The file contains mostly a
simplification of my code but it is good enough to exhibit the
behavior.
The only constraint I am posting is:
post(*this, tt(imp(~(x == 1), ~(y != 1))));
which seems to be valid according with the specification presented in
modeling.pdf at page 54.
Thanks in advance,
Gustavo
-------------- next part --------------
A non-text attachment was scrubbed...
Name: test.cpp
Type: application/octet-stream
Size: 920 bytes
Desc: not available
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20090324/e304cf8d/attachment.obj>
More information about the gecode-users
mailing list


Compiling MingW based projects with Eclipse.
These instructions will show you how to setup Eclipse to compile MingW c projects. Specifically we will show how to compile Git for Windows with Eclipse using the MsysGit build environment. The following will be possible once this is complete:
- Compiling
- Code Completion
- Control + Left Mouse click to go to definition
- Place Breakpoints
- Inspect variables
Just follow these steps:
- Download and install the Eclipse IDE for C/C++ Developers from eclipse.org
Note: You may need to install the JDK in order to get Eclipse up and running - Clone the MsysGit build environment "recursively" from
https://github.com/msysgit/msysgit.git
- Start up eclipse and choose a workspace path as it wishes.
- Once in Eclipse go to Window -> Preferences -> General -> C/C++ -> Build -> Environment. Choose to Add a new variable called PATH. Add the two paths shown below seperated by a semi-colon as they would be in your environment.
Also be sure that the "Append variable to native environment" is checked.D:\Dev\msysgit\mingw\bin;D:\Dev\msysgit\bin
- Open up your existing project.
File -> New -> Makefile Project with Existing Code - Set the path to your existing code location.
- Go into the project properties.
- Under C/C++ Build -> Tool Chain Editor:
Set the current builder to "Gnu Make Builder"
- Under C/C++ Build -> Builder Settings:
Uncheck "Use default build command".
Uncheck "Generate Makefiles automatically".
Set the build directory to "${ProjDirPath}\.
- Under C/C++ Build -> Behaviour:
Set build (Incremental build) to "install"
- Try building and you should have success


Pig Dice
Rules
Be the first player to reach 100 points.
Lets Play!.
PLAYER 1
PLAYER 2
PLAY!
Score:
Wins:
Roll dice
Hold
Roll:
Current score:
Score:
Wins:
roll dice
hold
Player one roll: "z"
Player two roll: "/"
Hold: Space


I ought to have explained that the piece entitled The Cruel Sea was simply a list of titles of the books currently being written by bestselling paperbackist Pebblehead. He always has a number of works on the go at any one time, expertly juggling everything in that big baked potato-like head of his. Hooting Yard reader Dr Ruth Pastry tells me that she is drawing a diagram of Pebblehead's head, or more precisely of the innards of his head, which she wants me to post here when it is finished. That means we will all have a better, and long overdue, insight into the great paperbackist's fantastic brain, in diagrammatic form, with arrows.
NOTE : Dr Pastry says her diagram will be without arrows.


| 1 | /* | |
| 2 | * Licensed to the Apache Software Foundation (ASF) under one or more | |
| 3 | * contributor license agreements. See the NOTICE file distributed with | |
| 4 | * this work for additional information regarding copyright ownership. | |
| 5 | * The ASF licenses this file to You under the Apache License, Version 2.0 | |
| 6 | * (the "License"); you may not use this file except in compliance with | |
| 7 | * the License. You may obtain a copy of the License at | |
| 8 | * | |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 10 | * | |
| 11 | * Unless required by applicable law or agreed to in writing, software | |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, | |
| 13 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 14 | * See the License for the specific language governing permissions and | |
| 15 | * limitations under the License. | |
| 16 | */ | |
| 17 | package org.apache.commons.io.filefilter; | |
| 18 | ||
| 19 | import java.io.File; | |
| 20 | import java.io.IOException; | |
| 21 | import java.io.RandomAccessFile; | |
| 22 | import java.io.Serializable; | |
| 23 | import java.nio.charset.Charset; | |
| 24 | import java.util.Arrays; | |
| 25 | ||
| 26 | /** | |
| 27 | *
 | |
| 28 | * File filter for matching files containing a "magic number". A magic number | |
| 29 | * is a unique series of bytes common to all files of a specific file format. | |
| 30 | * For instance, all Java class files begin with the bytes | |
| 31 | * 0xCAFEBABE. | |
| 32 | *
 | |
| 33 | * | |
| 34 | *
 | |
| 35 | * File dir = new File("."); | |
| 36 | * MagicNumberFileFilter javaClassFileFilter = | |
| 37 | * MagicNumberFileFilter(new byte[] {(byte) 0xCA, (byte) 0xFE, | |
| 38 | * (byte) 0xBA, (byte) 0xBE}); | |
| 39 | * String[] javaClassFiles = dir.list(javaClassFileFilter); | |
| 40 | * for (String javaClassFile : javaClassFiles) { | |
| 41 | * System.out.println(javaClassFile); | |
| 42 | * } | |
| 43 | *
 | |
| 44 | * | |
| 45 | *
 | |
| 46 | * Sometimes, such as in the case of TAR files, the | |
| 47 | * magic number will be offset by a certain number of bytes in the file. In the | |
| 48 | * case of TAR archive files, this offset is 257 bytes. | |
| 49 | *
 | |
| 50 | * | |
| 51 | *
 | |
| 52 | * File dir = new File("."); | |
| 53 | * MagicNumberFileFilter tarFileFilter = | |
| 54 | * MagicNumberFileFilter("ustar", 257); | |
| 55 | * String[] tarFiles = dir.list(tarFileFilter); | |
| 56 | * for (String tarFile : tarFiles) { | |
| 57 | * System.out.println(tarFile); | |
| 58 | * } | |
| 59 | *
 | |
| 60 | * | |
| 61 | * @since 2.0 | |
| 62 | * @see FileFilterUtils#magicNumberFileFilter(byte[]) | |
| 63 | * @see FileFilterUtils#magicNumberFileFilter(String) | |
| 64 | * @see FileFilterUtils#magicNumberFileFilter(byte[], long) | |
| 65 | * @see FileFilterUtils#magicNumberFileFilter(String, long) | |
| 66 | */ | |
| 67 | public class MagicNumberFileFilter extends AbstractFileFilter implements | |
| 68 | Serializable { | |
| 69 | ||
| 70 | /** | |
| 71 | * The serialization version unique identifier. | |
| 72 | */ | |
| 73 | private static final long serialVersionUID = -547733176983104172L; | |
| 74 | ||
| 75 | /** | |
| 76 | * The magic number to compare against the file's bytes at the provided | |
| 77 | * offset. | |
| 78 | */ | |
| 79 | private final byte[] magicNumbers; | |
| 80 | ||
| 81 | /** | |
| 82 | * The offset (in bytes) within the files that the magic number's bytes | |
| 83 | * should appear. | |
| 84 | */ | |
| 85 | private final long byteOffset; | |
| 86 | ||
| 87 | /** | |
| 88 | *
 | |
| 89 | * Constructs a new MagicNumberFileFilter and associates it with the magic | |
| 90 | * number to test for in files. This constructor assumes a starting offset | |
| 91 | * of 0. | |
| 92 | *
 | |
| 93 | * | |
| 94 | *
 | |
| 95 | * It is important to note that the array is not cloned and that | |
| 96 | * any changes to the magic number array after construction will affect the | |
| 97 | * behavior of this file filter. | |
| 98 | *
 | |
| 99 | * | |
| 100 | *
 | |
| 101 | * MagicNumberFileFilter javaClassFileFilter = | |
| 102 | * MagicNumberFileFilter(new byte[] {(byte) 0xCA, (byte) 0xFE, | |
| 103 | * (byte) 0xBA, (byte) 0xBE}); | |
| 104 | *
 | |
| 105 | * | |
| 106 | * @param magicNumber the magic number to look for in the file. | |
| 107 | * | |
| 108 | * @throws IllegalArgumentException if magicNumber is | |
| 109 | * {@code null}, or contains no bytes. | |
| 110 | */ | |
| 111 | public MagicNumberFileFilter(final byte[] magicNumber) { | |
| 112 | this(magicNumber, 0); | |
| 113 | } | |
| 114 | ||
| 115 | /** | |
| 116 | *
 | |
| 117 | * Constructs a new MagicNumberFileFilter and associates it with the magic | |
| 118 | * number to test for in files. This constructor assumes a starting offset | |
| 119 | * of 0. | |
| 120 | *
 | |
| 121 | * | |
| 122 | * Example usage: | |
| 123 | *
 | |
| 124 | * {@code | |
| 125 | * MagicNumberFileFilter xmlFileFilter = | |
| 126 | * MagicNumberFileFilter("<?xml"); | |
| 127 | * } | |
| 128 | *
 | |
| 129 | * | |
| 130 | * @param magicNumber the magic number to look for in the file. | |
| 131 | * The string is converted to bytes using the platform default charset. | |
| 132 | * | |
| 133 | * @throws IllegalArgumentException if magicNumber is | |
| 134 | * {@code null} or the empty String. | |
| 135 | */ | |
| 136 | public MagicNumberFileFilter(final String magicNumber) { | |
| 137 | this(magicNumber, 0); | |
| 138 | } | |
| 139 | ||
| 140 | /** | |
| 141 | *
 | |
| 142 | * Constructs a new MagicNumberFileFilter and associates it with the magic | |
| 143 | * number to test for in files and the byte offset location in the file to | |
| 144 | * to look for that magic number. | |
| 145 | *
 | |
| 146 | * | |
| 147 | *
 | |
| 148 | * MagicNumberFileFilter tarFileFilter = | |
| 149 | * MagicNumberFileFilter("ustar", 257); | |
| 150 | *
 | |
| 151 | * | |
| 152 | * @param magicNumber the magic number to look for in the file. | |
| 153 | * The string is converted to bytes using the platform default charset. | |
| 154 | * @param offset the byte offset in the file to start comparing bytes. | |
| 155 | * | |
| 156 | * @throws IllegalArgumentException if magicNumber is | |
| 157 | * {@code null} or the empty String, or offset is | |
| 158 | * a negative number. | |
| 159 | */ | |
| 160 | public MagicNumberFileFilter(final String magicNumber, final long offset) { | |
| 161 |
1
1. |
if (magicNumber == null) { |
| 162 | throw new IllegalArgumentException("The magic number cannot be null"); | |
| 163 | } | |
| 164 |
1
1. |
if (magicNumber.isEmpty()) { |
| 165 | throw new IllegalArgumentException("The magic number must contain at least one byte"); | |
| 166 | } | |
| 167 |
2
1. 2. |
if (offset < 0) { |
| 168 | throw new IllegalArgumentException("The offset cannot be negative"); | |
| 169 | } | |
| 170 | ||
| 171 | this.magicNumbers = magicNumber.getBytes(Charset.defaultCharset()); // explicitly uses the platform default | |
| 172 | // charset | |
| 173 | this.byteOffset = offset; | |
| 174 | } | |
| 175 | ||
| 176 | /** | |
| 177 | *
 | |
| 178 | * Constructs a new MagicNumberFileFilter and associates it with the magic | |
| 179 | * number to test for in files and the byte offset location in the file to | |
| 180 | * to look for that magic number. | |
| 181 | *
 | |
| 182 | * | |
| 183 | *
 | |
| 184 | * MagicNumberFileFilter tarFileFilter = | |
| 185 | * MagicNumberFileFilter(new byte[] {0x75, 0x73, 0x74, 0x61, 0x72}, 257); | |
| 186 | *
 | |
| 187 | * | |
| 188 | *
 | |
| 189 | * MagicNumberFileFilter javaClassFileFilter = | |
| 190 | * MagicNumberFileFilter(new byte[] {0xCA, 0xFE, 0xBA, 0xBE}, 0); | |
| 191 | *
 | |
| 192 | * | |
| 193 | * @param magicNumber the magic number to look for in the file. | |
| 194 | * @param offset the byte offset in the file to start comparing bytes. | |
| 195 | * | |
| 196 | * @throws IllegalArgumentException if magicNumber is | |
| 197 | * {@code null}, or contains no bytes, or offset | |
| 198 | * is a negative number. | |
| 199 | */ | |
| 200 | public MagicNumberFileFilter(final byte[] magicNumber, final long offset) { | |
| 201 |
1
1. |
if (magicNumber == null) { |
| 202 | throw new IllegalArgumentException("The magic number cannot be null"); | |
| 203 | } | |
| 204 |
1
1. |
if (magicNumber.length == 0) { |
| 205 | throw new IllegalArgumentException("The magic number must contain at least one byte"); | |
| 206 | } | |
| 207 |
2
1. 2. |
if (offset < 0) { |
| 208 | throw new IllegalArgumentException("The offset cannot be negative"); | |
| 209 | } | |
| 210 | ||
| 211 | this.magicNumbers = new byte[magicNumber.length]; | |
| 212 |
1
1. |
System.arraycopy(magicNumber, 0, this.magicNumbers, 0, magicNumber.length); |
| 213 | this.byteOffset = offset; | |
| 214 | } | |
| 215 | ||
| 216 | /** | |
| 217 | *
 | |
| 218 | * Accepts the provided file if the file contains the file filter's magic | |
| 219 | * number at the specified offset. | |
| 220 | *
 | |
| 221 | * | |
| 222 | *
 | |
| 223 | * If any {@link IOException}s occur while reading the file, the file will | |
| 224 | * be rejected. | |
| 225 | *
 | |
| 226 | * | |
| 227 | * @param file the file to accept or reject. | |
| 228 | * | |
| 229 | * @return {@code true} if the file contains the filter's magic number | |
| 230 | * at the specified offset, {@code false} otherwise. | |
| 231 | */ | |
| 232 | @Override | |
| 233 | public boolean accept(final File file) { | |
| 234 |
3
1. accept : negated conditional → KILLED 2. accept : negated conditional → KILLED 3. accept : negated conditional → KILLED |
if (file != null && file.isFile() && file.canRead()) { |
| 235 | try { | |
| 236 | try (RandomAccessFile randomAccessFile = new RandomAccessFile(file, "r")) { | |
| 237 | final byte[] fileBytes = new byte[this.magicNumbers.length]; | |
| 238 |
1
1. accept : removed call to java/io/RandomAccessFile::seek → KILLED |
randomAccessFile.seek(byteOffset); |
| 239 | final int read = randomAccessFile.read(fileBytes); | |
| 240 |
1
1. accept : negated conditional → KILLED |
if (read != magicNumbers.length) { |
| 241 | return false; | |
| 242 | } | |
| 243 | return Arrays.equals(this.magicNumbers, fileBytes); | |
| 244 | } | |
| 245 | } | |
| 246 | catch (final IOException ioe) { | |
| 247 | // Do nothing, fall through and do not accept file | |
| 248 | } | |
| 249 | } | |
| 250 | ||
| 251 |
1
1. accept : replaced return of integer sized value with (x == 0 ? 1 : 0) → KILLED |
return false; |
| 252 | } | |
| 253 | ||
| 254 | /** | |
| 255 | * Returns a String representation of the file filter, which includes the | |
| 256 | * magic number bytes and byte offset. | |
| 257 | * | |
| 258 | * @return a String representation of the file filter. | |
| 259 | */ | |
| 260 | @Override | |
| 261 | public String toString() { | |
| 262 | final StringBuilder builder = new StringBuilder(super.toString()); | |
| 263 | builder.append("("); | |
| 264 | builder.append(new String(magicNumbers, Charset.defaultCharset()));// TODO perhaps use hex if value is not | |
| 265 | // printable | |
| 266 | builder.append(","); | |
| 267 | builder.append(this.byteOffset); | |
| 268 | builder.append(")"); | |
| 269 |
1
1. toString : mutated return of Object value for org/apache/commons/io/filefilter/MagicNumberFileFilter::toString to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return builder.toString(); |
| 270 | } | |
| 271 | } | |
Mutations | ||
| 161 |
1.1 |
|
| 164 |
1.1 |
|
| 167 |
1.1 2.2 |
|
| 201 |
1.1 |
|
| 204 |
1.1 |
|
| 207 |
1.1 2.2 |
|
| 212 |
1.1 |
|
| 234 |
1.1 2.2 3.3 |
|
| 238 |
1.1 |
|
| 240 |
1.1 |
|
| 251 |
1.1 |
|
| 269 |
1.1 |


Lufthansa only interested in 'restructured' Alitalia: CEO
German airline Lufthansa is only interested in investing in struggling Italian airline Alitalia , which is running out of cash and racing to find new funds, once it has been restructured, its chief executive said on Thursday.
BERLIN: German airline Lufthansa is only interested in investing in struggling Italian airline Alitalia , which is running out of cash and racing to find new funds, once it has been restructured, its chief executive said on Thursday.
"The technical restructuring of taking elements out, people out needs to be done by the current ownership before we can see ourselves getting involved here," Carsten Spohr told analysts after Lufthansa reported third quarter results.
"We are interested to look at a restructured new Alitalia, if it makes sense to us and our shareholders, our staff and our customers due to the importance of the Italian market."
On Wednesday, Alitalia's administrators said they had no preferred option between Delta Air Lines and Lufthansa, the two groups talking with rail operator Ferrovie dello Stato about a rescue for the Italian carrier.
Ferrovie, which is leading a state-orchestrated effort to rescue Alitalia, will have to choose between the two foreign carriers in the next weeks as the financial performance of Alitalia was deteriorating, the administrators said.
Delta and Lufthansa belong to rival respective airline alliances and are both interested in the lucrative Italian market, one of the world's top tourism destinations which is seeing good growth in foreign visitors.
Lufthansa wrote to Ferrovie recently offering a commercial partnership with Alitalia and saying it could take a stake in the carrier under certain conditions to be agreed with other partners.
Last week, sources close to the matter said Lufthansa is ready to invest up to 200 million euros (US$221.72 million) in Alitalia, while Delta has said it is prepared to put 100 million euros in the Italian airline.
(Reporting by Ilona Wissenbach, writing by Emma Thomasson, editing by Thomas Escritt)


Best television one-time-event 1978: The Star Wars Holiday Special
by Jason WeisbergerOften remembered but rarely seen: The Star Wars Holiday Special is a variety show most remarkable for how unenthusiastic, or inebriated, the cast was. It is currently viewable on YouTube.
Recently referenced in The Mandalorian, Life Day is faux Wookie Christmas; apparently uncelebrated for 41 years.
I have a friend who is still grousing that the Hulk was held up for this genre mash-up nonpareil.
Pretty sure shitty Life Day presents is how we got Kylo Ren. I hope Lumpy is the surprise reveal in Rise of the Skywalker. Lumpy is cool.


"I think the most wonderful thing in the world is another chef. I'm always excited about learning new things about food."
"A chef is a mixture maybe of artistry and craft. You have to learn the craft really to get there."
"Anyone who's a chef, who loves food, ultimately knows that all that matters is: 'Is it good? Does it give pleasure?' "


Raphael Rosalen is a Cinema and Media Studies undergraduate student at the University of Southern California’s School of Cinematic Arts, where he also serves as the president of the Undergraduate Student Council, and a multimedia artist. Interested in celebrity and popular culture and feminism theory, Raphael recently won an award for a research paper on gender equality in Hollywood in 2016. Raphael is also interested in technology and how it can augment audiovisual content. He is currently working towards becoming a cinema and media scholar, creating a visual EP emphasizing new technology in music and filmmaking, and writing for a new media critique project. Some of his favorite movies are Sunset Boulevard, Blue Jasmine, and The Bling Ring.


Design challenges based on prompts to practice UI patterns, frameworks and standards.
UI Design
Motion design
These challenges are an effort to work towards becoming an expert in UI patterns and design elements. Ideally I will be spending a few hours on each design that could be used for mobile and responsive web or an app. I'll deviate from this baseline goal if I have more time or get excited about a specific project.
I want to include the entirety of my process here, and the origins of each project is a good way to begin this page. Before starting on a project digitally, I sketch my ideas in a notebook. Not all parts make it into the final digital design, and sometimes the digital version looks different as I work through it on the screen. Because I sometimes have multiple projects per page, I simply photographed the pages of my sketchbook and put them in the gallery to the right here.
I used the bookmarks bar on a web browser for this one because I always notice how cluttered any bookmarks manager is.
I promise to leave the blue and white behind next time! This is a simple animation of a subscribe action for an email list. I designed the letters and mailbox in Illustrator and brought them into Sketch. Given more time, I'd work on those longer.
This smart TV remote includes a normal, expected remote interface as well as a more robust, forward thinking interface.
The first screen is a clean expression of what one would typically expect from a remote. I decided to use the bare minimum of TV operations. The number pad is accessible via button press so as not to clutter the screen. I decided on a touch target size (shown below the video) which drove my organization of the screen.
The second screen is closer to streaming services, which allows searching the TV directory for channels and shows as well offering recommendations on currently based on watching history. Below the suggestions, quick access to favorite channels are populated based on history as well. Finally, access to a full TV guide resides at the bottom of the screen, for in depth exploration of past, current and future content.
The mobile form factor seemed most appropriate for this boarding pass because to actually be of use, it must be presentable. I began by organizing the key information for a boarding pass:
After sketching out wireframes, I realized the scannable QR or bar code takes up a significant amount of space. Rather than leave any part of the pass hidden (via scroll or otherwise) I made it interactive. By tapping the button on the bottom, the QR code expands for scanning.
Key information is highlighted in a much brighter blue for quick reference.
When thinking about an onboarding process, I decided to modify an existing one that I thought had an opportunity to be improved.
Instagram's onboarding process suggests finding Facebook friends to follow but neglects to offer finding popular accounts that are no one's "friends" -- accounts that offer cute dogs, travel photos and food photos. I mapped the onboarding process to decide where to put the new steps, which fit in neatly after finding friends on Facebook.
To find accounts, I created a screen that asks users what they're interested in which populates the following screen with example photos of accounts they may be interested in following.
Map of onboarding flow and opportunity area. Map of onboarding flow and opportunity area.
I followed Instagram's design style -- the Instagram card is a well established paradigm and swiping to see more accounts is a familiar action on other platforms. When the user decides they've followed enough accounts, pressing "done" at the bottom moves to already existing next step, uploading a profile photo.
I used Sketch to design the mockups and Principle to animate them. I worked through many variations of the interface design before arriving at the final design.
I tried to make a search logo, search bar, and options / profile top bar that would be able to accommodate any background photo. By applying a subtle background gradient from the top down, the top bar looks the same stylistically as the search bar but is more legible.
I made the "City Search" logo in Illustrator and brought that into Sketch, where the rest was designed.
The first challenge for this design was figuring what was important to show -- after considering many details I decided on temperature, lights, and doors. Thinking through current wattage usage, time of heat or air conditioning on, etc, I decided that simple was better. I also fought with allowing change directly from the cards, but decided this would be too overwhelming and complicated. The user will be able to control aspects of their home by pressing figure they wish to interact with instead. A room selector allows monitoring of individual rooms.
The temperature displays what the desired temperature is as well as if it is heating or cooling to achieve it.
The lights are indicated as on or off quickly with the color of the bulb, but also in text form underneath. A bar displays the relative percentage of time off to on in the room.
Finally, the amount of doors open are shown as quick reference followed by a more complete list of the status of doors (be it open, closed, or locked).
My location tracker features three phases of the day: Morning, afternoon and evening -- on the right side the current location is highlighted in blue.
The map reflects the gray and blue color indicating point in the day. The blue path shows the most recently travelled route.
My past few designs have been fairly restrained so for this I wanted to be more creative by using images breaking out of their boxes and a multi part container. I put dogs up head to head in this leaderboard design using information sourced from the great We Rate Dogs Twitter account.
The badge on the photos of the dogs is their rating (out of 10), I included this information along with their names, breed, and on the lower container, the rank.
Finally, I designed the lower container to be a standard list while the top part features the two dogs facing off to be number one.
Recently I used a carbon emissions calculator to see how much I was contributing to global warming, and it got me thinking that reflecting on transportation as it relates to this would be a useful tool. Here I've used a bar graph to plot the distance in miles travelled per day and what mode of transportation was used. The line graph part shows how much carbon emissions were emitted daily.
This receipt is for a Miir vacuum sealed water bottle, a favorite item that I own. I decided to group information in item and order details, followed by the ability to print your receipt in case you need to return the item in person.
This is a small pop up asking a website visitor to sign up for a newsletter. After creating the one on the left, I realized that it could be quickly adapted to many different companies by changing the logo and font style, which lead me to create the version on the right.
This button represents on and off states. It's simple!
I wanted to use more organic forms as my past few items have been very angular. This countdown timer has the running time prominently and the original time set above. Below the time a bar shows a visual display of the countdown. Finally, the two main actions are pause and stop. After pause would turn to play and stop to reset.
Chat apps have a surprising amount of information that needs to be displayed. After making this I now appreciate that! My design is still missing a number of items such as entire friends list, timestamps, emojis (which we all know are the most important feature) and I'm sure other things.
I did want to include contextual actions, so when $8 is typed the opportunity to pay that amount of money is added in line.
I created a single item e-commerce page for the Google Pixel. As an Android phone user, I'm really excited about this phone and what it means for Google!
The past few challenge items I've used a lot of color and I wanted to be more minimal for today's design so I drew influence from Google's marketing materials.
I designed an interface to control lights belonging to a smart home system. The overview of the room is meant to show where each light is located. Gray lights are off, and the lower opacity ones are not currently in the group selected. The "living room" group is selected and all the lights are on, shown by their full color -- the specific light selected is highlighted in blue.
Settings on the left show light name, offers an easy on/off of the light, allow color and schedule adjustments, and grouping.
Settings on the left show light name, offers an easy on/off of the light, allow color and schedule adjustments, and grouping.
This was another one that I wanted to animate, since the message would likely be updating on the page as the user tried to submit something. It's intended to be a confirmation that they were able to log in.
Motion seemed like a key component of this UI element so I animated the interaction. Following the share confirmation, a modal would appear to confirm details of the share.
I love album artwork and wanted to design a player that featured it prominently. The two instances of the players have shuffle and repeat turned on and off, and are also songs I've been listening to a lot lately. I chose the red gradient because it offers identity and stands out in the player.
I tried to design a different background rather than a photo or a gradient, and rounded the corners which I thought contrasted with the sharper line in the background.
I created a general online profile page that lists a name, a few details about who the person is and their social media following. We're defined oftentimes how much information is available to us online, so I thought that would be important information for a profile. Finally, the call to action is to message.
I couldn't decide which version I liked best, so I put them both here.
I took advantage of this opportunity to create an icon for the Eos app. Inspired by the transition to the night and day, the pillow replaces the sun and moon, alluding to the alarm functionality of the app.
I stuck to the basics today, and made a simple calculator. While status bar is clearly iOS, this design would work equally well across platforms. I emphasized the numbers above the operators.
Pressing equal moves the answer of the current equation to the top so that more can be done to it if desired.
This prompt was to create a landing page for a product, person, etc. I chose to create a landing page for Tobacco, a fantastic artist (if you haven't listened, do so!)
Featured on the home page is his latest album with the call to action of "Order Now" and reviews and commentary on the album.
Given more time, I would animate the smoky backdrop. Some subtle movement would turn this already interesting photo into something mesmerizing.
Today I design the credit card form as a UI "card". The thought behind this format is that it could be adaptable to mobile or web. Behind the current credit card, there are two different saved cards.
The CVV code is a piece of information to prompt -- its the only piece that is on the back of the card. Here I solved the challenge by creating a tiny version of the credit card next to the prompt.
In addition to creating a single sign up screen using Sketch, I animated the process. See it in action in the video. I designed the screen to be used for a responsive website as well, as seen below the mobile UI flow.


{include file="public/_header" type="list" /} {include file="top/search" url="/image/index" model="image"} {include file="top/curd" addurl="/image/edit" delurl="/image/del"}


Before Change
databases.add(database)
// keep track of unique labels
for label in current_file["annotation"].labels():
label = get_label_identifier(label, current_file)
labels.add(label)
annotated = get_annotated(current_file)
if isinstance(self.feature_extraction, Precomputed) and \
not self.feature_extraction.use_memmap:
After Change
databases.add(database)
// keep track of unique labels
labels.update(current_file["annotation"].labels())
annotated = get_annotated(current_file)
if isinstance(self.feature_extraction, Precomputed) and \


Ensure your loved one is well looked after with respite care breaks in Derby
Sherwood Forest provides dementia, nursing and palliative care in addition to residential and respite care
by Leena SidatWhen caring for a loved one at home, full time, it’s important to take the opportunity to have a rest and recharge your batteries.
Part of Sanctuary Care, Sherwood Forest Residential and Nursing Home in Normanton provides short-term respite care breaks to give you this deserved time, whilst assuring you that your loved one will be well cared for.
Based on Village Street, the home offers respite care for anything from one to six weeks, enabling carers to take a holiday or simply a break of their own, safe in the knowledge that their loved one is being cared for by the team.
One carer, Elsie looks after her husband Jack, who has Parkinson’s disease, and books regular respite breaks with Sanctuary Care for Jack, so that she can have a couple of weeks to herself, with the peace of mind that her husband is safe and happy.
Elsie said, "Respite care is a blessing and the freedom it gives me is remarkable. It is a wonderful care home, the team are lovely and Jack is happy there."
Respite care breaks are also available for people who live independently - perhaps your family are going on holiday and you would like some company.
With every respite break, Sherwood Forest ensures you have your own bedroom, and its dedicated team is on hand around the clock to provide care tailored to your individual needs.
There are delicious home-cooked meals, including freshly baked cakes for afternoon tea, fantastic activities, and of course, the company of other residents and the team.
Sherwood Forest Residential and Nursing Home is located at 29 Village Street, Normanton, Derby, DE23 8TA.
To find out more, visit the website or call 01332 271 941.


GONE IN SIXTY SECONDS (Touchstone) Starring: Nicolas Cage, Giovanni Ribisi, Angelina Jolie, Delroy Lindo, TJ Cross, Chi McBride, Robert Duvall, Will Patton, William Lee Scott, Scott Caan, James Duval, Timothy Olyphant, Christopher Eccleston, Vinnie Jones. Screenplay: Scott Rosenberg. Producers: Jerry Bruckheimer and Mike Stenson. Director: Dominic Sena. MPAA Rating: PG-13 (profanity, violence, adult themes, brief nudity) Running Time: 119 minutes. Reviewed by Scott Renshaw.
In an ever-changing world, there's something understandably comforting about the impressive sameness of Jerry Bruckheimer productions. Going back to his partnership with the late Don Simpson, Bruckheimer has built an impressive 15-year resume of box office successes: BEVERLY HILLS COP, TOP GUN, BAD BOYS, THE ROCK, CON AIR, ENEMY OF THE STATE, ARMAGEDDON. There's a formula to his films that has rarely let him down, a formula that continues with nary a whiff of change in GONE IN SIXTY SECONDS. Since this is a Bruckheimer film, you know you can count on ...
1) A premise ready-made for action. Nicolas Cage stars as Randall "Memphis" Raines, once the best "booster" in Southern California, now retired. He's dragged back into his old trade when his younger brother Kip (Giovanni Ribisi) screws up while attempting to follow in his footsteps, leaving nasty crime boss Raymond Calitri (Christopher Eccleston) with an attitude and a job still to be done. In order to save Kip's skin, Memphis agrees to fulfill Kip's contract: stealing 50 high-end cars. Unfortunately, the delivery date is only three days away, leaving Memphis with little time to put together his crew and scout out the job, all the while trying to avoid an old law enforcement nemesis (Delroy Lindo) who's breathing down his neck.
2) A style that transcends individual directors. It doesn't matter whether Bruckheimer's flavor of the month is Tony Scott, Michael Bay, Simon West or SIXTY SECONDS' helmer Dominic Sena -- his films all seem to look and sound exactly the same. Perhaps it's the fact that Bruckheimer is attracted to directors whose background (like his) is in commercials and music videos, making them likely to concur with his vision of glossy packaging. Maybe he gets his people such great deals on orange lens filters that it's impossible for those directors not to employ them for every single shot. Whatever the reason, the quick-cuts, bombastic musical scoring and burnished glow give Bruckheimer films that certain grandiose flash that makes for action gold, even if nothing else makes much sense because of
3) Over-stuffed scripts. In his recent efforts, Bruckheimer has shown a distinct inability to strip down an action story to its essentials. GONE IN SIXTY SECONDS is no exception, dragging the pacing down by cramming too many characters into the narrative. That can result in absurd decisions like creating a solid, vicious villain in Eccleston, then having his character disappear for literally 80 minutes of the running time, or similarly wasting the forceful presence of Vinnie Jones (as Memphis' mute, muscular associate). It also results in conflicts constructed with a faux-operatic sense of consequence.  Those decisions are complicated, for better and worse, by ...
4) Provocative casting. Bruckheimer has shown himself to be a savvy packager of talent in recent years, generally teaming up popular stars with established "serious" actors for a sense of credibility: Tom Cruise and Robert Duvall in DAYS OF THUNDER, Will Smith and Gene Hackman in ENEMY OF THE STATE, Cage with Sean Connery in THE ROCK. Cage and Duvall are both back for GONE IN SIXTY SECONDS, as is the characteristically diverse Bruckheimer supporting cast. Somehow, it does make many of Bruckheimer's films feel less awful than they should that there are fairly talented actors involved (Cage's descent into genre nonchalance notwithstanding).  Or, "How deep is he in?" "Deep." Or, "I'm not into the life any more." Of course, plenty of viewers will still lap it all up because it all comes coated in ...
5) Buckets full of testosterone. Eventually, Bruckheimer films do move, albeit with a carefully constructed familiarity. The climactic car chase in SIXTY SECONDS is a competent piece of film work, accentuated by Sena's fetishistic cross-cutting to brakes and clutches, and a car jump as aggressively improbable as anything since SPEED. It's simply obvious that the whole film was constructed around that chase, making me wish the film-makers could be more honest about their intentions instead of lobbing a dozen pointless sub-plots at us. Those who have enjoyed most of Bruckheimer's previous films aren't likely to look disdainfully at this one, because it goes nowhere different. It's just another over-blown, sporadically diverting celebration of guy stuff. The names have changed, but the orange filters remain the same.
On the Renshaw scale of 0 to 10 auto pilots: 4.
Visit Scott Renshaw's Screening Room http://www.inconnect.com/~renshaw/ *** Subscribe to receive new reviews directly by email! See the Screening Room for details, or reply to this message with subject "Subscribe".
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


If you reload the server, you will need to enter the email and password again if using this credential system. It is so, so your password or email is not stored on the server. If you instead use the TokenV2 login method it will be saved and used on the next startup of the server.
If you enter a clarifai api key, clarifai will be used. (Clarifai is cloud base, non gpu dependant, image is tagged on clarifai's servers) if you leave it blank it will use local tensorflow (will use cores of your server but image will be processed locally)
If you have downloaded the iphone app, you can scan this QR Code, so you configure the app in seconds.


--- layout: post title: 'Ep 15: Juli James - Journalism, Game Engines, and Women Who Code' date: 2017-05-03 13:10:56.000000000 -05:00 type: post parent_id: '0' published: true password: '' status: publish categories: - Podcast tags: [] meta: _edit_last: '3' slide_template: default _at_widget: '1' _yoast_wpseo_content_score: '30' fw:opt:ext:pb:page-builder:json: "[]" fw_options: a:7:{s:12:"page-builder";a:2:{s:4:"json";s:2:"[]";s:14:"builder_active";b:0;}s:9:"title_bar";s:7:"default";s:15:"footer_settings";s:7:"default";s:12:"header_style";a:2:{s:6:"option";s:0:"";s:11:"transparent";a:2:{s:16:"background_color";s:21:"rgba(255,255,255,0.3)";s:12:"border_color";s:0:"";}}s:12:"social_icons";s:0:"";s:12:"contact_info";s:0:"";s:12:"slider_above";a:2:{s:6:"option";s:2:"no";s:3:"yes";a:2:{s:5:"slide";s:1:"c";s:13:"scroll_effect";a:1:{s:6:"option";s:0:"";}}}} _yoast_wpseo_primary_category: '39' _yoast_wpseo_post_image_cache: a:0:{} author: login: davidbrunow email<EMAIL_ADDRESS>display_name: David Brunow first_name: David last_name: Brunow ---
Juli James never thought playing 80 hours of Zelda would turn into a bullet point on her resume. With a background in journalism, Juli treaded a decision to either focus on her journalism career or going into academics. Of course, then her and her colleagues received a grant to develop a game engine for journalists while moving to Texas which they eventually turned into a new company, Playable Media. Juli is also a big advocate to support and empower women in technology by leading the local Denton chapter for Women Who Code through regular workshops and meetups.
We talk to Juli about all things journalism, game design, education, and how the heck you even build a game engine this week on the TechMill Podcast.
Playable Media Story Builder: playablemedia.org
Twine: twinery.org
News Games Book: mitpress.mit.edu/books/newsgames
Women Who Code: www.womenwhocode.com
Startup Weekend for Designers: www.techstars.com/content/communit…startup-weekend/
Contact Juli:
Facebook: www.facebook.com/juli.james
Instagram: @wakeuplaughing
Twitter: twitter.com/wakeuplaughing
[soundcloud url="https://api.soundcloud.com/tracks/320714029" params="auto_play=false&hide_related=false&show_comments=true&show_user=true&show_reposts=false&visual=true" width="100%" height="450" iframe="true" /]


tudatpy.constants¶
Summary¶
Module containing all constants listed in the Tudat package.
Routine Listings¶
EARTH_EQUATORIAL_RADIUS
EARTH_FLATTENING_FACTOR
EARTH_GEODESY_NORMALIZED_J2
SUN_GRAVITATIONAL_PARAMETER
MERCURY_GRAVITATIONAL_PARAMETER
VENUS_GRAVITATIONAL_PARAMETER
EARTH_GRAVITATIONAL_PARAMETER
MOON_GRAVITATIONAL_PARAMETER
MARS_GRAVITATIONAL_PARAMETER
JUPITER_GRAVITATIONAL_PARAMETER
SATURN_GRAVITATIONAL_PARAMETER
URANUS_GRAVITATIONAL_PARAMETER
NEPTUNE_GRAVITATIONAL_PARAMETER
PLUTO_GRAVITATIONAL_PARAMETER
SEA_LEVEL_GRAVITATIONAL_ACCELERATION
JULIAN_DAY
JULIAN_DAY_LONG
JULIAN_YEAR_IN_DAYS
JULIAN_YEAR_IN_DAYS_LONG
JULIAN_YEAR
SIDEREAL_DAY
SIDEREAL_YEAR_IN_DAYS
SIDEREAL_YEAR
SPEED_OF_LIGHT
SPEED_OF_LIGHT_LONG
GRAVITATIONAL_CONSTANT
ASTRONOMICAL_UNIT
SPECIFIC_GAS_CONSTANT_AIR
MOLAR_GAS_CONSTANT
PLANCK_CONSTANT
BOLTZMANN_CONSTANT
STEFAN_BOLTZMANN_CONSTANT
INVERSE_SQUARE_SPEED_OF_LIGHT
INVERSE_CUBIC_SPEED_OF_LIGHT
INVERSE_QUARTIC_SPEED_OF_LIGHT
INVERSE_QUINTIC_SPEED_OF_LIGHT
VACUUM_PERMEABILITY
VACUUM_PERMITTIVITY
LG_TIME_RATE_TERM
LG_TIME_RATE_TERM_LONG
E
GOLDEN_RATIO
COMPLEX_I
PI
LONG_PI
TUDAT_NAN
-
class
Quantity
[source]¶ A ~astropy.units.Quantity represents a number with some associated unit.
See also: http://docs.astropy.org/en/stable/units/quantity.html
- Parameters
value (number, ~numpy.ndarray, Quantity object (sequence), str) – The numerical value of this quantity in the units given by unit. If a Quantity or sequence of them (or any other valid object with a
unit
attribute), creates a new Quantity object, converting to unit units as needed. If a string, it is converted to a number or Quantity, depending on whether a unit is present.unit (~astropy.units.UnitBase instance, str) – An object that represents the unit associated with the input value. Must be an ~astropy.units.UnitBase object or a string parseable by the
units
package.dtype (dtype, optional) – The dtype of the resulting Numpy array or scalar that will hold the value. If not provided, it is determined from the input, except that any integer and (non-Quantity) object inputs are converted to float by default.
copy (bool, optional) – If True (default), then the value is copied. Otherwise, a copy will only be made if
__array__
returns a copy, if value is a nested sequence, or if a copy is needed to satisfy an explicitly givendtype
. (The False option is intended mostly for internal use, to speed up initialization where a copy is known to have been made. Use with care.)order ({'C', 'F', 'A'}, optional) – Specify the order of the array. As in ~numpy.array. This parameter is ignored if the input is a Quantity and
copy=False
.subok (bool, optional) – If False (default), the returned array will be forced to be a Quantity. Otherwise, Quantity subclasses will be passed through, or a subclass appropriate for the unit will be used (such as ~astropy.units.Dex for
u.dex(u.AA)
).ndmin (int, optional) – Specifies the minimum number of dimensions that the resulting array should have. Ones will be pre-pended to the shape as needed to meet this requirement. This parameter is ignored if the input is a Quantity and
copy=False
.
- Raises
Notes
Quantities can also be created by multiplying a number or array with a
Unit
. See http://docs.astropy.org/en/latest/units/-
copy
(order='C')¶ Return a copy of the array.
- Parameters
order ({'C', 'F', 'A', 'K'}, optional) – Controls the memory layout of the copy. ‘C’ means C-order, ‘F’ means F-order, ‘A’ means ‘F’ if a is Fortran contiguous, ‘C’ otherwise. ‘K’ means match the layout of a as closely as possible. (Note that this function and
numpy.copy()
are very similar, but have different default values for their order= arguments.)
See also
numpy.copy()
,numpy.copyto()
Examples
>>> x = np.array([[1,2,3],[4,5,6]], order='F')
>>> y = x.copy()
>>> x.fill(0)
>>> x array([[0, 0, 0], [0, 0, 0]])
>>> y array([[1, 2, 3], [4, 5, 6]])
>>> y.flags['C_CONTIGUOUS'] True
-
dtype
¶ Data-type of the array’s elements.
- Parameters
None –
- Returns
d
- Return type
numpy dtype object
See also
numpy.dtype
Examples
>>> x array([[0, 1], [2, 3]]) >>> x.dtype dtype('int32') >>> type(x.dtype) <type 'numpy.dtype'>
-
ndim
¶ Number of array dimensions.
Examples
>>> x = np.array([1, 2, 3]) >>> x.ndim 1 >>> y = np.zeros((2, 3, 4)) >>> y.ndim 3
-
property
unit
¶ A ~astropy.units.UnitBase object representing the unit of this quantity.
-
property
value
¶ The numerical value of this instance.
See also
to_value
Get the numerical value in a given unit.
-
class
Constant
[source]¶ A physical or astronomical constant.
These objects are quantities that are meant to represent physical constants.
-
property
abbrev
¶ A typical ASCII text abbreviation of the constant, also generally the same as the Python variable used for this constant.
-
property
cgs
¶ If the Constant is defined in the CGS system return that instance of the constant, else convert to a Quantity in the appropriate CGS units.
-
property
name
¶ The full name of the constant.
-
property
reference
¶ The source used for the value of this constant.
-
property
si
¶ If the Constant is defined in the SI system return that instance of the constant, else convert to a Quantity in the appropriate SI units.
-
property
system
¶ The system of units in which this constant is defined (typically None so long as the constant’s units can be directly converted between systems).
-
property
uncertainty
¶ The known uncertainty in this constant’s value.
-
property


SPEED 2: CRUISE CONTROL A film review by Ben Hoffman Copyright 1997 Ben Hoffman
If you are looking for some follow up, a sequel to SPEED, forget it. Other than Sandra Bullock there was no legitimate reason to include "Speed" in the title; all other principals and the film's locale are different , . . but hey, that's showbiz.
The excitement that was engendered in the original SPEED is here not present until the last half hour when the cruise ship heads for shore. Frantic, yes; exciting, no. Annie Porter (Bullock) is very hyper when she is careening thru Venice, CA., behind the wheel in a driving test being given by Dept of Motor Vehicles' Mr. Kenter (Tim Conway . . . funny but doing his usual befuddled routine). In the film's subsequent scenes aboard ship Bullock continues her frantic behavior, probably trying to stir up the excitement that is not there.
Alex Shaw (Jason Patric) is the capable, daring hero. He is also Annie's betrothed. Because it is the late 1990s it is no surprise that he does not tell his fiancee the truth, in this case about his job. Instead he says he is in some kind of law enforcement where he arrests young pickpockets who frequent the Venice Beach area when in fact he is on a SWAT team. Conveniently (for the story), while Annie is careening around town with one near miss after another she spies Alex crashing his motorcycle in a chase after a criminal.
Annie is upset about Alex's dangerous job but he gets around her by telling her what they need is a quiet, relaxing 6-day cruise to the Caribbean. Annie readily forgives him. That the cruise is anything but relaxing comes as no surprise. Aboard ship is John Geiger (as in "counter") (Willem Dafoe) who is a former employee of the cruise line where he was the computer expert. Geiger is more than a little annoyed at having been fired. He is maniacal. He grins maliciously, his eyes roll in their sockets, and he looks like a caricature of a crazed villain. How best to get revenge on the cruise line than by programming the engines and rudders and anchors and whatever else it takes to have the ship ram into another ship and sink
Fortunately, Alex is there to take on the evil genie. All of the above, it seems to me, may sound more exciting than the movie. Where the film became of interest to me was when the special effects come into play and we see, with camera low to the ground and pointing up to make the most of the ship's height, what appears as an irresistible force (the ship) approaching its doom with nothing to stop it. Quite effective.
Directed by Jan De Bont
2.5 Bytes
4 bytes = Superb 3 bytes = Too good to miss 2 bytes = Average 1 byte = Save your money
Ben Hoffman
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Piotr's Computer Vision Matlab Toolbox
Download & Description
Matlab Directories
channels
classify
detector
filters
images
matlab
videos
Generated by
m2html
© 2012


The two projects this year focus on properties of confined and interacting systems of electrons in two dimensions, so-called quantum dots.
We will deal only with systems where all possible single-particle states below a certain level are filled up. Such systems are called closed shell systems, a naming inspired from atomic and nuclear physics. These closed shell systems define what is frequently named magic numbers. Quantum dots exhibit also magic numbers, meaning that the addition or removal of one eletron requires more energy than systems where the lowest-lying shells are not filled. Using the harmonic oscillator in two dimensions as basis functions (with degenerate single-particle energies) the magic numbers are \( N=2 \), \( N=6 \), \( N=12 \), \( N=20 \) etc, where \( N \) is the number of electrons. See the table below for more details.
The first project deals with setting up a Hartree-Fock program that is flexible enough to handle different magic numbers. Hartree-Fock is the simplest possible many-body method. We will use the harmonic oscillator functions as basis functions and via the Hartree-Fock method modify the potential which confines the motion of the electrons by accounting for the Coulomb repulsion between electrons. The Hartree-Fock method leads to a set of coupled single-particle equations. If properly written, the system can easily be extended to three-dimensional electronic systems or other fermionic many-body systems.
The second project deals with so-called post Hartree-Fock methods, where additional correlations are introduced via different methods. We will focus on the variational Monte Carlo (VMC) approach, using the optimal Hartree-Fock basis from project 1 as input. If somebody wants to focus on other methods like Coupled-Cluster theory or in-medium Similarity renormalization group method (see chapters 8 and 11 of this reference), this can be tailored to your specific interests. In general, the VMC is much easier to implement and gives excellent approximations to the ground state properties.
We consider a system of electrons confined in a pure two-dimensional isotropic harmonic oscillator potential, with an idealized total Hamiltonian given by $$ \begin{equation} \label{eq:finalH} \hat{H}=\sum_{i=1}^{N} \left( -\frac{1}{2} \nabla_i^2 + \frac{1}{2} \omega^2r_i^2 \right)+\sum_{i < j}^{N}\frac{1}{r_{ij}}, \end{equation} $$ where natural units (\( \hbar=c=e=m_e=1 \)) are used and all energies are in so-called atomic units a.u. We will study systems of many electrons \( N \) as functions of the oscillator frequency \( \omega \) using the above Hamiltonian. The Hamiltonian includes a standard harmonic oscillator part $$ \begin{equation*} \hat{H}_0=\sum_{i=1}^{N} \left( -\frac{1}{2} \nabla_i^2 + \frac{1}{2} \omega^2r_i^2 \right), \end{equation*} $$ and the repulsive interaction between two electrons given by $$ \begin{equation*} \hat{H}_I=\sum_{i < j}^{N}\frac{1}{r_{ij}}, \end{equation*} $$ with the distance between electrons given by \( r_{ij}=\sqrt{\boldsymbol{r}_1-\boldsymbol{r}_2} \). We define the modulus of the positions of the electrons (for a given electron \( i \)) as \( r_i = \sqrt{r_{i_x}^2+r_{i_y}^2} \). There is no spin-orbit part in the two-body Hamiltonian and the different parts of the Hamiltonian have no spin operators. This means that the spin of a single-particle state or a many-particle state is a conserved quantity.
If only the harmonic oscillator part of the Hamiltonian, the so-called unperturbed part is given by $$ \begin{equation*} \hat{H}_0=\sum_{i=1}^{N} \left( -\frac{1}{2} \nabla_i^2 + \frac{1}{2} \omega^2r_i^2 \right). \end{equation*} $$ The wave function for one electron in an oscillator potential in two dimensions is $$ \begin{equation*} \phi_{n_x,n_y}(x,y) = A H_{n_x}(\sqrt{\omega}x)H_{n_y}(\sqrt{\omega}y)\exp{(-\omega(x^2+y^2)/2}. \end{equation*} $$ The functions \( H_{n_x}(\sqrt{\omega}x) \) are so-called Hermite polynomials, discussed in the appendix while \( A \) is a normalization constant. For the lowest-lying state we have \( n_x=n_y=0 \) and an energy \( \epsilon_{n_x,n_y}=\omega(n_x+n_y+1) = \omega \).
In setting up both a Hartree-Fock code and a code for VMC calculations we need to set up a given single-particle basis. In our case the single-particle basis is provided by the harmonic oscillator functions. The first part of this project deals thus with the setup of the basis functions and the computation of matrix elements for the Coulomb interaction.
Make a program that sets up all the quantum numbers for the single-particle basis using a harmonic oscillator in two dimensions. The list should contain the quantum numbers \( n_x \) and \( n_y \), spin and its projection and the single particle energies in atomic units. Define a cutoff in the list according to the harmonic oscillator excitation energy. The table here lists the first four harmonic oscillator shells, with its pertinent degeneracies, and the total number of electrons which can be accomodated up to a given energy. These numbers are the so-called magic numbers for a two-dimensional quantum dot. The degeneracies take into account the two spin values an electron can take. Convince yourself about the correctness of this table and use it to check that your code is running correctly.
| Shell number | \( (n_x, n_y) \) | Energy | Degeneracy | \( N \) |
|---|---|---|---|---|
| 1 | \( (0,0) \) | \( \hbar\omega \) | 2 | 2 |
| 2 | \( (1,0) \), \( (0,1) \) | \( 2\hbar\omega \) | 4 | 6 |
| 3 | \( (2,0) \), \( (0,2) \), \( (1,1) \) | \( 3\hbar\omega \) | 6 | 12 |
| 3 | \( (3,0) \), \( (0,3) \), \( (2,1) \), \( (1,2) \) | \( 4\hbar\omega \) | 8 | 20 |
Convince yourself that the unperturbed lowest-lying energy for the two-electron system is simply \( 2\omega \). Similarly, find the corresponding energies for \( N=6 \), \( N=12 \), \( N=20 \) and \( N=30 \) electrons. These results will turn out to be very useful when you need to check your programs.
With the single-particle basis from the previous step, you should now write a class which encodes the information about the harmonic oscillator single-particle basis. This should include the single-particle energies, spin and its projections as well as the harmonic oscillator functions that depend on \( n_x \) and \( n_y \). This class can then used for both the Monte Carlo and the Hartree-Fock calculations.
We introduce the following shorthands for the integrals $$ \langle pq|\hat{v}|rs\rangle = \int \psi_{p}^*(x_i)\psi_{q}^*(x_j)V(r_{ij})\psi_{r}(x_i)\psi_{s}(x_j) dx_idx_j, $$ which defines the so-called direct matrix element and $$ \langle pq|\hat{v}|sr\rangle = \int \psi_{p}^*(x_i)\psi_{q}^*(x_j) V(r_{ij})\psi_{s}(x_i)\psi_{r}(x_j) dx_idx_j, $$ which defines the exchange element. The variables \( pqrs \) define all the single-particle quantum numbers. In our case these are \( n_x \), \( n_y \) and spin and its projections.
These matrix elements are defined in terms of two-body quantum numbers. Which quantum numbers are conserved? Which are the possible values the total spin of a two-body state can have?
The direct and exchange matrix elements can be brought together if we define the anti-symmetrized matrix element $$ \langle pq|\hat{v}|rs\rangle_{\mathrm{AS}}= \langle pq|\hat{v}|rs\rangle-\langle pq|\hat{v}|sr\rangle. $$ It has the symmetry property $$ \langle pq|\hat{v}|rs\rangle_{\mathrm{AS}}= -\langle pq|\hat{v}|sr\rangle_{\mathrm{AS}}=-\langle qp|\hat{v}|rs\rangle_{\mathrm{AS}}, $$ and $$ \langle pq|\hat{v}|rs\rangle_{\mathrm{AS}}= \langle qp|\hat{v}|sr\rangle_{\mathrm{AS}}. $$ Your task is to write a function which calculates the integral $$ \langle pq|\hat{v}|rs\rangle = \int \psi_{p}^*(x_i)\psi_{q}^*(x_j)V(r_{ij})\psi_{r}(x_i)\psi_{s}(x_j) dx_idx_j, $$ and then assemble the direct and exchange terms in order to construct the anti-symmetrized matrix elements to be used in the Hartree-Fock calculations. The integral needs to be parallelized. This will be discussed during the lectures. You should also consider whether it is appropriate to store the matrix elements for the Hartree-Fock calculations. Chapter five of the lecture notes discusses Gaussian quadrature. You may find it convenient to use Hermite polynomials in order to set up the integration points and weights.
The Hartree-Fock functional is written as $$ \begin{equation*} E[\Phi] = \sum_{i\le F} \langle i | \hat{h}_0 | i\rangle+ \frac{1}{2}\sum_{ij \le F}\left[\langle ij |\hat{v}|ij\rangle-\langle ij |\hat{v}|ji\rangle\right], \end{equation*} $$ where \( F \) indicates the Fermi level, or the last occupied single-particle state.
With the given functional, we can perform at least two types of variational strategies.
Both cases lead to a new Slater determinant which is related to the previous via a unitary transformation. The second one is the one we will use in this project.
Consider a Slater determinant built up of single-particle orbitals \( \psi_{\lambda} \), with \( \lambda = 1,2,\dots,N \).
The unitary transformation $$ \begin{equation*} \psi_p = \sum_{\lambda} C_{p\lambda}\phi_{\lambda}, \end{equation*} $$ brings us into the new basis. Show that the new basis is orthonormal. Show that the new Slater determinant constructed from the new single-particle wave functions can be written as the determinant based on the previous basis and the determinant of the matrix \( C \). Show that the old and the new Slater determinants are equal up to a complex constant with absolute value unity. (Hint, \( C \) is a unitary matrix).
Minimizing with respect to \( C^*_{p\alpha} \), remembering that \( C^*_{p\alpha} \) and \( C_{p\alpha} \) are independent and defining $$ \begin{equation*} h_{\alpha\gamma}^{HF}=\langle \alpha | \hat{h}_0 | \gamma \rangle+ \sum_{j\le F}\sum_{\beta\delta} C^*_{j\beta}C_{j\delta}\langle \alpha\beta|\hat{v}|\gamma\delta\rangle_{AS}, \end{equation*} $$ show that you can write the Hartree-Fock equations as $$ \begin{equation*} \sum_{\gamma}h_{\alpha\gamma}^{HF}C_{p\gamma}=\epsilon_p C_{p\alpha}. \label{eq:newhf} \end{equation*} $$ Explain the meaning of the different terms.
The Hartree-Fock algorithm can be broken down as follows. We recall that our Hartree-Fock matrix is $$ \hat{h}_{\alpha\beta}^{HF}=\langle \alpha \vert\hat{h}_0 \vert \beta \rangle+ \sum_{j\le F}\sum_{\gamma\delta} C^*_{j\gamma}C_{j\delta}\langle \alpha\gamma|\hat{v}|\beta\delta\rangle_{AS}. $$ Normally we assume that the single-particle basis \( \vert\beta\rangle \) forms an eigenbasis for the operator \( \hat{h}_0 \) (this is our case, the harmonic oscillator energies), meaning that the Hartree-Fock matrix becomes $$ \hat{h}_{\alpha\beta}^{HF}=\epsilon_{\alpha}\delta_{\alpha,\beta}+ \sum_{j\le F}\sum_{\gamma\delta} C^*_{j\gamma}C_{j\delta}\langle \alpha\gamma|V|\beta\delta\rangle_{AS}. $$ The Hartree-Fock eigenvalue problem $$ \sum_{\beta}\hat{h}_{\alpha\beta}^{HF}C_{p\beta}=\epsilon_p^{\mathrm{HF}}C_{p\alpha}, $$ can be written out in a more compact form as $$ \hat{h}^{HF}\hat{C}=\epsilon^{\mathrm{HF}}\hat{C}. $$
The equations are often rewritten in terms of a so-called density matrix, which is defined as $$ \begin{equation} \rho_{\gamma\delta}=\sum_{i\le F}\langle\gamma|i\rangle\langle i|\delta\rangle = \sum_{i\le F}C_{i\gamma}C^*_{i\delta}. \label{_auto1} \end{equation} $$ It means that we can rewrite the Hartree-Fock Hamiltonian as $$ \hat{h}_{\alpha\beta}^{HF}=\epsilon_{\alpha}\delta_{\alpha,\beta}+ \sum_{\gamma\delta} \rho_{\gamma\delta}\langle \alpha\gamma|V|\beta\delta\rangle_{AS}. $$ It is convenient to use the density matrix since we can precalculate in every iteration the product of two eigenvector components \( C \).
Develop a Hartree-Fock program and perform Hartree-Fock calculations for \( N=2 \), \( N=6 \), \( N=12 \) and \( N=20 \) electrons. How many single-particle shells do you need before the total Hartree-Fock energy stabilizes as function of the number of shells? This is normally called the Hartree-Fock limit in the literature. Compare your Hartree-Fock energy with the unperturbed energy. Make sure that in case of no Coulomb interaction that your Hartree-Fock code reproduces the unperturbed energy.
How much do the single-particle energies change compared to the harmonic oscillator energies? Are the degeneracies seen in the harmonic oscillator calculations preserved?
The Hermite polynomials are the solutions of the following differential equation $$ \begin{equation} \frac{d^2H(x)}{dx^2}-2x\frac{dH(x)}{dx}+ (\lambda-1)H(x)=0. \label{eq:hermite} \end{equation} $$ The first few polynomials are $$ \begin{equation*} H_0(x)=1, \end{equation*} $$ $$ \begin{equation*} H_1(x)=2x, \end{equation*} $$ $$ \begin{equation*} H_2(x)=4x^2-2, \end{equation*} $$ $$ \begin{equation*} H_3(x)=8x^3-12x, \end{equation*} $$ and $$ \begin{equation*} H_4(x)=16x^4-48x^2+12. \end{equation*} $$ They fulfil the orthogonality relation $$ \begin{equation*} \int_{-\infty}^{\infty}e^{-x^2}H_n(x)^2dx=2^nn!\sqrt{\pi}, \end{equation*} $$ and the recursion relation $$ \begin{equation*} H_{n+1}(x)=2xH_{n}(x)-2nH_{n-1}(x). \end{equation*} $$
Here follows a brief recipe and recommendation on how to write a report for each project.
The preferred format for the report is a PDF file. You can also use DOC or postscript formats or as an ipython notebook file. As programming language we prefer that you choose between C/C++, Fortran2008 or Python. The following prescription should be followed when preparing the report:


--- layout: post title: via cheese please fieldcandy date: '2011-12-02T09:36:11+00:00' tags: [] tumblr_url: http://backlog.robbevan.com/post/13629145274/via-cheese-please-fieldcandy ---
(via Cheese please | FieldCandy)


As you will have gathered, I have been in the doldrums for the past couple of weeks. I fully intend to write something about the dolls and the drums, but until then, here is the second part of Hooting Yard Live At Brewer's Bar, recorded last month. Listen and learn.


Close In the toolbar there are three type of Mirrors here convex, concave,mirror available. There are three types of objects are available here Arrow, Triangle and Rectangle Drag & Drop the Mirror to the experiment area to place the Mirrors Click on the Object to place the object in experimental area Double click on the Mirror to remove the Mirror from the experimental area.


Choosing Your Path¶
Your party will be faced with either one or two doors when you complete a room.
If there is one path (i.e. len(options.keys()) == 1
), the only way you can go is forward by returning (Direction.forward
) in the (Client.room_choice()
) method.
def room_choice(self, units, options):
if len(options.keys()) == 1:
# there is only one door, may as well go through it
# the only way is forward.
return Direction.forward
If there are two doors (i.e. len(options.keys() == 2
), you can go left or right by returning Direction.left
or Direction.Right
.
import random
def room_choice(self, units, options):
if len(options.keys()) == 2:
# there are two directions we can go.
# Let's choose a random one.
# **Note:** Don't ever do anything random in practice you will regret it.
return random.choice([Direction.left, Direction.right])
You can also examine the room object with options[Direction.right]
or options[Direction.left]
in order to look at its properties.
def room_choice(self, units, options):
if len(options.keys()) == 2:
right = options[Direction.right]
# the variable "right" now holds a room object.
# Below we will discuss room objects.
Before you look at the properties on the room object you will first want to determine what kind of room it is, to do this you can do following:
def room_choice(self, units, options):
if len(options.keys()) == 2:
right = options[Direction.right]
left = options[Direction.left]
if right.node_type == NodeType.monster:
monster = right.monster
# Reference https://royale.ndacm.org/~documentation/monsters.html#monster-properties for monster properties
elif right.node_type == NodeType.trap:
trap = right.trap
# Reference https://royale.ndacm.org/~documentation/traps.html#trap-properties for trap properties.
In total there are three kinds of rooms:
- Monster Rooms
- When you enter a monster room, the client will call
Client.combat_round()
- When you enter a monster room, the client will call
- Trap Rooms
- When you enter a trap room, the client will call
Client.trap_round()
- When you enter a trap room, the client will call
- Towns
- When you enter a town, the client will call
Client.town()
- When you enter a town, the client will call


{# Copyright 2011 Google Inc. All Rights Reserved. #} {% comment %} UI for displaying info about a migration. Accepts one argument, "migration", which is the migration to render controls for. Author<EMAIL_ADDRESS>(Nick Santos) {% endcomment %}


“Life
moves pretty fast. If you don't stop and look around once in a while, you could
miss it.” -- Ferris Bueller.
There is a recurring topic that crops up at the ACCU Conference during the lightning talks and this year was no exception. In the first round of lightning talks Björn Fahller asked the question “Why Are (Only) We Here?” And in the second set, Mike Long continued the trend with a talk titled “Passionate vs. Professional.”
Interestingly the use of the term “passionate” was itself questioned by Seb Rose in his own 12” edition of the lightning talks with “Are You Passionate?” For those that weren’t there I suggest you look the word up in the dictionary and draw your own conclusions. For what it’s worth I agree with Seb’s sentiment, but I’m still going to stick to what I believe we mean by the word as it adds fuel to this particular fire…
So, let me ignite it now by suggesting that not everyone who works as a computer programmer does it because they are passionate about it.  But that only applies to some of us. That’s right; lots of people actually do a job for reasons other than the love of it.
Many of the people I have worked with in the past do enjoy what they do. To go back to Seb’s point about the word “passionate”, let me suggest (after clicking Shift+F7 to bring up the Thesaurus) the slightly watered down “enthusiastic” instead. Programming is a career that they have chosen because they are genuinely interested in the subject. But I have also worked with others for whom programming was never really the end goal – they do it because it pays reasonably well (very well in certain industries) and perhaps they’re better at it than other careers they originally had in mind. They are not, and never expect to be, The Best of the Best, but does every programmer have to aspire to be that?
When I went to university back in the late ‘80’s I studied Electronic Systems Engineering. My choice was based on my dream of working in the Audio industry because I loved music and I loved my hi-fi.  However I had slightly more success in the digital realm and eventually discovered that writing software was an actual profession, and one that I might be a little better (and therefore more successful) at.
I am one of the lucky ones who managed to make a course correction early in life and end up doing what I had already been doing for the 7 years prior to university, but hopefully in a somewhat more “professional” manner. Of course not everyone is fortunate enough to have their path laid out clearly before them and so instead they fall into a job that pays the bills and then see where it goes. And so, if the mortgage is covered and it’s not detestable, then why shouldn’t that be enough for some?
There’s that word “professional” this time. What does that mean exactly? I can tell you I believe it doesn’t include committing a load of changes that haven’t even been compiled just before going off on a week’s holiday. But what about some of the practices that many of us feel are beneficial to a sustainable system, say, test-first versus test-later or continuous integration? What’s the penance for not adopting these and continuing to work in an “old fashioned” way? If the goal is to deliver working software then surely how that’s achieved is of secondary importance to if it’s achieved?
I once worked with a chap at a big corporation who was purely in “the programming profession” to fund his non-working life.  I tried (largely in vain) to evangelise about the virtues of certain modern development practices but ultimately they fell on deaf ears. His performance wasn’t brilliant, but via perspiration he would end up delivering something that works. Is it “unprofessional” to get the job done in ways that perhaps not everyone agrees on? As his peer I had to leave him to it; just so long as what he did had no direct affect on my ability to deliver.
You can of course argue that poor design, lack of tests, blah, blah, blah all leads to an increased delivery time for subsequent changes and so it will eventually affect my ability to make changes. But I do not feel that is of my concern – that is a management issue to me. Like it or not software development is rife with politics and the “performance” of an individual is just one facet that determines the make-up of a team. Much to the chagrin of one manager I worked with, you can’t just fire someone because you’ve found a better replacement. Anyone who has ever worked in a large corporation will wince when I mention the term “head count” – a pejorative used to describe why you sometimes have to settle for the 10th best interview candidate instead of holding out for the 1st or 2nd.
In (my) ideal world there would be a causal relationship between “coolness” of project, quality of team members, and rate of pay; with them all increasing together. Sadly it’s more likely that there is an inverse square law in effect somewhere as there are industries that seem to rely on youth and adoration to compensate for a lack of remuneration. Conversely you’d expect Finance, with its deeper pockets, to only hire the best-of-the-best; but I can assure you that hypothesis doesn’t hold water either.
Coming back to the original question then,
I wonder if there is an expectation that ACCU conference attendees (or
I’m sure I didn’t fool anyone with the purposefully controversial title that suggests it’s impossible to enjoy a career in programming and at the same time enjoy a fruitful life. In essence it’s a thinly veiled attempt to re-cast the age old debate of “live to work” or “work to live” into a programming context. Clearly each of us has a right to devote as much or as little time, outside our normal working day, to our career progression as we see fit. What I’m going to suggest, and I’m sure I’ll be labelled a heretic for suggesting it, is that the next time you are presented with the question of why you are there, is to first ask yourself why you’re not snowboarding on the Alps, lazing on the beach soaking up the rays or curled up on the sofa reading a trashy novel?
Chris Oldwood
04 June 2013
Bio
Chris is a freelance developer who started out as a bedroom coder in the 80’s writing assembler on 8-bit micros. These days it’s C++ and C# on Windows in big plush corporate offices. He is also the commentator for the Godmanchester Gala Day Duck Race and can be contacted via<EMAIL_ADDRESS>or @chrisoldwood.


The Sickness
The air is damp, and there is a sickly scent about. There are two main tunnels to go down.


| Home | Trees | Indices | Help |
|
|---|
|
|
3-Point resection functions cassini, collins5, pierlot, pierlotx and tienstra7, survey functions snellius3 and wildberger3 and triangle functions triAngle, triAngle4, triSide, triSide2 and triSide4.
Note: Functions pierlot and pierlotx are transcoded to Python with permission from triangulationPierlot and Pierlot.
Version: 23.06.07
| Classes | |
|
Collins5Tuple 5-Tuple (pointP, pointH, a, b, c) with survey
pointP , auxiliary pointH , each an
instance of pointA 's (sub-)class and triangle
sides a , b and c in
meter , conventionally.
|
|
|
ResectionError Error raised for issues in pygeodesy.resections. |
|
|
Survey3Tuple 3-Tuple (PA, PB, PC) with distance from survey point
P to each of the triangle corners A ,
B and C in meter ,
conventionally.
|
|
|
Tienstra7Tuple 7-Tuple (pointP, A, B, C, a, b, c) with survey
pointP , interior triangle angles A ,
B and C in degrees and
triangle sides a , b and c in
meter , conventionally.
|
|
|
TriAngle4Tuple 4-Tuple (radA, radB, radC, rIn) with the interior
angles at triangle corners A , B and
C in radians and the
InCircle radius rIn aka
inradius in meter , conventionally.
|
|
|
TriSide2Tuple 2-Tuple (a, radA) with triangle side a in
meter , conventionally and angle radA at
the opposite triangle corner in radians .
|
|
|
TriSide4Tuple 4-Tuple (a, b, radC, d) with interior angle
radC at triangle corner C in
radians with the length of triangle sides
a and b and with triangle height
d perpendicular to triangle side c , in
the same units as triangle sides a and b .
|
| Functions | |||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
| Variables | |
__all__ = _ALL_LAZY.resections
|
| Function Details |
3-Point resection using Cassini's method.
Note:
Typically, See Also: Three Point Resection Problem and functions pygeodesy.collins5, pygeodesy.pierlot and pygeodesy.tienstra7. |
3-Point resection using Collins' method.
Note:
Typically, See Also: Collins' methode and functions pygeodesy.cassini, pygeodesy.pierlot and pygeodesy.tienstra7. |
3-Point resection using Pierlot's method
Note:
Typically, See Also: Pierlot's C function triangulationPierlot, V. Pierlot, M. Van Droogenbroeck, "A New Three Object Triangulation Algorithm for Mobile Robot Positioning", Vincent Pierlot, Marc Van Droogenbroeck, "18 Triangulation Algorithms for 2D Positioning (also known as the Resection Problem)" and functions pygeodesy.pierlotx, pygeodesy.cassini, pygeodesy.collins5 and pygeodesy.tienstra7. |
3-Point resection using Pierlot's method
See Also: Pierlot's C function triangulationPierlot2 and function pygeodesy.pierlot. |
Snellius' surveying using Snellius Pothenot.
See Also: Function pygeodesy.wildberger3. |
3-Point resection using Tienstra's formula.
Note:
Points See Also: 3-Point Resection Solver, V. Pierlot, M. Van Droogenbroeck, "A New Three Object Triangulation...", 18 Triangulation Algorithms... and functions pygeodesy.cassini, pygeodesy.collins5 and pygeodesy.pierlot. |
Compute one angle of a triangle.
See Also: Functions pygeodesy.triAngle4 and pygeodesy.triSide. |
Compute the angles of a triangle.
See Also: Function pygeodesy.triAngle. |
Compute one side of a triangle.
See Also: Functions pygeodesy.sqrt_a, pygeodesy.triAngle, pygeodesy.triSide2 and pygeodesy.triSide4. |
Compute one side and the opposite angle of a triangle.
See Also: Functions pygeodesy.sqrt_a, pygeodesy.triSide and pygeodesy.triSide4. |
Compute two sides and the height of a triangle.
See Also: Triangulation, Surveying and functions pygeodesy.sqrt_a, pygeodesy.triSide and pygeodesy.triSide2. |
Snellius' surveying using Rational Trigonometry.
See Also: Wildberger, Norman J., Devine Proportions, page 252 and function pygeodesy.snellius3. |
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Sun Aug 20 14:42:07 2023 | http://epydoc.sourceforge.net |


Skype attacks IIS
We are currently developing an IIS hosted .NET application at work. Eventually the whole app will be hosted through HTTPS so for now we are doing a lot of the development this way too, thus our local development servers are configured for HTTPS over port 443.
One of the devs on the project was setting up their machine yesterday and kept getting the following error in IIS when starting their website: “The process cannot access the file because it is being used by another process. (Exception from HRESULT: 0x80070020)“.
We had to find which process was doing the blocking:
c:\> netstat -ao
Gives us a list of all active connections. Look in the local address column for something on port 443 e.g. “<IP_ADDRESS>:443” grab the PID from the rightmost column in my case 2384.
Gives us a list of all active connections. Look in the local address column for something on port 443 e.g. “<IP_ADDRESS>:443” grab the PID from the rightmost column in my case 2384. Now grab the name of the culprit:
c:\> tasklist /fi "PID eq 2384"
Image Name PID Session Name Session# Mem Usage
========================= ======== ================ =========== ============
Skype.exe 2384 Console 1 104,180 K
So go KILL that process and now IIS should be happy again.