MSE 123 - Ceramic Processing (3 Units)
(Taken from the UC Berkeley Course Guide)
Course Overview
Summary
This 4-unit course starts with a brief review of the fundamentals of solid-state physics including bands and defects in semiconductors and oxides, and then moves to bulk semiconductor crystals growth and processing including doping, diffusion and implantation, and then to thin film deposition and processing methods, and finishes with a discussion of materials analysis and characterization. Recent advances in nanomaterials research will also be introduced.
Prerequisites
MSE 111 or PHYS 7C or consent of instructor
Topics Covered
- To prepare students a) for work in semiconductor processing facilities and b) for graduate studies related to thin film processing and relevant materials science topics.
- To present the relevant materials science issues in semiconductor and oxide processing
- To provide an introduction into the principles of thin film processing and related technologies.
- Basic knowledge of gas kinetics and vacuum technology, including ideal gas, gas transport theory, definition, creation and measurement of vacuum.
- Knowledge of electrical and optical properties of thin films.
- Knowledge of the formation of p-n junction to explain the diode operation and its I-V characteristics.
- Understanding of the mechanisms of Hall Effect, transport, and C-V measurements, so that can calculate carrier concentration, mobility and conductivity given raw experimental data.
- The ability to describe major growth techniques of bulk, thin film, and nanostructured semiconductors, with particular emphasis on thin film deposition technologies, including evaporation, sputtering, chemical vapor deposition and epitaxial growths.
- To have basic knowledge of doping, purification, oxidation, gettering, diffusion, implantation, metallization, lithography and etching in semiconductor processing.
- To have basic knowledge of electronic material characterization methods: x-ray diffraction, SEM and TEM, EDX, Auger, STM and AFM, Rutherford Back Scattering and SIMS, as well as optical methods including photoluminescence, absorption and Raman scattering.
- To understand the concepts of bands, bandgap, to distinguish direct and indirect bandgap semiconductors. Understanding of free electron and hole doping of semiconductors to determine Fermi level position.
- To understand the effect of defects in semiconductors, so that can describe their electronic and optical behaviors, and the methods to eliminate and control them in semiconductors.
Workload
Time Commitment
4 hours of lecture per week.
UC Berkeley Course Guide


library(tidyverse)
library(cowplot)
library(broom)
library(modelr)
library(viridis)
library(lubridate)
library(hms)
library(knitr)
library(kableExtra)
knitr::opts_chunk$set(tidy.opts=list(width.cutoff=60),tidy=TRUE, echo = TRUE, message=FALSE, warning=FALSE, fig.align="center")
source("../../tools/echem_processing_tools.R")
source("../../tools/plotting_tools.R")
theme_set(theme_1())
Biofilm A Biofilm B
In duplicate (biofilms A and B) an IDA biofilm was exposed to three different conditions sequentially:
Note that biofilm B was dropped facedown prior to imaging.
max intensity stitched images here
Note that biofilm B had a gassing needle clogged.
first_reps <- read_csv("../processing/09_09_19_first_transfer_reps.csv")
soak_data <- read_csv("../processing/09_09_19_soak_data.csv")
swv_gc_max <- read_csv("../processing/09_09_19_swv_gc_max_processed.csv")
First let’s take a look at how the biofilm echem looked in the soak reactors. Recall that the conditions were:
Here are the SWVs for biofilms A and B:
ggplot(soak_data %>% filter(echem == "SWV" & electrode == "i1" &
PHZadded == "75uM"), aes(x = E, y = current, color = factor(reactor_num),
linetype = factor(rep))) + geom_path() + facet_wrap(~biofilm) +
scale_x_reverse() + labs(title = "SWV - Soak")
And here are the GCs:
ggplot(soak_data %>% filter(electrode == "i2" & echem == "GC" &
PHZadded == "75uM"), aes(x = E, y = current, color = factor(reactor_num))) +
geom_path() + facet_wrap(~biofilm) + scale_x_reverse() +
labs(title = "GC - Soak")
You can see that there’s a difference in how biofilm A and B responded. A is more like what we would expect and B is confusing. My guess is that B needed more time for the PYO to get all the way into the biofilm, because it was very thick (probably limited for O2 at one point).
Let’s focus on A. The SWV shows that the first run (PBS to PBS) has the highest signal, and the next run (PBS to EtBr) has a similar signal, but a little lower. I think we should interpret this as the amount of signal lost from transfer to transfer and handling the biofilm. Then you can see that the third condition (EtBr to EtBr) actually has a significantly lower signal. I think this means for biofilm A the treatements worked as intended, we can see a little bit of biofilm dependent signal in the soak and we see some of that go away when we incubate with EtBr. Similarly with the GC, we see 1 and 2 are right on top of each other and 3 is slightly lower.
So we just looked to see if we could see a change in signal with EtBr in the soak, now let’s see if etbr affected the amount of PYO carried over into the transfer reactor. We’re going to look at the first two SWV scans:
first_reps <- first_reps %>% mutate(condition = fct_relevel(condition,
c("pbsPBS", "pbsEtBr", "etbrEtBr")))
ggplot(first_reps %>% filter(echem == "swv" & electrode == "i1"),
aes(x = E, y = pred, color = condition, group = condition)) +
geom_path() + facet_wrap(rep ~ biofilm, scales = "free") +
scale_x_reverse() + labs(title = "SWV - First transfer reps")
and the first GC scan:
ggplot(first_reps %>% filter(echem == "gc" & electrode == "i2"),
aes(x = E, y = current, color = condition, group = condition)) +
geom_path() + facet_wrap(rep ~ biofilm, scales = "free") +
scale_x_reverse() + labs(title = "GC - First transfer reps")
In the GC we mostly see the same story as the soak data. For biofilm A, the PBS soak 1 has the highest signal, the PBS soak 2 has a significantly lower signal (now in the transfer reactor with etbr), and the etbr - etbr condition has the lowest signal. The SWV data for A does not show such dramatic differences.
The biofilm B data is similarly confusing as the soak data. It seems that the biofilm picked up more and more PYO throughout the incubations with PYO…this may be because it was a very thick biofilm.
swv_gc_max <- swv_gc_max %>% mutate(condition = fct_relevel(condition,
c("pbsPBS", "pbsEtBr", "etbrEtBr")))
ggplot(swv_gc_max %>% filter(electrode_from_swv == "i1"), aes(x = norm_time_from_swv,
y = max_current_from_swv, color = condition)) + geom_point() +
facet_wrap(~biofilm, scales = "free")
ggplot(swv_gc_max %>% filter(electrode_from_gc == "i2"), aes(x = norm_time_from_gc,
y = max_current_from_gc, color = condition)) + geom_line() +
geom_point() + facet_wrap(~biofilm, scales = "free")
Biofilm B was very thick, probably went anaerobic when gas tube got clogged.
ggplot(swv_gc_max %>% filter(electrode_from_gc == "i2" & electrode_from_swv ==
"i1"), aes(x = max_current_from_swv, y = max_current_from_gc,
color = condition)) + geom_point() + facet_wrap(~biofilm,
scales = "free")
ggplot(swv_gc_max %>% filter(electrode_from_gc == "i2" & electrode_from_swv ==
"i1"), aes(x = max_current_from_swv, y = max_current_from_gc,
color = condition)) + geom_smooth(method = "lm") + geom_point(shape = 21) +
facet_wrap(~biofilm, scales = "free")
sessionInfo()
## R version 3.5.2 (2018-12-20)
## Platform: x86_64-apple-darwin15.6.0 (64-bit)
## Running under: macOS Mojave 10.14.6
##
## Matrix products: default
## BLAS: /Library/Frameworks/R.framework/Versions/3.5/Resources/lib/libRblas.0.dylib
## LAPACK: /Library/Frameworks/R.framework/Versions/3.5/Resources/lib/libRlapack.dylib
##
## locale:
## [1] en_US.UTF-8/en_US.UTF-8/en_US.UTF-8/C/en_US.UTF-8/en_US.UTF-8
##
## attached base packages:
## [1] stats graphics grDevices utils datasets methods base
##
## other attached packages:
## [1] kableExtra_1.0.1 knitr_1.23 hms_0.4.2
## [4] lubridate_1.7.4 viridis_0.5.1 viridisLite_0.3.0
## [7] modelr_0.1.2 broom_0.5.1 cowplot_0.9.4
## [10] forcats_0.3.0 stringr_1.3.1 dplyr_0.8.1
## [13] purrr_0.2.5 readr_1.3.1 tidyr_0.8.2
## [16] tibble_2.1.3 ggplot2_3.2.0 tidyverse_1.2.1
##
## loaded via a namespace (and not attached):
## [1] tidyselect_0.2.5 xfun_0.7 haven_2.0.0 lattice_0.20-38
## [5] colorspace_1.4-0 generics_0.0.2 htmltools_0.3.6 yaml_2.2.0
## [9] rlang_0.3.4 pillar_1.3.1 glue_1.3.1 withr_2.1.2
## [13] readxl_1.2.0 munsell_0.5.0 gtable_0.2.0 cellranger_1.1.0
## [17] rvest_0.3.2 evaluate_0.14 labeling_0.3 Rcpp_1.0.1
## [21] scales_1.0.0 backports_1.1.3 formatR_1.5 webshot_0.5.1
## [25] jsonlite_1.6 gridExtra_2.3 digest_0.6.18 stringi_1.2.4
## [29] grid_3.5.2 cli_1.0.1 tools_3.5.2 magrittr_1.5
## [33] lazyeval_0.2.1 crayon_1.3.4 pkgconfig_2.0.2 xml2_1.2.0
## [37] assertthat_0.2.1 rmarkdown_1.13 httr_1.4.0 rstudioapi_0.9.0
## [41] R6_2.4.0 nlme_3.1-140 compiler_3.5.2


#BuyPersonaOniTunes trending worldwide in support of BTS
by sl278ARMYs are taking on a hashtag challenge to further up the sales of BTS's discography.
The hashtag #BuyPersonaOniTunes is now trending worldwide to support the group and the sale of their album. After the worldwide trend, 'Persona' has quickly moved up the charts on iTunes in numerous countries.
Fans are sending their upmost support, stating:
What dedicated fans! We wish everyone the best.


One of Indonesian festivals in Brisbane. This annual event is held by Indonesian Student Association in Queensland (PPIA Queensland), which is very anticipated by Indonesian people in Brisbane. This event is held in order to promote Indonesian culture in Brisbane and for Indonesian people to gather and feels like they are home.
Pesta Rakyat 2015: Djakarta Tempo Doeloe, will be held at Boundary St Market, West End. The event will start at 12PM-8PM.
Experience the Indonesian culture in one day with the atmosphere of Old Batavia
Comedy drama about hero of old batavia era.
Be a masterchef finalist for a day and you get to experience mystery box challenge.
Witness the exotic clothing of Indonesia worn by beautiful models.
The dance of thousand hands originally from Aceh performed by Zamania Saman Dancer Brisbane.
Enjoying a beautiful melody from Javanese musical instrument made from bamboo.
Experiencing the authentic unique rhythm for Indonesia that is enjoyable for all ages and classes.
Fun games and many other performances, the most important thing… Pesta Rakyat 2015 is free!
You get to experience the exotic Indonesian foods, drinks, and traditional games. Below are the stalls that opened at Pesta Rakyat 2015 :
You can download Grayscale for free on the preview page at Start Bootstrap.
You can download Grayscale for free on the preview page at Start Bootstrap.
Feel free to contact us regarding further information and details about Pesta Rakyat 2015


Shows custom html attributes in html or jsp.
Use options below to add attributes to known custom attributes list.


Divergent Series typically go to $\infty$ or $-\infty$, don't approach one specific number.
The partial sums are $s_N = \sum\limits_{n=1}^{N} \frac{1}{2^n} = \frac{\frac{1}{2}(1-(\frac{1}{2})^N)}{1-\frac{1}{2}} = 1 - (\frac{1}{2})^N$
$$\Lim_{N \to \infty} s_N = \Lim_{N \to \infty} (1-(\frac{1}{2})^N) =1$$The series converges and its sum is $1$.
The partial sums are $s_N = \sum\limits_{n=1}^{N} 2^N = \frac{2(2^N-1)}{2-1} = 2(2^N-1)$
$$\Lim_{N \to \infty} s_N = \Lim_{N \to \infty} (2(2^N-1)) = 2((\Lim_{N \to \infty}2^N)-1) = \infty$$The series does not approach specific number. Thus the series diverges


--- layout: default title: Introduction ---
Fuse is a living design system that unites a robust set of UI elements with a flexible technology platform creating cohesive, intuitive experiences for National Instruments software users.
Elements
A catalog of modern, beautiful UI elements for easy reuse across NI software.
Guidance
Information to ensure we consistently asssemble our elements to help the user gain proficiency.
Tools
Resources and samples to make it easy to create designs and features.
Products
All of this comes together to create great products for our users.
View the source on GitHub.


APIDocs available now!
Nicer docs in progress
This package is heavily inspired by Laravel's Query Builder. I learned about it at Laracasts, which I consider my best programming resource regardless of the fact that I have never deployed a line of PHP code.


---
layout: post
title: Default Namespace and Attributes
date: '2010-01-28T23:12:00.000+05:30'
author: Chandermani Arora
tags:
- Namespace
- XML
modified_time: '2010-01-28T23:20:43.545+05:30'
blogger_id: tag:blogger.com,1999:blog-20117988.post-529018086993763780
blogger_orig_url: http://chandermani.blogspot.com/2010/01/default-namespace-and-attributes.html
---
This is what i learned today
Default namespaces do not apply to attributes; therefore, to apply a namespace to an attribute the attribute must be explicitly qualified.
Must remember this. Can be very helpful while debugging XML schema issues.
Chandermani


| Total net profit | -78.24 | Gross profit | 12.23 | Gross loss | -90.47 |
| Profit factor | 0.14 | Expected payoff | -0.79 | ||
| Absolute drawdown | -78.24 | Maximal drawdown (%) | 78.65 (19182.93%) | ||
| Total trades | 99 | Profit trades (% of total) | 18 (18.18%) | Loss trades (% of total) | 81 (81.82%) |
| Long positions (won %) | 60 (20.0%) | Short positions (won %) | 39 (15.38%) | ||
| Largest | profit trade | 1.73 | loss trade | -8.15 | |
| Average | profit trade | 0.68 | loss trade | -1.12 | |
| Minimum | profit trade | 0.0 | loss trade | -0.01 | |
| Maximum | take profit in pips | 168.3 | stop loss in pips | -702.7 | |
| Average | take profit in pips | 43.4 | stop loss in pips | -104.3 | |
| Minimum | take profit in pips | -185.8 | stop loss in pips | -27.3 | |
| Maximum | Reward-Risk | 5.5 | Duration in minutes | 2946 | |
| Average | Reward-Risk | 1.0 | Duration in minutes | 133.5 | |
| Minimum | Reward-Risk | 0.0 | Duration in minutes | 0 | |
| Maximum | consecutive wins (profit in money) | 4.0 (3.34) | consecutive losses (loss in money) | 14.0 (-8.96) | |
| Average | consecutive wins | 1.0 | consecutive losses | 5.0 |
| Total net profit | -37.11 | Gross profit | 6.16 | Gross loss | -43.27 |
| Profit factor | 0.14 | Expected payoff | -0.62 | ||
| Absolute drawdown | -37.11 | Maximal drawdown (%) | 37.52 (9151.22%) | ||
| Total trades | 60 | Profit trades (% of total) | 12 (20.0%) | Loss trades (% of total) | 48 (81.67%) |
| Largest | profit trade | 1.73 | loss trade | -3.09 | |
| Average | profit trade | 0.51 | loss trade | -0.9 | |
| Minimum | profit trade | 0.0 | loss trade | -0.01 | |
| Maximum | take profit in pips | 159.2 | stop loss in pips | -210.8 | |
| Average | take profit in pips | 31.4 | stop loss in pips | -94.4 | |
| Minimum | take profit in pips | -80.6 | stop loss in pips | -39.0 | |
| Maximum | Reward-Risk | 3.7 | Duration in minutes | 898.0 | |
| Average | Reward-Risk | 0.7 | Duration in minutes | 95.0 | |
| Minimum | Reward-Risk | 0.0 | Duration in minutes | 0.0 | |
| Maximum | consecutive wins (profit in money) | 4.0 (3.34) | consecutive losses (loss in money) | 10.0 (-6.51) | |
| Average | consecutive wins | 1.0 | consecutive losses | 5.0 |
| Total net profit | -41.13 | Gross profit | 6.07 | Gross loss | -47.2 |
| Profit factor | 0.13 | Expected payoff | -1.05 | ||
| Absolute drawdown | -41.13 | Maximal drawdown (%) | 41.61 (8668.75%) | ||
| Total trades | 39 | Profit trades (% of total) | 6 (15.38%) | Loss trades (% of total) | 33 (84.62%) |
| Largest | profit trade | 1.53 | loss trade | -8.15 | |
| Average | profit trade | 1.01 | loss trade | -1.43 | |
| Minimum | profit trade | 0.18 | loss trade | -0.32 | |
| Maximum | take profit in pips | 168.3 | stop loss in pips | -702.7 | |
| Average | take profit in pips | 61.9 | stop loss in pips | -119.6 | |
| Minimum | take profit in pips | -185.8 | stop loss in pips | -27.3 | |
| Maximum | Reward-Risk | 5.5 | Duration in minutes | 2946.0 | |
| Average | Reward-Risk | 1.4 | Duration in minutes | 192.7 | |
| Minimum | Reward-Risk | Duration in minutes | 0.0 | ||
| Maximum | consecutive wins (profit in money) | 1.0 (1.09) | consecutive losses (loss in money) | 15.0 (-17.2) | |
| Average | consecutive wins | 1.0 | consecutive losses | 5.0 |


Photo from: Chandra Bahadur Gurung / Singapore Gurkha Photography Museum
- 1950s
- 1960s
- 1970s
- 1980s
- 1990s
- bhairahawa
- dharan
- gurkhas
- kathmandu
- nepal
- pokhara
- singapore
- singapore gurkha archive
- singapore gurkha old photographs
- singapore gurkha photography museum
- singapore gurkhas


Text quest engine
Here is some text quest engine prototype. For online interactive literature stories testing.


JavaScript is disabled on your browser.
Skip navigation links
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
Prev Letter
Next Letter
Frames
No Frames
All Classes
A
C
D
E
F
G
H
I
J
L
M
N
O
P
R
S
T
U
V
W
X
Y
P
paintBackground(Graphics2D)
- Method in class swing.
PlanComponent
paintComponent(Graphics)
- Method in class swing.
PlanComponent
paintContent(Graphics2D)
- Method in class swing.
PlanComponent
paintGrid(Graphics2D)
- Method in class swing.
PlanComponent
paintIcon(Component, Graphics, int, int)
- Method in class io.
IconManager.IconProxy
Draw the icon at the specified location.
paintRectangleFeedback(Graphics2D)
- Method in class swing.
PlanComponent
paste()
- Method in class controller.
HomeController
piece
- Variable in class event.
FurnitureEvent
PieceOfFurniture
- Interface in
metier
pieceOfFurnitureChanged(FurnitureEvent)
- Method in interface listener.
FurnitureListener
planBoundsCache
- Variable in class swing.
PlanComponent
PlanComponent
- Class in
swing
PlanComponent(HomeModel, UserPreferences, PlanController)
- Constructor for class swing.
PlanComponent
PlanComponent.ActionType
- Enum in
swing
PlanComponentTest
- Class in
junit
PlanComponentTest()
- Constructor for class junit.
PlanComponentTest
PlanComponentTest.PlanTestFrame
- Class in
junit
planController
- Variable in class controller.
HomeController
PlanController
- Class in
controller
PlanController(HomeModel, UserPreferences, UndoableEditSupport)
- Constructor for class controller.
PlanController
planController
- Variable in class junit.
PlanComponentTest.PlanTestFrame
PlanController.ControllerState
- Class in
controller
PlanController.Mode
- Enum in
controller
PlanController.NewWallState
- Class in
controller
PlanController.PointWithMagnetism
- Class in
controller
PlanController.RectangleSelectionState
- Class in
controller
PlanController.SelectionMoveState
- Class in
controller
PlanController.SelectionState
- Class in
controller
PlanController.WallCreationState
- Class in
controller
PlanTestFrame()
- Constructor for class junit.
PlanComponentTest.PlanTestFrame
planView
- Variable in class controller.
PlanController
planView
- Variable in class swing.
HomePane
PointWithMagnetism(float, float, float, float)
- Constructor for class controller.
PlanController.PointWithMagnetism
postItemsMove(List<?>, float, float)
- Method in class controller.
PlanController
preferences
- Variable in class controller.
HomeController
preferences
- Variable in class controller.
PlanController
preferences
- Variable in class swing.
PlanComponent
pressMouse(float, float, int, boolean)
- Method in class controller.
PlanController.ControllerState
pressMouse(float, float, int, boolean)
- Method in class controller.
PlanController.NewWallState
pressMouse(float, float, int, boolean)
- Method in class controller.
PlanController
pressMouse(float, float, int, boolean)
- Method in class controller.
PlanController.RectangleSelectionState
pressMouse(float, float, int, boolean)
- Method in class controller.
PlanController.SelectionMoveState
pressMouse(float, float, int, boolean)
- Method in class controller.
PlanController.SelectionState
pressMouse(float, float, int, boolean)
- Method in class controller.
PlanController.WallCreationState
propertyChangeSupport
- Variable in class metier.
UserPreferences
A
C
D
E
F
G
H
I
J
L
M
N
O
P
R
S
T
U
V
W
X
Y
Skip navigation links
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
Prev Letter
Next Letter
Frames
No Frames
All Classes


Please, fill in the following form concerning specific details on the MD simulation protocol.
(A) Upload simulation files including coordinate file, topology file, trajectory files, simulation parameters, other files. In case of replicated, you can upload all files simultaneously (e.g. 20 to 100 replicates). After the file upload, please click the validate button in to order to ensure correct upload.
(B) Please complete the table of all simulation components by adding non-crystallized bulk molecules (e.g. waters, ions and lipids). For this, you only need to assign the corresponding residue name (resname) to the bulk molecules which are part of your simulation system. Then, click the "Validate" button to automatically fill the number of molecules (Num of mol) based on your uploaded simulation files
(C) Specify the simulation setup including information of Method, software, etc.
For more information on this form, see the docs.


Dalek.Sauce Class
This module is a driver plugin for DalekJS. It connects Daleks testsuite with the remote testing environment of Sauce Labs.
The driver can be installed with the following command:
$ npm install dalek-driver-sauce --save-dev
You can use the driver by adding a config option to the your Dalekfile
"driver": ["sauce"]
Or you can tell Dalek that it should run your tests via sauces service via the command line:
$ dalek mytest.js -d sauce
In order to run your tests within the Sauce Labs infrastructure, you must add your sauce username & key to your dalek configuration. Those two parameters must be set in order to get this driver up & running. You can specifiy them within your Dalekfile like so:
"driver.sauce": {
"user": "dalekjs",
"key": "aaaaaa-1234-567a-1abc-1br6d9f68689"
}
It is also possible to specify a set of other extra saucy parameters like name
& tags
:
"driver.sauce": {
"user": "dalekjs",
"key": "aaaaaa-1234-567a-1abc-1br6d9f68689",
"name": "Guineapig",
"tags": ["dalek", "testproject"]
}
If you would like to have a more control over the browser/OS combinations that are available, you are able to configure you custom combinations:
"browsers": [{
"chrome": {
"platform": "OS X 10.6",
"actAs": "chrome",
"version": 27
},
"chromeWin": {
"platform": "Windows 7",
"actAs": "chrome",
"version": 27
},
"chromeLinux": {
"platform": "Linux",
"actAs": "chrome",
"version": 26
}
You can then call your custom browsers like so:
$ dalek mytest.js -d sauce -b chrome,chromeWin,chromeLinux
or you can define them in your Dalekfile:
"browser": ["chrome", "chromeWin", "chromeLinux"]
A list of all available browser/OS combinations, can be found here.
Item Index
Methods
_actionQueueNonReturneeTemplate
-
fnName
-
hash
-
uuid
Generates a chain of webdriver calls for webdriver methods that don't have a return value TODO: Name is weird, should be saner
Parameters:
-
fnName
StringName of the webdriver function that should be called
-
hash
StringUnique action hash
-
uuid
StringUnique action hash
_createNonReturnee
-
fnName
Creates an anonymus function that calls a webdriver method that has no return value, emits an empty result event if the function has been run TODO: Name is weird, should be saner
Parameters:
-
fnName
StringName of the webdriver function that should be called
Returns:
fn
_driverStatus
-
statusInfo
Loads the browser driver status
Parameters:
-
statusInfo
ObjectDriver status information
Returns:
promise Driver status promise
_generateDummyDriverMessageFn
-
fnName
-
hash
-
uuid
Creates a driver notification with an empty value TODO: Name is weird, should be saner
Parameters:
-
fnName
StringName of the webdriver function that should be called
-
hash
StringUnique action hash
-
uuid
StringUnique action hash
Returns:
promise Driver message promise
_initializeProperties
-
browser
Binds listeners on browser events
Parameters:
-
browser
ObjectBrowser module
_initializeProperties
-
opts
Initializes the driver properties
Parameters:
-
opts
ObjectOptions needed to kick off the driver
_sessionStatus
-
sessionInfo
Loads the browser session status
Parameters:
-
sessionInfo
ObjectSession information
Returns:
promise Browser session promise
_startBrowserSession
-
deferred
Creates a new webdriver session Gets the driver status Gets the session status Resolves the promise (e.g. let them tests run)
Parameters:
-
deferred
ObjectBrowser session deferred
create
-
opts
Creates a new driver instance
Parameters:
-
opts
ObjectOptions needed to kick off the driver
Returns:
driver
dummyBrowser
()
Bool
Determines if the driver comes with its own browsers bundled
Returns:
isDummyBrowser Driver does not rely on Dalek browser modules
end
()
chainable
Starts to execution of a batch of tests
flushQueue
()
chainable
Flushes the action queue (e.g. commands that should be send to the wbdriver server)
getBrowser
-
driver
Returnes the browser that comes bundled with the driver
Parameters:
-
driver
ObjectDriver instance
Returns:
Browser module
isMultiBrowser
()
Bool
Determines if the driver is a "multi" browser driver, e.g. can handle more than one browser
Returns:
isMultiBrowser Driver can handle more than one browser
start
()
Object
Checks if a webdriver session has already been established, if not, create a new one
Returns:
promise Driver promise
verifyBrowser
()
Bool
Verifies a browser request TODO: Still a noop, need to add "verify the browser" logic
Returns:
isVerifiedBrowser Driver can handle this browser


{% extends "base.html" %} {% block head%}
Select the offer you want to make to the RESPONDER from the dropdown menu below.
{{form.submit()}}


Adds a hinge loss to the training procedure.
tf.compat.v1.losses.hinge_loss( labels, logits, weights=1.0, scope=None, loss_collection=tf.GraphKeys.LOSSES, reduction=Reduction.SUM_BY_NONZERO_WEIGHTS )
labels
: The ground truth output tensor. Its shape should match the shape of
logits. The values of the tensor are expected to be 0.0 or 1.0. Internally
the {0,1} labels are converted to {-1,1} when calculating the hinge loss.logits
: The logits, a float tensor. Note that logits are assumed to be
unbounded and 0-centered. A value > 0 (resp. < 0) is considered a positive
(resp. negative) binary prediction.weights
: Optional Tensor
whose rank is either 0, or the same rank as
labels
, and must be broadcastable to labels
(i.e., all dimensions must
be either 1
, or the same as the corresponding losses
dimension).scope
: The scope for the operations performed in computing the loss.loss_collection
: collection to which the loss will be added.reduction
: Type of reduction to apply to loss.Weighted loss float Tensor
. If reduction
is NONE
, this has the same
shape as labels
; otherwise, it is scalar.
ValueError
: If the shapes of logits
and labels
don't match or
if labels
or logits
is None.The loss_collection
argument is ignored when executing eagerly. Consider
holding on to the return value or collecting losses via a tf.keras.Model
.


%inherit file="/base/index.html"/> <%def name="title()">Signed In%def> <%def name="heading()">
You are signed in as ${request.environ['REMOTE_USER']}. Sign out


Infinispan Server: remote protocols improvements
A couple of weeks ago, Infinispan 5.3.0.Beta1 was released, which brought a slew of improvements to two of the remoting protocols: Hot Rod and REST. This week’s 5.3.0.Beta2 brings even more goodies: the ability to expose the same container over multiple Hot Rod endpoints and the integration of the WebSocket endpoint. We’ve also been working on fleshing out the documentation for the server.
Hot Rod SSL
Hot Rod, Infinispan’s own high-performance, topology aware protocol, has gained the ability to encrypt the communication using SSL and optionally require client certificate authentication. While this is still not the full-blown authentication/authorization infrastructure we will be implementing for Infinispan 6.0, it is the first step in that direction. In the context of the Infinispan Server, setting this up is quite simple. Download the Infinispan Server distribution from http://www.jboss.org/infinispan/downloads and unzip it. Next create a keystore with a self-signed certificate:
$ keytool -genkey -alias hotrod -keyalg RSA -keystore keystore.jks -keysize 2048 Enter keystore password: secret Re-enter new password: secret What is your first and last name? [Unknown]: HotRod What is the name of your organizational unit? [Unknown]: Infinispan What is the name of your organization? [Unknown]: JBoss What is the name of your City or Locality? [Unknown]: Red Hat What is the name of your State or Province? [Unknown]: World What is the two-letter country code for this unit? [Unknown]: WW Is CN=HotRod, OU=Infinispan, O=JBoss, L=Red Hat, ST=World, C=WW correct? [no]: yes
Enter key password for <hotrod> (RETURN if same as keystore password):
Put the keystore in the standalone/configuration directory together with the standalone-hotrod-ssl.xml from the docs/examples/configs directory. Now start the server using bin/standalone.sh -c standalone-hotrod-ssl.xml This will start a server with a HotRod endpoint on port 11222 which will only accept SSL connections.
Now we need a client:
This client needs to find the keystore.jks file you generated above.
Hot Rod container sharing
Another feature added to the Hot Rod endpoint is the ability to share the same container between multiple endpoints, and exposing them on different interfaces. This could be used to offer an unencrypted backend endpoint to be used by "internal" servers to populate the cache and an encrypted frontend endpoint to be used by "external" applications. With the future addition of authorization, this will offer the ability to handle many types of security scenarios.
REST Extended Headers
The REST endpoint now returns the Expires header for mortal entries. It will also return additional headers when the extended query parameter is added, e.g. GET /cacheName/cacheKey?extended will return the following custom headers:
-
Cluster-Primary-Owner: the node name of the primary owner for this key
-
Cluster-Node-Name: the JGroups node name of the server that has handled the request
-
Cluster-Physical-Address: the physical JGroups address of the server that has handled the request.
With the introduction of custom metadata, courtesy of ISPN-2281, we will also allow returning that information too.
REST Collections
Another improvement made to the REST endpoint is the ability to retrieve all keys in a cache, by simply invoking a GET /cacheName This will return a list of keys present in the given cacheName as the body of the response. The format of the response can be controlled via the Accept header as follows:
-
application/xml - the list of keys will be returned in XML format.
-
application/json - the list of keys will be return in JSON format.
-
text/html - the list of keys will be returned in HTML format.
-
text/plain - the list of keys will be returned in plain text format, one key per line
If the cache identified by cacheName is distributed, only the keys owned by the node handling the request will be returned. To return all keys, append the "global" parameter to the query, as follows: GET /cacheName?global
WebSocket endpoint
The WebSocket endpoint is now finally part of the new Infinispan Server package. Bear in mind that this is just a pure WebSocket server. When we will be able to upgrade our base from AS 7.x to WildFly 8 we will be able to take advantage of the new Undertow web server which has native support for WebSockets.


{{for|the drug known as "tripoline"|Tricyclic antidepressant}} {{Infobox prepared food | name = Tripoline | image = | caption = | alternate_name = | country = Italy | region = | creator = | course = | type = Pasta | served = | main_ingredient = | variations = | calories = | other = }} {{Unreferenced|date=July 2011}} Tripoline is a type of ribbon pasta noodles, similar to mafaldine. It is thick ribbon ridged on each side.
{{Pasta}}
{{Italy-cuisine-stub}}


--- layout: post title: 'Lovely quote via Louise Ferguson:' date: 2004-12-30 00:00:00 ---
Lovely quote via Louise Ferguson: "There's more to life than adding another feature."


Abstract base class for all charts supported by the Google Chart Tools.
Located in /googlecharttools/view/Chart.class.php (line 38)
OptionStorage | --Chart
Creates a new chart.
Adds additional code to the generated JavaScript code.
The code will be added outside the prepare-function.
Adds additional code to the generated JavaScript prepare-function.
The code will be added at the end of the function.
Gets the HTML <div> container in which the chart will be displayed.
Gets the chart's ID.
Generates the JavaCode that will be used inside the script-element.
The script-element is typically located inside the <head> HTML element. The generated JavaScript code contains a prepare method that will set the chart's data, options and chart itself. There is typically no need to call this method manually. Instead, this method is called for every chart that has been added to the ChartManager when ChartManager::getJavaScriptCode() is called.
Sets the chart's data.
The data will be used by the API to draw the chart.
Sets the chart's height used when the chart is displayed.
Sets the chart's width used when the chart is displayed.
Inherited From OptionStorage
OptionStorage::encodeOptions()
OptionStorage::getOption()
OptionStorage::setOption()
OptionStorage::setOptionArray()
OptionStorage::setOptionBoolean()
OptionStorage::setOptionNumeric()
Documentation generated on Mon, 01 Oct 2012 16:45:02 +0200 by phpDocumentor 1.4.4


| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
enumerate all values in a finite type.
e.g.
>>>
:set -XDeriveGeneric
>>>
:set -XDeriveAnyClass
given:
-- anEnumerable
can be automatically derived, -- even though it's a nested sum type (and thus not anEnum
). data Edit = Edit Action Slice Region deriving (Show,Read,Eq,Ord,Generic,Enumerable) data Action = Select | Copy | Delete deriving (Show,Read,Eq,Ord,Enum,Bounded,Generic,Enumerable) data Slice = Whole | Backwards | Forwards deriving (Show,Read,Eq,Ord,Enum,Bounded,Generic,Enumerable) data Region = Character | Token | Line deriving (Show,Read,Eq,Ord,Enum,Bounded,Generic,Enumerable)
we can enumerate every possible editing action:
> enumerated
:: [Edit]
Edit Select Whole Character
Edit Select Whole Token
Edit Select Whole Line
Edit Select Backwards Character
Edit Select Backwards Token
Edit Select Backwards Line
Edit Select Forwards Character
Edit Select Forwards Token
Edit Select Forwards Line
Edit Copy Whole Character
Edit Copy Whole Token
Edit Copy Whole Line
Edit Copy Backwards Character
Edit Copy Backwards Token
Edit Copy Backwards Line
Edit Copy Forwards Character
Edit Copy Forwards Token
Edit Copy Forwards Line
Edit Delete Whole Character
Edit Delete Whole Token
Edit Delete Whole Line
Edit Delete Backwards Character
Edit Delete Backwards Token
Edit Delete Backwards Line
Edit Delete Forwards Character
Edit Delete Forwards Token
Edit Delete Forwards Line
see Enumerate.Types for detailed documentation.
the modules Enumerate.Large and Enumerate.Function have orphan instances for large types, and aren't reexported by default. this makes attempting to enumerate them a type error, rather than runtime non-termination.
See the source of Enumerate.Example for an example.


What are Bready Crumbs? That's what we call members of the Bready Member Club. The Bready Member Club is open to anyone who registers for an account. Upon registration, we will provide you a Crumb Card which you can use at our location rack up Crumb Points and unlock special discounts! By being a member, you can also opt in to receive weekly offers and coupons in your email. Sign up now! It's quick, easy, and free!
Manage your Bready Crumb account or register for one here.


Select a category, either buying rate or selling rate.
Select a coin you wish to trade.
Select a currency you wish to deal with.
Enter the margin you want over the average coin market price, Use a negative value for buying or selling under the market price to attract more contacts. For more complex pricing edit the fixed price value directly.
Enter a fixed price you wish to trade at.
Set a maximum transaction amount in one trade.
Set a minimum transaction amount in one trade.


I first became acquainted with this drug after a visit to the doctor complaining of chronic back pain. I know how ridiculously hard it is to get any opiate from American doctors so I expected some naproxen or ibuprofen. He gave me tramadol instead and I thought it was just some generic celebrex. When I learned it was a synthetic opioid I was pretty excited, I should admit I have a bit of an addiction to Vicodin.
I got home and after some research decided on 100mg. The effects took very long to come on, nearly an hour. I would have to describe the most overwhelming feeling of this drug as warm and tingly. Unfortunately I experienced no euphoria as with traditional opioids, however it wasn't an unpleasant feeling, just not a 'high' like I'm used to.
I will say that it lasts a heck of long time, 8-10 hours, and is very great at reducing withdrawal symptoms from opioids like vicodin, etc. That is the only reason I keep it on hand. It's similar to methadone, in that it provides a numbing long lasting opiate feeling that hides the nasty withdrawal symptoms. Unfortunately, as I found out later, tramadol has some withdrawal syptoms of it's own, but I found them to be much more manageable than the restlessness, anxiety and fatigue from vicodin withdrawal.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


## Dialog Lightbox The `PacemDialogElement` wraps a lightbox and forces the user to "pick a button" to be able to interact with the layout again. Calling the `open()` method a `state` can be passed to the dialog and a `Promise` gets returned with the clicked button and the provided state as a value `{ button, state }`.
Ok and Cancel button are provided in order to close the dialog. Pick one.


Before Change
mean_prediction = np.array([mean_prediction])
std_prediction = np.array([std_prediction])
for feature_idx, feature_id in enumerate(feature_ids):
val_col = feature_columns[feature_idx]
pd_dict[val_col] = new_row[feature_idx]
number_of_classes = len(class_columns)
assert number_of_classes == mean_prediction.shape[0], "Mismatch between prediction dimension" \
"and number of class names" \
"Prediction dimension: {} " \
After Change
"n class_names: {}".format(*[mean_prediction.shape,
number_of_classes])
pd_dict = {column: new_row[idx] for idx, column in enumerate(feature_columns)}
if number_of_classes == 2:
class_column = class_columns[1]
pd_dict[class_column] = mean_prediction[1]
pd_dict["sd"] = std_prediction[0]


Automobili Lamborghini S.p.A. (Italian: [lamborˈɡiːni] (About this sound listen)) is an Italian brand and manufacturer of ...
FERRARI
Ferrari N.V. is an Italian sports car manufacturer based in Maranello. Founded by Enzo Ferrari in 1939 out of Alfa Romeo's race division as Auto Avio Costruzioni, the company built its first car in 1940.
MASERATI
Maserati is an Italian luxury vehicle manufacturer established on 1 December 1914, in Bologna. The Maserati tagline is "Luxury, sports and style cast in exclusive cars", and the brand's mission statement ...
LAMBORGHINI
Automobili Lamborghini S.p.A. (Italian: [lamborˈɡiːni] (About this sound listen)) is an Italian brand and manufacturer of ...


Salvia divinorum (extract) and Amanitas - A. muscaria
Background: I have had a few experiences with LSD, many with magic mushrooms, cannabis, and DXM. I am a very positive person who also has a very strong stomach and a very strong mind.
Salvia Extraction: I used the extraction technique for Salvia as mentioned in the Salvia FAQ. I powdered about 50 grams of dried salvia leaves that I purchased online. Then poured the powdered leaves into a glass pie dish and added a significant amount of acetone to the bowl, enough to cover the powder by about 1.5 inches. I then stirred the solution of acetone and salvia powder leaves periodically (6 times total) for about 24 hours. Then I used a paper towel and a plastic cup to filter the powdered salvia out of the acetone mixture.
I then was left with another glass dish filled with a very green (almost black) fluid of acetone that contained the chemical of Salvia in it. I then placed 5 grams of dried whole leaves in this green liquid and let the acetone evaporate. I placed a fan in front of the dish to expedite the process. Once evaporated, the leaves were covered with a dry resin that made the leaves appear very dark green or black almost. Due to some spilling and the extraction being imperfect… these 5 grams of leaves with the extracted resin on them are about 8 times as potent as a normal dry leaf, maybe a little more than that.
Amanitas Preparation: This was easily done. I simply ordered the Grade A Amanitas from the same online source. I then placed a combination of mainly caps and some stems into a food processor and ground the mushrooms up. I then measured 13 grams of mushroom powder out and mixed the powder with peanut butter. This makes the taste pretty nice and not hard to down.
Experience: I ingested the peanut butter/amanitas mixture at about 7 o’clock on an empty stomach. Then I smoked a small bowl, weighing no more than .25 grams, of my salvia extract. I smoked it out of a small pipe. I figured I would do this and start my trip while I waited for the mushrooms to kick in. I took about three hits and held each hit in for about 15 seconds! The longer the better but it is hard to do for me. I didn’t finish this small bowl but as soon as I put the pipe down I was blasted off to another reality!
I got very sweaty and I stood up. I had lost all short term memory for about 10 min and didn’t know my own name, if I had smoked anything, or where I was! It was crazy. I did not have any visualizations but that is because I didn’t hold the smoke in long enough. I stumbled around my apartment for about 15 minutes wondering how I had gotten into this state. It was still pleasant though. This altered reality to which I was foreign was still nice. My body had a slight floating and euphoric effect to it. I then came down about 15 minutes later. The after effects were kinda similar to being stoned but a little more noticeable in my body than in my mind. I continued to take this little 10 minute journey two more times before I realized the mushrooms were talking a hold of me!
I did not feel any stomach irritation. The trip was very mellow. I did get plenty of closed eye visualizations and when I would close my eyes I would enter into a dreamy, half awake state where my mind could fly through galaxies of though and color! It was amazing. I ventured to a nearby golf course, which was somewhat difficult because my limbs felt very heavy and hard to move. I laid on the soft grass feeling a mild leftover from the Salvia but primarily the mushrooms! This is about 3 hours into the trip now and I just sit on the grass almost sleeping but more dreaming and listening to Dave Mathews on my IPod.
For the next 3 hours I was peaking and enjoying every minute of it. When I finally went inside my friends told me I was walking very slow and seemed very mellow. I do not remember actually climbing into bed or even going back to my apartment but rather just a long adventure in my dreams! I may have walked all over the place! The next morning I actually woke up early, feeling refreshed and happy with the entire night!
In summary, both of these substances seemed to have a VERY powerful effect on me and worked very well with each other. Overall, I would change two things. I would have smoked the Salvia from a water bong as to make the trip more intense. And, I would not have ground up the mushrooms as they are easier to eat just plain because there is not a powdery mess afterward.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


4
Switch API Client
Back to Switches!
Switch
Room
Options
ON
OFF
.

Succes!


In his petition, Azeez, said that he can no longer bear the shame which his wife had continually brought on him.
According to him the humiliation by neighbours and landlords’ association as a result of his wife’s habitual stealing has overwhelmed him.
“When Atinuke stealing first started, I did not take it too seriously until she graduated into a huge embarrassment for me.
“Three months ago, I received many phone calls in my office on how my wife was selling neighbours’ domestic animals such as goats.
Read Also: Court remands two over alleged armed robbery
“People whose goats were missing in the community have traced it to her selling them in collaboration with her accomplices.
“Before I knew it, the landlords’ association had ordered my entire family to immediately leave the community or else, they might get me arrested.
“While I was looking for money to pay for the stolen goat, Atinuke was again engulfed in an allegation of stealing mobile phones from a mosque in the area.
“She was in an argument with her partner in crime on how to collect her share before she was caught.

“In fact, she smashed food plate on my head the last time.
“I don’t want her to continue to destroy my reputation, please, separate us,” Azeez begged
However, the respondent opposed the claims and prayed the court not to put an end to her union.

“Azeez is right with the issue of goats and I have promised to change, but I didn’t steal any mobile phone.
“I don’t know why I am stealing, I have been trying to resolve it spiritually,” Atinuke said.
After listening to both parties, Chief Henry Agbaje, the President of the court, appealed to the petitioner to exercise more patience.
Agbaje advised the couple to produce their relatives in court by the Nov. 28 for judgment.
NAN


--- layout: post status: publish published: true title: Rotor Job, anyone? author: display_name: Tomas Restrepo login: tomasr email<EMAIL_ADDRESS>url: http://winterdom.com/ author_login: tomasr author_email<EMAIL_ADDRESS>author_url: http://winterdom.com/ wordpress_id: 593 wordpress_url: http://winterdom.com/2003/01/rotorjobanyone date: '2003-01-25 17:46:02 +0000' date_gmt: '2003-01-25 17:46:02 +0000' categories: - ".NET" tags: [] comments: [] ---
Humm... Looks like Microsoft is looking for someone to help with Rotor development.
Any takers?


It was Sunday night and my friend Alex called me and asked if I wanted to smoke some salvia. I had used the substance before, but without very impressive results. I had had quite a weekend, doing mushrooms on Friday and ecstacy the next night, but this didnít really stop me. So I went to pick up Alex and senor perc, our perculator, and went to my house. After some discussion, we decided the back yard would be the best place for the experience. We went out to the two chairs in the back of my yard. The chairs faced the lawn and a fence covered in vines was to the left and my house was to the right.
Alex decided he would take the first hit and that I would take the second. He filled the small bowl with about 1/10 of the gram we had. Using a compressed butane torch, he finished the bowl in 3 hits. After a few seconds he had this goofy look on his face and he told me that he was tripping. I waited for a few minutes before preparing mine to smoke. Our plan was to wait until he was tripping before I began my trip, but after seeing him, I could not wait and he told me to hit mine. I handed him my cigarette to hold, and he smoked it, which he never ever does, I knew for a fact that he was tripping pretty hard. I filled my bowl with the same amount he did and proceeded to smoke it. My bowl was finished after two hits. I told him that I needed another hit and as he was reaching in his pockets for it, it hit me. Salvia hit me harder than any drug I had ever done before.
All of the sudden the entire backyard jumped up and in a swooping motion flew into the air and came back down with a slam. Out of nowhere, what can only be described as purple and black zippers appeared on my lawn. They were perfectly straight lines, equally spaced apart. They were racing down my lawn away from Alex and I. I looked over at Alex and realized that my fence was covered in green vines. There are really only a few vines on the fence, but now there were hundreds of them and they were alive. They were crawling all over my fence. I looked back at the lawn to check on my zippers and saw that they were still there, moving extremely fast.
Alex then suggested to me that we move inside into my bedroom. I agreed. I stood up and the zippers on the lawn rose with me. At this point I think I realized how terrifying this was. Suddenly I felt this force pulling at my body, I don't think it wanted me to leave the back yard, I had a hard time walking. I was pretty scared at this point but I was laughing hysterically. We finally made it into the house and up the stairs to my bedroom. Once we got to my room, Alex told me to turn on some music. After messing with my computer, I realized that the music wouldn't play. I looked down at the carpet and realized that it had split into two lairs. One being the carpet and the other one was the lines in the carpet, hovering about a foot off the ground. We decided to turn the lights off.
I went over to the wall and flipped the switch and went to lay on my bed. At this point I became extremely frightend and told Alex to turn the lights back on. I then became very annoyed with Alex and I didnít think anything he did or say was right. He could have said hello and I would have thought it was wrong of him to say it. We then called our friend James. Alex handed me the phone. I don't really remember the conversation we had, all I know is that I made no sense. I handed Alex the phone and he finished the conversation.
I started to think that I would never snap out of it and got worried. I started pacing back and fourth across the room trying to calm myself down. I decided to go downstairs and grab some water. I did and then went and switched on the TV. There were two people talking and out of nowhere the woman turned into a zombie like creature and she started to move towards the man and he became frightened and then it appeared as though he was a decaying corpse. Then the clip ended and I realized that it was Americas Funniest Home Videos. I thought it was a little strange that they would be showing a horror clip. I quickly switched off the TV and ran upstairs, laughing again. I donít know why I was laughing, I wasn't having much fun.
The trip started to wear off but I was still very annoyed with Alex and the whole experience. I told him that I never wanted to do salvia again. I was pretty scared about everything that had just happened and I was shaking. Eventually I returned to normal, and was very glad to do so.
During the trip, I wasn't having a good time, but after reflecting upon it, I realized that salvia is very interesting and I would like to try it again sometime when my body is better relaxed and prepared for such a strong substance. Next time I plan to have one sober person with me and I want to stay in one spot. I think moving inside was the mistake we made, there was too much going on for my brain to handle.
All in all, I'd say that it was an extremely enlightening experience.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


| 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.math3.geometry.euclidean.twod; | |
| 18 | ||
| 19 | import java.util.ArrayList; | |
| 20 | import java.util.Iterator; | |
| 21 | ||
| 22 | import org.apache.commons.math3.exception.MathIllegalArgumentException; | |
| 23 | import org.apache.commons.math3.exception.util.LocalizedFormats; | |
| 24 | import org.apache.commons.math3.geometry.euclidean.oned.IntervalsSet; | |
| 25 | import org.apache.commons.math3.geometry.partitioning.Region; | |
| 26 | import org.apache.commons.math3.geometry.partitioning.RegionFactory; | |
| 27 | import org.apache.commons.math3.geometry.partitioning.SubHyperplane; | |
| 28 | ||
| 29 | /** This class represent a tree of nested 2D boundary loops. | |
| 30 | ||
| 31 | *
This class is used for piecewise polygons construction. | |
| 32 | * Polygons are built using the outline edges as | |
| 33 | * representative of boundaries, the orientation of these lines are | |
| 34 | * meaningful. However, we want to allow the user to specify its | |
| 35 | * outline loops without having to take care of this orientation. This | |
| 36 | * class is devoted to correct mis-oriented loops.
 | |
| 37 | ||
| 38 | *
Orientation is computed assuming the piecewise polygon is finite, | |
| 39 | * i.e. the outermost loops have their exterior side facing points at | |
| 40 | * infinity, and hence are oriented counter-clockwise. The orientation of | |
| 41 | * internal loops is computed as the reverse of the orientation of | |
| 42 | * their immediate surrounding loop.
 | |
| 43 | ||
| 44 | * @version $Id$ | |
| 45 | * @since 3.0 | |
| 46 | */ | |
| 47 | class NestedLoops { | |
| 48 | ||
| 49 | /** Boundary loop. */ | |
| 50 | private Vector2D[] loop; | |
| 51 | ||
| 52 | /** Surrounded loops. */ | |
| 53 | private ArrayList<NestedLoops> surrounded; | |
| 54 | ||
| 55 | /** Polygon enclosing a finite region. */ | |
| 56 | private Region<Euclidean2D> polygon; | |
| 57 | ||
| 58 | /** Indicator for original loop orientation. */ | |
| 59 | private boolean originalIsClockwise; | |
| 60 | ||
| 61 | /** Simple Constructor. | |
| 62 | *
Build an empty tree of nested loops. This instance will become | |
| 63 | * the root node of a complete tree, it is not associated with any | |
| 64 | * loop by itself, the outermost loops are in the root tree child | |
| 65 | * nodes.
 | |
| 66 | */ | |
| 67 | public NestedLoops() { | |
| 68 | surrounded = new ArrayList<NestedLoops>(); | |
| 69 | } | |
| 70 | ||
| 71 | /** Constructor. | |
| 72 | *
Build a tree node with neither parent nor children
 | |
| 73 | * @param loop boundary loop (will be reversed in place if needed) | |
| 74 | * @exception MathIllegalArgumentException if an outline has an open boundary loop | |
| 75 | */ | |
| 76 | private NestedLoops(final Vector2D[] loop) throws MathIllegalArgumentException { | |
| 77 | ||
| 78 |
1
1. |
if (loop[0] == null) { |
| 79 | throw new MathIllegalArgumentException(LocalizedFormats.OUTLINE_BOUNDARY_LOOP_OPEN); | |
| 80 | } | |
| 81 | ||
| 82 | this.loop = loop; | |
| 83 | surrounded = new ArrayList<NestedLoops>(); | |
| 84 | ||
| 85 | // build the polygon defined by the loop | |
| 86 | final ArrayList<SubHyperplane<Euclidean2D>> edges = new ArrayList<SubHyperplane<Euclidean2D>>(); | |
| 87 |
1
1. |
Vector2D current = loop[loop.length - 1]; |
| 88 |
2
1. 2. |
for (int i = 0; i < loop.length; ++i) { |
| 89 | final Vector2D previous = current; | |
| 90 | current = loop[i]; | |
| 91 | final Line line = new Line(previous, current); | |
| 92 | final IntervalsSet region = | |
| 93 | new IntervalsSet(line.toSubSpace(previous).getX(), line.toSubSpace(current).getX()); | |
| 94 | edges.add(new SubLine(line, region)); | |
| 95 | } | |
| 96 | polygon = new PolygonsSet(edges); | |
| 97 | ||
| 98 | // ensure the polygon encloses a finite region of the plane | |
| 99 |
1
1. |
if (Double.isInfinite(polygon.getSize())) { |
| 100 | polygon = new RegionFactory<Euclidean2D>().getComplement(polygon); | |
| 101 | originalIsClockwise = false; | |
| 102 | } else { | |
| 103 | originalIsClockwise = true; | |
| 104 | } | |
| 105 | ||
| 106 | } | |
| 107 | ||
| 108 | /** Add a loop in a tree. | |
| 109 | * @param bLoop boundary loop (will be reversed in place if needed) | |
| 110 | * @exception MathIllegalArgumentException if an outline has crossing | |
| 111 | * boundary loops or open boundary loops | |
| 112 | */ | |
| 113 | public void add(final Vector2D[] bLoop) throws MathIllegalArgumentException { | |
| 114 |
1
1. add : removed call to org/apache/commons/math3/geometry/euclidean/twod/NestedLoops::add → NO_COVERAGE |
add(new NestedLoops(bLoop)); |
| 115 | } | |
| 116 | ||
| 117 | /** Add a loop in a tree. | |
| 118 | * @param node boundary loop (will be reversed in place if needed) | |
| 119 | * @exception MathIllegalArgumentException if an outline has boundary | |
| 120 | * loops that cross each other | |
| 121 | */ | |
| 122 | private void add(final NestedLoops node) throws MathIllegalArgumentException { | |
| 123 | ||
| 124 | // check if we can go deeper in the tree | |
| 125 | for (final NestedLoops child : surrounded) { | |
| 126 |
1
1. add : negated conditional → NO_COVERAGE |
if (child.polygon.contains(node.polygon)) { |
| 127 |
1
1. add : removed call to org/apache/commons/math3/geometry/euclidean/twod/NestedLoops::add → NO_COVERAGE |
child.add(node); |
| 128 | return; | |
| 129 | } | |
| 130 | } | |
| 131 | ||
| 132 | // check if we can absorb some of the instance children | |
| 133 | for (final Iterator<NestedLoops> iterator = surrounded.iterator(); iterator.hasNext();) { | |
| 134 | final NestedLoops child = iterator.next(); | |
| 135 |
1
1. add : negated conditional → NO_COVERAGE |
if (node.polygon.contains(child.polygon)) { |
| 136 | node.surrounded.add(child); | |
| 137 |
1
1. add : removed call to java/util/Iterator::remove → NO_COVERAGE |
iterator.remove(); |
| 138 | } | |
| 139 | } | |
| 140 | ||
| 141 | // we should be separate from the remaining children | |
| 142 | RegionFactory<Euclidean2D> factory = new RegionFactory<Euclidean2D>(); | |
| 143 | for (final NestedLoops child : surrounded) { | |
| 144 |
1
1. add : negated conditional → NO_COVERAGE |
if (!factory.intersection(node.polygon, child.polygon).isEmpty()) { |
| 145 | throw new MathIllegalArgumentException(LocalizedFormats.CROSSING_BOUNDARY_LOOPS); | |
| 146 | } | |
| 147 | } | |
| 148 | ||
| 149 | surrounded.add(node); | |
| 150 | ||
| 151 | } | |
| 152 | ||
| 153 | /** Correct the orientation of the loops contained in the tree. | |
| 154 | *
This is this method that really inverts the loops that where | |
| 155 | * provided through the {@link #add(Vector2D[]) add} method if | |
| 156 | * they are mis-oriented
 | |
| 157 | */ | |
| 158 | public void correctOrientation() { | |
| 159 | for (NestedLoops child : surrounded) { | |
| 160 |
1
1. correctOrientation : removed call to org/apache/commons/math3/geometry/euclidean/twod/NestedLoops::setClockWise → NO_COVERAGE |
child.setClockWise(true); |
| 161 | } | |
| 162 | } | |
| 163 | ||
| 164 | /** Set the loop orientation. | |
| 165 | * @param clockwise if true, the loop should be set to clockwise | |
| 166 | * orientation | |
| 167 | */ | |
| 168 | private void setClockWise(final boolean clockwise) { | |
| 169 | ||
| 170 |
2
1. setClockWise : Replaced XOR with AND → NO_COVERAGE 2. setClockWise : negated conditional → NO_COVERAGE |
if (originalIsClockwise ^ clockwise) { |
| 171 | // we need to inverse the original loop | |
| 172 | int min = -1; | |
| 173 | int max = loop.length; | |
| 174 |
4
1. setClockWise : changed conditional boundary → NO_COVERAGE 2. setClockWise : Changed increment from 1 to -1 → NO_COVERAGE 3. setClockWise : Changed increment from -1 to 1 → NO_COVERAGE 4. setClockWise : negated conditional → NO_COVERAGE |
while (++min < --max) { |
| 175 | final Vector2D tmp = loop[min]; | |
| 176 | loop[min] = loop[max]; | |
| 177 | loop[max] = tmp; | |
| 178 | } | |
| 179 | } | |
| 180 | ||
| 181 | // go deeper in the tree | |
| 182 | for (final NestedLoops child : surrounded) { | |
| 183 |
2
1. setClockWise : negated conditional → NO_COVERAGE 2. setClockWise : removed call to org/apache/commons/math3/geometry/euclidean/twod/NestedLoops::setClockWise → NO_COVERAGE |
child.setClockWise(!clockwise); |
| 184 | } | |
| 185 | ||
| 186 | } | |
| 187 | ||
| 188 | } | |
Mutations | ||
| 78 |
1.1 |
|
| 87 |
1.1 |
|
| 88 |
1.1 2.2 |
|
| 99 |
1.1 |
|
| 114 |
1.1 |
|
| 126 |
1.1 |
|
| 127 |
1.1 |
|
| 135 |
1.1 |
|
| 137 |
1.1 |
|
| 144 |
1.1 |
|
| 160 |
1.1 |
|
| 170 |
1.1 2.2 |
|
| 174 |
1.1 2.2 3.3 4.4 |
|
| 183 |
1.1 2.2 |


© NZ Wella YPS 2008
HOME BACKGROUND REGIONAL COMPETITIONS RULES JUDGES WELLA PRODUCTS SPONSORS
Online voting 2008 has been finished. See Winners Here


Welcome to the
Island Resort Spa
Webpage
Pictures
Accomodations
Activities
Travel arrangements
Pictures
Contact
Island resort Spa
, where dreams meet the ocean!


[gecode-users] diffn constraint for Gecode
Christian Schulte
cschulte at kth.se
Sat May 28 16:04:37 CEST 2011
Dear Sandro,
It will be equivalent to the decomposition into reified constraints albeit
using constructive disjunction for better pruning. Yes, eventually one
should go for something based on Beldiceanu & Carlsson.
The real reason to add it for us has been that we needed a variant where the
dimensions of the boxes are variables as well (slightly more messy as the
box might turn out to have a volume of zero!).
If you ever feel like getting busy, please let me know!
Best
Christian
--
Christian Schulte, KTH, web.it.kth.se/~cschulte/
-----Original Message-----
From: Sandro Pirkwieser [mailto:pirkwieser at gmail.com]
Sent: Thursday, May 26, 2011 9:34 PM
To: cschulte at kth.se
Cc: users at gecode.org
Subject: Re: [gecode-users] diffn constraint for Gecode
Dear Christian,
> Co-incidence: I have been adding a naïve (but better than the
> decomposition) version of the constraint to Gecode recently. I will
> move that code to the trunk this week (there are still some glitches to
fix before that).
now that's convenient!
On which algorithm is it based?
> The plan is to eventually improve to a state-of-the-art implementation.
This sounds good.
Would you consider the sweep algorithm proposed by Beldiceanu and Carlsson
as state-of-the-art, or are there any alternatives? Btw do you know which
one is applied in JaCoP?
> Taking code directly from Jacop into Gecode will not work due to their
> license.
The intention was more to get an inspiration. Anyway, both frameworks
probably differ too much.
> Maybe you would even be interested to contribute? At least you would
> have a nice structure to start from.
Yes, we can indeed think about this. Though I am not yet in a state where I
can "hack" something into Gecode, it would be a good opportunity to start
doing so.
Best regards,
Sandro
> We will release soonish a new version that will incorporate that but
> there are more things to be done before a release.
>
> Best
> Christian
>
> --
> Christian Schulte, KTH, web.it.kth.se/~cschulte/
>
>
> -----Original Message-----
> From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On
> Behalf Of Sandro Pirkwieser
> Sent: Wednesday, May 25, 2011 9:01 PM
> To: users at gecode.org
> Subject: [gecode-users] diffn constraint for Gecode
>
> Hello,
>
> I'm using Gecode to tackle a 2D packing subproblem inside an
> optimization problem. The subproblem is about packing rectangles (for
> the meantime without rotation) into a given larger rectangle and many
> instances of moderate size need to be solved. Fortunately I was able
> to start with the perfect-square example, where the adapted variant
> already performs quite good (using the cumulatives constraint). Also
> enabling branching on intervals yielded a speed-up. Now I was
> wondering if someone of you already implemented a suitable diffn
> constraint (see
> http://www.emn.fr/z-info/sdemasse/gccat/Cdiffn.html) in Gecode. In
> this way the non-overlapping part would (presumably) be tackled more
> efficiently and give an additional performance boost. Do you think
> having a look at the
> diff/diff2 implementation in JaCoP is useful for implementing it in
Gecode?
> Thanks!
>
> Best regards,
> Sandro
>
> _______________________________________________
> Gecode users mailing list
> users at gecode.org
> https://www.gecode.org/mailman/listinfo/gecode-users
>
More information about the users
mailing list


Before Change
depends_on = ["digest", "freq_data.ind_low", "freq_data.ind_high"],
)
traits_view = View(
[
[Item("mpos{}", style="custom")],
[Item("grid", style="custom"), "-<>"],
[Item("r_diag", label="Diagonal removed")],
[Item("c", label="Speed of sound")],
[Item("env{}", style="custom")],
"|"
],
title="Beamformer options",
After Change
c = Property(desc="speed of sound")
// Dummy property for Backward compatibility. See :attr:`~acoular.fbeamform.SteeringVector.steer_type` for information.
steer = Property(desc="type of steering vectors used")
// Dummy property for Backward compatibility. See :attr:`~acoular.fbeamform.SteeringVector.env` for information.
env = Property()


Module: ActionDispatch::Http::MimeNegotiation
| Relationships & Source Files | |
| Extension / Inclusion / Inheritance Descendants | |
|
Included In:
| |
| Super Chains via Extension / Inclusion / Inheritance | |
|
Class Chain:
self,
::ActiveSupport::Concern
|
|
| Defined in: | actionpack/lib/action_dispatch/http/mime_negotiation.rb |
Constant Summary
-
BROWSER_LIKE_ACCEPTS =
# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 156/,\s*\*\/\*|\*\/\*\s*,/
Class Method Summary
::ActiveSupport::Concern
- Extended
Instance Attribute Summary
- #formats rw
-
#formats=(extensions)
rw
Sets the formats by string extensions.
- #variant rw
-
#variant=(variant)
rw
Sets the variant for template.
Instance Method Summary
-
#accepts
Returns the accepted MIME type for the request.
-
#content_mime_type
The MIME type of the HTTP request, such as Mime.
- #content_type
-
#format(view_path = [])
Returns the MIME type for the format used in the request.
-
#format=(extension)
Sets the format by string extension, which can be used to force custom formats that are not controlled by the extension.
-
#negotiate_mime(order)
Returns the first MIME type that matches the provided array of MIME types.
- #format_from_path_extension private
- #use_accept_header private
- #valid_accept_header private
DSL Calls
included
[ GitHub ]10 11 12
# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 10
included do mattr_accessor :ignore_accept_header, default: false end
Instance Attribute Details
#formats (rw)
[ GitHub ]# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 58
def formats fetch_header("action_dispatch.request.formats") do |k| params_readable = begin parameters[:format] rescue ActionController::BadRequest false end v = if params_readable Array(Mime[parameters[:format]]) elsif use_accept_header && valid_accept_header accepts elsif extension_format = format_from_path_extension [extension_format] elsif xhr? [Mime[:js]] else [Mime[:html]] end v = v.select do |format| format.symbol || format.ref == "*/*" end set_header k, v end end
#formats=(extensions) (rw)
Sets the formats by string extensions. This differs from #format= by allowing you to set multiple, ordered formats, which is useful when you want to have a fallback.
In this example, the :iphone
format will be used if it’s available, otherwise it’ll fallback to the :html
format.
class ApplicationController < ActionController::Base
before_action :adjust_format_for_iphone_with_html_fallback
private
def adjust_format_for_iphone_with_html_fallback
request.formats = [ :iphone, :html ] if request.env["HTTP_USER_AGENT"][/iPhone/]
end
end
# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 134
def formats=(extensions) parameters[:format] = extensions.first.to_s set_header "action_dispatch.request.formats", extensions.collect { |extension| Mime::Type.lookup_by_extension(extension) } end
#variant (rw)
[ GitHub ]# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 100
def variant @variant ||= ActiveSupport::ArrayInquirer.new end
#variant=(variant) (rw)
Sets the variant for template.
# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 87
def variant=(variant) variant = Array(variant) if variant.all? { |v| v.is_a?(Symbol) } @variant = ActiveSupport::ArrayInquirer.new(variant) else raise ArgumentError, "request.variant must be set to a Symbol or an Array of Symbols. " \ "For security reasons, never directly set the variant to a user-provided value, " \ "like params[:variant].to_sym. Check user-provided value against a whitelist first, " \ "then set the variant: request.variant = :tablet if params[:variant] == 'tablet'" end end
Instance Method Details
#accepts
Returns the accepted MIME type for the request.
# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 35
def accepts fetch_header("action_dispatch.request.accepts") do |k| header = get_header("HTTP_ACCEPT").to_s.strip v = if header.empty? [content_mime_type] else Mime::Type.parse(header) end set_header k, v end end
#content_mime_type
The MIME type of the HTTP request, such as Mime.
#content_type
[ GitHub ]# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 26
def content_type content_mime_type && content_mime_type.to_s end
#format(view_path = [])
Returns the MIME type for the format used in the request.
GET /posts/5.xml | request.format => Mime[:xml]
GET /posts/5.xhtml | request.format => Mime[:html]
GET /posts/5 | request.format => Mime[:html] or Mime[:js], or request.accepts.first
#format=(extension)
Sets the format by string extension, which can be used to force custom formats that are not controlled by the extension.
class ApplicationController < ActionController::Base
before_action :adjust_format_for_iphone
private
def adjust_format_for_iphone
request.format = :iphone if request.env["HTTP_USER_AGENT"][/iPhone/]
end
end
# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 115
def format=(extension) parameters[:format] = extension.to_s set_header "action_dispatch.request.formats", [Mime::Type.lookup_by_extension(parameters[:format])] end
#format_from_path_extension (private)
[ GitHub ]# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 167
def format_from_path_extension # :doc: path = get_header("action_dispatch.original_path") || get_header("PATH_INFO") if match = path && path.match(/\.(\w+)\z/) Mime[match.captures.first] end end
#negotiate_mime(order)
Returns the first MIME type that matches the provided array of MIME types.
#use_accept_header (private)
[ GitHub ]# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 163
def use_accept_header # :doc: !self.class.ignore_accept_header end
#valid_accept_header (private)
[ GitHub ]# File 'actionpack/lib/action_dispatch/http/mime_negotiation.rb', line 158
def valid_accept_header # :doc: (xhr? && (accept.present? || content_mime_type)) || (accept.present? && accept !~ BROWSER_LIKE_ACCEPTS) end


Armagh lorry driver accused over deaths of 39 migrants admits illegal immigration charge
A lorry driver accused over the deaths of 39 migrants has pleaded guilty to plotting to assist illegal immigration.

The bodies of eight females and 31 males were discovered in the trailer attached to his Scania cab in an industrial park in Grays, Essex, early on October 23.
The victims were later identified as coming from various provinces of Vietnam, with the youngest being two boys aged 15.
Robinson, who is known as Mo, appeared at the Old Bailey via video link from Belmarsh prison for a plea hearing.
Wearing a light blue sweater and tan trousers, he spoke to confirm his identity and British nationality.
During the hearing before Mr Justice Edis, he admitted conspiracy to assist unlawful immigration between May 1 2018 and October 24 2019.
The charge states that he plotted with others to do “an act or series of acts which facilitated the commission of a breach of immigration law by various persons”.
He also admitted acquiring criminal property – namely cash – on the same dates.
The defendant, of Laurel Drive in Craigavon in Northern Ireland, was not asked to enter pleas to other charges, including 39 counts of manslaughter.
He is charged with conspiracy to commit human trafficking offences between May 1 2018 and October 24 2019.
The details of that charge state that he “arranged or facilitated the travel of other persons into the UK with a view to their being exploited”.
He is also charged with transferring criminal property.
The defendant was remanded into custody until a further hearing on December 13.


For more information about graph partitioning, see ParMetis.
Scotch is a library for ordering and partitioning, developed at LaBRI in Bordeaux, France. PT-Scotch is the parallel module in Scotch. (We use the name PT-Scotch when it applies only to parallel version, Scotch when it concerns at least the serial version.) Scotch is a third-party library in Zoltan and should be obtained separately from the Scotch web site. Currently, Zoltan supports version 5.1 of Scotch, compiled with the support of PT-Scotch and int coding for vertices, not long (on architectures where sizeof(int) != sizeof(long)).
If the parameter SCOTCH_TYPE is set to LOCAL and the number of processors is 1 (e.g., mpirun -np 1), the sequential version of Scotch is called.
Both the serial (Scotch) and the parallel (PT-Scotch) compute k-way partitioning by doing recursive bisection.
Scotch must be used in the context LB_APPROACH=partition, to balance poorly distributed data. Unlike ParMetis, Scotch doesn't support the multiconstraint partitioning feature. However, for single constraint partitioning it seems to produce better results than ParMetis although it requires less memory.
| Value of LB_METHOD: | GRAPH |
| Value of GRAPH_PACKAGE: | Scotch |
| Parameters: | |
| LB_APPROACH |
The load balancing approach:. PARTITION - partition from scratch, not taking the current data distribution into account |
| SCOTCH_METHOD | For now, always set to RBISECT |
| SCOTCH_STRAT | The Scotch strategy string; see the Scotch documentation. |
| SCOTCH_STRAT_FILE | A file that contains an arbitrary long Scotch strategy string; see the Scotch documentation. |
| SCOTCH_TYPE | Whether or not the parallel library is used. The default value is GLOBAL and if not set to LOCAL, the parallel graph partitioning is used. |
| CHECK_GRAPH | Level of error checking for graph input: 0 = no checking, 1 = on-processor checking, 2 = full checking. (CHECK_GRAPH==2 is very slow and should be used only during debugging). |
| SCATTER_GRAPH | Scatter graph data by distributing contiguous chunks of objects (vertices) of roughly equal size to each processor before calling the partitioner. 0 = don't scatter; 1 = scatter only if all objects are on a single processor; 2 = scatter if at least one processor owns no objects; 3 = always scatter. |
| GRAPH_SYMMETRIZE | How to symmetrize the graph:
NONE = graph is symmetric and no symmetrization is needed TRANSPOSE = if M is adjacency matrix of the input graph, output will be the graph representation of M+MT BIPARTITE = graph is symmetrized in a bipartite way : [[ 0 M ][Mt 0]] |
| GRAPH_SYM_WEIGHT | How edge weights are handled during symmetrization:
ADD = weights of each arc are added MAX = only the heaviest arc weight is kept See more informations about graph build options on this page |
| Default values: | |
| LB_APPROACH = Partition | |
| SCOTCH_METHOD = RBISECT | |
| SCOTCH_STRAT = "" (default Scotch strategy) | |
| SCOTCH_STRAT_FILE = "" (default Scotch strategy) | |
| CHECK_GRAPH = 1 | |
| SCATTER_GRAPH = 1 | |
| GRAPH_SYMMETRIZE = NONE | |
| GRAPH_SYM_WEIGHT = ADD | |
| Required Query Functions: | |
| ZOLTAN_NUM_OBJ_FN | |
| ZOLTAN_OBJ_LIST_FN | |
|
ZOLTAN_NUM_EDGES_MULTI_F
N or
ZOLTAN_NUM_EDGES_FN
ZOLTAN_EDGE_LIST_MULTI_F N or ZOLTAN_EDGE_LIST_FN |


17th January 2015
We have changed tack and started learning Javascript this week.
1. Looping in Ruby
So, if we have a simple array, we can loop through it using the Ruby enumerable each merely telling it to take each item in the array and add it to our sum. Yields the result 6.
my_array = [1,2,3]
sum = 0
my_array.each { |x| sum +=x }
p sum //6
2. Looping in Javascript
In contrast, javascript does not have an each builtin method (underscore is a library that can access an each function - but it is not built-in). In order to loop through the array we need to tell the interpreter 2 key things: 1. To create a variable "i", start at 0, continue looping through to the array til the final index (i < array.length) and continue going upwards through the array items by increasing index (i++). 2. We then need to tell it to add each item in the array (my_array[i]) to the result variable. This too yields our simple result of 6. But with a bit more work and typing !!
var my_array = [1,2,3];
var result = 0;
for(var i=0; i < my_array.length; i++) {result += my_array[i];}
console.log(result); //6


Bases: horizon.forms.views.ModalBackdropMixin, django.views.generic.base.TemplateView
A generic class-based view which handles the intricacies of workflow processing with minimal user configuration.
The template to use when rendering this view via standard HTTP requests. Required.
The template to use when rendering the workflow for AJAX requests. In general the default common template should be used. Defaults to "horizon/common/_workflow.html".
The key which should be used for the workflow object in the template context. Defaults to "workflow".
Handler for HTTP GET requests.
Returns the template context, including the workflow class.
This method should be overridden in subclasses to provide additional context data to the template.
Returns initial data for the workflow. Defaults to using the GET parameters to allow pre-seeding of the workflow context values.
returns classes for the workflow element in template based on the workflow characteristics
Returns the template name to use for this request.
Returns the instantiated workflow class.
Handler for HTTP POST requests.
Validates the workflow steps from start to end, inclusive.
Returns a dict describing the validation state of the workflow.


Welcome to Moon Bootz!
The coolest boots!
Original photo
by Prat PR. Licensing information
here
.
Contact
Product Details
Legal Stuff


|
Mister Spex
1.0
The project Mister Spex is a funny tool to capture images and display them with overlays such as glasses or big red lips over the normal human face. All images can be saved or recorded. Within this software you have three different mode to get the images (LiveView via webcam, Static image and a playback of a recorded video).
|
Video class which cpatures an image from a webcam or specific device. More...
#include <VideoThread.h>
Public Member Functions | |
| VideoThread (VideoImageBuffer *videoImageBuffer, int deviceNumber, bool dropFrameIfBufferFull) | |
| Thread constructor class. More... | |
| void | stop () |
| Set stop flag for thread worker. | |
| bool | connectToCamera () |
| Function to create a camera connection. More... | |
| bool | disconnectCamera () |
| Function to disconnect a camera connection. More... | |
| bool | isCameraConnected () |
| Function to check if a camera is connected. More... | |
| int | getInputSourceWidth () |
| Function to get the camera input width of an image. More... | |
| int | getInputSourceHeight () |
| Function to get the camera input height of an image. More... | |
Protected Member Functions | |
| void | run () |
| Thread function which runs till doStop is set to true. More... | |
Private Attributes | |
| VideoImageBuffer * | videoImageBuffer |
| VideoImageBuffer. More... | |
| VideoCapture | cap |
| VideoCapture. More... | |
| Mat | grabbedFrame |
| Mat image. More... | |
| QMutex | doStopMutex |
| QMutex. More... | |
| volatile bool | doStop |
| Bool. More... | |
| int | deviceNumber |
| Integer. More... | |
| bool | dropFrameIfBufferFull |
| Bool. More... | |
Video class which cpatures an image from a webcam or specific device.
Thread to capture images.
| VideoThread::VideoThread | ( | VideoImageBuffer * | videoImageBuffer, |
| int | deviceNumber, | ||
| bool | dropFrameIfBufferFull | ||
| ) |
Thread constructor class.
| videoImageBuffer | pointer to a buffer which contains the captured images. |
| deviceNumber | an integer argument. |
| dropFrameIfBufferFull | a bool value to set if images shall be dropped when the buffer is full. |
| bool VideoThread::connectToCamera | ( | ) |
Function to create a camera connection.
| bool VideoThread::disconnectCamera | ( | ) |
Function to disconnect a camera connection.
| int VideoThread::getInputSourceHeight | ( | ) |
Function to get the camera input height of an image.
| int VideoThread::getInputSourceWidth | ( | ) |
Function to get the camera input width of an image.
| bool VideoThread::isCameraConnected | ( | ) |
Function to check if a camera is connected.
|
protected |
Thread function which runs till doStop is set to true.
To function is the worker of the thread. It does all the calls to detection functions and emits new images.
|
private |
VideoCapture.
Variable to store the camera connection. From OpenCV lib.
|
private |
Integer.
Integer value for device number.
|
private |
Bool.
Boolean value to stop the thread.
|
private |
QMutex.
Mutex to stop the thread.
|
private |
Bool.
Boolean value if a frame shall be dropped when the buffer is full.
|
private |
Mat image.
Grabbed frame from input source.
|
private |
Pointer to buffer which contains the images.


Hayashi Source: Christensen, L., and W. Greene, 1976, "Economies of Scale in U.S. Electric Power Generation," Journal of Political Economy, 84, 655476.
data('greene')
A data.frame with 99 observations on 9 variables:
firm_id: The firm ID (row number) from Nerlove's 1955 sample
total_cost: total cost in 1970 of supply in millions of dollars
output: in billions of kilowatt hours
labor_price: the price of labor
fuel_price: the price of fuels
capital_price: the price of capital
capital_share: capital's cost share
labor_share: labor's cost share
fuel_share: fuel's cost share
https://sites.google.com/site/fumiohayashi/hayashi-econometrics/data-for-empirical
A cross-sectional data set on 99 firms in the year 1970 with data on total costs, factor prices (the wage rate, the price of fuel, and the rental price of capital), cost shares and output of power plants
Used in Chapter 4.7 and the Empirical Exercise of Chapter 4.
str(greene)#> Classes ‘tbl_df’, ‘tbl’ and 'data.frame': 99 obs. of 9 variables: #> $ firm_id : num 1 20 17 14 28 22 16 15 27 30 ... #> $ total_cost : num 0.213 0.489 0.616 0.761 0.636 ... #> $ output : num 8 14 50 65 67 90 183 295 374 378 ... #> $ price_labor : num 6869 5439 9204 8972 6696 ... #> $ price_capital: num 64.9 86.1 90.5 41.2 58.3 ... #> $ price_fuel : num 18 34.1 32.1 28.5 25.4 ... #> $ labor_share : num 0.329 0.299 0.296 0.28 0.245 ... #> $ capital_share: num 0.4197 0.4571 0.0981 0.1282 0.3674 ... #> $ fuel_share : num 0.251 0.243 0.606 0.592 0.388 ...


How to Change How You Talk to (and See) Yourself
How you communicate with yourself and others shapes your worldview, attitudes, and behaviors.
by Benjamin Hardy, Ph.D.Everything you see and feel is based on communication. That communication could be thoughts, feelings, or words.
Communication takes you in a direction. It directs your thinking and actions.
Right now, you're making decisions in your life based on some form of communication.
It could be based on a feeling you had, such as a traumatic experience years ago, which created a story in your mind.
Your job as an intelligent human being is to be mindful and intentional about the communication you use, both to yourself and others.
You can manipulate and change the story, and its inherent meaning, of who you are and why you're that person.
You can also change the story about who you're going to be. Psychologists have already found that it's wise for decision-making to consider your current and future self as two different people.
 It's fundamental to getting the results you want in life.
I recently read the book Average Sucks, by communication expert Michael Bernoff, who is the founder and president of the Human Communications Institute. I got a lot of helpful ideas about my own communication from that book.
In this brief article, I will share just a few of the insights I got from Average Sucks:
1. When Creating a Desired Mental Visualization, Put Yourself in First Person
Think about something you really want. It could be having a million dollars, a successful company, a happy family, a bestselling book.
Imagine yourself in that future.
Do you see yourself there?
According to Bernoff, when most people are imagining a desired future, they often don't actually see themselves in that visualization. They may see family and friends. But they don't see themselves.
If they do see themselves, they often see themselves from the second person, as though they are looking at a different person from the outside.
Instead of seeing yourself from the outside, you want to put yourself in the first person, walking through the experience.
"I'm going to do this."
You need to genuinely see and feel yourself having the experience.
This is you.
This is your reality.
2. Avoid First Person Thinking and Communicating About Stuff You Want to Put in the Past
According to Bernoff, when people have attached themselves to a particular identity, they continue to speak as though something is still happening, even when it's not.
Think about someone who hasn't had a sip of alcohol for a decade but continues to call himself an alcoholic.
When detaching yourself from a negative behavior or former identity, you do the opposite of what you do when creating an identity. Rather than being in the first person in your communication and visualization, you put yourself in the second person, and make the language past-focused and externalized.
For example, rather than saying, "I'm an alcoholic," you'd say, "I was an alcoholic because [fill in the blank]..."
"I'm not an alcoholic anymore because of [fill in the blank]"
You're not THAT person anymore. Again, psychology research shows that, as a person, you're going to change, and actually have changed a lot in the past 10 years.
The problem is that your communication hasn't changed. You've changed, but you keep telling yourself the same story in your head, thus locking yourself into unnecessary and limiting behavior and emotion patterns.
3. Get Yourself Into a Peak State and Change Your Language
The opposite of the peak experience--sudden depression, fatigue, even the "panic fear" that swept William James to the edge of insanity--is the outcome of passivity. This cannot be overemphasized. Depression--or neurosis--need not have a positive cause (childhood traumas, etc.). It is the natural outcome of negative passivity. The peak experience is the outcome of an intentional attitude. 'Feedback' from my activities depends upon the degree of deliberately calculated purpose I put into them. ―Colin Wilson
You get yourself into a peak state by feeling positive emotion. While feeling great and expecting good things, you intentionally communicate with yourself.
- "I'm going to do this."
- "I'm going to succeed."
- "I was born for this."
- "I'm not that person anymore."
Creating a new language pattern only takes a second, but it changes everything about your identity and behavior.
I realized while reading Average Sucks that my language around a specific and highly important goal of mine was negative. It wasn't exactly negative, but it wasn't as emotionally positive and clear as it could be.
Moreover, I had lots of baggage around my story of that goal that got in the way of my effectively communicating my goal to other people.
Bernoff helped me realize that I needed to focus on the bigger picture "why" of my goals than to focus on the specifics.
Why do I really want this?
Explain the"why," don't necessarily justify or explain your "how."
That was super helpful for me because when explaining my goals, I was focused on particular outcomes that enabled my deeper why. But in explaining the outcomes I wanted, whether making more money or selling more books, I felt the need to justify why that was my goal.
This created negative emotional patterns and unclear communication.
Instead, when I stopped telling people what I was doing and instead explained my deeper "why," in my case, that I loved helping and supporting young men at a pivotal age in their lives, because I had supportive mentors who helped me when my life was a mess as teenager, then no one questions you. Instead, they support you.
I also realized that when visualizing my big goals, I always saw myself in the second person or not in the picture. I'm now in the driver seat.
I'm not afraid to tell my story anymore.
I'm focused on my "why."
"I'm going to do this."
I feel incredible about it.
Conclusion
How you communicate with yourself and others shapes your worldview, attitudes, and behaviors.
You can intentionally change behavior patterns by first changing communication patterns.
What is your story?
What would happen if you changed that story?
What would happen if you put the past in the past?
What would happen if you put the future in the present?
What would happen if you were intentional about how you saw yourself, spoke to yourself, and spoke to others?